Abstract: A method (and system) for uniquely identifying one of a plurality of replicas of data, includes creating a second replica from a first replica, and computing a replica identifier of a bounded length for a second replica by applying a uniform transformation to a replica identifier of the first replica, without central coordination of identifier generation. In a preferred embodiment, the uniform transformation has an inverse, which can be applied to the identifier of the second replica to recover the identifier of the first replica. The second replica is created when its replica identifier is calculated to be an integer in a predetermined range.

Abstract: A wearable mobile computing device/appliance (e.g., a wrist watch) with a high resolution display that is capable of wirelessly accessing information from the network and a variety of other devices. The mobile computing device/appliance includes a user interface that includes software mechanisms for enabling watchface orientation in either of: circular and elliptical modes, and further to enable the further display of textual content in remaining portions of the display when in either circular and elliptical mode.

Abstract: An apparatus for keeping several versions of a file includes a memory and an overwriting unit coupled to the memory. An initial version of the file is stored in a first area of the memory, and a current version is stored in a second area of the memory, the current version resulting from a modification of the initial version. The overwriting unit substitutes the current version for the initial version in response to a validation signal. The validation signal is produced after the current version has been permanently stored.

Abstract: The present invention is directed to a method for dynamically changing objects to be cached in accordance with the processes performed. More particularly, the method for selecting objects to be cached in a data structure of classes of objects hierarchically arranged in a plurality of levels (L1, L2, L3, . . . ) comprises the steps of: in response to that a first object (a) of a first class at a specific level (L2) refers to a second object (b) of a second class at a different level (L3), detecting classes belonging to the different level (L3); and specifying, as objects to be cached, objects (b, c, d and e) at the different level (L3) that have not yet been cached and that can be traced, starting at the first object (a) of the first class.

Abstract: A cache memory shared among a plurality of separate, disjoint entities each having a disjoint address space, includes a cache segregator for dynamically segregating a storage space allocated to each entity of the entities such that no interference occurs with respective ones of the entities. A multiprocessor system including the cache memory, a method and a signal bearing medium for storing a program embodying the method also are provided.

Abstract: A wearable mobile computing device/appliance (a wrist watch) with a high resolution display that is capable of wirelessly accessing information from a network and a variety of other devices. The mobile computing device/appliance includes a user interface that is used to efficiently interact with alarms and notifications on the watch.

Abstract: A single-domain, two-domain or four-domain homeotropic- or tilted homeotropic-alignment liquid crystal display device of either the transmissive-type or reflective-type having a high contrast ratio, a good display quality, and a high photo-stability (and a method of producing the same), includes a homeotropic- or tilted homeotropic-alignment layer which includes an oxide layer prepared by a single oblique evaporation of an activated oxide source. The angle between the evaporation direction and the substrate plane forms an angle from about ±20° to about ±90°, and the thickness of the oxide layer is from about 10 nm to about 200 nm. A method of homeotropic-alignment or tilted homeotropic-alignment of liquid crystals by a single oblique evaporation process is also provided.

Abstract: The traditional association rule problem is extended by allowing a weight to be associate with each item in a transaction to reflect interest/intensity of each item within the transaction. The weighted association rules from a set of tuple lists are discovered, where each tuple consists of an item and an associated weight and each tuple list consists multiple tuples. The weighted association rules (WARs) are generated where some subset of items forms the consequent part of the rule (i.e., right hand side of the rule) and some other (non-overlapped) subset of items from the antecedent part of the rule (i.e., left hand side of the rule).

Abstract: The invention suggests means for defining a portion of the system-repository of a Workflow-Management-System (WFMS) or a system with comparable functionality to be maintained in a parallel database by a Database-Management-System (DBMS). The WFMS comprises at least one process-model. Moreover, it is suggested that the definition-means for defining, which portions of the system repository is being stored in the parallel database, is comprised in said WFMS's configuration specifications as for instance in said process-model.

Abstract: A system and method for developing association rules which are personalized for a customer. The method includes partitioning (clustering) a set of records corresponding to transactions of items into discrete segments so that different parts of the data show different kinds of trends. The clustering is used in order to create a segmentation of the data such that these trends are captured in each segment. Consequently, a different set of association rules are relevant for each segment. For a given customer, the segment to which he/she belongs most closely may be readily determined, and the trends in that segment may be used for generating the association rules.

