Abstract: Given a destination(s) and search criteria, the destination(s) is searched to identify files that satisfy the search criteria. For each such file, a file identifier (such a uniform resource locator (URL)) is added to a reference page. This document also describes, in one example, receiving indications of a destination to be searched and a set of search criteria and, responsive to receiving these indications, searching a destination to identify one or more web pages at the destination that satisfy the search criteria and generating a reference page that includes an identifier of each of the one or more web pages.

Abstract: An image processing apparatus, a method of creating a Web page, an image processing system, an information processing apparatus, and an information processing system are disclosed. The image processing apparatus includes a reception control part receiving a request for a Web page from a terminal connected to the image processing apparatus via a network, first storage means for storing a plurality of compressed document form information files, a decompression part decompressing at least one of the plurality of compressed document form information files in the first storage means into at least one document form data item, second storage means for storing the at least one document form data item, a Web page creation part using a document form data item in the second storage means to create the Web page, and a transmission control part sending the created Web page to the terminal.

Abstract: A computer-implemented method and apparatus of searching a plurality of queries against at least one database containing a plurality of records. The plurality of queries is partitioned into a set of smaller subsets of queries. Then at least one database is partioned into a set of smaller subdatabases. Searching tasks to be performed are designated by associating each of said subsets of queries with one or more of said subdatabases, assigning each searching task to one of a group of computers operating in parallel, wherein each member of the group of computers operating in parallel has at least one searching task assigned thereto, and executing at least some of the assigned searching tasks using the group of computers operating in parallel. Search results are collected from the executed searching tasks and a unified search result is generated in accordance with the collected search results.

Abstract: Embodiments of the invention provide methods, systems, and articles of manufacture for transforming a physical query (e.g., written in SQL) into an abstract query than can be run against an abstract database described by a database abstraction model. In one embodiment, the transformation occurs as a multiple step process: first, transformation of the physical query into an intermediate representation, such as an abstract query plan, and second, transformation of the intermediate representation into an abstract query. There are thousands upon thousands of existing physical (e.g., SQL) queries. Rather than just abandon these existing queries in favor of an abstract database, embodiments of the present invention provide for reverse query processing, that is, for creating an abstract query of the abstract database from a physical query (e.g., an SQL query) of the physical database underlying the abstraction.

Abstract: A customer relationship management (CRM) system with integrated data aggregation engine comprising a database management system (DBMS) including a relational datastore storing data in tables. An aggregation module, operatively coupled to the relational datastore aggregates the data stored in the tables of the relational datastore and storing the resultant aggregated data in a non-relational datastore. A reference generating mechanism generates a first reference to data stored in the relational datastore and a second reference to aggregated data generated by the aggregation module and stored in the non-relational datastore. A query processing mechanism processes query statements, wherein, upon identifying that a given query statement is on the second reference, the query processing mechanism communicates with the aggregation module to retrieve portions of aggregated data identified by the reference that are relevant to the given query statement.

Abstract: Retrieval conditions inputted from a plurality of users are registered. According to the retrieval conditions, a retrieval is conducted for a text inputted. As a result of the retrieval, similarity of the text is calculated for each retrieval condition. The text is delivered to users of which the retrieval condition satisfies the similarity.

Abstract: The present invention describes a method that is based on an analysis of document information, and which can be used for conducting and potentially accelerating business opportunity assessments and technology investment decisions. Documents include patent documents, scientific and trade literature, magazines, e-zines, Internet search results and the like. The system can be implemented as an automatic or semi-automatic analysis system, and it ultimately provides a document index or visual index from which technology, investment or business decisions can be drawn. The method comprises the steps of selecting a document data set for analysis, selecting one or more analysis means, such as means to determine relationships among the documents in the selected set, and then, forming a representation of the result for further analysis, display or planning.

Abstract: A method and a system for dynamically updating information for publication on the Internet. Meaningful content is extracted from information received from multiple sources such as news sources. The information can contain text, sound, images and video. A set of characterizing features for the received information is determined. Information having common characterizing features is grouped together into a number of clusters. The information obtained in the grouping step is used to determine how to publish the information contained in a cluster based on a customer request for information. This customer request can be based on a query or a customer profile assigned to the customer.

