Abstract: A method and an apparatus for predicting intake manifold pressure are presented, to compensate for a large lag or a large time delay without producing an overshot or discontinuous behaviors of a predicted value. The method comprises the step of obtaining a difference of values of a variable to be predicted and a difference of values of another variable ahead of the variable to be predicted. The method further comprises the step of filtering the differences with adaptive filters. The method further comprises the step of obtaining a predicted difference of values of the variable to be predicted, through algorithm of estimation with fuzzy reasoning. The method further comprises the step of adding the predicted difference of values of the variable to be predicted, to a current value of the variable to be predicted, to obtain a predicted value of the variable to be predicted.

Abstract: For sequentially input data string, the outliner and the change point are detected through calculation of the outlier score and the change point score by combining a time-series model learning device to learn the generation mechanism of the read data series as the time-series statistic model, a score calculator to calculate the outlier score of each data based on the time-series model parameter and the input data, a moving average calculator to calculate the moving average of the outlier score, a time-series model learning device to learn the generation mechanism of the moving average series as the time-series statistic model and the above score calculator that further calculates the outlier score of the moving average based on the moving average of the outlier score and outputs the result as the change point score of the original data.

Abstract: A method and system for classifying small collections of high value entities with missing data. The invention includes: collecting measurement variables for a set of entity cases for which classifications are known; calibrating standard weights for each measurement variable based on historical data; computing compensating weights for each entity case that has missing data, computing case scores for each of one or more dimensions as a sum-product of compensating weights and variables associated with each dimension; executing an iterative process that finds a specific combination of compensation weights that best classify the entity cases in terms of distinct scores; and applying a resulting model, which is determined by the specific combination of compensation weights, to classify other entity cases for which the classifications are unknown.

Abstract: A learning apparatus for learning time series data in a link model including a plurality of input time series pattern storage networks and a plurality of output time series pattern storage networks with nodes of the input time series pattern storage networks linked to nodes of the output time series pattern storage networks, includes a learning unit for updating in a self-organizing manner each of the plurality of input time series pattern storage networks and updating in a self-organizing manner each of the plurality of output time series pattern storage networks and a link relationship updating unit for updating a link relationship between each node of the output time series pattern storage network and an input winner node, and updating a link relationship between each node of the input time series pattern storage network and an output winner node.

Abstract: A forecasting engine and method assists in rapidly and accurately forecasting occurrences of identifiable events and/or results based on signature and/or pattern matching. The present invention derives signature for event-types based on a comparison of actual event data with pre-established representational surfaces. The surfaces represent functional measurements and analysis associated with elements of the geospatial boundary being considered. The present invention provides highly refined modeling processes to assist in quickly focusing on the proper measurement type and/or variable type, and detailing analysis around the most relevant factors. In this way, the present invention allows for more rapid and more accurate assessment determinations. In one aspect, the present invention provides a decision support system for assisting in the determination of potentially successful commercial locations.

Abstract: A relational database management system having an XML storage implementation to reduce overhead associated with consuming data from multiple data providers, where each having proprietary database schemas. The XML storage solution allows data from any arbitrary relational database schema to be loaded, rearranged and retrieved. The present invention is directed to an implementation of an edge table such that large volumes of XML data of any structure can be stored effectively. The edge table may be designed as one large XML document where the schema information is stored separately from the instances, and relationships and constraints are expressed using foreign keys. The edge table further provides for full type support and validation. Indices and clustering provide efficient data access and query execution.

Abstract: The fact that data stored in a storage system is not updated for a given period is proven to a third party. A method of managing data that is given an update prohibitive attribute includes a step of storing, in a management server, information on an end time of the update prohibitive attribute which is received from a storage system, a step of receiving, from the storage system, a request for permission to change the update prohibitive attribute given to the data and obtaining, from the management server, the end time of the update prohibitive attribute given to the data on which the request is made, a step of judging whether or not the end time of the update prohibitive attribute has passed, and a step of sending, when it is judged that the end time of the update prohibitive attribute given to the data on which the request is made has passed, permission to change the update prohibitive attribute given to the data on which the request is made to the storage system.

