Abstract: Methods and apparatus, including computer program products implement techniques for processing experimental data according. An input specifies a set of variable definitions according to a variable definition template for defining a set of variables of a plurality of variable types usable in experiments of a pre-defined experiment class. Data from an experiment of an experiment type is received. A first representation of the data is stored in a format defined according to the plurality of variable types. A second representation of the data, derived from the first representation, is presented in a format defined according to the set of variable definitions. The variable definition template is referenced in the pre-defined experiment class. The data includes a plurality of values corresponding to variables defined in the set of variable definitions.

Abstract: A computer based system is disclosed which enables a buyer and a seller to be efficiently matched. The system can comprise a web based foreign exchange platform in which parties and counterparties post their requirements. A computer identifies and matches reciprocal, offsetting positions and effects a trade at a price which is the mid-point of the Interbank bid/offer spread. The system is fast, efficient and fair, as well as being significantly cheaper than conventional foreign exchange systems.

Abstract: Provided are a method, system, and program for defining asset classes in a digital library. At least one asset class is defined to include at least one attribute and attributes are defined for each asset class to have an attribute object type. The attribute object type is defined to indicate one of a plurality of different data structure formats that are searchable through separate application programs, wherein the attribute object types in one asset class are implemented in different data structure formats. A asset object instance is generated for each asset class and information is generated in the asset object instance on a file location of attribute objects providing the attributes for the generated asset object instance.

Abstract: Provided are a method, system, and program for defining asset classes in a digital library. At least one asset class is defined to include at least one attribute and attributes are defined for each asset class to have an attribute object type. The attribute object type is defined to indicate one of a plurality of different data structure formats that are searchable through separate application programs, wherein the attribute object types in one asset class are implemented in different data structure formats. A asset object instance is generated for each asset class and information is generated in the asset object instance on a file location of attribute objects providing the attributes for the generated asset object instance.

Abstract: The present invention provides for reliably updating a file by making a backup copy of the portion of a file that includes changed data. The revised portion of the file is related to the other file portions through cross-linking of units. Upon completely updating the file and linking the data, old data is deleted. Thus, an entire file need not be duplicated for backing up an update. Furthermore, progress of the update may be tracked by marking the backup copy during the update process. The portions of a data object for the file may be mapped by marking a unit as valid if the data contained therein is current and linked if the unit is related to other portions of the file. In addition, other aspects of the present invention relating to the storage system updating a fragmented file are described.

Abstract: One or more embodiments of the invention provide a computer-implemented method for stylizing data into a presentation. A domain/data object is obtained that comprises an object representation of data stored in a database for a domain entity. An application object is then obtained that comprises an object representation of the data in the domain object that is relevant for a particular computer application. Lastly, a presentation object is obtained that comprises an object representation that encapsulates a visual appearance of the data in the application object.

Abstract: Methods and systems for modeling customer data into a multi-dimensional structure for access to enable efficient customer targeting are described. The method includes the steps of compiling data from multiple sources to create a relational database, using tools to model data within the relational database, scoring the modeled data, integrating scores into a multi-dimensional structure and providing access to end users to the multi-dimensional structure.

Abstract: The present invention is embodied in a system and method for dynamically adjusting data values in response to remote user input to provide the remote user with real time interaction of the data values. First, a user requests information from a remote computer and then results of the requested information are collected at a host computer. Second, the results of the request are transmitted in a hidden format from the host to the remote computer. Third, the results are remotely processed in response to user input. Last, the processed results are dynamically displayed. Client-side processing is preferably used instead of server-side processing to enable the user to quickly access and adjust information dynamically and in real time without server delays.

Abstract: An information retrieval system in accordance with the principles of the present invention maintains a database that defines a relational association between a plurality of informational items in the system. The relational association is based on historical navigational behavior of users of the information retrieval system, and includes a relationship type, which is based on the characteristic similarities between the informational items, and relationship strength, which is based on the historical frequency of any related informational items being selected by a user within the same information retrieval session. When a navigation from one informational item to another information item is detected, the relationship type and the relationship strength of the two informational items are determined and stored in the database.

Abstract: A system for recording information relating to a document, which is accessible via a computer communication network, operates by extracting key words associated with the document, associating a binary code with each extracted key word to form associations, storing the associations in a dictionary, and storing an electronic address (URL) of the document and the binary codes in association with each other in an information storage unit of a user.

Abstract: The data scrambler converts the original data files into the converted data files, respectively, while keeping the output produced by the receiver unchanged. The conversion may comprise dummy insertion, logical structure changing, tag name changing, element order changing, and value unit changing. If the input data files are XML and XSL files, each step also produces XML and XSL files. However, the produced files contain different data from the input XML and XSL files.

