Abstract: A computer implemented method of storing, manipulating, assessing, and displaying data and its relationships, and a computer system (with memory) programmed to implement such method. The data is stored into nodes, and visualized as a sea of linked nodes.

Abstract: The present invention extends to methods, systems, and computer program products for hierarchically presenting tabular data. Embodiments of the invention utilize out-denting and/or color coding to organize and present tabular data to a user so that comparisons across multiple levels of data are possible while maintaining hierarchical organization of a model. That is, the columnar structure of tables can be maintained to allow rich cross-column comparison within various levels of nesting. Further, scaling is significantly increased since nesting has a reduced (and potentially no) impact on column alignment.

Abstract: State information for a page can be stored and restored using a component state manager to extract and set state information for various components on a page. Each appropriate component can register with the state manager, such that when a user requests to store state information, the state manager can extract state information for each registered component and store the state information accordingly. The user can be provided with a tag or other identifier that allows the user to subsequently request recreation of that state. In response to receiving the identifier, the state manager retrieves the stored state information and sets the state of each respective registered component on the page. The identifiers can be shared with other users to allow those users to also quickly access the same state.

Abstract: The World Wide Web (WWW) can be modelled as a labelled directed graph G(V,E,L), in which V is the set of nodes, E is the set of edges, and L is a label function that maps edges to labels. This model, when applied to the WWW, indicates that V is a set of hypertext documents or objects, E is a set of hyperlinks connecting the documents in V, and the edge-label function represents the anchor-text corresponding to the hyperlinks. One can find a probabilistic ranking of the nodes for any given label, a ranking of the labels for any given node, and rankings of labels and pages using flow based models. Further, the flows can be computing using sparse matrix operations.

Abstract: Methods, devices and systems are described for implementing a method for positioning a non-constrained amount of data in semblance of a tree. The method includes receiving genealogical data including nodes and generating a directed graph of the nodes of the genealogical data. The directed graph is to maintain parent-child relationships among the nodes and to maintain generations. The genealogical data includes a root node. The method includes moving the nodes along the horizontal axis such that each node is in an equal spacing with respect to each node's parent node, determining a number of generations in the genealogical chart, and generating a number of quadratic curves equal to the number of generations. The apex of the quadratic curves is the position of the tree's trunk. The method includes dropping the nodes in the Y-axis along the curve of the quadratic curves. Each generation is in line with the quadratic curve.

Abstract: A system and computer usable code is provided for using a templated pattern to define part types on a web service definition language (WSDL) interface. Applying the templated pattern enables peer services to define a transparent contract between specific WSDL part types. The templated pattern is used to wrap the original business object with the enriched business graph schema. The templated business graph is created by extending the business graph complex type that is provided by the business object framework runtime and adding an element delegating to the original business object.

Abstract: A method, system, and computer program product for transaction-controlled graph processing and management are provided. The method includes notifying an external component of a database management system (DBMS) controlled transaction including multiple operations, and acquiring a DBMS transaction identifier associated with the transaction at the external component. The method further includes storing the DBMS transaction identifier as an external component transaction identifier, and receiving notification at the external component of events associated with the operations. The method additionally includes monitoring the events for an end-of-transaction operation, and passing notification of the end-of-transaction operation to an external routine.

Abstract: An improved system and method is provided for identifying web communities from seed sets of web pages. A seed set of web pages may be represented as a set of seed vertices of a graph representing a collection of web pages. An initial probability distribution may be constructed on vertices of the graph by assigning a nonzero value to the vertices belonging to the seed set. Then a sequence of probability distributions may be produced on the vertices of the graph by modifying the probability distribution over a series of one-step walks of the probability distribution over the vertices of the graph. For each probability distribution produced in the sequence, level sets of vertices may be generated, and a level set with minimal conductance may be selected for each probability distribution. The level set with the least conductance may then be output representing a community of web pages.

