Abstract: A method of determining the complexity of a collaborative effort which method includes receiving data via a processor, the data including identities of social actors or sets of social actors in the collaborative effort, and storing the data in a repository accessible by the processor; defining nodes, via the processor, and associating the nodes with each of the social actors of or with each of the sets of social actors in the collaborative effort to define nodes that represent each of the social actors or each of the sets of social actors; identifying, via the processor, one or more dimensions for each social actor; defining a coordination complexity (G), via the processor, and determining, for each dimension, a sum of a difference between every two of the nodes, multiplying the sum by a weight specific for that dimension, and adding each of the multiplied sums for each dimension. In another aspect, the invention includes a system of determining complexity of a collaborative effort.

Abstract: According to some embodiments, categories and an associated category graph may be determined for a parsing framework. Moreover, a type for the parsing framework may be defined, wherein at least one category is automatically created and inserted into the category graph for an implementation element of the defined type. Namespaces may be automatically defined for the categories based at least in part on inheritance relationships associated with the categories in the category graph.

Abstract: In particular embodiments, a method includes receiving an text query, identifying nodes and edges from a social graph that correspond to character strings from the text query, and then generating recommended queries that include references to the identified nodes and edges.

Abstract: According to an example, a dataflow directed acyclic graph including nodes and edges connecting the nodes. Parameters for the nodes are calculated, and the parameters may include batch size and a degree of parallelism.

Abstract: A system, a method, an apparatus, and a computer-readable medium are provided. Co-occurrences of words or terms in a group of text documents are determined. A score for each of the co-occurrences of words or terms is calculated. A graphic view is presented. The graphic view has nodes that include at least one word or term and edges that join at least two nodes and depict a relationship among the at least two nodes. A layout of the graphic view includes a minimum number of crossings of the edges.

Abstract: System and method for generating meta-data for a product is disclosed. An artifact repository stores first artifacts for building the product. The artifact repository stores first meta-data for one or more of the artifacts in the repository. A build manager builds second artifacts for the product from source code and one or more of the first artifacts based on information in a project script. The build manager is adapted to combine the first meta-data for each of the one or more of the first artifacts used to build the second artifact to form second meta-data for each of the second artifacts.

Abstract: Embodiments are directed towards providing a list of potential friends to a user based on an analysis of friends' contact lists. The user may provide a subset of friends within a contact list for analysis, along with a degree of separation over which to perform the analysis, and/or a minimum threshold number of occurrences for identifying a candidate friend. The subset of friends' contact lists may then be recursively traversed and merged, where common friends may be identified as members of a candidate set for suggesting friends to the user. In one embodiment, the candidate members may be retained within the candidate set if there is a commonality between the friends and the candidate that exceeds the minimum threshold. The candidate list may also be rank order using various approaches, including a weighted energy diffusion model based in part on a number of communications between the candidates.

Abstract: A data processing system employs a pre-processing step to create a simplified view of a received entity graph. During the pre-processing step, only the objects and the attributes of those objects within the graph that are required for data processing are selected. Pruned source and target objects are generated by omitting those attributes that are not required for processing. The pruned objects are included in the simplified view that enhances system performance.

Abstract: Keyword searching is used to explore and search large Resource Description Framework datasets having unknown or constantly changing structures. A succinct and effective summarization is built from the underlying resource description framework data. Given a keyword query, the summarization lends significant pruning powers to exploratory keyword searches and leads to much better efficiency compared to previous work. The summarization returns exact results and can be updated incrementally and efficiently.

Abstract: Keyword searching is used to explore and search large Resource Description Framework datasets having unknown or constantly changing structures. A succinct and effective summarization is built from the underlying resource description framework data. Given a keyword query, the summarization lends significant pruning powers to exploratory keyword searches and leads to much better efficiency compared to previous work. The summarization returns exact results and can be updated incrementally and efficiently.

Abstract: In particular embodiments, a method includes receiving an unstructured text query, identifying nodes and edges from a social graph that correspond to n-grams in the text query, and then generating structured queries that include references to the identified nodes and edges.

Abstract: Some embodiments of a system and a method to implement a hierarchical registry federation have been presented. For instance, a registry federation can be stored in a set of one or more storage devices, the registry federation including multiple registries, each registry having one or more records. The registries can be organized in an oriented graph such that each registry is logically connected to another registry in the registry federation as a parent registry or a child registry.

