Abstract: Disclosed embodiments provide a methodology and architecture for calculating the chainage distance using two Positive Train Control (PTC) system messages (e.g., Train Route and Current Position) provided by the PTC system.

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: One or more embodiments of the present invention include a memory and a processor. The memory includes a plurality of files, a master cluster record, and an operating system. The processor is configured to execute the operating system in order to locate and load each cluster of a file. Each file includes a plurality of clusters and each cluster includes a first pointer and a second pointer. The first pointer is linked to a previous cluster of a file and second pointer is linked to a subsequent cluster of the file using a double linked list data structure.

Abstract: Embodiments of the invention provide a storage subsystem comprising a non-volatile solid-state memory array and a system operation module for managing memory operations. The system operation module is configured to store system operation data in a data structure that includes linked lists for storing system operation data, with at least some lists including entries referencing blocks in the solid-state memory array belonging to a category. The system operation module is further configured to (1) move a particular entry from a first linked list to a second linked list when a block referenced by the particular entry in the first linked list has met a condition for being classified in a new category that is different from that of the blocks referenced by entries in the first linked list, and (2) update entries within the first and second linked lists so that the dependencies in the linked lists are maintained.

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: Implementing fair scalable reader writer mutual exclusion for access to a critical section by a plurality of processing threads is accomplished by creating a first queue node for a first thread, the first queue node representing a request by the first thread to access the critical section; setting at least one pointer within a queue to point to the first queue node, the queue representing at least one thread desiring access to the critical section; waiting until a condition is met, the condition comprising the first queue node having no preceding write requests as indicated by at least one predecessor queue node on the queue; permitting the first thread to enter the critical section in response to the condition being met; and causing the first thread to release a spin lock, the spin lock acquired by a second thread of the plurality of processing threads.

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 method of adding an element to a data structure may include atomically associating the element with the data structure if the element is not associated with the data structure. The element may be prepared for insertion into a location in the data structure. The method may also include atomically inserting the element into the location in the data structure if another element has not been inserted into the location.

Abstract: The present invention provides a method and apparatus for enhancing webpage browsing. The method of the invention includes a predicting step which predicts, for a first block in the webpage, a subsequent second block, based on a browsing history of blocks of webpages by at least one user; and a link generating step of automatically generating a link pointing to the second block based on a result of the predicting step. The apparatus includes: predicting means configured to predict, for a first block in the webpage, a subsequent second block, based on a browsing history of blocks of web pages by at least one user; and link generating means configured to automatically generate a link pointing to the second block based on a result of the predicting means.

Abstract: Creating an object is disclosed. An instance of a sharable type is created. An instance of a lightweight type is created. The sharable type is designated as a parent of the lightweight type. The instance of the sharable type is designated as a parent of the instance of the lightweight type. The instance of the sharable type may be shared by one or more other instances of the lightweight type.

Abstract: A method of adding an element to a data structure may include atomically associating the element with the data structure if the element is not associated with the data structure. The element may be prepared for insertion into a location in the data structure. The method may also include atomically inserting the element into the location in the data structure if another element has not been inserted into the location.

Abstract: Methods and apparatus for organizing a plurality of versions of a file in a file system. The plurality of versions of the file are stored in a data structure having a hierarchical organization that reflects relationships among the plurality of versions. Each version of the plurality of versions is assigned a name that identifies its position in the hierarchical organization. The hierarchical organization of the data structure and the descriptive naming convention used for the plurality of versions in the data structure facilitates deleting a version while retaining other versions derived from the version following the deletion of the version, and enables a staged initialization of the data structure upon system start-up.

Abstract: Systems and methods for indexing, associating or compositing data records and hierarchies from various information sources are disclosed. Embodiments of the present invention may provide the ability to link data records and thus to link data records to known hierarchies of data records. More specifically, embodiments of the present invention may provide the capability to associate data records in varying information sources and to thereby associate incoming data record with existing data records or existing data hierarchies such that an incoming data record may not only be associated with an existing data record comprising information about the same entity but may additionally be associated with other members of the data hierarchy in the same manner as the existing data record.

Abstract: A network management method is provided, which includes creating one or more networks defined by a closed loop based on unidirectional links among basic memory units, and creating a new network based on a new closed loop which is constructed based on two or more networks. Accordingly, it is possible to read information regarding another associated networks, upon reading about information regarding one of the created networks.

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

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

Abstract: Provided is a mechanism wherein key-value structure data are effectively combined, and dynamic changes in the data structure and amount of data are coped with flexibly; and wherein the throughput in frequent reading of simple tables is improved with this mechanism. A flexible data model is built, by making a referring mechanism for referring to attributes, and a referred-to mechanism wherein references to attributes are made, to be a “referring—-referring” element and a “referred-to—-referred-to” element; making a component by sandwiching key-value-store structure data; and combining components having multiple attributes with each other, as a “referring—referred-to” relationship. Furthermore, receiving search results as a key-value-store structure cache will contribute in simplifying accesses by conventional application programs to the aforementioned flexible data model, which by extension will contribute in making the whole application program more high-speed.

