Abstract: A method including storing content in a computer database, the content having a plurality of components. The method further comprises associating each of at least some of the content components with at least one of a plurality of codes (such as ICD or CPT codes) in a manner so that each of the plurality of codes employed has at least one of the content components associated therewith, and providing a retrieval system accessible by a user using the Internet. The retrieval system is adapted to retrieve the content components associated with any one of the codes upon receiving a signal sent by the user. The signal corresponds to said any one of the codes. The content components associated with said any one of codes are sent to the user upon receiving the signal.

Abstract: Systems and methods for organizing a structured query language statement execution plan to increase the efficiency of a computer device in executing the statement. A data structure is created in computer memory that encodes information about a database statement execution plan (e.g., an SQL statement). The information is arranged in a specific logical structure and may be displayed graphically as a query diagram. The data structure is used in optimizing the SQL statement execution plan so as to merge joined tables to enable efficient optimization. Furthermore optimized SQL execution plans in accordance with the present invention proportionally scale with the number of rows returned from a query, do not depend unnecessarily on potentially unavailable central resources (e.g., sort space), scale in the event that optimizer statistics and assumptions are poor, and make use of processing and memory resources.

Abstract: An incremental search engine method, performed on a server computer system connected to a network, is disclosed. The method allows to provide incremental search results to a large number of users in a timely and efficient fashion, facilitating the discovery of new information on the Internet or in corporate intranets. Users submit queries, which are stored on the server computer system. Once a query has been submitted, it is automatically checked against any new or modified documents retrieved from the network by a difference crawler, and new matches are presented to the submitter of the query. In the case of modified documents, only the novel portion of the document is considered for determining the new matches.

Abstract: A system and method for performing click stream analysis is described. In one implementation, a Web log is processed to reconstruct a visit made by a user to a Web site. The Web log contains records representing actions performed by the user during the visit including any actions that may be designated a commerce event. A sequential identification is assigned to each record and the sequential identification is stored with the associated record in a database. Any records representing actions performed by the user that are designated as a commerce event are identified. The database is queried for a certain quantity of records representing actions performed by the user prior to and/or subsequent to the commerce event, based on the sequential identification assigned to each record.

Abstract: A CAM memory for searching Words of variable size, that may be divided into Comparison Units of different sizes, each containing a string of Subwords. The positions of the Subwords at both ends of a Comparison Unit are selected by means of Command Signals. Consequently, words of the data to be searched of any size may be stored contiguously in the Words of the Memory such that all of the Memory may be used for storage and searching. The number of Searching cycles and the time required for finding the position of a word of data is significantly reduced. The Match Signal from a Subword is put out as a Word Match only where the whole string of preceding Subwords of the same Comparison Unit have set Match Signals and the subsequent Command Signal has been set.

Abstract: Information is obtained from a database based on a query from a wireless subscriber's device that does not support direct communications with the database. A first e-mail message containing the first query is received at a workstation. Determined from the first e-mail message are the address of the first subscriber, whether the subscriber has a limited bandwidth capability, and the requested information by the subscriber. A response to the requested information is obtained from a database. The response is parsed in accordance with predetermined rules to limit the amount of data contained in a second message if the subscriber has been determined to have a limited bandwidth capability. The second message is transmitted to the first subscriber's address.

Abstract: A home page automatic update system includes home page management means for reading out an HTML document from a home page database in response to a request from a user terminal, and transmitting the readout HTML document to the user terminal, patrol search means for extracting update data by executing in turn a reception process of a mail message stored in a mail server, an extraction process of update data of an HTML document stored in the home page database, a file search process in a personal computer, and a search process of schedule data in a storage device on the basis of a priority order, and banner data generation means for generating update HTML data on the basis of the extracted update data. The home page management means transmits an HTML document which contains the update HTML data generated by the banner data generation means to the user terminal.

