Datasets:

patent

/

AIPD_evo_claim_one

like 0

7743353

12013163

1. A system for performing verification, said system comprising: means for creating and designating as a current abstraction a first abstraction of an initial design netlist containing a first target; means for unfolding said current abstraction by a selectable depth; means for verifying a composite target using a satisfiability solver; and means for, in response to determining that said verifying step has hit said composite target, determining whether said composite target is unreachable; means for, in response to determining whether said composite target is unreachable, increasing said selectable depth; means for, in response to determining that said verifying step has hit said composite target: examining a counterexample to identify one or more reasons for said first target to be asserted, wherein said counterexample is a sequence of assignments to inputs of said current abstraction in every cycle leading up to a fail event; building one or more refinement pairs by examining said counterexample; building a second abstraction of the initial design netlist by composing said refinement pairs, wherein said second abstraction is less overapproximate than the first abstraction; porting one or more learned clauses and one or more invariants encountered during verification of said current abstraction to said second abstraction to facilitate verification of said second abstraction by said satisfiability solver by reducing a number of cases said satisfiability solver examines during said verification of said second abstraction; choosing as said current abstraction said second abstraction; and verifying said current abstraction with said satisfiability solver.

7885915

11453254

1. A method of deriving first order logic language rules for use in analyzing new data to identify anomalies in the new data, the method comprising: formatting, via at least one processor of a computer, historical data to be in a form suitable for application of a machine-learning algorithm thereto; applying, via the at least one processor of the computer, the machine-learning algorithm to said formatted historical data to generate a set of first order logic language rules that cover said formatted historical data; wherein the machine-learning algorithm includes inductive logic programming and comprises, for each example in turn: (1) successively refining, via the at least one processor of the computer, the example by the application of refinement operators to obtain one or more first order logic language rules, wherein at each refinement step a sample of refinement operators are chosen according to a probability distribution, and (2) storing the refinement steps in a hypothesis tree data structure with refinement choices and probabilities at each node, and first order logic language rules at each leaf node, the hypothesis tree and probability distribution being updated and refined for each successive example in turn; and, analyzing, via the at least one processor of the computer, said set of first order logic language rules to obtain a subset of said set of first order logic language rules which is usable as first order logic language rules in analyzing new data.

9026233

13916139

1. A non-transitory computer-readable medium storing instructions, the instructions comprising: one or more instructions which, when executed by at least one processor, cause the at least one processor to: identify one or more interfaces, the one or more interfaces including parameterizations for a particular set of components; dynamically create tunable components, associated with the particular set of components, using arithmetic operations or helper functions; receive one or more design requirements associated with the tunable components; transform the one or more received design requirements into a constraint for tuning the tunable components; tune, based on transforming the one or more received design requirements into the constraint and using information extracted from the constraint, the tunable components to create tuned components; produce a parametric model of the tuned components, the parametric model interacting with tunable parameters of the tuned components; tune at least one of the tunable parameters using an optimizer to create at least one tuned parameter, the one or more instructions to tune the at least one of the tunable parameters including: one or more instructions to optimize the constraint; and generate, using the at least one tuned parameter, a result, the result including one or more tuned components, and the one or more tuned components satisfying at least one of: one or more design objectives associated with the parametric model, or one or more design requirements associated with the parametric model.

7756854

11739722

1. A calculation engine in a computer system with a processor for updating values in a multidimensional database, the calculation engine comprising: a downward propagator, executed by the processor, for determining a set of first component cells of a first cell, the set of first component cells affecting the first cell through a first set of formulas, wherein the calculation engine receives a value for updating the first cell in the multidimensional database and wherein the calculation engine marks the first cell as a changed cell; the downward propagator determining a set of subsequent component cells affecting the set of first component cells through a first set of subsequent formulas; the downward propagator marking the set of first component cells and the set of subsequent component cells as allocated cells; an upward propagator, when executed by the processor, for determining a set of first target cells, the set of first target cells being affected by the first cell, the set of first component cells, or the set of subsequent component cells through a second set of formulas; the upward propagator determining a set of subsequent target cells affected by the set of first target cells through a second set of subsequent formulas; the upward propagator marking the set of first target cells and the set of subsequent target cells as changed cells; a downward searcher, executed by the processor, for identifying a third set of formulas for the set of first component cells, the set of subsequent component cells, the set of first target cells, or the set of subsequent target cells; the downward searcher determining a set of unmarked component cells through the third set of formulas; the downward searcher marking the set of unmarked component cells as a required cells; the calculation engine performing calculations for the first cell, the set of first component cells, the set of subsequent component cells, the first target cells, and the set of subsequent target cells; and the calculation engine updating only cells marked as changed cells based on the calculations.

20030065912

09970485

1. A hybrid branch predictor system, comprising: prediction aiding information; a plurality of branch predictors to provide a plurality of branch predictions, each predictor to make a corresponding prediction based on said prediction aiding information; a plurality of storage elements, each storage element of said plurality of storage elements to hold less than full extent of said corresponding prediction, but sharing information among said plurality of storage elements enables extraction of said full extent of said corresponding prediction; and a selection mechanism to select a prediction from said plurality of branch predictions.

4817092

07105063

1. A method to analyze errors in a system, the system having a plurality of resources with replaceable units, a display, a processor, and memory means for storing decision trees, data structures, threshold alarm tasks, failing resource manager tasks and error analysis tasks, the resources including a diagnostics card having a processor and memory means for storing resource analysis tasks, and communication resources, the method comprising the steps of: (a) testing said resources intermittently by said error analysis tasks invoking a card analysis task on said diagnostics card to test for an error in said communication resources in said system; (b) detecting an error and invoking an appropriate error analysis task to process said error; (c) processing said error by said appropriate error analysis task to isolate said error to a replaceable unit by automatically traversing said decision trees; (d) writing data to record said error in said data structures in said memory means of said system; (e) invoking said failing resource manager tasks to retest said replaceable unit; (f) invoking said threshold alarm tasks to determine an effect of removal of said replaceable unit on said system; (g) indicating to said failing resource manager tasks if said replaceable unit can be removed; (h) removing said replaceable unit from service if said retest detects said error and said threshold alarms tasks indication is favorable; (i) retesting said replaceable unit to detect a return to normal operation; (j) returning said replaceable unit to service if normal operation is determined; and (k) displaying a message based on said error on said display of said system.

8674983

12835247

1. A computer implemented method, the method comprising: displaying model representations of a simulatable model of an executable system on a display device, where: the executable system includes a plurality of components, the simulatable model represents relations among the plurality of components of the executable system as functions of time, and the model representations include: a textual representation displayed via a textual viewing interface, a block diagram representation displayed via a block diagram viewing interface, and a three-dimensional representation displayed via a three-dimensional viewing interface; receiving an instruction on behalf of a user, where: the instruction identifies a modification to a selected view of the simulatable model, where the selected view is a view of one of: the textual representation of the simulatable model, the block diagram representation of the simulatable model, and the three-dimensional representation of the simulatable model; concurrently modifying, based on the identified modification, the textual representation, the block diagram representation and the three-dimensional representation of the simulatable model, the concurrently modifying including: synchronously updating one or more of the model representations not included in the selected view, where the synchronous updating occurs dynamically when the model representation of the selected view is modified; and displaying the modified textual representation, the modified block diagram representation and the modified three-dimensional representation of the simulatable model.

8004315

12853663

1. A method for making an integrated circuit having geometric features corresponding to at least active, poly, contact, m1, m2 and via layer patterning, said method comprising at least: providing a silicon wafer to a fabrication line capable of rendering geometric features in said wafer at a resolution of 28 nm or less; fabricating, using said fabrication line, the geometric features corresponding to said active, poly, contact, m1, m2 and via layer patterning; wherein said fabricating includes creating, within a continuous region of at least 100×100 um 2 , geometric features in the active, poly, m1, and m2 layers exclusively from patterning having been defined by: instantiating at least 100 abutting instances of a predefined base template at a spacing corresponding to a minimum poly-to-poly pitch for the fabrication line, wherein said base template defines patterning corresponding to the active, poly, contact, m1, m2 and via layers of said integrated circuit; instantiating one or more regular connector templates within a majority of the instantiated base templates, each regular connector template selected from a set of fewer than 20 types of regular connector templates, wherein each type of regular connector template defines patterning corresponding to the active, poly, contact, m1, m2 or via layer of said integrated circuit, and wherein each type of regular connector template is eligible for instantiation at between one and 5 locations relative to a reference location in its associated base template; and, instantiating one or more special connector templates within fewer than 5 percent of the instantiated base templates, each special connector template selected from a set of fewer than 3 types of special connector templates, wherein each type of special connector template defines patterning corresponding to the contact, m1, m2 or via layer of said integrated circuit, and wherein each type of special connector template is eligible for instantiation at a single location relative to a reference location in its associated base template.

20130148735

13743086

1. An apparatus for decoding motion information in merge mode, comprising: a merge predictor index decoding unit configured to reconstruct a merge predictor index of a current block using a received merge codeword; a spatial merge candidate derivation unit configured to derive a spatial merge candidate of the current block; a temporal merge candidate configuration unit configured to generate a temporal merge candidate of the current block; a merge candidate generation unit configured to generate a merge candidate when the number of valid merge candidates of the current block is smaller than a predetermined number; a merge predictor selection unit configured to generate a list of merge candidates using the spatial merge candidate derived by the merge candidate derivation unit, the temporal merge candidate generated by the temporal merge candidate configuration unit, and the merge candidate generated by the merge candidate generation unit and select a merge predictor based on the merge predictor index reconstructed by the merge predictor index decoding unit; and a motion information generation unit configured to generate a reference picture index and a motion vector of the current block from those of a merge candidate, the merge candidate being selected by the merge predictor selection unit.

20100114528

12262781

1. A computer-implemented well surveillance method comprising: determining first tier statuses corresponding to pre-defined well attributes; mapping the first tier statuses to one or more well performance classifications; determining second tier statuses corresponding to the well performance classifications; and combining the second tier statuses to determine an overall well surveillance status.

20110004567

12830017

1. A method for generating risk forecasts in financial securities, comprising the steps of: selecting a set of securities; selecting at least two risk factors associated with investment risk in the securities; determining, for each selected risk factor, the risk factor's return; constructing a risk factor covariance matrix corresponding to the selected risk factors; constructing an idiosyncratic variance matrix corresponding to the securities in the selected set of securities; determining, for each selected risk factor, a risk factor loading coefficient for each security in the set by, at the least, performing a time series regression to obtain the sensitivity of each security's return to variations in the risk factor's return; projecting the risk factor covariance matrix into a future forecast, thereby producing a future forecast of the risk factor covariance matrix, wherein the step of projecting the risk factor covariance matrix into a future forecast comprises utilizing information in implied volatility; and projecting the idiosyncratic variance matrix into a future forecast, thereby producing a future forecast of the idiosyncratic variance matrix, wherein the determined risk factor loading coefficients, the future forecast of the risk factor covariance matrix, and the future forecast of the idiosyncratic variance matrix can be used together to determine a forecast of the variance-covariance matrix for all securities in the selected set of securities.