Abstract: Techniques for managing system information are disclosed. In one embodiment, a piece of system information is received, a synthesized link is created linking a system information identifier corresponding to the system information to a synthesized group identifier, the synthesized group identifier represents a group to which the synthesized information/synthesized information identifier belongs.

Abstract: A system and method for determining a set of visualization points from any given two-dimensional dataset to best describe a given visual analytic. A first user selection is received in a data processing apparatus for a chart. A chart type associated with the first user selection is identified for the chart. One or more visualization strategies are accessed from a strategy pool database based on the chart type. A second user selection is received in the data processing apparatus for a two-dimensional dataset from a data provider in communication with the data processing apparatus. The two-dimensional dataset is analyzed to determine a best strategy from the one or more visualization strategies accessed from the strategy pool database. Metadata representing the two-dimensional dataset is generated based on the best strategy, and a display representing the metadata is generated to visualize the two-dimensional dataset according to the best strategy.

Abstract: Techniques are described for graph partitioning, and in particular, graph bisection. A combinatorial lower bound is provided that is computed in near-linear time. These bounds may be used to determine optimum solutions to real-world graphs with many vertices (e.g., more than a million for road networks, or tens of thousands for VLSI and mesh instances). Combinatorial techniques that reduce the size of the branch-and-bound search tree may use tree packing, assign vertices to trees, and use fractional assignment of vertices to trees. For graph bisection, each node of the branch-and-bound tree corresponds to a partial assignment of vertices to both cells or sets of vertices.

Abstract: An embodiment of a system for representing connectedness of individuals includes nodes representative of individuals and strands connecting the nodes. The nodes include a first node representative of a first individual and a second node representative of a second individual. The strands connect the first node and the second node. Each of the strands represents a type of relationship between the first individual and the second individual. In some embodiments, each of the strands is in the form of a distinct data object.

Abstract: In one embodiment, an approach to automated recurring concept extraction, from a plurality of input data models (schemas) is presented. The approach converts input data models to graphs, with typed elements. The graphs are mined for closed subgraphs that have a defined minimum support. The identified subgraphs can be filtered with a relevance metric. These subgraphs are converted to schemas or an appropriate representation, and stored for reuse in a repository. The repository can be used to automate further transformation or mapping of schemas presented to a system that uses the repository. In one example, the repository is used in a schema covering process to perform schema transformation.

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: Systems and methods are disclosed for providing a meta-social graph. In accordance with one implementation, a computerized method comprises collecting a plurality of different online identities of a first online user, each of the different online identities corresponding to a unique social network system. The method also includes collecting a plurality of communication data associated with the first user and determining bi-directional connections of the first user with other users from the collected communication data. In addition, the method may also include creating a meta-social graph from the determined bi-directional connections and the plurality of different online identities and generating a global identifier for the first user. The method also includes storing, in at least one memory device, the meta-social graph with at least one of the generated global identifier, the determined bi-directional connections, and the collected communication data.

Abstract: Methods and apparatuses for constructing a multi-level solver, comprising decomposing a graph into a plurality of pieces, wherein each of the pieces has a plurality of edges and a plurality of interface nodes, and wherein the interface nodes in the graph are fewer in number than the edges in the graph; producing a local preconditioner for each of the pieces; and aggregating the local preconditioners to form a global preconditioner.

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: The invention broadly and generally provides, in a computer-controlled display, a method of simplifying a graphical representation of a set of connected nodes comprising the steps of: (a) selecting a subset of the aforesaid set; and (b) under computer program control, hiding representations of all nodes except (i) nodes within the aforesaid subset and (ii) at least one node having a defined relationship to the aforesaid subset.

Abstract: Methods, and systems, including computer programs encoded on computer-readable storage mediums, including a method for providing a graph that includes entity nodes, label nodes and weighted connecting edges. The method comprises computing an aggregated incoming between-entity edge weight for the entity nodes. When there are positively-weighted incoming between-entity edges into the entity node, the method comprises replacing each of the between-entity edge weights by a pre-normalized between-entity edge weights. The method comprises computing an aggregated from-label weight for the entity node. When there are positively-weighted from-label node edges, the method comprises replacing the corresponding label weights by pre-normalized from-label weights. The method comprises determining influence values for a first, second and third influence factors, where the influence factors have values that sum to one.

