Abstract: This disclosure describes a system that electronically collects, translates, groups, and delivers wage assignment information from at least one initiator to at least one recipient via an accumulator. An initiator initially receives the wage assignment information. Then, an accumulator collects the wage assignment information from at least one initiator, such as a government agency. The accumulator then translates the wage assignment information into a format compatible with electronic data interchange (EDI), such as the ANSI X12 standard. The accumulator then groups the EDI wage assignment information into specific files, batching the files based upon one data field contained within the wage assignment information data set, such as a recipient. The accumulator then delivers a batched EDI wage assignment file to each respective recipient. Once the EDI wage assignment file is received by the recipient, the wage assignment may then be implemented.

Abstract: Embodiments are directed to a density-based clustering algorithm that decomposes and reformulates the DBSCAN algorithm to facilitate its performance on the Map-Reduce model. The DBSCAN algorithm is reformulated into connectivity problem using a density filter method and a partial connectivity detector. The density-based clustering algorithm uses message passing and edge adding to increase the speed of result merging, it also uses message mining techniques to further decrease the number of iterations to process the input graph. The algorithm is scalable, and can be accelerated by using more machines in a distributed computer network implementing the Map-Reduce program.

Abstract: An information processing device is connected to a database storing graph data having been generated by analysis engines and having a data structure that plural nodes are connected, and includes: a node information database which is set for each of the graph data compatible with the respective analysis engines and in which, with path information referring to a node in the graph data, identification information that is information for identifying the node and that is identical for identical nodes is associated; and a data processing means for, based on the node information database, executing a process of associating a node in the graph data having a predetermined data structure generated by a predetermined analysis engine and a node in the graph data generated by another analysis engine associated with identical identification information to the identification information associated with the node in the graph data having the predetermined data structure.

Abstract: A planning and search system are described wherein a graph search and segment matching are used to handle very large searches at a higher speed.

Abstract: Embodiments of the invention disclose a method, a system and a computer program product of discovering automated insights in XML data by generating a query result in response to querying data using a query, wherein the data is in a markup language format, and identifying a pattern associated with the query result, wherein the data in the markup language format is used for pattern identification.

Abstract: A graph database is described. The graph database includes one or more symbolic data stores and one or more key-value data stores. Each symbolic data store is configured to symbolically store sets of multiple hyper-graph nodes. Each key-value data store is configured to store attribute information for hyper-graph nodes and hyper-graph edges.

Abstract: Systems, computer-readable media, and methods for tagging documents based on a graph pertaining to one or more entities which a user has included in a search query. The user may have at least one social networking relationship with the entity. A search engine is configured to display a search engine results page in response to the search query received from the user. The search engine may also receive suggested tags that identify documents that could be linked to the entity identified in the query. The user may confirm that the suggested tags are appropriate via feedback that is transmitted to the search engine. In turn, the search engine updates a graph to reflect a number of users that agree with the suggested tag.

Abstract: Systems and methods are provided wherein executable files are prepared from source code without generating intermediate files. For example, rather than using a compiler to prepare an intermediate file that is then used by a linker, the compiler may stream its output directly to the linker, thus enabling the linker to perform its functions in parallel with the compiler. The system may also use a data streaming facility, such as a pipe, to stream data between the compilation and linking processes.

Abstract: A computer-implemented method for analysing user traffic at a website that includes an article on at least one page, wherein the or each page includes a file stored at a website file server, the method comprising determining a set of topics for the article by computing respective measures for the probabilities of keywords appearing in the article, generating a graph representing actions performed on the article by a user, determining a set of shortest paths between respective ones of nodes of the graph, and computing a statistical measure for user traffic at the website.

Abstract: Described is a technology for reducing the layout complexity of a graph, e.g., an STT graph. Nodes with similar incoming and outgoing links are grouped as candidate groupings to possibly be clustered. For each candidate grouping, if the nodes in the candidate grouping and/or the candidate grouping meet clustering criteria, the candidate grouping is clustered into a clustered node. The criteria may include user-specified parameters directed towards the nodes and/or the candidate groupings. For example, a node is removed from a group if the number of incoming links thereto or the number of outgoing links therefrom exceed maximum incoming and outgoing parameter values, respectively. A group is only clustered if the number of nodes therein meets a minimum size parameter.

Abstract: A data management and archive method and apparatus, for implementation in an automated system to monitor and manage status, performance and configuration data for networked storage components. Analysis and cross-correlation of data related to the storage components can be done individually, collectively and/or comparatively. A collection manager component of a workload analyzer is implemented to start and stop data collection. The collection manager includes a command and control module that coordinates requests of data from at least one collection agent configured on at least one host connected to the storage component(s). The collection manager manages collection of data and effects file transfer of collected data according to a user specified policy, and maintains status of the data collected. The user specified policy allows the user to specify data collection “shifts” (i.e. periodicity).