Abstract: A system and method for computerized searching for desired information from a corpus of information are provided. In one embodiment, a query for desired information is received by a synonymic search application. Also received is input tuning the amount of synonymic broadening to be applied to the received query for constructing a synonymic search query to be utilized for searching for the desired information. In another embodiment, a synonymic search application performs a synonymic search query for desired information from a corpus of information, wherein the synonymic search query comprises a plurality of queries that are synonymous in meaning. Identification of resulting documents responsive to each of the plurality of queries is received, and such received documents are ranked based at least in part on a weighting assigned to each of the plurality of queries.

Abstract: A computerized list is provided with auxiliary pointers for traversing the list in different sequences. One or more auxiliary pointers enable a fast, sequential traversal of the list with a minimum of computational time. Such lists may be used in any application where lists may be reordered for various purposes.

Abstract: The invention provides a system and method for defining a schema and sending a query to a Similarity Search Engine to determine a quantitative assessment of the similarity between an anchor record and at least one search record. The invention makes a similarity assessment in a single pass through the target records having multiple relationship characteristics. The Similarity Search Engine is a server configuration comprising a Gateway for command and response routing, a Virtual Document Manager for document generation, a Search Manager for SQL statement generation, and one or more Database Management Systems for data persistence and retrieval, and access to User Defined Functions. By locating the scoring and aggregation functions in remotely located User Defined Functions embedded within Database Management Systems, network and Search Manager activity is greatly reduced.

Abstract: A data prediction method using a computer including a first memory which stores a rule showing the relationship between observation data obtained by observing an event in a first region and first attribute data representing geographical features at the observation point of the event; and a second memory which stores geographical information data on a second region different from the first region, comprises:

Abstract: A method for sorting permutations using reversals for matching genomic evolution or other permutations. The sorting method includes steps to set up a data structure for storing the permutations, assigning symbols to match the permutation elements, and isolate the contiguous sections within the data structure. The corresponding sections are then reversed and the symbols changed in order to sort the permutations recursively until all symbols are contiguous.

Abstract: The present invention relates to an information processing system and an information processing apparatus and method by which the operability in connection to a network can be improved. A camcorder 11 establishes a connection to a network system 14 through a Bluetooth adapter 12 and a public network 13, performs user registration into the network system 14 and receives provision of an ID and a password from the network system 14. The ID and the password are transmitted to and registered into a customer database 52 of an Internet service provider A 17, and also transmitted to and registered into a camcorder image station 41 of a network service business center 15. When the camcorder 11 establishes a connection to the network system 14, when the camcorder 11 establishes a connection to the Internet service provider A 17 and when the camcorder 11 establishes a connection to the network service business center 15, the common ID and password can be used.

Abstract: A method and a system for verification and identification of individuals using a biometric means and other system-related means that depend on a hierarchical database of stored or acquired information for large-scale population ingress and egress in any secured environment.

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: In order to annotate digital images that are presented for viewing in a plurality of organizational structures provided by different application programs run on a common operating system, a selected application program is opened, thereby selecting a particular organizational structure and displaying the digital images associated therewith according to a view provided by the organizational structure. Such organizational structures include hierarchical, time-line and album structures. An annotation routine is provided that operates as a layer of the operating system for listing potential labels that may be associated with a digital image. Because of its relationship to the operating system, the annotation routine is available concurrently with currently displayed images regardless of the application program that is currently open. Then a label is easily appended to a digital image appearing among the currently displayed images without having to open any application for that purpose.

Abstract: According to the present invention there is provided a method for establishing a data warehouse capable from a plurality of source databases including at least one relational database and at least one object-oriented database, comprising the steps of: integrating the schema of said plurality of source databases into a global schema, including resolving semantic conflicts between said source databases, and establishing a frame metadata model for describing data stored in said local databases, said frame metadata model including means for describing any constraints developed during schema integration and further including means for describing relationships between data stored in local object-oriented databases.