20130336580

13527032

1. A system for classifying a test image, said system comprising: at least one processor programmed to: receive a data graph of the test image; receive a graph lattice, the graph lattice including a plurality of nodes, each of the plurality of nodes including a subgraph, a weight and at least one mapping of the subgraph to data graphs of a plurality of training images, the plurality of training images corresponding to a plurality of classes; map the data graph of the test image by the subgraphs of the plurality of nodes; compare mappings between the graph lattice and the data graphs of the training images with mappings between the graph lattice and the data graph of the test image to determine, for each of the training images, a weighted vote of similarity between the data graph of the training image and the data graph of the test image, the weighted vote based on the weights of the plurality of nodes; and, determine a class of the test image from the weighted votes of the training images, the class of the test image being the class of the training image with the highest weighted vote above a threshold number of votes.

20030025811

10215808

1. A method for customizing a camera for at least one particular demographic group by storing at least one parameter value in a programmable memory of the camera to control at least one operation of the camera, the method comprising the steps of: a) identifying at least one camera parameter having a preferred value for at least one demographic group that differs from the standard value for said parameter; b) selecting a demographic classification for the camera; and c) programming the programmable memory of the camera to set the parameter value to the preferred value for the selected demographic classification.

20160012220

14838278

1. (canceled)

7685100

11770462

1. A method in a computing device for forecasting frequency of a query, the frequency of the query being a number of times the query is submitted to a search engine during an interval, the method comprising: determining whether the query is time-dependent or time-independent by analyzing frequencies of the query during past intervals; when it is determined that the query is time-dependent, generating a time-dependent query model to predict the frequency of the query at a future interval, the time-dependent model being derived from the frequency of the query during the past intervals; generating a predicted frequency for the query during a future interval using the generated time-dependent query model; and storing an indication of the predicted frequency generated using the time-dependent query model; and; when it is determined that the query is time-independent, generating a time-independent query model to predict the frequency of the query at a future interval, the time-independent model being derived from the frequency of the query and the frequency of another query during the past intervals; and generating a predicted frequency of the query during a future interval using the generated time-independent query model; and storing an indication of the predicted frequency generated using the time-independent query model.

20050243848

11027283

1. A method for scheduling data packets received from a plurality of data paths, the steps of the method comprising: associating a weight with each data path; grouping each data path according to the associated weight; receiving data packets from each data path; forming frames for the data packets in each group; computing a frame weight for each group; monitoring a data rate assigned to each group and altering the data rate of each group according to changes in weight; and scheduling a packet in a frame for output.

20020076674

09957656

1. A method for solving a problem by a plurality of problem solving contributors acting asynchronously over an interactive communication medium, said method comprising: formulating the problem to be solved as a problem tree having a plurality of problem nodes and problem branches coupling said problem nodes; associating a reward matrix with said problem tree having reward values identified with at least some of said problem nodes, each reward value comprising a reward that will be remitted to a problem solution contributor for making a problem solving contribution associated with an associated node; receiving a problem solution contribution to a particular one of the problem nodes from a particular problem solving contributor; and remitting the reward or a portion of the reward associated with the particular one of the problem nodes to the particular problem solving contributor.

20090089044

11464446

1. A method for classifying information requests, comprising: receiving a group of text questions logged for one or more servers for a period of time; identifying groups of the logged questions that use a variety of different linguistic expressions to express similar information requests; assigning intent categories applicable to each group of questions requesting similar information; and configuring intent responses that each provide applicable information to all of the questions assigned to the same intent categories.

7769235

10241638

1. A method of recognition of characters from a bit-mapped graphic file received from an optical scanning device comprising a template cache for recognized characters, feature analysis means, context analysis means, said template cache along with said context analysis means are used as a first shape characteristic analyzing means, said feature analysis means along with said context analysis means are used as a second shape characteristic analyzing means and as a training means for template cache, said method comprising the steps of initially emptying the template cache; analyzing the shape characteristics of each character by said first shape characteristic analyzing means; analyzing the shape characteristics of each character by said second shape characteristic analyzing means if no or not enough reliability of recognition is achieved after the template cache analyzing; analyzing the results of said shape analyzing routines by said context analysis means; sending results of said context analysis to said template cache for template training; and training said template cache comprising: comparing a resemblance of a bit-mapped image recognized by one of said first and second shape characteristic analyzing means with existing templates using a weighted total of pixel intensity differences of compared images as a measure of similarity thereof; generating a new template if no resemblance is found; adjusting the existing template if resemblance is found comprising the steps of correcting an averaged template image corresponding to said existing template by said new bit-mapped image; and increasing a reliability value of said existing template by the new bit-mapped image reliability value; marking the said existing template as open for training if its reliability value is lower than the predefined reliability level; marking the said existing template as closed for training if its reliability value is higher or equal to the predefined reliability level.

20170124147

14926119

1. A computer-implemented method comprising: receiving, by one or more processors, a query of a database, wherein the query includes a search value, and wherein the database includes a plurality of datasets; determining, by one or more processors, a distance between the search value and at least one reference value; determining, by one or more processors, a maximum distance from the search value to be used in searching the database, wherein the maximum distance from the search value defines a search range and is based, at least in part, on the determined distance between the search value and the at least one reference value; determining, by one or more processors, a subset of datasets from the plurality of datasets that includes datasets for which a data range with respect to each reference value overlaps with the search range; and performing, by one or more processors, approximate string matching for the search value on the subset of datasets; wherein: each dataset of the plurality of datasets is assigned a minimum distance and a maximum distance between values of dataset entries and the at least one reference value; and the minimum distance and the maximum distance for each dataset define the data range for the respective dataset with respect to the at least one reference value.

20100010332

12565231

1. A method for processing sensor data from a continuous analyte sensor, comprising: receiving sensor data from a continuous analyte sensor for a first time period, wherein the sensor data comprises at least one sensor data point; processing the at least one sensor data point to obtain a target analyte value or range of target analyte values for a future time period; and providing output, wherein providing output comprises displaying the target analyte value or range of target analyte values on a user interface.

9277422

13372636

1. A system for providing an online optimization for a cognitive wireless network using a qualitative model, the system comprising: a processor; a memory coupled to the processor, wherein the processor executes programmed instructions stored in the memory for: capturing network state information comprising a plurality of state variables, driven by the qualitative model; identifying, from the plurality of state variables, a goal variable, a plurality of intermediate variables, and a plurality of control variables; forming a monotonic signed directional acyclic graph (MSDAG), in form of hierarchy of nodes, comprising the goal variable, the plurality of intermediate variables, and the plurality of control variables represented in form of a plurality of pair of nodes, wherein each pair of nodes is connected via an edge having a monotonic information indicated in form of a +ve sign or a −ve sign; simplifying the MSDAG in order to generate a simplified MSDAG, wherein the simplified MSDAG is generated by a) removing superfluous nodes corresponding to one or more intermediate variables that does not include a predefined constraint, and b) replacing a path associated with the superfluous nodes with an edge having an effective path influence, wherein the effective path influence is a product of the monotonic information of edges forming the path; identifying one or more control variables from the plurality of control variables, present in the simplified MSDAG, as conflicting variables and non-conflicting variables, wherein the conflicting variable indicates a control variable having multiple paths to the goal variable; assigning an active constraint, to a conflicting control variable having a non-conflicting path with the goal variable, for guiding movement of the conflicting control variable in said path, wherein the active constraint corresponds to a value within an operating range of the network; and optimizing the cognitive wireless network by applying a Monotonic Signed Directional Acyclic-Graph based sequential algorithm (MSDAG-SOPT) on the simplified MSDAG, wherein the MSDAG-SOPT comprises a) selecting a path, of the multiple paths, for the conflicting variables, wherein the path comprises multiple intermediate variables having predefined constraints, b) identifying an intermediate variable, having the active constraint, amongst the multiple intermediate variables, nearest to the control variable in the hierarchy of nodes, wherein the intermediate variable is a conflicting control variable from among the conflicting control variables, and c) updating the one or more control variables based on the monotonic information associated with the path, wherein at least one conflicting control variable identified as conflicting is updated until the predefined constraint associated with the intermediate variable is satisfied.

20080298672

11754948

1. A method for registering an object in three dimensions using machine vision comprising the steps of: at training time, acquiring training images of an object used for training with one or more cameras; at runtime, acquiring runtime images of an object to be registered at runtime with the one or more cameras; and determining a three dimensional pose transformation between the pose of the object used training time and the pose of the object to be registered at runtime by (a) defining features in each of the runtime images as three-dimensional rays through an origin of each of the one or more camera's, respectively, (b) matching the three-dimensional rays to corresponding runtime features from the training images, and (c) computing an optimal pose estimate which maps the training features onto the corresponding three-dimensional rays of runtime features using iterative, reweighted least squares analysis.

8484371

13039541

1. A network bandwidth sizing system comprising at least one branch having two or more client computers connected to a datacenter to send an input from a user to the datacenter (uplink) and to receive an output from the datacenter (downlink); the datacenter having one central server comprising a database server, a web server, and an application server for receiving, storing, and processing the input from the user to generate an output and sending the output to the user through a communication network, wherein the system determines a final value for a bandwidth to be allocated to a branch of a network of an enterprise, the system taking into account both throughput and response time requirements, the system having a processor configured to execute programmed instructions to: (a) For each class of transaction (i) expected to be conducted over the branch of the network, compute an average throughput (X i ) if a user inputs an average think time (Z i ) or computing the average think time (Z i ) if the user inputs the average throughput (X i ); (b) Compute an initial value for the bandwidth (B left ) to be allocated to the branch of the network of the enterprise that satisfies the throughput requirement, using the average throughput (X i ) a computed or input for each class of transaction (i) in step (a) and a maximum network link utilization (U i ) provided by the user as input for each class of transaction (i); (c) Compute a feasible value for the bandwidth (B right ) to be allocated to the branch of the network of the enterprise that satisfies the response time requirement, using the average think time (Z i ) computed or input for each class of transaction (i) in step (a) and the initial value computed in step (b) as inputs to an Approximate Mean Value Analysis (AMVA); and (d) Compute a final value for the bandwidth (B) to be allocated to the branch of the network of the enterprise that satisfies both the throughput and response time requirements using the following steps: Repeat Set B=(B left +B right )/2; Call AMVA (B, τ, C, N, Z, P to , P from , O, r, R); If (B is a satisfactory bandwidth) then Set B right =B; else Set B left =B; endif Until (B is a final bandwidth).

