883 results about "Directed graph" patented technology

Techniques for assigning ranks to nodes in a large linked database, such as world wide web or any other hypermedia database, partition the nodes so that the link matrix has a predominantly block-diagonal form. Within each block, a local rank is computed for nodes in the block, possibly by different computer in a distributed computing environment. A block rank is then estimated for each block as a whole, and may optionally include block-level weights to implement customized ranking. The local ranks and block ranks are then combined to form a global rank, which may be used to rank the nodes. Alternatively, a global rank vector for the database may be used as an initial vector in an iterative link-based ranking scheme to obtain more accurate global ranks for the nodes. The global rank vector may be divided to provide local rank vectors for use in subsequent applications of the method.

A system and method for planning placement of virtual machines VMs in a computing environment comprising a set of hosting machines HM. The method includes constructing a bipartite directed graph-based model that represents both a current and a target placement states, both including virtual machine nodes v in VM and nodes h in HM. Using a technique of graph pruning, the method iteratively generates a plan for achieving a desired target placement starting from the current placement without temporarily violating any policy or resource constraint. The application of the pruning algorithm to VM deployment automation necessarily defines a new model. The methodology employed safely manages concurrent changes in a datacenter, so that the environment can adjust faster to changing constraints. Furthermore, the present invention allows detection of migration cycles, caused by deadlocked combinations of capacity and policy constraints, and resolving them.

An event tracking system tracks customer interactions to obtain product information that are made across plural contact mediums and displays an intuitive directed graph for analysis of the customer interactions. Each customer interaction is logged at each contact medium with a labeled reference associated with the content of the interaction, a time stamp and an identifier for the product or product user. An event modeling engine analyzes the log to identify contact sessions as contacts by the same identifier within a predetermined time so that an event tracking graphical user interface module prepares each contact session for display as a path of nodes interconnected by edges. Selected directed graph characteristics are highlighted, such as transitions from one contact medium to another or contact session volumes associated with an edge that have a relative volume compared with other contact sessions.

The invention provides for a communications recording and analysis system including means for recording one or more communication streams, means for identifying the recorded stream, means for retrieving the content of said recordings by identifier tags, and wherein additional real-time information is inferred from analysis, in real-time or later, of keystrokes entered at a computer/terminal handling the interaction, and/or computer mouse actions, and/or internet traffic emanating from, or terminating at, any one or more of a number of computers/terminals handling the interaction, and/or the words and/or prosody spoken during the interaction is recorded. Furthermore graphical display means are provided such that the presentation of call flow recording is in the form of a direct graph showing the progress of the calls through the various states and transitions.

A method and system for providing an interface that allows navigation and display of a directed graph are provided. The interface provides visualization of an underlying graph structure comprising a plurality of hierarchies with shared common nodes, wherein the hierarchies do not necessarily share the exhaustive child-tree of the common node. The method provides for the interface to display a focus node, parent nodes (if any) of the focus node, and in-context children (if any) of the focus node. In a preferred embodiment, the displays of focus, parent, and in-context child nodes are textual displays rather than graphical node-link displays.

A visual thesaurus system and method for displaying a selected term in association with its one or more meanings, other words to which it is related, and further relationship information. The results of a search are presented in a directed graph that provides more information than an ordered list. When a user selects one of the results, the display reorganizes around the user's search allowing for further searches, without the interruption of going to additional pages.

A method of presenting content to a viewer is described. The method includes: receiving a schedule of content at a client operable by the viewer, the schedule of content including a directed graph, the directed graph including a plurality of nodes, wherein each node in the plurality of nodes is connected to one or more other nodes in the plurality of nodes by one or more paths, wherein each path represents content presentable to the viewer; traversing the directed graph by following a route between nodes and along paths of the directed graph, wherein at each node the client determines a path to follow according to state information accessible by the client; and presenting content to the viewer as each path is followed.

A present IT environment, in particular, a place such as a data center in which resources are concentrated at one place, requires a mechanism (provisioning) for allocating an excess resource (a server, a network apparatus, a storage, or the like) to the service in response to a load fluctuation of a service. In some cases, setting operations occurring in the process of the provisioning are time-demanding. In those cases, it is impossible to respond to abrupt load fluctuations. [Solving means] Procedures starting from an initial state of the resource and ending in a state where each of resources is deployed for each service are identified, and the procedures are expressed as a directed graph having a state of the resource in each phase as a node (stage), and having a setting operation as an edge. There are some cases, however, where even for deployments intended for different services, an initial state and some of intermediate states are common. In those cases, those common intermediate states are expressed as a single node. When resources are allocated to nodes near to a state where a service is developed, it is made possible to reduce a time required for provisioning to the service.

A computer executed method of determining compatible versions of dependent entities of a root entity having a specified version in a computer system. The method comprises building a directed graph containing dependent entities and dividing the directed graph into multiple levels. Compatible versions are determined for entities in upper levels of the directed graph before determining compatible versions for entities in lower levels of the directed graph.

