Abstract: A method (and system) for specifying the region layout of objects in an affine invariant manner as a set of affine intervals between pairs of regions, includes representing database and query regions using affine intervals along with their region identity, matching query region layout to layout of database image regions using an index structure, and retrieving relevant images of the database by hashing for dominant hit regions in the index structure.

Abstract: A system and method for providing geographic data to end users' computing platforms. A server maintains downloadable geographic data that are organized into pre-computed parcels that correspond to pre-determined sub-areas into which the entire geographic region serviced by the server is divided. The server responds to requests from the end users' computing platforms for navigation services and data by sending selected pre-computed parcels of geographic data to the end users' computing platforms. The end users' computing platforms store the pre-computed parcels received from the server in a cache memory. The end users' computing platforms use the data in the pre-computed parcels to provide navigation-related features locally.

Abstract: An instant portal software module executing on a computer system for locating relevant Web pages includes instructions to collect information regarding a user from the computer system. Instructions are provided to create a user profile based on the information collected. Instructions are also provided to receive a search entry from the user. The instant portal software module generates a plurality of queries based on the search entry and the user profile to search for relevant Web page addresses. The instant portal software module searches the Internet for relevant Web page addresses using the plurality of queries, and then provides the results of the relevant Web page addresses located to the user.

Abstract: A method for searching a database includes receiving a search criteria including a plurality of search elements corresponding to at least some of the record elements of a database. Each of the search elements is capable of returning one or more corresponding search results from the records of the database. The search elements of the search criteria are ordered based upon an expected size of the corresponding search results from the database. The database is searched with one of the search elements, which is expected to provide a first group of the search results, before searching the database with another one of the search elements, which is expected to provide a second, relatively larger sized group of the search results, thereby improving the efficiency of the database search.

Abstract: According to the invention, a system and method for organizing expression information in a way that facilitates data mining. A database model is provided which may organize information relating to, e.g., sample preparation, expression analysis of experiment results, and intermediate and final results of mining expression and concentration results. The model is readily translatable into database languages such as SQL and the like. The database model scales to permit mining of expression or concentration information collected from large numbers of samples.

Abstract: A method includes creating and storing in various relational database tables: a biz metrix, by articulating variables that will appear on the metrix; biz metrix components; structure or relationships of the biz metrix; data elements that will appear on the metrix, including a text field storing a rule; defining the rule; creating and storing the metrix itself; metrix details; and potential types of subjects of the biz metrix.

Abstract: A method for obtaining a balanced digital tree structure. The digital tree structure including a first vertical oriented digital tree structure that is susceptible to unbalanced structure of blocks due to modify transactions. The first digital tree including blocks, each, accommodating a plurality of nodes and links originating from the nodes. The method includes the step of constructing few vertical oriented digital tree structure levels. The tress are arranged such that from blocks of a tree in a given level, it is possible to access horizontally all the blocks of the next level, according to a common key value of the accessed block, whereby a balanced horizontal oriented digital tree structure is obtained.

Abstract: A data mining system uncovers patterns, associations, anomalies and other statistically significant structures in data. Data files are read and displayed. Objects in the data files are identified. Relevant features for the objects are extracted. Patterns among the objects are recognized based upon the features. Data from the Faint Images of the Radio Sky at Twenty Centimeters (FIRST) sky survey was used to search for bent doubles. This test was conducted on data from the Very Large Array in New Mexico which seeks to locate a special type of quasar (radio-emitting stellar object) called bent doubles. The FIRST survey has generated more than 32,000 images of the sky to date. Each image is 7.1 megabytes, yielding more than 100 gigabytes of image data in the entire data set.

Abstract: Three kinds of data, i.e., a keyword frequency-of-appearance, a document length, and a keyword weight, are produced. Then, a document profile vector and a keyword profile vector are calculated. Then, by independently performing the weighted principal component analysis considering the document length and the keyword weight, a document feature vector and a keyword feature vectors are obtained. Then, documents and keywords having higher similarity to the feature vectors calculated with reference to the retrieval and extracting conditions are obtained and displayed.

Abstract: A computer system and computer-implemented process for determining availability of rental property is disclosed. The computer implemented process includes inputting and storing data representing multiple sets of attributes for each of a plurality of rental property addresses and creating a plurality of records, one for each set of attributes for each of the plurality of rental property addresses. The process further comprises combining the plurality of records into one searchable master table, and periodically updating the plurality of records by inputting updated data for one or more of the multiple sets of attributes for the plurality of rental property addresses. To search for property availability, the user inputs one or more search parameters based on one or more desired attribute sets from the multiple sets of attributes to build a search query to search the master table for records of available rental property addresses. Matching rental property is displayed.

