2005 results about "High probability" patented technology

In language evaluation systems, user expressions are often evaluated by speech recognizers and language parsers, and among several possible translations, a highest-probability translation is selected and added to a dialogue sequence. However, such systems may exhibit inadequacies by discarding alternative translations that may initially exhibit a lower probability, but that may have a higher probability when evaluated in the full context of the dialogue, including subsequent expressions. Presented herein are techniques for communicating with a user by formulating a dialogue hypothesis set identifying hypothesis probabilities for a set of dialogue hypotheses, using generative and/or discriminative models, and repeatedly re-ranks the dialogue hypotheses based on subsequent expressions. Additionally, knowledge sources may inform a model-based with a pre-knowledge fetch that facilitates pruning of the hypothesis search space at an early stage, thereby enhancing the accuracy of language parsing while also reducing the latency of the expression evaluation and economizing computing resources.

Fraud detection is facilitated by developing account cluster membership rules and converting them to database queries via an examination of clusters of linked accounts abstracted from the customer database. The cluster membership rules are based upon certain observed data patterns associated with potentially fraudulent activity. In one embodiment, account clusters are grouped around behavior patterns exhibited by imposters. The system then identifies those clusters exhibiting a high probability of fraud and builds cluster membership rules for identifying subsequent accounts that match those rules. The rules are designed to define the parameters of the identified clusters. When the rules are deployed in a transaction blocking system, when a rule pertaining to an identified fraudulent cluster is triggered, the transaction blocking system blocks the transaction with respect to new users who enter the website.

A hybrid of grid-based and graph-based search computations, together with provision of a sparse search technique effectively limited to high-probability candidate nodes provides accommodation of path constraints in an optimization search problem in substantially real-time with limited computational resources and memory. A grid of best cost (BC) values are computed from a grid of map cost (MC) values and used to evaluate nodes included in the search. Minimum segment/vector length, maximum turn angle, and maximum path length along a search path are used to limit the number of search vectors generated in the sparse search. A min-heap is preferably used as a comparison engine to compare cost values of a plurality of nodes to accumulate candidate nodes for expansion and determine which node at the terminus of a partial search path provides the greatest likelihood of being included in a near-optimal complete solution, allowing the search to effectively jump between branches to carry out further expansion of a node without retracing portions of the search path. Capacity of the comparison engine can be limited in the interest of expediting of processing and values may be excluded or discarded therefrom. Other constraints such as approach trajectory are accommodated by altering MC and BC values in a pattern or in accordance with a function of a parameter such as altitude or by testing of the search path previously traversed.

The disclosed subject matter provides a main device and at least one secondary device. The at least one secondary device and the main device may operate in cooperation with one another and other networked components to provide improved performance, such as improved speech and other signal recognition operations. Using the improved recognition results, a higher probability of generating the proper commands to a controllable device is provided.

The present invention involves the dynamic loading and unloading of relatively small text-string vocabularies within a speech recognition system. In one embodiment, sub-databases of high likelihood text strings are created and prioritized such that those text strings are made available within definable portions of computer-transcribed dictations as a first-pass vocabulary for text matches. Failing a match within the first-pass vocabulary, the voice recognition software attempts to match the speech input to text strings within a more general vocabulary. In another embodiment, the first-pass text string vocabularies are organized and prioritized and loaded in relation to specific fields within an electronic form, specific users of the system and/or other general context-based, interrelationships of the data that provide a higher probability of text string matches then those otherwise provided by commercially available speech recognition systems and their general vocabulary databases.

Methods and systems are provided for routing callers to agents in a call-center routing environment. An exemplary method includes identifying caller data for at least one of a set of callers on hold and causing a caller of the set of callers to be routed to an agent based on a comparison of the caller data and the agent data. The caller data and agent data may be compared via a pattern matching algorithm and/or computer model for predicting a caller-agent pair having the highest probability of a desired outcome. As such, callers may be pooled and routed to agents based on comparisons of available caller and agent data, rather than a conventional queue order fashion. If a caller is held beyond a hold threshold the caller may be routed to the next available agent. The hold threshold may include a predetermined time, “cost” function, number of times the caller may be skipped by other callers, and so on.

One or more techniques and/or systems are provided for suggesting a word and/or phrase to a user based at least upon a prefix of one or more characters that the user has inputted. Words in a database are respectively assigned a unique identifier. Generally, the unique identifiers are assigned sequentially and contiguously, beginning with a first word alphabetically and ending with a last word alphabetically. When a user inputted prefix is received, a range of unique identifiers corresponding to words respectively having a prefix that matches the user inputted prefix are identified. Typically, the range of unique identifiers corresponds to substantially all of the words that begin with the given prefix and does not correspond to words that do not begin with the given prefix. The unique identifiers may then be compared to a probability database to identify which words have a higher probability of being selected by the user.