Abstract: A logic diagram search device of the present invention includes a movement amount estimation section, a computation element/signal line correspondence calculation section, and a similarity degree calculation section. The movement amount estimation section estimates a diagram movement amount between a criterion diagram and a comparative diagram based on a coordinates variation amount. The computation element/signal line correspondence calculation section generates correspondence between a signal line in the criterion diagram connecting the computation elements that have been objects of a correspondence generation operation and a signal line in the comparative diagram connecting the computation elements that have been objects of the correspondence generation operation. The similarity degree calculation section calculates the degree of similarity between the criterion diagram and the comparative diagram based on the computation elements and the signal lines for which the correspondence is generated.

Abstract: Determining and storing at least one validated results set in a global ontology database for future use by an entity that subscribes to the global ontology database. If global ontology data is stored in a global ontology database, attempt to determine a mapping between first and second ontologies. If a mapping between the first and second ontologies can be determined from the global ontology data, the mapping is validated and the validated mapping is defined as a validated results set. If global ontology data is not stored in a global ontology database or a mapping between the first and second ontologies can not be determined from global ontology data stored in the global ontology database, the first and second ontologies are unified by determining a mapping between the first and second ontologies, the mapping is validated and the validated mapping is defined as a validated results set.

Abstract: An approach is provided that visually distinguishes between entity types in a communication system. A Data store with entities is queried, with entities connected to one another as senders and receivers, resulting in a query result. A node data structure corresponding to each of the entities is created and an edge data structure corresponding to each of the connections between the entities is also created. Nodes corresponding to the node data structures are displayed, along with edges (e.g., connection lines) corresponding to the edge data structures. A user selects one of the nodes that is displayed, and the selected node is visually highlighted. Different types of non-selected nodes are identified based on the selected node. Types of nodes may include sender type nodes, receiver type nodes, and sender/receiver type nodes. The types of identified nodes are highlighted in a manner that visually distinguishes each type from the other types.

