Abstract: A method and apparatus for efficient and consistent validation/conflict detection in a Software Transactional Memory (STM) system is herein described. A version check barrier is inserted after a load to compare versions of loaded values before and after the load. In addition, a global timestamp (GTS) is utilized to track a latest committed transaction. Each transaction is associated with a local timestamp (LTS) initialized to the GTS value at the start of a transaction. As a transaction commits it updates the GTS to a new value and sets versions of modified locations to the new value. Pending transactions compare versions determined in read barriers to their LTS. If the version is greater than their LTS indicating another transaction has committed after the pending transaction started and initialized the LTS, then the pending transaction validates its read set to maintain efficient and consistent transactional execution.

Abstract: A system for computer-based storing of information about a current state so that later recall of the information can augment human memories. In particular, when information about a current event of interest is to be stored, a variety of current state information of different types (e.g., video, audio, and textual information) about the environment and about a user can be acquired via sensors and other input devices. The variety of state information can then be associated together as a group and stored for later retrieval. Other information can also be associated with the group, such as one or more recall tags that facilitate later retrieval of the group, or one or more annotations to provide contextual information when the other state information is later retrieved and presented to the user. When information about a past event is to be recalled, one or more identifying recall tags can be received that are used to identify one or more state information groups that match the identifying tags.

Abstract: A class definition syntax that leverages the array and math-oriented nature of a dynamically typed array-based programming language is discussed. Some embodiments of the present invention provides a mechanism for using meta-data to define a class implemented in the dynamically typed array-based programming language. The meta-data provide an easy way to provide class definitions and allow a user to access the class definitions from objects. The meta-data also support extension of class definitions without introducing backward incompatibility.

Abstract: While a user is viewing content on a computer display, the universal data relationship inference engine presents related information from disparate data sources. A normalized index is maintained that indexes content to a set of standard taxonomy terms. The inference engine parses content being viewed by the user. If the content includes tags for some of the standard taxonomy terms, then the system may provide the user with the ability to view the related content that is indexed by the normalized index. If there are not taxonomy tags then the system may attempt to recognize non-standard taxonomy terms in the content in order to provide the user with related content. The inference engine may also identify related content by identifying synonyms to the taxonomy terms.

Abstract: An exemplary method includes receiving data representative of a content instance over a network from an access device associated with a user, storing the data representative of the content instance, providing the user with an interface configured to allow the user to define at least one access rule corresponding to the content instance, the at least one access rule based on at least one user profile and at least one access device profile, receiving a communication from another access device over the network, and performing a predefined action related to the content instance in response to the communication and in accordance with the at least one access rule.

Abstract: A method and apparatus for computer file system traversal. An embodiment of a method includes receiving a set of data. The set of data has a hierarchical file structure, and the set of data includes multiple data elements. The set of data is traversed, where traversing the set of data elements includes determining whether to skip or process each data element that is addressed in the set of data. A serial data stream representing selected data elements of the set of data is output.

Abstract: While a user is viewing content on a computer display, the universal data relationship inference engine presents related information from disparate data sources. A normalized index is maintained that indexes content to a set of standard taxonomy terms. The inference engine parses content being viewed by the user. If the content includes tags for some of the standard taxonomy terms, then the system may provide the user with the ability to view the related content that is indexed by the normalized index. If there are not taxonomy tags then the system may attempt to recognize non-standard taxonomy terms in the content in order to provide the user with related content. The inference engine may also identify related content by identifying synonyms to the taxonomy terms.

Abstract: A network based review management system and method for managing a plurality of enrolled websites and a plurality of review content items includes a network, a first database of enrolled websites connected to the network, and a second database of review content items connected to the network. Each of the enrolled websites of the first database is associated with one or more review content items of the second database. When one of the enrolled websites is accessed over the network, the one or more review content items from the second database are delivered over the network to the accessed one of the enrolled websites for viewing thereof and/or one or more review content items is added over the network to the second database through the accessed one of the enrolled websites.

Abstract: A mechanism by which rule attributes of varying types and numbers can be stored and searched in an efficient manner is provided by storing attribute values of each rule in a child table of a parent rule table. The child table is normalized and contains a foreign key pointing back to the parent rule table and has attribute-value pairs as table columns of the child table. Each rule is then represented by one row of the parent rule table and one or more corresponding rows of the child rule details table. A variable and unlimited number of attribute dimensions is supported among the rules, and search performance is improved through the use of database indexes on the rule details table attribute columns. Metadata representing the structure of the child rule details table will identify the data attributes for each dimension.

