Abstract: Items for sale are listed on a first spreadsheet. A digital picture of an item taken by a video camera and imported to the first spreadsheet. Bids for the items are solicited from potential buyers by sending out the first spreadsheet using e mail. Buyers indicate bid amounts and quantities and return the spreadsheets. Returned spreadsheets are combined into a second spreadsheet. An optimization algorithm is executed to determine winning bids. Award sheets for each bidder are generated and sent to the bidders. A trend analysis determines which items meet a criteria for further investment.

Abstract: A system and method provides for enabling on-line transactional services among sellers and buyers having no previous relationship with each other. The system includes a financial clearinghouse for receiving a request for goods or services from a buyer and making a real-time determination of a risk classification of the buyer utilizing an on-line repository of credit information. The financial clearinghouse determines a risk-based discount fee as a function of the buyer's risk classification in order to establish a payment amount to the seller from the clearinghouse. If the transaction is authorized by the financial clearinghouse, the financial clearinghouse transmits the payment amount to the seller and transmits an invoice to the buyer for the purchase price of the transaction. The system can also include a broker coupled to the financial clearinghouse for providing an on-line order acceptance and processing capability between the buyers and sellers.

Abstract: A method of forming a schedule of crude oil shipments being received at a refinery facility using a genetic algorithm has been developed. A period of time, T, within which the crude oil shipment schedule is to be formed is determined. A first generation of chromosomes is generated and a fitness function value calculated for each chromosome. A succeeding generation of chromosomes is created using a genetic algorithm and the fitness function value for each chromosome is determined. The steps of producing a succeeding generation of chromosomes using a genetic algorithm and determining a fitness function value for each chromosome are repeated for time T. The chromosome having the highest fitness function value within time T is identified to generate the schedule.

Abstract: Periodic patterns in time series data can be hierarchical in nature, where a higher level pattern may comprise repetitions of lower level patterns. In the presence of noises, these repetitions of lower level patterns may not be perfect. A novel model, namely a meta-pattern, is provided in accordance with the present invention to capture these higher level patterns. The meta-pattern can not only provide a more compact representation of patterns but also capture the regularities of pattern evolutions, which may not be expressed by previous models due to the presence of noise. A method is provided to mine meta-patterns in an iterative manner by discovering meta-patterns and their supporting subsequences in the form of lists of segments of contiguous repetitions of a meta-pattern. The number of pattern repetitions in each said segment is at least a predefined threshold min_rep and the distance between any two adjacent segments is at most a predefined threshold max_dis.

Abstract: A Collection Knowledge System provides context-sensitive knowledge delivery services to application programs, thereby enabling application programs to effectively support variant computational processes. In operation, a Collection Knowledge System receives knowledge requests from application programs, performs local and remote lookups into structured trees of knowledge, and returns requested knowledge to requesting application programs. Collection Knowledge Systems can manage knowledge for entire variant computational processes, thereby enabling application programs to calculate and execute many variant computational processes in fully automated, scalable ways that were not previously possible. As a consequence of automated process construction and execution, associated human labor costs are effectively reduced to zero.

Abstract: A method and system of generating molecular mechanics force fields for computer simulation of molecular systems, including a graphic user interface 101, extensible database 108 containing parameterized force fields, data and molecular models, interfaces to quantum mechanics 102 and molecular mechanics 107 calculations, and a computational engine 105. A force field attributes assigner 205 assigns force field type, functional forms and atom types. A parameter estimator 206 makes initial force field parameters based on the database and a set of mathematical formulas. A fit engine 207 fits complex potential energy surfaces efficiently.

Abstract: A method and system for providing customers with access to and analysis of event data is provided. The event data may be stored in log files and supplemented with data from other sources, such as product databases and customer invoices. A data warehouse system collects customer data from the customer web sites and stores the data at a data warehouse server. The data warehouse server interacts with the customer servers to collect to the customer data on a periodic basis. The data warehouse server may provide instructions to the customer servers identifying the customer data that is to be uploaded to the data warehouse server. When the data warehouse server receives customer data, it converts the customer data into a format that is more conducive to processing by decision support system applications by which customers can analyze their data.