Abstract: A data analysis unit outputs a plurality of the analytical results by performing various analyses on analytical data concerning a set of analytical objects from different viewpoints and different grading for re-arrangement and systematization of analytical objects. In a knowledge storage unit, the information expressing the background knowledge which can be utilized by the user is stored for each analytical object beforehand. An analytical result selection unit analyzes relationships between the analytical results output from the data analysis unit and the information stored in the knowledge storage unit, selects those results which have a high consistency with the background knowledge, and presents the selected analytical results to the user.

Abstract: A method for evaluating a user query on a database having a mining model that classifies records contained in the database into classes when the query comprises at least one mining predicate that refers to a class of database records. An upper envelope is derived for the class referred to by the mining predicate corresponding to a query that returns a set of database records that includes all of the database records belonging to the class. The upper envelope is included in the user query for query evaluation. The method may be practiced during a preprocessing phase by evaluating the mining model to extract a set of classes of the database records and deriving an upper envelope for each class. These upper envelopes are stored for access during user query evaluation.

Abstract: The invention relates to a method for providing access paths to data within a database, in particular using REBIND for DB2, wherein real time database statistics are determined using a database integrated monitor, wherein the database statistics are output substantially in real time using the database integrated status monitor, and wherein the database statistics from the integrated monitor are used to initiate generation of data set statistics, and to determine the access paths.

Abstract: Described is a method comprising initializing a first set of bits corresponding to a first plurality of predicate indices to a first value, and initializing a second set of bits corresponding to a second plurality of predicate indices to a second value. A subscription is processed. The subscription includes a plurality of subscription predicates, each of the subscription predicates associated with corresponding predicate indices in one of the first and second pluralities. An event is processed. The event includes an event predicate. When the event predicate matches a first predicate index in the first plurality, a first bit associated with the first predicate index is toggled to the second value. When the event predicate matches a second predicate index in the second plurality, a second bit associated with the second predicate index is toggled to the first value. When each bit associated with the corresponding predicate indices is the second value, the event is outputted to a source of the subscription.

Abstract: A computer-implemented method and system for determining search results for a search query for hypertext documents. The hypertext documents are reviewed to determine expert documents. When a query is received, the expert documents are ranked in accordance with the query. Then the target documents of the ranked expert documents are ranked to determine the search result set.

Abstract: A system for searching and reporting an incidence of at least one trademark, tradename, celebrity name, and/or famous name on the Internet, which includes a computer system having a connection to the Internet, and a software program executing on the computer system. The software program is adapted to receive an input of at least one trademark, tradename, celebrity name, and famous name to be searched. The software program then creates a search string including at least one trademark, tradename, celebrity name, and famous name. The software program also receives a URL address of a Web page on the Internet to be searched. The software program accesses and searches the Web page for hits corresponding to the search string, and then provides the search results of identified hits within the Web page.

Abstract: Ambiguities with respect to a user topic interest may be resolved so that useful topic-relevant ads can be presented. Such ambiguities may be resolved by monitoring user behavior, determining a user topic interest (e.g., from a plurality of different candidate topics) based on the monitored behavior, and serving ads relevant to the determined user topic interest.

Abstract: A web browser plug-in supports a team approach to Internet research. An initial search, preferably by a web robot, generates an initial plurality of potentially relevant URLs, which are stored in a shared URL database. Team members are notified when new URLs are added to the database. Team members, optionally through an access control system, evaluate and rank the URLs for relevance. URLs are managed based on their rank, such as ordering their display and deleting non-relevant URLs. The rank of a URL may be indicated visually in a web browser, such as by displaying graphic icons adjacent its title. The method may be iterative, with additional searches conducted, preferably via additional web robots, with the additional URLs returned being evaluated, ranked, and managed in the URL database.

Abstract: A data handling method combines search capabilities with analytical functionality. The invention provides advantages when dealing with structured documents (such as electronic catalogs, XML documents, text documents, HTML documents, Internet documents, etc.) and other data stored in a computer system. Various embodiments include simplified ways to express search/analysis requests of a data set and also to express results to such requests.