Abstract: A sequence of events may be planned by drawing on knowledge of existing sequences of events, and combining those events in accordance with a set of constraints. In one example, the sequences of events are events in a social agenda, such as dinner, drinks, movie, etc. Actual social agendas that users have carried out are monitored (with the users' permission), and these events are stored in a database. A sequence of events may be referred to as an existing path. Using the database, a system can respond to a query such as “plan an evening in Seattle,” or “plan an evening in that includes a movie” by querying the database to determine what sequences have already happened, and either retrieving an existing sequence or synthesizing a new one from existing sequences.

Abstract: A method for navigating an acyclic graph includes the steps of generating two or more acyclic graphs, each of the two or more acyclic graphs relating to a specific topology, wherein at least two of the two or more acyclic graphs include at least one common node; receiving a request to generate a composite acyclic graph, wherein the composite acyclic graph includes the at least one common node; generating the composite acyclic graph; and displaying the specific node of the composite acyclic graph.

Abstract: Techniques for data assignment from an external distributed file system (DFS) to a database management system (DBMS) are provided. Data blocks from the DFS are represented as first nodes and access module processors of the DBMS are represented as second nodes. A graph is produced with the first and second nodes. Assignments are made for the first nodes to the second nodes based on evaluation of the graph to integrate the DFS with the DBMS.

Abstract: Systems and methods for social graph data analytics to determine the connectivity between nodes within a community are provided. A user may assign user connectivity values to other members of the community, or connectivity values may be automatically harvested, calculated, or assigned from third parties or based on the frequency of interactions between members of the community. Connectivity values may represent such factors as alignment, reputation, status, and/or influence within a social graph within the network community, or the degree of trust. Social graph data analytics may be used to determine a network connectivity value from all or a subset of all of the retrieved paths and/or one or more connectivity statistics value associated with the first node and/or the second node. A parallel computational framework may operate in connection with a key-value store to perform some or all of the computations related to the connectivity determinations.

Abstract: A planning and search system are described wherein a graph search and segment matching are used to handle very large searches at a higher speed.

Abstract: The invention is directed to a Product Lifecycle Management (PLM) update process for updating objects with respect to specifications. The process invokes dependence relations between objects. It relies on building a directed graph, wherein objects are the nodes of the graph. An arc (also called “edge”) is directed from a second object to a first object, the latter depending on the second object according to dependence relations of the PLM system. Thus, the update can be carried by browsing the graph along the direction of the arcs in the graph. Owing to the reversion of the graph with respect to the dependence of objects, the simple solution of the invention guarantees that the update of an object occurs only when the ancestor object it depends on is up to date, and so on. This drastically reduces failures at update in practice.

Abstract: An apparatus, and corresponding method, for generating a graph used in performing a search for a match of at least one expression in an input stream is presented. The graph includes a number of interconnected nodes connected solely by valid arcs. A valid arc may also include a nodal bit map including structural information of a node to which the valid arc points to. A walker process may utilize the nodal bit map to determine if a memory access is necessary. The nodal bit map reduces the number of external memory access and therefore reduces system run time.

Abstract: Disclosed in one example is a method for searching. In some examples, the method includes receiving an unstructured search query, parsing the unstructured search query into a plurality of structured search attributes using a search term attribute dictionary, performing a search of a structured database based upon the plurality of structured search attributes to identify a plurality of search results, populating a plurality of form fields of a search form with the plurality of structured search attributes, and displaying the search form in association with the search results.

Abstract: Users are enabled to quickly and easily associate records representing entities such as themselves, other users, contacts, accounts, teams/groups, and similar ones employing a record of the association and assign each entity a role or other attributes as a part of this association. Relationship records and attributes preserving entity association information allow teamwork, communication, and collaboration for effective management of business processes. The records and attributes also enable visualization and facilitate deeper understanding of the relationships between people, data, and business processes.

Abstract: In one aspect, dynamic determination generates a storage resource graph corresponding to a storage topology. The generating may comprise iterating through storage resources in the storage topology and using a discovery handler to generate a node in the storage resource graph corresponding to each of the iterated storage resources. Dynamic determination generates an operation graph by iterating through nodes in the storage resource graph and using an operating handler to generate operation-specific metadata corresponding to each iterated node of the storage resource graph. Dynamic generating executes the operation graph in a way specific to the operation.

Abstract: Computer implemented method, system and computer usable program code for facilitating utilization of data. A computer implemented method for facilitating utilization of data includes receiving data, wherein the received data is in a first representation. The received data is converted from the first representation to a common representation that is mapped to the first representation using an external configuration file. The common representation of the data is output to facilitate utilization of the data.

Abstract: The present invention provides a method, system, and program product for managing adapter association for a data graph of data objects. Specifically, under the present invention, a data graph of data objects is generated (e.g., on a server), and then serialized. In performing the serialization, the data graph is translated into bits. In one embodiment, the bits are communicated to a client over a network, and then translated back into the data graph (i.e., deserialized). An adapter is associated with each of the data objects after the data graph is deserialized. This avoids the “overhead” involved with associating and having active adapters during deserialization.

Abstract: Described herein is a technology for visualizing data. In accordance with some implementations, dimension metadata is automatically extracted from multiple documents. The extracted dimension metadata may be used to populate one or more relation dimensions. Based on the dimension metadata, one or more relations between the documents are determined along the one or more relation dimensions. A relation graph is presented to represent the documents interconnected by the one or more relations.

Abstract: Disclosed are methods in which ontologies are automatically (i.e., with little or no human interaction) constructed from data. The constructed ontology may be provided for use by an application or device. An ontology may be constructed as follows. Firstly, a lexical graph is constructed. Secondly, a concept-detection process is performed on the lexical graph to detect concepts (prominent terms) in the lexical graph. Thirdly, a clustering method is performed on the lexical graph to form groups of concepts. Fourthly, relationships between the concepts are determined based on the interconnections of the concepts in the groups. Lastly, the concepts and detected relationships therebetween are structured using a formal ontology specification.

Abstract: A system and method for generating a virtual tour on a display device is described. The method comprises providing at least one map. The method further comprises providing a plurality of sequenced images, wherein each of the images is associated with at least one location by a geo-coding module configured to generate a geo-location object data sheet that associates sequential images with a corresponding location. The sequenced images are organized based on the location of each of the sequenced images and displayed on the map. The method is implemented by the system.

Abstract: A method for processing a graph structure includes providing a graph as a set of triples, each triple having a subject node, a predicate, and an object node, the predicate defining a relationship between a respective subject node and an object node. One of more triples in the set of triples are processed according to one or more attributes of each triple in the set of triples to permit accessing, querying, creating, and updating resource description framework (RDF) data structures in at least one of a script language and an object oriented language by providing a set of language extensions.

Abstract: A system and method for generating a virtual tour on a display device is described. The method comprises providing at least one map. The method further comprises providing a plurality of sequenced images, wherein each of the images is associated with at least one location by a geo-coding module configured to generate a geo-location object data sheet that associates sequential images with a corresponding location. The sequenced images are organized based on the location of each of the sequenced images and displayed on the map. The method is implemented by the system.

Abstract: Techniques are described herein that are capable of deep cloning (a.k.a. deep copying) objects using a binary format. A deep clone of a designated object includes references to other objects (and potentially copies of the other objects) included in the designated object. A binary representation of each object in an object graph is generated to provide a binary clone of the object graph. Objects created by a dynamic language engine are called dynamic language objects. Objects created by a host (e.g., that hosts the dynamic language engine) are called host objects. Each host object is associated with an intermediate representation thereof via a property bag that describes properties of that host object. Each intermediate representation is understandable by the dynamic language engine. A binary representation of each dynamic language object and each host object may be generated in accordance with the binary format to provide the binary clone.

Abstract: 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.

Abstract: Techniques for media generation and management are described, including retrieving data associated with an asset, processing the data to identify an asset type, the asset type and the data being used to configure an application framework, wherein one or more panels are dynamically determined by evaluating the asset type, the one or more panels being presented in the application framework and at least one of the one or more panels are configured to receive an input initiating an action performed on the asset, and presenting the asset and the one or more panels in an interface coupled to the application framework.

Abstract: Method and system for organizing and sharing content through experience are described. In one embodiment, content may be organized and shared among users through a specific experience. A method for sharing content in a network may include: collecting contents related to a specific experience from a specific user; generating an experience graph of the specific experience; enabling the specific user to invite other users to join the experience graph; and enabling each user inside the experience graph to share new content into the experience graph.

Abstract: A system gathers information on important and influential people and uses an ontology to build a social graph. The information is organized based on this social graph and provided to users as a service. The system uses ontology models to identify connectivity between entities (e.g., people, organizations, events, and things) in the social graph. Through its ontology, the system can determine, interpret, and represent the relationships of people that occur in the real world.

Abstract: An object graph can be transformed from a first form to a second form based on metadata discovered about objects of the object graph external to a corresponding object model. In one instance, transformation can correspond to serialization and deserialization.

Abstract: The claimed subject matter relates to an architecture that can identify, store, and/or output local contributions to a rank of a vertex in a directed graph. The architecture can receive a directed graph and a parameter, and examine a local subset of vertices (e.g., local to a given vertex) in order to determine a local supporting set. The local supporting set can include a local set of vertices that each contributes a minimum fraction of the parameter to a rank of the vertex. The local supporting set can be the basis for an estimate of the supporting set and/or rank of the vertex for the entire graph and can be employed as a means for detecting link or web spam as well as other influence-based social network applications.

Abstract: Computation execution can be visualized and debugged. A computation such as a database query plan graph can be extracted from a database query expression. Trace points can be injected into the database query expression while preserving original behavior. Query graphs can be generated with automatic inserting of mechanisms to connect to trace points, enabling visualization of query execution lifecycle states, collection of data traces across operators, and historical debugging with replay of data sets.

Abstract: Systems and methods for providing for display a map that graphically represents the association among documents are disclosed. A method for providing for display a map that graphically represents the association between a first document and a second document that analyzes the first document includes receiving, at a computer, a request to generate the map. The method further includes retrieving, from a database, analysis information related to the way in which the second document analyzed the first document, in response to the received request. The method further includes providing for display the map. The map includes a first node, a second node, and a connector. The first node corresponds to the first document. The second node corresponds to the second document. The connector graphically links the first node and the second node. The second node includes a graphical representation of the analysis information.

Abstract: Methods and apparatus are provided for interactive visualization of temporal event data and correlated outcomes. The temporal event data comprises a plurality of entities undergoing one or more events. The temporal event data is aggregated and a flow graph is generated to represent the aggregated temporal event data. The flow graph comprises a directed acyclic graph having a plurality of nodes connected by edges, wherein each of the nodes represents a group of entities in a given state. A view of the flow graph is generated and then a visualization of the flow graph view can be rendered to a user. The user can interact with the flow graph view and the visualization and/or the flow graph view can be updated based on the user interactions. The flow graph is sliced into layers, wherein a given layer i contains all nodes with i events.

Abstract: Described herein are systems and methods for providing data policy management over application objects in a storage system environment. An application object may comprise non-virtual or virtual objects (e.g., non-virtual-based applications, virtual-based applications, or virtual storage components). An application object manager may represent application objects by producing mapping graphs and/or application object data that represent application objects in a standardized manner. A mapping graph for an application object may describe a mapping between the application object and its underlying storage objects on a storage system. Application object data may describe a mapping graph in a standardized format. Application object data representing application objects may be received by an application policy manager that manages data policies on the application objects (including virtual applications and virtual storage components) based on the received application object data.

Abstract: A concurrent graph DBMS allows for representation of graph data structures in memory, using familiar Java object navigation, while at the same time providing atomicity, consistently, and transaction isolation properties of a DBMS, including concurrent access and modification of the data structure from multiple application threads. The concurrent graph DBMS serves as a “traffic cop” between application threads to prevent them from seeing unfinished and inconsistent changes made by other threads, and atomicity of changes. The concurrent graph DBMS provides automatic detection of deadlocks and correct rollback of a thread's incomplete transaction when exceptions or deadlocks occur. The concurrent graph DBMS may be generated from a schema description specifying objects and relationships between objects, for the concurrent graph DBMS.

Abstract: This technology concerns, in one aspect, using a person's social network graph data as a virtual visual cortex—taking image input from a smartphone or the like, and processing it with the graph data to yield a personalized form of processing based on the imagery. The user's network graph data is typically updated by such processing—providing a form of virtual image memory that can influence future social network behavior. In another aspect, the technology concerns identifying content (e.g., audio) by both fingerprint-based and watermark-based techniques, and arrangements employing such identification data. A great number of other features and arrangements are also detailed.

Abstract: Present invention relates to system and method for specifying and implementing IT systems, in particular for searching functionalities. Proposed is a method of specifying and system for implementing interactive systems used for data storing and analysis as well as supporting collaboration and human-computer interaction, which is based on a control flow network structure. The method and system include support for whole lifecycle of implemented systems along with their evolution in time. In particular system comprising directed control net comprising data containers and functionality codes search module for searching functionalities within directed control net by identifying input, and matching identified input with functionality code according to the directed control net structure for generating a group of identified functionalities.

Abstract: The present invention provides a visualization method and apparatus for multidimensional data. According to an embodiment, there is provided a visualization method for multidimensional data including a plurality of parameters to be viewed which are related to a given object, including: displaying the plurality of parameters to be viewed which are related to a given object in different layers along a Z axis of a 3-D coordinate system, wherein each of the plurality of parameters is displayed in a 2-D plane; determining one of the 2-D planes as an interested plane; and in response to focusing on an object instance of the object by a user, linking and displaying locations of the object instance on other planes.

Abstract: A system for information item categorization in which each non-leaf node in a hierarchical organization of nodes represents a category, and each leaf node represents an information item. A number P is associated with each node. For non-leaf nodes, the associated number P is selected from a subset of relatively prime elements chosen from an appropriate Unique Factorization Domain (UFD), such as a set of relatively prime numbers which are a subset of the familiar set of integers. For leaf nodes, P is set to 1. A number M is also associated with each node. For each root node, M is set to the value of P for that node. For each non-root node, M is set to the product of the M's of all parent nodes of the node and the P of that node.

Abstract: A search apparatus includes a graph memory, a root node specification receiving unit, and a search unit. The graph memory stores data of a graph having nodes representing data elements and a link representing a relationship between the data elements. The root node specification receiving unit receives a root node specified from among the nodes in the graph. The search unit searches for an adjacent node which is connected to a target node via a link and which satisfies a search condition that at least one of the target node and the adjacent node has a predetermined attribute. The search unit searches for an adjacent node using the root node as the target node. The search unit iteratively performs a process of searching for an adjacent node using a previously determined adjacent node as the target node for a subsequent iteration to obtain a concatenation of adjacent nodes.

Abstract: A system for generating statistics relating to recorded employee behavior, the system including: a first database of tasks performed by employees, the first database being stored on a computer-readable storage medium; a second database of actions taken by the employees while performing the tasks, the second database being stored on a computer-readable storage medium; and a software program, stored on a computer-readable storage medium, configured to extract information from the databases regarding the tasks performed by the employees as well as the actions performed by the employees while carrying out the tasks. The software program then calculates performance statistics relating to success or failure regarding a particular task. The software program furthermore sorts the employees into subgroups based on their status in the company and then calculates performance statistics for the subgroup to compare against individual performance within the subgroup.

Abstract: A data structure for storing items of information having a time of life includes a time of life interval for each item of information, and methods for using the same. The items of information are organized in a data structure having nodes and edges connecting the nodes. This data structure is preferably a directed acyclic graph structure. The data structure includes parent nodes and child nodes. The time of life interval specified for any child node generally is contained within the time interval specified for that child node's parent node, such that the data structure includes no child nodes with a time of life interval that falls outside of the time of life interval of its parent node.