Abstract: Metadata search is enhanced by utilizing relationship data indicating relationships between metadata items. A server generates an index mapping metadata items to terms associated with the metadata items and a graph describing relationships between each of the metadata items. When the server receives a search request, the server locates a candidate set of the metadata items based on the search term(s) and the index. The server performs a link analysis of the graph to determine a relationship score for each metadata item. For each particular metadata item in the candidate set of the metadata items, the server calculates a ranking score based at least on the relationship score for the particular metadata item. The server generates a ranked result set based on comparing the ranking scores for the candidate set of metadata items. The server then provides information indicating the ranked result set in response to the search request.

Abstract: A data processing system processes transaction database information to predict future demand using data regression techniques to extract trend line information from historical pattern frequency values. By extrapolating the trend line, a predicted pattern frequency value may be calculated. By applying regression techniques (such as least-squares approximation), the trend line information may be extracted and projected to predict the future pattern frequency which may be applied to calculate the expected value of a recommendation rule.

Abstract: In one exemplary embodiment, a computer-implemented method of generating an implicit social graph is provided. The method can include the step of receiving a first eye-tracking data of a first user. The first eye-tracking data can be associated with a first component. The eye-tracking data can be received from a first user device. A second eye-tracking data can be received from a second user. The second eye-tracking data can be associated with a second visual component. The second eye-tracking data can be received from a second user device. One or more attributes can be associated with the first user. The one or more attributes can be determined based on an association of the first eye-tracking data and the first visual component. One or more attributes can be associated with the second user. The one or more attributes can be determined based on an association of the second eye-tracking data and the second visual component.

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: Defense-in Depth security defines a set of graduated security tasks, each of which performs a task that must complete before another task can complete. Only when these tasks complete successfully and in the order prescribed by Defense-in-Depth security criteria is a final process allowed to execute. Through such Defense-in-Depth security measures, vulnerable software, such as bytecode, can be verified as unaltered and executed in a secure environment that prohibits unsecured access to the underlying code.

Abstract: Dynamic management of multiple persistent data stores is disclosed. One or more data objects are retrieved from two or more of a plurality of persistent data stores and provided to the client context in a manner such that the one or more data objects appear to the client context to come from a single source, even if in fact the objects have been retrieved from two or more different persistent stores.

Abstract: Techniques for processing queries are provided. In one approach, an execution plan for a query includes multiple sub-plans, one or more of which are selected at runtime while one or more other sub-plans are not executed during execution of the execution plan. In another approach, data about misestimate is generated and stored persistently for subsequent queries. In another approach, statistics for a database object are generated automatically and efficiently while the database object is created or data items are added thereto. In another approach, a hybrid histogram is created that includes a feature of frequency histograms and a feature of height-balanced histograms. In another approach, computer jobs are executed in such a way to avoid deadlock. In another approach, changes to a database object trigger a hard parse of a query even though an execution plan already exists for the query.

Abstract: Ranking and selecting entities based on calculated reputation or influence scores is provided. In some embodiments, a method includes determining whether a first entity is a subject or an object; determining whether a second entity is a subject or an object; and generating a graph, in which a subset of the graph is a subject graph of subject nodes that includes at least one or more subjects (e.g., subject entities) linked to one or more other subjects, and in which the graph includes one or more objects (e.g., object entities) each linked to one or more subjects in the subject graph. In some embodiments, the graph includes directed and undirected links. In some embodiments, the graph includes one or more objects linked to one or more objects.

Abstract: Computer-implemented method, system, and computer program product for processing data in an out-of-order manner in a streams computing environment. A windowing condition is defined such that incoming data tuples are processed within a specified time or count of each other. Additionally, the windowing condition may be based on a specified attribute of the data tuples. If the tuples are not processed within the constraints specified by the windowing condition, the unprocessed tuples may be discarded, i.e., not processed, to optimize operator performance.

Abstract: Computer-implemented method, system, and computer program product for processing data in an out-of-order manner in a streams computing environment. A windowing condition is defined such that incoming data tuples are processed within a specified time or count of each other. Additionally, the windowing condition may be based on a specified attribute of the data tuples. If the tuples are not processed within the constraints specified by the windowing condition, the unprocessed tuples may be discarded, i.e., not processed, to optimize operator performance.

