Abstract: The present invention is systems and methods for trading. In accordance with these systems and methods, a plurality of trader work stations that are connected to a central server may be provided. Through the work stations and central server, the systems and methods may perform participant qualification, instrument creation, bid/offer entry and response, when hit and take, workup, price retention, price improvement, request for market, bid/off restoration, price generation, position conversion, marking to market, and delivery functions.

Abstract: A method of processing bids over a network for an item to be sold, using a time based factor for an encountered level of demand, the method comprising, setting a first threshold level at which to offer the item at a first time, setting a second threshold level at which to offer the item at a second time subsequent to the first time, receiving one or more bids over the network, upon receipt of a bid, calculating a bid time as a function of the first threshold level, the second threshold level, the bid, the first time and the second time, and accepting bids received on the basis of the calculated bid time.

Abstract: Systems and processes for more accurate mortgage scoring are described. A proportional hazards model is employed in which not only the occurrence of an event, but also the time to an event such as default of a loan, is considered. In this approach, a hazard rate can be viewed as the chance that an observation will experience an event in the next instant. There are two components to the response, and a binary variable is utilized to indicate whether the event was observed or not, and a time variable. As a result, the number of loans used for modeling is greatly increased, and the time it takes to observe the event, a valuable piece of information in itself, is included in the process. In addition, nonlinear effects are advantageously modeled in a continuous fashion using hat functions to map a series of independent variables. This approach typically yields smaller prediction errors near boundary points.

Abstract: Systems and methods are provided to control gaming in electronic trading markets. These systems and methods alleviate the problem of a seller or buyer trying to act on a trader's original bid or offer only to trade at an unfavorable level after the trader changes the bid or offer. A pricing method suspends trading for a period of time if a price difference between two bids or offers by the same trader is too great. A timing method prevents a trader from canceling or replacing a bid or offer for a period of time. These methods provide a more fair and efficient way of executing electronic trades.

Abstract: A method for stock option trading includes receiving an option order at a market, contemporaneously receiving a copy of the option order at an electronic drop (EDrop) system, which is separate and distinct from the market, obtaining a potential cross quantity and a potential cross price based on the option order at the EDrop system, and submitting, through the EDrop system, a contra-order, with respect to the option order, to the market for fulfillment, wherein the contra-order specifies at least one of an underlying security potential cross quantity, and the potential cross price.

Abstract: A system and method are provided to intelligently limit the frequency at which automated or semi-automated trading tools move or re-price orders in an exchange order book. A tolerance may be input that limits when one or more orders in the exchange order book are moved from one price to another. The system and method assist in reducing the number of orders that are entered into the system which can lead to reduced exchange transaction fees, lost queue position, and reduce network bandwidth consumption.

Abstract: A method and system to implement a periodic auction by a seller of risk through a website for the purpose of transferring specific risks authorized by seller under its medium-term and long-term guarantee and medium-term insurance programs. A computerized communications network, such as the Internet, is used as a vehicle for implementing a seller risk auction. A website is utilized to present auction data and terms as well as auction rules and procedures. In addition, relevant information regarding an exposure can be posted on the website at the time the exposure is auctioned. The website can be interactive to ascertain that a potential bidder is an qualified counterparty.

Abstract: Methods and systems for identifying and retaining customers who are likely to terminate an existing loan contract at a date earlier than the loan termination date identified in the loan contract are disclosed. The method includes the steps of using an early termination model to identify customers likely to terminate an existing loan contract at a date earlier than the loan termination date identified in the loan contract, notifying those customers of new loan opportunities at competitive loan interest rates and attempting to cross sell new loans to the customers before the customer early terminates their existing loan.

Abstract: A system and method for providing promotional pricing is disclosed. One or more pricing offers may be provided to a plurality of credit accounts, wherein the pricing offers may be directed to transactions associated with particular products and/or merchants. It may be determined whether a transaction associated with a credit account qualifies for certain pricing offers based on predetermined criteria. A balance incurred through a transaction may be assigned to a promotional bucket associated with a particular pricing offer if the transaction qualifies for the particular pricing offer, or the balance may be assigned to a default bucket if the transaction does not qualify for any pricing offer, thereby causing a total balance to be distributed among the default bucket and the promotional buckets. Payments associated with the credit account may be allocated to the default bucket and the one or more promotional buckets according to a payment hierarchy.