A method for unsupervised transformation of denormalized data into RDF data includes summarizing an existing resource description framework (RDF) file wherein a data summary file is produced, wherein said RDF file includes a plurality of nodes, property labels, and literals and is represented as a directed graph, and said data summary file is a graph that includes a single instance of each node-property-literal triple in the RDF file; analyzing a plurality of denormalized records wherein a record summary is produced, wherein said record summary is represented as a directed graph with a root node corresponding to each record connected to a node for each field in the record; determining one or more transformation patterns that match elements of the record summary to elements of the data summary; and transforming the plurality of denormalized records into a new RDF file by executing one of the one or more transformation patterns.

A system and method of integrating diverse sources of data and data streams is presented. The method can include selecting a scenario based on a topic, creating a multi-relational directed graph based on the scenario, identifying and converting resources in accordance with the scenario and updating the multi-directed graph based on the resources, identifying data feeds in accordance with the scenario and updating the multi-directed graph based on the data feeds, identifying analytical routines in accordance with the scenario and updating the multi-directed graph using the analytical routines and identifying data outputs in accordance with the scenario and defining queries to produce the data outputs from the multi-directed graph.

The invention discloses a method for identifying opinion leaders in a social network based on topic link behaviors of users, comprising constructing a social network directed graph, amending edge-weight of the network, for each network node i, calculating the number of shortest paths passing through the node i, calculating the length of the shortest paths, weighting edges of the node, and calculating weighted sum B(i). Opinion leaders based on topic tracking are composed of nodes which have a larger value of B(i). The method of the invention adopts a calculation method of link relations in social network user topics, which reduces scale of network nodes and accordingly decreases system overhead and improves algorithm accuracy and recall rate.

A method and system for generating threads of documents from a collection C of documents containing terms. Each document of C has a timestamp and an associated timestamp index. The timestamp indexes are ordered in accordance with an ordering of the associated timestamps. A relevance graph G generated from C is an acyclic directed graph. Each node of G denotes a document of C. Each edge of G connects a pair of directed nodes pointing from a node having an earlier timestamp to a node having a later timestamp. At least one thread of G is determined by executing a matching-based algorithm or a dynamic programming algorithm. Each thread is a path through G originating at a first node and terminating at a second node and including one or more contiguous edges from the first node to the second node. The at least one thread is outputted.

The invention provides an online anomaly monitoring and diagnosis method and system. The method comprises the steps that the causal relation and conditional relation among all signals are defined based on a directed graph model; based on definitions of the signals by the directed graph model, the signals in acquired historical data are classified, and a training set of the historical data is established to perform model training and determine model parameters; and based on real-time data theoretical values of the signals in real-time data obtained after the real-time data acquired through online monitoring is input into a trained model, whether the signals in the real-time data are abnormal is determined. The system adopting the method and a computer readable medium storing a program executing the method are also included. Through the method, the system and the computer readable medium, a complete logic relation and casual relation are constructed for the whole process of industrial production and operation through the directed graph model, and more reasonable, more correct, more accurate and efficient production online anomaly diagnosis prediction is realized in combination with machine learning.

A method of intelligent textual markup in an information exchange includes: determining semantic elements in said information exchange; determining relations between said semantic elements; representing said semantic elements as nodes in a directed graph; and representing said relations as edges connecting said nodes. A data processing system for enabling a visual representation of semantic relations in an information exchange includes: a semantic analysis engine adapted to determine semantic elements of said information exchange; a relation analysis engine adapted to determine relations between said semantic elements; and a presentation engine adapted to present said semantic elements as nodes and said relations as edges in a directed graph representing said information exchange.

A method and system are described for using business artifacts to identify elements of a component business model. Artifacts operated upon by the business are first identified, and then used to analyze the business into business operations. This is done by identifying every business activity that acts on an artifact, creating directed graphs for the business activities, and decomposing the directed graphs into sub-graphs, each sub-graph representing a business operation and being annotated by a verb expression, the annotated sub-graph representing a business service. The business services are then clustered into non-overlapping components, using common affinities reflected in the verb expressions, and organized by partitioning into internal and external operations, exposing a business service for each external operation. The components are then clustered into non-overlapping business competencies, and arranged by accountability level.

Systems and methods are provided for a scheme and mechanism for performing static analysis of a sample time aware state diagram model to compute and propagate multiple samples rates associated with the state diagram model. A graphical intermediate representation of the state diagram model, such as a directed graph or control flow graph, is used to determine how the multiple sample rates are propagated via elements of the state diagram model. The graph provides a static representation of the control of flow, including alternative and/or conditional flow paths, of the state diagram model. The present invention determines the propagation of sample rates via analysis and traversal of the intermediate representation. By using the techniques of the present invention, a state diagram model may provide multiple sample rate outputs, such as by function calls and output signals to a graphical model, such as a model representing a dynamic system.