Abstract: Generating a data parser for parsing an input stream of data objects includes receiving information representative of a hierarchical data format defining a plurality of objects organized in a hierarchy. The objects include one or more schema objects representing data objects, and one or more container objects each associated with one or more schema objects. The generating also includes processing the received information to form the data parser. The processing includes determining permissible transitions between successive data objects in the input stream, based at least in part on the information representative of the hierarchical data format. The processing also includes associating one or more data operations with each of the determined permissible transitions.

Abstract: The invention provides, in one aspect, a method of searching an RDF triples data store of the type in which the triples are maintained in accord with a first storage schema. The method includes inputting a first query specifying RDF triples that are to be identified in the data store. That first query assumes either (i) that the triples are stored in a schema-less manner (i.e., with no storage schema) or (ii) that the triples are maintained in accord with a second storage schema that differs from the first. The method further includes generating, from the first query, a second query that specifies those same RDF triples, yet, that reflects the first storage schema. That second query can be applied to the RDF triples data store in order to identify and/or retrieve the desired data.

Abstract: In updating a synopsis table of a database system, a database management unit performs a transaction to insert row(s) in a section of the base table and determines whether a synopsis entry for the section is stored in the memory. If stored in the memory, the in-memory synopsis entry is retrieved and metadata values in the in-memory synopsis entry are updated with data from the row(s) to be inserted. If not stored in the memory, the in-memory synopsis entry is generated and the metadata values in the in-memory synopsis entry are updated with data from the row(s). The insert transaction is then committed. Synopsis entry on-disk updates are thus avoided, significantly reducing the cost of updating the synopsis entries from the insert transaction. This yields enhanced performance especially for inserts of a small number of rows, while the benefits of synopsis entries are still available.

Abstract: Embodiments of the present invention relate to synchronously replicating data in a distributed computing environment. To achieve synchronous replication both an eventual consistency approach and a strong consistency approach are contemplated. Received data may be written to a log of a primary data store for eventual committal. The data may then be annotated with a record, such as a unique identifier, which facilitates the replay of the data at a secondary data store. Upon receiving an acknowledgment that the secondary data store has written the data to a log, the primary data store may commit the data and communicate an acknowledgment of success back to the client. In a strong consistency approach, the primary data store may wait to send an acknowledgement of success to the client until it receives an acknowledgment that the secondary has not only written, but also committed, the data.

Abstract: A principal model is configured to facilitate automatic generation of at least one resource for use by a computer-executable application. The principal model includes a group of classes, references, attributes, and associations between any of the classes. At least one model item required for a task that is absent from the principal model is identified. The absent model item is instantiated in a decoration model that operates with the principal model to augment operational functionality of the principal model. The decoration model includes a class, a reference, and an attribute for any corresponding one of the group of classes, references, and attributes of the principal model.

Abstract: Systems and methods of returning location and/or event results using information social media content are provided. One or more social networking servers are accessed to retrieve social media content. One or more items within the social media content are then identified. These items may then be categorized. Information about the categories of the one or more items are stored in a database storing information about locations or events. A search query for a location or event may be received, and results for the search query may be selected by accessing the database and utilizing the information about locations or events as well as the information about the categories of the one or more items. The results may then be returned to a user device for display.

Abstract: Systems and methods of the disclosure relate to selecting content via a computer network. The system can receive a query to generate content selection criteria. The system can identify an entity of the query and a query graph based on the entity. The system can access a database to identify a template corresponding to the query graph. The template can include a topology and a named variable. The system can determine multiple semantic criteria corresponding to the named variable that match the query graph. The system can use a statistical metric of each of the matching semantic criteria to select candidate content selection criteria.

Abstract: Embodiments relate to management of data accessed from a database. A usage tracking engine of an application layer overlying a database, may automatically track (e.g. with a time stamp) access to specific data objects by particular users. This automatic tracking may be based upon one or more of the following: frequency of access, recency of access, user geographic location, and user calendar events. Based upon this data, the tracking engine applies an algorithm to automatically identify those data objects meriting special handling for quick access (e.g. for placement in a “shelf” or other construct readily accessible to the user). A heuristic learning module may generate a data object ranking based upon the usage data, and communicate that ranking to the usage tracking engine to determine a data object's eligibility for placement on the “shelf”. Such ranking may consider personalized settings, and/or a user's past manual shelf placement of data object(s).

Abstract: Implementing query classification includes executing a reductionist module on a query to extract a core term, which term is used to search a hash table that maps core terms to corresponding categories, deriving a first result including one of the categories from the search, and executing an enrichment module on the query to yield a second result. The enrichment module includes searching an index of terms that are mapped to documents and corresponding categories. Upon determining the core term is present in the hash table, a weighted average is calculated for values of the first and second results based on training data. Upon determining the core term from the query is not in the hash table, and also that a probability score of the category in the index for the second result meets a minimum confidence value, the core term and the corresponding categories are stored in the hash table.

Abstract: Applications that have been designed for a smaller format device such as a smartphone and simply ported to a larger format device such as a tablet can be discerned from applications designed specifically for the larger format device. An application can be evaluated based on tablet compatibility criteria and can be assigned a tablet compatibility score. The application can be evaluated based on quality criteria and can be assigned a quality score. The compatibility score and the quality score can be used to help find and rate any number of applications.