Abstract: A hierarchical database, in which a lower class inherits to a property of an super class, having a class code for each class to identify the class, includes a first classification system having a regular class, and a second classification system having the regular class and a synonymous class referring to and using the regular class of the first classification system, wherein the synonymous class has an identification information to identify it is the synonymous class, a class code of the synonymous class, and a class code of the regular class of the first classification system to which the synonymous class refers.

Abstract: A controlled database system is designed for rapid access of data records with reduced memory storage requirements. The database system employs a set of obfuscated data records stored in data crystals that can only be accessed and read by an iterator, which is not directly accessible by the users of the database. The iterator accesses information responsive to a predefined query sent from a customer application. Rather than providing general tools to customers for constructing any possible queries, such as is done in structured query language database systems, database systems embodying the present invention allow only predefined types of queries to be used by customer applications. By restricting the types of queries customer applications can call, valuable data records remain secure from unauthorized reconstruction or duplication while still allowing limited access for specific purposes.

Abstract: The techniques of the present invention involve constructing and caching a chain of FIDs that represent the directory path to a system resource. Typically a lookupname( ) service returns a handle to the object and a handle to the object's owning directory. The owning directory handle can then be used to obtain a file identifier (FID) for the owning directory. This FID constitutes the first FID in the chain and will also act as the lookup key in the cache. The process next finds the directory's parent. A FID is obtained with the parent handle. This FID is added to the chain. The process repeats until the root of the system's file tree is reached. This result is a chain or array of FIDs representing the full path name of the directory containing the accessed object. The chain begins with the directory FID closest to the accessed object and ends with the FID representing the root of the file tree. Once constructed, the FID chain which forms a binary representation of a directory path name is placed in a cache.

Abstract: Distributed information integrating method and apparatus for collecting data requested by a program at a data request side, integrating the collected data and supplying the integrated data to the request-side program irrespective of the existence of a processing device storing the data and a transmission medium. An event linking data table 232 stores the name of data to be collected in response to an occurring event and a transmission destination of the collected data. Filtering processing 222 refers to the event linking data table 232 in response to an event occurring on a self processing device and a message event received through a transmission medium to collect the data stored in the self processing device, and transmits the collected data to a transmission destination. A data integration management table 233 sets the items of data to be integrated while dividing the items for every data name of the collection data.

Abstract: A system including a browser configured to generate a request to access a content server, a dynamic proxy dynamically downloaded onto the browser, and a plurality of proxy settings located on the browser and configured to be modified by the dynamic proxy, wherein the proxy settings are modified to redirect the request to the dynamic proxy.

Abstract: A web-based plant maintenance system and method for organizing, retrieving, and displaying information relevant to plant maintenance which utilizes a database and a software application. Information relevant to plant maintenance is stored in the database. The software application utilizes the information to create a hierarchy of pages capable of being viewed in a web-browser. An end user can then access the appropriate page by navigating through the hierarchy, or by associating the web pages with design entities in a computer-aided drafting model.

Abstract: A base table is scanned with a delete marker and an insert marker. The delete marker identifies a last change committed to the base table as part of a transaction prior to execution of a statement, and the insert marker identifies a last change committed to base table as part of the transaction during execution of the statement. The results of the delete marker scan are filtered with deletions stored in a delta table, and a delete table is populated with the filtered rows. The results of the insert scan are filtered with insertions stored in the delta table, and an insert table is populated with the filtered rows.

Abstract: A storage system implements a storage operating system configured to concurrently perform speculative readahead for a plurality of different read streams. Unlike previous implementations, the operating system manages a separate set of readahead metadata for each of the plurality of read streams. Consequently, the operating system can “match” a received client read request with a corresponding read stream, then perform readahead operations for the request in accordance with the read stream's associated set of metadata. Because received client read requests are matched to their corresponding read streams on a request-by-request basis, the operating system can concurrently perform readahead operations for multiple read streams, regardless of whether the read streams' file read requests are received by the storage system in sequential, nearly-sequential or random orders.