8582871

12898916

1. A method for generating an ensemble classifier, the method comprising: transforming, automatically with a processor, multidimensional training data into a plurality of response planes according to a plurality of recognition algorithms, wherein each of the response planes comprise a set of confidence scores; transforming, automatically with the processor, the response planes into a plurality of binary response planes, wherein each of the binary response planes comprise a set of binary scores corresponding to one of the confidence scores; transforming, automatically with the processor, a first combination of the binary response planes into a first set of diversity metrics according to a first diversity measure; transforming, automatically with the processor, a second combination of the binary response planes into a second set of diversity metrics according to a second diversity measure; selecting a first metric from the first set of diversity metrics; selecting a second metric from the second set of diversity metrics; generating, automatically with the processor, a predicted performance of a child combination of the recognition algorithms corresponding to the first combination and the second combination, wherein the predicted performance is based at least in part upon the first metric and the second metric; selecting parent recognition algorithms from the recognition algorithms based at least in part upon the predicted performance; and generating the ensemble classifier, wherein the ensemble classifier comprises the parent recognition algorithms.

20170161402

15291475

1. A system to support dynamic regression test suite generation using coverage-based clustering, comprising: a data collection and analysis engine running on a host, which in operation, is configured to collect coverage data for code coverage by a plurality of register-transfer level (RTL) modules in an integrated circuit (IC) design for testing of the IC design through simulations, wherein the coverage data provides a measure of how well functionalities of the IC design are covered; generate a plurality of clusters of related RTL modules of the IC design based on statistical analysis of the collected coverage data and hierarchal information of the RTL modules; a regression test generation engine running on a host, which in operation, is configured to identify a plurality of affected RTL modules based on the clusters of the RTL modules when changes are made to the RTL modules in the IC design; generate a plurality of regression tests dynamically for these affected RTL modules based on their corresponding coverage data; run the dynamically generated regression tests to verify the changes made in the IC design.

20070027859

11190354

1. A method for providing profile matching within an unstructured electronic document, the method steps comprising: loading one or more unstructured electronic documents from storage; defining a set of requirements to be met by the unstructured electronic documents; comparing the unstructured electronic documents to one or more criteria groups each containing one or more criteria; and ranking the unstructured documents based on the documents' conformity to the criteria.

20100070498

12211307

1. A method for facilitating the ranking of a plurality of web objects, comprising: automatically adjusting a plurality of weight values for a plurality of parameters for inputting into a ranking engine that is adapted to rank a plurality of web objects based on such weight values and their corresponding parameters; providing the adjusted weight values to the ranking engine so as to generate a ranked set of web objects based on such adjusted weight values and their corresponding parameters, as well as a particular query; determining a relevance metric that quantifies or qualifies how relevant the generated ranked set of web objects are for the particular query; and automatically repeating the operations of adjusting the weight values, providing the adjusted weight values to the ranking engine, and determining a relevance metric until the relevance metric reaches an optimized level, which corresponds to an optimized set of weight values, and wherein the repeated operations utilize one or more sets of weight values including at least one set that results in a worst relevance metric value, as compared to a previous set of weight values, according to a certain probability in order to escape a local optimal solution to reach a global optimal solution.

9326685

13617098

1. A device, comprising: a housing, containing a hydration meter, a camera and an electrical wire or cord for transmitting data and images, wherein the housing has a first projection, a second projection and a third projection, and a central gripping portion, wherein the first projection, the second projection, and the third projection extend radially from the central gripping portion, wherein the first projection is configured to contain the hydration meter at the terminus of the projection, wherein the hydration meter comprises a surface evaluation area having an aspect ratio from 1:1 to 20:1, wherein the hydration meter is configured to measure skin and/or hair hydration and capture data corresponding to the measured hydration data, wherein the second projection is configured to contain the camera at the terminus of the projection, wherein the camera is configured to capture images, wherein the third projection is configured to comprise the electrical wire or cord that is configured to transmit the data from the hydration meter and the images captured by the camera to a computer.

20150348541

14290090

1. A method performed by one or more computers, the method comprising: accessing data indicating a set of classes corresponding to a concept, each of the classes representing a different set of words or phrases associated with the concept; generating a first language model in which a first class from the set of classes represents the concept; generating a second language model in which second classes from the set of classes represent the concept, each of the second classes being different from the first class; obtaining (i) output of the first language model for a set of input data, and (ii) output of the second language model for the set of input data; evaluating the output of the first language model and the output of the second language model; and selecting one or more classes from the set of classes based on evaluating the output of the first language model and the output of the second language model.

7895323

12267762

1. An information processing system for predicting an occurrence of a critical event in a computer cluster, the information processing system comprising: the computer cluster comprising a series of nodes; a control system comprising: A) an event log comprising information concerning critical events that occur in the computer cluster, wherein said critical events adversely affect performance of the cluster or one of its nodes; B) a system parameter log comprising information concerning system performance parameters for each node in the cluster; C) a processor configured for: i) implementing a hybrid prediction system comprising rule based prediction algorithms, time-dependent variable prediction algorithms, and a warning window; ii) maintaining the event log for only those nodes in which an error has occurred; iii) maintaining the system parameter log for each node in the cluster; iv) for only those nodes in which an error has occurred, loading the information from the event log and the system performance information pertaining to said error-prone nodes from the system parameter log into a Bayesian network model representing a correspondence between the system performance parameters and occurrence of the critical events; v) using the Bayesian network model to predict a future critical event within a specified time-limit based upon the hybrid prediction system; vi) making future scheduling and current data migration selections based upon the hybrid prediction system; and vii) adapting the Bayesian Network Model by feeding the scheduling and data migration selections into said Bayesian Network Model; and D) a memory for storing information related to said occurrence of said critical events and said system parameters of said nodes.

7664717

11423174

1. A computer-implemented method for building skills in accurate text comprehension and the use of comprehension strategies in a student, utilizing a computing device to present stimuli and to record responses, the method comprising: providing a stimulus passage set comprising a plurality of stimulus passages, wherein each stimulus passage comprises one or more pages; via a display on a computing device, presenting a page from a stimulus passage from the stimulus passage set to the student; via the display, asking the student a question regarding the page; textually presenting a plurality of answers to the student on the display, wherein one of the answers is a correct answer to the question; requiring the student to employ a pointing device on the computing device to select an answer from the plurality of answers to answer the question; determining, via the computing device, if the student selected the correct answer; and performing said presenting the page, said asking, said textually presenting the plurality of answers, said requiring, and said determining for each page of the stimulus passage; repeating said performing for each stimulus passage in the stimulus passage; set in a specified order in an iterative manner to build skills in accurate text comprehension and the use of comprehension strategies in the student.

8219509

12329374

1. A method of providing learning capability to an educational device, comprising: selecting one of a plurality of educational tasks to be performed by said user based on an action probability distribution comprising a plurality of probability values corresponding to said plurality of educational tasks, said plurality of educational tasks being associated with a plurality of different difficulty levels said plurality of educational tasks comprising identifying combinations of items; identifying an educational task performed by a user; determining an outcome of said selected educational task relative to said identified educational task; and updating said action probability distribution based on said outcome and said difficulty level of said selected educational task.

9009194

13309553

1. A method for processing user input, the method comprising: publishing an open-ended query to a user audience; receiving first responses to the open-ended query from a plurality of users in the user audience, wherein each of the plurality of users is an individually identifiable user; displaying open-ended query response data, the open-ended query response data including the received first responses, wherein the open-ended query response data is displayed in real-time; receiving updated responses from one or more of the plurality of users that previously provided a first response to the open-ended query, the updated responses being responsive to the same published open-ended query, wherein each of the updated responses replaces the first response previously provided by the respective individually identifiable user of the plurality of users, and wherein at least one of the updated responses is a vote for one of the received first responses; assigning rankings to the received responses in real-time according to popularity, the rankings updated dynamically, wherein the popularity of each of the received responses is based on a number of votes received for the respective received response, and wherein the received responses include the first responses received from the plurality of users that have not provided updated responses and the received updated responses; and displaying updated open-ended query response data, the updated open-ended query response data including the received responses and the rankings, wherein the updated open-ended query response data is displayed in real-time.

20080262823

11739061

1. A method of training a resource model of a system, the method comprising: correlating a resource cost incurred by each component of the system in response to a given operation; generating a resource map based on the correlation of the resource costs to the given operation; determining workload transformations applied to the given operation at each interface between components of the system; and generating a workload map based on the determined workload transformations applied to the given operation at each interface between components of the system.

20080033894

11735736

1. A system for predicting medical treatment outcome, the system comprising: an input operable to receive values for a plurality of patient specific characteristics of a patient; a processor operable to apply the values to a first prognosis model, the first prognosis model relating a plurality of variables corresponding to the values to a treatment outcome, the relating being a function of medical knowledge collected from literature and incorporated into the first prognosis model; and a display operable to output a patient specific prognosis for the patient as a function of the application of the values for the plurality of patient specific characteristics of the patient to the first prognosis model.

20090055785

11966265

1. A method for predicting performance criteria in a circuit having latches and feedback loops, the method comprising the iterative repetition of the following steps: a. for each latch i having one or more input latches j, (1) first calculating for each input latch j: (a) the earliest signal arrival time a i at latch i as the lesser of: (i) any previously defined value for the earliest signal arrival time a i , and (ii) the sum of 1) the earliest signal departure time d j at latch j in any prior iteration and 2) the minimum combinational delay δ ji from latch j to latch i; (b) the latest signal arrival time A i at latch i as the greater of: (i) any previously defined value for the latest signal arrival time A i , and (ii) the sum of: 1) the latest signal departure time D j at latch j in any prior iteration and 2) the maximum combinational delay Δ ji from latch j to latch i; (2) then calculating: (a) the setup time violation s i at latch i as the latest signal arrival time A i: (i) minus the rising clock edge arrival time C i, (ii) minus the clock high time T i h at latch i, plus the setup time S i of latch i; (b) the hold time violation hi at latch i as the earliest signal arrival time a i : (i) minus the rising clock edge arrival time C i ; (ii) minus the clock high time T i h at latch i; (iii) minus the hold time H i of latch i; (iv) plus the clock cycle time T c ; (c) the critical setup time violation limit s c ∞ as the greater of: (i) any previously defined value for the critical setup time violation limit s c ∞, and (ii) the setup time violation s i at latch i; (d) the critical hold time violation limit h c ∞ as the lesser of: (i) any previously defined value for the critical hold time violation limit h c ∞ , and (ii) the hold time violation h i at latch i; b. calculating the circuit timing yield Y as the probability that both (1) the critical setup time violation limit s c ∞ being less than or equal to zero, and (2) the critical hold time violation limit h c ∞ being greater than or equal to zero.