Abstract: An automation control and monitoring system is provided that includes an automation control component and a data store. The automation control component is configured to store measurement data acquired from a sensing component of the automation control system in onboard memory. The automation control component is configured to store the measurement data in the onboard memory in a manner defined by a data structure of the measurement data. The data store is configured to store and dynamically associate meta-data with the measurement data acquired from the sensing component such that the meta-data extends the data structure by linking at least portions of the meta-data with the measurement data.

Abstract: Systems and methods are disclosed for providing devices capable of the reception and playback of one or more crafted media channels transmitted over an intermittent connection. The one or more channels may be customized by the end user to bias the programming towards individual tastes or moods. The channels may be delivered over an intermittent, unidirectional link, for example a Satellite Radio receiver in a home or car. Content may also be delivered over an intermittent, bidirectional link, for example to a portable media player via a wireless 802.11 or other networked connection.

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

Abstract: Embodiments of the invention relate to systems, methods, and computer program products for improved electronic discovery and custodian management. Embodiments herein disclosed provide for an enterprise wide e-discovery system that provides for data to be identified, located, retrieved, preserved, searched, reviewed and produced in an efficient and cost-effective manner across the entire enterprise system. In addition, by structuring management of e-discovery based on case/matter, custodian and data and providing for linkage between the same, further efficiencies are realized in terms of identifying, locating and retrieving data and leveraging results of previous e-discoveries with current requests.

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 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 system and method for managing a resource reclamation reference list at a coarse level. A storage device is configured to store a plurality of storage objects in a plurality of storage containers, each of said storage containers being configured to store a plurality of said storage objects. A storage container reference list is maintained, wherein for each of the storage containers the storage container reference list identifies which files of a plurality of files reference a storage object within a given storage container. In response to detecting deletion of a given file that references an object within a particular storage container of the storage containers, a server is configured to update the storage container reference list by removing from the storage container reference list an identification of the given file. A reference list associating segment objects with files that reference those segment objects may not be updated response to the deletion.

Abstract: Embodiments of the invention improve parallel performance in multi-threaded applications by serializing concurrent priority queue operations to improve throughput. An embodiment uses a synchronization protocol and aggregation technique that enables a single thread to handle multiple operations in a cache-friendly fashion while threads awaiting the completion of those operations spin-wait on a local stack variable, i.e., the thread continues to poll the stack variable until it has been set or cleared appropriately, rather than rely on an interrupt notification. A technique for an enqueue/dequeue (push/pop) optimization uses re-ordering of aggregated operations to enable the execution of two operations for the price of one in some cases. Other embodiments are described and claimed.

Abstract: Keys of an index are associated with corresponding data chunks in a storage system. In response to a request for a particular key, a particular location is accessed in a first data structure which is maintained in a first storage using a first portion of the particular key. In response to the particular location containing a first value, indicating that the particular key is not present in the index. In response to the particular location containing a second value, a map is accessed using a second portion of the particular key to retrieve an entry in a second data structure maintained in a second storage. The second data structure provides a collision chain to link entries of the second data structure that share a common value of the second portion of the particular key. The first data structure, map, and second data structure are part of the index.

Abstract: Apparatus, methods, and computer program products are disclosed for concurrently searching a memory containing a skiplist data structure. The method locates the skiplist data structure in the memory. The skiplist data structure includes a plurality of linked lists related by a skiplist invariant. Furthermore, the plurality of linked lists includes a first-level linked list and one or more higher-level linked lists. The skiplist data structure also includes a plurality of nodes, each of which includes a key field, at least one pointer field, and a lock field, respectively. Each of the plurality of nodes is linked to the first-level linked list through the at least one pointer field and ordered responsive to the key field.

Abstract: A job searching and matching system and method is disclosed that gathers job seeker information in the form of job seeker parameters from one or more job seekers, gathers job information in the form of job parameters from prospective employers and/or recruiters, correlates the information with past job seeker behavior, parameters and behavior from other job seekers, and job parameters and, in response to a job seeker's query, provides matching job results based on common parameters between the job seeker and jobs along with suggested alternative jobs based on the co-relationships and based on ratings and preferences provided by the job seeker and provides negative filtration of undesirable jobs based on job seeker input and in response to queries from the system in order to efficiently and accurately accommodate job seeker perception.

