Abstract: Disclosed herein are systems, methods, and software for enhancing error detection in data synchronization operations. In an implementation, log data reported by a device is received and incorporated into an event database indicating interleaved events related to data synchronization threads on the device. The event database is queried to extract a listing of events in the event database, the listing of events comprising events potentially associated with at least one error condition in the data synchronization threads. The listing of events is processed to identify one or more patterns from among the interleaved events that indicate the at least one error condition in the data synchronization threads. Responsive to identifying the one or more patterns, an indication of the at least one error condition in the data synchronization threads is communicated.

Abstract: A catalog taxonomy organized in a tree-like configuration including at least one first tier product category having at least one first tier attribute associated with products in the first tier category, and a plurality of second tier product categories branching from the first tier product category and defining subcategories, at least one of the plurality of second tier product categories having a second tier attribute associated with products in a subcategory defined by the plurality of second tier product categories, wherein each of the second tier product categories inherits the first tier attribute of the first tier product category from which the plurality of second tier product categories branches. In addition, a system and method utilizing such catalog taxonomy.

Abstract: According to various embodiments, aspects of the invention provide a highly efficient meta-analysis infrastructure for performing research queries across a large number of studies and experiments from diverse sequencing technologies as well as different biological and chemical assays, data types and organisms, as well as systems to build and add to such an infrastructure. The methods, systems and apparatuses described enable combining orthogonal types of data and available public knowledge to elucidate mechanisms governing normal development, disease progression, as well as susceptibility of individuals to disease or response to drug treatments.

Abstract: Embodiments of the present invention relate to systems, methods, and computer storage media for geographically organizing the storage of data and hosted services in a distributed computing environment. An allocation constraint is utilized to identify and select a geo-region in which an affinity group that is comprised of a hosted service and/or data is to be physically stored. Additionally, a geo-domain within the geo-region is identified for hosting the hosted service and/or data of the affinity group. A stamp, such as a storage stamp or a computation stamp, is identified on the geo-domain for storing the hosted service and/or the data. The hosted service is stored in an identified computation stamp and the data is stored in an identified storage stamp. In an additional exemplary embodiment, the identification of a geo-domain involves analyzing resource information related to potential geo-domains within a geo-region.

Abstract: Embodiments are directed to presenting virtual machine backup files for instant restore by creating a virtual volume on a local machine with files that emulate remote VM files, and setting up kernel mode interceptor hook system object and the user mode process for I/O redirection. The virtual volume created and the file extents table is passed as an input to the user mode process. The user mode process waits for events triggered by the kernel mode driver object. If the I/O is within defined file boundaries, the file is converted to relative extents and read from the remote storage node. Write requests are automatically accomplished by attaching a differencing disk created on the local machine to the last known incremental file and performing a native OS mount of that file.

Abstract: A system is provided that carries out object traversal in a product lifecycle management system. The system may process a received set of traversal rules in a determined precedence order for a received list of input objects to recursively acquire from a data store a list of child objects related to the input objects based on the traversal rules. The traversal rules may be processed in the precedence order determined based at least in part on a number of parent types in a hierarchical arrangement that specifies relationships between object types for a source type of object specified by each respective traversal rule. For each respective traversal rule, a set based query may be carried out on the data store to determine child objects for the input objects having one of a type or a parent type corresponding to the source type associated with the respective traversal rule.

Abstract: A new method of customized retrieval and presentation of information from a relational database is disclosed. The customization is achieved by modifying a first application for retrieval and presentation of information from a database in accordance with input provided by the user, at the time when the execution of the first application is requested by the user. The user input is solicited and gathered by a second application associated with the first application. After the user input is completed, the second application generates a script which modifies the first application. The modified first application is then executed and the requested information is retrieved and presented to the user in the form customized by the user input.

Abstract: According to an embodiment, a search device includes a first storage to store therein a keyword group generated by grouping keyword candidates which are to be candidates for a search keyword according to a rule set in advance; a first acquisition unit to acquire a first recommended keyword which is the keyword candidate partially including an input string not yet been entered; a second acquisition unit to acquire a second recommended keyword which is included in the keyword group to which the first recommended keyword belongs and which is the keyword candidate other than the first recommended keyword; an output unit to output a search screen for displaying the first recommended keyword and the second recommended keyword in a selectable way; and a search unit to perform a search with the first recommended keyword or the second recommended keyword selected on the search screen as the search keyword.

Abstract: A computer implemented method of analyzing and graphically representing the correlation of a plurality of transaction items, the method comprising the steps of: retrieving data associated with groups of the transaction items, correlating a plurality of groups of transaction items in a dimensionally reduced manner, creating a tree hierarchy which classifies the groups of transaction items in a hierarchy according to a defined user understandable factor, wherein the tree hierarchy is linked to the groups of transaction items, and graphically representing the correlated groups of transaction items and tree hierarchy to enable interaction between the correlated groups of transaction items and the linked tree hierarchy.

Abstract: Selection of content for sharing is described. An indication of desired content to be shared between a first database and a second database is sent from the first database to the second database. The first database receives desired content corresponding to the indication and a relevancy determination corresponding to a threshold fraction of users that tag the desired content to a particular category. A first version of the desired content is identified in the first database. A second version of the desired content is received by the first database from the second database upon an identification, at the second database, of the second version of the desired content.