Abstract: A system and related techniques and data structures present a Web based or other client application or service with a relational node structure to access, store and manipulate XML-based or XML-compliant data. Unlike unmodified XML information for instance stored in document object model (DOM) format, the inventive platform may load a relational node structure encapsulating XML-compliant information in an organized structure having pointers to next peer, parent, child and other links to related or unrelated information. Searching, querying and other operations may therefore be made more efficient since an entire tree structure need not be exhaustively traversed to locate desired data, but instead sorted via those relational linkages. Client applications such as Web browsing, email, contacts managers, calendars and others may therefore operate on XML or XML-compliant data without the loading or performance disadvantages which conventional XML platforms may incur.

Abstract: A system and method for representing a very large dataset that enables a plan manager to define, based upon an organization modelling object, a delegation modelling object for a very large dataset. A very large dataset delegation of multiple subplans is created whose subplans can then be individually filtered for specific size restrictions. This enables a plan manager to filter the definition of each subplan prior to the execution of the delegation modelling object, precluding any need for higher-level subplans to contain all the data contained in their subordinate subplans. This allows subplans to contain increased levels of detail not included in their superior subplans, detail that will instead only be summarized in higher-level subplans. A subsequent consolidation process will then extract data not found at higher levels from each delegated subplan, and return that data to its original dataset.

Abstract: A system and method for managing contract data. A contract dataset is received by a decentralized execution system (DES) from a procurement contract management system (PCMS). The contract dataset is passed through a software filter that determines whether to store the contract dataset or a portion thereof in a relational database that includes contract datasets, vendor datasets, and purchase item datasets. If the software filter determines not to so store the contract dataset or the portion thereof, then the software filter determines whether to store the contract dataset or a portion thereof in a special database of the DES. An execution document at the DES is updated by replacing an existing attribute value of the execution document by a new attribute value communicated to the DES by the PCMS. Additionally, a contract is archived if each such DES sends permission to the PCMS to archive the contract.

Abstract: A knowledge discovery apparatus and method that extracts both specifically desired as well as pertinent and relevant information to query from a corpus of multiple elements that can be structured, unstructured, and/or semi-structured, along with imagery, video, speech, and other forms of data representation, to generate a set of outputs with a confidence metric-applied to the match of the output against the query. The invented apparatus includes a multi-level architecture, along with one or more feedback loop(s) from any Level N to any lower Level so that a user can control the output of this knowledge discovery method via providing inputs to the utility function.

Abstract: A system that incorporates an interactive graphical user interface for visualizing clusters (categories) and segments (summarized clusters) of data. Specifically, the system automatically categorizes incoming case data into clusters, summarizes those clusters into segments, determines similarity measures for the segments, scores the selected segments through the similarity measures, and then forms and visually depicts hierarchical organizations of those selected clusters. The system also automatically and dynamically reduces, as necessary, a depth of the hierarchical organization, through elimination of unnecessary hierarchical levels and inter-nodal links, based on similarity measures of segments or segment groups. Attribute/value data that tends to meaningfully characterize each segment is also scored, rank ordered based on normalized scores, and then graphically displayed.

Abstract: A prefix expression tree showing an expression can be supplemented to also display the expression in infix notation. In one embodiment, the present invention includes displaying an expression being capable of representation in infix and prefix notation in prefix expression tree format. In one embodiment, the expression includes a plurality of operators and operands, and the plurality of operands make up the leaves of the expression tree. In one embodiment, the present invention further includes inserting a plurality of infix operators corresponding with the plurality of operators into the prefix expression tree, wherein, the plurality of operands and infix operators represent the expression in infix notation.

Abstract: An electronic calendar includes such features as recurring reminders, dividing unpredictable work loads into equal pieces, template free parsing, a reminders scheduling algorithm to reduce spikes, dynamic delivery and recovery algorithms, methods for splitting the work load between controllers and workers and for monitoring progress, all within the context of a calendar architecture for a large enterprise.

Abstract: Managing data collection for one or more scheduled alert messages. A primary or backup poller manager coordinates any number of poller services to access content and generate the alert messages. At a predefined period the poller manager is informed that an existing or new poller service is available for work. The poller manager provides a query to the poller service to access content in which one or more users have expressed an interest. Querying for a large number of users can be subdivided among the poller services. The poller service can also automatically expand the query if it yields insufficient content. The poller service generates the alert messages for the interested users and informs the poller manager when done. A change in content can be used to generate or update alert messages before their scheduled delivery. The poller manager prioritizes processing with a quality of service level.

