Abstract: A method for creating a reference in a scoped memory system, the scoped memory system including a scope graph of scoped memory areas, wherein each scoped memory area is suitable for the allocation of objects therein for access by software threads and has associated a thread count for indicating that the scoped memory area is discardable, the method comprising the steps of: allocating a target object in a target scoped memory area; storing an index associated with the target object of a depth of the target scoped memory area in the scope graph; allocating a source object in a source scoped memory area; storing an index associated with the source object of a depth of the source scoped memory area in the scope graph; in response to a determination that the source scoped memory area is at the same depth as or deeper than the target scoped memory area by comparing the index associated with the source object and the index associated with the target object, creating a reference from the target object to the source o

Abstract: A method includes atomically reading a next field of a current element of the linked list to determine a first value that encodes a first pointer to the first element and a first indication of an owner of the first element. The first indication of the owner is stored in a first of a plurality of multi-field reservation data structures. The operation includes determining whether the next field of the current element still indicates the first value. The operation includes reading the first element of the linked list via the first pointer if the next field of the current element still indicates the first value. If the next field of the current element indicates a current value different than the first value, the first indication of the owner is removed from the first multi-field reservation data structure, and storing and determining with the second value is repeated.

Abstract: Systems and methods for use in representing a path in a graph of nodes. A computing device determines an acyclical collection of primary edges that collectively reach all nodes within the graph, and also determines one or more secondary edges (e.g., edges other than the primary edges) between nodes of the graph. The computing device further determines a path between a first node of the graph and a second node of the graph. The path includes one or more of the primary edges and one or more of the secondary edges. The computing device represents the path as an abbreviated path including the first node, the second node, and the secondary edges in the path. The abbreviated path excludes one or more of the primary edges in the path.

Abstract: The subject matter of this specification can be embodied in, among other things, a method that includes determining, for a portion of users of a social network, label values each comprising an inferred interest level of a user in a subject indicated by a label, associating a first user with one or more second users based on one or more relationships specified by the first user, and outputting a first label value for the first user based on one or more second label values of the one or more second users.

Abstract: A computer-implemented method of extracting key phrases from a document is disclosed comprising the steps of accessing a repository comprising linked subjects, the repository comprising first and second data structures representing the relationship between said subjects using different representation criteria; pruning the first data structure by removing links between subjects based on a further relationship between said subjects in the second data structure; matching phrases in said document to subjects in the pruned first data structure; further pruning the pruned first data structure by removing unmatched subjects that are not linked to matched subjects; determining a ranking for each matched subject; and selecting key phrases using the determined subject rankings. A computer program for implementing the steps of this method when executed on a computer is also disclosed.

Abstract: Information values are created by nodes and directed edges describing dependencies between two nodes or information values, respectively, in the form of a directed graph for a database query. By using a path distance describing a number of directed edges between a selected node and a target tuple, formed of two nodes connected to a directed edge and a associated directed edge, a reduction of a complexity of a database query and thus an acceleration of the database query can be achieved. The search method can be used, for example, for monitoring systems or in medical databases. Furthermore, the search method can be used for databases which are dynamically extended, for example by new events in the monitoring system.

Abstract: A data structure for representing information as a binary directional graph comprising a set of points connected by three distinct types of directed edges. Each point must have a unique left (parenting) edge and a unique right (parenting) edge with end points, and an identity edge that can be null (i.e. have no end point). All connected paths of edges upwards eventually converge at a maximal point in the structure. The points are uniformly assigned a fixed set of data as their content. Rules are defined to construct the structure and allow representation of information, with methods described for translating conventional forms of representation, such as tables, properties, classes, relations, and functions. The structure can be represented as a single relation (i.e. a single table with a fixed structure) and can be implemented using a conventional relational database.

Abstract: A method of generating a skip list is disclosed. The skip list comprises a data structure for referencing a plurality of ordered nodes, the data structure having a plurality of linked lists, a total number of the plurality of linked lists being constrained by an available memory of a memory system, the method comprising the steps of inserting a first node of the plurality of nodes into a predetermined linked list of the plurality of linked lists of the data structure of the skip list in the available memory; promoting the first node to one or more other linked lists based on a first set of criteria; and generating the skip list by inserting at least a second node of the plurality of nodes into the data structure and promoting the second node based on a second set of criteria, said second set of criteria being different from the first set of criteria.

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: A method for service creation based on graph mapping including constructing a graph having leaf nodes in an environment including business support nodes associated with respective services and operations support nodes including attribute models, identifying a plurality of services at a level of the leafs in the graph, extending the graph by representing existing services offerings in terms of operation level service definitions and new services at the level of the leafs, and re-combining leaf nodes to define new services at service creation time.