Abstract: The invention provides method and apparatus for viewing information. In one embodiment, the system of the invention enables the user to view displayed information in a way that is comparable to a selected physical paradigm. Example physical paradigms include, but are not limited to, financial, educational, governmental, sports, media, retail, travel, geographic, real estate, medical, physiological, mechanical, surveillance, agricultural, industrial, infrastructure, scientific and other like paradigms. By presenting information to the user in a way that more closely mimics physical paradigms, the system provides an intuitive mechanism for the user to view, search through and interact with displayed information in an unrestricted manner. In another embodiment, the appearance is a graphical representation of one or more data objects, related to other data objects through hierarchical relationships defined by one or more templates.

Abstract: A system and method for analyzing the data flow of a database query. The database query contains a plurality of query conditions that are used to filter data records of a database. At least one query condition is identified from the plurality of query conditions in the database query. The database is queried based upon the identified query condition. At least one results characteristic is determined that is associated with the query of the database with the identified query condition. The results characteristic is used to analyze the identified query condition.

Abstract: A method of performing a flexible similarity search is provided. In one embodiment, the method comprises the steps of: (i) constructing an indexed representation of one or more documents to be used in the similarity search; (ii) specifying a target document and a similarity function to be used for the search of the one or more documents for which the indexed representation is constructed; and (iii) finding a document among the one or more documents for which the indexed representation is constructed which is similar to the target document, based on the specified similarity function. Thus, the invention creates a universal index for text similarity searches so that a user can specify a function at the time of query.

Abstract: A system for automatically initiating an Internet-based search from within a document displayed by a document viewer includes a search term designation module configured to receive a user designation of at least one word of the document; a search engine access module configured to automatically access a search engine; a search engine interfacing module configured to automatically provide the search engine with the at least one designated word; and a search initiation module configured to automatically direct the search engine to perform the Internet-based search using the at least one designated word as a search term.

Abstract: A search engine system assists users in locating web pages from which user-specified products can be purchased. Web pages located by a crawler program are scored, based on a set of rules, according to likelihood of including an online product offering. A query server accesses an index of the scored web pages to locate pages that are both responsive to a user's search query and likely to include a product offering. In one embodiment, the responsive web pages are listed on a composite search results page together with products that satisfy the query.

Abstract: In a sequence homology detection aspect of the invention, a computer-based method of detecting homologies between a plurality of sequences in a database and a query sequence comprises the following steps. First, the method includes accessing patterns associated with the database, each pattern representing at least a portion of one or more sequences in the database. Next, the query sequence is compared to the patterns to detect whether one or more portions of the query sequence are homologous to portions of the sequences of the database represented by the patterns. Then, a score is generated for each sequence detected to be homologous to the query sequence, wherein the sequence score is based on individual scores generated in accordance with each homologous portion of the sequence detected, and the sequence score represents a degree of homology between the query sequence and the detected sequence.

Abstract: A method for converting relational data to XML (eXtensible Markup Language) is provided. The method can use a greedy algorithm to efficiently construct materialized XML views of relational databases. A greedy algorithm designed for XML view definition queries is provided for decomposing a large query into smaller queries and determining which query will run faster without actually running the query.

Abstract: A method and system for creating and searching a central linked list comprising a parent node which is situated at the center of a plurality of child nodes. Each child node has two double linked list pointers. One pointer points to the next child node, and the other pointer points to the parent node. Thus, matched data obtained at several child nodes moves immediately back to the parent simultaneously. The parent node contains the memory address and name of central linked list, a description of central linked list, and a description of the relationship between other parent nodes, as well as the relationship between each child node to its specific parent node. Each child node contains a node address, an attribute comprised of some or all of the stored data field and a link to the full data content that may reside on a file or in a database. Memory storage of the structure information is stored in system memory, such as, RAM.

