Abstract:
Data may be modeled as an undirected graph. A set of entities and a set of attributes may be defined. A set of relationships may be defined to represent semantic associations with each association connecting at least two entities. Attributes may be associated with entities rather than with relationships. A hierarchical query language with a set of atomic operations on modeled data may be employed. The modeled data may be displayed on a display unit.
Abstract:
A method for use with an aggregation operation (e.g., on a relational database table) includes a sorting pass and a merging pass. The sorting pass includes: (a) reading blocks of the table from a storage medium into a memory using an aggregation method until the memory is substantially full or until all the data have been read into the memory; (b) determining a number k of blocks to write back to the storage medium from the memory; (c) selecting k blocks from memory, sorting the k blocks, and then writing the k blocks back to the storage medium as a new sublist; and (d) repeating steps (a), (b), and (c) for any unprocessed tuples in the database table. The merging pass includes: merging all the sublists to form an aggregation result using a merge-sort algorithm.
Abstract:
Systems and methods for accessing data stored in a data array, mapping the data using a bitmap index, and processing data queries by determining positions of query attributes in the bitmap index and locating values corresponding to the positions in the data array are described herein.
Abstract:
An ultra wideband dual-frequency combiner includes a combination port (Port 1), a first port (Port 2), a second port (Port 3), two coaxial resonator band pass filters and two direct current channels. The first direct current channel is connected between the first port (Port 2) and the combination port (Port 1). The second direct current channel is connected between the second port (Port 3) and the combination port (Port 1). One end of the first coaxial resonator hand pass filters (610, 611) is electrically connected with the first port (Port 2) via a first blocking capacitor. One end of the second coaxial resonator hand pass filter (620, 621) is electrically connected with the second port (Port 3) via a second blocking capacitor. The other ends of the first coaxial resonator band pass filter and the second coaxial resonator band pass filter are connected with the combination port (Port 1) via a third blocking capacitor. The blocking capacitors are parameter distributed capacitors.
Abstract:
One embodiment is a computer-implemented method for classifying documents in a collection of documents according to their intended readerships. The method comprises using a computer to select a document in the collection of documents; and using a computer to determine a characteristic of the selected document, the characteristic being: misleading when the document includes one or more features that are determined to be for a purpose other than reading the document; commercial when the document includes features that are presented for a commercial purpose; or personal when the document includes features of a personal opinion. The method further includes using a computer to classify the selected document as misleading, commercial, or personal according to its determined characteristic; and using a computer to repeat the steps of select document, determine a characteristic of the selected document, and classify the selected document for additional documents in the collection. At least some documents are classified as misleading, at least some documents are classified as commercial, and at least some documents are classified as personal. Other methods and computer program products are also disclosed according to even more embodiments.
Abstract:
A method and system for efficiently answering a local neighborhood aggregation query over graph data. A graph which has a plurality of nodes is received and stored in memory. A local neighborhood aggregation query is received. A processing engine applies forward processing with differential index-based pruning, backward processing using partial distribution, or an enhanced backward processing that combines the backward processing and the forward processing. As a result of the forward, backward, or enhanced backward processing, nodes in the graph that have the top-k highest aggregate values over neighbors within h-hops of the nodes are determined. Identities of entities or persons associated with the determined nodes are presented and/or stored.
Abstract:
A system and method for safely managing a machine is provided. The present disclosure may conduct to determine the work condition of machine when a remote instruction is received via a mobile communication system. The received instruction may be carried out only if the machine is in a safe situation.
Abstract:
This document discloses, among other things, ictal source analysis and causal interaction estimation which considers the structure of seizures in the space, time, and frequency domains. The dynamic causal interaction can distinguish the primary source, which initiates the ictal activity, from the secondary source, which is generated due to the ictal activity propagation.
Abstract:
A method for use with an aggregation operation (e.g., on a relational database table) includes a sorting pass and a merging pass. The sorting pass includes: (a) reading blocks of the table from a storage medium into a memory using an aggregation method until the memory is substantially full or until all the data have been read into the memory; (b) determining a number k of blocks to write back to the storage medium from the memory; (c) selecting k blocks from memory, sorting the k blocks, and then writing the k blocks back to the storage medium as a new sublist; and (d) repeating steps (a), (b), and (c) for any unprocessed tuples in the database table. The merging pass includes: merging all the sublists to form an aggregation result using a merge-sort algorithm.
Abstract:
A method for use with an information (or data) warehouse comprises managing the information warehouse with instructions in a declarative language. The instructions specify information warehouse-level tasks to be done without specifying certain details of how the tasks are to be implemented, for example, using databases and text indexers. The details are hidden from the user and include, for example, in an information warehouse having a FACT table that joins two or more dimension tables, details of database level operations when structured data are being handled, including database command line utilities, database drivers, and structured query language (SQL) statements; and details of text-indexing engines when unstructured data are being handled. The information warehouse is managed in a dynamic way in which different tasks—such as data loading tasks and information warehouse construction tasks—may be interleaved (i.e., there is no particular order in which the different tasks must be completed).