Abstract: A method, system, computer program product and computer readable media for matching using degree distribution information are disclosed. An embodiment of the method can include performing b-matching on a graph data structure expanded using degree distribution information in order to identify neighbors of a selected input node. The b-matching can be performed using belief propagation. The belief propagation method is adapted to use a compressed message update rule and to be suitable for use with distributed processing systems. An embodiment can also include enhancing a matching result by applying degree distribution information to a first matching result to generate a second matching result. Embodiments for online advertisement/search term matching, product recommendation, dating service and social network matching, auction buyer/seller matching and resource allocation, among other, are disclosed.

Abstract: Described herein is using type information with a graph of nodes and predicates, in which the type information may be used to determine validity of (type check) a query to be executed against the graph. In one aspect, each node has a type, and each predicate indicates a valid relationship between two types of nodes. A type checking mechanism uses the type information to determine whether a query is valid, which may be the entire query prior to query processing/compilation time, or as the query is being composed by a user. One or more valid predicates for a given node may be discovered based upon the node type, such as discovered to assist the user during query composition. Also described is using the type information to optimize the query.

Abstract: An educational institution (also referred as a university) is rich with multiple kinds of data: students, faculty members, departments, divisions, and at university level. Relating and correlating this data at and across various levels help in obtaining a perspective about the educational institution. A structural representation captures the essence of all of the relationships in a unified manner and an important aspect of the relationship is the so-called “influence factor.” This factor indicates influencing effect of an entity over another entity, wherein the entities are a part of the structural representation. A system and method for the construction of such a structural representation of an educational institution based on the educational institution specific information is discussed.

Abstract: A method and system for performing a graph search, includes constructing an abstract representation of the graph using state-space abstraction. The abstract representation of the graph includes one or more abstract nodes having duplicate detection scopes and one or more abstract edges having operator groups. The duplicate detection scopes of the abstract nodes are partitioned into smaller duplicate detection scopes using edge partitioning. The abstract edges include the smaller duplicate detection scopes. Nodes in the current search layer are expanded using the operator groups of outgoing abstract edges of the abstract nodes the nodes map to. The operator groups associated with abstract edges having disjoint duplicate detection scopes are used to expand the nodes in parallel. Once all the operator groups in the current search layer have been used for node expansion the method progresses to the next search layer.

Abstract: A graph traversal system is described herein that efficiently identifies strongly connected components with entries, exits, and corresponding edges at the same time. Entry and exit nodes can be recognized by scanning every node after the strongly connected components have been identified, but revisiting these nodes incurs undesirable overhead. The graph traversal system identifies entries and exits during a single pass while the strongly connected components are being identified. In addition, the system modifies the semantics for some applications so that a single node all alone is not considered to be a strongly connected component. Thus, the graph traversal system allows efficient identification of entries to and exits from strongly connected components in a manner that can be applied to a variety of computer software problems that use directed graphs for data structures.

Abstract: The automated social networking graph mining and visualization technique described herein mines social connections and allows creation of a social networking graph from general (not necessarily social-application specific) Web pages. The technique uses the distances between a person's/entity's name and related people's/entities names on one or more Web pages to determine connections between people/entities and the strengths of the connections. In one embodiment, the technique lays out these connections, and then clusters them, in a 2-D layout of a social networking graph that represents the Web connection strengths among the related people's or entities' names, by using a force-directed model.

Abstract: A first dependency graph representing one or more dependencies in a first computing domain in a computer system can be generated. The first dependency graph can include a reference to an object in a second computing domain that is different from the first computing domain. A second dependency graph can be generated using the reference to the object. The second dependency graph can represent one or more dependencies in the second computing domain in the computer system, and the one or more dependencies represented in the second dependency graph can include one or more dependencies of the object.

