Abstract: A content-based image retrieval system retrieves an image based on an angular radial transform (ART) image descriptor. In the content-based image retrieval system, a method for retrieving an image includes the steps of: a) receiving a query image; b) extracting a query image descriptor from the query image based on at least an angular component and a radial component of the query image; c) comparing the query image descriptor with an image descriptor stored on the database; and d) determining a degree of a similarity between the query image descriptor and the image descriptor stored on the database.

Abstract: A method and system for creating improved search queries using pre-arranged controlled vocabularies, word groups, and word types. The invention is called a search builder. The search builder is a server-based program, which houses numerous individual topic oriented search builder modules. Each module is focused on a special topic of interest. Each search builder module leads users through a series of word groups, where a user may select words to be added to a query, which will ultimately be sent to a search engine or searchable database.

Abstract: The present invention is a system and method that facilitates consistency maintenance and recovery from a system or process crash with valid data. A data consistency maintenance and recovery system and method of the present invention utilizes a dual page configuration and locking process to store and track data associated with multiple indexes of a database. A primary page is utilized as the primary data storage location and a mirror page operates as copy of the primary page except during certain stages of data manipulation (e.g., a write operation). Read operations access information from unlocked primary pages. Write operations access, lock and update a mirror page, then access, lock and update a primary page. Page accesses are tracked (e.g., counted). Then a write process unlocks and syncs the primary page to disk as well as the mirror page. A page with consistent data is copied to a page with inconsistent data during a process system crash recovery.

Abstract: Query results and statistics regarding them are generated using a novel representation of an n-attribute relation as an order n relational tensor. Orders of the relational tensor respectively correspond to each of the attributes, and each coordinate along an order relates to a key value of the corresponding attribute. Numeric values are stored in the relational tensor, each numeric value representing a count of tuples having the attribute key values that correspond to the coordinate of the numeric value along the orders of the relational tensor. This storage representation is useful in a variety of contexts for enhancing the performance of a RDBMS system. Specifically, a data-representing relational tensor can be used to produce results for operations such as SQL restriction operations using IN and EXISTS criteria.

Abstract: A system and method for efficiently processing messages stored in multiple message stores is described. Metadata identifying a range of topically identical messages extracted from a plurality of message stores storing a multiplicity of messages to be processed is iteratively copied. The metadata for the extracted range of topically identical messages is categorized. Those messages containing substantially duplicative content within the extracted range are identified as duplicate messages. Those non-duplicate messages within the extracted range are tallied into an ordering of conversation thread length. Those messages whose content is recursively-included content within another of the tallied non-duplicate messages are classified as near-duplicate messages. The remaining messages are designated as unique messages containing substantially non-duplicative content.

Abstract: A parallel spatial join index is used for efficient join operations involving spatial data, including polygon data. The join operations between spatial data from two different tables are performed in parallel in a multi-processor environment. Join indices are created, based upon spatial object attributes from the two tables. Auxiliary relations are constructed from the two tables as well, and further include data for avoiding duplicate join results. R-trees index the auxiliary relations and B-trees index the join indices.

Abstract: A system and method for providing a multi-tiered hierarchical transient message store accessed using multiply hashed unique filenames is described. A hierarchical message store is maintained. The hierarchical message store is logically structured with a plurality of storage nodes. Each storage node is dependently linked to one of a plurality of index nodes. Each index node is dependently linked to a root node. An incoming message is intercepted at a network domain boundary and assigning a unique filename. An index hash of the unique filename, corresponding to one such index node, and a storage hash of the unique filename, corresponding to one such storage node, are generated. The message is stored in the hierarchical message store at the one such index node and the one such storage node.

Abstract: A method, system and process for a computer-assisted staffing of employees for a client. The system collects and stores, in a relational database, a large amount of information relating to the staffing of client's projects, including employee data, firm data, and order data. For example, the system stores timesheets for the employees corresponding to the clients to which they are assigned; feedback on the employees' performances is obtained and stored; and a large amount of other information. The information can be used by clients to manage and analyze personnel functions, to manage and analyze financial functions, to select from a roster of candidate employees, and to make future projections. Additionally, the information can be used by employees to track their performance, and personnel functions such as accrued vacation. The system actively seeks information to ensure accuracy of the stored data. The database is web-enabled and is accessible via the internet.

Abstract: A preference learning apparatus includes a content attribute information database, action information database, time information correlation table, area information correlation table, user's preference information database, user action detection section, and preference information management section. The preference information management section generates preference analysis data using time zone information, area name, attribute and its weight, and attribute value related to a user's preference and updates the weight contained in preference information in the user's preference information database, which is specified by time zone information, area name, attribute/attribute value, and user ID, with the weight contained in the generated preference analysis data. A preference learning system, preference learning method, and recording medium are also disclosed.

Abstract: Media clips on a hard drive or other storage are automatically organized in collections and metadata automatically assigned to facilitate subsequent searching for media clips. A Clip Organizer software application initially scans a user's hard drive to identify folders containing user files of sound, picture, clip art, video and other media clips. Predefined types of folders are omitted in the scan to avoid identifying media clips that do not belong to the user or are part of another application program. A partially “flattened” collection hierarchy is created to simplify browsing the media clips. Sufficient empty files are included to enable a user to readily locate the collections, and metadata comprising keywords derived from the path of each media clip are associated with each of the media clips to facilitate subsequent searching for the files. In addition, the collection hierarchy is automatically updated as changes are made.