Abstract: An electronic bill payment network includes a plurality of user network stations associated with different users, a plurality of biller network stations associated with different billers, and a central network station. A first user station operates, in real time, to transmit information relevant to an amount of an available bill and an instruction to pay the available bill. A first biller station operates, in real time, to receive the transmitted information and to compute the amount of the available bill based upon the received information. The central network station operates to receive the computed amount of the available bill and the transmitted pay instruction, and to direct payment of the computed amount of the available bill based upon the transmitted instruction to pay that bill.

Abstract: A system and a method of operating a debit card reward program that generates a reward for the cardholder based upon purchases made with the debit card. This reward amount may be applied to subsequent purchases made by the cardholder with the debit card. Additionally, all or a portion of the reward amount may be delivered to a sponsor, such as a charitable institution. A reward is accrued for every purchase conducted at any merchant made using the debit card. In particular, this reward is a varied percentage of every debit card purchase and may result in an additional reward for purchases that meet selected criteria.

Abstract: At least one set of revocation information for identifying electronic appliances that should be revoked for content protection and master revocation information for identifying electronic appliances that have special permission to update the revocation information are recorded in advance into a special storage region on a storage medium. When the storage medium is loaded into an electronic appliance indicated by the master revocation information, the revocation information can be updated. However, when the storage medium is loaded into an electronic appliance indicated by the revocation information, the electronic appliance is revoked and so the protection of contents is improved.

Abstract: A network electronic ticket 1003 is provided in an electronic ticket 1000. Start page data 1016, a ticket owner secret key 1017, an electronic ticket possession certificate 1018, and a network service program 1019 are provided in the network electronic ticket 1003, the network service program 1019 controls various types of processing and an electronic ticket storage terminal, and the ticket owner secret key 1017 and the electronic ticket possession certificate 1018 are used for authentication processing with an information providing apparatus on a network, whereby it is made possible to connect to the network from the electronic ticket itself and receive information service.

Abstract: An initial value-setting system (10) for setting the initial available numbers of times of unitary use (P) of prepaid available number-of-times-of-unitary-use storage media (8) for making use of a certain toll or pay service, the initial value-setting system (10) comprising a means for receiving purchase-application data on each medium (8) including its purchase date and time (DT) through a communication network (N), a storage area for storing the opening date and time (DTS) of advance sale of the media (8), a storage area for storing the closing date and time (DTO) of the advance sale, a storage area for storing the closing date and time (DTE) of ordinary sale, as distinct from the advance sale, of the media (8), and an initial value-setting means for setting the initial numbers (P) of media (8) with purchase dates and times (DT) between the opening and closing dates and times (DTS and DTO) higher than those (P) of media (8) with purchase dates and times (DT) between the closing dates and times (DTO and DTE)

Abstract: A method and system for optimizing dynamic prices of reserved date-constrained services such as airline flight reservations or hotel stay reservations. Comparative trials of complex pricing policies are employed according to an application schedule that has a periodic character with respect to the arrival date of quoting circumstances. On the basis of the comparative trials, some policies are identified as contributing less revenue on average to the system than other policies. The underperforming policies are then eliminated from the application schedule, which increases the expected future revenue of the resulting system.

Abstract: A general purpose processor architecture (methods and apparatuses) that can discern all subsets of a serial data stream which fulfill an arbitrarily complex reference pattern. The invention comprises an ordered set of Detection Cells conditionally interconnected according to the reference pattern and operationally controlling one another's states through the network. The invention preferably includes a Host Interface to enable reporting of Results from a search session as well as the input and control of reference patterns and source data.