Abstract: A computer-implemented method identifies nodes that are beneficiaries of node importance inflating links in a directed graph of linked nodes. The directed graph of linked nodes corresponds to a linked database, and the nodes correspond to documents within the linked database. The method is performed by a computer system including one or more processors and memory storing one or more programs, the one or more processors executing the one or more programs to perform the method. The method includes computing, for each of at least a subset of the nodes in the directed graph, a respective quantity corresponding to a mathematical derivative of a node importance function, and performing a remedial action on a respective node in the directed graph in accordance with the respective computed quantity computed for the respective node.

Abstract: An apparatus and a method for forming a concurrent linked hash map is described. Doubly linked nodes of a linked list are formed in a data container of a networked memory. A hash table is generated from the doubly linked nodes. A parent node is located in the hash table to update a reference of a node in the data container. The parent node is processed in a forward direction of the linked list.

Abstract: Methods and apparatus are provided for developing user profiles via search query analysis and linking the user profiles and data sources, to adaptively facilitate the discovery, transfer, and distribution of pertinent knowledge. A user profile builder, linker, and manager analyze users' search queries to learn their interests and habits, build user profiles to reflect the users' interests and habits, and link together profiles of the users with common interests. A data harvester utilizes the user profiles to provide pertinent data to the users based on their interests and habits or those of other users with common interests.

Abstract: A method to expose status information is provided. The status information is associated with metadata extracted from multimedia files and stored in a metadata database. The metadata information that is extracted from the multimedia files is stored in a read queue to allow a background thread to process the metadata and populate the metadata database. Additionally, the metadata database may be updated to include user-define metadata, which is written back to the multimedia files. The user-defined metadata is included in a write queue and is written to the multimedia files associated with the user-defined metadata. The status of the read and write queues are exposed to a user through a graphical user interface. The status may include the list of multimedia files included in the read and write queues, the priorities of each multimedia file, and the number of remaining multimedia files.

Abstract: User identifiers associated with a plurality of enterprises may be integrated. A request is received to link a plurality of user identifiers associated with a plurality of enterprises. A first user identifier associated with a first enterprise is received, and a second user identifier associated with a second enterprise is received. The first user identifier and a first enterprise identifier are stored in a first data structure of a memory. The second user identifier and a second enterprise identifier are stored in a second data structure of the memory. A first account identifier associated with the first user identifier is determined by a processor. A second account identifier associated with the second user identifier is determined by the processor.

Abstract: The present invention establishes a process for creating a set of structures that allows efficient storage and subsequent handling. The multigraph is represented using bitmaps with element counters and mappings between values and organized bitmaps to faciliate the handling of the multigraphs. The bits in the bitmaps represent two aspects of the multigraph: 1) indexing of all the objects of the multigraph as a function of their identifiers and 2) connectivity between objects of the multigraph, whether they are vertices or edges. Mappings allow, given a value, accessing the objects of the multigraph which contain such value. Multigraph operations are solved by accessing the mappings and applying logical operations on the bitmaps. This way of representing a graph allows efficiently performing graph operations such as: inserting a vertex or an edge, inserting an attribute, acquiring the incoming and outgoing edges of an attribute, etc.

Abstract: A method that builds a chain-of-custody for archived data is disclosed to ensure the integrity and reliability of the archived data. In one implementation, by using a certified Time Stamp Authority (TSA), an indelible record of each time the archived data is touched (e.g. created, stored, retrieved, accessed, tested, moved, or transformed) is generated to build verifiable links between events to ensure the custody of the data can be audited and verified that it has remained intact throughout its lifetime. The chain-of-custody, in combination with the storage architecture that ensures archive data has not changed through various software and hardware means (e.g., multiple hash signatures to ensure integrity, timestamp authorities to pinpoint each time the archived data was touched, location information to pinpoint physical location, and coordinated chain of custody on multiple replicas of the digital artifact) validates that the archived data has not changed since it was archived.

Abstract: This disclosure describes, generally, tools for navigation of tree structures. For example, a software application comprising a user interface for allowing a user to navigate a tree structure is described. The user interface comprises a graphical element including the tree structure. The tree structure comprises multiple nodes which represent a hierarchical view of data within the structure. One of the nodes is set as the active node. The computer software application also includes a storage element to store a list of previous active nodes. The graphical element is in conjunction with a first navigational element configured to step backward through the list of previous active nodes, and to set the stepped to node as the active node. The graphical element is further in conjunction with a second navigational element configured to step forward through the list of previous active nodes, and to set the stepped to node as the active node.