8949264

13361326

1. A system comprising: at least one processor to: access associations between keywords contained in formerly received natural language queries and attributes of a database model; access a context free grammar comprising a first sentence that includes elements of a formerly received natural language query, wherein in the first sentence a given keyword in the formerly received natural language query that is associated with an attribute of the database model is replaced with a first label representing a first one of plural different database attribute types of the attributes of the database model; disambiguate first associations between a first keyword and multiple attributes of the database model; disambiguate second associations between an attribute of the database model and the plural different database attribute types using the context free grammar; and respond to a new natural language query by generating a database language query based on the disambiguating of the first and second associations.

20110231439

13149151

1. A method comprising: using one or more computer processors to determine, for each of a plurality of time periods, a rate of a plurality of queries to a data source; associating a cost with a query state transition; assigning a query state to a particular query for a particular time period of the plurality of time periods; and identifying a query burst during the plurality of time periods based on assignment of the query state to each of the plurality of queries.

7873582

10586396

1. A maze generation method for generating a maze, using a genetic algorithm, the method comprising: dividing a given plane into shapes to produce generated blocks; setting alternate blocks of the generated blocks to be reference point blocks; assigning a two-bit chromosome to each reference point block, each two-bit chromosome used for controlling blocks which are set to be contiguous on sides of the reference point blocks; and optimizing, by a processor, the chromosomes assigned to the reference point blocks by the genetic algorithm, to generate an optimum maze.

20090083676

12024722

1. A method for providing in a first grid display an alert of a status of a query from a second grid display of a plurality of grid displays arranged in a hierarchy, a grid display providing an arrangement of grid cells, each grid cell comprising one or more elements for indicating the status of the query monitoring one or more data sources, the method comprising the steps of: (a) displaying on a screen a first grid display at a first level in a hierarchy of grid displays, the first grid display having a first arrangement of grid cells, each of the grid cells comprising an element for indicating status of a query monitoring one or more data sources, one or more grid cells of the first arrangement identifying one or more grid displays at a second level in the hierarchy different than the first level; (b) displaying a reduced representation of a second grid display as an element in a first grid cell of the first grid display to identify status of a plurality of queries within the second grid display, the second grid display maintaining off the screen a second arrangement of grid cells comprising queries monitoring one or more data sources; (c) determining a status of a match of the query with data from the one or more monitored data sources, the query identified by a second grid cell of the second grid display; and (d) providing, in response to the determination, an indicator of the status of the query at a location in the reduced representation corresponding to a relative location of the second grid cell within the second grid display.

8631014

13609165

1. A method for application management comprising: inputting results from an electronic discovery application into a data dictionary, wherein the results indicate one or more applications installed at a computing device; generating one or more user software pages based on the results; comparing the one or more applications indicated as being installed at the computing device to an application indicated in the data dictionary as being installed at an earlier time; determining a status indicator of at least one of the one or more applications, wherein the status indicator is in the data dictionary based on the results of the comparison; and remotely installing at the computer device software corresponding to the one or more application, based on the determined status indicator.

6035106

08840338

1. For configuring a logic array integrated circuit having a plurality of function blocks to implement a logic design, the logic design comprising a plurality of interconnected logic cells, each occurrence of a logic cell in the design being an instance of the logic cell, each of said logic cells being defined by a functional definition common to all instances of said logic cell, and each of said defined logic cells having a default physical layout, a method of using a computer to place said logic design in said logic array while at least partially maintaining a hierarchical relationship among logic cell instances and a logic cell functional definition, said method comprising the steps of: generating a first alternative physical layout of a first logic cell, said first alternative layout having a functional definition identical to that of said default layout of said first logic cell; determining whether said first alternative layout is preferable to said default layout of said first logic cell when one or more instances of said first logic cell is placed; selecting either of said first alternative layout and said default layout for placement in at least one of said function blocks; placing said plurality of logic cells, including said first logic cell having said selected layout, among said function blocks, thereby allowing selective placement of the logic design while at least partially maintaining the hierarchical relationship among the plurality of logic cell instances and the logic cell functional definition.

20130082858

13219435

1. A method in a computing device for classifying objects, the method comprising: providing a classifier that identifies a class for an object, the classifier inputting a feature vector representing the object and outputting an indication of the class for the object; receiving a signal frame for a detected object, the signal frame representing return signals acquired by receivers based on signals emitted by transmitters operating in multistatic mode, the signal frame including, for each transmitter and receiver pair, a plurality of samples acquired by the receiver at different sampling times for the signal emitted by the transmitter; transforming the samples of the return signal for each transmitter and receiver pair to a return spectrum in the frequency domain; generating singular values from the samples of the return spectrum of each transmitter and receiver pair; generating a feature vector representing the detected object from the generated singular values; and applying the classifier to the generated feature vector to identify the class of the detected object.

20080071478

11799037

1. A computer implemented method for identifying the candidate molecule or molecules in a large array of molecules that are similar in three dimensional shape to query molecules, comprising the following steps: a) defining a set of topologically distinct steric features that taken together the substructures found in each molecules; b) identifying the positions of the steric features in each conformer of a query molecule; c) select a class of multiplet for use; d) using the selected multiplet class, for each query molecule, identifying the multiplet or multiplets that occur within at least one conformer of the molecule; e) dividing the set of conformations for each query molecule into at least two subpopulations by randomly assigning each conformer to one subpopulation; f) creating bitmaps indicating which multiplets occur in each conformer subpopulation of each molecule; g) logically ORing the bitmaps of each conformer for each molecule; h) generating a steric multiplet hypothesis by identifying discriminating multiplets from the bitmaps based upon how many conformers each multiplet occurs in and the size of the multiplet; i) identifying the positions of the steric features in each conformer of the molecules in the large array; j) using the previously selected multiplet class, for each molecule in the array identifying the multiplet or multiplets that occur within at least one conformer of the molecule; k) creating bitmapd indicating which multiplets occur in each conformer of each molecule; l) logically ORing the bitmaps of each conformer for each molecule; and m) comparing the bitmap for each array molecule to the steric multiplet hypothesis bitmap to determine those array molecules most similar in three dimensional shape to the query molecule.

20070288408

11451972

1. A method for optimizing resource allocation among data analysis functions in a classification system comprising the steps of: characterizing each of the data analysis functions as a set of operating points in accordance with at least one of resource requirements and analysis quality; selecting an operating point for each of the data analysis functions in accordance with one or more constraints; and applying the analysis functions at selected operating points to optimize resource allocation among the data analysis functions in the classification system.

9542446

14996179

1. A method, comprising: at one or more computing devices comprising one or more processors and memory storing one or more computer programs executed by the one or more processors to perform the method, performing the operations of: annotating a plurality of datasets with metadata, the plurality of datasets including a plurality of fields, the metadata including a plurality of categories, each category of the plurality of categories corresponding to one or more fields of the plurality of fields; generating a hierarchy mapping that indicates a hierarchical relationship between different categories of the plurality of categories; receiving a natural language query that specifies a first granularity level that indicates a particular category of the plurality of categories and one or more field values that correspond to the particular category; determining against which of the plurality of datasets to execute the natural language query based on: identifying, based on the hierarchy mapping, one or more categories of the plurality of categories that are hierarchically related to the particular category; selecting, based on the metadata, two or more datasets of the plurality of datasets that include at least one category of the one or more categories; generating one or more dataset filters based on the first granularity level; translating the one or more dataset filters to a second granularity level corresponding to the at least one category; after translating the one or more dataset filters, applying the one or more dataset filters to at least one dataset of the two or more datasets; joining the two or more datasets to generate a composite dataset that includes the particular category; and executing the natural language query against the composite dataset to return a result for the natural language query.

20170213101

15412109

1. A computer-implemented method ( 40 ) of reducing processing time of an application for visualizing image data, wherein the application is one of a plurality of applications selectable by a user, wherein each of the plurality of applications comprises a pre-processing algorithm for pre-processing the image data, wherein the method comprises predicting which one of the pre-processing algorithms is to be performed in response to a selection of an application by the user by: extracting ( 421 ) a feature vector from the image data, metadata, and/or additional data associated with the image data, supplying ( 422 ) the feature vector as input to a machine learned model, and receiving ( 423 ) an algorithm identifier as output from the machine learned model, the algorithm identifier identifying the pre-processing algorithm, the method further comprising: using ( 424 ) the algorithm identifier to select ( 42 ) the pre-processing algorithm, thereby obtaining a selected pre-processing algorithm, and pre-processing ( 43 ) the image data using the selected pre-processing algorithm.

9424285

13712639

1. A method of estimating a number of distinct data blocks in a dataset for data deduplication prior to performing a data deduplication process on the dataset, the method comprising: scanning, by a data processing system, multiple fingerprints associated with a dataset, wherein the dataset has been chunked into multiple data blocks, and wherein each of the multiple fingerprints is associated with one of the multiple data blocks; selecting, by the data processing system, a subset of the multiple fingerprints in accordance with a sampling condition specifying a subset of all possible fingerprint values to produce a content-based sample of fingerprints; and determining, by the data processing system, an estimated number of distinct data blocks in the dataset by determining a number of distinct fingerprints in the content-based sample of fingerprints, wherein the estimated number of distinct data blocks in the dataset is determined prior to performing a data deduplication process on the dataset.

20130103602

13452074