Abstract: An apparatus, and corresponding method, for traversing a compressed graph used in performing a search for a match of at least one expression in an input stream is presented. The compressed graph includes a number of interconnected nodes connected solely by valid arcs. A valid arc of a current node represents a character match in an expression of a character associated with the current node. Arcs which are not valid may be pruned. Non-valid arcs may include arcs which point back to a designated node(s), or arcs that point to the same next node as the designated node(s) for the same character. Each valid arc may comprise a next node pointer, a hash function, and a copy of an associated character. The hash function may be used to manage a retrieval process used by a walker traversing the compressed node. The walker may also use a comparison function to verify the correct arc has been retrieved.

Abstract: The present invention extends to methods, systems, and computer program products for the facilitating the layout and composition of graphics. Embodiments of the present invention allow declarative input for creation and modification of layout compositions and also allows adjustments or modifications made to layout compositions. Layout compositions may be created, adjusted, and modified by input through a markup language or by user-commands and gestures. Relationships and associations among nodes and among line segments and connections between nodes which are embodied within a composition or created by an auto layout are preserved both during and after adjustments and modifications.

Abstract: A method of ascribing scores to web documents and search queries generates a hyperlink-click graph by taking the union of the hyperlink and click graphs, takes a random walk on the hyperlink-click graph, and associates the transition probabilities resulting from the random walk with scores for each of the documents and search queries.

Abstract: The invention concerns a method for accessing a resource in a computer environment, the resource comprising a set of objects. The invention is characterized in that the computer environment is adapted to store in association with at least one object of said resource at least one modified object, in that said computer environment comprises means for storing in association with such an object information concerning degree of elaboration, and in that it includes the following steps: identifying, for each object of the resource to which corresponds at least one modified object, based on data concerning degree of elaboration, at least one most elaborated version of said object; assembling the objects thus identified for display in the resource. The invention also concerns other methods for accessing to resources as well as resources structured therefor.

Abstract: A user feedback system for improving a performance of a software application is described. The feedback system includes a telemetry collection system and a user feedback collection system. A context aggregator collects data from both the telemetry collection system and the user feedback collection system, and constructs a data model that characterizes the data. Using this data model, the feedback system is able to provide or enable software support in a timely, convenient, and useful way. Specifically, data in the data model is standardized across a number of software applications and/or users, so that multiple data models, along with other data sources, may be meaningfully compared to identify a problem, and possibly a solution, associated with an operation of the software application. Additionally, users of the feedback system may be connected with a virtual community of other users who the system has determined may be helpful in assisting one another.

Abstract: The invention relates to encoding and decoding descriptions of multimedia content in two formats using access units. The invention further relates to dynamically updating multimedia description using access units and to supporting the delivery of distributed multimedia descriptions.

Abstract: Particular embodiments access a query submitted by a first user; retrieve information concerning one or more second users; retrieve a degree of separation between the first user and each second user within a social-networking system; and for each second user, if the degree of separation between the first user and the second user is less than or equal to a threshold degree of separation, then send the information concerning the second user to the first user in response to the query.

Abstract: Concepts relevant to natural language content may be identified using an ontology. The natural language content may be tokenized and normalized. Using the tokenized content, one or more candidate concepts within the ontology may be identified. Concepts relevant to the natural language content may be selected using the identified concepts and the relationships between concepts defined within the ontology. A spreading activation process may be used to identify related concepts. The spreading activation process may be iterative and/or may reach multiple generations of connected concepts within the ontology. The relevant concepts associated with the natural language content may be used to index the natural content, identify related content, provide targeting advertising related to the natural language content, and the like.

Abstract: A cue sheet generation system is used to compose a cue sheet for submission to PRS from an input EDL. The system parses the EDL to extract data relating to use of musical works associated with a PRS. The system employs both local and remote databases to retrieve information relating to the extracted musical work data. The information is then used to construct a cue sheet in a form appropriate for submission to a PRS.