Abstract: In one embodiment, a method includes receiving a request for a target structured document. In a first response phase, the method includes accessing a data structure comprising an entry for the target structured document and one or more first resources associated with the target structured document, generating a first response portion including a first portion of the target structured document including one or more of the first resources or references for one or more of the first resources, and transmitting the first response portion to the client. The method further includes, in a second response phase, generating a second response portion that includes a second portion of the target structured document including one or more of: one or more second resources, or references for the one or more second resources, associated with the target structured document; and structured document language code, and transmitting the second response portion to the client.

Abstract: Provided herein is a system and computer program product for distributing at least one infrastructure description record (IDR) over at least one tier of a network. The system includes at least one network interface that receives the infrastructure description records (IDRs) and the IDRs being enqueued on at least one incoming, transactional, persistent queue (ITPQ), at least one transactional, persistent store, and at least one transactional process that dequeues the IDR from the ITPQ and accesses the IDR to create an accessed IDR, the accessed IDR being stored in the transactional, persistent store in the system.

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: An apparatus for exchanging data in a distributed system with constrained resources without symmetric metadata knowledge between senders and receivers. The sender includes an encoding module, which when encoding messages for a receiver, is operative to perform the following: generate metadata descriptions for unique combinations of subset of fields of data structures, where each metadata description defines for the receiver how to decode data in the corresponding subset of fields of that data structure included in messages and does not include the data currently in those corresponding subset of field; generate a unique metadata description identification for each different metadata description; include metadata descriptions in the messages as well as the corresponding metadata description identifications to the receiver that has not previously received those metadata descriptions, whereby the messages are encoded without per field overhead.

Abstract: Systems, apparatus, methods and computer-readable storage media facilitating management of social media (SM) information are provided. In some embodiments, a method can include: executing a batch linking application; and batch linking one or more social network (SN) contacts to one or more contacts stored on or accessible by the communication device, wherein the batch linking comprises obtaining the one or more SN contacts at the communication device, wherein the one or more SN contacts are selected for the batch linking based, at least, on a correspondence to the one or more contacts, and wherein the batch linking is performed by the communication device.

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 process for viewing a selected portion of a document on a mobile communication device without having to request multiple pages of the document contents containing document global properties applied to the selected part of the document, comprising marking pages of the document within a server, based on size required by the mobile device, associating properties and attributes of the selected portion with the pages, and transmitting the pages with the properties and attributes for display by the mobile device.

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: A method for parallel processing of data organized in the form of a tree including: converting the tree into a linear array structure including a data array for storing the data of said tree and three reference arrays; determining partial workloads from the linear array structure obtained at step a; and performing parallel processing of said partial workloads. Each entry in the data array corresponding to a given node in the tree and includes three pointers. The pointers each point to a respective one of the reference arrays: a first pointer identifies the parent node of the given node, a second pointer identifies the first child node of the given node, and a third pointer identifies the sibling node of the given node.

Abstract: Loading data from a computer memory system is disclosed. A memory system is provided, wherein some or all data stored in the memory system is organized as one or more pointer-linked data structures. One or more iterator registers are provided. A first pointer chain is loaded, having two or more pointers leading to a first element of a selected pointer-linked data structure to a selected iterator register. A second pointer chain is loaded, having two or more pointers leading to a second element of the selected pointer-linked data structure to the selected iterator register. The loading of the second pointer chain reuses portions of the first pointer chain that are common with the second pointer chain. Modifying data stored in a computer memory system is disclosed. A memory system is provided. One or more iterator registers are provided, wherein the iterator registers each include two or more pointer fields for storing two or more pointers that form a pointer chain leading to a data element.

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: A method for mapping relationships in a database results in a cluster graph. A representative sample of records in each of a plurality of tables in the database is analyzed for nearest neighbor join edges instantiated by the record. Records with corresponding nearest neighbor join edges are grouped into clusters. Cluster pairs which share a join relationship between two tables are identified. A weighting may be applied to cluster pairs based on the number of records for the cluster pair. Meaningful cluster pairs above a weighted threshold may be ordered according to table and displayed as a cluster graph. Analyses of the cluster graph may reveal important characteristics of the database.

Abstract: A method allows one to store in a parallel way branches and nodes of a hierarchy into a database by creating queues. Each queue has a status and a unlock item indicating if a superior node has already been stored. A process looks up these indicators and performs according to commands received from a first process control of the queues.