1. A method comprising: accessing, on a computer processor, past prescription drug utilization associated with at least some of a plurality of plan participants, the past prescription drug utilization including identification and quantity of a plurality of prescription drugs used by a particular plan participant of at least some of the plurality of plan participants; accessing, on the computer processor, drug utilization trend information reflecting changes to prescription drug cost; projecting, on the computer processor, for each of the plurality of plan participants a projected prescription drug utilization based on the past prescription drug utilization and the drug utilization trend information; accessing, on the computer processor, a statistical sample taken from the plurality of plan participants of a plan preference of a first proposed design plan or a second proposed design plan; accessing, on the computer processor, historical plan selection decision data associated with at least a portion of the plurality of plan participants; accessing, on the computer processor, selection preference data associated with a population segment having a similar grouping characteristic to the plurality of plan participants, the population segment including a plurality of persons that are not among the plurality of plan participants; determining, on the computer processor, for each of the plurality of plan participants a perceived plan preference of a first proposed design plan or a second proposed design plan based on a presumed participant objective to minimize participant cost, the statistical sample taken of the plan preference, the historical plan selection decision data, and the selection preference data associated with the population segment having the similar grouping characteristic; determining, on the computer processor, an estimated cost for participation of each of the plurality of plan participants in either the first proposed design plan or the second proposed design plan based on a determination of the perceived plan preference; aggregating, on the computer processor, the estimated cost for the plurality of plan participants to calculate a total estimated cost for the participation of each of the plurality of plan participants in either the first proposed design plan or the second proposed design plan; accessing, on the computer processor, a total target cost for the plurality of plan participants to participate in either the first proposed design plan or the second proposed design plan; determining, on the computer processor, a difference between the total estimated cost and the total target cost; automatically adjusting, on the computer processor, the first plurality of plan design options associated with the first prescription drug benefit plan and the second plurality of plan design options associated with the second prescription drug benefit plan based on a determination of the difference; assembling, on the computer processor, the adjusted first plurality of plan design options into a first adjusted proposed design plan; assembling, on the computer processor, the second adjusted plurality of plan design options into a second adjusted proposed design plan, the second adjusted plurality of plan design options being different than the first adjusted plurality of plan design options; determining, on the computer processor, for each of the plurality of plan participants a perceived plan preference of the first adjusted proposed design plan or the second adjusted proposed design plan based on the presumed participant objective to minimize participant cost, the statistical sample taken of the plan preference, the historical plan selection decision data, and the selection preference data associated with the population segment having the similar grouping characteristic; determining, on the computer processor, an adjusted estimated cost for participation of each of the plurality of plan participants in either the first adjusted proposed design plan or the second adjusted proposed design plan based on a determination of the perceived plan preference; and aggregating, on the computer processor, the adjusted estimated cost for the plurality of plan participants to calculate a total adjusted estimated cost for the participation of each of the plurality of plan participants in either the first adjusted proposed design plan or the second adjusted proposed design plan.

9773054

14644771

1. A method, comprising: creating a conceptual inverted index (CII) based on conceptual indices (CIs), the CII including CII entries, each of which corresponds to a separate concept in a concept graph, the creating including for each CII entry: with respect to the concept corresponding to the CII entry, populating the CII entry with: pointers to documents selected from the CIs having likelihoods of being related to the concept that are greater than a threshold value; and the corresponding likelihoods of the documents; receiving a query that includes one of the concepts in the concept graph as a search term; searching the CII for the search term; and generating query results from the searching, the query results including at least a subset of the pointers to documents; creating an explanations index that indicates for each of the documents pointed to by the pointers included in the query results, a likelihood that each of one or more concepts extracted from the document is related to the search term; and generating an explanation of the query results based on the explanations index, the explanation including a summary of a relevance of the query results to the query, wherein each of the CIs is associated with a corresponding one of the documents and includes a CI entry for each concept in the concept graph, and each of the CI entries specifies a value indicating a likelihood that the one of the documents is related to the concept in the concept graph.

20060195204

11382180

1. In a computer system having a user interface including a display and an input device, a method, comprising: generating a set of candidate molecules based on an evolutionary scheme in which an objective function to determine a fitness of a candidate molecule is a priori mathematically unexpressed, presenting on the display data based on the set of candidate molecules to at least one user, receiving through the input device at least one input from the at least one user, the at least one input based on the at least one user's evaluation of the presented set of candidate molecules, based on the at least one input, using at least the evolutionary scheme and the at least one input to generate an updated set of candidate molecules, and repeating the presenting and receiving.

20150316631

14677156

1. A computerized method for generating a phase corrected magnetic resonance image comprising: (a) acquiring a first magnetic resonance image containing error and intrinsic phase information; (b) calculating two or more candidate input vector images from the acquired image; and (c) performing an optimized region growing based phase correction algorithm to determine an output vector image that is spatially smooth in orientation and is substantially represented at each pixel by one of the calculated vector images at the same pixel, wherein phase correction is performed by: selecting an initial seed pixel for a new thread of region growing and placing the initial seed pixel onto a highest priority pixel stack; selecting a pixel that is placed on a pixel stack with a highest priority order from a list of pixel stacks that hold unprocessed pixels; determining an updated vector pair for the selected pixel by jointly considering its input vector pair (A and B) with a reference vector pair (A r and B r ); placing each of neighboring pixels of the selected pixel onto one of pixel stacks according to a quality metric by jointly comparing an input vector pair of a neighbor pixel with a reference vector pair; recording and monitoring the priority and the mode of region growing for the selected pixel; using the recorded mode of region growing to determine which vector pairs need to be considered and which vector of the updated vector pair is a correct vector; and performing a final pixel-level optimization in which a vector O of a pixel is assigned as its original input vector A or B depending on if A or B has a smaller angular difference with the locally average O of the pixel over a selected boxcar.

7640149

11294962

1. A method for optimizing production of a reservoir having one or more wells having downhole valves, comprising: (a) running, using a processor, a reservoir simulator in a forward simulation to generate a multi-segmented well model; (b) processing, using the processor, outputs from the multi-segmented well model to generate intermediate partial derivatives of flow equations for the one or more wells and for the reservoir; (c) combining, using the processor, the intermediate partial derivatives of the well flow equations and the reservoir flow equations in the reservoir simulator; (d) solving, using the processor, an adjoint system of linear equations at regular time intervals to calculate a set of adjoint gradients of an objective function with respect to control parameters associated with the downhole valves; (e) determining, using the processor, from the adjoint gradients a search direction; (f) using the search direction to solve, using the processor, an optimization algorithm that maximizes an objective function using line-search methods; (g) locating, using the processor, a local maximum along the search direction and updating the control parameters; (h) using the new updated control parameters in the reservoir simulator to generate, using the processor, an updated multi-segmented well model; (i) repeating steps (a)-(i) until the updated multi-segmented well model converges on a maximized value of the objective function; and (j) adjusting control of the one or more wells in the reservoir based on the updated multi-segmented well model.

20080005162

11617464

1. A computer system for controlling actions in a computer-based process, the system comprising: a status schema model that is defined at design-time, stored in computer-readable medium and includes preconditions for performing actions, each precondition identifying how a status affects whether an action is to be allowed to be performed at runtime by a data object node instance having the status, and instructions stored in computer-readable medium that, when executed, perform operations comprising: creating a status schema instance for a particular data object node instance being used in a computer-based process, the status schema instance corresponding to the status schema model, and the data object node instance including values for variables and methods capable of being performed by the data object node instance; based on the status schema instance, monitoring status of the data object node instance to determine whether a particular action is allowed to be performed by the data object node instance; and in response to a determination that the particular action is allowed, enabling the particular action to be executed.

20030214586

10331781

1. An image quality analysis method for a display device, comprising the steps of: outputting an image pattern to the display device for a first period of time; dividing a screen display region on which the image pattern is displayed into a plurality of sub-regions; producing first measurement data corresponding to image quality during the first period of time for the plurality of sub-regions; outputting the image pattern to the display device for a second period of time; producing second measurement data corresponding to image quality during the second period of time for the plurality of sub-regions; normalizing the image pattern displayed on the screen display region; and quantitatively detecting an output level of image sticking of the image pattern from the normalized image pattern using the first measurement data and the second measurement data.

9785407

14549639

1. A data processing apparatus comprising: combined divide-square root circuitry to perform, in response to a divide instruction identifying a first operand A and a divisor D, a radix-N SRT division algorithm to generate a result value Q=A/D, and to perform, in response to a square root instruction identifying a second operand B, a radix-N SRT square root algorithm to obtain a result value Q=√{square root over (B)}, where N is an integer power of 2; wherein the SRT division algorithm and the SRT square root algorithm each comprise a plurality of iterations, each iteration for determining an updated remainder value R i based on a quotient value q i selected for that iteration in dependence on a previous remainder value R i−1 , the updated remainder value from one iteration becoming the previous remainder value for a following iteration, and the result value Q being derivable from the quotient values selected for the plurality of iterations; and the combined divide-square root circuitry comprises shared remainder updating circuitry to generate the updated remainder value for a greater number of iterations per processing cycle for the SRT division algorithm than for the SRT square root algorithm; wherein in the SRT square root algorithm, the i th iteration is for determining the updated remainder value R i based on the previous remainder value R i−1 , the quotient value q i and a partial result value Q i−1 corresponding to a combination of the quotient values selected in the preceding iterations; the partial result value Q i−1 is represented in signed-digit format; and the shared remainder updating circuitry comprises circuitry to perform a calculation for determining the updated remainder value R i with the partial result value Q i−1 remaining in the signed-digit format, when performing the SRT square root algorithm.

20020025517

09188777

1. A method of evolving a biocatalytic activity of a cell, comprising: (a) recombining at least a first and second DNA segment from at least one gene conferring ability to catalyze a reaction of interest, the segments differing from each other in at least two nucleotides, to produce a library of recombinant genes; (b) screening at least one recombinant gene from the library that confers enhanced ability to catalyze the reaction of interest by the cell relative to a wildtype form of the gene; (c) recombining at least a segment from the at least one recombinant gene with a further DNA segment from the at least one gene, the same or different from the first and second segments, to produce a further library of recombinant genes; (d) screening at least one further recombinant gene from the further library of recombinant genes that confers enhanced ability to catalyze the reaction of interest by the cell relative to a previous recombinant gene; (e) repeating (c) and (d), as necessary, until the further recombinant gene confers a desired level of enhanced ability to catalyze the reaction of interest by the cell.

20020091748

09086032

1. A system for learning and applying a task and data parallel strategy to an application including at least one task for processing an input data stream to produce an output data stream, comprising: a controller measuring an execution of the application to generate an action space representing a task and data parallel strategy; a run-time system applying the action space to implement the task and data parallel strategy.

20090234467

12381499

1. An information processing apparatus comprising: model learning means for self-organizing, on the basis of a state transition model having a state and state transition to be learned by using time series data as data in time series, an internal state from an observation signal obtained by a sensor; and controller learning means for performing learning for allocating a controller, which outputs an action, to each of transitions of a state or each of transition destination states in the state transition model indicating the internal state self-organized by the model learning means.

9898567

14629303

1. A computer implemented method of legalizing a circuit layout for manufacturing a circuit, the circuit layout using a plurality of non-uniform grids, the circuit layout comprised of a layout object, the method comprising: generating a set of layout constraints for the layout object based on the plurality of non-uniform grids, the set of layout constraints comprising design rule check constraints and gridding requirements, the gridding requirements being requisites for the layout object to align to one of the plurality of non-uniform grids, the layout object having layout variables to identify a position of the layout object; processing the set of layout constraints to a feasible form for the layout object to be modified to satisfy the set of layout constraints by: assigning Boolean variables to the layout variables, each Boolean variable from the Boolean variables assigned to a corresponding layout variable from the layout variables, determining whether the set of layout constraints is infeasible using the Boolean variables assigned to the layout variables, and responsive to the set of layout constraints determined to be infeasible, (i) identifying an infeasible layout constraint from the set of layout constraints, the infeasible layout constraint causing the set of layout constraints to be infeasible, and (ii) relaxing the identified infeasible layout constraint for the set of layout constraints to be in the feasible form; and generating, by solving the set of layout constraints in the feasible form with a linear program solver, an output circuit layout to provide for manufacture of the circuit.

