Abstract: Under the present invention, a review standard for reviewing a message is first configured. The review standard can be based on a stored resource containing review parameters, manually designated review parameters, or both. When a message is created or edited, the message is reviewed based on the review standards and corresponding notifications can be communicated. Any errors that are detected are presented to provide an opportunity for correction. The system also allows messages to be deleted and corresponding notifications to be communicated.

Abstract: A document classification system updates the logistic regression parameters of the logistic regression algorithm used to classify the documents, using a coherent gradient method based upon the coherency between the update data regarding the classifications of the documents and the combined data including both the update data and the original data used to generate the original logistic regression parameters. The classification system can be applied to an email filtering system for filtering spam email.

Abstract: The present invention provides a system and method for building fast and efficient support vector classifiers for large data classification problems which is useful for classifying pages from the World Wide Web and other problems with sparse matrices and large numbers of documents. The method takes advantage of the least squares nature of such problems, employs exact line search in its iterative process and makes use of a conjugate gradient method appropriate to the problem.

Abstract: A file system (i) permits storage capacity to be added easily, (ii) can be expanded beyond a given unit, (iii) is easy to administer and manage, (iv) permits data sharing, and (v) is able to perform effectively with very large storage capacity and client loads. State information from a newly added unit is communicated (e.g., automatically and transparently) to central administration and management operations. Configuration and control information from such operations is communicated (e.g., automatically) back down to the newly added units, as well as existing units. In this way, a file system can span both local storage devices (like disk drives) and networked computational devices transparently to clients. Such state and configuration and control information can include globally managed segments as the building blocks of the file system, and a fixed mapping of globally unique file identifiers (e.g., Inode numbers) and/or ranges thereof, to such segments.

Abstract: A data structure, added to a modified form of the Blink-tree data structure, tracks delete states for nodes. The index delete state (DX) indicates whether it is safe to directly access an index node without re-traversing the B-tree. The DX state is maintained globally, outside of the tree structure. The data delete state (DD) indicates whether it is safe to post an index term for a new leaf node. A DD state is maintained in each level 1 node for its leaf nodes. Delete states indicate whether a specific node has not been deleted, or whether it may have been deleted. Delete states are used to remove the necessity for atomic node splits and chains of latches for deletes, while not requiring retraversal. This property of not requiring a retraversal is exploited to simplify the tree modification operations.

Abstract: A method of searching a document having nested-structure document-specific markup (such as Extensible Markup Language (XML)) involves 112 receiving a query that designates at least (A) a phrase to be matched in a phrase matching process, and (B) a selective designation of at least a tag or annotation that is to be ignored during the phrase matching process. The method further involves 114 deriving query-specific indices based on query-independent indices that were created specific to each document, and 116 carrying out the phrase matching process using the query-specific indices on the document having the nested-structure document-specific markup.

Abstract: “Determining Validity Ranges of Query Plans Based on Suboptimality” A method for approximating a validity range for a domain of cardinalities of input to an optimal query plan is provided. Such a validity range is iteratively approximated using a modified Newton-Raphson method to find roots of cost functions for optimal and alternative query plans, respectively. The Newton-Raphson method is combined with a method of incrementing roots of cost functions, known as input cardinalities, such that discontinuous and non-differentiable points in cost functions are avoided. In this manner, input cardinalities remain within a domain for which a valid range can be specified. Additionally, a robustness measure is determined by a sensitivity analysis performed on an approximated validity range.

Abstract: A parallel detail join system for processing a many-to-one-to-many relationship is provided. The system comprises a parallel detail analysis module for detecting a many-to-one-to-many relationship among elements, and a parallel detail transformation module for generating a SQL: 1999 statement to handle the many-to-one-to-many relationship.

Abstract: A method and device for recording sequence information on biological compounds such as nucleotides and amino acids in as small amounts of data as possible are provided. The text data representing the sequence of a series of nucleotides constituting the DNA of the standard sample E is converted into binary data using a conversion table, and the binary data is divided into plural m-bit partial data (A(i,j)) arranged in plural columns and rows (m?16). Then a first set of parities (B1(i)˜B3(i)) are computed by applying an operation of Galois field GF(2m) to the partial data (A(i,j)) of each column and a second set of parities (C1(j)˜C3(j)) are computed by applying an operation of Galois field GF(2m) to the partial data (A(i,j)) of each row. The sequence of the nucleotides is represented approximately by the parity information.

Abstract: A system includes a vocabulary information processing mechanism for loading an ontology corresponding to a selected service and analyzing the loaded ontology to extract a conceptual structure, an inference processing mechanism for executing an inference operation based on an axiom rule and extending/parsing vocabulary information extracted by the vocabulary information processing mechanism, a conceptual information display section for displaying the extracted conceptual structure on a browser of a user terminal via the Internet, a property information display section for displaying on the browser property information relative to a concept selected from the displayed conceptual structure, a relational information display section for displaying, when a plurality of concepts are selected, relationships between the concepts on the browser, and a search request transmitting section 34 for transmitting a prescribed search request to a search system based on a search request made from the browser.

Abstract: A system and method for conducting distributed transactions wherein a connect JDBC™ driver for a Microsoft™ SQL Server implements Java™ JTA distributed transactions. To conduct the JTA distributed transactions, JTA specific interfaces are engineered in the driver. The JDBC™ driver is a wire protocol driver in direct TCP communication with the SQL server. During communication, the JDBC™ driver sends packets of information back and forth to and from the database server. These packets may request information form the server, or instruct the server to perform a function, such as executing a stored procedure.

Abstract: A mechanism for replicating and maintaining files in a space-efficient manner is disclosed. In one embodiment, a current file is replicated by associating the data blocks of the current file with both the current file and a new file. The new file and the current files are separate and distinct from each other. Data blocks remain shared until the content of one file is modified. Only the data blocks affected by the modification are duplicated. The two files share the unchanged data blocks, but both files are each associated with additional data blocks that reflect the modification. Reference values are used to track how many files are associated with each data block. In another embodiment, a file descriptor is linked to a filename at the request of a user or application. The present invention avoids needless duplication of the same data blocks among copies of a file.

Abstract: The performance of an application is improved by identifying and eliminating items with dead time-stamps and eliminating work on items with irrelevant time-stamps. An algorithm executing in each node of a task graph computes and propagates guarantees which are used to eliminate both items with dead time-stamps and irrelevant computation on dead time-stamps. A continuous garbage collector eliminates items with dead time-stamps while the node continues to process received items. Unnecessary computations are reduced by automatically discerning the interest set of downstream modules for time-stamps and feeding the interest set back to upstream modules.

Abstract: A system and method is disclosed for selectively synchronizing, with a media library, media files within folders of a filing system. This system and method can preferentially synchronize certain folders rather than others based on whether or not the folders have been modified. This system and method can also maintain synchronization between a media library and a filing system by regularly checking for changes in the filing system.