Abstract: A system for correlating a user's interests to media content, said system comprising: (a) at least one data store comprising media content data relating to people, works, and tags; (b) a relationship generator configured to generate direct relationships among said people, works and tags; (c) a connection module to generate connections between a primary person, work or tag and a first set of said people, works, and tags, wherein each person, work and tag of said first set has a direct relationship with said primary person, work or tag; and (d) a display module for causing the display of at least a portion of said first set of said people, works and tags.

Abstract: A method of using location-dependent sensor information comprising receiving information from one or more sensor/monitor/device (SMD) and determining a location associated with the SMD. The method further comprising integrating the SMD data into a comprehensive location-based database, and enabling a user to search for local conditions in the location-based database.

Abstract: Techniques for determining and tracking dependent properties for a calculated property are provided. A request for a value of a first property is received. The value for the first property is calculated, including accessing values for one or more properties used to calculate the value for the first property. The accessing of the values for the one or more properties may be detected, and the one or more properties may be tracked as dependent properties for the first property in a first set of dependent properties. A change in the value of a second property may subsequently be detected. If the second property is determined to be included in the first set of dependent properties, the value of the first property is invalidated.

Abstract: A method of analyzing customer behavior, where customers are engaged in customer-to-customer transactions in a third-party network, includes a 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: A method and apparatus is provided for efficiently searching and navigating XML data stored in a relational database. When storing a collection of XML documents, certain scalar elements may be shredded and stored in a relational table, whereas unstructured data may be stored as a CLOB or BLOB column. The approach includes identifying a reference address to within an XML tree index entry and storing the address in an xmltable index. The tree index entry allows for navigation in all axes. A path-based expression may be evaluated in the context of the reference address of the LOB. The result of the evaluation identifies another XML tree index entry containing a LOB locator used to retrieve the content from the document. The tree index, node index, and secondary function indexes are used together to enhance the performance of querying the XML data.

Abstract: The present invention provides a database production method including: a representative image selection step of selecting certain images each as a representative image which represents an image content from the image content; a display processing step of causing a display apparatus to display the representative image; an operation inputting step of allowing a user to input image text information corresponding to the representative image; and a database production step of registering representative characteristic information extracted from the representative image in accordance with a predetermined extraction method and the image text information inputted at the operation inputting step in an associated relationship with each other to produce a database for acquiring, using arbitrary image characteristic information for each image extracted from an arbitrary image content in accordance with the extraction method, substance character information corresponding to an image which the arbitrary image content has.

Abstract: A table update component may perform updates on a dynamic linear hash table, the updates requested by clients based on request item values. A table capacity status component may determine first capacity indicators associated with the dynamic linear hash table, based on results of the update requests. A table maintenance component may initiate lock-free merges and lock-free splits of hash table buckets associated with the dynamic linear hash table, based on initiating lock-free merges and lock-free splits of linked lists included in hash table buckets associated with the dynamic linear hash table, based on the determined first capacity indicators, the linked lists including hashed items stored in the dynamic linear hash table.

Abstract: A method is provided for displaying a concatenated file such as an image or text file that has been generated by combining information from other files. The concatenated file includes a file structure that can be shown on a display unit and that contains basic information and reference information. The reference information includes information about links of the concatenated file with source reference files which are also files of the file structure and are used for generating the concatenated file. The source reference files are automatically identified with the assistance of the reference information after the concatenated file has been selected. The source reference files and the concatenated file are subsequently displayed and accentuated at the display unit in an intelligent tree structure.

Abstract: This description provides tools and techniques for Web-enabled database access tools. These tools may provide systems that include database access tools that provide at least one level of abstraction between external databases and users of the access tools. The systems may also include one or more internal databases maintained by the tool, with the internal database storing respective login information associated with the users. The login information may enable the users to access the tool without providing direct access to the external databases.

Abstract: An Object Customization and Management (OCM) system is configured to identify an object for creating a website based on a business objective. The OCM system includes a customizing module configured to determine qualitative attribute categories for a plurality of objects operable to be used in websites. The module assigns the plurality of objects to the qualitative attribute categories. The OCM system also includes a data management module configured to receive a request for one of the plurality of objects to be used to achieve the business objective. This module also matches the business objective with one of the qualitative attribute categories, and selects an object in the matched qualitative attribute category for the request.

Abstract: A method for generating an ontology may include selecting, by a processing device, a tag in a tag cloud. The method may also include searching, by the processing device, an online encyclopedia for content corresponding to the selected tag and determining, by the processing device, at least one category to which the content belongs in the online encyclopedia in response to finding the content corresponding to the selected tag in the online encyclopedia. The method may additionally include adding, by the processing device, a class to the ontology corresponding to the at least one category of the content in the online encyclopedia.