Abstract: Independent and individual requests are aggregated and presented as a single request to a resource management system. The response from the resource management system is subsequently resolved back to the individual requests. The requesters generate multiple independent requests. The server receives such requests and sorts them into classes of requests, which are capable of being aggregated and processed as a single request by a resource management system. Parameters are pulled from the individual requests and used in the aggregated request.

Abstract: A system and method for annotating resource results obtained in a customer self service system that performs resource search and selection. The method comprising the steps of: receiving a resource response set of results obtained in response to a current user query and receiving a user context vector associated with the current user query, the user context vector comprising data associating an interaction state with the user; applying an ordering and annotation function for mapping the user context vector with the resource response set to generate an annotated response set having one or more annotations; and, controlling the presentation of the resource response set to the user according to the annotations, wherein the ordering and annotation function is executed interactively at the time of each user query.

Abstract: The method of the present invention is useful in a computer system including at least one client. The program executes a method for matching a pattern string with a target string, where either string can contain single or multi-character wild cards. The method includes the steps of preprocessing the pattern string into a prefix segment, a suffix segment, and zero or more interior segments. Next, matching the prefix segment, the suffix segment, and the interior segment(s) with the target string.

Abstract: A method for increasing the availability of a first server included in a computer cluster when a second server fails. Each server in the computer cluster has an associated mass storage device and can process requests from any network device in the computer cluster. Data is mirrored between the mass storage devices of the servers so that each server's mass storage device has a complete copy of all computer cluster data. Data mirroring takes place across a dedicated link, which reduces congestion on the rest of the computer cluster. When the first server detects a loss of communication from the second server, the first server determines if the loss of communication is a result of a malfunction of the dedicated link. If the dedicated link has failed, the first server discontinues operation to avoid writing data to its associated mass storage device, which cannot be mirrored due to the loss of communication. If the dedicated link is operational, the first server continues operation.

Abstract: A resume database system allows for resume records on the resume database system to be viewed by others via a Uniform Resource Locator, URL. In addition, in response to instructions from an authorized user of the resume database system, input from an unauthorized, but otherwise verified, source can be added to the database by the resume database system. The verified user accesses the resume database and completes any necessary forms via a web browser and submits the information. The authorized user defines the actions that the verified user is allowed to take. These actions include, for example, only being able to review resume information, or being able to add information to the resume database without needing training on the operation of the database. A resume database server system coordinates the activity of the authorized and verified users. Communications between all three users is accomplished via a computer network.

Abstract: A service provider generates digital records of calendar events with respect to its clients using its own data, and automatically transfers these records to portable digital devices of the clients. Preferably, the service provider maintains a computer system or terminal at the point of personal contact with the client, which is also used to track service provider operations. The provider's computer system automatically generates an event record in a format for use by the client, from data in the computer system used to track service provider operations. Preferably, the service provider maintains a list of clients and their associated portable digital device interface type. The provider's computer system generates an appropriate calendar event, and formats and transmits it according to the client's interface type.

Abstract: Techniques for generating a list of people relevant to a task includes receiving content associated with a task, automatically generating a query for a list of people based on terms obtained from the content, generating the list of people in response to the query, and presenting the list of people to a user

Abstract: The present invention relates to a data processing system, method and computer program product for improving the operation of, for example, a message broker. By not constructing messages from stored data in advance of a demand, the invention reduces the processing overhead. A further aspect provides for maintaining a data structure for a messaging system having an application capable of producing an output structured message in a prescribed format and capable of adding a received structure message to a data structure contained within a storage medium of the system.

Abstract: A technique for rapid retrieval and navigation of assets stored on a computer system involves defining a taxonomy and classification rules according to asset-specific criteria, identifying the stored assets, automatically categorizing the identified assets according to the defined classification system, followed by indexing of the categorized assets. A presentation tool is utilized to display and navigate the indexed assets in a first pane, using a tree view having two integrated hierarchies of classified information. The hierarchies can be specific to a programming language or other code assets. All categories of indexed information in which a said selected element is classified is displayed in a second pane.

