Other

Kang Jo Mgmt, Limited Liability Company

Pliant Technologies, Inc.

The Standard Oil Company

Paul S Odom

Michael J Massey

Dennis Kotlar

Robie Childers

Robert D Way

Subramanian Akileswar

The present invention provides search engine methods and systems for generating highly personalized and relevant search results based on the context of a user's search constraint and user characteristics. In an embodiment, upon receipt of a user's search constraint, the method determines all semantic variations for each word within the user search constraint. Additionally, topics can be determined within the user constraint. For each unique word and topic within the user search constraint, possible contexts are determined. A matrix of feasible context scenarios is established. Each context scenario is ranked to determine the most likely context scenario for which the user search constraint relates based on user characteristics. In one embodiment, the weighting used to rank the contexts is based on previous user searches and/or knowledge of their interests. Search results associated with the highest ranking context are provided to the user, along with topics associated with lower ranked contexts.

Methods and systems for providing personalized contextual search results

The present invention provides systems and methods for decision making support. The decision making support can be used, for example, for help desk troubleshooting, medical diagnosis, financial planning, and expert device. The decision support system of the invention includes a processor and a memory having a decision support program module, a phase dictionary, one or more solution nodes and optionally a topic identification information module. The decision support module is configured to enable the processor to receive a problem constraint and one or more user-specified phrases, which are then used to search nodes in a solution domain to identify a set of nodes potentially related to the user's problem or question. The set of nodes potentially related to the user's problem or question are ranked and displayed. Methods to determine potential solution nodes and to update solution nodes within the decision support system are provided.

System and method for networked decision making support

The present invention provides search engine methods and systems for displaying relevant and timely topics. In an embodiment, a method for displaying topics related to a search constraint entered by a user includes receiving a search constraint; identifying a first preliminary set of topics related to the search constraint, wherein the first preliminary set of topics are representative of a sample set of general data items; identifying a second preliminary set of topics related to the search constraint, wherein the second preliminary set of topics is representative of a sample set of current event data items; identifying a set of display topics that is a subset of the first preliminary set of topics and the second preliminary set of topics; and displaying the set of display topics. In other embodiments, other systems and methods are provided.

Search engine methods and systems for displaying relevant topics

A technique to determine topics associated with, or classifications for, a data corpus uses an initial domain-specific word list to identify word combinations (one or more words) that appear in the data corpus significantly more often than expected. Word combinations so identified are selected as topics and associated with a user-specified level of granularity. For example, topics may be associated with each table entry, each image, each sentence, each paragraph, or an entire file. Topics may be used to guide information retrieval and/or the display of topic classifications during user query operations.

Topic identification and use thereof in information retrieval systems

A bicycle with a triangulated crank structure replaces the single span crank arm which connects the spindle to the foot pedal on bicycles today. The triangulated crank structure is typically comprised of several sections including two linear spans of structural material arranged so that one end of each linear span connects with the other to form the vertex of an acute angle, proximate to a pedal attachment area. From the vertex, the linear spans diverge and each connects at its opposite end to separate locations on a structural element attached to an end of the bicycle's crankshaft or spindle.

Triangulated bicycle pedal support structure

A bicycle is disclosed with a triangulated crank structure that replaces the single span crank arm which connects the spindle to the foot pedal on bicycles today. Said triangulated crank structure is typically comprised of several sections including two linear spans of structural material arranged so that one end of each linear span connects with the other to form the vertex of an acute angle, proximate to a pedal attachment area. From said vertex, said linear spans diverge and each connects at its opposite end to separate locations on a structural element attached to an end of the bicycle's crankshaft or spindle.

A memory for access by a program being executed by a programmable control device includes a data access structure stored in the memory, the data access structure including a first and a second index structure (each having a plurality of entries) together forming a tiered index. At least one entry in the first structure indicates an entry in the second structure. The number of entries in the second structure being dynamically changeable. A method for building a tiered index structure includes building a first-level index structure having a predetermined number of entries, building a second-level index structure having a dynamic number of entries, and establishing a link between an entry in the first-level index structure and an entry in the second-level index structure.

Tiered hashing for data access

The present invention simplifies the data modeling process and enables its full dynamic versioning by employing a non-hierarchical non-integrated structure to the organization of information. This is achieved by expressing data modeling, storage and transfer in a particular non-hierarchical, non-integrated neutral form. The neutral form of the present invention enables complete parallel processing of both data storage and data transfer operations. It also enables the direct integration of separate but related data models and their data without remodeling or reloading. Finally, the present invention enables direct transfer of neutral form information in a manner that includes all of the properties required to independently understand and interpret each transferred data value.

Method for modeling, storing and transferring data in neutral form

Methods to store a first data structure having zero or more fixed-length data items and a reference to a second data structure are described. The second data structure having a variable-length data item (indicated by the reference) may also be stored in the memory. In addition, methods to validate and repair a pointer element having a file identification portion and a file offset portion are described. The methods include determining if the file identification portion indicates an allocated file and indicating an invalid pointer condition if the file identification portion indicates an unallocated file, else determining if the file offset portion indicates an allocated block in the allocated file, and indicating an invalid pointer condition if the file offset portion indicates an unallocated block. The described methods may be stored in any media that is readable and executable by a programmable control device.

Blocking techniques for data storage

Method for modeling, storing, and transferring data in neutral form

Substantial operating cost savings are realized in the recovery of acrylonitrile from an aqueous solution containing acrylonitrile by using the recovery column bottoms stream to provide heat to one or more distillation columns in the process.

Growing community of inventors

Houston, TX, United States of America

Paul S Odom