Embodiments for calling variations in a sample polynucleotide sequence compared to a reference polynucleotide sequence are provided. Aspects of the embodiments include executing an application on at least one computer that locates local areas in the reference polynucleotide sequence where a likelihood exists that one or more bases of the sample polynucleotide sequence are changed from corresponding bases in the reference polynucleotide sequence, where the likelihood is determined at least in part based on mapped mated reads of the sample polynucleotide sequence; generating at least one sequence hypothesis for each of the local areas, and optimizing the at least one sequence hypothesis for at least a portion of the local areas to find one or more optimized sequence hypotheses of high probability for the local areas; and analyzing the optimized sequence hypotheses to identify a series of variation calls in the sample polynucleotide sequence.

A non-volatile memory organized into flash erasable blocks sorts units of data according to a temperature assigned to each unit of data, where a higher temperature indicates a higher probability that the unit of data will suffer subsequent rewrites due to garbage collection operations. The units of data either come from a host write or from a relocation operation. The data are sorted either for storing into different storage portions, such as SLC and MLC, or into different operating streams, depending on their temperatures. This allows data of similar temperature to be dealt with in a manner appropriate for its temperature in order to minimize rewrites. Examples of a unit of data include a logical group and a block.

A system and method for providing call management services in a Virtual Private Network of the present invention uses the advantages of end-to-end Internet Protocol signaling. The system and method of the present invention includes a user profile which offers both a customer address and a user name as search keys. The method includes locating the called party who may be at a multiplicity of possible physical locations, evaluating the calling and called party privileges, routing preferences and busy/idle status for establishing permission to set up the call, determining an optimum route to establish the telephone call. Due to the system and method of the present invention, the telephone call takes the optimum route and preferably the most direct route to the destination with a high probability of completion.

A system and method of correlating alarms from a plurality of network elements (NEs) in a large communications network. A plurality of uncorrelated alarms are collected by an alarm collector from alarm reporters. An alarm correlator then partitions the alarms into correlated alarm clusters such that alarms of one cluster have a high probability that they are caused by one network fault. The partitioning of the alarms is performed by creating alarm sets, expanding the alarm sets into alarm domains, and merging the alarm domains into alarm clusters if predefined conditions are met. The sets are formed by selecting an alarmed NE at the highest network hierarchy level which is not tagged, finding all of its contained NEs, and finding NEs that are peer-related to those contained NEs that are in an alarmed state. The sets are expanded into domains by finding NEs that are not in an alarmed state which contain the highest level alarmed NE in each alarm set. The domains are merged into one alarm cluster if the two domains have at least one common NE, at least one of the common NEs is not tagged, and the majority of the NEs contained by the non-tagged common NE are in an alarmed state.

A system and a method for scheduling an emergency procedure in response to detecting that a patient has a high probability of acute myocardial infarction. The system is able to identify patients that are suspected of having acute myocardial infarction (or acute ischemia). The system uses one or more expert software tools or algorithms to analyze received ECG records. Each software tool has logic (e.g., thresholds and/or settings) for automatic routing which is configurable by the customer via a graphical user interface. If any sufficient condition for automatic routing is satisfied, the system routes the data (including the underlying ECG record) and an alert to an electronic device which is accessible by the cardiologist “on call” via a bidirectional pager. If the cardiologist decides that the requested emergency treatment or procedure should be performed, the system accesses the schedules of all associated catheterization labs across multiple hospitals to identify a lab having optimum time-to-treatment. Then the system automatically contacts the selected catheterization lab via a network to schedule the PTCA procedure.

A method and apparatus identifies the existence of differences between two files on a personal computer, such as two versions of a Windows registry file. Portions of each of the files are hashed into a four byte value per portion to produce a set of hash results, and the set of hash results is combined with a four byte size of the portion of the file from which the hash was generated to produce a signature of each file. If the two files are different versions of a Windows registry file, the portion of the file hashed are the values of the Windows registry file. If the two files are different, there is a high probability that the signatures of the two files will be different. The signatures may be compared to provide a strong indicator whether the two files are different. Each four-byte hash from one file can be compared against its counterpart from the other file to determine the portion or portions of the files that differ. Stored portions of one file that are determined to differ may be inserted into corresponding portions of the other file to cause the two files to be equivalent.

Disclosed is a multi-dimensional selectivity estimation method using compressed histogram information which the database query optimizer in a database management system uses to find the most efficient execution plan among all possible plans. The method includes the several steps to generate a large number of small-sized multi-dimensional histogram buckets, sampling DCT coefficients which have high values with high probability, compressing information from the multi-dimensional histogram buckets using a multi-dimensional discrete cosine transform(DCT) and storing compressed information, and estimating the query selectivity by using compressed and stored histogram information as the statistics.