Abstract: A directed graph comprises a plurality of nodes including a root node and a non-root node. Each of the plurality of nodes has a plurality of directed edges. The directed graph is traversed, with the plurality of nodes being visited according to an order of the directed edges of each of the plurality of nodes. The directed edge that leads to the non-root node is discarded when the non-root node is visited for the first time during the traversal of the directed graph.

Abstract: Highly relevant search results for unstructured queries are efficiently identified from normalized data. A server graphs relationships between each of the data objects. For each search term, the server identifies a candidate set of data objects mapped to the term. The server calculates priority scores for the candidate data objects based at least in part on one or more of: a link analysis of the graph; or an analysis of metadata describing structural constraints upon the candidate data objects. Based on the graph, the server identifies one or more search result subgraphs, each comprising at least one data object from each of the candidate sets. The server looks for subgraphs in an order that is based on the priority scores for the candidate data objects. The server may terminate its search early, in part because prioritizing the candidate data objects increases the likelihood of receiving relevant search results first.

Abstract: A graph database storage system contains a graph database that has multiple graph nodes. A first pointer points from a particular graph node to a particular synthetic context event node in a synthetic context event database. A second pointer points from the particular synthetic context event node in the synthetic context event database to a particular data store in a data structure, such that the first pointer and the second pointer associate the particular data store with the particular entity represented in the graph database via the particular synthetic context event node.

Abstract: The present invention pertains to a method for delivering messages in a social network to increase a signal-to-noise ratio for the recipients of messages, characterized in that a process mechanism comprises of a diffusion process and a selection process combined through an adaptive process, in which: the diffusion process dispatches each message through dynamic routing graphs defined between the sender user and a set of potentially interested recipient users; the selection process locally filters the messages that are transmitted from sender users and received by potentially interested recipient users, according to the result of the application of a selection function on the metadata values constituting a message profile extracted from each transmitted message and weighted feature values constituting a user profile of the recipient to establish an estimate of interest for the user regarding each message, and the adaptive process continuously adjusts processing functions to adapt the graphs structure accord

Abstract: A method for modeling a process includes receiving a plurality of graphs representing processes wherein for each graph. A sequence of process steps of the processes are represented as nodes and edges connecting pairs of nodes represent transitions between process steps. A numeric value representative of graph appearance for each of the plurality of received graphs is calculated. Each of the plurality of received graphs is stored within a tree-like data structure according to its corresponding numeric value. Each of the above steps is performed using a computer system.

Abstract: Methods, systems, and computer-readable storage media for receiving a plurality of source hierarchical schemas, processing the source hierarchical schemas to generate a merged graph, which is comprising a plurality of merged nodes, each merged node being provided based on one or more nodes from at least two of the source hierarchical schemas, determining and resolving using conflicts in the merged graph to generate a conflict-free merged graph, wherein resolving comprises splitting one or more merged nodes into respective sub-sets of merged nodes, defining and processing a constraints satisfaction problem (CSP) to generate a plurality of mediated hierarchical schemas (MHSs), each MHS being a solution to the CSP, identifying an MHS of the plurality of MHSs as an optimum MHS, wherein a canonical hierarchical schema (CHS) is provided as the optimum MHS, and storing the CHS as a computer-readable document in a computer-readable memory.

Abstract: In a network environment between a group of endpoint computing devices, where content is shared between the group of endpoint computing devices via a social network platform, techniques are described herein for receiving a social activity feed associated with the social network platform, the social activity feed including activities occurring within the social network platform. An algorithm is applied to a social graph of a user at an endpoint computing device of the group to determine a prioritization of nodes within the user's social graph, activities within the social activity feed are associated with nodes of the user's social graph, and recommendations are provided to the user of activities within the social activity feed that correspond with prioritized nodes of the user's social graph.

Abstract: An embodiment of the invention pertains to a weighted directed graph comprising multiple nodes and edges that each extends between two nodes. The embodiment includes processing edges to generate a forward and reverse edge corresponding to each edge. Forward and reverse edges are processed to generate indirect edges, each comprising two edge components, and extending between two nodes. One node associated with each forward edge, each reverse edge, and each indirect edge is selected to be the key node of its associated edge. All forward, reverse and indirect edges having a particular node as their respective key nodes are placed into a group. All edges of the group are then selectively processed to provide information pertaining to an egonet of the graph that has the particular node as its egonode.

