Speedtrack, Inc.

Other

Acumetric, Inc.

Jerzy Jozef Lewak

Miles Kevin Yano

Andreas Wilhelm Dreher

Robert N Weinreb

Krzysztof Lukasz Mazur

Tim Pevzner

This disclosure addresses the need for pre-caching of database query results which in general is the caching of the results of query evaluation before they are needed. In certain embodiments of query evaluation, the computing time required to evaluate a query is dominated by the reverse query, the evaluation of which determines the available remaining selectors and the number of items associated with each. The time to compute this reverse query is on average approximately proportional to the number of matching items. This result is used as a very convenient method of determining, before evaluation, which conjunctive queries will take the most time to evaluate&#x2014;the long queries. These long queries can then be pre-cached, making them available for faster responses when they are needed. Methods of using cached conjunctive query results to more quickly evaluate certain queries comprising the disjunctive Boolean operators are also described.

Pre-caching

Methods and systems of providing remote coded data storage, data analysis, and search and retrieval, with assurance of data security are described. Data security is such that it protects the data from any provider, administrator of remote services, or anyone breaking into the servers housing the data at the remote site. The methods include a coding schema such that both the storage and the associated services, such as data analysis, search and retrieval, can be provided even more efficiently and more responsively than without the coding. Possible applications of the methods include data storage, powerful data search and analysis services which can all be provided 'in the Cloud' over the Internet, completely securely, even when a customer's private data set needs to be uploaded to the remote site. The efficiency of analysis, and search means that the methods may be useful even when security of data is not an issue.

Methods of providing fast search, analysis, and data retrieval of encrypted data without decryption

Methods of counting the number of matching items (more generally finding objects) indirectly associated with each detail selector (more generally another object) available for selection in a database search system or generally useful in other applications are disclosed. In some embodiment the method uses a set of matching items and traverses to each indirectly associated detail selector via a traversal through each associated entity, and a traversal through each detail selector associated with that entity. The method is easily extendable to the case of multiple entity levels. In some embodiments the method first creates an association matrix directly associating items to selectors and allowing item determination or counting more simply.

Item counting in guided information access systems

A method of organizing, managing, and providing interactive access to data in a database is disclosed, along with a program and a system for implementing the method. Associations between each data Item and at least one ItemSelector are established and stored. A predefined (but modifiable) Vocabulary of ItemSelectors sufficient to describe each Item of the database is created. Presently selected Items are described by a combination of associations defined by an appropriate Boolean combination of each ItemSelector in a presently selected set of ItemSelectors. A user controls the presently selected set by adding an ItemSelector from a presented group, or by removing a previously selected ItemSelector. The system ideally makes available to the user all relevant ItemSelectors&#x2014;those which, if added to the presently selected set, would result in a set that describes at least one extant data Item. The system ideally makes all presently selected Items available to the user.

Identifier vocabulary data access method and system

A method and system to derive association-explicit metadata, about a target data collection, that is useful to facilitate access and searching of the data collection, regardless of the organizational structure of the collection. The metadata may be generated to comprise DetailSelectors describing lowest level data elements; groups thereof that provide context for member DetailSelectors, plus Boolean properties for queries using such Selectors, and association links to higher-level GlueSelectors that comprise such DetailSelectors, as well as association links to yet higher levels, eventually to Items, which are of a level greater than the highest level GlueSelector, reference a predetermined collection of data in the target collection, and comprise suitable matches for all of the DetailSelectors represented. Such metadata may be used to present choices to a user for terms to add to a query while ensuring suitable match by information in at least one Item. Information about Groups of DetailSelectors and Groups of GlueSelectors, as well as information about content of a GlueSelector, may be presented to a user to reduce in the query and in the data thus located.

Data access using multilevel selectors and contextual assistance

Methods of dynamically presenting transformations of expressions comprising symbols representing abstract concepts are described. Methods are presented of animating these symbols to exhibit the transformations and, optionally, link these animations with the corresponding animations of a concrete pictorial model. Additional methods are described linking these animations with computer controlled and,even computer calculated explanations of the process in both text and sound. The purpose is to present the rules for transforming abstract representations (for example equations) in ways that are much easier to understand and remember. Such animations are the modern dynamic 'illustrations' of these transformations. Methods are described of computer controlled sequencing of the animations with corresponding animations of a concrete analogical model.

Method of presenting and teaching abstract concepts by animating abstract symbols

A method of organizing, managing, and providing interactive access to data in a database is disclosed, along with a program and a system for implementing the method. Associations between each data Item and at least one ItemSelector are established and stored. A predefined (but modifiable) Vocabulary of ItemSelectors sufficient to describe each Item of the database is created. Presently selected Items are described by a combination of associations defined by an appropriate Boolean combination of each ItemSelector in a presently selected set of ItemSelectors. A user controls the presently selected set by adding an ItemSelector from a presented group, or by removing a previously selected ItemSelector. The system ideally makes available to the user all relevant ItemSelectors&mdash;those which, if added to the presently selected set, would result in a set that describes at least one extant data Item. The system ideally makes all presently selected Items available to the user.

In the field of computer text search engines, regular expression text pattern matching is combined with an extended set of Boolean operators. A pre-processor is described which will convert mixed Boolean-GREP expressions into equivalent pure GREP expressions enabling existing GREP search technology to be used to implement this invention. Additional optimizations are described when users need to search for any one of a list of text patterns.

Boolean text search combined with extended regular expression search

An electronic apparatus for counting and recording a number of drops of fluid. The preferred embodiment of the invention is configured as a molded receptacle housing for receiving a commercially available eyedrop bottle in which the cap has been replaced by the housing. The invention includes a detection device that detects the separation of drops from a fluid supply bottle, and counts and records the number of such drops in a preset time period. Optionally, a real-time clock time stamps the stream of drop count data so that the absolute time period during which drops are released is also ascertained and recorded. Optionally, a reminder signal or indication is given to a patient as to the dosage and appropriate time for each eyedrop administration, or an alarm is given if over or under medication is occurring. An alternative application is disclosed in which the drop detection and counting features of the invention are used in a feedback loop to control the flow of fluid in a drop metering system.

Drop counting system

An electronic apparatus for counting and recording a number of drops of fluid. The preferred embodiment of the invention is configured as a molded receptacle housing for receiving a commercially available eyedrop bottle in which the cap has been replaced by the housing. The invention includes a detection means that detects the separation of drops from a fluid supply bottle, and counts and records the number of such drops in a preset time period. Optionally, a real-time clock time stamps the stream of drop count data so that the absolute time period during which drops are released is also ascertained and recorded. Optionally, a reminder signal or indication is given to a patient as to the dosage and appropriate time for each eyedrop administration, or an alarm is given if over or under medication is occurring. An alternative application is disclosed in which the drop detection and counting features of the invention are used in a feedback loop to control the flow of fluid in a drop metering system.

Growing community of inventors

Del Mar, CA, United States of America

Jerzy Jozef Lewak