Abstract: In general, one embodiment of the invention involves a secure platform comprising a processor and a first memory containing a plurality of components. These components include at least a first core component and at least one platform-based component associated with the first core component. Under control by processor, pre-boot authentication is sequentially performed on the core components prior to passing control of the pre-boot authentication to that core component. Each core component authenticates platform-based components associated therewith.

Abstract: A value-add software component of an application registers as a deletion objector in order to help determine whether or not to delete an object from an object database in the application. A user interface (UI) component in the application receives a request from the user to delete one or more selected objects from the database, and notifies the deletion objector of the received deletion request. In response, the deletion objector notifies the UI component whether or not the selected objects should be deleted based on any dependencies the deletion objector has built on the selected object(s) in the deletion request. The deletion objector's response to the deletion request may indicate either that the selected objects should be deleted, the selected objects should not be deleted, or that the user should be warned of certain consequences before the selected objects are deleted.

Abstract: The method and apparatus is utilized in order to generate a persistent path to a SCSI device for a host. In an embodiment, a SCSI device is queried for path information related thereto, and if path information is returned, a SCSI command requesting identifier data is issued to the SCSI device. The identifier data is used to determine a unique identifier (UID), from which is generated a UID-based device file for the SCSI device that is independent from the path information.

Abstract: A method and arrangement, for use in a system having a host and one or more small computer system interface (SCSI) devices, are described for enabling a user application accessing the system to communicate with one or more of the SCSI devices. The method and arrangement serve to overcome a device node limitation observed in standard Linux, which limits the number of devices a user application may communicate with to 128 SCSI disk (sd) devices or 256 SCSI generic (sg) devices. The method and arrangement provide a pass through capability by allowing the user application to directly talk to any SCSI device by using virtual handles, thereby overcoming the device node limitation observed in standard Linux.

Abstract: The method and arrangement are utilized in order to dynamically detect one or more SCSI devices on a Linux host. The method includes issuing a first command to return an actual number of host that are currently installed in a Linux system, and a maximum number of buses and targets supported by the Linux system. To all hosts, buses and targets returned in response to the first command, a second command is issued, but is issued only to a logical unit number zero (lun(0)) of each returned target. The second command prompts each responding lun (0) to report all luns known to the target. For each reported lun, a new device structure is created, in real time, with each new device structure representing a detected SCSI device.

Abstract: A file archive system for storing multiple files and directories as a single file. The file archive system could be used on a hand-held computer or other computing device. The file archive system in a preferred embodiment has an operating system with a loadable file system. In another embodiment, the file archive system includes a file archive structure for storing multiple files as a single file.

Abstract: A metadata tree structure having a plurality of nodes (slabs), each node containing a MD table. Each of the MD tables has a plurality of entries. Each of the entries in the MD tables represents a contiguous range of block addresses and contains a pointer to a cache slot storing a date block corresponding to the block address, or an indicator to indicate that the corresponding data block is not stored in a NVRAM cache slot. Each MD table also contains a block address range indicator to indicate the contiguous range of block addresses, and at least one pointer to point to any parent or child nodes. In an alternative embodiment, the pointer of each MD entry may point to a disk address if the data is not in cache. For such an embodiment, portions of the MD store may be stored to disk.

Abstract: The present invention relates generally to the classification of items into categories, and more generally, to the automatic selection of different classifiers at different places within a hierarchy of categories. An exemplary hierarchical categorization method uses a hybrid of different classification technologies, with training-data based machine-learning classifiers preferably being used in those portions of the hierarchy above a dynamically defined boundary in which adequate training data is available, and with a-priori classification rules not requiring any such training-data being used below that boundary, thereby providing a novel hybrid categorization technology that is capable of leveraging the strengths of its components.