Abstract: In an approach to faceted classification, a computer receives a search query. The computer creates a first table of facet value ranges, based on the search query. The computer fetches a first search result corresponding to the search query. The computer retrieves a first facet value associated with the first search result. The computer maps the first facet value to a first facet value range. The computer determines whether the first facet value range is in the first table of facet value ranges. The computer inserts the first facet value range into the first table of facet value ranges. The computer determines whether a number of facet value ranges in the first table of facet value ranges is below a pre-defined threshold. The computer creates a second table of facet value ranges. The computer identifies a second facet value range that includes the first facet value range.

Abstract: Each of a plurality of Worker processes are allowed to perform any and all of the following tasks involving logged work items: (1) reading a subset of the work items from a log; (2) sequentially ordering work items for corresponding data objects; (3) applying a sequentially ordered set of work items to a corresponding data object; and (4) transmitting a subset of work items to a Worker process running on another database server in a cluster, if necessary. These tasks can be performed concurrently, at will, and as available, by the Worker processes. An improved checkpointing technique eliminates the need for the Worker processes to get to a synchronization point and stop. Instead, a Coordinator process examines the current state of progress of the Worker processes and computes a past point in the sequence of work items at which all work items before that point have been completely processed, and records this point as the checkpoint.

Abstract: A system and methods for classification of events, the system including a memory, a network interface, and a processor configured to monitor system events via the network interface and store the system events as an event log in the memory, collect information about events from various web resources, extract, from the event log and the collected event information, labeling data including data about urgency of events and generate, based on the extracted labeling data, labeling data structures ascribing labels to respective events, extract, from the event log and the collected event information, event features data and generate, based on the extracted event features data, event features data structures ascribing features to respective events, and formulate decision rule structures for identification of urgent events based on the labeling data structures and the event features data structures.

Abstract: An electronic exchange computing system is provided that includes a computer storage system, at least one transceiver, and a processing system. The storage system stores an electronic order book. The transceiver receives data transaction requests and transmits messages of an electronic data feed. The processing system determines that a first order has priority and generates a new order ID for the first order. The first order is maintained in the electronic order book (e.g., with a quantity of 0). Additional order instructions are received from a client computer system and are associated with the first order. A match is found based on the additional order instructions. A data feed update message is generated and transmitted as part of a real-time data feed and includes the newly generated order ID for the first order.

Abstract: Methods, systems, and computer readable mediums for performing a free-form query are disclosed. According to one exemplary embodiment, a method for performing a free-form query includes receiving free-form information for requesting information about a computing system, converting the free-form information into at least one compatible query for querying at least one data set, querying, using the at least one compatible query, the at least one data set for the information about the computing system, and providing the information about the computing system.

Abstract: The disclosed embodiments relate to systems and methods for efficiently distributing content among a plurality of users which may be used to implement a social networking service. Content items, which may include “posts” submitted by one user, e.g. responsive to a “post” submitted by another user, are stored in association with data indicative of a specified subset of an interest category classifications defined by the system. Users of the system further specify a subset of the interest category classifications to define their interests. The system then provides content items of interest to the user by mapping, as will be described, the defined interests of the user against the interests associated with the stored content items. The disclosed embodiments enable users to discover and expand their interconnections with other users which may have similar interests.

Abstract: Disclosed are a system comprising a computer-readable storage medium storing at least one program, and a computer-implemented method for generating search results. A data access module accesses search results data indicative of a plurality items and that is indicative of ranking values of the plurality of items. A controller module generates page data based on the search results data. The controller module selects a first item from the plurality of items. A diversification module accesses a first rule of the page data. The diversification module determines a deviance value and a reordering-cost value of a second item from the plurality of items. The controller module can select, based at least on a first combination of the deviance and the reordering-cost values of the second item, the second item for placement ahead of the first item on the page data.

Abstract: Methods and systems for managing, storing, and serving data within a virtualized environment are described. In some embodiments, a data management system may manage the extraction and storage of virtual machine snapshots, provide near instantaneous restoration of a virtual machine or one or more files located on the virtual machine, and enable secondary workloads to directly use the data management system as a primary storage target to read or modify past versions of data. The data management system may allow a virtual machine snapshot of a virtual machine stored within the system to be directly mounted to enable substantially instantaneous virtual machine recovery of the virtual machine.

Abstract: The invention describes a network lookup engine for generating parallel network lookup requests for input packets, where each packet header is parsed and represented by a programmable parser in a format, namely a token, which is understandable by the engine. Each token can require multiple lookups in parallel in order to speed up the packet processing time. The sizes of lookup keys varies depending on the content of the input token and the protocols programmed for the engine. The engine generates a super key per token, representing all parallel lookup keys wherein the content of each key can be extracted from the super key through an associated profile identification. The network lookup engine is protocol-independent which means the conditions and rules for generating super keys are full programmable so that the engine can be reprogrammed to perform a wide variety of network features and protocols in a software-defined networking (SDN) system.

Abstract: A processor-implemented method, system, and/or computer program product mitigate subjectively disturbing content. A context-based data gravity wells membrane supports one or more gravity wells, which hold subjectively disturbing synthetic context-based objects made up of a non-contextual data object, a first context object, and a second context object. The first context object defines the non-contextual data object, and the second context object describes how subjectively disturbing content generated by combining the non-contextual data object and the first context object is according to predefined parameters described by the second context object. New content is passed across the context-based data gravity wells membrane.