Abstract: A computer program product is provided as a session search system and associated method that provide a novel type of query referred to as “session query”. In the context of a session query, a user issues a search query using, for example, a web-based form. This query is processed immediately by the search engine, yielding search result elements that are returned within the new context of a “dynamic search result set”. As long as the user is reviewing the “dynamic search result set” of the session query, the search result is updated automatically in almost real-time, when new information arrives. When the user is no longer interested in continuing the search, the session query is terminated. The session search system generally includes two modules: A client module that presents the “dynamic search result set” to the user, and a server module that manages the current set of active session queries.

Abstract: A classifier for semi-structured documents and associated method dynamically and accurately classify documents with an implicit or explicit schema by taking advantage of the term-frequency and term distribution information inherent in the document. The system uses a structured vector model that allows like terms to be grouped together and dissimilar terms to be segregated based on their frequency and distribution within the sub-vectors of the structure vector, thus achieving context sensitivity. The final decision for assigning the class of a document is based on a mathematical comparison of the similarity of the terms in the structured vector to those of the various class models. The classifier of the present invention is capable of both learning and testing. In the learning phase the classifier develops models for classes with information it develops from the composite information gleaned from numerous training documents. Specifically, it develops a structured vector model for each training document.

Abstract: A schema discovery system and associated method discover a majority schema for a set of related and similarly marked up documents, such as HTML documents, based on the assumption that though the structure of these documents is mostly for visual purposes, the keywords used in the documents along with the structural tags provide some hints, and allow a rough sketch of the underlying intended schema. With the assumption that albeit the set of HTML documents are marked up differently due to diverse authoring skills, they are closely related in content, it is reasonable to find a schema that can unify these different schemas, which schema is shared by the majority of these HTML documents. The system employs constraint rules on tree ordering to reduce the computational complexity in arriving at optimized XML DTD schema. These generalized XML DTD schemas may be used to perform automated comparison and evaluation schemes of profile documents on the WWW.

Abstract: The ranking manager and associated method of the present invention rank the authority of XML documents and their corresponding schemas using an iterative process over a set of hyperlinked XML documents and their schemas. The ranking manager introduces the notion of authoritative schemas and document structure, and maintains an authority score for each document in the set, a hub score for each document in the set, and an authority score for each schema that is used by one or more documents in the set.

Abstract: A system and method that utilize a scheduling algorithm to reorder queued I/O commands in rotating disk drives. The reordering is implemented by selecting commands based on a probabilistic approach that minimizes the expected next command access time. Thus, the scheduling algorithm allows data to be accessed in the shortest possible expected time, and maximizes the throughput of the drive. The scheduling algorithm improves the I/O average access time by estimating the expected access time (EAT) for the queued commands, and by reordering these commands so that the command with the least expected access time (LEAT) is executed first. The scheduling algorithm weights the possible access times of commands stored in the scheduling queue, and accounts for the probability of executing a command during a first possible revolution or cycle, as well as the probability of executing the command in the second possible revolution.

Abstract: A system and method that reduce disk drive latency and thus improve the drive throughput. A command selection algorithm is introduced to augment an existing disk drive scheduling algorithm. The disk scheduling or command sorting algorithm sorts pending disk I/O commands into a disk scheduling queue according to the time necessary to reach the position on the disk indicated by the command. The command selection algorithm identifies and groups commands sorted in the disk scheduling queue according to the proximity of the commands. To improve the access time, a set of commands within a proximity threshold are executed in tandem. In this manner, an additional rotation of the disk is not required to access the second of the two command, thus reducing drive latency. Executing the commands in tandem further reduces time by reducing the number of iterations that the disk drive scheduling algorithm must be run.

Abstract: A soft error correction algebraic decoder and an associated method use erasure reliability numbers to derive error locations and values. More specifically, symbol reliability numbers from a maximum likelihood (ML) decoder as well as a parity check success/failure from inner modulation code symbols are combined by a Reed-Solomon decoder in an iterative manner, such that the ratio of erasures to errors is maximized. The soft error correction (ECC) algebraic decoder and associated method decode Reed Solomon codes using a binary code and detector side information. The Reed Solomon codes are optimally suited for use on erasure channels. A threshold adjustment algorithm qualifies candidate erasures based on a detector error filter output as well as modulation code constraint success/failure information, in particular parity check or failure as current modulation codes in disk drive applications use parity checks. This algorithm creates fixed erasure inputs to the Reed Solomon decoder.