Abstract: Facilitating generic database editing to allow for data to be received from a user for entry into a database without requiring the data to conform to schema constraints for the database. A method includes examining a first schema for a first database. The first schema including a first set of constraints specified in the first schema on data to be entered into the first database. The method further includes, based on the examination, constructing a second database corresponding to the first database. The second database is associated with a second schema with a second set of constraints. The second set of constraints is a relaxed version of the first set of constraints specified in the first schema.

Abstract: Data of a directed graph is input (S2001), and is divided into subgraphs (S2002). Data of node key assignment tables are generated for respective divided subgraphs (step S2003). The respective node key assignment tables are merged (S2004).

Abstract: A process for viewing a selected portion of a document on a mobile communication device without having to request multiple pages of the document contents containing document global properties applied to the selected part of the document, comprising marking pages of the document within a server, based on size required by the mobile device, associating properties and attributes of the selected portion with the pages, and transmitting the pages with the properties and attributes for display by the mobile device.

Abstract: The system is capable of obtaining merchandise information from an image on a television screen. The user selects an article or a service of interest and presses a button on a remote control. The information is transmitted to a server, which returns merchandise data relating to the selected article or service and outputs it to the television screen. The system allows the user to select and purchase the article or service and displays information on a merchandise purchase screen.

Abstract: According to some embodiments, an event query to an item supply chain event database is processed such that a trace extraction algorithm will be executed to determine extracted trace data. A plurality of location nodes may then be graphically represented on an interactive user display based on the extracted trace data. Similarly, a plurality of item flow edges connecting location nodes may be graphically represented on the interactive user display based on the extracted trace data. According to some embodiments, a selection from a user is received via the interactive user display, the selection being associated with at least some of the graphically represented information. Responsive to the received selection, the graphical representation may be adjusted in accordance with the extracted trace data.

Abstract: A computer system for locating real estate service providers by navigating an aerial image map of a geographic region. The system determines a search region corresponding to the geographic region by use of geospatial information associated with the geographic region. Once the search region is determined, the system searches a database for real estate service providers that are associated with the search region and that satisfy certain predetermined criteria.

Abstract: An index data structure comprises a plurality of index keys for uniquely identifying potential data object context nodes. Each index key is, in turn, associated with one or more potential context nodes. Moreover, the index key has a label that provides semantic content to a user. The index data structure further comprises one or more routing tables associated with each index key that generally include a plurality of path references.

Abstract: Present invention discloses a system and a method of obtaining and processing data for use in insurance underwriting which comprise a set of influencing factors, provide an application questionnaire including a series of application questions relating to a plurality of influencing factors and a plurality of possible application responses to each application question, assign risk-scores to at least a portion of said application responses, present said application questionnaire to an applicant, collect application responses to at least a portion of the application questions, compile optionally at least one expert questionnaire including all questions left unanswered by the applicant, present optionally said expert questionnaires to at least one expert, and collect responses to the expert questionnaires and determine a total response for the applicant.

Abstract: Methods and apparatus, including computer program products, for populating a table in a business application. A computer-implemented method of displaying information on a computer display device includes displaying a first view on the display device, the first view including dropdown values and data in a table of rows and columns, the data received from a table node data structure stored in a memory, the table node data structure including node elements and attributes, and generating a second view in response to a change in a dropdown value by repopulating the table of rows and columns using attribute identifications (IDs).

Abstract: An application integration system greatly improves the configurability and efficiency of integration of multiple disparate applications, such as those found in telecommunications service provider architecture. The application integration system disassembles messages into component parts and dynamically rebuilds the component parts into a target message compatible with a target system. The application integration system employs a highly configurable configuration mechanism that can be modified on the fly and adapted to meet the requirements of any number of different applications that may need to communicate across the telecommunications service provider architecture.

Abstract: Computer-readable media, computer-readable media, computerized methods, and computer systems for acting on properties of multiple resources, which span disparate locations within a network, upon detecting an intuitive user-initiated operation are provided. Initially, a library is provided that includes a framework for contemporaneously accessing a collection of items within a scope thereof. Upon launching the library, representations of the scoped items are surfaced at a UI display. When the user-initiated operation is applied at one of the surfaced representations, properties of each of the scoped items are automatically manipulated. A library-configuration state, which reflects how the items are affected upon manipulating the properties thereof, may be updated upon implementing the manipulation.