Abstract: A physical neural network is disclosed, which comprises a liquid state machine. The physical neural network is configured from molecular connections located within a dielectric solvent between pre-synaptic and post-synaptic electrodes thereof, such that the molecular connections are strengthened or weakened according to an application of an electric field or a frequency thereof to provide physical neural network connections thereof. A supervised learning mechanism is associated with the liquid state machine, whereby connections strengths of the molecular connections are determined by pre-synaptic and post-synaptic activity respectively associated with the pre-synaptic and post-synaptic electrodes, wherein the liquid state machine comprises a dynamic fading memory mechanism.

Abstract: A user's preference structure in respect of alternative “objects” with which the user is presented is captured in a multi-attribute utility function. The user ranks these competing objects in order of the user's relative preference for such objects. A utility function that defines the user's preference structure is provided as output on the basis of this relative ranking. This technique can be used to assist a buyer in selecting between multi-attribute quotes or bids submitted by prospective suppliers to the buyer.

Abstract: A method of enabling a knowledge management community. A community is originated based on a vision of values and benefits that can be realized from the organized sharing of knowledge within a common group of people. The group is defined based on subject matter, interest, geography, or any other category. Based on the vision of a community, an initial definition of the community is created, including a community charter. Based on the community charter, the community is designed. The design of the community includes creating a matrix showing processes performed by members of the community and the outcomes of these processes, developing knowledge maps that show the knowledge used and created in performing processes, and defining metrics to measure the benefit derived from the sharing of knowledge within the community.

Abstract: An image searching system, an image searching method, and a medium storing an image searching program for improving search accuracy while reducing the user burden when searching for similar images based on a plurality of key images are disclosed. A plurality of feature quantity types is extracted from each of plural key images (S42), and feature quantities of the same type are compared between the key images to select those feature quantities having approximately equal values as the key image feature quantities to be used as search criteria (S43). Feature quantities in the target images are then extracted (S45) and a degree of similarity between the target image and key images is calculated based on a key image feature quantity and the same feature quantity in the target image (S46) Based on the resulting degree of similarity, target images having a high similarity to the key image are output as the search result (S47).

Abstract: A method and system for managing a file lifecycle is disclosed. The method incorporates a virtual file cabinet having virtual drawers. Files are moved from drawer to drawer throughout their lifecycle in accordance with policies associated with each drawer. The files are moved automatically and as such, a file's lifecycle is managed from file creation to file deletion in an automated fashion. By using an archiving device such as magneto optical storage media, the files are automatically moved to their final archived location in an archiving drawer once certain policies of their present drawer are met. The system is an electronic system employing the inventive method.

Abstract: One embodiment of the invention is directed to providing a single instance storage capability in a content addressable computer system that stores content units in a time-based directory structure. Another embodiment is directed to managing access to content units that do not include a timestamp in their content addresses, in a time-based directory structure. A further embodiment is directed to accessing replicated content units stored on a computer, based on a time of replication. A further embodiment is directed to employing a bitmap in a time-based directory structure which may be used to indicate whether any content units stored during a specified time range are stored in the directory structure.

Abstract: The invention allows multiple application systems to use a single database system. The database system is divided into at least a first memory portion and a second memory portion. The memory portions are disjunctive. The database system stores a first assignment of a first profile to the first memory portion and a second assignment of a second profile to the second memory portion . The first and second profiles are unique and refer to the first and second application systems, respectively. The first application system and the second application system access the first memory portion and the second memory portion, through the respective profiles.

Abstract: A system dynamically maps (and translates) codes and identifier values of any type to corresponding codes and identifiers of other entities. A method for determining a specific identifier code for an object associated with a plurality of identifier codes by a corresponding plurality of entities involves receiving a first message including at least a first identifier code identifying an object. The first identifier code is extracted from the received first message and a second message is generated incorporating the extracted first identifier code. The second message is used for initiating a search of an identifier code database mapping an identifier code associated with a first entity to a corresponding identifier code associated with a second entity. A second identifier code corresponding to the first identifier code is received in response to communicating the second message for initiating a search of the identifier code database.