Abstract: A method generates hierarchical path index keys for single and multiple indexes with one scan of a document. Each data node of the document is scanned and matches to query nodes are identified. A data node matches a query node if the three conditions hold: if it is not the root step, there is a match for the query node in the previous step of the query; the data node matches the query node of the current step; and the edges of the data and query nodes match. A sub-tree of a data node can be skipped if the data node is not matched and its level is less than the fixed levels of the query. The matched data node is then placed in the match stacks corresponding to the match query nodes. The method uses transitivity properties among matching units to reduce the number of states that need to be tracked and to improve the evaluation of path expressions significantly.

Abstract: Methods and systems of providing information to computer users are described. In one embodiment, the methods and systems can provide a ranked list of favorite links. The list can be based upon the recency and frequency with which a user accesses items associated with the links. A most recently added favorites list of links is provided that is based upon when particular links were added to a user's favorites list. The methods and system can calculate a union of the lists to provide a collection of favorite quick links.

Abstract: Systems and methods for managing multiple related pestware processes on a protected computer are described. One embodiment is configured to identify a location of each of a plurality of files in at least one file storage device of the protected computer and store a list of the location of each of the plurality of files. The list of the plurality of files is then sorted so as to generate a sorted list. Each of the plurality of files is then sequentially accessed as listed in the sorted list so as to retrieve information from each of the plurality of files. Information from the plurality of files is then analyzed to determine whether any of the plurality of files are potential pestware files. In variations, the files in the file storage device are enumerated, and information from the files is accessed, by circumventing the operating system of the protected computer.

Abstract: A database query optimizer for a computer system having dynamically configurable logical partitions generates an optimized query strategy which is dependent on a logical partition configuration. When the query is executed, the configuration of the logical partition in which the query is executed is compared to the logical partition configuration for which the query was optimized. If the configurations are different, a new query can be automatically generated. Optimizing database queries to the current system configuration of a dynamic, logically partitioned system potentially offers greater efficiency in the execution of database queries for complex, logically partitioned systems.

Abstract: A system, method, and computer-accessible medium for a unified search of disparate resources are provided. The system and method determine the most relevant disparate resources in which to search and blend the most relevant results from the search for presentation to the user in an integrated manner.

Abstract: This invention relates to the subject matter identified in the title. An effective interaction is conducted by giving the user adequate information during information search so as to improve the search efficiency and accuracy. A CPU initially sets a set G containing deleted solution candidates to null and receives input for a search question Q from the user (S1). The CPU refers to a database storage section and creates a solution candidate set F as the result of the search of the database (D) in response to the search question Q by using the similarity of labels defined by a thesaurus T or a subset R of the thesaurus T (S2). The CPU presents the user the information concerning the solution candidates and search question Q as the help for interaction on a display part (S3). The user can check if there is a solution among the solution candidates.

Abstract: If some aspect of serving or scoring an ad is subject to a performance (e.g., click-through rate, etc.) threshold, such a threshold may be adjusted using a confidence factor of the ad targeting used. For example, ads served pursuant to a more relaxed notion of match might have to meet a higher performance threshold (e.g., than the threshold applied to ads served pursuant to a stricter notion of match). Alternatively, or in addition, ads served pursuant to a stricter notion of match might be subject to a lower performance threshold (e.g., than the threshold applied to ads served pursuant to a more relaxed notion of match). Thus, in general, a performance threshold could increase as match confidence decreases, and/or a performance threshold could decrease as match confidence increases.

Abstract: A system and method enabling synchronization of data stored on three or more devices in which synchronization between any two of the devices can be conducted independently of the other device. A method embodying the invention involves identifying a record in a first data store that is associated with a change counter that exceeds a maximum change counter recorded for the first data store and updating a second data store using the identified record.

Abstract: Multi-table access control is disclosed that limits access to tables when a requirement for access to multiple columns is detected, where the multiple columns includes at least one column from one table and another column from another table. In an embodiment, the detection of the requirement for access to multiple columns triggers a policy to rewrite the query to include a condition expression that limits access to the multiple columns to those that are entitled to access.

