1903 results about "List" patented technology

A computerized method for representing a data record comprising: querying a data source to obtain data selected from the group consisting of a data element in a record, and metadata concerning the record; presenting in a display a record handle for manipulation of the record; presenting in the display a data item wherein the data item is a list of data items or a reference to another record; and, optionally, presenting on the display the metadata above the data item. In some embodiments, the method includes the step of retrieving one or more heterogeneous records from a plurality of databases for display and manipulation. The invention is also a grid control programmed to implement a disclosed method and is a computer-readable medium having computer-executable instructions for performing a disclosed method. The invention links the grid control of the invention with automatic query generation using hierarchical data schema trees. Both the trees and the grid records represent relational foreign keys as extra reference columns. In the grid control, these reference columns are additional embedded record handles.

A method, a device and computer program products for protecting privacy of users from web-trackersThe method comprising:capturing and removing a public unique identifier set by a Website (300) in a computing device (100D) of a user (100);monitoring, during a first time-period, web-requests the user (100) makes to obtain a web-behavioral profile of the user (300), and storing the obtained web-behavioral profile as a first vector;tracking, during a second time-period, the web-requests to examine the effect each web-request has on assisting the de-anonymization of the user (100), obtaining a second vector;classifying, the obtained second vector taking into account a computed similarity score parameter;creating and mapping, a corresponding private unique identifier for said captured public identifier; andexecuting, based on said mapping between the private and the public unique identifiers, an intervention algorithm for said web-tracker, that considers a configured intervention policy.

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.

A technique efficiently searches a hash table. Conventionally, a predetermined set of “signature” information is hashed to generate a hash-table index which, in turn, is associated with a corresponding linked list accessible through the hash table. The indexed list is sequentially searched, beginning with the first list entry, until a “matching” list entry is located containing the signature information. For long list lengths, this conventional approach may search a substantially large number of list entries. In contrast, the inventive technique reduces, on average, the number of list entries that are searched to locate the matching list entry. To that end, list entries are partitioned into different groups within each linked list. Thus, by searching only a selected group (e.g., subset) of entries in the indexed list, the technique consumes fewer resources, such as processor bandwidth and processing time, than previous implementations.

Queries which may be expressed in natural language are processed by: decoding a query into one or more semantically meaningful query elements;accessing data storage, which data storage includes at least one annotation element and one or more corresponding data entries: identifying annotation elements in accordance with the semantically meaningful query elements; and retrieving at least one data entry corresponding to each identified annotation element.

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 system, method and computer program product for determining whether a test sample is in a first or a second class of data (for example: cancerous or normal), comprising: extracting a plurality of emerging patterns from a training data set, creating a first and second list containing respectively, a frequency of occurrence of each emerging pattern that has a non-zero occurrence in the first and in the second class of data; using a fixed number of emerging patterns, calculating a first and second score derived respectively from the frequencies of emerging patterns in the first list that also occur in the test data, and from the frequencies of emerging patterns in the second list that also occur in the test data; and deducing whether the test sample is categorized in the first or the second class of data by selecting the higher of the first and the second score.

An information retrieval system, including a learning and real-time classification methodology, is provided in accordance with the present invention. The system includes a hierarchal analysis component that receives a query and processes probabilities associated with N categories, each category having one or more topics, wherein N is an integer. An interactive component drives clarification dialog that is derived from the query and the probabilities associated with the N categories and the one or more topics. The clarification dialog, driven by a rule-based policy, a decision-theoretic analysis considering the costs of dialog to focus the results versus the costs of browsing larger lists, or combinations of rules and decision-theoretic analysis is employed when valuable to determine at least one category of the N categories to facilitate retrieval of at least one of the topics.

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.

Disclosed are a computer-readable code, system and method for combining texts to form novel combinations of texts related to a desired target concept, where the concept is represented in the form of a natural-language text or a list of descriptive word and / or word-group terms. The system operates to find primary and secondary groups of texts having highest term match scores with a first and second subset of terms in the concept, respectively. It then generates pairs of texts containing a text from each of the primary and secondary groups of database texts, and selects for presentation to the user, those pairs of texts having highest overlap scores as determined from one or more of (i) term overlap, (ii) term coverage, (iii) feature-specific cross-correlation, (iv) attribute-specific correlation, and (v) citation score of one or both texts in the pair.

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.

