592 results about "Cut score" patented technology

A method, apparatus and computer program product are provided to permit improve gesture recognition based on fusion of different types of sensor signals. In the context of a method, a series of image frames and a sequence of radar signals are received. The method determines an evaluation score for the series of image frames that is indicative of a gesture. This determination of the evaluation score may be based on the motion blocks in an image area and the shift of the motion blocks between image frames. The method also determines an evaluation score for the sequence of radar signals that is indicative of the gesture. This determination of the evaluation score may be based upon the sign distribution in the sequence and the intensity distribution in the sequence. The method weighs each of the evaluation scores and fuses the evaluation scores, following the weighting, to identify the gesture.

A method is provided for automatically classifying text into categories. In operation, a plurality of tokens or features are manually or automatically associated with each category. A weight is then coupled to each feature, wherein the weight indicates a degree of association between the feature and the category. Next, a document is parsed into a plurality of unique tokens with associated counts, wherein the counts are indicative of the number of times the feature appears in the document. A category score representative of a sum of products of each feature count in the document times the corresponding feature weight in the category for each document is then computed. Next, the category scores are sorted by perspective, and a document is classified into a particular category, provided the category score exceeds a predetermined threshold.

A system and method for scoring documents is described. One or more documents are identified responsive to a search criteria. A text match score indicating a quality of match of the identified documents is determined. A category match score is determined over categories. A document-categories score is determined indicating a quality of match between an identified document and a plurality of categories. A search criteria-categories score is determined indicating a quality of match between the search criteria and the categories. An overall score is determined based on the text match score and the category match score.

Recommendation systems and processes for generating recommendations within the context of a socially-enabled human workflow system are provided. The processes may include accessing workflow data, such as social graphs, organization graphs, collaboration graphs, content data, utilization data, ratings data, and the like, associated with a user requesting a recommendation. The process may further include determining one or more of a user similarity score, task similarity score, goal similarity score, and content similarity score. The process may further include generating one or more recommendations based at least in part on one or more of the user similarity score, task similarity score, goal similarity score, and content similarity score.

Embodiments of the invention relate to hosting a competition on a computing device, wherein the competition allows participants to select a first set of predicted winners for a predetermined series of matches in a tournament and a second set of predictions for winners if one or more of the first set of predicted winners are eliminated earlier than predicted. The competition may be implemented in any suitable computing system environment, including, but not limited to, a web-based competition hosted on a remote server, a private or company-based competition hosted on a private or company computer.

The invention relates to a remote sensing image natural language generation method based on an attention mechanism and deep learning. The method comprises the steps of first, preprocessing a remote sensing image and corresponding natural language description; second, inputting the denoised remote sensing image into an intensive positioning convolution neural network (IPCNN); third, inputting region blocks obtained in the second step into a reassignment long-short term memory (RLSTM) network, getting into a weight assignment layer of the RLSTM network, respectively solving the weight of each region by using a multilayer network function, and finally realizing overall output of the natural language description through a deep output layer of the RLSTM network; fourth, inputting the natural language description generated in the third step into a remote sensing image language description scoring model to obtain a score of each sentence; and fifth, inputting a target position, a category label and a natural language description score into a database to wait for calling.

A method for computing similarity between paths includes extracting corpus statistics for triples from a corpus of text documents, each triple comprising a predicate and respective first and second arguments of the predicate. Documents in the corpus are clustered to form a set of clusters based on textual similarity and temporal similarity. An event-based path similarity is computed between first and second paths, the first path comprising a first predicate and first and second argument slots, the second path comprising a second predicate and first and second argument slots, the event-based path similarity being computed as a function of a corpus statistics-based similarity score which is a function of the corpus statistics for the extracted triples which are instances of the first and second paths, and a cluster-based similarity score which is a function of occurrences of the first and second predicates in the clusters.

An apparatus, system, and method are disclosed for validating users based on fuzzy logic. An interface with security questions is presented to a user who requires authentication. A typical scenario is authentication for password recovery. The interface comprises security questions for the user to answer. The security questions may be limited or unlimited response questions. The answers to the security questions are either scored using fuzzy logic, which may attribute a value between “1” and “0” based on similarity with the original, correct answer; or scored using digital logic. When fuzzy logic scoring is used, a similarity score is computed for each answer. The similarity score is compared against a similarity score threshold to either grant or deny access. An average similarity score is also computed for all answers and compared against an average similarity score threshold to either grant or deny access.

