Abstract: An action framework system provides context-based actions in association with a source application. The source application detects selection of a content element presented by the source application. The content element is associated with an application identifier identifying a target application and an action identifier identifying an operation to be executed by the target application on the content element. The target application identified by the application identifier is executed to perform the operation identified by the action identifier on the content element, responsive to detection of the selection of the content element. In one implementation, the source application is a search feature providing different contexts of search results (e.g., from a local file system search, a local application content search, a Web search, a remote application content search).

Abstract: Data-manipulation-language statements can target data in data store of a data storage system. Data manipulations specified in a statement, including in-place manipulations, can be recorded and maintained. Application of data manipulations to the store can be avoided or potentially initiated at a later time. Prior to application of the data manipulations to the data store, queries over data in the data store can be processed in view of the recorded data manipulations and data acquired from the data store, such that the data manipulations are reflected in the data acquired from the data store.

Abstract: Aspects of the disclosure relate to Network Common Data Form (NetCDF) data management using a shared pool of configurable computing resources. A processing engine may be built to access a set of NetCDF data. The processing engine may be built by compiling a data frame software framework and compiling a Java library software framework. The set of NetCDF data may be received by the processing engine. A set of established data derived from the set of NetCDF data may be established using the processing engine. A set of operations on the set of established data may be processed. The processing may occur in a distributed fashion using the shared pool of configurable computing resources and the processing engine.

Abstract: A method for flushing data in a virtual computing environment is provided. The method includes writing application output from an application spanning one or more virtual machines to a cache, wherein each virtual machine is implemented using one or more compute nodes and the cache is implemented in storage associated with the one or more compute nodes. In an effort to flush data associated with application writes more efficiently from the cache to a local backing store or one or more data nodes, the method may include generating a mapping of each of the plurality of application writes. The method may further include sorting sets of one or more virtual disks based upon an offset of each application write as indicated in the mapping. In addition, a storage virtualizer may cancel duplicate application writes, merge multiple contiguous application writes, and merge multiple epochs prior to flushing the data.

Abstract: A document relationship analysis system. Aspects of the system include ingesting, discovering, recommending, analyzing, and exporting documents of interest. The system dynamically searches large or streaming datasets using a tiered, multi-step approach that includes discovery techniques and recommender components to filter and refine these larger datasets to smaller datasets of documents of interest. The system dynamically selects and renders an appropriate visualization for result datasets based on predetermined measures that allow for facilitate analysis of the documents of interest.

Abstract: An unsupervised keyword extraction process is disclosed. A single input document can be analyzed to identify multiple candidate keywords by utilizing splitting terms. A keyword score is calculated for each of the candidate keywords. The keyword score for a particular candidate keyword is determined based on the length of the candidate keywords that contain the candidate keyword and the frequency of the words appearing in the candidate keywords. One or more keywords having the highest keyword scores are selected as the extracted keywords. The extracted keywords can be used in applications, such as refining search results, providing suggested search terms, or improving the match rate of a network page at a search engine.

Abstract: Described herein is a framework for providing data model views with complex calculation capability. In accordance with one aspect, the framework receives a request to calculate target results. An object in an application layer may be invoked to perform complex calculation to generate intermediate results. The intermediate results are stored in a global temporary table. A data model view in a database layer may then be invoked to calculate the target results based on the intermediate results retrieved from the global temporary table. The calculated target results are then returned.

Abstract: Methods and apparatus for detecting anomalies in electronic data are described. An example apparatus includes a signature generator to generate a signature of context information for electronic transactions and to query a memorybase of previously received electronic transactions to identify a first entity associated with a subset of historical transactions that are associated with the signature, a neighborhood generator to query the memorybase to generate a neighborhood for the first entity, a target category identifier to determine a target category value for entities included in the neighborhood, and an anomaly detector to determine a score for the first entity based on the target category value and to present an alert indicating that the first entity is anomalous based on the score.

Abstract: In an example, one or more processes that transform data originating in one or more of a plurality of different data sources are identified. Then, for each of the identified one or more processes, a relationship table is created, the relationship table listing objects input to the process, objects output from the process, and one or more mappings defining transformations performed on the objects input to the process to produce the objects output from the process. Dependencies are created between relationship tables by linking at least an instance of a first object input to a process in a first relationship table with at least an instance of the first object output from a process in a second relationship table. Lineage of an object in the computer system is traced by accessing one or more of the relationship tables and the dependencies.

Abstract: This application discloses to methods, circuits, devices, assemblies and systems for generating a searchable real-scene database including records indicating entities and physical events occurring within the real-scene. The said system may include a camera feed interface to receive a camera feed from each of one or more cameras observing the real-scene. It may also include image processing circuitry including a static scene analysis unit to: (a) extract features of entities appearing in a camera feed, (b) recognize entity types of entities appearing in the one or more camera feeds, (c) assign an entity designator to a specific entity appearing in the camera feeds, (d) generate an entity designator record for a uniquely identifiable entity, and generate an attribute record for a uniquely identifiable entity.