Abstract: Mechanisms are provided for anonymizing data comprising a plurality of graph data sets. The mechanisms receive input data comprising a plurality of graph data sets. Each graph data set comprises data for generating a separate graph from graphs associated with other graph data sets. The mechanisms perform clustering on the graph data sets to generate a plurality of clusters. At least one cluster of the plurality of clusters comprises a plurality of graph data sets. Other clusters in the plurality of clusters comprise one or more graph data sets. The mechanisms also determine, for each cluster in the plurality of clusters, aggregate properties of the cluster. Moreover, the mechanisms generate, for each cluster in the plurality of clusters, pseudo-synthetic data representing the cluster, from the determined aggregate properties of the clusters.

Abstract: A Natural Language Understanding system is provided for indexing of free text documents. The system according to the invention utilizes typographical and functional segmentation of text to identify those portions of free text that carry meaning. The system then uses words and multi-word terms and phrases identified in the free to text to identify concepts in the free text. The system uses a lexicon of terms linked to a formal ontology that is independent of a specific language to extract concepts from the free text based on the words and multi-word terms in the free text. The formal ontology contains both language independent domain knowledge concepts and language dependent linguistic concepts that govern the relationships between concepts and contain the rules about how language works. The system according to the current invention may preferably be used to index medical documents and assign codes from independent coding systems, such as, SNOMED, ICD-9 and ICD-10.

Abstract: A digraph including a plurality of ordinary nodes, at least one of a composition node and a decomposition node, and a plurality of arcs interconnecting any of said nodes.

Abstract: A cycle basis is efficiently determined for a directed graph. A first depth-first search of the directed graph classifies each of the edges of the directed graph to have a type that is one of a within-tree type for an edge within a tree of the first depth first search, a forward type for an edge skipping forward along the tree, a back type for an edge directed back along the tree, or a cross type for an edge between two subtrees of the tree. A second depth-first search of the directed graph determines a respective cycle for each of the edges of the back type. A third depth-first search of the directed graph determines a respective cycle for each of the edges of the cross type that is included a cycle. The basis is output the basis that specifies each of the respective cycles.

Abstract: A system, method and data structure for processing basic client application data types to add thereto extension types and priority levels adapted for use by each of a plurality of set top box classes.

Abstract: The present application relates to systems and methods for determining at least one target path from a start vertex to a goal vertex within a directed acyclic graph. The systems and methods use a target value search (MFTVS) of a directed acyclic graph. The MFTVS includes beginning with a start vertex as a current prefix and progressing through selected prefixes. The MFTVS further includes determining a selected prefix from successor prefixes of the current prefix according to a selection rule. The selection rule is one of selecting the successor prefix having a highest path value and selecting the successor prefix having a lowest path value. The MFTVS further includes setting the current prefix to the selected prefix until a frontier of a blind spot is encountered. The frontier of the blind spot is defined by an evaluation function.

Abstract: Embodiments of the present invention provide systems and techniques for displaying data models and data-model instances. During operation, the system can use a model graph to represent the data model and an instance graph to represent the data-model instance. In the graph representation, a vertex can represent an entity or an entity instance, and an edge can represent a relationship or a relationship instance. The system can display the model graph and the instance graph, either separately or concurrently, thereby enabling the user to visually explore the data model and the data-model instance by exploring the associated graphs. The system can display paths in the graphs to the user, thereby enabling the user to visually explore how entities and entity instances are related to one another. The system can also enable a user to search for entities and relationships using various criteria.

Abstract: A system and method for presenting digital information is described. The system comprises a local client, a plurality of geo-located objects (GLOBs), a GLOB Data Sheet, a grouping of GLOBS, and a display device are described. The local client is configured to collect a plurality of objects, in which each object is composed of digital information. Each of the geo-located objects (GLOBs) comprises a location component that is associated with each object. One GLOB Data Sheet (GDS) is associated with each GLOB and each GDS is configured as a data structure that comprises one or more auxiliary data fields that are searchable and store auxiliary information associated with each GLOB. The grouping of GLOBs is organized as a function of time and location information that is gathered from each GDS. The display device is configured to present the organized grouping of GLOBs.

