Abstract: A computerized method of adjudicating text against a policy includes receiving one or more system policies, creating a system datastructure for each received system policy, receiving an input message comprising a text to be adjudicated, selecting a system policy from the one or more received system policies based on the input message, and processing the text to be adjudicated and the system datastructure corresponding to the selected system policy to determine if a prohibited word is present in the text to be adjudicated. The one or more system policies include one or more prohibited words and a first hit value corresponding to each prohibited word. The system datastructure includes a plurality of linked lists corresponding the letters of the alphabet and a head linked list operable to store one or more found prohibited words.

Abstract: Each of one or more songs in a song list is analyzed to determine whether the song satisfies a set of criteria at its current location. For each of the one or more songs that satisfies the set of criteria, the song is kept at its current location in the song list. For each of the one or more songs that does not satisfy the set of criteria, an attempt is made to select (e.g., randomly) another song in an unprocessed portion of the song list that satisfies the set of criteria. If a selected song satisfies the set of criteria then the song and the selected song are swapped. However, if greater than a threshold number of attempts to select a song that satisfies the set of criteria are made, then the song is kept at its current location in the song list.

Abstract: A method to produce a reverse skip list data structure in a computer readable medium, comprising: inputting streamed data to packets created in a temporary memory so as to create a sequence of packets; upon completion of creation of a packet in the stream, transferring the completed packet from the temporary memory to persistent memory; providing each of a plurality of respective packets with a respective pointer that skips over at least one other packet in the packet sequence and that indicates a location in persistent memory of a different respective packet in the packet sequence that was transferred to persistent memory prior to such providing of the respective pointer.

Abstract: Techniques are provided for processing a CREATE INDEX statement that avoids one or more locks on the underlying table. The processing of such a statement may be divided into a build phase and a cooperation phase. During the build phase, a journal table is created and published. A snapshot of the table is obtained after the last DML transaction (that was pending at the time the journal table was published) commits. The index is built based on the state of the table as of the snapshot. Any changes to the table while the index is built are recorded in the journal table. During the cooperation phase, the index is partially published. A subsequent DML statement determines whether any changes in the journal table affect the same data as the subsequent DML statement. If so, then those changes are applied to the index followed by the subsequent DML statement.

Abstract: A server device includes: an abnormality information output unit for storing a plurality of measurement information, which is time sequential information related to information measured in a plurality of manufacturing apparatuses, having manufacturing apparatus identifiers and time information, and storing at least one set of abnormality information indicating an abnormality and one or more measurement information, and outputting one or more abnormality information; a chart composing unit for composing one or more charts from one or more measurement information in pair with one or more abnormality information corresponding to an abnormality information instruction when the instruction, which is an instruction for one or more abnormality information among the one or more abnormality information outputted by the abnormality information output unit, is received; and an output unit for outputting the one or more charts composed by the chart composing unit, so that abnormality analysis can be carried out easily an

Abstract: A method for storing data, comprises representing the data as a tree structure, calculating a structure ID for the tree structure, the structure ID being a representation of the tree structure and independent of node names and node values of the tree structure, and storing a mapping of the structure ID to the tree structure.

Abstract: Various embodiments illustrated and described herein pertain to at least one of systems, methods, databases, and instructions stored on computer-readable mediums for data allocation identification. One method according to some embodiments includes determining a database allocation of an entity and identifying a domain directly associated with the entity. The method may further include determining at least one header table field directly associated with the entity by identifying a directly associated type definition linked to the directly associated domain, wherein the directly associated type definition refers to the header table field, wherein each header table field is in a corresponding header table. This, and other embodiments, are illustrated and describe in detail herein.

Abstract: A method of analyzing customer behavior, where customers are engaged in customer-to-customer transactions in the third-party network, includes the transformation of data representing the customer-to-customer transactions from a data representation to a network representation, and then analyzing the network representation. The network representation includes a set of nodes and a set of links where each node represents a customer and each link represents a transaction between two of the customers.