Abstract: An automatic mining system that identifies a set of relevant terms from a large text database of unstructured information, such as the World Wide Web with a high degree of confidence. The automatic mining system includes a software program that enables the discovery of new relationships by association mining and refinement of co-occurrences, using automatic and iterative recognition of new binary relations through phrases that embody related pairs, by applying lexicographic and statistical techniques to classify the relations, and further by applying a minimal amount of domain knowledge of the relevance of the terms and relations. The automatic mining system includes a knowledge module and a statistics module. The knowledge module is comprised of a stemming unit, a synonym check unit, and a domain knowledge check unit. The stemming unit determines if the relation being analyzed shares a common root with a previously mined relation.

Abstract: A group notification system and associated method that allow particular activities to be executed based on the group dynamics, such as the dynamics of organizing meetings. The system facilitates the availability of knowledge concerning the proximity and direction of movement of individuals, objects, or groups, and whether this information satisfies preset criteria or rules. One such criterion is that the proximity distance of the group members be less than a predetermined threshold range. The threshold range can be adjustable or programmable.

Abstract: A method and apparatus for capturing annotations about database material in a way that allows queries with conditions or predicates on both the database material and the annotations. Database material may be text, computer programs, graphics, audio, spreadsheets, or any other material which may be stored and indexed. Database material may be in one or multiple sources, and annotations may be stored together with the original material or in a separate store. Annotations can be used to capture information such as additional facts about the database material, the opinions and judgments of experts about the database material, and/or links to other related material. Annotations may be captured in a structured form to enhance queryability and semantic interpretation.

Abstract: A computer program product is provided as an automatic mining system to build a generalization hierarchy of terms from a database of terms and associated meanings, using for example the Least General Generalization (LGG) model. The automatic mining system is comprised of a terms database, an augmentation module, a generalization detection module, and a hierarchy database. The terms database stores the terms and their meanings, and the hierarchy database stores the generalization hierarchy which is defined by a set of edges and nodes. The augmentation module updates the terms using the LGG model. The generalization detection module maps the generalizations derived by the augmentation module, updates the edges, and derives a generalization hierarchy. In operation, the automatic mining system begins with no predefined taxonomy of the concept terms, and the LGG model derives a generalization hierarchy, modeled as a Directed Acyclic Graph from the terms.

Abstract: A computer program product is provided as a system for use with a search engine and a search engine repository to dynamically associate keywords within a search result set encountered in an abstract of a search result item with a domain-specific query. In the system, a local query database stores the domain-specific query, and a synchronization unit synchronizes the search engine repository and the local query database. A query builder builds a search query from a query template using the search engine repository. A summary marker incorporates the search query with the keyword in the abstract of the search result item. A keyword detector generates a list of keywords included in a domain-specific dictionary. A search result calibration manager calibrates the number of the query result items. A search result item buffer receives a request for processing an abstract metadata item from the synchronization unit.

Abstract: An active, optical, piezoelectric actuated modulator allows switching between a reflecting state and an anti-reflecting state. The modulator, or switch, is based on the precise controlling of an air gap between a thin film membrane and a substrate. The thin film membrane is deformed by a miniaturized adaptive material, such as electrostrictive or piezoelectric (PZT) material. Maximum optical reflection is realized when the air gap is equal to a multiple of a quarter wavelength of an impinging optical beam, while anti-reflection is achieved when the thickness of the air gap is equal to zero or is different from a multiple of the quarter wavelength of the optical beam.