Abstract: An optimization technique that reorders outerjoins and antijoins with inner joins in a bottom-up optimizer of a relational database management system (RDBMS). Each join predicate is associated with a normal eligibility list (NEL) that includes tables that are referenced in the join predicate and an extended eligibility list (EEL) that includes additional tables that are referenced in conflicting join predicates. An EEL includes all the tables needed by a predicate to preserve the semantics of the original query. During join enumeration, the optimizer determines whether a join predicate's EEL is a subset of all the tables in two subplans to be merged, i.e., whose EEL is covered. If so, the two subplans are combined using the join predicate. Otherwise, the two subplans cannot be joined. Two approaches are used to reordering: without compensation and with compensation. The “without compensation” approach only allows join reorderings that are valid under associative rules.

Abstract: Disclosed is a method for determining database queries to be sent by an analytical server to a Relational Dababase Monitoring System (RDBMS) by using hierarchical level metadata to describe the various structures within the database.

Abstract: An improvement to an automatic data extractor has the capability of discovering new values that are not recognized by the vocabulary of the automatic data extractor and adding them to the record being formed and to the vocabulary, thus accumulating new vocabulary through use. The extractor gleans new values by deducing them from the structure of the text data and learns them by adding them to its vocabulary. The data extractor determines the structure of the data in much the same way as prior art data extractors but then a discovery process is used to identify a series of field lists using preferably at least one field parser and a field grader. The results of the grader are returned to an attribute mapper that identifies the position in the field list for each of the attributes.

Abstract: Method and system for configuring a network computer to distinguish between a first address path for a first logging module and a second address path for a second logging module for a log report, using full distinguished names (FDNs) that provide first and second address paths for the first and second logging modules, where the first and second address paths have different object level addresses at an object level immediately below the root level. Where a local distinguished name (LDN) (or relative distinguished name RDN) is used for an address path, the system forwards a log report to an associated Log Server only if the first component of the address path is a selected object level address, such as ‘/system’.

Abstract: Methods and systems for management of invention disclosures, in one exemplary embodiment, utilizes a system including a server and at least one device connected to the server via a network. The system restricts access of users based upon job description. In addition, the system facilitates evaluation of each invention disclosure by storing invention disclosure information input by users and sorting invention disclosures based on criteria input by the submitter as well as by other multiple users via the device. Invention disclosure information is based upon at least one of an innovation disclosure, a patentability assessment, an intrinsic value assessment, a competitive value assessment and an overall assessment of the invention.

Abstract: A data retrieval system has a data server, a co-presence server and at least one awareness co-presence client. The data server retrieves at least one data object from among a plurality of data objects stored in a data repository. The co-presence server opens communication and observation channels associated with at least one of the data objects. The awareness co-presence clients communicate with the co-presence server and define an awareness state of the client. The co-presence server opens a communication channel or an observation channel with each client depending on the awareness state of each client per retrieved data object. For observation channels, the co-presence server indicates to each client which other clients have retrieved the same data object. The co-presence server opens a communication channel associated with a retrieved data object to those clients which retrieved the data object and which are in a communication type of awareness state.

Abstract: In a network of computer nodes, a directory service provides both the physical location of directory information around the network and the directory information itself in a single data structure. This single data structure is distributed throughout the network, and continuously redistributed, so as to create a directory service that is both more flexible, and more robust, than prior art directory services.

Abstract: A data managing apparatus includes a data file storing records each including data units corresponding to predetermined items, and an index file corresponding to a certain item which requires data arrangement in a predetermined sequence and storing change bits each corresponding to one of the records stored in the data file and each representing whether data has been changed between the adjacent records with respect to the corresponding item. When a retrieval request is received from an operator about the foregoing certain item, the change bits are read from the index file following a retrieval start position and a retrieval direction designated by the retrieval request, so that a requested record is identified based on the read change bits. Then, data units of the identified record are read from the data file and notified to the operator via a display device or the like.

Abstract: A search system and method for one agent or for multiple agents using a space-filling curve provides a way to control one or more agents to cover an area of any space of any dimensionality using an exhaustive search pattern. An example of the space-filling curve is a Hilbert curve. The search area can be a physical geography, a cyberspace search area, or an area searchable by computing resources. The search agent can be one or more physical agents, such as a robot, and can be software agents for searching cyberspace.

Abstract: Generation of output or reports on information contained in a data source which may be any of two or more types of source data, in a standardized or uniform manner is provided. A plurality of drivers are provided specific to different types of source data which include programming for identifying structural or other characteristics of the various data sources, e.g. for use in defining a new database. Preferably the new database is configured to permit highly flexible and/or rapid output or reporting or is otherwise optimized for reporting purposes. In one embodiment, the present invention includes conversion of one or more data sources into one or more uniform databases, preferably generating one or more key categories for organizing the data, optionally generating category groupings or rollups and additional data or optional references.