Abstract:
Disclosed are methods for inferring interests of a user based on declared interests of the user. Text for which a user has expressed interest, e.g. “liked” is evaluated to identify at least one principal concept. A principal article for the principal concept is located in a taxonomy and the link structure of the taxonomy analyzed to identify candidate articles related to the principal article. The candidate articles are scored according to a plurality of metrics and these scored are weighted and combined for a final score. Candidate articles are selected for the score and recommendations are generated and recommendations generated based on the concepts of the selected candidate articles.
Abstract:
A system includes a first database to associate a sub-interface identifier with customer information, a second database to store a history of customer usage records, and a first device. The first device may receive information from a routing device, where the information includes the sub-interface identifier for a sub-interface of the routing device and information identifying an amount of network traffic received at or transmitted from the sub-interface over a time period, use the sub-interface identifier to obtain the associated customer information from the first database, associate the customer information with the information identifying an amount of network traffic received at or transmitted from the sub-interface over a time period to create a new customer usage record, and store the new customer usage record in the second database.
Abstract:
The present invention provides an improved process for the isolation of oleane compounds from the bark of Terminalia arjuna (Roxb.). More particularly, the present invention relates to an improved process for the isolation of arjunic acid and its derivates from the bark of Terminalia arjuna (Roxb.). The present invention further provides the identification of arjunic acid [1] and its derivatives as anticancer agent useful in the treatment of various types of cancer in humans.
Abstract:
Determining one or more concepts associated with a query is disclosed. A query is received. A list of concepts and associated scores is received. The concepts fit within a concept hierarchy. A density function is used to evaluate the received concepts. One or more concepts are associated with the query based at least in part on the results of the density function.
Abstract:
Systems and methods are provided for processing a data stream in real time to identify connections between one or more social elements social elements and aggregating and storing the identified connections over a rolling time window. Social elements may be stored as nodes and connection between social elements may be stored as labeled connections between nodes.
Abstract:
The present invention relates to the development of a unique inflorescence bearing mutant plant type lli/lli (LEAF-LESS INFLORESCENCE). Further the present invention relates to the development of a unique inflorescence bearing mutant plant type lli/lli (LEAF-LESS INFLORESCENCE) through chemical mutagenesis The present invention relates to the development of a new and distinct plant type for floricultural usage. The new type is a monogenic Mendelian recessive stable mutant plant of Catharanthus roseus with a novel leafless inflorescence architecture with increased flower frequency. This distinct plant of Catharanthus roseus was developed through chemical mutagenesis followed by salt tolerance selection.
Abstract:
Systems and methods are disclosed herein for performing classification of documents or performing other tasks based on rules. A rule generator receives a request for a rule that will receive as an input a document and output an outcome such as a classification of the document, addition of the document to a whitelist or blacklist, or occurrence of some other outcome. The rules are applied to a document and the document and outcome of the rules are presented to a rater. A rating of the accuracy of the outcome is received from the rater and the rating is propagated to quality metrics of rules that contributed to the outcome. Rules with a quality metric above a threshold may be added to a production rule set. Rules with a quality metric below a threshold may be removed.
Abstract:
Exemplary embodiments allow performance of stream computations on real-time data streams using one or more map operations and/or one or more update operations. A map operation is a stream computation in which stream events in one or more real-time data streams are processed in a real-time manner to generate zero, one or more new stream events. An update operation is a stream computation in which stream events in one or more real-time data streams are processed in a real-time manner to create or update one or more static “slate” data structures that are stored in a durable manner.
Abstract:
A system includes a first database to associate a sub-interface identifier with customer information, a second database to store a history of customer usage records, and a first device. The first device may receive information from a routing device, where the information includes the sub-interface identifier for a sub-interface of the routing device and information identifying an amount of network traffic received at or transmitted from the sub-interface over a time period, use the sub-interface identifier to obtain the associated customer information from the first database, associate the customer information with the information identifying an amount of network traffic received at or transmitted from the sub-interface over a time period to create a new customer usage record, and store the new customer usage record in the second database.
Abstract:
Systems and methods are provided for processing a data stream in real time to identify connections between one or more social elements social elements and aggregating and storing the identified connections over a rolling time window. Social elements may be stored as nodes and connection between social elements may be stored as labeled connections between nodes.