Abstract: Methods and systems for indexing, storing, recalling and displaying social network user profiles, event calendar postings and user feed postings are described. A single, discrete set of keywords, can be utilized and assigned to both user profiles and postings and can operate as a method of indexing. The assignment of these keywords may allow users to control the display of calendar and feed content by matching assigned posting keywords to assigned profile keywords via a matching algorithm. Matched event-related postings may also be automatically displayed in a user's calendar. Searches of profiles and postings may also be performed by constructing queries using the same set of discrete keywords attached to profiles and postings. Users may have the ability to control the display of specific profile information and postings via privacy settings, which utilize unique methods of tracking relationship segmentation and social distance.

Abstract: Systems and methods for managing and evaluating a social network. The social network is represented as a graph structure and stored in distributed memory. A viable path from one node that is not directly connected to another node in the graph structure may be determined by traversing the graph in stages, moving outward from each node in stages until common midpoint nodes are found providing a connection between the nodes. When midpoint nodes are found, the paths connecting the one node to the other node may be reconstructed.

Abstract: A context-based graph-relational intersect derived (CB-GRID) links a real entity graph node to a synthetic entity graph node. The real entity graph node comprises a pointer to a primary key in a first tuple that non-contextually describes the real entity. A primary relational database comprises the first tuple that non-contextually describes the real entity. A context relational database comprises a second tuple that contains a foreign key that matches the primary key in the primary relational database. The second tuple dynamically describes a context of data in the first tuple. A contextual entity relational database comprises a third tuple that contains data from the first tuple and the second tuple. The synthetic entity graph node describes a synthetic entity that is described by data in the third tuple, such that the contextual entity relational database links the real entity graph node to the synthetic entity graph node.

Abstract: A graph database storage system contains a graph database that has multiple graph nodes. A first pointer points from a particular graph node to a particular synthetic context event node in a synthetic context event database. A second pointer points from the particular synthetic context event node in the synthetic context event database to a particular data store in a data structure, such that the first pointer and the second pointer associate the particular data store with the particular entity represented in the graph database via the particular synthetic context event node.

Abstract: Systems and methods for automatically processing a textual document by identifying occurrences of a piece of text having a predetermined format in the textual document; determining a depth-of-treatment value for each piece of formatted text in the textual document, the depth-of-treatment value indicating a depth of treatment in the textual document afforded to the particular piece of formatted text; associating an abstract with each piece of formatted text in the textual document; and generating a data record containing each identified piece of formatted text from the textual document, the depth-of-treatment value and the abstract associated with each piece of formatted text in the textual document.

Abstract: A method for generating a tree-type data structure composed of a plurality of data strings includes the steps of: summing, with respect to a plurality of data strings classified in a parent node, the numbers of data types of data, respectively, at least one given string position in each of the plurality of data strings; and classifying, based on the numbers of the data types respectively summed at the at least one given string position in the summing step, the plurality of data strings into a plurality of child nodes, for the respective data types at a given string position.

Abstract: Systems and processes for storing correlated data in a graph database are described. A first user node may be stored. In response to a request, a first event node and a second user node may be stored. The first event node may be associated with the first user node through an edge indicating participation. The first event node may be associated with the second user node through an edge indicating participation. In response to a content access, a second event node and a content node may be stored. The second event node may be associated with the first user node through an edge indicating participation. The second event node may be associated with the content node through an edge indicating usage. The first user node may be associated with the content node through an edge indicating the first user node handles the content node.

Abstract: A context-based graphical database system for storing a data structure comprises an entity node that stores an identifier of an entity. A data node stores non-contextual entity data about the entity. At least one context node is linked to the data node. The at least one context node provides context to the non-contextual entity data in the data node to create contextual entity data. A pointer from the entity node to the data node returns a data node identifier to the entity node to link the contextual entity data to the entity.

Abstract: A method for use in analysing time series data, the method including determining a relationship coefficient between each pair of a plurality of data sets, each data set being indicative of variable values of a corresponding variable over time, and the relationship coefficient being indicative of a degree of relatedness between the pair of data sets, displaying a first representation including first nodes indicative of first data sets, the first data sets being selected ones of the data sets, determining selection of at least two second data sets from the first data sets and displaying a second representation, the second representation including an animation over time of a second node, the second node being animated based on the variable values for the second data sets.