Abstract: An apparatus and method perform block-level sampling on a database, process the data to generate one or more matrices, and process the one or more matrices to generate a clustering factor for a selected index. In addition, the apparatus and method of the preferred embodiments allow the distribution of the clustering factor to be determined across a range, thereby allowing the identification of ranges where the clustering factor is high and ranges where the clustering factor is low. The clustering factor distribution can then be used to predict the memory paging performance of a search that uses an existing or a potential index that corresponds to the sampled data, and can therefore be used to predict the performance of searching the database using an existing or potential index for a particular database query.

Abstract: A method and system for transforming XML documents to and from data objects in an object oriented framework includes: importing the XML document; parsing the XML document; building a DOM tree from the parsed XML document; constructing at least one DDO or at least one XDO based on the DOM tree; and storing the DDO or XDO in a datastore. The present invention provides a transformation bridge connecting the XML world and the object world, allowing conversions from XML documents to data objects and vice versa to be performed seamlessly. It enhances the existing framework with a feature to process XML documents utilizing the existing framework facilities. Application developers can thus exploit the key advantages of XML representation as well as object orientation.

Abstract: Role is a comprehensive grouping mechanism. In a client-server directory system, roles transfer some of the complexity to the directory server. A role is defined by its role definition entry. Any client with appropriate access privileges can discover, identify and examine any role definition. A “managed” role is one that can be configured to provide search results similar to those available with a static grouping mechanism, i.e., to create a group entry that contains a list of members. Managed roles allow a user to create an explicit enumerated list of members. A managed role is a label stored with a directory entry.

Abstract: An adaptive digital tree data structure supports scalability by encoding type bits within unused data bits of the root pointer word or, as the population increases to support it, into an additional word. In both instances the type bits included in the word or additional word contain dataset-global data which pertains to the underlying data structure. The information contained within the dataset-global data represents the total population of the tree or the amount of memory required to support the tree which may be used to determine the global memory efficiency of the data structure.

Abstract: A method and system for utilizing metadata to search for media, such as multimedia and streaming media, includes searching for the media, receiving results, extracting metadata associated with the media, enhancing the extracted metadata, and grouping the search results in accordance with attributes of the enhanced metadata. Enhancing and grouping include adding related metadata to the database of metadata, iteratively using metadata to search for more media related data, removing duplicate URLs, collapsing URLs that are variants of each other, and masking out superfluous terms from URLs. The resultant metadata and media files are available to users and search engines.

Abstract: A computer-implemented method for mapping multiple source content schemas into a single target content schema. For each source schema to be mapped, a source class tree representing the source schema classes and a target class tree representing the target schema classes are provided for display to a user, input specifying one or more source properties within one or more source classes is received, one or more target properties within one or more target classes are determined for mapping to the source properties, and a schema map file including a mapping of the target properties to the source properties is generated. The source databases are determined. The schema map files are applied to generate information used for extracting the appropriate content from the source databases and for loading the extracted content into the target database.

Abstract: A mechanism for storing, retrieving, and querying data items or other information in the form of object instances created from object oriented programming environment.

Abstract: A global data sharing environment and data sharing proxy agent for multiple application instances in an object oriented processing system are disclosed. In response to an object in an application instance calling a data storage method, a local data sharing environment is generated that corresponds to the requesting object's application instance. As a data storage or retrieval method is processed, data is stored in or retrieved from the local data sharing environment. Data can also be shared between objects in separate application instances using the global data sharing environment.

Abstract: A method is provided for coordinating QA event schedules using a network-based system. The system includes a server system coupled to a database and at least one client system. The method includes receiving QA event data and storing the QA event data in the database. The method further includes cross-referencing the QA event data, updating the database with the QA event data and providing information in response to an inquiry.