Abstract: The creation of multiple recoverable units within a database allows a database partition to be reconstructed during maintenance and disaster recovery operations. A method of creating a recovery unit includes partitioning a database into at least two recovery units. A primary catalog of metadata relating to the logical elements of a database such as tables, indexes, and file groups is created. A secondary catalog of metadata relating to the physical elements of a database such as pages, files, B-Trees, and log streams is created for each recovery unit. The primary and secondary metadata catalogs are linked such that only one log stream is associated with any one recovery unit. A single recovery unit may then be exercised to perform recovery or maintenance operations while the remaining recovery units of the database remain online.

Abstract: Methods and systems for extracting related information from multiple two-dimensional files are provided. The method includes comparing data contained in at least one field of each record of a first file to data in a related field of each record of a second file. A record is created in a temporary file for each occurrence of a match. The records of the temporary file contain the data from the matching records of the two files. Particular data is selected from the records of the temporary file according to user-specified conditions. The selected data is provided as output. The temporary file is thereafter deleted. In another embodiment of the invention, particular data is selected from the original files prior to inclusion in the temporary file. Associated systems are also provided.

Abstract: Techniques are provided for determining which data item version to supply to a query. According to the techniques, the determination is made by associating a new field, which indicates the time a data item version was current, with each data item version; associating a new field with each query, which indicates the last change that the query must see made by the transaction to which the query belongs; and determining which data item version to use to answer the query based, in part, on a comparison between the values of the two new fields.

Abstract: The risk of inadvertent introduction of software bugs to a large number of users during a software update is minimized by controlling updates using a uniform mechanism of sending updates to seed users. A value-generating module generates a value for a computer, the value falling within a population range of values. A sampling range-generating module generates a sampling range of values as a proper subset of the population range, the probability of the random value falling within the sampling range being predetermined. An eligibility determination module determines whether the computer is eligible to receive a software update, the computer being determined eligible when the random value for the computer falls within the sampling range, and an update module provides the software update to the computer based on the eligibility determination. In some embodiments, a problem review module determines whether the update has caused a problem for computers receiving the update.

Abstract: A technique is provided to restore a target object such as a volume, directory or a pre-defined collection of files to a particular time by restoring the last full backup embodying the backup target, the last computed cumulative backup embodying the backup target and possibly the incremental backups after the last computed cumulative backup, if there are any that relate to change in the backup target. Restore operations in a bounded amount of time are accommodated by effectively managing the generation of full, incremental and cumulative backup files. Advantageously, the technique may be performed off-line for the analysis, collection and management of backup file subsets for different types of restore operations.

Abstract: Systems and methods for performing an on-demand determination of a correct set of volumes to be exported are described. A disk platter is defined to be the unit of volume migration. Volumes are added to the platter based on whether or not the volume coexists on a disk containing a volume to be exported.

Abstract: A quantum gate for running a Grover's quantum algorithm using a binary function having a vector basis of n qubits is provided. The quantum gate includes a superposition subsystem, an entanglement subsystem and an interference subsystem. The interference subsystem performs an interference operation on components of entanglement vectors for generating components of output vectors. The interference subsystem performs the interference operation in a very fast manner by using an adder receiving as input signals representing even or odd components of an entanglement vector, and generating a sum signal representing a weighted sum with a scale factor of the even or odd components.

Abstract: A microprocessor that includes a random number generator (RNG) and an instruction for storing random data bytes generated by the generator. The RNG includes multiple buffers for buffering the random bytes and counters associated with each buffer for keeping a count of the number of bytes in each buffer. The instruction specifies a destination for the bytes to be stored to. In one embodiment, the number of bytes written to memory is variable and is the number of bytes available when the instruction is executed; in another, the instruction specifies the number. If variable, the instruction atomically stores a count specifying the number of valid bytes actually stored. In one embodiment the destination is a location in system memory. The count may be stored to memory with the bytes; or the count may be stored to a user-visible register. An x86 REP prefix may be used.