Abstract: An information distribution system includes an information center and a portable terminal. The portable terminal transmits user's personal information to the information center together with specifying information that specifies the distributed content. The information center registers the received personal information and specifying information in relation to each other. Upon receiving the content distribution request, the information center checks on the basis of the specifying information whether the personal information about the requested distributed content has already been registered. If the personal information has been registered, the information center distributes the personal information to the portable terminal together with the requested content. An information distribution method and a program are also disclosed.

Abstract: A method is universally applicable, enabling storing all types of data and structures of data. The method is based on structure elements being self-contained information carriers, represented by pairs of concept and concept value and associated context information. Using the method, data can be organised in hierarchies of structure elements with arbitrary depth and complexity. In spite of its simplicity, the method can reflect connection, context and meaning, however complex, irrespective of types of data and how complex the relations between data may be. Hence, the method represents a fundamental framework for standardised physical data storage of all types of data.

Abstract: A method, system, and program for adjusting the size of a file system and an inline file system log housed in a static logical volume. A computer system includes a logical volume allocated between an file system and its inline file system log. A request is received to adjust the inline log from a current size to a new size while maintaining the size of the logical volume. Storage space is then allocated from within the logical volume to the inline log according to the storage requirement for the new size. Allocating storage space may require decreasing or increasing the amount of storage formerly allocated to the inline log. Then, the inline log is reformatted to the allocated storage space, such that the storage allocated to the inline log for a file system is adjusted while the size of the logical volume housing the inline log and file system remains static.

Abstract: A method and system for ranking objects based on relationships with objects of a different object type is provided. The ranking system defines an equation for each attribute of each type of object. The equations define the attribute values and are based on relationships between the attribute and the attributes associated with the same type of object and different types of objects. The ranking system iteratively calculates the attribute values for the objects using the equations until the attribute values converge on a solution. The ranking system then ranks objects based on attribute values.

Abstract: A system and methodology is provided for improving directory operations within a system providing an electronic hierarchical directory of items. The system includes a component which analyzes probabilities and utilities associated with determining potential target directories for storing and accessing data, and a component for building a subset of the potential target directories that are predicted to be the target directory. The probabilities and/or utilities are functions of expected navigation costs associated with traversing from a displayed directory to at least one of the potential target directories. Methods in accordance with the present invention can be coupled with displays of substructures that format the substructures into a coherent hierarchical view.

Abstract: The invention relates to computer readable medium storing program code which when executed on a computer causes the computer to perform a method for creating a quick recovery volume of a primary data set used by a first computer in a backup storage system, which includes identifying a snapshot image of the primary data set generated by a snapshot application, creating the quick recovery volume of the primary data set from the snapshot image of the primary data set and controlling transfer of data from the first computer to an archival storage unit. In one embodiment, the invention provides a method for creating a quick recovery volume of a primary data set that includes creating a snapshot image of the primary data set and creating a quick recovery volume of the primary data set from the snapshot image of the primary data set. In another embodiment, the invention provides a user interface screen enabling browser style browsing and recovery of quick recovery volumes and snapshot images.

Abstract: A system and method for determining whether to retire a data entry from a buffer. A portion of the retirement conditions is processed prior to the data entry being considered for retirement resulting in faster processing of remaining retirement conditions at the time retirement of the data is to be considered. The results from the pre-processing are stored as predecoded retirement information, which is later used with the remaining retirement conditions to determine whether the data is to be retired from the buffer.

Abstract: Techniques are provided for performing structural joins for answering containment queries. Such inventive techniques may be used to perform efficient structural joins of two interval lists which are neither sorted nor pre-indexed. For example, in an illustrative aspect of the invention, a technique for performing structural joins of two element sets of a tree-structured document, wherein one of the two element sets is an ancestor element set and the other of the two element sets is a descendant element set, and further wherein each element is represented as an interval representing a start position and an end position of the element in the document, comprises the following steps/operations. An index is dynamically built for the ancestor element set. Then, one or more structural joins are performed by searching the index with the interval start position of each element in the descendant element set.