Abstract: Some embodiments provide a non-transitory machine-readable medium that stores a program. The program receives a query for data from a dataset stored in at least one database instance in a plurality of database instances. The program further determines a set of candidate database instances in the plurality of database instances that stores the dataset. The program also selects a database instance in the set of candidate database instances based on a set of metrics associated with the set of candidate database instances. The program further processes the query using the selected database instance.

Abstract: A process for numbering flowchart elements populates a graphical display with a collection of flowchart elements and ranks the flowchart elements based on the flowchart elements' geometric location. The process separates the elements into ranked branches and trees, and numbers each element according to the chart element's position within the branches and trees, relative to the other chart elements.

Abstract: In a datacenter setting, annotations or descriptions of relevant parts or subgraphs corresponding to components in the datacenter are predicted. Given a set of training data (library of subgraphs seen in the past labeled with a textual description explaining why were they considered relevant enough to be placed in the historical database), the recurrent neural network (RNN) learns how to combine the different textual annotations coming from each relevant region into a single annotation that describes the whole system. Accordingly, given a set of input or test data (datacenter state modeled a context graph that is not annotated), the system determines which regions of the input graph are more relevant, and for each of these regions, the RNN predicts an annotation even in a previously unseen or different datacenter infrastructure.

Abstract: Applications and users can be restricted from making persistent changes to artifacts on a protected volume. In Windows-based systems that include a file-based write filter, a policy-based write filter can be positioned below the file-based write filter and can examine any write requests that target artifacts of a protected volume and are not redirected by the file-based write filter. The policy-based write filter can examine the write requests against any applicable policies to determine whether the write requests should be allowed to proceed. If the policy-based write filter determines that a write request is not allowed by policy, it can fail the write request to thereby prevent the targeted artifact from being updated in the protected volume.

Abstract: Disclosed is a system and method for collecting, processing and aggregating satellite imagery with large volumes of other digitized data for analysis by a human user in order to identify geographic areas for further data collection and/or analysis. More particularly, the invention relates to identifying geographic subjects for satellite image acquisition by aggregating and analyzing first-time changes detected by satellite imagery as well as weather report data, social media streams and newswire feeds. An analytics engine uses rules to qualify, flag and correlate asynchronous data from a plurality of sources with changes on the earth's surface, and catalogs and stores the qualified and correlated data where it may be queried and used to prepare reports or recommendations for future satellite image acquisition targets.

Abstract: Approaches for facilitating queries of a topic-based-source-specific search system are disclosed. In certain implementations, an input relating to a query may be received. Suggested ones of predefined sources and suggested ones of information items of the predefined sources may be determined based on the input. A set of suggestions including a group of suggestions relating to the suggested sources and a group of suggestions relating to the suggested information items may be provided for presentation on a user interface. In some implementations, metadata that indicates first, second, or other attributes relating to the predefined sources or the information items may be stored in association with the predefined sources or the information items. A second input relating to the query may be received responsive to providing the set of suggestions. A presentation of a comparison between the first attribute and the second attribute may be provided based on the second input.

Abstract: Embodiments of the present disclosure relate to a method and apparatus for locking a file in a memory. The method comprises enabling a thread to obtain a mixed lock of a file. The method further comprises, in response to enabling the thread to obtain the mixed lock, enabling a further thread to obtain a shared lock of the file, and prevent the further thread from obtaining the exclusive lock or mixed lock of the file. By adding a new mixed lock to a traditional read and write lock, embodiments of the present disclosure improve concurrent access performance of the file system.

Abstract: The method for test data management may comprise receiving a test data characteristic; retrieving a master copy data from a master copy database; generating a secondary copy data, wherein the secondary copy data comprises a subset of the master copy data corresponding to the test data characteristic; generating a test copy data, wherein the test copy data is a copy of the secondary copy data; and transmitting the test copy data to a test environment. In this manner, the efficiency and resiliency of the system may be enhanced, and the test copy data may be improved so that the network may function according to approved parameters.

Abstract: This document describes a data processing system for database management. The system includes a registry management server in communication with a logical registry in a data repository. The data repository includes profile data associated with profile objects, a library of electronic instruments and a logical table including a number of logical rows corresponding to the profile objects. The registry management receives profile data from a client device, selects electronic instruments from the library, and maps the electronic instruments and profile objects by updating the logical table and indexing the logical table.

Abstract: In one embodiment, a method includes, receiving, from a client system of a user, a search query including n-grams. The method includes associating each n-gram with verticals based on an analysis of the n-grams by language models. The method includes determining, for each n-gram, if a bloom filter for a vertical associated with the n-gram indicates, based on sub-bloom filters of the bloom filter, the n-gram does exist or does not exist in a set of object names associated with the vertical. Each sub-bloom filter is associated with a subset of the set of object names and indicates the n-gram does exist or does not exist in its subset of object names. The method includes sending, to the client system, an indication that an n-gram of the n-grams is misspelled if a bloom filter indicates the n-gram does not exist in the set of object names associated with the vertical.