1839 results about "List" patented technology

System of correcting misspelled words in input text detects a misspelled word in the input text, determines a list of alternative words for the misspelled word, and ranks the list of alternative words based on a context of the input text. In certain embodiments, finite state machines (FSMs) are utilized in the spelling and grammar correction process, storing one or more lexicon FSMs, each of which represents a set of correctly spelled reference words. Storing the lexicon as one or more FSMs facilitates those embodiments of the invention employing a clinet-server architecture. The input text to be corrected may also be encoded as a FSM, which includes alternative word(s) for word(s) in need of correction along with associated weights. The invention adjusts the weights by taking into account the grammatical context in which the word appears in the input text. In certain embodiments the modification is performed by applying a second FSM to the FSM that was generated for the input text, where the second FSM encodes a grammatically correct sequence of words, thereby generating an additional FSM.

Methods, systems, and computer program products for firewall policy optimization are disclosed. According to one method, a firewall policy including an ordered list of firewall rules is defined. For each rule, a probability indicating a likelihood of receiving a packet matching the rule is determined. The rules are sorted in order of non-increasing probability in a manner that preserves the firewall policy.

The invention relates to method and system for controlling a training plan for a user having a chosen aim for training, whereat least one parameter describing physical characteristics of the user is determined, anda training plan consists of plurality of days, each day having one or more training sessions or rest, andeach performed and coming session having a training load described by one or more parametersa training template is determined according to the aim and the said one or more parameters describing physical characteristics, each training template having a cumulative training load target according to the said parameter and the chosen aim and consisting of one or more training sessions or rest in each day, each training session of the template having a pre-selected training load, andan adapting window is determined, the adapting window consisting of a plurality of days, which include one or more previous sessions and one or more coming sessions according to the training template, andtraining loads of each session in the adapting window are combined into a cumulative training load, which is compared relatively to the cumulative training load target in the template, anddepending on the comparison one or more coming sessions in the adapting window are adapted by changing one or more training loads of these so that the performed training load and the training load of the coming sessions as a combination meets the cumulative training load target.

A novel linked-list-based concurrent shared object implementation has been developed that provides non-blocking and linearizable access to the concurrent shared object. In an application of the underlying techniques to a deque, non-blocking completion of access operations is achieved without restricting concurrency in accessing the deque's two ends. In various realizations in accordance with the present invention, the set of values that may be pushed onto a shared object is not constrained by use of distinguishing values. In addition, an explicit reclamation embodiment facilitates use in environments or applications where automatic reclamation of storage is unavailable or impractical.

A backup apparatus and method suitable for protecting the data volume in a computer system function by acquiring a base state snapshot and a sequential series of data volume snapshots, the apparatus concurrently generating succedent and precedent lists of snapshot differences which are used to create succedent and precedent backups respectively. The data volume is restored by overwriting the base state data with data blocks identified in one or more succedent backups. File recovery is accomplished by overwriting data from a current snapshot with one or more precedent backups.

A method for the detection of anomalous behaviors in a computer network, comprising the steps of:collecting data relating to connections in a plurality of nodes in a network,sending the data from said nodes to an ADS platform,computing from said data at least one value representative of the anomaly level of the connections of each said node and / or of applications initiating said connections and / or of users,computing a multidimensional chart for visualizing the behavior of a plurality of nodes, applications and / or users in said network, wherein said value representative of the anomaly level is used as a dimension in said chart.

An electronic messager with a predictive text editor, including a storage unit for storing a data structure associating, for each one of a plurality of a user's contacts, usage data for the user's history of usage of words in communications with the user contact, a data manager coupled with the storage unit for generating the data structure in the storage unit, and for updating the data structure as additional communications with each user contact are performed and additional usage data is obtained therefrom, and a text predictor coupled with the storage unit, for receiving as input a character string and a designated user contact, and for generating as output an ordered list of predicted words, based on usage data in the data structure associated with the designated user contact. A method is also described and claimed.

The present invention concerns a complex event processing (CEP) engine (1) for processing CEP queries (10) over data streams, wherein the CEP engine (1) comprises:a. a parser (100), adapted for parsing a received CEP query (10) into a logical query graph (20); andb. a translator (300), adapted for translating the logical query graph (20) into a physical query plan (30) in accordance with one of a plurality of data stream representations; whereinc. the logical query graph (20) is independent of the plurality of data stream representations.

