Abstract:
A method of analyzing physiological data streams. According to the method, physiological data is received into a computerized machine. The physiological data comprises numerical data and medical symptoms of a patient. Features are extracted from the physiological data based on development of the physiological data over a period of time. The features are converted into a textual representation using natural language generation. Input terms for an information retrieval system operating on the computerized machine are automatically generated based on the features. The input terms are input to the information retrieval system. A corpus of data is automatically searched to retrieve results to the input terms using the information retrieval system.
Abstract:
A “Name Disambiguator” provides various techniques for implementing an interactive framework for resolving or disambiguating entity names (associated with objects such as publications) for entity searches where two or more same or similar names may refer to different entities. More specifically, the Name Disambiguator uses a combination of user input and automatic models to address the disambiguation problem. In various embodiments, the Name Disambiguator uses a two part process, including: 1) a global SVM trained from large sets of documents or objects in a simulated interactive mode, and 2) further personalization of local SVM models (associated with individual names or groups of names such as, for example, a group of coauthors) derived from the global SVM model. The result of this process is that large sets of documents or objects are rapidly and accurately condensed or clustered into ordered sets by that are organized by entity names.
Abstract:
There are provided methods, computer program products, and systems for indexing a data stream. A method for indexing a data stream having attribute values includes the steps of parsing the data stream, and forming an index of tuples for a subset of attribute values of the data stream. The index is configured for retrieving the top-K tuples that optimize linearly weighted sums of at least some of the attribute values in the subset.
Abstract:
There are provided a method, a computer program product, and a system for maintaining a materialized view defined on a relation of a relational database. The method includes the step of performing content-based filtering on the relation to identify an update to the relation as being irrelevant with respect to the materialized view.
Abstract:
There are provided methods, computer program products, and systems for indexing a data stream. A method for indexing a data stream having attribute values includes the steps of parsing the data stream, and forming an index of tuples for a subset of attribute values of the data stream. The index is configured for retrieving the top-K tuples that optimize linearly weighted sums of at least some of the attribute values in the subset.
Abstract:
Systems and methods are provided for resource adaptive workload management. In a method thereof, at least one execution objective is received for at least one of a plurality of queries under execution. A progress status of, and an amount of resource consumed by, each of the plurality of queries are monitored. A remaining resource requirement for each of the plurality of queries is estimated, based on the progress status of, and the amount of resource consumed by, each of the plurality of queries. Resource allocation is adjusted based on the at least one execution objective and the estimates of the remaining resource requirements.
Abstract:
A method and apparatus is provided in a parallel database system having a plurality of nodes for computing a moving aggregate of an attribute of a relation having multiple tuples. Portions of the relation are distributed across the plurality of nodes of the database system. For each node i, the database system identifies one or more other nodes that contain tuples of the relation which are covered by a moving window of each tuple of the relation at node i. For each such identified node, a value representing an aggregate of the tuples at each such identified node is communicated to node i. The moving aggregate is then calculated using at least tuples of the relation at node i as well as the value from each of the identified one or more nodes.
Abstract:
Data network signals, methods and devices that are suitable for multiplexing payload data in a packet switched data network are disclosed. Payload associated with multiple packets is multiplexed into a single multiplexed packet. Each payload portion is identified by a mini-header within the multiplexed packet. Mapping information may also be transferred as part of such multiplexed packets which include multiplexed payload data. Preferably, the mapping information is used to form mapping tables within routers at edges of access networks. The mapping tables may be used to establish a relationship between mini-headers and full headers. The mapping tables may be used to multiplex data from packets to form a multiplexed packet at an ingress router, and demultiplex the multiplexed packet at an egress router. Conveniently, neither gateways nor out of band signalling are required.
Abstract:
A non-blocking parallel spatial join algorithm generates the spatial join result tuples continuously even in the event of memory overflow. The algorithm employs duplicate avoidance techniques to avoid the blocking and time-consuming removal of duplicates. The algorithm also uses parallelism to improve performance.
Abstract:
The present invention relates to methods for depleting endotoxin from biological solutions by exposure of solutions containing endotoxin to an immobilized metal affinity chromatography matrix composed of a metal ion such as iron (III) bounds to a resin, wherein the metal is capable of selectively binding endotoxin in the solution. These methods are useful for purifying, for example, biological products prepared using bacterial cells, or products in which bacterial contamination is problematic. In another embodiment, endotoxin in circulation in a body can be removed by exposing the blood to the aforementioned matrix, whereby endotoxin is removed before the blood is returned to the body.