Abstract: Systems and methods for performing latency-free database searches using two-level indexed data structures having decreasing integer sets as identifiers to represent actual data. The indexed data structures are stored in distributed memory. Data operations such as intersection and union are performed using the indexed data structures. A binary interval reduction technique is used to quickly move through the data sets looking for common elements for the intersection set, or unique elements to add to the union set.

Abstract: Techniques are provided for assisting in the processing of failure detection protocol (FDP) packets. Techniques are provided that assist a CPU of a network device in processing incoming FDP packets. In one embodiment, only a subset of FDP packets received by the network device is forwarded to the CPU for processing, the other FDP packets are dropped and not forwarded to the CPU. The processing is performed using dual memory structures that enable receipt of FDP packets by the network device to be decoupled from the processing of FDP packets by the CPU of the network device.

Abstract: A method, computer program product, and system for partitioning keys for a hash table in order to improve performance of the hash table. A hash function is used to generate a hash table by mapping a set of keys to a corresponding set of hash codes, and a hash failure is detected if the hash function fails to map the entire set of keys. To resolve the hash failure, the set of keys is partitioned to form subsets of keys that can be individually mapped.

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

Abstract: 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: A method for managing object-oriented queues by reusing queue entry objects instead of creating and destroying each queue entry object inserted into and removed from the queue. Inserting a queue entry object into the queue involves changing the status of the queue entry object from available to in-use, adding the queue entry object to a queue list, returning a reusable queue entry object to the queue user, receiving an insertion notification that the queue entry object data is valid, and marking the insertion of the queue entry object into the queue as complete. Removing a queue entry object from the queue involves un-marking the queue entry object in the queue as complete, removing the queue entry object from the queue list, returning the valid queue entry object to the queue user, receiving a removal notification that valid data has been extracted from the queue entry object, and changing the status of the reusable queue entry object removed from the queue list from in-use to available.

Abstract: A data structure, method, and computer program provide a linked list in a first dimension and a plurality of linked lists in a second dimension. In use, a linked list in a first dimension is provided. Further, the linked list in the first dimension includes a plurality of nodes. Additionally, each node includes a head pointer and a tail pointer. In addition, a plurality of linked lists in a second dimension is provided. Furthermore, the tail pointer of one of the nodes in the linked list in the first dimension points to a first node in one of the linked lists in the second dimension.

Abstract: Implementing fair scalable reader writer mutual exclusion for access to a critical section by a plurality of processing threads in a processing system is accomplished by creating a first queue node for a first thread on the first thread's stack, the queue node representing a request by the first thread to access the critical section; adding the first queue node to a queue pointed to by a single word reader writer mutex for the critical section, the queue representing a list of threads desiring access to the critical section, each queue node in the queue being on a stack of a thread of the plurality of processing threads; waiting until the first queue node has no preceding write requests as indicated by predecessor queue nodes on the queue; entering the critical section by the first thread; exiting the critical section by the first thread; and removing the first queue node from the queue.

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: In a method for storing data in a relational database system using a processor, a collection of values is assigned to a structure dictionary, wherein each of the values represents the value of a row for an attribute and has a unique ordinal number within the collection, and wherein the structure dictionary contains structures defined based on at least one of interaction with a user of the system via an interface, automatic detection of structures occurring in data, and predetermined information about structures relevant to data content that is stored in the system. For each structure in the structure dictionary, a structure match list is formed from ordinal numbers of values matching the structure, and a structure sub-collection from values matching the structure, using the processor.

Abstract: A data management system for a data storage device includes a management module and a memory module. The management module manages a plurality of nodes of a linked list based on one of a plurality of parameter sets that indicates a location of a data field within each of the plurality of nodes. The memory module stores data indicative of the one of the plurality of parameter sets.

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: Compressing and decompressing compressed index lists. One or more index lists include at least a portion of the list that is compressed. A method includes reading an entry from a list. The method further includes determining that the entry indicates the start of a compressed block of the list. The compressed block is compressed using a compression algorithm including a plurality of delta pointers. Each of the delta pointers point to data store entries by reference to a difference from a reference in a previous entry in the list. An entry size indicator is referenced. The entry size indicator is configured to indicate a memory storage size for a delta pointer, and the entry size indicator supports indications for all of fixed storage sizes, variable storage sizes, and run length encoding. The compressed block of the list is decompressed according to the entry size indicator.