Abstract: A system and method for synchronizing service metadata into a format for canonical representation of service metadata and publishing the synchronized service metadata into a metadata repository. The method comprises: receiving service metadata from a service producer; normalizing the service metadata into the format for canonical representation of service metadata; and publishing normalized service metadata into a metadata repository that supports the format for canonical representation of service metadata. The system comprises: at least one connector for each service producer, wherein the connector permits a synchronization system to communicate bi-directionally with the service producer; one normalizer for each service producer, wherein the normalizer transforms the service metadata into a format for the canonical representation of service metadata; and at least one provider for each service producer, wherein the provider publishes the canonical representation of service metadata into a metadata repository.

Abstract: Instead of executing a plurality of submitted transactions separately, each data item to be processed by the plurality of submitted transactions is retrieved only once, update operations of the plurality of transactions are executed consecutively on the retrieved data item in main memory, and only the last updated result is written in a database once. Two-phase locking technique and timestamp technique are used for multi-operation processing providing concurrency control of transactions in order to execute multiple synthetic transactions concurrently.

Abstract: Methods, systems, and apparatuses for associating queries of a query log are provided. The query log lists a plurality of queries and a set of clicked URLs for each query. Each query is designated to be a node of a plurality of nodes. A plurality of edges is determined. A URL is designated to be an edge for a pair of queries if the URL is indicated as clicked in the sets of clicked URLs for both queries of the pair. The nodes and edges are displayed in a graph. Each edge may be displayed in the graph as a line connected between a pair of nodes that correspond to the pair of queries of the pair of nodes. The edges may be classified. Furthermore, the edges and/or the nodes may be weighted. Edges and/or nodes may be filtered from display based on their weights and/or on other criteria.

Abstract: A method for creating an embedding node. The method includes creating a first hash-based directed acyclic graph (“HDAG”) having a first node, which includes data, and creating a second HDAG having a second node that includes one or more data fields that store the first node.

Abstract: An illustrative embodiment includes a method for executing a query on a graph data stream. The graph stream comprises data representing edges that connect vertices of a graph. The method comprises constructing a plurality of synopsis data structures based on at least a subset of the graph data stream. Each vertex connected to an edge represented within the subset of the graph data stream is assigned to a synopsis data structure such that each synopsis data structure represents a corresponding section of the graph. The method further comprises mapping each received edge represented within the graph data stream onto the synopsis data structure which corresponds to the section of the graph which includes that edge, and using the plurality of synopsis data structures to execute the query on the graph data stream.

Abstract: This present invention describes an innovative solution in the area of indexing and searching binary files including various binary files such as multimedia files, including image files, mp3 files and other audio/video files from the public Internet. The invention introduces a way to index binary files such as multimedia files according to their content signatures, which uniquely identify themselves, and search for related files by walking through a graph database constructed during the index phase. The present invention can be used in a search engine and a download engine, as well as with text based index and search technologies. As a result, such extended usage will broaden a multimedia file's context and increase relevant accuracy of the keywords describing the context.

Abstract: Information retrieval using query-document pair information is described. In an embodiment, a click record is accessed having information about queries and documents where user clicks have been observed for query-document pairs. A click graph is either formed or accessed. This has nodes connected by edges, each node representing any of a document and a query and each edge representing at least one observed click. Given at least one first node in the click graph, a similarity measure is determined between that first node and each of one or more second nodes. The second nodes are then ranked on the basis of the similarity measure results and the ranking is used to retrieve information from the click record.

Abstract: Methods and apparatuses are disclosed for caching portions of a Deterministic Finite Automata (DFA) graph during a compilation stage prior to a run-time stage that identifies attack traffic based on the graph. Cacheable components are identified based on a traffic profile, a dictionary of keywords, and/or a geometrical configuration of the graph. Techniques are disclosed for performing various types of caching alone or in combination with other types. Caching based on a dictionary or profile exploit a tendency of graph traversals performed during non-attack scenarios to remain near root nodes that correspond to the start of patterns designating blacklist traffic. By caching nodes that are near root nodes and that are visited frequently during peacetime (non-attack) scenarios, significant cache hits may be achieved during run-time execution. Caching graph components while compiling patterns using presently disclosed techniques avoids the need for expensive hardware to learn what and when to cache.