Abstract: According to one embodiment of the invention, a method includes receiving a search term for a query. The method also includes searching a network of concept terms for terms related to the search term. Additionally, the query is reformulated using the search term and the related terms. A local database is searched for data terms that match the search term and the related terms. The data terms are from documents residing on websites located on servers across a network. Moreover, the method includes retrieving the documents from the websites whose data terms match the search term and the related terms.

Abstract: A system and method for querying a stream of XML data in a single pass using standard XQuery expressions. The system comprises: an expression parser that receives a query and generates a parse tree; a SAX events API that receives the stream of XML data and generates a stream of SAX events; an evaluator that receives the parse tree and stream of SAX events and buffers fragments from the stream of SAX events that meet an evaluation criteria; and a tuple constructor that joins fragments to form a set of tuple results that satisfies the query for the stream of XML data.

Abstract: A system and method for finding a business entity in a database that matches input data. A web services interface accepts a match request and provides a best match. A pre-processing layer cleans, parses, and standardizes input data into terms. An application layer includes a match engine for processing the match request using the terms. The match engine evaluates and scores match candidates from the database to provide the best match and, optionally, an ordered list of match candidates.

Abstract: A searching method for a Security Policy Database (SPD) is proposed. The characteristic of peer gateway of the IPSec is applied to divide the original SPD into multiple smaller peer-based SPDs, and build a peer table corresponding to the peer-based SPDs. When it is required to search the policies in the database, the peer-based SPD according to the present invention can be directly used so as to save the time of data searching.

Abstract: The cost of running a query (having a query range) on a multidimensional database may be estimated using a process factors criteria beyond merely the number of affected records. First, a materialized view of the database may be represented as a container of tuples, sorted by key. Then keys may be stepped through, each key representing a mapping of a combination of tuples from the container. At each step, the process may request the next smallest key in the query range greater than or equal to the key of the current step, which results in the tuple in the database whose key is the smallest, greater than or equal to the requested key, and determine if the resulting tuple is in the query range. The cost of the query may then be estimated as the number of tuples upon which the range check was performed.

Abstract: Described is a system and method by which a unique and permanent identifier is added to tags in hierarchically-arranged data (e.g., an XML or XAML file) by a first tool. The data with the unique and permanent identifiers is processed by a second tool into a flat file of key-value pairs, with the key being constructed from the identifier and attribute names, and the value comprising the corresponding value for that attribute. When the flat file from the new data file is compared to a flat file from an earlier version of the file, a standard merge program is able to better detect the differences, including differences caused by complex edits. The comparison is more granular than it would be if simply comparing the hierarchically-arranged file versions, thereby providing significant benefits in localization and other version tracking scenarios.

Abstract: Methods and apparatus determine equivalent descriptions for an information need. In one implementation, if adjacent entries in a query log contain common terms, the uncommon terms are identified as a candidate pair. The candidate pairs are assigned a score based on their frequency of occurrence, and pairs having a score exceeding a defined threshold are determined to be synonyms.

Abstract: A pre-pass and direct call mechanism which replaces the interpreter. The mechanism moves static decisions out of the repeated runtime path into a pre-pass operation. Advantageously, the mechanism reduces runtime overhead and improves overall performance of the DBMS during runtime, while maintaining the considerable investment in opcode generation and plan representation.

Abstract: A method to generate an SQL sub-expression that implement access control rules stored in a library server. The SQL sub-expression is then merged with the SQL passed from an application program interface (API). The access control checking mechanism is implemented on the server side of the content management system. In this client/server environment, the query SQL statement is built in two layers: the API (client) layer and the server layer. The API sends the query string to the underlying stored procedure. The stored procedure then generates the access control logic based on the configuration parameters of the library server. This access control logic is dynamically added to the query string sent by the API. The stored procedure prepares, builds and executes this new query string as a dynamic SQL statement.

Abstract: A context fusing system and methodology includes the steps of receiving context data from a plurality of information sources; computing a quality measure for each input context value; organizing context values into one or more clusters, and assigning a single context value and a single quality measure to each cluster; and, selecting one or more clusters according to one or more criteria and aggregating the context values and quality measures of selected clusters to generate a single context value and single quality measure. The single context value and single quality measure are usable by a context aware application to avoid conflict and ambiguity among different information sources providing the context data.