9954600

15352255

1. A non-transitory computer readable medium, comprising processor executable instructions that when executed by a computer processor disposed within an airborne aircraft cause the computer processor to: command a directional antenna installed on the aircraft and a transceiver disposed within the aircraft to measure a first signal-to-noise ratio of a first communication channel corresponding to a first location on the ground, the first communication channel configured to support transmissions to/from the airborne aircraft; command the directional antenna and the transceiver to measure a second signal-to-noise ratio of a second communication channel corresponding to a second location on the ground, the second communication channel configured to support transmissions to/from the airborne aircraft; calculate a first forward-link user capacity estimate using the first signal-to-noise ratio of the first communication channel; calculate a second forward-link user capacity estimate using the second signal-to-noise ratio of the second communication channel; and calculate a forward-link user capacity matrix using the first forward-link user capacity estimate and the second forward-link user capacity estimate, wherein the forward-link user capacity matrix is utilized to select communication channels to utilize for transmissions between a plurality of ground stations disposed on the ground and the airborne aircraft.

20110296414

12789520

1. A computer-implemented method of upgrading at least one management role in a role-based framework, comprising: updating, by a computer, at least one existing management role, the at least one existing management role comprising a set of existing role entries, the set of existing role entries defining an action with at least one of parameters, scripts, application program interface calls, and a special permission for enabling performance of each of a plurality of tasks defined by the at least one existing management role; updating, by the computer, derived roles in the role-based framework, the derived roles comprising custom management roles derived from the at least one existing management role in the role-based framework; and at least one of deprecating and reducing, by the computer, the at least one existing management role and the derived roles in the role-based framework.

9081605

12053641

1. A conflicting sub-process combination identification method in a system executing a first transaction process having a plurality of first sub-processes and a second transaction process having a plurality of second sub-processes, the first and second transaction processes being executed in parallel, the conflicting sub-process combination identification method comprising the steps of: obtaining a first conflict-less performance index for each of the first sub-processes, while the first transaction process is executed without conflict with the second transaction processes, obtaining a second conflict-less performance index for each of the second sub-processes, while the second transaction process is executed without conflict with the first transaction processes, obtaining a first conflict performance index for each of the first sub-processes, while the first transaction process is executed in a first condition of conflict with the second transaction process, wherein the first condition of conflict is when a first sub-process that requires mutual exclusion begins execution before, and is in conflict with, a second sub-process that requires mutual exclusion, obtaining a second conflict performance index for each of the second sub-processes, while the second transaction process is executed in the first condition of conflict with the first transaction process, obtaining a third conflict performance index for each of the first sub-processes, while the first transaction process is executed in a second condition of conflict with the second transaction process, wherein the second condition of conflict is when a first sub-process that requires mutual exclusion begins execution after, and is in conflict with, a second sub-process that requires mutual exclusion, obtaining a fourth conflict performance index for each of the second sub-processes, while the second transaction process is executed in the second condition of conflict with the first transaction process, and further executing a tabulating step comprising, generating a conflict-less table whose elements are the first conflict-less performance indices for each of the first sub-processes, the second conflict-less performance indices for each of the second sub-processes, a conflict-less total performance index for each of the first sub-processes that is obtained by adding the first conflict-less performance indices corresponding to each first sub-process, and a conflict-less total performance index for each of the second sub-processes that is obtained by adding the second conflict-less performance indices corresponding to each second sub-process, generating a first conflict table whose elements are the first conflict performance indices for each of the first sub-processes, the second conflict performance indices for each of the second sub-processes, a first conflict total performance index for each of the first sub-processes that is obtained by adding the first conflict performance indices corresponding to each first sub-process, and a first conflict total performance index for each of the second sub-processes that is obtained by adding the second conflict performance indices corresponding to each second sub-process, generating a second conflict table whose elements are the third conflict performance indices for each of the first sub-processes, the fourth conflict performance indices for each of the second sub-processes, a second conflict total performance index for each of the first sub-processes that is obtained by adding the third conflict performance indices corresponding to each first sub-process, and a second conflict total performance index for each of the second sub-processes that is obtained by adding the fourth conflict performance indices corresponding to each second sub-process, generating an aggregation table by adding corresponding elements of the first conflict table and the second conflict table, using the aggregation table, obtaining a conflicting value performance index for each of the first and second sub-processes by dividing each of the first conflict total performance indices and each of the second conflict total performance indices by a total number of transaction processes, obtaining differences between the conflicting value performance indices for each of the first and second sub-processes and the conflict-less total performance index, generating a difference table whose elements are a sum of the differences of each combination of first and second sub-processes; a judgment step comprising using the difference table to judge an element having the largest value among elements in the difference table, each element corresponding to a conflicting sub-process combination, wherein the largest value identifies the lamest conflict between sub-processes, and building a performance evaluation model that utilizes the identified largest conflict between sub-processes to reflect the actual performance of the system.

20160078750

14485750

1. A computer-implemented method for usage modeling and intelligent management of patient alarms, comprising: maintaining, in association with an alarm management system, models of patient alarm operations; incorporating, by the alarm management system, into the models of patient alarm operations one or more modeling parameters related to behaviors associated with clinical users; incorporating, by the alarm management system, one or more modeling parameters related to alarm context into the models of patient alarm operations; establishing rules associated with intelligent alarm management, by the alarm management system, based upon the models of patient alarm operations; applying the established rules associated with intelligent alarm management, by the alarm management system, to presentation of alarms to the clinical users; applying the established rules associated with intelligent alarm management, by the alarm management system, to interpretation of alarm responses from the clinical users; and adapting the established rules associated with intelligent alarm management, by the alarm management system, to improve a metric of patient alarm efficacy.

9348392

14021948

1. A computer system for use with a building management system in a building, comprising: a processing circuit configured to use historical data received from the building management system to automatically select a set of variables estimated to be significant to energy usage in the building; wherein the processing circuit is further configured to apply a regression analysis to the selected set of variables to generate a baseline model for predicting energy usage in the building; wherein the processing circuit is configured to calculate enthalpy and to use the calculated enthalpy to calculate heating and cooling energy days; and wherein the processing circuit uses the calculated heating and cooling energy days in the regression analysis rather than degree days.

8065244

12048045

1. A modeling system that comprises: a memory; and a processor coupled to the memory and configured to execute software stored in said memory, wherein said software configures the processor to: create a pool of neural networks trained on a portion of a data set; for each of various coefficient settings for a multi-objective function: apply selective evolution subject to the multi-objective function with that coefficient setting to obtain a corresponding group of neural network ensembles; and select a local ensemble from each said group of neural network ensembles, wherein the selection is based on data not included in said portion of the data set; combine a plurality of the local ensembles to form a global ensemble of local ensembles; and provide a perceptible output based at least in part on a prediction by the global ensemble.

6013456

09245984

1. A method for determining the base sequence of a portion of a single stranded nucleic acid by determining the base sequence of a complementary strand comprising the steps of: a) providing a reaction mixture comprising a single stranded nucleic acid, a capture probe/primer which is complementary to a portion of the single stranded nucleic acid, and a plurality of labeled identical length oligonucleotide 5'-monophsphates wherein each opligonucleotide 5'-monophophate compxises a label that is specific for and identifies that oligonucleotide 5'-monophosphate; b) hybridizing the capture probe/primer with the single stranded nucleic acid to form a captured probe-nucleic acid hybrid; c) ligating more than one of the plurality of the oligonucleotide 5'-monophosphates in a contiguous manner onto the capture probe/primer in one continuous process to synthesize the complementary strand, wherein ligation of oligonucleotide 5'-monophosphates only occurs in the presence of the hybridized primer; d) removing all nonligated oligonucleotide 5'-monophosphates; e) detecting the plurality of labels which were attached in the ligation; f) relating the plurality of detected labels to the identity of their corresponding oligonucleotide 5'-monophosphates; and g) determining the base sequence of the portion of the nucleic acid from the identity of the plurality of oligonucleotide 5'-monophosphates identified in step f.

10070615

15456614

1. A plant, a plant part, or a seed of soybean variety CL1463739, wherein a representative sample of seed of said soybean variety CL1463739 has been deposited under ATCC Accession Number PTA-123827.

20080097948

11929170

1. (canceled)

20140280173

13802164

1. A computer implemented system for validating a document classification process, the system comprising: a document collection; a document classification process performed on the document collection; a random selection module configured to automatically generate a random validation set of documents from the document collection; and a document review process performed on the random validation set of documents to validate results of the document classification process, wherein the system is configured to dynamically and in real-time measure and display on a computer display device a best case estimate of a quality of the results of the document classification process based on the documents that are validated, and given a size of a total data set of the document collection.

9886525

15381518

1. A system comprising: a data store configured to store data items and probabilities; and a processor in communication with the data store, the processor configured to execute specific computer-executable instructions to at least: receive information regarding a first data item; determine a geographic location of the first data item; determine, based at least in part on a risk model, an event probability associated with a geographic region, the event probability indicating a probability that an event affecting the geographic region will occur, the geographic region including the geographic location of the first data item; obtain, from the data store, a plurality of data items, wherein each of the plurality of data items is associated with a respective geographic location in the geographic region; determine, based at least in part on the risk model, the event probability, and one or more attributes of the first data item, a probability that the event will change a first attribute of the first data item, and a predicted attribute change to the first attribute of the first data item; for individual data items of the plurality of data items, determine, based at least in part on the risk model, the event probability, and one or more attributes of the data item, a probability that the event will change the first attribute of the data item, and a predicted change to the first attribute of the data item; determine a probability associated with the geographic region based at least in part on the event probability, the probabilities that the event will change the first attributes, and the predicted changes to the first attributes; determine a probability category of the first data item based at least in part on: the probability associated with the geographic region, the probability that the event will change the first attribute of the first data item, and the probabilities that the event will change the first attribute of individual data items of the plurality of data items; generate for display a user interface, the user interface including at least: a geographic map identifying the geographic region, the geographic location of the first data item, and the geographic locations of the plurality of items, wherein a shading of an icon displayed at the geographic location of the first data item indicates the probability category of the first data item, and wherein a size of the icon indicates the predicted change to the first attribute of the first data item; and cause display of the user interface.

8027401

11640618