Abstract: A method for adjusting a data set defining a set of process runs, each process run having a set of data corresponding to a set of variables for a wafer processing operation is provided. A model derived from a data set is received. A new data set corresponding to one process run is received. The new data set is projected to the model. An outlier data point produced as a result of the projecting is identified. A variable corresponding to the one outlier data point is identified, the identified variable exhibiting a high contribution. A value for the variable from the new data set is identified. Whether the value for the variable is unimportant is determined. A normalized matrix of data is created, using random data and the variable that was determined to be unimportant from each of the new data set and the data set. The data set is updated with the normalized matrix of data.

Abstract: Techniques for executing database commands include receiving a database command that includes an XML component operation that operates on an XML construct that is based on a first set of one or more relational database constructs. It is determined whether the XML component operation can be transformed to a relational database operation on a particular set of one or more relational database constructs of the first set, which does not involve the XML component operation. If it is determined that the XML component operation can be transformed, then the XML component operation is rewritten as a particular relational database operation that operates on the particular set and that does not involve the XML component operation. The particular relational database operation is evaluated. In another aspect, techniques include determining a primitive set of XML generation operations and replacing non-primitive XML generation operations with one or more operations from the primitive set.

Abstract: The present invention relates to a method for scheduling of packet data of at least one packet data flow in a packet data network, said at least one packet data flow passing through a buffer memory (1, BUF_1, BUF_i, BUF_N), allocating said at least one packet data flow to be output from said buffer memory, detecting the lapse of a predetermined time period (Tmax), during which said allocated packet data flow is to be output, outputting said packet data flow during the predetermined time period, characterized in that upon detecting the lapse of said time period (Tmax), extending said time period (Tmax), during which said allocated packet data flow is to be output, to an extended time period (k*Tmax), dependent on the data amount remaining in said buffer memory at said detection and an output rate of said packet data flow. Also, the present invention relates to a correspondingly adapted packet data scheduler.

Abstract: A virtual databank object generated from one or more databanks, whereas said virtual databank object itself can be queried like any other databank, said method comprising: a member definition module for defining a virtual databank object as a combination of one or more member databanks forming the constituents of said virtual databank, whereas said virtual databank object itself in its behaviour resembles a member databank and can be queried by a user query like one of the member databanks forming its constituents, whereas when said virtual databank object being queried by a user query its member databanks receive said user query and return a first result set, said virtual databank object further comprising; a definition module for defining a query to be applied to said one or more member databanks which form the constituents of said virtual databank, said query when being executed returning a second result set formed by a subset of the entries of said one or more member databanks, said definition module modu

Abstract: In an information processing apparatus connectable to a terminal through a network, a terminal type of the terminal is specified based on a first request requesting Web information, said first request sent from the terminal through the network, and reference Web information is generated so as to include reference path created by adding terminal type information showing the specified terminal type to a path indicated in the first request for accessing the Web information and to allow the terminal to automatically accesses to the reference path. Then, the reference Web information is sent to the terminal as a response with respect to the first request, and a second request for requesting the Web information specified by the reference path is received.

Abstract: In a method for generating a stand-alone multi-user application from a user-defined spreadsheet logic, the user-defined spreadsheet logic is analyzed and at least one source code module is derived from the analyzed user-defined application logic. The resulting application runs independently from the original spreadsheet and offers functionality for integrating multiple users and multiple report entities over a network, such as the Internet.

Abstract: A method for presenting content from the page in a distributed database. In a preferred embodiment, a server receives a request from a client for a page from the database wherein the page has a plurality of links to linked pages in the database. The server retrieves the page and generates a set of thumbnails of the linked pages in the database. The server then sends the page and the set of thumbnails to the client.

Abstract: A method and system for information management are described. A document is stored in a central document repository. A community associated with the document is determined and the community is notified of the document. Feedback is received from the community based on the document and an updated document is generated based on the feedback. The updated document is approved based on an approval process. An incentive technique to be associated with the document is determined based on the document and the community and a decision process to be associated with the document is determined.