A computer program and method are disclosed for matching a potential positionee and potential positionor. The potential positionee is provided with a positionee information entry interface for entering positionee information comprising the potential positionee's actual qualifications. The positionee information is stored in a database. Matching is accomplished by providing the potential positionor with a positionor information entry interface for electronically entering positionor information comprising at least one target qualification for a position, the positionor information being stored in the database. Matching is based on determining whether the positionee information correlates with the positionor information. A correlated information list is created. The correlated information is presented for review. Code sections of the computer program preferably accomplish these and other tasks.

Determining one or more concepts associated with a query is disclosed. A query is received. A list of concepts and associated scores is received. The concepts fit within a concept hierarchy. A density function is used to evaluate the received concepts. One or more concepts are associated with the query based at least in part on the results of the density function.

An optimization technique that reorders outerjoins and antijoins with inner joins in a bottom-up optimizer of a relational database management system (RDBMS). Each join predicate is associated with a normal eligibility list (NEL) that includes tables that are referenced in the join predicate and an extended eligibility list (EEL) that includes additional tables that are referenced in conflicting join predicates. An EEL includes all the tables needed by a predicate to preserve the semantics of the original query. During join enumeration, the optimizer determines whether a join predicate's EEL is a subset of all the tables in two subplans to be merged, i.e., whose EEL is covered. If so, the two subplans are combined using the join predicate. Otherwise, the two subplans cannot be joined. Two approaches are used to reordering: without compensation and with compensation. The "without compensation" approach only allows join reorderings that are valid under associative rules. Thus, the optimizer will not combine subplans using a join predicate whose EEL is not covered. The "with compensation" approach allows two subplans to be combined using the join predicate, when a join predicate's EEL is not covered, as long as the join predicate's NEL is covered. Compensation is performed through nullification and best match. Multiple compensations may be merged and performed at any time.

A computer-implemented database and method providing an efficient, ordered reduced space representation of multi-dimensional data. The data values for each attribute are stored in a manner that provides an advantage in, for example, space usage and / or speed of access, such as in condensed form and / or sort order. Instances of each data value for an attribute are identified by instance elements, each of which is associated with one data value. Connectivity information is provided for each instance element that uniquely associates each instance element with a specific instance of a data value for another attribute. In accordance with one aspect of the invention, low cardinality fields (attributes) may be combined into a single field (referred to as a “combined field”) having values representing the various combinations of the original fields. In accordance with another aspect of the invention, the data values for several fields may be stored in a single value list (referred to as a “union column”). Still another aspect of the invention is to apply redundancy elimination techniques, utilizing in some cases union columns, possibly together with combined fields, in order to reduce the space needed to store the database.

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.

A method and apparatus for comprising primitive data generated by tessellation of patches in a three-dimensional computer graphics rendering system receives domain point indices for a first primitive in a list of primitives defining the tessellated patch, stores the domain point indices for the received primitive, compares domain point indices of a next primitive in the list with stored domain point indices and determines any matches, stores domain point indicates of the next primitive or, if a match was found, stores a reference to the position of the matched index, receives domain point indexes of the next primitive in the list and repeats the step until each primitive in the list has been compressed.

A system and method are disclosed for extracting information from text which can be performed without prior knowledge as to whether the text includes a list. The method applies parser rules to a sentence spanning lines of text to identify a set of candidate list items in the sentence. Each candidate list item is assigned a set of features including one or more non-linguistic feature and a linguistic feature. The linguistic feature defines a syntactic function of an element of the candidate list item that is able to be in a dependency relation with an element of an identified candidate list introducer in the same sentence. When two or more candidate list items are found with compatible sets of features, a list is generated which links these as list items of a common list introducer. Dependency relations are extracted between the list introducer and list items and information based on the extracted dependency relations is output.

A method of ranking workers for an incoming task includes recording a list of completed tasks in a computer data structure, extracting first attributes from the list for the tasks that were completed during a pre-determined period, generating a first feature vector for each task and worker from the first extracted attributes, training a Support Vector Machine (SVM) based on the feature vector to output a weight vector, extracting second attributes from an incoming task, generating a second feature vector for each worker based on the second extracted attributes, and ranking the workers using the second feature vectors and the weight vector. The first attributes may be updated during a subsequent period to re-train the SVM on updated first feature vectors to generate an updated weight vector. The workers may be re-ranked based on the second feature vectors and the updated weight vector. Accordingly, the feature vectors are dynamic.