1. An iterative detection and decoding method in a Multiple Input Multiple Output (MIMO) system, comprising the steps of: generating soft decision values by performing a detection of an entire set of MIMO nodes; decoding a first decoding station using the generated soft decision values to produce a first decoding value; re-generating soft decision values by performing a redetection of a first MIMO node, from the set of MIMO nodes, that corresponds to the first decoding station, when a variation between the first decoding value and a corresponding one of the generated soft decision values is greater than a reference value; decoding a second decoding station using at least one of the generated soft decision values and the re-generated soft decision values to produce a second decoding value; and re-generating soft decision values by performing a redetection of a second MIMO node, from the set of MIMO nodes, that corresponds to the second decoding station, when a variation between the second decoding value and a corresponding one of the generated soft decision values is greater than the reference value; wherein the decoding step and the re-generating step are performed a number of times equal to a total number of decoding stations and the number of decoding and regenerating steps are iterated at least one time.

9990582

15417986

1. A method for refining cognitive insights using cognitive graph vectors comprising: storing data from a plurality of data sources within a cognitive graph via a cognitive inference and learning system, the cognitive graph representing a data domain; associating a first set of the data of the data domain within the cognitive graph with a first cognitive graph vector of a plurality of cognitive graph vectors via the cognitive inference and learning system, the first cognitive graph vector extending away from a cognitive graph nexus in a first direction; associating a second set of the data within the cognitive graph with a second cognitive graph vector of the plurality of cognitive graph vectors via the cognitive inference and learning system, the first cognitive graph vector extending away from a cognitive graph nexus in a first direction; processing the data from the plurality of data sources to provide cognitive insights via the cognitive inference and learning system; and refining the cognitive insights based upon a limitation relating to one of the plurality of cognitive graph vectors via the cognitive inference and learning system, the limitation corresponding to a selected cognitive graph vector parameter.

9038016

13453417

1. A computer-implemented method comprising: receiving a graphical specification of a parent class of graphical objects in a graphical modeling environment; receiving a graphical specification of a first child class of graphical objects and a second child class of graphical objects in the graphical modeling environment, wherein: the first child class of graphical objects is a first subclass of the parent class of graphical objects in a hierarchy of classes of graphical objects, the second child class of graphical objects is a second subclass of the parent class of graphical objects in the hierarchy of classes of graphical objects, and the first child class of graphical objects and the second child class of graphical objects depend respectively on the parent class of graphical objects for common features that are shared by the first child class of graphical objects and the second child class of graphical objects; receiving an instruction to incorporate an instance of the parent class of graphical objects into an executable graphical model in the graphical modeling environment; instantiating an instance of the first child class of graphical objects and an instance of the second child class of graphical objects in the executable graphical model; executing the executable graphical model; and dynamically switching, using a processor, between the instance of the first child class of graphical objects and the instance of the second child class of graphical objects during the execution of the executable graphical model.

20130275752

13449216

1. A computer-executable method, comprising: receiving, at a computing system, multiple encrypted datasets from multiple clients, wherein an encrypted dataset associated with a client is encrypted from a corresponding plaintext dataset using a unique, client-specific encryption key; re-encrypting the multiple encrypted datasets to a target format; evaluating a function based on the re-encrypted multiple datasets to produce an evaluation outcome; and sending the evaluation outcome to the multiple clients, which are configured to cooperatively decrypt the evaluation outcome to obtain a plaintext evaluation outcome.

8734257

13250835

1. A wager gaming player polling server comprising: a communications interface; a memory; and a logic device, the logic device, the memory, and the communications interface operably connected and configured to: determine a first plurality of candidates for inclusion in a first poll, the first plurality of candidates including a first candidate, receive input, via the communications interface, indicating a first quantity of voting points associated with a first player to apply towards the first candidate in the first poll, determine, based on a total number voting points applied to each candidate in the first plurality of candidates by players in a plurality of players, the first player included in the plurality of players, a ranking for each candidate in the first poll; determine that a voting point retention condition has been met with respect to the first poll; and maintain the association of the first quantity of voting points with the first player at least until a second poll is conducted.

20110282568

12912183

1. A method comprising: receiving at a user interface located on a host aircraft a user selection of one or more display parameters; receiving target aircraft information from a communications system on the host aircraft; generating a graphical user interface display for presentation on a display coupled to a processing device on the host aircraft, the graphical user interface display comprising: a main section configured to present one of a plan view or In-Trail Procedure (ITP) vertical profile view; an ITP procedural guidance section; a target status section; and an advisory message section, wherein one or more target icons based on the received target aircraft information and the received one or more display parameters are presented in the main section, wherein the ITP vertical profile view includes ITP distance information; and receiving a user selection of a desired flight level (FL).

20100017760

12248710

1. A method for developing a scan-based test design for an integrated circuit design, comprising the steps of: developing a plurality of candidate test designs for the circuit design, including generating a plurality of test vectors in dependence upon the circuit design; generating a test protocol figure of merit for each of the candidate test designs; and selecting, in dependence upon a comparison of the test protocol figures of merit generated for each of the candidate test designs, one of the candidate test designs for implementation in an integrated circuit device, wherein the step of generating a plurality of test vectors employs a predetermined automatic test pattern generation algorithm, and wherein the step of generating a test protocol figure of merit for each of the candidate test designs comprises the step of determining the test protocol figure of merit for each particular candidate test design using only a sampling of the test vectors that would be generated if the predetermined automatic test pattern generation algorithm were run to completion.

9983115

14860050

1. A system for analyzing particles in a fluid, the system comprising: a flow chamber for receiving a sample of fluid to be analyzed; one or more detectors positioned to detect two different ranges of fluorescence produced by particles in the fluid in said flow chamber, said detectors generating a trigger signal whenever fluorescence is detected; a classifier training set containing organism type and feature values, wherein the classifier training set comprises a matrix having at least one row of each image of a library of images with particle type and at least another row of feature values for particles; and a support vector machine classifier training set including related particle images, wherein feature values of captured images are calculated and the support vector machine classifier training set is applied to captured images to classify the particle associated with each image.

7743007

11540927

1. A system comprising: means for providing a graphical illustration of a first possible outcome of a use of a treatment parameter with respect to at least one body portion, based on a first dataset associated with a first predictive basis; and means for modifying the graphical illustration to illustrate a second possible outcome of the use of the treatment parameter, based on a second dataset associated with a second predictive basis.

20150086128

14490646

1. A method for filtering an image using a guided image filter, wherein a filtering output is computed using a guidance image, wherein confidence values associated to a filter input are taken into account for calculating the filtering output.

8423952

12240084

1. A method for automatic extraction of process goals from a semantically annotated structured process model of a process comprising model elements comprising functions and events named by natural language expressions and annotated with semantic linkages to a reference process ontology comprising the steps of: (a) splitting said process model, at each exit split connector that leads to more than one end event, into a plurality of partial process models separated for each end event of said process model, such that each partial process model of the plurality of partial process models has one or more of the model elements and only one end event; (b) creating for each partial process model an annotated partial process model by separately annotating the one or more of the model elements of each partial process model with extracted process goals and constraints, such that (1) each start event is annotated with an extracted root goal constraint, (2) each function is annotated with an extracted process goal, (3) each event is annotated with an extracted local goal constraint, and (4) the end event is annotated with an extracted root goal, wherein each process goal represents a purpose or an outcome of process; (c) decoupling of the process goals from each annotated partial process model; and (d) generating a hierarchical process goal tree for each annotated partial process model by organizing the decoupled process goals as goal nodes into the hierarchical process goal tree starting with the end event as a root goal node that is decomposed into a set of subgoals by inserting the goal nodes and decomposition nodes into the goal tree depending on the annotated model elements detected.

10126397

14707598

1. A method for reconstructing an image of a subject from data acquired using a magnetic resonance imaging (MRI) system, the steps of the method comprising: (a) providing data acquired from a subject using an MRI system; (b) computing an inverse of an encoding matrix using a hierarchically semiseparable solver; (c) reconstructing an image of the subject from the provided data using the computed inverse of the encoding matrix.

20110257830

13134801

1. A method of calculating a true aircraft cornering friction coefficient of an aircraft runway or an aircraft taxiway, using an aircraft, comprising the steps of: (A) Obtaining one or more sets of data points recorded on an aircraft flight data management system mounted on the aircraft, wherein the aircraft is proceeding or has proceeded on the aircraft runway or on the aircraft taxiway, wherein the one or more sets of the data points that were obtained from the aircraft's flight data management system include one or more sets of data points recorded on the aircraft's flight data management system substantially between a predetermined start time until a predetermined finish time thereafter, and wherein the one or more sets of the data points obtained from the aircraft's flight data management system include one or more sets of data points relating to one or more of the aircraft's following properties: aircraft ground speed, aircraft brake pressure, aircraft longitudinal acceleration, aircraft engine thrust setting, aircraft reverse thrust setting, aircraft engine revolutions per minute, aircraft air speed, aircraft vertical acceleration, aircraft spoiler setting, aircraft airbrake setting, aircraft aileron setting, aircraft flap configuration, aircraft pitch, and aircraft autobrake setting; (B) Obtaining one or more sets of data points relating to one or more environmental parameters measured substantially in the vicinity where the aircraft is proceeding or has proceeded on the aircraft runway or on the aircraft taxiway, wherein the one or more sets of the data points relating to the one or more environmental parameters are measured substantially between the predetermined start time until the predetermined finish time thereafter, and wherein the one or more sets of the data points relating to the environmental parameters that were obtained relate to one or more environmental parameters chosen from the following group: air temperature, air pressure, relative humidity, wind speed, wind direction, pressure altitude, and aircraft landing surface elevation; (C) Obtaining one or more sets of data points relating to one or more aircraft parameters pertaining to the aircraft that is proceeding or has proceeded on the aircraft runway or on the aircraft taxiway, wherein the one or more sets of the data points relating to the one or more aircraft parameters that were obtained relate to one or more aircraft parameters chosen from the following group: aircraft mass, aircraft engine type, number of aircraft engines, aircraft tire type, and aircraft type; (D) Transmitting to a computer: (i) the one or more sets of the data points obtained from the aircraft's flight data management system, (ii) the one or more sets of the data points relating to the environmental parameters that were obtained, and (iii) the one or more sets of data points relating to aircraft parameters pertaining to the aircraft that were obtained; and (E) Using the computer to calculate the true aircraft cornering friction coefficient of the aircraft surface: (i) using at least one of the one or more sets of the data points transmitted from the aircraft's flight data management system to the computer, (ii) using at least one of the one or more sets of the data points relating to environmental parameters transmitted to the computer, and (iii) using at least one of the one or more sets of the data points relating to aircraft parameters pertaining to the aircraft transmitted to the computer.

20100325082

12718219