Abstract: A computer-implemented method and system are provided for storing selected e-mails, including the content of the e-mail and attachments, in a document management system. A user initiates storage of the e-mail by a user-actuated control that is added to the interface of his e-mail application. The e-mail is then copied, indexed and stored in a separate document in the document management system, and attachments to the e-mail are embedded in the separate document. The font and graphics of the e-mail may be stored in the separate document as they as they appeared in the original document. The text of the e-mail may be stored in the binary format that is native to a word processor associated with the document management system.

Abstract: The present invention is a method for integrating a file system with a RAID array that exports precise information about the arrangement of data blocks in the RAID subsystem. The file system examines this information and uses it to optimize the location of blocks as they are written to the RAID system. Thus, the system uses explicit knowledge of the underlying RAID disk layout to schedule disk allocation. The present invention uses separate current-write location (CWL) pointers for each disk in the disk array where the pointers simply advance through the disks as writes occur. The algorithm used has two primary goals. The first goal is to keep the CWL pointers as close together as possible, thereby improving RAID efficiency by writing to multiple blocks in the stripe simultaneously. The second goal is to allocate adjacent blocks in a file on the same disk, thereby improving read back performance. The present invention satisfies the first goal by always writing on the disk with the lowest CWL pointer.

Abstract: The method, system, and program product enable a receiving-side user to speedily obtain important information in tree-structured documents even if the size of the received tree structure is large. This is accomplished by setting a node priority with respect to each of nodes of a tree-structured document. The priority is set based on the basis of the importance of an information portion presented from the node to a receiving-side user. Node stream generation means generate a node stream in which nodes and/or subtrees of a tree-structured document to be transmitted are arranged in sequence according to node priorities. Transmitting means send the node stream to tree-structured document receiving apparatus via a network. In tree-structured document receiving apparatus, extraction means extract the nodes and/or subtrees in the node stream according to the sequence of arrangement, and reconstruction means add the nodes and/or subtrees in the extraction order to the tree-structured document under reconstruction.

Abstract: A method, computer program product, and media player for creating a playlist from a database of output files. The method involves obtaining a database containing at least two fields corresponding to descriptors of the output files. The basic embodiment assigns a rating descriptor, corresponding to the aesthetic quality of an output file to the user, to one of the database fields and assigns a time descriptor, which records the time of a file's most recent execution, download, modification, or other relevant time based value, in another of the database fields. The output files are then organized into the playlist based upon the output file's rating descriptor, time descriptor, or both.

Abstract: A system and a method that vocalizes real estate text based content information from real estate web sites, portals, and multi-listing service databases or any other method of collecting and storing real estate listing content, and connecting the user to the party representing the real estate. A call reception application accepting a call from a user, querying the user for specific real estate criteria, accessing real estate databases, and communicating the text-to-speech converted real estate information to the user via a telephone connection or to a user specified facsimile number or wireless device.

Abstract: A method for composing and transmitting, and method for receiving and looking-up an electronic message which enable an operator to simply interact with a computer provided with a visualiser or a display, so as to enable electronic documents visualizable by informatic programs not included in the computer to be visualized, thereby allowing a noticeable reduction of any infomatic virus diffusion. Instruments needed to perform such methods and the apparatus by which the methods are performed are also disclosed.

Abstract: It is an object of the present invention to provide a display device with which a photographing state of image data can be intuitively known. When a subject is photographed, a quadrangular flag mark representing a photographing point of an image, and a triangular mark and a circular mark of solid lines representing a photographing range, are displayed on a map. A user can download a desired image associated with the marks by clicking the marks. When a subject is not photographed, a triangular flag mark representing the photographing point of the image, and triangular marks and circular marks of broken lines, are displayed on the map. The user can upload necessary images on the basis of the marks.