Abstract: System and method for performing Unicode matching for comparing and merging similar data objects having Unicode strings that are equivalent yet not exact matches. Unicode characters are characterized by number of strokes, stroke order, radicals, geometry, phonemes in association with input method editor and keyboard characteristics such as location of a character on an IME or keyboard (or number of GUI interface interactions used in entering the character, e.g., via tapping where “a” on a mobile device keyboard takes 1 tap of a key, “b” takes 2 taps). These characteristics associated with code points and IME's/keyboards are utilized to create subdomains for matching and determining “distance” to other Unicode code points (e.g., number of keyboard keys away). Allows for determining whether close, yet incorrect data entry may have taken place. Enables merging of duplicate data objects into master data object where minor differences or spelling errors introduce actually represent duplicate data.

Abstract: Various embodiments of systems, methods, and software provide attachment-based mass data input and output for a distributed application system. Software for interactive, attachment-based data management may comprise computer readable instructions operable when executed to receive a request from a logically remote client via a network interface, where the request indicates a data file and a business object associated with a business application. The business object is then updated with a message in a format associated with the business application based on the data file. The data file is then stored in a repository and a dependent object (included in, or referenced by, or otherwise associated with the business object) is then updated with a logical location of the data file in the repository.

Abstract: A computer implemented method is provided for processing data representing a data entity having sub entities. The method includes analyzing queries to the data entity for deriving information about sets of the sub entities frequently queried together, and grouping the sub entities to a number of banks, each bank having a maximum width, based on the information about sets of sub entities frequently queried together, in order to reduce an average number of banks to be accessed for data retrieval.

Abstract: A computer-implemented method for duplicating backup images may include (1) identifying at least one storage device, (2) identifying a plurality of backup images to be duplicated to the storage device, (3) creating a composite image of the plurality of backup images, and then (4) storing the composite image on the storage device instead of duplicating the plurality of backup images to the storage device. Various other methods, systems, and computer-readable media are also disclosed.

Abstract: A method for creating an application cluster virtual node. The method may comprise identifying a plurality of nodes associated with an application cluster. The method may also comprise creating a virtual node that is associated with each node in the plurality of nodes. The method may comprise providing a data protection server with access to at least one node in the plurality of nodes. The access may be provided through the virtual node. A computer-readable medium is also disclosed.

Abstract: A textual search index is used to identify data objects that have numerical properties that satisfy search queries. As described herein, a search index contains search index entries, each of which specifies a reference string and a set of data object identifiers. When an original search query is received, the search query is transformed into a transformed search query such that numerical comparison query elements in the original search query are transformed into equivalent textual comparison query elements. The search index is then used to identify ones of the data objects that satisfy the transformed search query. A list of the identified data objects may then be provided in response to the original search query.

Abstract: Methods and systems for formulating and executing concept-structured queries of unorganized data are described. One described method for searching an unstructured data set includes receiving at least one user specified category whose definition is unconstrained, receiving at least one user specified token associated with the at least one category, generating a boolean query associated with the at least one token and the at least one category, executing the boolean query against an unstructured data set to identify at least one article identifier associated with an article, and creating a result set comprising the at least one article identifier.

Abstract: A method and apparatus for processing a transform function and parameter information to represent data files is described. In one embodiment, the method includes processing at least one data file to identify a reference file, a transform function and parameter information and storing the transform function and the parameter information, wherein the transform function and the parameter information is applied to the reference file to create the at least one data file.

Abstract: A class definition syntax that leverages the array and math-oriented nature of a dynamically typed array-based programming language is discussed. Some embodiments of the present invention provides a mechanism for using meta-data to define a class implemented in the dynamically typed array-based programming language. The meta-data provide an easy way to provide class definitions and allow a user to access the class definitions from objects. The meta-data also support extension of class definitions without introducing backward incompatibility.

Abstract: A method of optimizing data recovery in an RDF data system in which the occurrence of data values across one or more of subject, predicate, and object are ranked, a handle is assigned to each of one or more of the ranked data values wherein the handle is directly based on the ranking. The rank-based handle can then be used to index the RDF statements. An RDF data recovery system includes an RDF statement processor configured to rank data values and assign handles to data values based on ranking.

Abstract: A computer-implemented method, apparatus, and computer program product for performing a search for data. In one embodiment, the process converts each character of the search query into a phonetic variant to form an inflected search query. The process then identifies a set of inflected data fields of a vector space library satisfying the inflected search query. The set of inflected data fields are formed from a set of lightweight directory access protocol data fields of a set of lightweight directory access protocol records. Thereafter, the process generates a search result listing records of the set of records satisfying the search query.