Abstract: The example embodiments are directed to a system and method for tag mapping. In one example, the method includes receiving a request to perform tag mapping for a target tag of a master data set, the target tag representing a target component of an asset, querying a customer data for a plurality of candidate tag records based on the target tag, tokenizing the plurality of candidate tag records included in the customer data set, reducing an amount of the tokenized tag records in the customer data set based on the target tag and each tokenized candidate tag record, performing tag mapping with the reduced amount of tokenized tag records to identify at least one candidate tag that is a possible match to the target tag, and outputting information concerning the identified at least one matching candidate tag.

Abstract: The example embodiments are directed to a pluggable framework for managing algorithm ensembles for code design. In one example, the method includes receiving a selection of an algorithm from among a plurality of available algorithms, inserting the selected algorithm into an algorithm ensemble including a grouping of algorithms which combine to perform a data processing operation, the inserting comprising linking an input of the selected algorithm to an output of a first algorithm and linking an output of the selected algorithm to an input of a second algorithm, from among the algorithms included in the algorithm ensemble, and executing the algorithm ensemble on input data in an order defined by the linking to generate a processing result of the input data.

Abstract: The example embodiments are directed to a system and method for tag mapping. In one example, the method includes receiving a request to perform tag mapping for a target tag of a master data set, the target tag representing a target component of an asset, querying a customer data for a plurality of candidate tag records based on the target tag, tokenizing the plurality of candidate tag records included in the customer data set, reducing an amount of the tokenized tag records in the customer data set based on the target tag and each tokenized candidate tag record, performing tag mapping with the reduced amount of tokenized tag records to identify at least one candidate tag that is a possible match to the target tag, and outputting information concerning the identified at least one matching candidate tag.

Abstract: The example embodiments are directed to a system and method for tag mapping. In one example, the method includes receiving a request to perform tag mapping for a target tag of a master data set, the target tag representing a target component of an asset, querying a customer data for a plurality of candidate tag records based on the target tag, tokenizing the plurality of candidate tag records included in the customer data set, reducing an amount of the tokenized tag records in the customer data set based on the target tag and each tokenized candidate tag record, performing tag mapping with the reduced amount of tokenized tag records to identify at least one candidate tag that is a possible match to the target tag, and outputting information concerning the identified at least one matching candidate tag.

Abstract: The example embodiments are directed to a system and method for tag mapping. In one example, the method includes receiving a request to perform tag mapping for a target tag of a master data set, the target tag representing a target component of an asset, querying a customer data for a plurality of candidate tag records based on the target tag, tokenizing the plurality of candidate tag records included in the customer data set, reducing an amount of the tokenized tag records in the customer data set based on the target tag and each tokenized candidate tag record, performing tag mapping with the reduced amount of tokenized tag records to identify at least one candidate tag that is a possible match to the target tag, and outputting information concerning the identified at least one matching candidate tag.

Abstract: The example embodiments are directed to a pluggable framework for managing algorithm ensembles for code design. In one example, the method includes receiving a selection of an algorithm from among a plurality of available algorithms, inserting the selected algorithm into an algorithm ensemble including a grouping of algorithms which combine to perform a data processing operation, the inserting comprising linking an input of the selected algorithm to an output of a first algorithm and linking an output of the selected algorithm to an input of a second algorithm, from among the algorithms included in the algorithm ensemble, and executing the algorithm ensemble on input data in an order defined by the linking to generate a processing result of the input data.

Abstract: A process for identifying, accurately selecting, and storing scientific data that is present in textual formats. The process includes providing scientific data located in a text document and searching the text document using a computer and selecting a plurality of key words and phrases using an algorithm. The selected key words and phrases are matched with a plurality of semantic definitions and a plurality of semantic definition-key words and phrase pairs are created. The created plurality of semantic definition-key words and phrase pairs are displayed to a user via a computer user interface and the user selects which of the created plurality of semantic definition-key words and phrase pairs are accurate. The process also includes storing the selected and accurate semantic definition-key words and phrase pairs in computer memory.

