Abstract: Described is a system and a computer program product for visually delineating a relationship between diverse, but related graphical objects in a graphical user interface. An icon that has specified color scheme is associated with the diverse, but related but graphical objects. When one of the related graphical objects is displayed, the icon is displayed within the displayed graphical object. The persistence of the icon with the specified color scheme in the displayed graphical objects allows them to be recognized as related. In a particular instance, the icon is displayed with each graphical object in a series of graphical objects that represent an evolution of progression of development.

Abstract: Provided is a method for online reorganization and increasing the page size of a DB2 object. A base table and related auxiliary table spaces are reorganized concurrently via a database utility, DB2 REORG utility. The database utility determines which auxiliary tables are related to the base table and automatically includes their respective auxiliary table in the same invocation of the utility. The reorganization is performed via allocated shadow data sets; page size of the allocated shadow data sets is dynamically updated during reorganization. The original data sets are switched with the newly built shadow data sets, and DB2 catalog values and control blocks are updated with new page size values.

Abstract: A Femtocell Access Point (FAP) is used to provision a ticket number service. Customers approach the FAP and are given a ticket number indicating their place in the queue through an SMS message. Follow up SMS messages are sent updating the customer of their current position in line, as well as when it is their turn. Statistics may be generated from information gathered at the FAP and sent to an external client module.

Abstract: Disclosed is a method of encoding JavaScript Object Notation (JSON) documents in an inverted index, wherein a tree representation of a JSON document is first generated, and, next, the JSON document is shredded into a list of <value, path, type, jdewey> tuples for each atom node, n, in the tree, where value is a label associated with n, path is a concatenation of node labels associated with ancestors of n, type is a description of a type of value, and jdewey of n is a partial Dewey code of its closest ancestor array node, if one exists, or empty, otherwise. Lastly, an inverted index is built using <path, type, value> as index term, and jdewey as payload. A method is also described to search the inverted index.

Abstract: An implementation wherein RFID data is shared across independent organizations has been addressed. RFID data is usually spread across different parties, e.g. enterprises in a supply chain and thus, efficient query processing across all parties is required. Traceability is emerging as one of the key applications of RFID technology. A generic data model is introduced for querying RFID data across a network of independently operated data sources. The model can be used to facilitate traceability query processing and give a set of representative traceability queries. A newly designed process-and-forward approach is implemented for executing traceability queries.

Abstract: A system and method for an on-line web-based advertiser-broker to subsidize calls of a plurality of VOIP operators' subscribers by showing them video advertisements from a catalogue of advertisements provided by a plurality of advertisers. The advertisement is shown by the advertiser-broker and then the call is transferred to the VoIP operator for call completion. The advertiser-broker provides the clearing-house services between many advertisers and many VoIP operators, subsidizing wholly or partially phone calls of users of VoIP operators by showing them streaming video advertisements of advertisers who pay for the calls. With this new business, phone calls get monetized through advertisers while users pay nothing for phone calls, and VoIP operators do not need to incorporate advertisers to their business.

Abstract: A system and method is disclosed for maintaining, in a Storage Area Network (SAN), the consistency of a local copy of a remote file system sub-tree obtained from a remote source. Directory structure of the remote file system sub-tree is mapped to a remote container attached to the SAN and each remote object of the remote file system sub-tree is represented as a local object component of the remote container. Next, each of the local objects are labeled with attributes associated with the represented remote object, and metadata describing each of the local objects is stored in a metadata server. Also, a consistency policy is associated with each of the local objects in the remote container (wherein the policy defines conditions for checking freshness of said labeled attributes), and the local object components of remote container is updated in accordance with the consistency policy.

Abstract: Described is a method for visually delineating a relationship between diverse, but related graphical objects in a graphical user interface. An icon that has specified color scheme is associated with the diverse, but related but graphical objects. When one of the related graphical objects is displayed, the icon is displayed within the displayed graphical object. The persistence of the icon with the specified color scheme in the displayed graphical objects allows them to be recognized as related.

Abstract: An asymmetrically programmed memory material (such as a solid electrolyte material) is described for use as a rectifying element for driving symmetric or substantially symmetric resistive memory elements in a crosspoint memory architecture. A solid electrolyte element (SE) has very high resistance in the OFF state and very low resistance in the ON state (because it is a metallic filament in the ON state). These attributes make it a near ideal diode. During the passage of current (during program/read/erase) of the memory element, the solid electrolyte material also programs into the low resistance state. The final state of the solid electrolyte material is reverted to a high resistance state while making sure that the final state of the memory material is the one desired.

Abstract: Automated analysis of M-Mode images are provided based on the separation of M-Mode images into tissue layers and motion curves by simultaneously aligning all layers and extracting the motion curves from the alignment. Also provided is the ability to search for similar M-Modes using a representation comprised of tissue layers and motion curves and a similarity measure thereof.