A method of determining a partition into distinct regions of a set of coefficients representative of at least a part of an image in order to insert a watermark comprises the following steps:generation (E501) of a centred pseudo-random sequence (w) equal in size to the cardinal number (N) of the said set of coefficients, formed from centred pseudo-random sub-sequences;modulation (E502) of the said set of coefficients by the said centred pseudo-random sequence (w) in order to insert the same information bit on the said set of coefficients; andchecking (E504–E508), over each region, of a criterion of detectability of the information bit inserted by modulation.Use especially for determining an adaptative partition as a function of a criterion of detectability of an information bit inserted on each region.

To satisfy the needs for stringent control of a record of revisions made to, for example, laws, ordinances, legal documents, patent specifications, industrial codes, documents regarding financial products, specifications, instruction and other manuals, office regulations, bylaws and the like and for strict control of revision histories of editing in the field of publishing and the like. To provide a system for constructing, in a storage device of a computer, data expressing a document to be revised as an XML document, in which a volume, a chapter, a clause, an item, a section, a sub-section, a paragraph and the like of a document to be revised are expressed as a tree structure, assigning to an element corresponding to a branch node of tree structured data a set of a unique revision ID and an attribute representing a type of the revisions written in a list structure every time a revision is made and saving in the element the original document prior to the revision so that a revision operation of the element is performed using the information.

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 system is a database-driven web-application system that includes a task-based data-driven language that provides:strict naming rules for objects in the systemspecifically designed SQL views of database tablesa view-maintenance executable that maintains all of said SQL views and is executed after each change to the databasessoftware functions that implement all accesses to the databases following strict rules and audit proceduresexecutables to perform jobs requested by end-users or on schedulesa task system and database for centralizing all user interactions from any sourceweb application that translates the task database into a web-based user interfacea set of executables that use the task system to export and import relationally sound data to disconnected formats such as spreadsheetsmeta-function databases that enable the addition of various functions to each row in the database on an as-needed basis

An On-Line Analytic Processing (OLAP) system computes complex expressions and aggregations in queries by re-using and sharing subparts of the expressions and aggregations. A dependency generation phase performed by the OLAP system identifies dependencies among metrics based on the expressions, aggregations, and other metrics used by the metrics. An access plan generation phase performed by the OLAP system generates an access plan based on the identified dependencies, wherein the access plan ensures that expressions, aggregations, and metrics are computed before they are needed, and that required values and intermediate results are passed up a tree structure of the access plan until they are used or consumed by some operator. An operator assignment phase performed by the OLAP system generates operators based on the access plan, and also generates project list expressions, aggregations to be computed in each operator, and input and output tuple types for each operator.

A computer-parsing system based upon using vectors (lists) to represent natural-language elements, providing a robust, distributed way to score grammaticality of an input string by using as a source material a large corpus of natural-language text. The system uses recombining of asymetric associations of syntactically similar strings to form an the vectors. The system uses equivalence lists for your the organization subparts of the string to build equivalence lists for our the province longer strings in an order controlled by the potential these / parse to be scored. The power of recombination of Entries from: vector elements in building longer strings provides a means of representing collocational complexity. Grammaticality scoring is based upon the number and similarity of the vector elements.

The invention relates to a vector data space indexing method base on hbase and geohash. The method comprises the following steps: firstly, vector data to be stored is subjected to grid grading; secondly, grid path is calculated; then, the structure of a grid list is designed and indexing codes are established; lastly, the space range to be inquired is subjected to space indexing. According to the vector data space indexing method, two-dimensional vector data such as dots, lines and surfaces are mapped into a one-dimensional character string type rowkey index, so that a huge amount of vector data can be stored through the adoption of the hbase, and the high-performance space inquiry analysis service is provided.

A method and system for generating a decision-tree classifier from a training set of records, independent of the system memory size. The method includes the steps of: generating an attribute list for each attribute of the records, sorting the attribute lists for numeric attributes, and generating a decision tree by repeatedly partitioning the records using the attribute lists. For each node, split points are evaluated to determine the best split test for partitioning the records at the node. Preferably, a gini index and class histograms are used in determining the best splits. The gini index indicates how well a split point separates the records while the class histograms reflect the class distribution of the records at the node. Also, a hash table is built as the attribute list of the split attribute is divided among the child nodes, which is then used for splitting the remaining attribute lists of the node. The method reduces I / O read time by combining the read for partitioning the records at a node with the read required for determining the best split test for the child nodes. Further, it requires writes of the records only at one out of n levels of the decision tree where n> / =2. Finally, a novel data layout on disk minimizes disk seek time. The I / O optimizations work in a general environment for hierarchical data partitioning. They also work in a multi-processor environment. After the generation of the decision tree, any prior art pruning methods may be used for pruning the tree.