Compositions and methods are provided for prognostic classification of autoimmune disease patients into subtypes, which subtypes are informative of the patient's need for therapy and responsiveness to a therapy of interest. The patterns of circulating blood levels of serum autoantibodies and/or cytokines provides for a signature pattern that can identify patients likely to benefit from therapeutic intervention as well as discriminate patients that have a high probability of responsiveness to a therapy from those that have a low probability of responsiveness. Additionally, serum autoantibody and/or cytokine signature patterns can be utilized to monitor responses to therapy. Assessment of this signature pattern of autoantibodies and/or cytokines in a patient thus allows improved methods of care. In one embodiment of the invention, the autoimmune disease is rheumatoid arthritis.

Presentation of a video clip is made to persons having a high probability of viewing the clip. A database containing viewers of previously offered video clips is analyzed to determine similarities of preferences among viewers. When a new video clip has been watched by one or more viewers in the database, those viewers who have watched the new clip with positive results are compared with others in the database who have not yet seen it. Prospective viewers with similar preferences are identified as high likelihood candidates to watch the new clip when presented. Bids to offer the clip are based on the degree of likelihood. For one embodiment, a data collection agent (DCA) is loaded to a player and/or to a web page to collect viewing and behavior information to determine viewer preferences. Viewer behavior may be monitored passively by different disclosed methods.

The invention discloses an urban environment composition method for unmanned vehicles. Under the condition of being independent of external positioning sensors such as speedometers, GPS and inertial navigators, the trajectory tracking and environment map building of an unmanned vehicle are completed by just using few particles for 3D laser-point cloud data returned by a vehicle-mounted laser radar, thereby providing basis for the autonomous running of the unmanned ground vehicle in an unknown environment; and according to the invention, an ICP algorithm is applied to adjacent two frames of data so as to obtain a coarse estimation on the real position and posture of a vehicle, and then redundance is performed near the coarse estimation based on gaussian distribution. Although the coarse estimation is not the real position and posture of the vehicle, the coarse estimation is a high-probability area of the real position and posture of the vehicle, so that an effect of relatively accurate positioning and composition is achieved by using a small amount of particles in the process of subsequent redundance, thereby avoiding the fitting of a vehicle trajectory by using a large amount of particles in a traditional method, improving the efficiency of the algorithm, and effectively restraining a phenomenon of particle degeneracy caused by bad particle estimation.

A system responds to detection of a vehicle situation by comparing a sensed eye gaze direction of the vehicle operator with data stored in memory. The stored data defines a first predetermined vehicle operator eye gaze direction indicating a high probability of operator desire that an alert signal be given and a second predetermined vehicle operator eye gaze direction indicating a low probability of operator desire that an alert signal be given. On the basis of the comparison, a first or second alert action is selected and an alert apparatus controlled accordingly. For example, the alternative alert actions may include (1) generating an alert signal versus not generating the alert signal, (2) generating an alert signal in a first manner versus generating an alert signal in a second manner, or (3) selecting a first value versus selecting a second value for a parameter in a mathematical control algorithm to determine when or whether to generate an alert signal.

A method and apparatus for debris removal from a reflecting surface of an EUV collector in an EUV light source is disclosed which may comprise the reflecting surface comprises a first material and the debris comprises a second material and/or compounds of the second material, the system and method may comprise a controlled sputtering ion source which may comprise a gas comprising the atoms of the sputtering ion material; and a stimulating mechanism exciting the atoms of the sputtering ion material into an ionized state, the ionized state being selected to have a distribution around a selected energy peak that has a high probability of sputtering the second material and a very low probability of sputtering the first material. The stimulating mechanism may comprise an RF or microwave induction mechanism.

Quantum processor based techniques minimize an objective function for example by operating the quantum processor as a sample generator providing low-energy samples from a probability distribution with high probability. The probability distribution is shaped to assign relative probabilities to samples based on their corresponding objective function values until the samples converge on a minimum for the objective function. Problems having a number of variables and/or a connectivity between variables that does not match that of the quantum processor may be solved. Interaction with the quantum processor may be via a digital computer. The digital computer stores a hierarchical stack of software modules to facilitate interacting with the quantum processor via various levels of programming environment, from a machine language level up to an end-use applications level.

A non-volatile memory organized into flash erasable blocks sorts units of data according to a temperature assigned to each unit of data, where a higher temperature indicates a higher probability that the unit of data will suffer subsequent rewrites due to garbage collection operations. The units of data either come from a host write or from a relocation operation. Among the units more likely to suffer subsequent rewrites, a smaller subset of data super-hot is determined. These super-hot data are then maintained in a dedicated portion of the memory, such as a resident binary zone in a memory system with both binary and MLC portions.