Abstract: A process for identifying, accurately selecting, and storing scientific data that is present in textual formats. The process includes providing scientific data located in a text document and searching the text document using a computer and selecting a plurality of key words and phrases using an algorithm. The selected key words and phrases are matched with a plurality of semantic definitions and a plurality of semantic definition-key words and phrase pairs are created. The created plurality of semantic definition-key words and phrase pairs are displayed to a user via a computer user interface and the user selects which of the created plurality of semantic definition-key words and phrase pairs are accurate. The process also includes storing the selected and accurate semantic definition-key words and phrase pairs in computer memory.

Abstract: A novel material, forming supramolecular structures below its transition temperature, which contains at least one C?O and/or C?S group and at least one N—H, O—H and/or S—H group and wherein the material has the structure A(-X—B)n??(1) wherein A, X, B and n are defined. Also a process for preparation of the material and uses thereof.

Abstract: A cycle, such as a bicycle, used forward and rearward movement of handlebars to provide an additional force for driving or propelling the rear wheel of a bicycle. A drive rod linkage extends from the handlebars to transmit the fore and aft movement of the handlebars to drive the rear wheel of the bicycle. The rod linkage transfers this fore and aft motion without interfering with conventional steering of the front wheel. Forward and rearward movement of the handlebars is consistent with the normal manner of riding a traditional bicycle.

Abstract: The invention relates to novel material, forming supramolecular structures below its transition temperature, which contains at least one C=O and/or C=S group and at least one N—H, O—H and/or S—H group and wherein the material has the structure A(—X—B)n ??(1) wherein A is a cyclic, aromatic and/or aliphatic group, n being a number of 1 to 4, —X—B is, if n is 2, the same or different, and if n is 3 or 4, the same, partly the same or different and has one of the structures (2) to (4) NH—C(Y)—Y—B ??(2) —NH—C(Y)—NR—B ??(3) —Y—C(Y)—NR—B ??(4) with Y being an Oxygen and/or Sulfur atom, B being an organic group with at least one heteroatom, where the heteroatom is bound to at least two carbon atoms when B is linear or cyclic, and where the heteroatom is bound to at least one carbon atom when B is branched, and R being a Hydrogen atom, a cyclic, aromatic and/or aliphatic group or another B group which is the same or different.

Abstract: A method of optimizing a contact management system using a computerized system including a set of titles. The method includes storing a set of user identity records in an identity management site, wherein each record of the set of user identity records can be redeemed by a pointer. The method also includes generating a contact title including the pointer for the record; storing the contact title in a first title management site; selecting the contact title; redeeming the record from the identity management site; and displaying the record.

Abstract: Methods and apparatus are described for the distribution of digital assets in title-enabled systems. More specifically, these methods and apparatus employ title objects, i.e., unique instances of digital bearer instruments, to optimize the distribution of digital assets.

Abstract: Methods and apparatus are describe for providing access to identity information corresponding to a first entity. The identity information includes a plurality of identity components stored in a distributed manner. A first identity access title object is generated which is operable to confer rights to access first selected ones of the identity components to a presenter of the first identity access title object. The first identity access title object is transmitted to a second entity. Access to the first selected identity components is facilitated in response to presentation of the first identity access title object by the second entity.

Abstract: A method of optimizing a contact management system using a computerized system including a set of titles. The method includes storing a set of user identity records in an identity management site, wherein each record of the set of user identity records can be redeemed by a pointer. The method also includes generating a contact title including the pointer for the record; storing the contact title in a first title management site; selecting the contact title; redeeming the record from the identity management site; and displaying the record.

Abstract: A title management apparatus resident on a first computer including a memory for storing a control program and data, and a processor for executing the control program and for managing the data. The apparatus includes a title object resident in the memory including a title structure, the title structure further comprising a content element, a set of attributes, and a set of title object security indicia. The apparatus further includes an authorization structure configured to selectively redeem the content element based at least in part on the user security indicia, and further configured to use a set of protocols. The apparatus also includes a title management structure configured to associate a user with the title object based at least in part on the user data and the title attributes.