Abstract: A system and method for connecting to a set of phrases joining multiple schemas is disclosed. A phrase identifying particular content corresponding to a particular schema is submitted by an affiliated data provider to a portal. The portal matches the phrase to a set identifying particular content corresponding to multiple schemas. The portal may match the phrase to the same set as another phrase identifying the particular content in the particular schema. The portal may match the phrase to a set in a particular group of sets identifying content across common schemas. The portal may match the phrase to a set in the same group as another phrase identifying content in the particular schema. The portal may match the phrase to a previously established set or to a newly established set.

Abstract: Approaches for migrating portal objects from a source installation to a target installation are disclosed. In one embodiment, when portal objects are selected to be migrated from a source installation to a target installation, the selected portal objects can be considered to form a transport set. The metadata of the transport set itself may be stored in infrastructure tables. Then the data in the transport tables (i.e. all the application specific data), plus the metadata in the infrastructure tables (about the transport set itself) are exported and/or imported to the target installation. In an embodiment, scripts are generated to perform export and/or import functions.

Abstract: A database having data entries with attributes having values that can vary over system time (the time according to a computer clock) and also over valid time (the start time and end time of an interval during which the values of the attributes are true). All logical operations of updates and deletes of values are performed by insert operations that insert new entries into the database, so that all old entries that were present at previous system times still exist and still include their previously-assigned start times and end times for the value of the attribute.

Abstract: In a search processing system, a concept network is generated from a set of queries by parsing the queries into units and defining various relationships between the units based in part on patterns of units that appear together in queries. Units in the concept network that have some similar characteristic(s) are grouped into superunits. For each superunit, there is a corresponding signature that defines the similar characteristic of the group. A query is processed by identifying constituent units, determining the superunit membership of some or all of the constituent units, and using that information to formulate a response to the query.

Abstract: Delivering one or more alert messages via one or more delivery methods to one or more users who have indicated an interest in receiving the alert messages. A delivery service receives an alert document and a list of receiving users. This list indicates which users desire immediate delivery, which users desire delivery at a scheduled time, a service priority and/or other delivery criteria. Any black out period or other deferral is associated with the deferring users to prevent alert delivery during those times. For scheduled deliveries, the alert message is stored on one of a plurality of storages, based on alert type, user priority, storage loads, and/or other parameters. At the scheduled time, the stored alert message is accessed and marked for immediate delivery. The alert message is delivered as an email, instant message, short message service message, and/or the like. A history is maintained of all alert deliveries.

Abstract: Methods and apparatus for representing images using a compact color feature vector. A color feature vector includes a color element for each color in an image-specific set of colors. A color element includes a color identifier and a relative color occurrence. A compact color feature vector may be used in a content-based image retrieval (CBIR) system. The CBIR system includes an image data store containing multiple images. A color feature vector data store includes a variable-length color feature vector for each image in the image data store. A computer program receives a query and uses the variable-length color feature vectors in the color feature vector data store to identify which images satisfy the query.

Abstract: Disclosed is a means and a method for executing a nested transaction in an execution environment supporting flat transactions only. To process a StartTransaction operation within a nested transaction it is suggested to check whether the StartTransaction operation is on the first nesting level of the nested transactions. An actual transaction within the execution environment by issuing a corresponding StartTransaction is started only in the affirmative case but not otherwise. To process a CommitTransaction operation within a nested transaction to successfully terminate a transaction it is suggested to check whether the CommitTransaction operation is on the first nesting level of the nested transaction. An actual transaction within the execution environment will be terminated only by issuing a corresponding CommitTransaction operation in the affirmative case but not otherwise.

Abstract: A system providing methodology for replication subscription resolution. In one embodiment, for example, a system of the present invention for determining subscribers to which a published item of data should be replicated comprises: an interface module for receiving user input of lists of a plurality of subscribers, each list specifying items of data to be replicated to a given subscriber, a build module for building an index based on the lists of the plurality of subscribers containing entries indicating subscribers For each item of data specified in the lists and a default list of subscribers for items of data not matching any of the entries; and a resolution module for receiving a published item of data and determining subscribers to which the published item should be replicated based on the index.