Abstract: Multiple links to the same object are managed by storing the attributes of the object in only one place. Each directory which links to the object has an object attribute table; each table has a number of entries all capable of storing the attributes of the files linked to the directory. One of the entries in a directory linked to a file stores the attributes of that file, called the master entry; other entries in the same or other directories that also link to the same file have slave entries capable of storing the attributes but not storing the attributes in their respective object attribute table. The file need only address the master entry. The master entry may point to the other slave entries which may point back to the master or to other slave entries as determined by a pointer protocol. When the master entry is to be deallocated, another of the qualified slave entries receives the attribute information and the file is updated to reflect that a new master has been declared.

Abstract: A method and system for defining a sequence of files by placing a numerical value in the header of the file, without using an index. Newly-positioned files are positioned between existing files by the determination and assignment of a numerical value between the numerical values of the previous and succeeding existing files.

Abstract: A system and method for automatically backing up logical entity data. Filesystems within the computer system are identified and data pertaining to the filesystem is recorded to backup storage. Recorded data includes the filesystem name, size, mount points, logical volumes, and logical volume groups. The logical entity backup process records the logical volume group names, the disk identification data associated with the logical volumes, the Internet Protocol (IP) addresses that have been set for the computer system, gateway address information for accessing a gateway computer, and netmask information. The backup process backs the logical entity data to nonvolatile storage either in a removable media or to a computer network storage device that is connected to the computer system through a computer network.

Abstract: A method and system for backing up primary nodes onto backup nodes where the primary nodes can each originate a distributed transaction and can participate in a distributed transaction. The backup nodes, after a primary node failure, undo all transactions whose state is unknown on the backup node and all committed transactions which, if kept, would lead to an inconsistent set of backup nodes. First, committed transactions are undone if commits for them were not received on all back up nodes to the primary nodes that participated in the transaction. Second, all committed transactions that potentially depend on the committed transactions that were undone are also undone. Only those transactions that are provably independent of the committed transactions that were undone are kept. The result is a set of back up nodes which can support operations until the failing primary node is restored.

Abstract: A method for managing storage reclamation on a tape management system is provided. The method allows the calculation of the optimum reclamation threshold value for a given system, thereby increasing the performance of the system drastically.

Abstract: A system and method for reducing object instances and making efficient use of memory. A WeakHashMap class provided by the Java programming language is utilized to maintain a map of unique objects in memory. When a new candidate object is presented, the map is searched for an equivalent object instance and returned for use if found. If an equivalent object instance is not found, the new candidate object is unique, and is therefore added to the map. Each entry of the map stores key and value pairs. In adding the new candidate object to the map, the key portion of the entry is set to the new candidate object. The value portion of the entry is set to a weak reference which also refers to the new candidate object. Once an object in the map is no longer in use, the object is automatically purged from the memory by making use of automatic garbage collection capabilities provided by Java.

Abstract: A longest common subprefix of two binary words p1 and p2 is identified based on bit strings ip1 and ip2 which are extensions of p1 and p2, and binary words n1 and n2 that define the length of p1 and p2. The bit strings and words are processed to set a “greater” output if p1>p2 and to set an “equal” output if p1=p2. A mask having a consecutive string of most significant bits having a first logical value is constructed to identify the matching subprefixes of p1 and p2.

Abstract: An architecture component for use in performing a wavelet transform of a sampled signal, and an architecture including such components are disclosed. The architecture component includes a multiplier, and a multiplexor to multiplex a number n of filter coefficients onto the multiplier. The multiplier processes n consecutive samples with consecutive coefficients, successive multiplier outputs being stored for subsequent processing to generate an output of the filter after every n samples. The wavelet transform may be a discrete wavelet transform or a wavelet packet decomposition. The architecture component may be configured to multiplex two or more coefficients onto a multiplier. Embodiments are disclosed in which the components are derived from a parameterized description in a hardware description language.

Abstract: A floating-point ALU that performs an IEEE rounding and an addition in parallel in a simultaneous rounding method (SRM) type floating-point adder. The floating-point ALU includes an alignment/normalization section for bypassing or inverting a first fraction part and a second fraction part, performing an alignment by performing a right shift as much as a value obtained from an exponent part or performing a normalization through a left shift by calculating a leading zero with respect to the first fraction part, and obtaining a guard bit (G), round bit (R), and sticky bit (Sy); and an addition and rounding operation section for performing a addition and rounding with respect to the first fraction part and second fraction part outputted through the alignment/normalization section. According to the floating-point ALU, the processing time and the hardware size can be reduced, and the hardware of the SRM can be used as it is.

