Abstract: A system and method is provided for distributed relational databases for parallel sorting of a relation wherein the relation is a set of tuples to be sorted on multiple sort sites which completely decouples the return phase from the sort phase in order to eliminate the merge phase. The method involves selecting one coordinator site from any of the available logical sites, then generating and sorting a local sample on each of the available storage sites before sending the local random sample from each storage site to the designated coordinator site wherein the local random samples are merged to provide a single global sample. The coordinator site determines the global interval key values based on the global sample. The interval key values being determined such that each interval fits in a single sort site's main memory, wherein the tuples between two interval key values define the interval.

Abstract: Disclosed is a system and method for performing database queries including GROUP-BY operations, in which aggregate values for attributes are desired for distinct, partitioned subsets of tuples satisfying a query. A special case of the aggregation problem is addressed, employing a structure, called the data cube operator, which provides information useful for expediting execution of GROUP-BY operations in queries. Algorithms are provided for constructing the data cube by efficiently computing a collection of GROUP-BYs on the attributes of the relation. Decision support systems often require computation of multiple GROUP-BY operations on a given set of attributes, the GROUP-BYs being related in the sense that their attributes are subsets or supersets of each other. The invention extends hash-based and sort-based grouping methods with optimizations, including combining common operations across multiple GROUP-BYs and using pre-computed GROUP-BYs for computing other GROUP-BYs.

Abstract: A stochastic simulation method and system are provided. The invention eliminates the need for the use of subroutine calls in a user-written simulation program, and of option flags to direct execution via decision trees, by allowing the user to configure the simulator through choices of options at run-time. The options are presented via a user interface as radio buttons or checkboxes which the user activates. The simulator sets itself up to incorporate only those options. The programmer (that is, the author of software according to the invention) only makes the objects available and ensures that they work together. It is the user who actually configures the simulator. The invention provides a highly extendable structure. By use of inheritance and dynamic allocation of memory, and by design of self-contained objects to represent various components of the simulation system, a simulation program according to the invention incorporates new features and options with a minimum of new code.

Abstract: A parallel architecture of quantum logic gates and quantum communication channels is provided for a quantum computer, thereby achieving advantageous efficiency and computation speed. The architecture of the invention enables parallel memory operations on large quantum words, and permits the application, to the quantum case, of parallel algorithms for mathematical operations such as addition and multiplication. The invention also includes a novel apparatus for realizing parallel architecture using an array of miniature elliptical ion traps, with as many traps as there are bits in a quantum word. The ion trap array preferably uses an elliptical planar geometry, which can microfabricated by photolithography. Quantum information is transferred from one ion trap to another by either an optical coupling via a high finesse resonant cavity (photon coupling) or by electrostatic coupling of the ions' mechanical motion (phonon coupling).

Abstract: A method and means for flash charging a plurality of phosphorescent-coated, touch-sensitive keys using a planar, light-transmissive multicolor liquid crystal display (LCD) where the tripping event is the position of a lid of the notebook within a critical angle of the base.

Abstract: A computer program product, such as a floppy disk with pre-recorded software, is provided. The computer program product is for use with a computer or processing system which is to function as a node within a network. Synchronization of a local time maintained at the node with a reference time is facilitated through execution of the prerecorded software by the node. Bursts of synchronization messages containing reference time stamps are transmitted over the network, or over a communication link, according to a predetermined protocol. The node receives and time stamps the messages. Thus, times according to a first time scale and a second time scale are obtained. The protocol defines temporal relationships between certain ones of the times. In accordance with the protocol, the node determines a difference between a first time according to one of the time scales and a time related to second and third times according to the other time scale. The node then updates its local time based on the difference.

Abstract: An arrangement for enhancing the observability of a multicolored liquid crystal display in a computer of the notebook type using an arrangement in which the top lid of the laptop is mechanically separated into a diffuser/reflective surface and the LCD in its frame, the diffusing/reflecting lid is attached through a slider and linkage arrangement permitting the diffuser/reflector to act as a flat field illuminator and to move in a plane, apart from, yet forming a dihedral angle with the plane of the LCD. The lid so positioned can opportunistically reflect ambient light through the plane of the LCD. Also, by causing the lid to project over the plane of the LCD, it secures a contrast-maintaining shadow otherwise bleached by light incident to the LCD viewing surface.