Abstract: A computer program product is provided as an automatic mining system to identify a set of related terms on the World Wide Web that define a relationship, using the duality concept. Specifically, the mining system iteratively refines pairs of terms that are related in a specific way, and the patterns of their occurrences in web pages. The automatic mining system runs in an iterative fashion for continuously and incrementally refining the relates and their corresponding patterns. In one embodiment, the automatic mining system identifies relations in terms of the patterns of their occurrences in the web pages. The automatic mining system includes a relation identifier that derives new relations, and a pattern identifier that derives new patterns. The newly derived relations and patterns are stored in a database, which begins initially with small seed sets of relations and patterns that are continuously and iteratively broadened by the automatic mining system.

Abstract: A new technique is described which provides realtime visual feedback to the user while scrolling in standard windowing environments. This visual scrolling technique makes use of a transient overlay which provides direct visual cues to the user about the new areas of the scrolled document that have been exposed to view by the scrolling action. After a predetermined period of time or as soon as the user stops scrolling, the overlay fades from view. This feedback can substantially enhance the user's ability to maintain spatial context while the document moves, reducing error and strain, and enhancing ease of use and productivity. The visual scrolling technique can be used for both one-dimensional scrolling such as in long galleys of text, and two-dimensional scrolling and zooming such as in maps and technical drawings. It is especially useful for small displays, such as in handheld devices.

Abstract: A system and associated method that allow particular requests to be executed at some point in the future without specifying the exact time or necessarily a precise location. The execution time of the request is linked to the arrival of a person or object at, or near a geographic destination location. When a person, an object, or a group of persons or objects, arrives at the destination location, or comes close to it, the request to interact will be executed. The proximity threshold can be adjustable or programmable.

Abstract: A head gimbal assembly includes a magneto-resistive read element integrated with a thermally assisted write element. The head gimbal assembly includes an optical waveguide positioned between two write poles to transmit a laser beam to a recording medium. The laser beam heats the medium sufficiently and lowers its coercivity in order to facilitate writing. A laser assembly is attached to a suspension for achieving direct coupling of the laser beam to an input end of the optical waveguide. The laser assembly is produced using cost effective wafer processing techniques. The use of silicon for the mounting block allows it to be used as a heat sink, for conducting heat away from the laser diode and into the suspension.

Abstract: A computer program product is provided as an automatic mining system to identify a set of related information on the World Wide Web using the duality concept. The mining system addresses iteratively refines mutually dependent approximations to their identifications. Specifically, the mining system iteratively refines (i) pairs of phrases related in a specific way; (ii) the patterns of their occurrences in web pages; and (iii) the formation rules. In one embodiment, the automatic mining system identifies (acronym, expansion) pairs in terms of the patterns of their occurrences in the web pages and their formation rules. The automatic mining system includes a formation rule identifier that derives the formation rules, an acronym-expansion pair identifier that derives the (acronym, expansion) pairs, and a pattern identifier that derives the patterns. The database stores the (acronym, expansion) pairs, patterns, and formation rules.

Abstract: A fixture for assembling and testing a read/write head comprised of a head gimbal assembly (HGA) that allows gimbaling along pitch and roll axes and that utilizes an inexpensive spherical gimbal ball pressed into an etched hole in the load beam for providing a highly accurate and measurable pivot location of a slider. The head gimbal assembly includes a suspension of the type supporting a slider, and comprising the suspension. A gimbal opening is formed in the load beam, and extends therethrough so that it receives the spherical gimbal ball for attachment to the load beam. A resilient flexure is secured to the load beam and supports the slider. The backside of the gimbal ball remains visible for the option of optical bonding of the slider to the suspension and for measurement of the slider position relative to the gimbal ball subsequent to the assembly of the HGA. The fixture is comprised of a top plate for holding the suspension assembly and a bottom plate for holding the slider.

Abstract: An optical focusing device for focusing an incident optical beam onto a focal plane, as a focal spot. The optical focusing device includes an incident central refractive facet upon which an optical beam impinges, and a high-index glass body through which the incident optical beam passes toward a bottom reflective surface. The bottom reflective surface reflects the optical beam through the body, toward a peripheral reflector. The peripheral reflector focuses the optical beam toward a focal plane on which the focal spot is formed. The focal plane is defined within a pedestal that forms part of the optical focusing device, and that extends from the bottom reflective surface. The central facet is conically shaped for refracting the incident optical beam away from the pedestal, onto the bottom reflective surface.