Certain example embodiments relate to systems and / or methods for determining and / or executing an appropriate subset of tests in response to a code change. In certain example embodiments, hash digests or other unique values for code structures (such as, for example, classes, methods, and / or other structural elements) may be created. Tests associated those associated code structures may be identified. New hash digests or other unique values may be generated for the code structures after the source code has been modified. In response to a mismatch as between the existing and new hash digests or other unique values, a list of associated tests for possible subsequent execution may be retrieved. Certain example embodiments additionally or alternatively provide an incremental but consistent way of analyzing performance issues, e.g., in connection with a profiler.

The invention discloses a multiattribute collaborative filtering recommendation method oriented to a social network. The multiattribute collaborative filtering recommendation method includes utilizing mass data information of the social network to collect user, friend and item list information, and establishing an original user-item scoring matrix; utilizing a thought of acquiring a middle average value from nine numbers, and performing prediction filling on a sparse matrix; calculating inter-user attracting similarity through a user-item bipartite graph; calculating interaction similarity, linearly combining the attracting similarity with the interaction similarity to acquire comprehensive similarity among users, and searching to acquire a nearest neighbor set of a target user; performing prediction scoring on items to be recommended by the target user according to the nearest neighbor set of the target user, and generating a Top-N recommendation set. By the method, calculating rules of inter-user similarity in a conventional collaborative filtering method are improved, huge impedance brought to the filtering recommendation method and a recommendation system by sparseness of a scoring matrix is reduced, and accuracy of the recommendation system is improved.

A system for enterprise information integration is described. The system is based on different layers:the data sources,source ontologies corresponding to the data schema of the data sources,an integration ontology integrating the different source ontologies,a level of query input, preferably in the form of a web service.Between the levels, mapping rules are used. These mapping rules and the entire system are based on predicate logic. The queries are answered with the help of the rules using inference based on predicate logic.

The invention provides a creating method of catalogue-grade computer file system snapshot, which comprises: the catalogue that needs to create snap is confirmed; when the catalogue creates the snap firstly, the root index node information of the catalogue work version is added to the snap index list and update the last time point of creating or deleting the snap; a new index node is distributed as the root index node of the creating snap version, and the content of the root index node of the work version is copied to the new distributed index node; the write copy chain list of the work version is copied to the root index node of the new creating snap, and then the write copy chain list content of the work version is deleted; the creating time of snap of the root index node of snap version is set as the present time of the computer system; the root index node of the snap version is linked to the snap chain list of the catalogue. The invention also provides the deleting method of the catalogue-grade computer file system snap and the modifying method of the catalogue work version.

A method and system for tracing profiling information using per thread metric variables with reused kernel threads is disclosed. In one embodiment kernel thread level metrics are stored by the operating system kernel. A profiler request metric information for the operating system kernel in response to an event. After the kernel thread level metrics are read by the operating system for a profiler, their values are reset to zero by the operating system kernel. The profiler then applies the metric values to base metric values to appropriate Java threads that are stored in nodes in a tree structure base on the type of event and whether or not the kernel thread has been reused. In another embodiment non-zero values of thread level metrics are entered on a liked list. In response to a request from a profiler, the operating system kernel reads each kernel thread's entry in the linked list and zeros each entry. The profiler can then update the intermediate full tree snapshots of profiling information with the collection of non-zero metric variables.

Data moves between multiple, disparate data sources and the object-oriented computer programs that process the data. A data access server is interposed between the object-oriented programs and the data sources, and acts as an intermediary. The intermediary server receives requests for data access from object-oriented computer programs, correlates each request to one or more interactions with one or more data sources, performs each required interaction, consolidates the results of the interactions, and presents a singular response to the requesting computer program. The consolidated response from the intermediary server contains data items requested by the computer program, information regarding the hierarchical topology that relates the data items, and an indication of the possible object types that might embody the data items. The application program receives the consolidated response and builds an object hierarchy to embody the data items and to interface them to the rest of the application program. The class of an object used to embody data items is selected at execution time from a list of possible candidates.