Abstract: A reporting database establishes linkages between patent applications so that first references reported in a first patent application are indicated as needing to be reported in a second patent application. In one scenario, a similar second linkage is also established between the second patent application and a third patent application. In such a case, there may be no linkage between the first patent application and the third patent application analogous to the first and second linkages. When it is detected in such a case that the first references have been reported in the second patent application, an indication that the first references need to be reported in the third patent application may prevented based on determining that the first references did not originate from the second patent application.

Abstract: An architecture for use in packet processing and supporting compatibility with current BSD implementations for packet processing is proposed wherein two MBUF formats are supported. A first format includes a header portion and a data portion for storing data therein. A second format includes a header portion but is absent a data portion and is for addressing data stored within a cluster and external to the MBUF itself.

Abstract: The present invention provides a method and computer program product for creating an ordered data structure for storing a plurality of data elements. The data elements to be stored are first arranged in an order. A plurality of keys is then generated for the ordered data elements such that the keys may be arranged in a sequence. Thereafter, one or more keys from the plurality of keys are associated with the ordered data elements such that the values of the keys maintain the requisite order among the ordered data elements. Finally, an ordered data structure is created for storing the ordered data elements along with the associated keys.

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 provides a system, method and software for linking persistent and unique business identifiers, associated with business entities, for associating corresponding business records without a loss of historical records, regardless of subsequent changes, updates, and mergers. In the various embodiments, a first business record, of the plurality of business records, is associated with a first business identifier; and a second business record, which does not match the first record, is associated with a second business identifier.

Abstract: A system and method for connecting information resources in a collaborative work environment. A system includes at least one information source providing collaboration data, and a repository framework including at least one source for storing the collaboration data. A collaborative bot service is connected with the repository framework, and includes one or more bots, or autonomous programs, configured to traverse the source via the repository framework, extract a topic from a portion of the collaboration data, and create a link between the portion of the collaboration data and an information resource related to the collaboration data based on the topic.

Abstract: Provided are techniques for savepoint processing. One of a savepoint statement, a rollback to savepoint statement, and a release savepoint statement is received. It is determined whether to propagate the received one of the savepoint statement, the rollback to savepoint statement, and the release savepoint statement to a data source based on an asymmetrical model in which a nested level of savepoints on a federated server side is capable of being greater than a nested level of savepoints on a data source side and wherein a two-tiered data structure is used to preserve savepoint information in the asymmetrical model. In response to determining that propagation is to occur, the one of the savepoint statement, the rollback to savepoint statement, and the release savepoint statement is propagated to the data source.

Abstract: A method and computer system for determining the memory address range of a subtree of a linearized tree of objects or the original version of such tree when the tree has been modified or is concurrently being modified by other threads. The primary application of the method is in garbage collection for multiprocessor shared memory computers with very large memories, but it is also relevant for a number of other applications.

Abstract: Asynchronously traversing a disjoint linked data structure is presented. A synergistic processing unit (SPU) includes a handler that works in conjunction with a memory flow controller (MFC) to traverse a disjoint linked data structure. The handler compares a search value with a node value, and provides the MFC with an effective address of the next node to traverse based upon the comparison. In turn, the MFC retrieves the corresponding node data from system memory and stores the node data in the SPU's local storage area. The MFC stalls processing and sends an asynchronous event interrupt to the SPU which, as a result, instructs the handler to retrieve and compare the latest node data in the local storage area with the search value. The traversal continues until the handler matches the search value with a node value or until the handler determines a failed search.