Abstract: Improved method of and apparatus for joining and aggregating data elements integrated within a relational database management system (RDBMS) using a non-relational multi-dimensional data structure (MDD). The improved RDBMS system of the present invention can be used to realize achieving a significant increase in system performance (e.g. deceased access/search time), user flexibility and ease of use. The improved RDBMS system of the present invention can be used to realize an improved Data Warehouse for supporting on-line analytical processing (OLAP) operations or to realize an improved informational database system or the like.

Abstract: Providing persisting search folders within a computer that continuously identify data items having metadata matching a query of search criteria. A query of search criteria formulated via a graphical user interface is applied to a search filter to create a search folder. When the search folder is made live, the search filter is used to search one or more data stores for data items having metadata matching the query of search criteria. Upon finding these data items, the search folder is populated with a link to each data item having metadata matching the query of search criteria. The search folder detects when any new data items are added to a data store and when a change occurs to any metadata of data items previously stored in a data store. Upon detection, the search folders store links to matching new or changed data items.

Abstract: Exemplary embodiments of the present invention relate to enhanced faceted search support for OLAP queries over unstructured text as well as structured dimensions by the dynamic and automatic discovery of dimensions that are determined to be most “interesting” to a user based upon the data. Within the exemplary embodiments “interestingness” is defined as how surprising a summary along some dimensions is from a user's expectation. Further, multi-attribute facets are determined and a user is optionally permitted to specify the distribution of values that she expects, and/or the distance metric by which actual and expected distributions are to be compared.

Abstract: The invention relates to a method for comparing and analysing digital documents. The present invention is founded on the basic principle of searching for unambiguous roots in both documents. These roots are units which occur in both documents and in each case are unique. These roots can be individual words, word groups or other unambiguous textual formatting functions. There is then a search for identical roots in the respective other document (Root1 from Content1, and Root2 from Content2, with Root1=Root2). If a pair has been found, the area around these roots is compared until there is no longer any agreement. During the area search, both the preceding words and the subsequent words are analysed. The areas which are found in this way, Area1 around Root1 and Area2 around Root2, are stored in lists, List1 and List2, which are allocated to Doc1 and Doc2. This procedure is repeated until such time as no roots can be found any longer.

Abstract: An information processing apparatus, present in an intranet, sharing information with an information processing apparatus present in the other intranet connected to the intranet via a network, includes a memory storing the information, and a controller setting the information stored in the memory to an update disabled state in the updating of the information stored in the memory if the information is in an update enabled state, requesting the information processing apparatus sharing the information and present in the other intranet to set an update disabled state, and updating the information on condition that the update disabled state is set in all information processing apparatuses sharing the information and present in the intranets. Updating of the information shared by a plurality of intranets connected to each other via a network is thus synchronized to prevent updating contention.

Abstract: Documents are indexed in accordance with a process that separates the filtering and word breaking portions of the process so that they are performed under a restricted security setting. When a document is requested by an indexer, the document is retrieved and then passed to the higher security process. The document is then filtered one or more filters and tokenized by one or more wordbreakers under the restricted security setting before being passed to the indexer. The restricted security setting prevents security vulnerabilities from being exploited during the filtering and word breaking processes.

Abstract: A method and apparatus for a Web-enabled transaction and matter management application are described. In one embodiment, the application is centered around a user-friendly home navigation page designed to facilitate convenience for the user in accessing information or entering and tracking data. All information is sorted by project or matter name. A client user may view information one matter at a time, all matters at once, or any user-specified number of matters. Access is restricted to authorized users with password access rights. The application enables the tracking of information that is beneficial to all levels of the user's organization, that is substantive and relevant to different levels of the user's staff, and that aids the client in making informed decisions regarding its current transactions and documents relating thereto.