Abstract: Techniques are provided for analyzing data called “pivot points” which allows users to instantly generate a report based on all available dimensions for any cell in a tabular report or any data point in a graphical report. In one embodiment, the techniques involve placing a unique UI element or menu next to or on each data point, and clicking on this UI element brings up an automatically filtered list of the valid reports available for just this sub-set of the data. Once the user selects which view they want, a report is automatically generated based on those dimensions with just this subset of data.

Abstract: Provided is a system and method to perform dynamic state-space partitioning in external memory graph searching. The dynamic partitioning of the state-space search graph leading to substantial improvement of search performance.

Abstract: A frequent changing pattern extraction device (100) which extracts a frequent changing pattern from an ever-changing network structure includes: a conversion unit (12) which converts each of a plurality of graph sequences into an operator sequence by expressing changes, from a first graph included in the graph sequence to a second graph which is temporally adjacent to the first graph, using operators indicating operations necessary to transform the first graph into the second graph, each graph sequence including a plurality of graphs that show temporal changes in the graphs and each of the graphs including a vertex corresponding to a data piece and an edge corresponding to a link between data pieces; and an extraction unit (18) which extracts an operator subsequence that appears at least a predetermined number of times in the plurality of operator sequences corresponding to the plurality of graph sequences, based on the anti-monotonicity used in the Apriori algorithm.

Abstract: Method and system for managing and evaluating life science data. Life Science data is placed in a knowledge base, that may be used for a variety of analysis tasks. Creating a knowledge base from the life science data involves generating two or more nodes indicative of life science data, assigning to one or more pairs of nodes a representation descriptor that corresponds to a relationship between the nodes, and assembling the nodes and the relationship descriptor into a database, such that at least one of the nodes is joined to another node by a representation descriptor. In some embodiments, the representation descriptor includes a case frame that describes the relationships between elements of life science data.

Abstract: Various embodiments of the present invention are directed to a unique memory management scheme utilized by the DTP whereby data extracted from an external source is placed in a memory buffer and is then manipulated by the components without the need for copying the data to any other location in memory. While logically the data moves from component to component in the DFE for the various embodiments described herein, the data does not in fact change locations but, instead, the data resides in the buffer and is operated upon by a series of components that, in turn, access the data in the buffer via pointers and manipulate same.

Abstract: In a method and an apparatus (1) for searching in a memory-efficient manner for at least one query data element in a graph (2A), only as many data elements are read into a memory as are required for their subsequent processing. Increased memory efficiency is ensured as a result of this. The proposed apparatus is particularly suitable for use in terminals having very limited memory, in particular in mobile terminals.

Abstract: The present invention relates to the screening of molecules, for example for candidates for the development of new drugs. In more detail, the invention relates to a method for searching molecules among a number of molecules to be screened that are similar to a given set of query molecules.

Abstract: The subject matter of this specification can be embodied in, among other things, a method that includes inferring labels for videos, users, advertisements, groups of users, and other entities included in a social network system. The inferred labels can be used to generate recommendations such as videos or advertisements in which a user may be interested. Inferred labels can be generated based on social or other relationships derived from, for example, profiles or activities of social network users. Inferred labels can be advantageous when explicit information about these entities is not available. For example, a particular user may not have clicked on any online advertisements, so the user is not explicitly linked to any advertisements.

Abstract: Systems and methods for searching heterogeneous interrelated entities for a heterogeneous entities search query are disclosed herein. A user may enter the heterogeneous entities search query. The search retrieves and returns multiple types of heterogeneous entities. The retrieved heterogeneous interrelated entities are searched in a unified matrix that represents relationships between one or more heterogeneous entities. The retrieved heterogeneous interrelated entities may have one or more entity types. The set of retrieved interrelated entities may also be ranked based on the similarity between each entity and the search query. Feedback may also be incorporated into the system to improve search accuracy.

Abstract: A query network is disclosed, comprising sets of nodes and edges connecting pairs of nodes. The nodes of the query network are associated with edge-defining queries. A method is taught for fully evaluating such a query network. A language is further disclosed for constructing queries. The query network may be used to model a social network, a professional network or the like.