Abstract: Methods, apparatus, and computer-readable media for providing a device handle database in an EFI environment are disclosed. According to one method, a device handle database is created for storing data identifying the protocols that have been installed on one or more device handles. The database includes a sorted array of elements utilized to store protocol data for a family of protocols having the same GUID. Each element in the array comprises a family data structure including a field for storing the GUID for the family along with a field for storing a pointer to a linked list that stores the protocol instance data for each of the protocols in the family. Each node in the linked list is also a member of a linked list for storing protocol data for all of the protocols installed on a given device handle.

Abstract: Data stored on a storage medium can be referenced by multiple independently addressable active symbolic links, with each active symbolic link representing the data through a different transformation. The active symbolic links can be in the form of file system objects, such as files or directories. A single active symbolic link can reference the data stored in multiple collections, or, conversely, a subset of data from a single collection. Active symbolic links can be automatically created for common data transformations. Searching across active symbolic links referencing encrypted data can be performed by multiple protection-specific search engines, or a single search engine that can generate a protection-level aware search index.

Abstract: Apparatus, methods, and computer program products are disclosed for performing a wait-free search of a concurrent, lock-free skiplist to determine existence of a sought-after key.

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

Abstract: 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: A linked list traversal system identifies when a linked list has become inefficient, either through attack or an undue multiplicity of collisions. A data unit is parsed to extract a key. A first hash result associated with the key is calculated based on a first hash function. A first linked list is identified based on the first hash result. It is determined whether the first linked list has been compromised. A second hash result associated with the key is calculated based on a second hash function when the first linked list has been compromised. A second linked list is established based on the second hash result, where the second hash result is different from the first hash result.

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: Security policy databases capable of being fast retrieved while securing sequentiality. An IPSec processing device of the present invention performs communications by encrypting IP packets exchanged between a first IP network and a second IP network. The IPSec processing device includes a security policy database that stores security policies. The security policy database includes first, second, and third security policy databases. The first and third security policy databases include a linear list structure, and the second security policy database includes a hash list structure. The IPSec processing device, when performing at least one of transmission and reception of the IP packet, retrieves a security policy in the order of the first, second, and third security policy databases.

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

Abstract: Techniques for granular recovery of data from local and remote storage are disclosed. In one particular exemplary embodiment, the techniques may be realized as a method for recovery of data from local and remote storage comprising determining a recovery location, determining a location of backup data, hard linking one or more portions of the backup data to the recovery location in the event that the one or more portions of the backup data to be hard linked are determined to be on a volume of the recovery location, virtually linking one or more portions of the backup data to the recovery location in the event that the one or more portions of the backup data to be virtually linked are determined to be on a volume different from the volume of the recovery location, and performing recovery utilizing one or more portions of recovery data.

Abstract: A method in a computer system for retrieving data from one of multiple copies of the data is provided, referred to as the data management system. The data management system receives a request identifying at least one data object to be accessed. Then, the data management system queries a metabase to locate data copies that contain the identified at least one data object, wherein the data copies are created from similar source data, and wherein for each data copy the metabase contains an indication of the availability of the copy relative to other copies. Next, the data management system determines one of the located data copies to use to access the identified at least one data object, wherein the determination is made based on the indicated availability contained in the metabase for each of the located data copies. Then, the data management system accesses the identified at least one data object using the determined one of the located data copies.

Abstract: The present invention provides a methodology for truncating a logical structure having data matching a predefined pattern. For example, the present invention truncates a logical structure so that branches of the structure are automatically ceased at a recursive ancestor instead of at a descendant. By using the methodology of the present invention, the total number of nodes of the logical structure that will be automatically displayed for a user is represented by the formula N*N+1. Thus, when N=10, the total number of nodes that are automatically displayed for the user is 101. This quantity is far more user friendly than the 9,864,101 nodes that would be displayed when N=10 under previous approaches.

Abstract: An approach is provided for managing split and merge operations for information spaces with respect to their information content.