Abstract: A system and method for generating itemset associations in a memory storage system comprising many transactions, with each transaction including one or more items capable of forming the itemset associations. The method involves generating a lexicographic tree structure having nodes representing itemset associations meeting a minimum support criteria. In a recursive manner, for each lexicographic least itemset (node) P of the lexicographic tree structure, candidate extensions of the node P are first determined. Then, the support of each of the candidate extensions is counted to determine frequent extension itemsets of that node P, while those itemsets not meeting a predetermined support criteria are eliminated. Child nodes corresponding to the frequent extensions and meeting the predetermined support criteria are created. For each frequent child of node P, all itemset associations for all descendants of node P are generated first. Thus, the lexicographic tree structure is generated in a depth first manner.

Abstract: A system and method for balancing a load among a web server farm includes two components: 1) a static component that functions to create the logical assignment of web sites to servers; and, 2) a dynamic component that performs real-time web site customer scheduling. The static component consists of two stages. First, based on web site demand forecasts, an optimization technique is employed for solving an apportionment problem to determine the optimal number of copies per web site. Second, a method is implemented which makes good quality logical assignments of these optimal number of web site copies to servers and may be run either in initial or incremental mode. The incremental mode is preferably run periodically, e.g., once per week or once per month, however, one could also run this mode when the cluster farm configuration changes, for example when new servers are added to the system.

Abstract: The present invention is directed to a method for dynamically changing objects to be cached in accordance with the processes performed. More particularly, the method for selecting objects to be cached in a data structure of classes of objects hierarchically arranged in a plurality of levels (L1, L2, L3, . . . ) comprises the steps of: in response to that a first object (a) of a first class at a specific level (L2) refers to a second object (b) of a second class at a different level (L3), detecting classes belonging to the different level (L3); and specifying, as objects to be cached, objects (b, c, d and e) at the different level (L3) that have not yet been cached and that can be traced, starting at the first object (a) of the first class.

Abstract: An improved plug and cable combination for connecting information appliances to an information socket and to a power socket, comprising a power conductor for transferring power from the power socket to the information appliance. The power conductor having a power plug at a first end, the power plug adapted to connect to the power socket. An information conductor for transferring information from the information socket to the information appliance. The information conductor having an information plug at a first end, the information plug adapted to connect to the information socket. A second end of the power conductor and a second end of the information conductor terminate at the information appliance. The information plug and the power plug having a plug joining means disposed thereon, wherein the plug joining means being capable to integrate the information plug and the power plug into an integrated plug.

Abstract: The present invention provides a browser which utilizes a Web access controller to limit access to pre-selected web sites. Such a browser is suitable for use in education, for example, where the intent is to keep students focused on a particular subject by restricting their access to predetermined relevant sites. The browser also has a “depth” parameter, whereby users are enabled to browse from those web sites on the select list to unlisted sites which are within the depth parameter away from the listed sites. This provides the users with the surfing capabilities inherent in the web. The Web access controller provides for a safer environment for children to browse through the Internet and a worry-free tool for parents.

Abstract: An image stabilizing apparatus and method for a display device having a display screen, include a sensor for sensing a movement of the display device, and a movement compensation circuit, operatively coupled to the sensor, for compensating for the movement of the display device such that an image on the display screen of the display device remains substantially stationary in relation to an observer's gaze.

Abstract: A method for automatically generating associations of items included in a database. A user first specifies a support criteria indicating a strength of desired associations of items contained in the said database. Then, a recursive program is executed for generating a hierarchical tree structure comprising one or more levels of database itemsets, with each itemset representing item associations determined to have satisfied the specified support criteria.

Abstract: A method and a computer program device for pushing data from at least one source entity to at least one client entity over a network, a client entity being characterized as having a particular operating state. The method and computer program device comprise the steps of: transferring data from the at least one source entity to a push proxy entity for subsequent transmission of the data to the client entity; requesting a notification regarding the particular state of the client entity; monitoring a state of the client entity until the client entity is in the particular operating state and sending a notification communicating the state to the push proxy entity; and transferring data to the client entity in response to receiving the notification. The state notification may specify push information, which may be used to determine a least expensive device to which to transfer given data. The state notification also reduces the network-polling load by initiating each poll.