Abstract: The present invention extends to methods, systems, and computer program products for maintaining a count for lock-free stack access. A numeric value representative of the total count of nodes in a linked list is maintained at the head node for the linked list. Commands for pushing and popping nodes appropriately update the total count at a new head node when nodes are added to and removed from the linked list. Thus, determining the count of nodes in a linked list is an order 1 (or O(1)) operation, and remains constant even when the size of a linked list changes.

Abstract: Methods and system to generate data associated with a medical report using voice inputs are described herein. In one example implementation, a computer-implemented method to automatically generate data associated with a medical report using voice inputs received during a first encounter includes receiving a voice input from a source and determining an identity of the source. Additionally, the method includes performing a speech-to-text conversion on the voice input to generate a text string representing the voice input and associating the text string with the identity of the source. Further, the example method includes identifying and selecting one or more keywords from the text string. The one or more keywords are associated with one or more data fields. Further still, the method includes populating the one or more data fields with the identified keywords according to values associated with the identified keywords and the identity of the source.

Abstract: A method and system for creating a linked list and a method and system for searching data are disclosed. The method for creating the linked list includes obtaining a first linked list from a first storage area, in which the first linked list has at least one node, and each node at least includes first data; obtaining the first data of each node from the linked list; storing the first data into a preset second storage area and forming a second linked list. The method stores the node identifiers and the node pointers of the linked list preferentially using the continuous storage area, such that the times of cache updating which is triggered by the traverse operation are reduced, and the access speed of the accessed data is increased.

Abstract: Techniques for establishing a files system that exposes a virtual file system for backup operations are presented. Changes to files of a file system are maintained separately or collected and presented as a VFS. The VFS is then used to perform backup operations. Moreover, the files identified in the VFS can be customized based on search parameters, criterion, and/or criteria supplied by a user or supplied as parameters to backup and VFS mount operations.

Abstract: Provided is a user-interest driven launching pad of a mobile application and method of operating the same. The user-interest driven launching pad inputs metadata of data elements related to a mobile device, forms a set of data elements having the same metadata, marks the set of data elements with user-interest reflecting tags, and executes the mobile application relating to the set of data elements.

Abstract: A method, computer program product, and a data processing system for maintaining objects in a lookup cache is provided. A primary list is populated with a first plurality of objects. The primary list is an unordered list of the first plurality of objects. A secondary list is populated with a second plurality of objects. The secondary list is an ordered list of the second plurality of objects. Periodically, at least one object of the first plurality of objects is demoted to the secondary list, and at least one object of the second plurality of objects is promoted to the primary list.

Abstract: Technology is described for identifying language translations for source documents. The method includes finding source documents containing links to target documents and the link anchors of the links have language indicating text. A first tuple set can be generated for paired source documents and target documents with an expected target language for a target document. The first tuple set can be annotated with primary languages for the source documents and target documents to form a second tuple set where primary languages of the source documents and target documents are different. Further, a third tuple set can be generated using the second tuple set using a count of the number of times source documents and target documents occur in the first tuple set. Tuples can be removed from the third tuple set where a count ratio between source document count and target document count is less than a reference ratio.

Abstract: A method for proofing a prototype dynamic webpage version referencing first configuration data is disclosed. The prototype dynamic webpage can be derived from a live version referencing second configuration data and accessible via a live link. The method includes storing first configuration data in a configuration database also containing second configuration data, providing a prototype link to the prototype dynamic webpage version dissimilar from the live link; and returning, upon a prototype link request, the prototype dynamic webpage version, involving rendering the prototype dynamic webpage version based on the first configuration data without altering the live dynamic webpage version. Also disclosed is a dynamic webpage versioning system working off a configuration database and distinct versions of configuration data.

Abstract: The present invention provides an automated metadata producer, or “markup manager.” According to one aspect, the markup manager allows disparate resources to be made into useful objects by producing appropriate metadata and associating it with the original resources. In one example, a markup manager according to the invention first analyzes the original resources and outputs appropriate, descriptive metadata; then it creates a new document which includes both the metadata and an indicator to the original resource. The resource analysis and metadata production is accomplished by an algorithm in which first a “metadata schema” and a “perspective” (or facet) is selected (by the user or requesting program); then an automatic categorization step is taken where the appropriate metadata are found with respect to the selected perspective; then a transformation step is taken in which the autocategorized analyses are translated into the target metadata schema.

Abstract: Various embodiments utilize nested Iframes within a web page to allow cross domain communication. That is, various embodiments can create an embedded Iframe that shares the domain of an Iframe or web page with which communication is desired. Because the embedded Iframe shares the domain of the Iframe or web page with which communication is desired, restrictions on cross-site scripting do not inhibit communication or scripting between the domain-matched Iframe(s) and/or web page. This embedded Iframe can then provide a mechanism by which web pages or Iframes from other domains can communicate with the Iframe or web page with which the embedded Iframe shares a domain.

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.