Abstract: Techniques for community discovery in a network are disclosed. For example, a technique for discovering a community around a given entity in an interaction graph, wherein nodes in the graph represent entities and edges connecting nodes in the graph represent interactions between connected nodes, comprises the following steps/operations. Nodes in the interaction graph are partitioned into different sets of nodes based on interaction information associated with each node to minimize a number of interaction pairs that need to be considered. An objective function is minimized by moving entities between the different sets such that the community is discovered once a measure associated with the objective function is minimized.

Abstract: A method, computer program product, and a data processing system that facilitates navigation through a directed graph for selection of sub-processes of a modified business process derived from a business process is provided. A bounding box is used for evaluating and selecting sequences of nodes representative of business sub-processes or services. The bounding box has a predefined depth for limiting the scope of the evaluation. The bounding box is shifted during the evaluation as sequences of nodes are selected. Additionally, state data is maintained such that a sense response model may be employed to detect and account for changes to the environment in previously evaluated services. By maintaining state data, a transition to a previously evaluated sub-process may be implemented to account for significant changes in the environment.

Abstract: A versioned relational database system (VRDBS) in which versions of data contained in a relational database system are accessed by means of workspaces. Metadata in the VRDBS permits a workspace to have multiple parents. The multi-parented VRDBS performs operations including specifying that a workspace be made an additional parent of another workspace or that an additional parent be removed as a parent of the other workspace. The fact that a workspace may have multiple parents affects the manner in which merge and refresh operations are performed and the manner in which system-enforced constraints such as primary key constraints, unique key constraints, and referential integrity constraints are handled. The metadata for the VRDBMS includes a multi-parent graph for each workspace that has multiple parents. The multi-parent graph is used in the performance of the merge and refresh operations and in determining constraint violations.

Abstract: A query-centric system and process for distributing reverse indices for a distributed content system. Relevance ranking techniques in organizing distributed system indices. Query-centric configuration subprocesses (1) analyze query data, partitioning terms for reverse index server(s) (RIS), (2) distribute each partitioned data set by generally localizing search terms for the RIS that have some query-centric correlation, and (3) generate and maintain a map for the partitioned reverse index system terms by mapping the terms for the reverse index to a plurality of different index server nodes. Indexing subprocess element builds distributed reverse indices from content host indices. Routines of the query execution use the map derived in the configuration to more efficiently return more relevant search results to the searcher.

Abstract: Systems and methods are disclosed for providing access to a thumbnail image that is embedded within an image file along with a corresponding main image. An exemplary method involves receiving a request from a client for the thumbnail image. The thumbnail image is retrieved from an image host. The entire image file is not retrieved from the image host. The thumbnail image may be sent to the client. Alternatively, the thumbnail location information may be sent to the client. Retrieving the thumbnail image from the image host may involve identifying a location of the thumbnail image within the image file, and retrieving data from the image file corresponding to the location.

Abstract: A data provider application programming interface (API) is configured for use with a game content editing application. An asset relationship management file, which is generated with the data provider API, includes information such as relationship references and annotations and is updated by the data provider API when a digital asset is edited. The asset relationship management file is then stored in a data store. An asset relationship graph is generated, based on the asset relationship management file in the data store. The asset relationship graph includes asset graph nodes that map dependency relationships between asset files. A graph API is also described. The graph API is configured for accessing the relationship graph through a server process to expose dependency relationships and annotations to a client process, such as an application. Thus, the effect of changes to one asset on other assets can readily be evaluated.

Abstract: A dependency network is created from a training data set utilizing a scalable method. A statistical model (or pattern), such as for example a Bayesian network, is then constructed to allow more convenient inferencing. The model (or pattern) is employed in lieu of the training data set for data access. The computational complexity of the method that produces the model (or pattern) is independent of the size of the original data set. The dependency network directly returns explicitly encoded data in the conditional probability distributions of the dependency network. Non-explicitly encoded data is generated via Gibbs sampling, approximated, or ignored.