1. A computer system for analyzing a scenario task to determine contextual characteristics thereof, said system comprising: an analytical processing device configured to parse a scenario task into parsed task requirements, the scenario task being at least partially associated with a cultural group of human subjects; an associative processing device configured to receive the parsed task requirements and to: associate a task requirement identifier with each parsed task requirement; associate each parsed task requirement with a task requirement resolution factor; and associate the task requirement identifiers to define a task requirement model; a correlative processing device configured to correlate the task requirement model with a database of scenario data elements, each scenario data element having one of a scenario data element identifier and a scenario resolution factor associated therewith, by correlating one of the task requirement identifiers and the task requirement resolution factors with the respective one of the scenario data element identifiers and the scenario resolution factors; and a compilation processing device configured to compile the correlated scenario data element identifiers and scenario resolution factors to form contextual characteristics having categories, attributes, parameters, and parameter values associated with the correlated scenario data element identifiers and scenario resolution factors, the contextual characteristics cooperating to populate the task requirement model.

10133729

14839281

1. A system comprising: one or more processors; and a memory storing instructions which, when executed by one or more processors, cause the one or more processors to perform operation comprising: receiving a query comprising one or more words; computing a vector for individual words of the one or more words; determining an initial hidden vector corresponding to a semantic representation of the query; mapping, using mapping software, the one or more words of the query based on the initial hidden vector, wherein the mapping is rendered sequentially; matching the semantic representation of the query, represented in the initial hidden vector, to a semantic representation corresponding to one or more responses; providing, in a user interface, the one or more responses based at least in part on the matching, the user interface indicating a semantic similarity between the query and the one or more responses; receiving click-through data associated with the one or more responses, the click-through data identifying a response from among the one or more responses as a positive match; and training the mapping software based at least in part on the click-through data.

20170140275

15417986

1. A method for refining cognitive insights using cognitive graph vectors comprising: storing data from a plurality of data sources within a cognitive graph via a cognitive inference and learning system; associating a first set of the data within the cognitive graph with a first cognitive graph vector of a plurality of cognitive graph vectors via the cognitive inference and learning system; associating a second set of the data within the cognitive graph with a second cognitive graph vector of the plurality of cognitive graph vectors via the cognitive inference and learning system; processing the data from the plurality of data sources to provide cognitive insights via the cognitive inference and learning system; and refining the cognitive insights based upon a limitation relating to one of the plurality of cognitive graph vectors via the cognitive inference and learning system.

20150243282

14698183

1. A method comprising: identifying an acoustic model, wherein the acoustic model is trained on native speech in a target dialect; and replacing, via a processor, a phoneme in the acoustic model with a modified phoneme, wherein the modified phoneme is a weighted sum of plausible phonemes in a lattice of plausible phonemes associated with a class of a speaker.

20070061356

11225861

1. A method for generating a document summary, the method comprising: providing a document model for the document; calculating a score based on normalized probabilities for sentences of the document based on the document model; and selecting one or more sentences based on the scores to form the summary of the document.

8190550

12481802

1. A method comprising: partitioning a region of interest into a plurality of soft bin regions that span the region of interest; estimating an integral over each soft bin region of a function defined over the region of interest; and outputting a value equal to or derived from the sum of the estimated integrals over the soft bin regions spanning the region of interest.

20120150845

13399839

1. A method for collapsing search results, the method comprising: receiving, at a computer, user input to perform a search of a communications network; performing, with the computer, the search based on the user input to generate the search results, wherein the search results include one or more advertisements; displaying the search results and a plurality of selection elements for removing each of the search results; receiving, at the computer, a user selection of a selection element associated with a search result; automatically extracting, with the computer, information from the search result to generate one or more logic statements indicating a reason for the user selection; prompting the user to select one or more of the one or more logic statements that are true for the user; determining, with the computer, irrelevant results that are similar to the search result, in response to the one or more logic statements selected by the user; and collapsing, with the computer, the search results to remove the search result and the irrelevant search results.

20120310930

13219846

1. A method of suggesting keywords for a litigation hold, comprising: receiving a seed set of keywords; identifying, by one or more processing devices, a set of documents corresponding to the seed set of keywords; receiving an indication of relevance for one or more documents in the set of documents; generating, by one or more processing devices, a suggested set of keywords, wherein each keyword in the suggested set of keywords is determined to be discriminatory based on the indications of relevance, wherein each keyword in the suggested set of keywords is external to the seed set of keywords, and wherein the set of documents corresponds to the seed set of keywords and the suggested set of keywords; and providing the suggested set of keywords to a client.

9122912

13802270

1. A method comprising: obtaining a plurality of photos associated with a target user in a social network system; detecting a face of one or more persons in the plurality of photos, wherein the detecting of each face includes applying a face detection algorithm; computing significance values for the faces, wherein each significance value indicates a degree of significance between the target user and each person represented by each face; generating a significance ranking of the significance values; determining a group of photos for the target user based on the significance ranking, wherein the determining of the group of photos includes applying a clustering algorithm to consolidate multiple appearances of a same face in the plurality of photos, and wherein the applying of the clustering algorithm includes: determining a quality value for each photo that includes the same face, wherein the quality value is based on a combined score of two or more of a face detection confidence score, size, visibility, sharpness, and a facial orientation estimate; generating a quality ranking of the quality values; and selecting a representative photo to represent the same face in the group of photos based on the quality ranking; transmitting the group of photos to the target user; and enabling the target user to take one or more predetermined actions associated with one or more photos of the group of photos.

8015125

11847942

1. A method of searching a database for a solid model comprising the steps of: providing a query model; determining a first set of values based on predetermined properties of said query model; wherein said first set of values includes at least a first set of distances between points on triangular faces of said query model, said distances being determined by determining an angular shortest path between two triangular faces on said query model, wherein the angular shortest path on the query model is the shortest path on the surface of the training model which is computed in terms of an angular difference between the two triangular faces on the query model; comparing said first set of values to a second set of values that is determined by predetermined properties for a group of models for training, said predetermined properties of said models for training including at least a second set of distances between points on triangular faces of the models for training, said second set of distances being determined by determining an angular shortest path between two triangular faces on said models for training, wherein the angular shortest path on the model for training is the shortest path on the surface of the model for training which is computed in terms of an angular difference between the two triangular faces on the model for training; and indexing, classifying and partially matching said query model with one or more models for training based on said comparing step.

20060155799

11090274

1. A high-speed information processing apparatus comprising: a conversion processing section operable to model a plurality of distributed information processing resources through definition of the plurality of information processing resources by attributes thereof and to assign a collaborative relationship to modeled information processing resources obtained through the modeling.

8117016

12105104

1. A method of performing production operations of an oilfield having at least one process facility and at least one wellsite operatively connected thereto, each at least one wellsite having a wellbore penetrating a subterranean formation for extracting fluid from an underground reservoir therein, the method comprising: identifying a plurality of simulators from a group consisting of a wellsite simulator for modeling at least a portion of the wellsite of the oilfield and a non-wellsite simulator for modeling at least a portion of a non-wellsite portion of the oilfield; defining a first condition based on comparing a value of a first variable of the plurality of simulators to a threshold using a comparative operator, the threshold comprising at least one selected from a group consisting of a pre-determined value and a second variable of the plurality of simulators; defining a first action based on applying an action operator to a control parameter of the plurality of simulators; defining a first strategy template comprising the first condition and the first action, wherein execution of the first action during simulation is determined based on the first condition in view of a logical relationship; developing a first strategy for managing the plurality of simulators during simulation, wherein the first strategy is developed using the first strategy template by: defining the logical relationship for determining the execution of the first action based on the first condition during simulation; configuring the first condition by associating the first variable to a first simulator of the plurality of simulators and to a first entity of the oilfield, the value of the first variable being published by the first simulator during simulation of the first entity; and configuring the first action by associating the control parameter to a second simulator of the plurality of simulators and to a second entity of the oilfield, the second simulator performing simulation responsive to the control parameter of the second entity; and selectively simulating the operations of the oilfield using the plurality of simulators based on the first strategy.

9854064

15273563

1. A system comprising: at least one device including a hardware processor; the system being configured to perform operations comprising: receiving a request for a webpage corresponding to a Uniform Resource Locator (URL); identifying the webpage corresponding to the URL; transmitting the webpage responsive at least to receiving the request for the webpage; mapping the URL to at least one variation of data, functions, or content assets; transmitting, via a computer network, the mapping to a content generator; injecting, by the content generator via a call to a source of new data, the at least one variation of data, functions, or content assets into a web browser application or a web-based console to obtain an optimized webpage.

9252942

13449216

1. A computer-executable method, comprising: receiving, at a computing system, multiple encrypted datasets from multiple clients, wherein an encrypted dataset associated with a client is encrypted from a corresponding plaintext dataset using a unique, client-specific encryption key, wherein the client-specific encryption key is a public key selected from a public/private key pair; re-encrypting the multiple encrypted datasets to a target format, comprising, receiving a set of re-encryption keys, wherein a particular re-encryption key corresponding to the client is used to re-encrypt the encrypted dataset associated with the client, wherein the re-encryption key corresponding to the client is generated using a private key selected from the public/private key pair and a target public key published by a trusted third party, wherein the target public key corresponds to a target private key and each client receives a share of the target private key; evaluating a function based on the re-encrypted multiple datasets to produce an evaluation result; and sending the evaluation result to the multiple clients, which are configured to cooperatively decrypt the evaluation result to obtain a plaintext evaluation result using shares of the target private key.

7779122

12127916

1. A computer-implemented method of automatically identifying an optimal set of attributes of entities to facilitate generating best practices for configuring a networked system, comprising: ranking, by a computing system and based on a plurality of information gain values, a plurality of entity types of a plurality of entities included in said networked system; determining, by said computing system and subsequent to said ranking, a first classification accuracy relative to a first entity type, wherein said first entity type is a highest ranked entity type of said plurality of entity types based on said ranking or is a first aggregate entity type associated with two or more entity types of said plurality of entity types; selecting, by said computing system and subsequent to said determining said first measurement, a second entity type of said plurality of entity types, wherein said selecting is based on said ranking; performing, by said computing system, a database join operation on a first set of one or more attributes of one or more entities of said first entity type and a second set of one or more attributes of one or more entities of said second entity type, wherein a result of said performing is a second aggregate entity type; determining, by said computing system, a second classification accuracy relative to said second aggregate entity type; determining, by said computing system, that said second classification accuracy is less than or equal to said first classification accuracy; identifying, by said computing system and in response to said determining that said second measurement is less than or equal to said first measurement, an optimal set of one or more attributes as said first set of one or more attributes, wherein said optimal set contributes to a problem associated with said networked system; and storing said optimal set in a data repository coupled to said computing system.