Abstract: A digital filter includes a data storage section, a filter coefficient storage section, a multiplier, an accumulative adder section, a data output section and a control section. The data storage section stores the latest multiple input data for every channel and outputs the stored input data in response to a selection signal. The filter coefficient storage section stores predetermined filter coefficient corresponding to the multiple input data. The accumulative adder section adds the result of multiplication of multiple data from the multiplier for every channel. The data output section holds the result of addition in the accumulative adder section and outputting output data.

Abstract: In a method for performing a multiplication operation between a first operand and a second operand the multiplication operation is divided into at least two suboperations. At least one of the suboperations is performed in a time-interlaced manner, wherein the at least one suboperation is further divided into partial suboperations so that each partial suboperation is initiated at a different time.

Abstract: Described herein is a method that includes storing partial quotients of a continued fraction in a first set of counters, initializing a second sets of counters with counter values, decrementing a target counter in the second set of counters to obtain a decremented counter value, and outputting a value that corresponds to a partial quotient in a first counter in the first set of counters. The value is based on the decremented counter value.

Abstract: Methods and system of sharing information among network servers coupled to a data communication network for providing services to a user via a client on the network and data structure for use therewith. Related services provided by the network servers are grouped into service groups. A database stores user-specific information, including operational information to be shared within the service groups. A central server coupled to the network receives a request from the user for a selected service and determines whether the selected service belongs to one of the service groups. In response to the request, the central server retrieves user-specific information identifying the user with respect to the selected service. The retrieved information includes operational information to be shared within each of the service groups to which the selected service belongs.

Abstract: A consistent time service that provides a method of maintaining deterministic clock-related operations for a group of replicas in a fault-tolerant distributed system. A consistent clock synchronization algorithm is utilized that yields a single consistent group clock for the replicas in the group, and does not require synchronization of the underlying physical hardware clocks. The consistent group clock ensures the determinism of the replicas in the group with respect to clock-related operations, is monotonically increasing, has bounded increment, skew and drift. The consistent time service provides benefits for active replication during normal operation, as well as passive replication and semi-active replication to ensure a consistent monotonically increasing clock when the primary replica fails and a backup replica takes over as the new primary replica.

Abstract: A system and method for integrating terminal-based legacy mainframe applications through data stream objectification into a distributed object system. The mainframe application's terminal data stream is reinterpreted as a set of well-defined state objects representing any identifiable portion or accumulation of either terminal commands or data within the data stream. The state objects are combined with a set of state transition rules to create a finite state machine, which accurately describes the behavior of the application, the application of all existing busing logic, and access to all the data elements. Any required set of data elements can then be defined and either accessed or updated through a variety of methodologies without redefining, re-implementing, or migrating any existing data or business rules.

Abstract: A system is described for transferring and displaying data over a network. The system includes a client and a server. The client includes a client application to operate in a network environment. The server includes a server application to provide streaming data, snapshot data and historical data via the network. The client application and the server application maintain a connection to each other. The client application provides a plurality of interactive data display, manipulation components, and screen layout preferences.

Abstract: A content-provider entity provides content to media channels established in respect of a network communication session. The content-provider entity has a transport subsystem for establishing media channel connections to a session transport mechanism in accordance with channel type and connection details received by the entity. The content-provider entity also has a media subsystem providing a respective media handler of appropriate type for each media channel connection established by the transport subsystem. Each media handler is responsible for delivering media content of its associated type from a media source to the corresponding channel connection. A delivery controller of the media subsystem controls the selection and delivery of media content through the media handlers in dependence on context data supplied to the content-provider entity.

Abstract: A session manager within an application server may maintain multiple sessions with a plurality of network users, where the network users may be remote from the network. The session manager may provide the remote users with a selection of network resources, by adding a connection to the network resources to an application requested by one or more of the users. In this way, pre-configured applications may be used to provide remote network resource usage. Examples of network resources which may be provided in this manner include remote printing, multi-user collaboration sessions, and remote data storage.