Abstract: A system to control access to a resource by a group of threads requiring access to the resource provides exclusive access to the resource within a computerized device on behalf of a first thread by allowing the first thread exclusive access of a monitor associated with the resource. An entry list of threads is maintained that are awaiting access to the monitor using block-free list joining mechanisms including a thread chaining technique, a push/pop technique, and a detach, modify, reattach technique to allow threads to join the entry list of threads without blocking operation of the threads. Upon completion of access to the resource by the first thread, the system operates the first thread to manipulate the entry list of threads to identify a successor thread as being a candidate thread to obtain exclusive access of the monitor to gain exclusive access to the resource.

Abstract: A device, system, and method are directed towards combining a plurality of queries to a database into a combined execution plan. The plurality of queries is received. The queries may be Structured Query Language (SQL) statements. The database may be a relational database. The plurality of queries is transformed into a plurality of parse trees. A determination is made whether the plurality of queries operates on at least the same portion of the same table. If so, then the plurality of query trees is query-optimized. The plurality of query trees are combined into a master query tree based on similar nodes in the plurality of query trees. A split node in the master query tree represents non-similarities between the plurality of query trees. The master query tree is transformed into an execution plan. The execution plan is applied to a database to return at least one result.

Abstract: A method, data processing system and computer program product for maintaining/updating managing keyboard navigation using a linked list. In particular, a Dynamic Tree Control Linkage (DTCL) utility creates a doubly linked list with list nodes having assigned values based on a tree control structure UI component. Each list node of the doubly linked list corresponds to a visible tree item of the tree structure UI component. Responding to a keyboard event signal, the DTCL utility finds a current list node corresponding to a first current tree item. The DTCL utility finds a next (i.e. previous or subsequent) list node corresponding to a next tree item. The DTCL utility detects a list node exists. The DTCL utility detects whether the next list node is associated with a null value. When the next list node is associated with a non-null value, the next tree item is identified. The DTCL utility returns an identification of the next tree item representing a second current tree item.

Abstract: The invention relates to a system and a method for documentation processing, in particular for technical and industrial applications, with storage means (1) for storing documentation data (I1 . . . In) on several levels (E1 . . . Em) and with acquisition means (2) for acquiring real information (R), with access means for accessing the documentation data (I1 . . . In) and with evaluation means (A) for evaluating the real information (R) and for selecting the stored documentation data in dependence on the real information (R). As a result, for example for service applications in situ, i.e. for example the location of an automation system, structured and selective access to the documentation data is made possible by the integration of the documentation data (I1 . . . In) as augmented reality.

Abstract: A system and method of tracking a data object of a data management system. A tracking object is associated with a first data object, the tracking object including a first status data having a first status value representing a status of the first data object. Upon the creation and/or modification of a second data object that is associated with the first data object, the first status data is automatedly updated with a second status value based on the creating and/or modifying of the second data object.

Abstract: In some embodiments, a hardware linked-list manager includes a wildcard search controller for generating corresponding queue-specific read requests from wildcard read requests. The linked-list manager may be part of an on-chip interagent switch for allowing a plurality of agents to communicate with each other. The interagent switch may include a crossbar switch and a plurality of hardware linked-list managers integrated on the chip, connected to a random access memory, and connected to the crossbar switch such that the crossbar switch is capable of connecting each of the linked-list managers to each of the agents. Each linked-list manager sends agent-generated data to the memory for storage in the memory as a linked-list element, and retrieves linked-list elements from memory in response to agent read requests. A shared free-memory linked-list manager may maintain a linked list of free memory locations, and provide free memory address locations to a linked list manager upon request.

Abstract: Methods for linking multiple events involving firearms submit event information data and firearms information data to a system that includes a database for multiple firearms events and generate a query map that correlates data in the system database with a preselected geographical grid based upon one or more preselected matching criteria to one or more data entries for a selected event. The map is used to generate a request for a possible link analysis which may be initiated by a firearms examiner and is then performed to determine if there is a link. The event information data can include a case number, a geographical location data entry, a date entry, a crime type, a weapon involved and a suspect information data field based upon input from an investigating officer while the firearms information data can include a weapon data entry and a bullet data entry based upon input from a person with firearms examiner training.