Abstract: The present invention provides a system and method for utilizing profile information to set and maintain general and applications settings. In architecture, the system includes a computer device for performing the operation. The computer device comprises an operation module that determines an operation type and a setting module that determines the set of setting to perform the operation on the computer device. Moreover, the computer device further comprises an acquisition module that acquires the set of setting to perform the operation on the computer device. The present invention can also be viewed as a method for utilizing profile information to set and maintain general and applications settings. The method operates by (1) determining the operation on the computer device; (2) determining the set of setting to perform the operation on the computer device; and (3) acquiring the set of setting to perform the operation on the computer device.

Abstract: A plurality of fragment data and a plurality of fragment configuration information, created one for each fragment data, to concatenate the plurality of fragment data in a receiving side to generate structured data having a tree structure are received. Each piece of fragment configuration information includes reference information having identification information identifying corresponding fragment data from the plurality of fragment data and position information on the connection position of the corresponding fragment data in the generated structured data. The received fragment data is concatenated to generate structured data based on the position information and the reference information included in the received fragment configuration information.

Abstract: Databases store therein CAD drawings which different manufacturers have. Other databases store therein equipment specifications. All the databases are connected to a user terminal via a communication line. Data stored-destination address information is inputted to designate information on the CAD drawing or the equipment specification, from a user terminal, and one of the databases is searched based on the data stored-destination address information, thereby selecting the information on the CAD drawing or the equipment specification is selected from one of the databases, corresponding to the data-stored destination address information, based on the search.

Abstract: A method and system are described for reducing search for data in a directory scheme employing hash tables. The method involves compacting directory entries in a manner in which the directory entries will gradually migrate and concentrate at the highest level hash tables which coincide with early blocks in a hash table sequence representing the directory.

Abstract: A system and method for synchronizing a first data repository with a second data repository is disclosed. The method includes: a) detecting a change to data in the first data repository; b) communicating the change from the first data repository to the second data repository via the Internet using SOAP over HTTP; and c) updating data in the second data repository with the change. The system includes a first computing device which communicates with the first data repository and a second computing device which communicates with the second data repository. The first computing device detects a change to data in the first data repository and communicates the change to the second computing device via the Internet using SOAP over HTTP. The second computing device updates data in the second data repository with the change.

Abstract: A first calculation unit calculates a first content hash based on a file to be written in response to a write request of the file. An encryption unit encrypts the file by using the first content hash, and generates an encrypted file. A second calculation unit calculates a second content hash based on the encrypted file. An encryption file memory correspondingly stores the encrypted file and the second content hash. A content hash pair memory correspondingly stores the first content hash and the second content hash.

Abstract: The present application describes systems and methods for identifying the version of a form using a digital pointing device.

Abstract: A method and apparatus is described to migrate database. Data transformations are specified in a configuration file. The configuration file contains both control information and data transformation information. The migration is performed automatically using the configuration file using an object-oriented migration application. A new database is created using the control information in the configuration file. The new database is populated with the appropriate data based on the data transformation information in the configuration file, resulting in a properly updated database.

Abstract: A method of performing a real time optimized backup from a first computer storage device to a second or backup computer storage device, is disclosed. The method comprises two different approaches of backing up a first computer file stored on the first computer storage device to be backed up to a second computer file stored on the second computer storage device. The two approaches are instant replication and lazy replication. The method may include analyzing one or more first computer file activities and determining a set of end results achieved by the one or more first computer file activities; and executing a second computer file backup process that achieves substantially the same set of end results as the first computer file backup process, but with fewer steps.

Abstract: A methodology for prioritizing between a number of anticipated problems employs a mathematical formula that considers probability and seriousness for each of a plurality of identified problems. Each of a plurality of problems is assigned a value for its seriousness, a value for its coefficient of seriousness, and a value for the probability of its occurrence. Once each of the identified problems is assigned these numerical values, then for each problem, the values of probability (P), coefficient of seriousness (&sgr;) and seriousness (S) are entered into the following formula: [P×S]+[&sgr;×S]=RP. The relative priority (RP) value that is calculated by this formula for each rated problem is then ranked to enable the decision-maker to decide which problems deserve to receive the most attention in the shortest period of time.