Abstract: A message database server receives a message request from an application program and returns a confirmation or error status to the application program after attempting to store the message information contained in the request to a data store. The data store may be maintained by the message database server or by a queuing system. A message server obtains the message information from the data store for transmission through either a pull or push methodology. In one aspect the message data store contains a set of personalization tags and an identifier for a message template that contains the text of the message to be sent. The message server creates the message by retrieving the message template specified by the identifier and filling in variables in the text in the template with the appropriate personalization tags.

Abstract: A method of notifying a user of an electronic communication system is disclosed. The method comprises the steps of: providing an electronic message including address data to an electronic communication process in execution within a computer system; identifying the address data within the provided electronic message; comparing address data within the provided electronic message with further address data stored on the computer within an address list; providing a notification to the user associated with the electronic message when a result of the comparison indicates that at least some of the identified address data is other than within the further address data, the notification other than a prompt to add the identified address data to the further address data.

Abstract: In general, an interface is provided to the user of an instant messaging client program. The interface displays the user's buddies in a manner that identifies one or more buddy groups, and the membership of buddies within one or more of those buddy groups. The user may use the interface to set customized away messages on a buddy group basis, or otherwise.

Abstract: In a content distribution system, content distribution control server, content transmission processing control method, content transmission processing control program, content transmission processing control program storage medium, content transmission device, content transmission control program, and content transmission control program storage medium, content can be reliably transmitted in accordance with the communication environment of a user terminal. A live casting server 150 of a server reservation control center 5 limits the number of streams by which the user PC 4 performs the parallel transmission of a plurality of live content at different transmission rates, in accordance with the type of circuit, which can previously prevent the user PC 4 from performing the parallel transmission of live content using the untransmittable number of streams, thus making it possible to reliably transmit the live content in accordance with the communication environment of the user PC 4.

Abstract: In a client server system, the network load is reduced by using the fingerprint compression and the differential compression, by providing the proxy server at the server side and using the general purpose browser at the client side, without requiring a separate proxy server at the client side. The client downloads and installs a fingerprint cache processing engine as a plug-in.

Abstract: A data transaction processing system in which transaction data is entered by the user in response to prompts in a template which is tailored to each user application. The template and entered data are accumulated into data transactions which are immediately transmitted upon completion to an external database server for processing and storage. The data transactions are not locally stored for processing, and no conventional operating system is necessary. No local processing needs to be provided, and the only local storage is a flash PROM which stored the control firmware, a flash memory which stores the data streams making up the forms and menus, and a small RAM which operates as an input/output transaction buffer for storing the data streams of the template and the user replies to the prompts during assembly of a data transaction.

Abstract: A communication system for guaranteeing only one each of two processing operations, correlated with each other and executed on different devices. A server has a unit which, on receipt of a first processing request, with identification information, executes this processing only once for one item of the identification, and a unit for transmitting a first processing completion notice to the transmission source of the processing request on completion of the first processing or on re-receipt of the processing request for the first processing with the same identification of the completed first processing. The client has a server, a unit for transmitting the processing request for first processing with identification information, a unit for executing a second processing, previously correlated with the first processing, on receipt of the completion notice, and a unit for re-transmitting a processing request on detection of an error before receipt of a transmitted completion notice.

Abstract: A system providing a user interface to annotate different items in a media production system such as in a digital non-linear post production system. Parts of the production, such as clips, frames and layers, that have an associated annotation are provided with a visual annotation marker. The annotation marker can use shape, color or animation to convey source, urgency, status or other information. Annotations can be text, freehand drawing, audio, or other. Annotations can be automatically generated. Annotations can be compiled into records, searched and transferred. A state of an application program can be stored and transferred to a remote system. The remote system attempts to recreate the original state of the application program. If the remote system is unable to do so, an image of the state of the application program is obtained, instead. Assignment of control to various functions of an application program is achieved by associating a function (i.e.

Abstract: Respective WWNs (World Wide Names) which can be allocated to a plurality of computers, business application identity information of programs to be booted and area identity information, of areas in a storage system in which the programs are stored, are associated and stored. In response to the entry of a boot request including the business application identity information of a designated computer to be booted, the WWN and the area identity information corresponding to the business application identity information are sent to the computer in order to boot the program. In the computer, the sent WWN is set and the area identity information is set as the area to be booted. Subsequently, by means of a restart of the computer, the program stored in the area is booted to operate.