Abstract: A method and computer system for converting triangular meshes to quadrilateral meshes in a computer system. The computer system comprises a processor and a means for inputting graphical data. The graphical data comprises a surface, the surface is defined by a boundary and comprises a triangular mesh. The method comprises the processor-executed steps of: (a) ascertaining the topological distance of the triangles on the triangular mesh to the boundary; (b) dividing the surface into layers of triangles, such that each layer comprises triangles within a range of topological distances; (c) within each layer, forming groups of triangles; and (d) dividing each group into at least three quadrilateral elements.

Abstract: A user-manipulable sensor apparatus is provided for allowing a user to input, through hand manipulation of a movable member, motion in six degrees of freedom: translational motion in the X, Y, and Z axes, and rotation about each of those three axes. The apparatus includes a central member which acts as a stationary reference, and a user-manipulable member, such as a spherical, hollow member which substantially surrounds the central member. Flexible wire or in-line strain gauges are coupled between the central member and the inside surface of the user-manipulable member, to hold the user-manipulable member in a quiescent position, relative to a position of the central member. Accordingly, there is no need for additional support members for holding the user-manipulable member in position. Manipulation of the user-manipulable member causes tension on various ones of the strain gauges. The strain gauges produce signals, from which the motion of the user-manipulable member may be computed.

Abstract: A system and method for simulating a mechanistic kinetic process, such as a chemical process including one or more chemical reactions, over a predetermined time period, subject to a programmed temperature variation, is provided. The simulation proceeds stochastically, by taking discrete time steps through the time period. The time steps vary in size, based on instantaneous reaction rate values for the reactions taking place. Reaction rates can vary by many orders of magnitude, and sometimes a stochastically calcualated time step will be so great that it might skip over a later increase in chemical activity. To avoid loss of accuracy and control of the simulation due to such excessively large time steps, when the stochastically determined time step exceeds a threshold, one or more smaller, deterministic time steps are made. The deterministic time steps "inch" forward in time, until an increase in chemical activity is detected. Then, stochastic time steps are resumed.

Abstract: A method and apparatus are disclosed for mining generalized sequential patterns from a large database of data sequences, taking into account user specified constraints on the time-gap between adjacent elements of the patterns, sliding time-window, and taxonomies over data items. The invention first identifies the items with at least a minimum support, i.e., those contained in more than a minimum number of data sequences. The items are used as a seed set to generate candidate sequences. Next, the support of the candidate sequences are counted. The invention then identifies those candidate sequences that are frequent, i.e., those with a support above the minimum support. The frequent candidate sequences are entered into the set of sequential patterns, and are used to generate the next group of candidate sequences.

Abstract: A cryptosystem and cryptographic method are provided for performing tasks such as encoding/decoding, signing messages, and verifying identity. The system and method employ a problem which is difficult to solve in the worst case. Because of the worst-case nature of the problem employed, a system and method according to the invention has advantageous level of security, In a class of preferred embodiments, the difficult problem is one of the recognized difficult problems associated with the mathematical theory of lattices. These problems include finding short vectors and sets of basis vectors from a lattice. Cryptographic protocols are performed, using these problems.

Abstract: A World Wide Web terminal appliance utilizes a disk drive for local storage of Web pages previously downloaded and rendered for display during the course of a Web surfing session. The disk drive rotates at a rate substantially in synchronization with a display refresh time interval of a display device, preferably a raster refresh cycle time of a video monitor. Therefore, the image being displayed need not occupy random-access memory, but rather is sent directly from the disk to a display interface for coupling to the display device. Little or no RAM buffering is required, so the appliance need not include a large quantity of video RAM storage. A relatively inexpensive disk is used instead, thereby bringing about advantageous cost savings.

Abstract: A system and method are provided for use with an communication and information network, such at the Internet World Wide Web, for assisting a user in accessing information stored at remote network sites based on the user's past history of network usage. An archive is maintained of remote sites accessed and instances in which the same remote sites are accessed in sequence. Statistics regarding information such as the number of time a site has been accessed, and the times a given set of sites have been accessed in sequence, are maintained. This information may be displayed upon command. Based on this information, information items are identified which the user is predicted to be likely to want to access. This information is pre-downloaded, without express user command, so that if the user does enter a command, the response time is advantageously fast.