Abstract: A federated system and methods and mechanisms of implementing and using such a system is disclosed. In some embodiments, one or more mappings are created between a taxonomy view at a node and one or more taxonomies of one or more data sources. The one or more data sources can then be accessed via the taxonomy view. In other embodiments, one or more mappings are created between content from different data sources and content from those data sources are merged using the one or more mappings.

Abstract: A method, system, and computer program product to transfer data between two application data structures by copying a data gather scatter program (DGSP) from an exporting process address space where a first data structure is located, to a location in shared memory visible to an importing process address space; assembling a parameter set identifying the data structure; starting a data gather scatter-redistribution machine (DGS-RM) in an importing process space where a second application data structure is located; passing the first parameter set, the DGSP copy, and a second parameter set identifying a second application data structure and a second DGSP to the DGS-RM; and creating master and worker stack machines. The master stack machine identifies a contiguous chunk of the first data structure.

Abstract: In one embodiment, the present invention includes a method of analyzing an extensible markup language (XML) file, generating structural information for the XML file, and incorporating the structural information into the XML file. The structural information may correspond to a hierarchy of the file and may further include size information corresponding to elements of the file. In such manner, the structural information may be transmitted with the XML file and used to aid a receiver of the file in parsing. Other embodiments are described and claimed.

Abstract: A method, computer program product, and a data processing system that facilitates navigation through a directed graph for selection-of sub-processes of a modified business process derived from a business process is provided. A bounding box is used for evaluating and selecting sequences of nodes representative of business sub-processes or services. The bounding box has a predefined depth for limiting the scope of the evaluation. The bounding box is shifted during the evaluation as sequences of nodes are selected. Additionally, state data is maintained such that a sense response model may be employed to detect and account for changes to the environment in previously evaluated services. By maintaining state data, a transition to a previously evaluated sub-process may be implemented to account for significant changes in the environment.

Abstract: A method and system for supporting an XQuery trigger in XML-DBMS based on relational DBMS is provided. In an Ubiquitous environment where XML data are incessantly generated by an enormous number of objects, so as to overcome inconvenience and its resultant reduction of performance in which a user should query after checking a change of XML-DBMS one by one, in XML-DBMS based on relational DBMS, the present invention supports an XQuery trigger technique based on SQL trigger automatically executing insert, update and delete statements, and a storage or external procedure related with the change of data when a change of data is generated at a specific table in a conventional relational DBMS.

Abstract: A file differencing and updating system is provided that includes a file differencing component and a file updating component. The file differencing component, or file differencing engine, generates a difference file in a first processor-based or computer system from an original or old version and a new version of an electronic file. Generation of the difference files includes processing to reduce the number of file changes introduced by code block swaps. The processing uses an alignment algorithm, which includes a sorting algorithm, to align the code blocks of the original version in the same order as those of the new version, thereby eliminating the increase in the number of byte-level file differences due to code block swaps. During the alignment operations, the block movements are dynamically recorded at a minimum cost level and encoded for transmission to the file updating component for use in code recovery.

Abstract: Provided are a method, system, and program maintaining information on a namespace comprised of filesets shared by clients over a network. Zone information is maintained on at least one zone, wherein each zone associates at least one client system, at least one fileset, and at least one storage pool. For one zone, the associated at least one fileset and at least one storage pool are accessible to the at least one client system. Clients are provided information on filesets included in a namespace, wherein each of a plurality of clients receive information on the at least one fileset associated with the client in the at least one zone including the client.

Abstract: In a single-signature duplicate document system, a secondary set of attributes is used in addition to a primary set of attributes so as to improve the precision of the system. When the projection of a document onto the primary set of attributes is below a threshold, then a secondary set of attributes is used to supplement the primary lexicon so that the projection is above the threshold.

Abstract: The subject invention provides a system and/or a method that facilitates adapting at least two disparate file systems. A file system adapter can provide uniformity and/or seamless integration between a first file system and a second file system. The file system adapter can employ a file-backed item that is enriched by a file to provide at least one of a property to an item and a file stream associated with the item. The file-backed item can allow a manipulation by at least one of an API for the first file system and an API for the second file system.