Abstract: A network management system for managing a computer network in which media switching type infrastructures and media sharing type infrastructures are combined coexistently includes a database destined for network management in which correspondences established among information concerning physical interconnections of individual equipment on the network, information concerning logical network configuration such as that of virtual network, and information concerning the users who make use of the network are stored, identifying devices for identification of the individual equipment on the network and physical addresses intrinsic to network ports, respectively, and retrieval engines for searching information of the physical addresses of the network ports with queries for the logical addresses.

Abstract: A data processing system stores information in tuple space as tuples that are accessible by multiple entities. Methods, apparatus, computer-readable media, and data structures provide efficient extensions to tuple space coordination languages for example Linda, that increase concurrency by lessening tuple removal, without requiring compile time analysis, altering existing primitives, or adding new primitives. Traces are used to analyze tuple space access in distributed systems, resulting in optimizations based upon certain conditions which, if met, enable a tuple to remain visible in tuple space without blocking, so that other processes can continue to read the tuple while a first process is updating the tuple. A run-time optimization modifies the conditions if the execution is in a closed system that is known not to intentionally contain deadlock, further improving performance.

Abstract: A transaction processing system manages an information collection by employing a two-phase transaction commit protocol. Transaction participants are provided a unique identifier for use in communicating with the transaction management facility in a distributed environment. If the participant is lost, a backup participant is created, and provided with the same identifier as the failed participant to carry on with the transaction in place of the failed participant.

Abstract: A replay method and system for monitoring the generating of a data set from input data sets and, when the data set is subsequently accessed, automatically regenerating the data set if the data set is out-of-date. The replay system only regenerates those input data sets that are determined to be out-of-date and only regenerates the output data set if it is determined to be out-of-date. A data set is determined to be out-of-date only when an input data set has actually changed since the data set was last generated.

Abstract: A system, method and program of the invention enables an alternate page to be received by a client when the desired page is not found at a Web server. Other pages that were close to the desired page in terms of hyperlink hops are stored along with the bookmark for a page. This is done in the background in the spare cycles of the client by creating a site-map which indicates the hyperlink structure of a Web site containing the desired page. Chains of hyperlinks from the desired page back to the root or home page are then stored along with the bookmark at the time of bookmarking. If a page disappears from the site, the links in the chain are followed back from that page to the root page until a next available page is found. On clicking a bookmark, if the page is not found, another close page is obtained by the client.

Abstract: Method and system for configuring a network computer to distinguish between a first address path for a first logging module and a second address path for a second logging module for a log report, using full distinguished names (FDNs) that provide first and second address paths for the first and second logging modules, where the first and second address paths have different object level addresses at an object level immediately below the root level. Where a local distinguished name (LDN) (or relative distinguished name RDN) is used for an address path, the system forwards a log report to an associated Log Server only if the first component of the address path is a selected object level address, such as ‘/system’.

Abstract: A computer-implemented, software based, decision management system which automatically searches for a respective strategy component through a strategy to identify where the strategy component is being used in the strategy, and to determine the strategy component's inter-relationships in the strategy. For example, an end user of the system selects a respective strategy component to be searched. A plurality of selectable inquiries are then automatically presented to the end user, where the plurality of selectable inquiries are context sensitive to correspond to the selected strategy component. The end user then selects a respective inquiry. Then, the system automatically searches for the selected strategy component through the strategy in accordance with the selected inquiry to identify where the strategy component is being used in the strategy. The strategy can be searched, for example, by analyzing linked tables of a relational data model for implementing the strategy.

Abstract: The method of the invention is executed by a computer under the control of a program stored in computer memory. The method includes the step of accumulating preference data for a set of individuals. The preference data is transformed from multi-dimensional data to lower-dimensional data using a principal component analysis. The lower-dimensional data is then converted into a recommendation map where predicted preference information for a selected individual is easily computed. Recommended content is then routed to the selected individual. The invention has been tested, by way of example, to recommend jokes to users based on their ratings of sample jokes.

Abstract: A compressed rendition of a video program is provided in a format suitable for electronic searching and retrieval. An electronic pictorial transcript representation of the video program is initially received. The video program has a video component and a second information-bearing media component associated therewith. The pictorial transcript representation includes a representative frame from each segment of the video component of the video program and a portion of the second media component associated with the segment. The electronic pictorial transcript is transformed into a hypertext format to form a hypertext pictorial transcript. The hypertext pictorial transcript is subsequently recorded in an electronic medium.