Abstract: An extensible identification system for nodes in a hierarchy is described wherein each node is assigned a concatenation of decimal based values. The values assigned uniquely identify the node, provides an order for the node, and identifies its parent, child, and sibling relationships with other nodes Furthermore, the IDs assigned can be encoded to be byte comparable. Furthermore, the ID's assigned to nodes need not be modified when changes (adding/deleting a child node or a subtree of nodes) are made in the hierarchy. Additionally, in the event of such a change, the order and relationships between the parent, child, and sibling nodes are retained.

Abstract: A crosspoint array is made up of a plurality of bitlines and wordlines and a plurality of crossbar elements, with each crossbar element being disposed between a bitline and a wordline, and each crossbar element comprising at least a phase change material used as a rectifier in series with a solid electrolyte used as an asymmetric resistive memory element. The crossbar elements are responsive to the following voltages: a first set of voltages to transition the phase change material in the crossbar elements from an OFF state to an ON state; a second set of voltages to read or program the solid electrolyte, and a third set of voltages to transition the phase change material from an ON state to an OFF state.

Abstract: A new sub-document versioning method for record storages of XML documents which uses virtual cutting points to ensure that a search tree is able to support multiple versions of sub-documents and provide efficient mechanisms for XML updating. Record boundaries and virtual cut points divide the two-dimensional space, the horizontal axis representing node identifiers in document order and vertical axis representing version numbers, into rectangles. The bottom corner of the rectangle is used to represent the rectangles and the corresponding information of the corner is added to the search tree index.

Abstract: The present invention exploits a visual rendering of heart sounds and models the morphological variations of audio envelopes through a constrained non-rigid translation transform. Similar heart sounds are then retrieved by recovering the corresponding alignment transform using a variant of shape-based dynamic time warping.

Abstract: A predicate over a single column of a table is converted into at least one IN-list, wherein the IN-list is generated for a set of tuples of the column, and the generation is done over a data structure representing a set of distinct values of the column where the predicate applies and having a smaller cardinality than the table. The generated IN-list is evaluated over the set of tuples and the results of the evaluation are outputted as an evaluation of the predicate.

Abstract: A method for consistent selectivity estimation based on the principle of maximum entropy (ME) is provided. The method efficiently exploits all available information and avoids the bias problem. In the absence of detailed knowledge, the ME approach reduces to standard uniformity and independence assumptions. The disclosed method, based on the principle of ME, is used to improve the optimizer's cardinality estimates by orders of magnitude, resulting in better plan quality and significantly reduced query execution times.

Abstract: A method for indexing a plurality of documents, that includes a plurality of duplicate documents, first identifies one or more duplicate groups of documents from among the plurality of documents. Then, one index of content for the duplicate group is created instead of indexing the content from every document within the duplicate group. However, in contrast to the content index, an index of metadata for each of the documents in the duplicate group is created. Thus the content of each duplicate group is indexed only once, while a search engine using such indexing techniques retains the capability to answer queries as if the duplicated content was indexed for each document of the group.

Abstract: A keyboard type input device used in conjunction with a wristwatch or a portable telephone has multiple key positions provided as character entry keys. Each key corresponds to one key in the selected row of the conventional QWERTY keyboard. A second set of control buttons provide for the selection of which row of a conventional QWERTY keyboard are represented by the character keys in addition to other functions such as case shift, and alpha-numerical control functions. A selected row is shown on a display, as visual feedback. Alternatively the keys are implemented as LCDs with pressure sensors and the characters of the selected row are displayed directly on the corresponding key positions. The keyboard finds particular use in portable devices as it demands less space than traditional keyboards.

Abstract: A method (and an article of manufacture having computer readable program code to implement the method) is disclosed to version a node range and locate a versioned node range in a storage architecture, wherein the method comprises: maintaining a set of node ranges, with each node range being formed from a range of node ID values assigned to each node among a plurality of nodes, receiving a node modification request for a node range from a database system, versioning the node range by copying (to a storage) a node range to which the node modification request is to be made, labeling the copied node range with a timestamp, locating the labeled node range via the timestamp and a hash on the node range, and outputting the located labeled node range. Optionally, versioning is done by shadowing nodes in the range to a version hash table based on a range identifier.

Abstract: A novel method is described for applying various hash methods used in conjunction with a query with a Group By clause. A plurality of drawers are identified, wherein each of the drawers is made up of a collection of cells from a single partition of a Group By column and each of the drawers being defined for a specific query. A separate hash table is independently computed for each of the drawers and a hashing scheme (picked from among a plurality of hashing schemes) is independently applied for each of the drawers.