A method is provided for reducing search complexity in a speech recognition system having a fast match, a detailed match, and a language model. Based on at least one predetermined variable, the fast match is optionally employed to generate candidate words and acoustic scores corresponding to the candidate words. The language model is employed to generate language model scores. The acoustic scores are combined with the language model scores and the combined scores are ranked to determine top ranking candidate words to be later processed by the detailed match, when the fast match is employed. The detailed match is employed to generate detailed match scores for the top ranking candidate words.

A method for reducing ad impact on users in a search results page includes receiving a request to deliver ads in response to a search query for display on a search results page; receiving relevance scores for a plurality of ranked web results that are to be served to the search results page; ranking a plurality of ads identified as relevant to the search query according to a position-normalized, click-through-rate metric and bid values, wherein a predetermined number of the top-ranked ads are placeable in a plurality of North ad slots; incrementally and additively placing the placeable ads sequentially according to rank (k) in their respective North ad slots until a utility score generated by a utility function for a current iteration of ads fails to exceed a threshold value; and delivering to the search results page the ads placed in the North ad slots.

The present invention relates to improving the identification rate for a person without lowering the rate of excluding another person probabilistically. The invention is a personal identification system that finds the verification results of feature data extracted form data showing the physical features of the individual who is the verification source against the pre-registered feature data of the verification object, and identifies the individual by whether or not the degree of similarity obtained by the verification results exceeds a separate threshold value set according to pre-registered feature data, and wherein a separate threshold value calculation device 23 is provided that calculates the separate threshold value based on the verification score distribution of feature data extracted from data showing the physical features of the individual who is the verification source and the corresponding feature data, and the verification score distribution of the feature data extracted from data showing the physical features of the individual who is the verification source and non-corresponding feature data.

A method and system for optimizing response time for data query rankings and retrieval is provided. In response to a received search query that contains one or more terms, an information retrieval system identifies a candidate set of documents that match any of the terms. Terms are assigned a term weight making them more or less relevant in relation to other terms. A ranking logic defines score bins from a total score range based on possible matched term weights. A relationship is established that classifies a document into a score bin based on a sum of term weights from matched terms. Documents that match more term weights have higher total relevance scores than documents that match less term weights. The most relevant documents are retrievable without having to retrieve the entire set of candidate documents and without having to compute total relevance scores for all the candidate documents.

A method and system are provided for comparing a focal product with several comparison products. First, selecting a focal product and several attributes relating to the focal product and the comparison products, standardizing and weighting the attributes, and determining for each weighted attribute an attribute score. Next, based on the attribute score, calculating a total score for each comparison product, and based on the total score, presenting to a user or purchaser the comparison products most relevant to the user's criteria.

Sequence alignment and sequence database similarity searching are among the most important and challenging task in bio informatics, and are used for several purposes, including protein function prediction. An efficient parallelisation of the Smith-Waterman sequence alignment algorithm using parallel processing in the form of SIMD (Single-Instruction, Multiple-Data) technology is presented. The method has been implementation using the MMX (MultiMedia eXtensions) and SSE (Streaming SIMD Extensions) technology that is embedded in Intel's latest microprocessors, but the method can also be implemented using similar technology existing in other modern microprocessors. Near eight-fold speed-up relative to the fastest previously an optimised eight-way parallel processing approach achieved know non-parallel Smith-Waterman implementation on the same hardware. A speed of about 200 million cell updates per second has been obtained on a single Intel Pentium III 500 MHz microprocessor.

An object detection method that is provided with a step for extracting a plurality of reference feature vectors related to a local area from an image representing an object, and extracting a plurality of query feature vectors related to the local area from a search query image; a step for matching each query feature vector against each reference feature vector, and calculating a similarity score having a value that is higher the closer the distance between both vectors, the larger the local area for which the query feature vector has been extracted, and the larger the local area for which a matching reference feature vector has been extracted; a step for determining a reference feature vector for which a similarity score is highest as the similar vector for each query feature vector; and a step for acquiring a final score by object associated with the similar vectors, and setting the object returning the highest score as the detection result; and wherein the score is calculated by dividing a sum of the similarity score for each similar vector by the number of feature vectors that have matched the object.