Abstract: Systems and methods are provided for undoing, redoing or rolling back a configuration setting change for an application. Application configuration information related to the setting change can be received and stored by a log, wherein a history of the configuration setting changes for the application can be maintained. The system can also display the history of changes made for viewing and selecting. When a user wishes to revert a configuration setting back to a previous one, the user can select the desired setting for reversion and a call to a reversion routine can be made. At least a portion of the application information may then be passed to the reversion routine for reverting to the application's previous configuration setting.

Abstract: A client-server system for transferring a database from a server to a client across database types, vendors and without development effort. The system providing a server having access to a source database to be transferred to a client. The source database having metadata associated therewith including information regarding the structure and fields of the source database. The system including a client which communicates with the server through a network. The client having a data access application for processing the data received from the server and generating and populating a copy of the source database for use by the client.

Abstract: Methods and apparatus for managing information related to backup storage activities of data storage systems. In a computer system having one or more independent backup data storage systems coupled to each other and each serving one or more clients, a user may obtain information related to backup activities of any of the backup storage systems from a single location. Through a user interface associated with any of the backup storage systems, or through a stand alone user interface, a user may manage (e.g., organize, display, print) information related to backup activities of any or all of the backup storage systems. System administrators can design and store a variety of report formats that may be utilized by any user to display or print various parameters associated with backup activities in a particular manner. Report formats may be edited by users, and displayed parameters may be dynamically updated to provide for active monitoring of one or more backup storage systems.

Abstract: A method and system for generating prime numbers and testing for primality of an integer. This invention has applicability to “public key” and other encryption techniques that play an important role in the security of information technology and electronic commerce. Generation of prime numbers requires the step of testing the pnmality. The method includes a deterministic test for testing the primality of a number in polynomial time. The system includes a random number generator and a primality tester. The random number generator generates a random number and the primality tester tests the primality of this random number. The primality tester can also be used independent of the random number generator. In such a case, the number whose primality is to be tested can be input via a user interface.

Abstract: A power spectrum estimator consistent with certain embodiments has a pulse extraction circuit that compares a digital input signal with a delayed version of the digital input signal to produce an output signal containing extracted pulses. An averaging circuit receives the output pulse and produces therefrom an averaged signal representing the averaged value of the output signal. A subtracter subtracts a reference signal from the averaged signal to produce a difference signal. An absolute value circuit converts the difference signal to an error signal by taking the absolute value of the difference signal. This abstract is not to be considered limiting, since other embodiments may deviate from the features described in this abstract.

Abstract: Harmonic interference caused by limit cycles occurs in the resultant signals of filters for noise conversion as a consequence of limit cycles. A feedback loop is connected downstream of the actual filter and is used to effectively suppress the limit cycles. A feedback signal yFB that is added to the output signal of the filter block is generated in the feedback loop. The invention can be implemented using both analog and digital technology.

Abstract: An image processing apparatus supporting both discrete wavelet transform and discrete cosine transform with reduced hardware resources. The image processing apparatus is composed of an input unit receiving a plurality of pixel data, a controlling unit selecting a desired transform from among discrete wavelet transform and discrete cosine transform, and providing a plurality of coefficients depending on the desired transform, and a processing unit which processes the pixel data using the plurality of coefficients to achieve the desired transform.

Abstract: There are provided efficient basis conversion matrices Dsd and Dds and a basis conversion method in a finite field GF(2n) using the basis conversion matrices for a case where a defining polynomial is a pentanomial, xn+xk(3)+xk(2)+xk(1)+1, and the exponents n, k(3), k(2), and (k1) satisfy the condition, n?k(3)>k(3)?k(1). In addition, an apparatus for the basis conversion in the finite field GF(2n) is provided. Since a pentanomial having a general form in an arbitrary degree is used as the defining polynomial, basis conversion between a standard representation and a dual representation is efficiently performed. Consequently, a dual basis multiplier can be efficiently implemented.

Abstract: Methods for determining the square root, reciprocal square root, or reciprocal of a number performed by a processor of a computer system. The methods produce high precision estimates without using iterative steps. In addition, the methods taught herein utilize compressed tables for the coefficient terms A, B, and C from the quadratic expression Ax2+Bx+C, thus minimizing hardware requirements.