Abstract: A modulator apparatus for modulating arrays of input data V.sub.in to be stored in a holographic recording medium is disclosed wherein the final output data array V.sub.out has frequent transitions from light to dark and from dark to light in either dimension across the data page and has the total amount of illuminated regions throughout the entire data page held constant. These two constraints are achieved by a first set of control arrays obtained from two fixed sets of m.times.n binary arrays {A.sub.0, A.sub.1, . . . , A.sub.n } and {B.sub.0, B.sub.1, . . . , B.sub.m } which in turn are obtained from fixed sets of binary control vectors {a.sub.0, a.sub.1, . . . , a.sub.n }, {b.sub.0, b.sub.1, . . . , b.sub.m }, respectively. The control vectors a.sub.0, a.sub.1, . . . , a.sub.n are any n+1 fixed elements of the inverse mapping, .phi..sup.-1 (C.sub.1), of the (t-2) error-correcting code C.sub.1 of length m. The control vectors b.sub.0, b.sub.1, . . . , b.sub.

Abstract: A method and apparatus are disclosed for managing tasks in a network of processors. After a period of time has elapsed, during which the processors of the network have been executing tasks allocated to them, the processors exchange views as to which pending tasks have or have not been completed. The processors reach a consensus as to the overall state of completion of the pending tasks. In a preferred embodiment, the processors exchange views and update their views based on the views received from the other processors. A predetermined condition determines that a consensus has been reached. The predetermined condition is preferably two sets of exchanges in which a processor has received messages from the same set of other processors. Alternatively, the condition is an exchange which does not result in any updates to a processor's view.

Abstract: A method and apparatus are disclosed for mining quantitative association rules from a relational table of records. The method comprises the steps of: partitioning the values of selected quantitative attributes into intervals, combining adjacent attribute values and intervals into ranges, generating candidate itemsets, determining frequent itemsets, and outputting an association rule when the support for a frequent itemset bears a predetermined relationship to the support for a subset of the frequent itemset. Preferably, the partitioning step includes determining whether to partition and the number of partitions based on a partial incompleteness measure. The candidate generation includes discarding those itemsets not meeting a user-specified interest level and those having a subset which is not a frequent itemset. The frequent itemsets are determined using super-candidates that include information of the candidate itemsets.

Abstract: A folding keyboard is described having keyboard sections, each bearing a subset of keys of the keyboard, and a slider mounted to one of the keyboard sections bearing a row of keys of the keyboard section, the slider movable between a first position withdrawn into the keyboard section behind a pivot axis so as to facilitate folding of the keyboard into a closed position, and a second position, corresponding with an open position of the keyboard, extended beyond the pivot axis to nest with a corresponding notch in the other keyboard section, so that the subset of keys of the slider are in a configuration for use when in the nested position. A key of each of the keyboard sections positioned at the abutting edges thereof are narrowed, from the standard width of other of said keys, along the edge thereof adjoining the abutting edges, so that the abutting edges are straight edges when the slider is in the withdrawn position, allowing a straight edge at the folding side of the keyboard.

Abstract: Methods and related apparatus, for use in programming language systems, are set forth which support compile-time type checking for overloaded functions in an environment supporting subtypes with multiple inheritance. At both compile and runtime, the invention considers the type of all actual arguments of a function to select a proper function instance to execute. Furthermore, the methods contemplated by the invention identify at compile time the set of function instances which might be invoked due to subtype substitutions for the actual arguments. Since type errors on function invocations or variable assignments are usually indicative of a programming error, program reliability can be improved and faults that would otherwise result in runtime errors can be corrected through the use of the invention prior to program deployment.

Abstract: Programming language systems commonly allow for the use of function calls within a body of program source code. Since function names are generally descriptive, it is sometimes the case that two different functions ("function instances") will have the same name, and be distinguishable by having either a different number of arguments ("arity"), or arguments of different types. Both at compile time and at run time, the possibility of error exists if there is a mismatch between the arguments required by a function and the arguments provided to the function by the function call. Methods and related apparatus, for use in programming language systems, are set forth which support compile-time type checking and run-time dispatch for overloaded functions in an environment supporting subtypes with multiple inheritance.