Abstract: A plurality of actions are applied to a directed graph, where the directed graph has a plurality of nodes. A node in the directed graph is traversed to, and an specific method for each of the plurality of actions is performed on the traversed-node. The traversing and performing are repeated until all nodes in the directed graph have been traversed to. Only a single traversal of the directed graph need be performed to apply all of the actions to the directed graph. The plurality of the actions are in the form of a chain. Each action has an action object pointer, and the actions include a base action at a tail end of the chain and at least one chain action at a head end of the chain. The action object pointer of each chain action points to an immediately adjacent action toward the tail end of the chain, and the action object pointer of the base action points to the chain action at the head end of the chain.

Abstract: A dimensionality reduction method of generating a reduced dimension matrix data set Dnew of dimension m×k from an original matrix data set D of dimension m×k wherein n>k. The method selects a subset of k columns from a set of n columns in the original data set D where the m rows correspond to observations Ri where i=1, . . . , m and the n columns correspond to attributes Aj where j=1, . . . , n and dij is the data value associated with observation Ri and attribute Aj. The data values in the reduced data set Dnew for each of the selected k attributes is identical to the data values of the corresponding attributes in the original data set.

Abstract: A method and system for providing and dynamically managing the size of a storage space containing data structures depending on a current network load. The present invention expands the size of a storage space when the amount of data therein is large, thereby reducing the time spent searching for values within the data structure. When the amount of data within the storage space is small, the present invention contracts the size of the storage space to reduce the memory needed to maintain the storage space. In this manner, the present invention dynamically adjusts the size of the storage space in response to changing network loads to ensure that network performance remains optimized.

Abstract: An apparatus and a method of processing queries to a relational database stored on a computer readable medium including a representation of relations between sections in tables in the database. The method includes identifying tables which contain a specified type of data, generating a plurality of queries (e.g., SQL queries) by selecting at least some primary tables from the identified tables, selecting a set of tables, each table in the set being related to a primary table via N relations, and repeating this, N being varied for each repetition, until the set of tables contains the specified data, and selecting an optimal one of the generated queries.

Abstract: Disclosed is a system, method, and apparatus for calculating metrics by using hierarchical level metadata to describe the various structures within the database. The hierarchical level metadata permit calculation of complex metrics by an analytical server which would otherwise be difficult or impossible. As a result of the way that the analytical server calculates the metrics, slicing and drilling are supported. Additionally, dimension and fact level security are also supported.

Abstract: A facility is provided for distributing events to consumers in a content-based publish-subscribe system, wherein the consumers each have at least one subscription. The facility includes deriving a set of g approximate multicast groups from a larger set of G possible multicast groups in the publish-subscribe system. The deriving includes exploiting knowledge of subscription predicates of the consumers of the publish-subscribe system. The set of G possible multicast groups is collapsed to the smaller set of g approximate multicast groups, while minimizing the expected performance penalty in using the approximate multicast groups. The set of g approximate multicast groups is then used to forward events to consumers within the publish-subscribe system.

Abstract: A document file administrative system includes a plurality of client computers each accessible by a user, a server computer containing document files each having an attribute relating to a node constituting a tree for hierarchically classifying the document files in a project, a network connecting the plurality of client computers with the server computer to thereby enable a user to search out a document file by a given attribute. A user is allowed to duplicate a selected document file by user's request. The server computer has a closed database for containing data which only registered users are authorized to access to, and an opened database for containing data which any user is authorized to access.

Abstract: A computing system and method explores a knowledge repository by accepting a natural language query from a user, determining a distance between the query and every category in every partitioning of the knowledge repository, and displaying a radial graph (322) of the nearest categories. Further, in response to a user selecting a category, visually displaying matching elements in the category along with its nearest neighbor categories in a scatter plot (324).

Abstract: An advanced bookmark database system provides query, re-organization, information sharing, view, and access control capabilities to manage bookmarks. In one embodiment of the bookmark database system of the present invention, HTML document parsing, keyword extraction, and HTML/VRML document generation capabilities are provided, in addition to allowing comprehensive database query and navigation. The bookmark database system extracts document content semantics, intra-document structures, inter-document linkage, and useful metadata for users to allow query and organization based on various attributes, such as keywords, domains, and last visit times. Further, an access control capability allows sharing of bookmark databases among users. Multiple physical or logical bookmark databases can be merged to create new bookmark databases. Multiple bookmark databases can be organized as a hierarchical structure, to allowing grouping by individuals, projects, groups, departments, etc.

Abstract: A DICOM-to-XML conversion system is provided that converts the DICOM SR standard into a set of XML DTDs and Schemas. By providing a mapping between the DICOM SR standard and XML DTDs and Schemas, DICOM specific XML-based applications can be developed, via a larger field of XML-fluent application developers. Additionally, by providing standard XML DTDs and Schemas for containing DICOM data, other commonly available non-DICOM-related applications, such as accounting and mailing programs, can be structured to use information as required from DICOM reports that are converted to conform to these defined XML DTDs and Schemas. In a preferred embodiment, a two-phase conversion is employed. The DICOM SR specification is parsed and converted directly into a set of “raw” XML documents. Thereafter, the “raw” XML documents are transformed into the corresponding XML DTDs and Schemas, via an XSLT processor.