Abstract: A Database method for a B+ tree based on a PRAM. The database method divides each node into two areas, area 1 and area 2. A key value is inserted/retrieved/deleted for the each node. Inserting the key value requires firstly inserting a new key value to area 2 if area 2 in the node is not in a full state. Retrieving the key value requires identifying whether the node is a leaf node. If the node is a leaf node, the key value is retrieved from area 1 and area 2 sequentially. Deleting the key value requires merging area 1 and area 2 in the node, and deleting the key value in the merged node. The method enhances durability and data processing capability.

Abstract: Methods and apparatus related to determining and scoring task indications. For example, methods and apparatus may determine a plurality of interrogative sentences in a plurality of messages, determine starting n-grams of the interrogative sentences, determine task indications based on the starting n-grams, and determine task association scores for the task indications. Each task indication may be determined based on a set of one or more starting n-grams that share similarities. One or more individuals and/or applications may assign one or more task association measures to a task indication based on likelihood that the task indication is associated with a task request. The task association score for the task indication may be determined based on the task association measures that are assigned to the task indication.

Abstract: Disclosed is a server computer that receives, over a network from a computing device, a request for a search suggestion related to a search query that is input into a search term entry area displayed by a web browser executing on the computing device. In response to receiving the request, the server computer transmits over the network to the computing device, instructions for the computing device to display a search suggestion related to the search query, the search suggestion corresponding to a search results web page. The instructions further cause the computing device to store, in a memory of the computing device, a web page component associated with the search results web page without causing the computing device to visibly display the web page component during display of the search suggestion.

Abstract: A method for high-speed scheduling and arbitration of events for computing and networking is disclosed. The method includes the software and hardware implementation of a unique data structure, known as a pile, for scheduling and arbitration of events. According to the method, events are stored in loosely sorted order in piles, with the next event to be processed residing in the root node of the pile. The pipelining of the insertion and removal of events from the piles allows for simultaneous event removal and next event calculation. The method's inherent parallelisms thus allow for the automatic rescheduling of removed events for re-execution at a future time, also known as event swapping. The method executes in O(1) time.

Abstract: In one embodiment, a method includes automatically and without user input grouping one or more images captured by a first user into clusters of particular moments based at least in part on metadata associated with one or more of the images or data determined through analysis of one or more of the images. Each particular moment being associated with a particular geo-location and time. The method also includes, for each of one or more of the clusters, determining curating information corresponding to the cluster based at least in part on the metadata associated with images in the cluster, the data determined through analysis of images in the cluster, or social-graph information associated with images in the cluster; and providing the clusters of images and at least some of the curating information corresponding to them for display on a computing device of the first user.

Abstract: A data collecting device 200, before starting to collect function data A to E, communicates with all electronic control units 101 to 107 in a system 100 to recognize functions A to E controlled by the electronic control units 101 to 107, generate unit-specific function list information LD1 which is a list of functions A to E categorized by function type and by electronic control unit, and select at least one of the functions about which function data is to be collected. The data collecting device 200 then communicates by using at least one of electronic control units corresponding to the at least one selected function as at least one communication address, on the basis of the generated unit-specific function list information, to collect function data about the at least one function corresponding to a selection information set.

Abstract: Electronic Design Automation software displays parameters of a component in a graphical user interface. According to an embodiment, parameters of a component may be filtered through the use of a query. A Component Parameter Manager may search through parameter fields in a CDF file for components that match the query and emphasize the matching parameters in a graphical user interface. The parameter fields in a CDF file may also be augmented by a separate file to add search instructions or additional parameter fields. The augmentation helps facilitate a search by the Component Parameter Manager. The augmentations to a CDF file may be provided in a editable file separate from the CDF file.

Abstract: A method of accessing an image database containing location data and determining one or more clusters of the digital images based on their location data. A hotspot location is determined for representing the cluster of the digital images and the results are stored for later access. The computer is connected to a network and receives data from a device including data identifying a current location. After determining that the device is within a selected notification distance from the hotspot location, a notification is transmitted over the network.

Abstract: Systems and techniques for exploring relationships among entities are disclosed. The systems and techniques provide an entity-based information analysis and content aggregation platform that uses heterogeneous data sources to construct and maintain an ecosystem around tangible and logical entities. Entities are represented as vertices in a directed graph, and edges are generated using entity co-occurrences in unstructured documents and supervised information from structured data sources. Significance scores for the edges are computed using a method that combines supervised, unsupervised and temporal factors into a single score. Important entity attributes from the structured content and the entity neighborhood in the graph are automatically summarized as the entity fingerprint. Entities may be compared to one another based on similarity of their entity fingerprints. An interactive user interface is also disclosed that provides exploratory access to the graph and supports decision support processes.

Abstract: In one aspect, a method to provide asymmetric active-active access to a first storage volume using a global cache coupled to a first and second virtual storage volumes includes replicating asynchronously the first storage volume at a first site to a second storage volume at a second site, virtualizing the first storage volume with the first virtual storage volume; and virtualizing the second storage volume with the second virtual storage volume. The first storage volume has primary storage functionality.