Abstract: An energy saving multiplication device and its method is disclosed. The multiplication device includes a dynamic range determination unit, a Booth encoding/decoding unit and a counter array. The dynamic range determination unit determines dynamic ranges of the numerical values to be multiplied together and outputs after processing according to the dynamic-range size relation of the input data. The Booth encoding/decoding unit couples to the dynamic range determination unit. The counter array couples to the Booth encoding/decoding unit for accumulating the partial products to obtain the products of the input data.

Abstract: An adder circuit is provided that generates the sum and sum complement (sum_) signals by constructing the logic in such a way that various levels of both N-type devices and P-type devices are both “on” at the same when that leg is to be open. The logic is then determined by another level and only one P or N type device is on at a given time. For carry and carry complement (carry_) signals a circuit is provided that is symmetrical with respect to P and N devices. The carry and carry_ signals are generated by inputting the complement signals to the same circuit used to generate the carry signal. The symmetrical P and N type devices are complementary in that associated devices are on or off with respect to each other. Both the carry and carry_ signals are concurrently output. The symmetric nature of the static, dual rail, simultaneous, sum and carry circuits will improve switching performance and minimize the floating body effect that can be found in silicon on insulator (SOI) devices.

Abstract: In a network interconnecting a plurality of content providers and a plurality of clients, for providing content to a client, each of the plurality of content providers is coupled to at least one content distribution network of a plurality of content distribution networks, wherein the client is coupled to at least one of the plurality of content distribution networks and a request for the content is sent from the client to a redirector node that receives requests, wherein a redirector at the redirector node provides an address for a server available to serve the requested content. When the client's content distribution network is a primary content distribution network for the content provider providing the requested content, redirecting the client to a server within the client's content distribution network.

Abstract: Methods and apparatus for establishing internet communication from a user to a server through a plurality of proxy servers are disclosed. The proxy servers are “chained” by establishing sessions among themselves and the user so that the benefits of more than one plural proxy server can be obtained by the user.

Abstract: The invention provides method and apparatus for an improved data processing system having an administrative control server; an administrative control database, connected to said administrative control server; and at least one group of servers having similar, but not necessarily identical, configurations adapted for communication with the administrative control server for administrative control thereby, in which the control server can change the configurations of the administered servers to a new desired configuration for each administered server where the new configuration is in synchronization with the configuration of each of said other administered server, by generating synchronization instructions from parameterized synchronization scripts stored in the control database.

Abstract: A method and system are provided for retrieving a Web page in a multiple cache networking system. Data requested to be cached by browsers is cached among a plurality of processors in a multiple cache networking system. A request for cached data is received from a browser. A determination is made as to which of the plurality of processors are operative. A load level of each of the operative processors is then determined. Each of the operative processors is queried to locate the requested cached data. An address of the operative processor having the requested cached data is outputted.

Abstract: A real time chat server (610) not only maintains the chat session but also synchronizes the browse and chat functions by dynamically linking the browser and chat applications to allow the contents of the browser window and the chat window to change in a coordinated manner. The chat server is built from a number of core software objects, namely user objects (616, 618), connection objects, and room objects (612, 614). In this way, multiple users' browsers may be connected into one powerful distributed chat/HTTP server and all such users are able to fully interact with one another in a coordinated manner via type-written messages, HTML web documents, and file transfers.

Abstract: A prepackaged object-oriented data and/or video conferencing (DVC) application programming toolkit (PK) having a number of conference control objects is provided for building customized DVC applications. Instances of these conference control objects are to be incorporated in customized DVC applications. An instance of a conference control object is used to facilitate accesses to conference management services of a local general purpose personal conference (GPPC) application, including connection management functions, extended A/V services, and data management services.