Datasets:

patent

/

AIPD_evo_claim_one

like 0

20150039145

13955575

1. A method of controlling operation of a microgrid which comprises a plurality of distributed energy resources including controllable distributed electric generators and electrical energy storage devices, the method comprising: periodically updating a distributed energy resource schedule for the microgrid that includes on/off status of the controllable distributed electric generators and charging/discharging status and rate of the electrical energy storage devices and which satisfies a first control objective for a defined time window, based at least in part on a renewable energy generation and load forecast for the microgrid; and periodically determining power set points for the controllable distributed energy resources which satisfy a second control objective for a present time interval within the defined time window, the second control objective being a function of at least the distributed energy resource schedule for the microgrid.

20070260895

11381391

1. A computer implemented method for optimizing thermal performance of a computer system, the computer implemented method comprising: identifying a set of processor cores associated with the computer system; requesting a thermal index for each of the set of processor cores to form a set of thermal indexes; ranking the processor cores based on the set of thermal indexes; and mapping software to execute on an optimal processor core form the set of processor cores based on the ranking.

6023670

08769842

1. A method for identifying the language of a document in which a computer document is written, comprising the steps of: comparing a plurality of words from the document to a word list associated with a candidate language, wherein words in the word list are a selection of a small number of the most frequently used words in the candidate language; accumulating a count of matches between words in the document and words in the word list for each word in the word list to produce a sample count for each word in the word list; correlating the sample count to a reference count for each word in the word list for the candidate language to produce a correlation score for the candidate language, wherein the correlation score is a statistical measure of a collective strength of association between the sample counts and reference counts; and identifying the language of the document based on the correlation score.

8775447

13166365

1. A method for processing related datasets, the method including: receiving over an input device or port records from multiple datasets, the records of a given dataset having one or more values for one or more respective fields; and processing records from each of the multiple datasets in a data processing system, the processing including analyzing at least one constraint specification stored in a data storage system to determine a processing order for the multiple datasets, the constraint specification specifying one or more constraints for preserving referential integrity or statistical consistency among a group of related datasets that includes the multiple datasets, applying one or more transformations to records from each of the multiple datasets in the determined processing order, where the transformations are applied to records from a first dataset of the multiple datasets before the transformations are applied to records from a second dataset of the multiple datasets, and the transformations applied to the records from the second dataset are applied based at least in part on results of applying the transformations to the records from the first dataset and at least one constraint between the first dataset and the second dataset specified by the constraint specification, and storing or outputting results of the transformations to the records from each of the multiple datasets.

20150229540

14428729

1. A service-based communication network evaluation method, comprising: obtaining basic network data on a network element management system (EMS); and sending an evaluation execution command to the EMS to obtain service type data of a service to be evaluated and single-point network element data on a service link, and evaluating and analyzing the service type data and the single-point network element data according to an evaluation rule of a preset evaluation item, so as to obtain a service evaluation result with the service as granularity.

9177349

13092764

1. A computer-implemented method for dynamically linking a third-party web page to a dynamically updateable Internet-accessible report estimating a value or value range for a particular identified maintainable intellectual property asset of interest related to a commercial product associated with the third-party web page, the computer-implemented method comprising: repeatedly monitoring, by an automated web crawler, a plurality of third-party web pages associated with commercial products; analyzing data accessed by the automated web crawler to determine associations between the commercial products and intellectual property assets; storing in an electronic database URL address data that links the intellectual property assets with third-party web pages having commercial products determined to be associated with the intellectual property assets; storing a first series of data comprising selected metrics quantifying certain selected characteristics of a first population of maintainable intellectual property assets for which maintenance fee payments have been made; storing a second series of data comprising selected metrics quantifying said selected characteristics of a second population of maintainable intellectual property assets for which maintenance fee payments have not been made; constructing, by a computer system comprising one or more hardware processors, a predictive model based on said stored first and second series of data, said predictive model being operable to generate an estimated ex ante probability that is predictive of the maintenance fee payment having either been paid or not paid relative to each intellectual property asset in said first or second populations of maintainable intellectual property assets; providing as input to said predictive model a third series of data comprising selected metrics quantifying said selected characteristics of said particular identified maintainable intellectual property asset of interest and operating said predictive model, by the computer system, to calculate an estimated probability of a maintenance fee payment being made in the future relative to said identified maintainable intellectual property asset of interest; estimating a value distribution curve, the shape of the curve generally representing an approximated or assumed distribution of value by percentile rankings within a selected population of maintainable intellectual property assets; using said value distribution curve to estimate a value or value range for said particular identified maintainable intellectual property asset of interest based at least in part on a percentile ranking derived from said estimated probability of said maintenance fee either being paid or not being paid in the future relative to said particular identified maintainable intellectual property asset of interest; and displaying or causing to be displayed via a graphical user interface of an Internet web browser a dynamically updateable interactive report, the interactive report comprising an indication of the estimated value or value range for said particular identified maintainable intellectual property asset of interest, the interactive report further comprising a clickable hyperlink generated based on the stored URL address data, the clickable hyperlink configured to cause the graphical user interface of the Internet web browser to display a third-party web page associated with a commercial product related to said particular identified maintainable intellectual property asset of interest.

8185903

11956167

1. A computer implemented method for system management, the computer implemented method comprising: responsive to receiving a set of application tasks from a registration module during application run-time, registering the set of application tasks and a set of system management tasks to form a schedule of tasks based on a set of policies stored in a policy database, wherein the set of policies comprises a type of a task, an importance of the task, and a probable time to complete the task, wherein the set of application tasks comprises a set of one or more sub-processes of an application to perform in order to execute the application, and wherein the set of system management tasks comprises a set of one or more tasks performed to maintain and manage system resources and facilitate operation of an operating system and the application; performing a feasibility analysis on the schedule of tasks to evaluate the schedule of tasks to: determine if the schedule of tasks can execute within constraints specified in the set of policies, and determine an order to execute the schedule of tasks by, identifying periods of decreased system activity, wherein the periods of decreased activity comprises of blocks of time within the schedule of tasks where no application task is currently scheduled to execute, within which to order the schedule of tasks to execute a system management task within the set of system management tasks; generating a prioritized schedule of tasks to execute in order based on the feasibility analysis that identifies an order for completing each task in the prioritized schedule of tasks; wherein priorities are assigned to each task in the prioritized schedule of tasks according to a scheduling policy; and wherein the set of system management tasks further comprises at least one of garbage collection and compiling.

20050004856

10837871

1. A system for facilitating financial advising and planning, comprising: a stochastic modeling module for facilitating use of data from the financial portfolio planning of a user in a stochastic modeling analysis using at least one of a stationary bootstrap sampling method and a synchronous stationary bootstrap sampling method to facilitate financial portfolio planning of the user and creation of a proposed situation portfolio for the user.

7797319

11383480

1. A computer system implemented method for providing a requested data set based on a first schema, the computer system comprising at least one processor, memory and a data store, the method comprising: providing a mapping in the memory between the first schema based on a first data model and a second schema based on a second data model, wherein the first data model is a different data model than the second data model; providing a relation store in the memory; receiving a first plurality of statements based on the first schema and the first data model requesting a first plurality of data sets; composing a first plurality of algebraic relations between data sets based on the first plurality of statements, wherein each of the algebraic relations in the first plurality of algebraic relations comprises a respective first expression including a symbolic representation of at least a first respective data set, a respective second expression including a symbolic representation of at least a second respective data set, and a relational operator symbolically defining a mathematical relationship between the respective first expression and the respective second expression; storing the first plurality of algebraic relations between data sets in the relation store; receiving a second plurality of statements based on the second schema and the second data model requesting a second plurality of data sets; composing a second plurality of algebraic relations between data sets based on the second plurality of statements, wherein each of the algebraic relations in the second plurality of algebraic relations comprises a respective first expression including a symbolic representation of at least a first respective data set, a respective second expression including a symbolic representation of at least a second respective data set, and a relational operator symbolically defining a mathematical relationship between the respective first expression and the respective second expression; storing the second plurality of algebraic relations between data sets in the relation store; retrieving at least one algebraic relation from the first plurality of algebraic relations from the relation store, and retrieving at least one algebraic relation from the second plurality of algebraic relations from the relation store; composing an algebraic relation defining a result equal to the requested data set based, at least in part, on the at least one algebraic relation from the first plurality of algebraic relations and the at least one algebraic relation from the second plurality of algebraic relations; and using the algebraic relation defining a result equal to the requested data set and the mapping between the first schema and the second schema to provide the requested data set.

8350120

12718794

1. A method of making a mini-chromosome, comprising identifying a centromere nucleotide sequence in a genomic DNA library using a multiplicity of diverse probes, and constructing a mini-chromosome comprising the centromere nucleotide sequence, wherein the centromere nucleotide sequence is derived from a crop plant centromere; wherein the centromere comprises at least five copies of a repeated nucleotide sequence that is about 75 base pairs to about 210 base pairs, and wherein the mini-chromosome has a transmission efficiency during mitotic division of at least 90%.

20100281256

12433732

1. A hashing method performed by a computing apparatus and comprising the acts of: (a) receiving a message at an input port; (b) storing the received message at a first computer readable storage medium coupled to the input port; (c) generating a pseudo random or derived value from a portion of the stored message by a processor coupled to the first storage medium; (d) the processor determining a description from the pseudo random or derived value, the description including a form parameter, a color parameter, and a position parameter; (e) storing a set of values representing a matrix in a second computer readable storage medium coupled to the processor, the matrix representing a board in a tetromino stacking algorithm, and the form, color and position parameters representing attributes of a piece in the stacking algorithm; (f) updating the matrix by applying the stacking algorithm to the matrix and the description; (g) repeating acts (c), (d), (e), and (f) until the stacking algorithm reaches a predetermined state; (h) using the updated matrix resulting from act (g) to provide a hash value of the message; and (i) the processor storing the hash value in a third computer readable storage medium.

20040059697

10253041

1. A tool for analyzing a given pair of data sets, the tool comprising: a counter for determining occurrences of each feature in the set; and using said occurrences, a scorer for summarizing differences between features in the pair of data sets by determining an individual score for each of said features according to an inverse cumulative probability function.

9008386

13501466

1. A method of optimizing workflow for an intervention relating to a heart valve replacement, comprising: reconstruction of an image of a target area representative of the intervention based on an imaging dataset, wherein the target area comprises a heart valve and a portion of a lumen arranged in fluid communication with the heart valve; automatically selecting an optimal viewing direction for enabling a pre-operative quantitative analysis of features of the intervention; and using the image of the target area to calculate a reference line that is used to automatically derive an optimal image projection of the target area.

20160146118

14555130

1. A control method for optimizing an operation of a power plant having generating units during a selected operating period, wherein the selected operating period is subdivided so to include regular intervals within which each of the generating units comprises one of an on-condition and an off-condition, wherein unique combinations of which of the generating units comprise the on-condition and which the off-condition define competing operating modes within the intervals, the control method comprising the steps of: determining a preferred case for each of the competing operating modes for each of the intervals; based upon the data relating to the preferred cases, selecting proposed turndown operating sequences for the selected operating period, wherein each of the proposed turndown operating sequences describe an unique progression of the off-condition and the on-condition for the generating units through the intervals of the selected operating period; for each of the proposed turndown operating sequences, determining a shutdown operation for each of the generating units comprising the off-condition for one or more intervals during the selected operating period and, therefrom, calculating a shutdown economic outcome; for each of the proposed turndown operating sequences, determining a turndown operation for each of the generating units comprising the on-condition for one or more intervals during the selected operating period and, therefrom, calculating a turndown economic outcome; given the shutdown and turndown economic outcomes, calculating a sequence economic outcome for each of the proposed turndown operating sequences; and comparing the sequence economic outcomes, and based thereupon, outputting a preferred turndown operating sequence.

8374840

12578855

1. A method for generating test vectors in cyber-physical systems, comprising: generating traces of a system model combining discrete and continuous state components as a dense-time model stored in memory using a simulation engine by using a computer processor; globally optimizing simulated inputs using a fitness objective computed using the computer processor, the simulation inputs being sampled in regions of state-space and being adjusted in accordance with feedback from the traces and fitness objective values by computing a distance between the fitness objective value and a reachability objective; searching for safety violations of systems that include non-linear dynamics using sampling in the state space; globally optimizing by use of a failed distance to compute a fitness value and a “Hit-and-Run” Monte-Carlo based sampling in a hybrid discrete continuous space; wherein globally optimizing includes sampling inputs to minimize the fitness objective value using a failed distance method, wherein globally optimizing further includes receiving feedback from the traces and updated fitness values to compare the fitness values to the reachability objectives such that an input vector set is steered to an improved set of input vectors in accordance with a constraint to limit regions of state space that are sampled; testing a system model or a program by answering reachability questions for the system model or program by searching for safety violations that include non-linear dynamics by sampling in the state-space; and using the processor, outputting test input vectors based upon optimized fitness objective values associated with the simulated inputs to test the system model or program stored in memory.

7765123

11879979

1. A method executed by a computer of performing forecasting, comprising: receiving a first data collection having data values at first intervals; building, by the computer, a first forecasting model based on the first data collection; building, by the computer, a second forecasting model based on a second data collection having intervals aggregated from intervals of the first data collection, wherein the second forecasting model is at a different aggregation level than the first forecasting model; and computing, by the computer, metrics by performing tests on the first and second data collections to determine which of the first and second forecasting models has a better forecast quality.

8341097

12696317

1. A system for computations to learn the relationships and patterns in a set of observed objects, the system comprising: circuitry configured to implement parallel and sequential implementation versions of an algorithm for search and sampling of structures; and perform two dimensional encoding of ordering between the variables to facilitate efficient computations, fixed point representation of values for efficient computation.

8874464

12275938

1. A method performed by a computer, the computer including a processor coupled to a memory, the method comprising: implementing, by the computer, an additional business model on an existing productive system landscape having an existing business model, the implementing of the additional business model comprising: generating, by the computer, a first snapshot and a second snapshot of the existing productive system landscape; wherein the first and second snapshots are copies of the existing productive system landscape; modifying, by the computer, the second snapshot after generation of the second snapshot to include the additional business model; and comparing, by the computer, the modified second snapshot with the first snapshot; identifying, by the computer, a delta between the second and first snapshot; maintaining, by the computer, the existing business model in the existing productive system landscape independently from the implementing of the additional business model on the existing productive system landscape; applying, by the computer, the identified delta to the existing productive system; and deploying, by the computer, the additional business model and the existing business model together within the existing productive system landscape.

7716630

11169014

1. A method for ordering parameters in a graph-based computation including: determining, by a processor, a desired first ordering of a set of parameters associated with graph elements in a computation graph; determining, by the processor, an ordering constraint for the set of parameters; and determining, by the processor, a second ordering of the set of parameters that satisfies the ordering constraint according to the desired first ordering; wherein determining the second ordering includes, for each of multiple constrained parameters in the set, associating with the constrained parameter one or more other parameters that constrain the order of the constrained parameter in the second ordering according to the ordering constraint, and for each of multiple iterations, selecting different subsets of one or more parameters in the set to be assigned positions in the second ordering based at least in part on how many other parameters are associated with a given parameter in the subset.

8046662

11325720

1. A method for signal processing, the method comprising: generating a corresponding redundancy verification parameter for a received GSM bit sequence that is decoded using at least one decoding algorithm; verifying said decoded received GSM bit sequence based on said corresponding redundancy verification parameter; and if said decoded received GSM bit sequence fails said verification, decoding said received GSM bit sequence by imposing at least one physical constraint during decoding by said at least one decoding algorithm.

20150033237

14513676

1. A system for scheduling tasks in a computer system, the system comprising: a portal module configured to receive a task to be scheduled for execution within a computer system from a device, the received task including a time dependent task utility function that includes a constant or increasing task utility value until reaching a time deadline; a schedule optimizer module configured to determine a time window for the received task to be scheduled for execution on the computer system based on the time dependent task utility function of the received task; the schedule optimizer module configured to identify a plurality of other tasks previously scheduled to be executed on the computer system within the time window of the received task; the schedule optimizer module configured to identify a plurality of candidate schedules, the plurality of candidate schedules including a first candidate schedule and a second candidate schedule, the first and second candidate schedules being different scheduling combinations of the received task and the plurality of other tasks; a utility estimator module configured to calculate a task utility value for each task included within the first and second candidate schedules based upon a corresponding time dependent task utility function; the utility estimator module configured to calculate a first overall utility value for the first candidate schedule based on the calculated task utility values for the tasks within the first candidate schedule and a second overall utility value for the second candidate schedule based on the calculated task utility values for the tasks within the second candidate schedule; the schedule optimizer module configured to select a schedule among the plurality of candidate schedules based on the first and second overall utility values; and a workload scheduling module configured to queue the received task for execution according to the selected schedule.

8949773

12731533

1. A computer-implemented method for deriving one or more process models from natural language use case specifications, comprising: creating an in-memory model of a use case from information in natural language text describing the use case, wherein the in-memory model comprises at least an actor node and one or more action nodes comprising an action initiated at least by the actor node, wherein the action of the one or more action nodes has a type comprising at least one of input, output, create, query, update, delete, direct, initiate, and access change, the method further comprising transforming the in-memory model into a process model in predetermined modeling notation, wherein the process model comprises at least a start node, an activity node, and a sub-process node, and the method further comprising generating a selected business process model using the process model; and guiding a user to create the in-memory model, generate the selected business process model, edit the natural language text, and edit the selected business process model and edit the in-memory model; and in response to detecting an addition of a gateway in the generated business process model, the method further comprising automatically transforming the addition into creation of an exception in the natural language text of the use case of the in-memory model, wherein in response to detecting a change in at least the process model, the method further comprising triggering a consistency check among the natural language text of the use case, the in-memory model, the end-to-end business process model, and the changed process model.

20070236200

11695264

1. A feedforward compensated switching power converter comprising: a switching power converter comprising: a circuit comprising at least two reactive components configured to provide an output voltage and capable of being switched from one output voltage state to another output voltage state and providing a load current to a load, a switching component capable of switching said circuit between said one output voltage state and said another output voltage state, a driver component capable of receiving an input control signal comprising a duty cycle signal and of driving the switching component in order to cause switching between said one output voltage state and said another output voltage state in response to set input control signal; a sensing component capable of providing a sensed output indicative of the load current; and a compensating component capable of receiving said sensed output and of providing a duty cycle adjustment signal, said duty cycle adjustment signal being combined with a duty cycle signal; said duty cycle adjustment signal being capable of substantially compensating for load current variations; said duty cycle adjustment signal being obtained from signals indicative of present and past load current variations.

20130246412

13420591

1. A computer-implemented method of ranking results generated by a search engine in response to a query, the method comprising: storing, in real-time, user behavior data relating to a searching session of a user, the user behavior data being stored in a behavioral data store; and ranking a set of results generated by the search engine in response to a query using the stored data and based on repetition of one or more results across multiple sets of results within one or more searching sessions of the user.

8972349

13369210

1. In a general purpose computer, a method for automatically testing a business intelligence artifact in a business intelligence system, comprising: authoring a business intelligence artifact in the business intelligence system, wherein the business intelligence artifact produces output when the business intelligence artifact is executed in the business intelligence system, and wherein the business intelligence artifact is selected from the group consisting of: a report specification, an analysis cube, and a metadata model; creating at least one assertion to determine whether the business intelligence artifact is functioning properly; testing, with an automated agent interfaced with the business intelligence system, the business intelligence artifact to verify its proper functioning by determining whether the conditions of the at least one assertion are satisfied upon execution of the business intelligence artifact in the business intelligence system; reporting if the conditions of the at least one assertion are not satisfied upon execution of the business intelligence artifact in the business intelligence system; and recording one or more corrections made to the business intelligence artifact as a subsequent version of the business intelligence artifact.

20040064438

10645633

1. A method of retrieving data, relevant to a topic of interest, from at least one collection of documents, comprising the steps of: selecting at least one collection; applying a test query to said at least one collection, thereby retrieving a first set of documents from said at least one collection, said test query including at least one test query term; classifying each document in a representative sample of documents within said first set of documents according to their relevance to said topic; extracting all phrases from said first set of documents selecting high frequency, high technical content phrases from said extracted phrases; performing a phrase frequency analysis of at least group of said first set of documents having a greater relevance to said subject matter than other documents within said first set of documents to generate a list of phrases including phrase frequency data for each listed phrase; grouping said selected high frequency, high technical content phrases into thematic categories; identifying at least one anchor phrase within said phrase frequency analyzed documents for each of said thematic categories; analyzing phrase co-occurrence of phrases in said phrase frequency analyzed documents to generate a list of co-occurrence pairs, each said co-occurrence pair consisting of an anchor phrase and another listed phrase, to generate a list of co-occurrence pairs including co-occurrence data for each listed co-occurrence pair; combining said list of phrases with said list of co-occurrence pairs to form a list of candidate query terms; selecting a plurality of listed query terms from said list of candidates; applying an additional query to said at least one collection, said additional query being said plurality of said listed query terms, thereby retrieving an additional set of documents from said at least one collection; classifying at least a representative sample of documents within said additional set of documents according to their relevance to said topic; determining, based upon said classification of said representative sample of said additional set of documents, the ratio of relevant to non-relevant documents that are retrieved by each term of said selected plurality of listed query terms; building a narrowed query consisting of those listed query terms within said plurality of query terms for which said ratio is above a predetermined lower limit; applying said narrowed query to said collection, thereby retrieving another set of documents from said at least one collection.

8667452

13668756

1. A computer-implemented method comprising: a) defining and storing, through a computer-implemented user interface, one or more attributes of a source resonator and a device resonator forming a wireless energy transfer system; b) defining and storing, through the user interface, information about an interaction between the source resonator and the device resonator; c) modeling, one or more electronic processors, an electromagnetic performance of the wireless energy transfer system to derive one or more modeled values based on the received one or more attributes of the source and device resonator; d) generating, using the one or more electronic processors, a design of an impedance matching network based on the derived one or more modeled values; and e) using the one or more electronic processors to provide, through the user interface, a visual representation of information about the modeled electromagnetic performance of the wireless energy transfer system and the generated design of the impedance matching network.

8266593

12325287

1. A method of analyzing performance of a software testing system associated with a software system having multiple modules, the method comprising: performing a complexity analysis of the software system by a computer; performing an impact analysis of information related to an impact of at least one defect on at least one module of the software system during a maintenance phase of a test cycle by the computer; and generating, by the computer, distribution of effort across at least one impacted module of the software system based on the complexity analysis and the impact analysis to enhance the software testing system performance; wherein the complexity analysis comprises: generating a compressed dependency structure matrix based on sorted cyclic blocks associated with modules of the software system; based on the compressed dependency structure matrix, tagging and leveling the modules of the software system; based on the tagged and leveled modules, generating at least one compressed partition matrix; based on the at least one compressed partition matrix, generating at least one expanded partition matrix; using the at least one compressed partition matrix, generating value threads; and using the value threads, obtaining a new scheduling table and performing a path analysis to determine an efficient software testing scheme.

9075074

13131988

1. A method for determining a flow in a vicinity of a first aircraft comprising the following steps: measuring one or more flow velocities by one or more sensors on the first aircraft using at least one measuring position of the one or more sensors, each of the one more measured flow velocities being in one measuring direction of the one or more sensors; initializing parameters of a flow model representing a flow, wherein the flow is a wake turbulence of a second aircraft and the flow model is an analytical vortex model; calculating, with an arithmetic unit connected with the one or more sensors, one or more simulated flow velocities at the at least one measuring position according to the flow model representing the flow; comparing with the arithmetic unit the one or more measured flow velocities obtained from said measuring step to the one or more simulated flow velocities obtained from said calculating step; adjusting the parameters of the flow model representing the flow by minimizing a quality function that depends on at least one comparison result of said comparing step to obtain an approximated flow model; repeating said steps of calculating, comparing, and adjusting for one or more iterations; and then determining the flow of the second aircraft in dependency of the approximated flow model.

8670960

12914270

1. A method for optimizing expensive functions with expensive nonlinear constraints, comprising: a1) partitioning constraints to an expensive function into inexpensive and expensive constraints; a2) selecting sample data for evaluating the expensive function of a simulation; b) generating, by a computer processor, a function proxy model for the expensive function using an approximation scheme, wherein the expensive function is an objective function and the function proxy model models the objective function; c1) generating, by the computer processor, a constraint proxy model for an expensive nonlinear constraint associated with the expensive function, wherein generating the constraint proxy model comprises replacing at least one expensive equality constraint with at least one less expensive constraint proxy, and wherein each constraint proxy is distinct from the function proxy model; c2) incorporating the at least one expensive constraint proxy into the constraints to the expensive function; d) calculating a first solution point for the simulation using at least both the function proxy model for the objective function and the constraint proxy model as a constraint; e) evaluating, by the computer processor, the expensive function of the simulation at the first solution point from the function proxy model and constraint proxy model using the sample data; f) when the expensive function, the function proxy model, and the constraint proxy model do not converge at the first solution point: adding the first solution point to the sample data to obtain updated sample data; and updating the function proxy model and the constraint proxy model based on the updated sample data; g) repeating steps d) through f) until the expensive function, the function proxy model, and the constraint proxy model converge at the first solution point; and (h) when the expensive function, the function proxy model, and the constraint proxy model converge at the first solution point, identifying an optimal solution of the function proxy model and the constraint proxy model.

9213573

14476019

1. A computer-implemented method for placement of a plurality of virtual machines, comprising: assigning, to a hardware resource, a plurality of candidate virtual machines selected from the plurality of virtual machines, wherein a candidate virtual machine is a virtual machine that uses performance resources of the hardware resource beyond performance resources available on the hardware resource; generating a user location vector for each candidate virtual machine from the plurality of candidate virtual machines by aggregating a plurality of user location metrics for the candidate virtual machine, the user location vector represents an aggregate of a velocity, and direction of movement for a plurality of users on the candidate virtual machine, wherein aggregating the user location metric includes: identifying the plurality of users of the candidate virtual machine from the plurality of candidate virtual machines based upon a usage of the particular candidate virtual machine, determining a velocity and direction of movement for each user from the plurality of users, and aggregating the velocity and direction of movement for the plurality of users of the candidate virtual machine; ranking, in response to a performance resource demanded by the plurality of candidate virtual machines being at or above a threshold of the performance resource available on the hardware resource, the plurality of candidate virtual machines as a function of an aggregate user location vector for each candidate virtual machine; selecting a subset of the candidate virtual machines for migration based on the ranking; and migrating, responsive to the selecting, the subset of candidate virtual machines to the hardware resource.

20060167923

11041653

1. A method comprising: extracting process data from a data source; creating a trace using the extracted process data, wherein the trace comprises a plurality of events; and detecting a process model using the plurality of events.

20050065718

10993248

1. A navigation system comprising: a server operable to calculate a route between a first location and a second location, the server including a server processor, wherein the server processor operates on a route calculation algorithm to determine the route between the first location and the second location; and a navigation device operable to transmit the locations to the server and receive the route from the server over a communications link, the device including— a housing, a device processor within the housing, a device memory within the housing and in communication with the device processor, the device memory being operable to store the route, a display within the housing and operably coupled to the device processor, the display viewable at a front face of the housing, and an integrated global position system (GPS) receiver within the housing and operably coupled to the device processor and having an antenna located above the display within the housing.

7702427

10914783

1. A method for estimating a minimum distance of approach of two aircraft that are airborne, the method comprising: providing information on an initial location vector r0(t=t1;n), on an initial velocity vector r1(t=t1;n) and on an initial acceleration vector r2(t=t1;n) at a selected time t=t1, for each of N aircraft, numbered n=1,. .. , N (N≧2) that are airborne; approximating said location vector r(t;n) for aircrafts number n=n1 and n=n2 (n1≠n2) over a selected time interval [t1,t2] by quadratic vector functions of time, r ( t;n 1;app)= r 0( n 1)+ r 1( n 1)·( t−t 1)+ r 2( n 1)·( t−t 1) 2 , r ( t;n 2;app)= r 0( n 2)+ r 1( n 2)·( t−t 1)+ r 2( n 2)·( t−t 1) 2 , Δ r ( t ;app)= r ( t;n 1;app)− r ( t;n 2;app)=Δ r 0+Δ r 1( t−t 1)+Δ r 2( t−t 1) 2 , respectively, where t1 is a selected time within a selected time interval [T1,T2], each of the location vectors r(t;n1;app) and r(t;n2;app) substantially describes motion on a great circle in a plane, and the vector coefficients r0;n1), r1(n1), r2(n1), r0(n2), r1(n2) and r2(n2) are chosen to optimally match the vector functions r(t;n1;app) and r(t;n2;app) in the selected time interval [T1,T2]; and estimating a minimum distance of approach d(min) for a magnitude |r(t;n1)−r(t;n2)| of a vector difference, by identifying at least one real time t(min) for which a time derivative of the quantity |r(t;n1)−r(t;n2)| 2 is zero, 2 Δr 0Δ r 1+{Δ r 1·Δ r 1+2 Δr 0·Δ r 2)( t−t 1)+6 Δr 1·Δ r 2( t−t 1) 2 +4 Δr 2·Δ r 2( t−t 1) 3 =0, and by interpreting the vector magnitude |r(t=t(min);n1)−r(t=t(min);n2)| as the minimum distance d(min).

20100115081

12684468

1. A computer-implemented method for selecting a target design for a tier of an architecture of components based on a set of established criteria, comprising: evaluating, by a computer, a plurality of designs satisfying a first criterion based on available spare components for the tier and anticipated performance of the components in the tier; selecting, by the computer, a lowest cost design from the plurality of designs; and establishing, by the computer, the lowest cost design as the target design.

8381016

13407673

1. A method for fault tolerance management of workers nodes during map/reduce computing in a computing cluster, the method comprising: subdividing a computational problem into a set of sub-problems in a map/reduce module executing in memory by at least one processor of a computer, and mapping a selection of the sub-problems in the set to respective nodes in a computing cluster; directing processing of the sub-problems in the respective nodes and collecting results from completion of processing of the sub-problems in the respective nodes; determining a computation time to complete computation of all of the sub-problems; establishing a polling interval at which time the health of each of the nodes computing a corresponding sub-problem is assessed; upon detecting failed nodes during a time period prior to a final polling interval before completion of the computation of all of the sub-problems, restarting the respective sub-problems; upon determining that the final polling interval has commenced, identifying nodes still processing respective sub-problems and replicating sub-problems in the identified nodes; and, removing duplicate results collected for the replicated sub-problems and reducing the results into a result set for the problem.

9989372

14533310

1. A method for re-ranking trips on an associated transportation network, comprising: receiving, from a plurality of automatic ticketing validation systems, validation information for each of a plurality of travelers of the associated transportation network, the validation information including a timestamp, at least one location, and a ticket identification; extracting, from the validation information, a trip for each of the plurality of travelers of the transportation network, the trip comprising an origin, a destination, and at least one of a departure time or a service; storing the extracted trips in an associated database; receiving, at a computer system from a user device over a computer network, a trip request from an associated user, the trip request including an origin, a destination and a departure time on the associated transportation network; retrieving, from the associated database, a set of actual trips corresponding to the received trip request, the set of actual trips each having a common origin, destination and departure time corresponding to the received trip request; determining a ranking function associated with the trip request in accordance with the retrieved set of actual trips corresponding to the received trip request; receiving, from an associated journey planner, a list of candidate trips on the associated transportation network corresponding to the received trip request; applying the ranking function to the list of candidate trips so as to re-rank the candidate trips in the list thereof; returning, to the user device over the computer network, a re-ranked list of candidate trips in response to the trip request; and displaying, on a display of the user device, the re-ranked list of candidate trips, wherein at least one of the receiving, retrieving, determining, applying, returning is performed by a computer processor of the computer system.

8554588

13458307

1. A system for providing a computer implemented insurance product for insuring an insured's projected savings from an improvement program, the system comprising: a user interface that receives a risk acceptance value for the improvement program; a storage unit used to receive and store: savings criteria for the improvement program; risk distribution data corresponding to the savings criteria, wherein risk distribution data is compiled from a plurality of projected savings values for the improvement program and the corresponding probabilities of achieving the respective savings values; and the risk acceptance value for the improvement program; and a processor programmed with executable code that when executed, causes the processor to: determine a confidence level based on the risk acceptance value and the risk distribution data for the improvement plan; calculate a loss cost premium for insuring the projected savings from implementing the improvement program based on the risk acceptance value, the confidence level, and the risk distribution data; and generate the insurance product comprising the savings criteria.

9471890

14147686

1. A system for managing and executing interpreted language code comprising: a parser configured to: parse controlled language code against a language grammar to build an execution model comprising parsed known concepts; parse a statement to determine that the statement includes a term; and determine that the term is not part of the language grammar; a pattern matching engine configured to: execute pattern matching to determine that a first pattern associated with the term in the statement matches a second pattern associated with one or more of the parsed known concepts; and determine, based at least in part on the first pattern matching the second pattern, that the term represents a new concept; and a concept engine configured to: create the new concept; and save the new concept into an object model and into the language grammar so that current and future parsing errors will not occur when recognizing the new concept.

8972425

13799568

1. A method for parsing a document having a plurality of lines on which a series of actual items are listed, the listing of each actual item spanning one or more lines, said method comprising: obtaining a plurality of candidates representing hypothetical items within the document, each candidate spanning one or more lines of the document and having a local cost associate therewith, said local cost representing a confidence in a quality of the candidate with respect to an item model; determining a plurality of labeling costs for one or more intervals of the document defined between given pairs of lines of the document, each interval containing a plurality of candidates therein, each said labeling cost reflecting a different configuration of the candidates within the interval for which the labeling cost is determined; identifying a best labeling for each interval based on a plurality of labeling costs determined for that interval, said best labeling corresponding to one of the different configurations of the candidates within the interval for which the best labeling is being identified; defining a global objective function; and selecting a subset of the candidates such that the global objective function is optimize, based on the identified best labeling.

20130226841

13408906

1. A computer program product, comprising: a computer readable storage medium to store a computer readable program, wherein the computer readable program, when executed by a processor within a computer, causes the computer to perform operations for extracting information from electronic documents, the operations comprising: learning terms and term variants from a training corpus, wherein the terms and the term variants correspond to a specialized dictionary related to the training corpus; generating a list of negative indicators found in the training corpus; performing a partial match of the terms and the term variants in a set of electronic documents to create initial match results; and performing a negation test using the negative indicators and a positive terms test using the terms and the term variants on the initial match results to remove matches from the initial match results that fail either the negation test or the positive terms test, resulting in final match results.

20150045966

13960181

1. A method of managing energy consumption of a building comprising: performing an optimization for a zone of a building; determining an environmental condition setting for the zone based on the optimization; receiving user feedback of the environmental condition setting, the user feedback reflecting an environmental condition preference of the user; modifying the optimization based on the feedback of the environmental condition setting; and updating the environmental condition setting based on the modified optimization.

8819240

13677394

1. A method, in a data processing system comprising at least one computing device and a plurality of computing resources, for monitoring a use of the computing resources relative to a computing environment entitlement contract, comprising: generating, by the at least one computing device, one or more computing environment entitlement contract (CEEC) data structures, each CEEC data structure defining terms of a business level agreement between a contracting party and a provider of the data processing system, wherein the terms of the CEEC data structure specify a set of computing resources having a specified configuration, and further specify that the set of computing resources are to be used by the contracting party for a specified purpose at a specified level and pattern of intensity for a specified period of time; generating, by the at least one computing device, a CEEC cohort comprising a collection of CEEC data structures having similar terms; monitoring, by the at least one computing device, utilization of a collection of computing resources in accordance with the similar terms of the collection of CEEC data structures to identify a usage pattern within the CEEC cohort; and modifying, by the at least one computing device, a membership of a CEEC data structure in the CEEC cohort based on the identified usage pattern, wherein generating a CEEC cohort comprising a collection of CEEC data structures having similar terms comprises: defining a profile specifying parameters used to define a CEEC cohort and specifying characteristics of CEEC data structures that are included as members of the CEEC cohort; applying the profile to data in CEEC data structures of the one or more CEEC data structures to determine which CEEC data structures meet requirements specified by the parameters of the profile; and selecting one or more CEEC data structures to include in the collection of CEEC data structures of the CEEC cohort.

8112300

11279557

1. A computer-implemented method of optimizing a supply chain, comprising: a) generating, by operation of one or more processors executing a first application, an optimized production solution for the supply chain by using a genetic algorithm optimization technique to optimize a population of seed solutions, wherein the optimized production solution specifies at least, for each day of an optimization period: (i) a production level for each of one or more commodity products produced at each of one or more production plants and (ii) a production split between the commodity products for each of the one or more production plants; and b) generating, by operation of one or more processors executing a second application, an optimized distribution solution for distributing the commodity products produced according to the optimized production solution using an ant colony optimization technique, wherein generating the optimized distribution solution for the optimized production solution using the ant colony optimization technique, comprises: (i) initializing a plant weight vector for each of the production plants in the supply chain, wherein components of the plant weight vector indicate preferences for a delivery from the plant represented by the plant weight vector to an installation represented by a vector component, (ii) initializing an installation vector for each delivery location in the supply chain, and wherein components of installation vector indicate a preference for a subsequent delivery from the installation represented by the installation vector to an installation represented by a vector component, and (iii) generating the distribution solution based on a set of weights specified by components of the plant weight vectors and installation vectors, wherein the distribution solution describes one or more delivery routes from a given one of the production plants to at least one delivery location.

8811749

13607965

1. A method comprising: identifying a mapping assigned to a first patch by one or more processor-based devices; propagating the identified mapping to a second patch to generate a propagated mapping by the one or more processor-based devices; perturbing the propagated mapping to generate a perturbed mapping by the one or more processor-based devices; and assigning one of the propagated mapping and the perturbed mapping to the second patch by the one or more processor-based devices.

7782829

12143809

1. A method, comprising: exchanging signaling information with a base station in an orthogonal frequency division multiple access network; feeding back a channel gain to the base station after transmission; receiving an allocation comprising one or more sub-channels from the base station using throughput-per-joule metrics, wherein the allocation reduces energy usage and the throughput-per-joule metrics uses either the following sum-utility metric: U = arg ⁢ ⁢ max c ⁢ ∑ i ⁢ R i P i ⁡ ( R i ) = arg ⁢ ⁢ max c ⁢ ∑ i ⁢ U i ⁡ ( R i ) or using the following product-utility metric: U = arg ⁢ ⁢ max c ⁢ ∏ i ⁢ R i P i ⁡ ( R i ) = arg ⁢ ⁢ max c ⁢ ∑ i ⁢ log ⁡ ( R i P i ⁡ ( R i ) ) = arg ⁢ ⁢ max c ⁢ ∑ i ⁢ U i ⁡ ( R i ) wherein U i is the utility function for the i th user, R i is the transmission rate for the i th user, and P i is the power consumed for the i th user; and transmitting to the base station based on the allocation using throughput-per-joule metrics.

20100017171

12219398

1. A method for generating a model of a cardiovascular system, the method comprising: a. a definition of a plurality of models of the time-varying behavior of a cardiovascular system with related parameters and a range of levels of detail, b. a definition of objectives of the cardiovascular models including at least one of, but not limited to, features of pressure waveforms, features of flow waveforms, features of time-varying velocity fields, features of transport, features of cardiac volume, features of tissue movements, and variations in these features with changes in physiological, disease, and interventional states, and c. a systematic tuning of the parameters defining the cardiovascular models such that at least one of these models approximately achieves the objectives.

20050129293

10734335

1. A method comprising: defining a plurality of minutiae in a fingerprint image; estimating a score associated with a minutia corresponding to the validity of the minutia; and matching the fingerprint image against one or more sample fingerprint images utilizing a partial point set pattern matching (PSPM) algorithm.

20120082236

12895688

1. A method of determining deblocking parameters for coded video, comprising, iteratively: performing deblocking of a decoded picture according to a deblocking vector, estimating a deblocking error from the deblocked, decoded picture, if the estimated error exceeds a predetermined threshold, for each of a plurality of vector dimensions: advancing the deblocking vector in the respective dimension, deblocking the decoded picture according to the advanced dimension, and estimating a deblocking error from the decoded picture deblocked according to the advanced dimension; revising the deblocking vector for a next iteration according to a gradient derived from the estimated deblocking errors of the vector dimensions.

20150371115

14837628

1. A land classification system operable for analysis of very high resolution (VHR) remotely-sensed multispectral Earth imagery, comprising: an image store containing image data corresponding to VHR remotely-sensed multispectral Earth images; at least one feature extraction module in operative communication with the image store, the feature extraction module being operable to produce feature data regarding at least a portion of image data; a feature stack comprising the image data and the feature data; a client interface operable to receive training data regarding at least one or more pixels of the image data from a user regarding at least one class to which the one or more pixels belong; and a classification compute module operable to generate a classification model at least in part based on a portion of the feature stack corresponding to the one or more pixels and the training data, wherein the classification model relates to classification of pixels of image data into one or more classes.

8442163

12461749

1. A method of decoding a coded signal that is encoded in accordance with at least two component codes, the at least two component codes including a first component code (CC 1 ) and a second component code (CC 2 ), the method comprising: (a) receiving a communication signal representative of the coded signal, and decoding the communication signal to determine a first decoded sequence; (b) using at least a portion of the first decoded sequence along with information associated with the communication signal to determine a first set of starting points, wherein each starting point in the first set of starting points includes at least one component code decoded sequence; (c) performing a set of parallel iteration threads, where each parallel iteration thread starts from a respective starting point from the first set of starting points and terminates on a respective termination point upon satisfying a stopping condition, wherein each respective termination point corresponds to a respective decoded sequence and the stopping condition is a member of the group consisting of: stopping a parallel iteration thread when: (i) an inherently-assumed CC 2 decoded sequence is substantially equal to a first-computed CC 2 decoded sequence, (ii) a previously-computed CC 1 decoded sequence is substantially equal to a next-computed CC 1 decoded sequence, and (iii) when a previously-computed CC 2 decoded sequence is substantially equal to a next-computed second CC 2 decoded sequence; (d) evaluating the first decoded sequence and each termination point to determine a respective quality factor thereof; (e) if the quality factor of the first decoded sequence is less than or equal to the minimum of all the quality factors of the termination points, accepting the first decoded sequence as a decoder output sequence.

20130191357

13354577

1. A method of managing multiple versions of enterprise meta-models within an enterprise model using semantic based indexing, the method comprising the steps of: a computer receiving a search query from a user; the computer determining from the search query a topic and at least two versions of a topic map meta-model of the enterprise meta-models within the enterprise model to compare; the computer applying the search query from the user to a merged topic map meta-model of the at least two versions of the topic map meta-model by searching a topic map based index of the merged topic map meta-model for the topic, producing a result; and the computer using the produced result to translate the topic from the query in at least one of the at least two versions of the topic map meta-model of the enterprise meta-model to coexist and correspond to the other version of the topic map meta-model of the enterprise meta-model, allowing data between the at least two versions topic map meta-model of the enterprise meta-models within the enterprise model to be correlated.

20060103899

10990839

1. A method of detecting banding defects in the output of an image output device comprising the steps of: generating a test pattern at a known time; analyzing the test pattern to generate spectral banding defect records; storing the spectral banding defect records in memory linked to a time stamp indicating known time when the test pattern was generated; repeating the generating, analyzing and storing steps at a plurality of different known times to generate a database of time stamped spectral banding defect records; reconstructing an isolated spectrum from each spectral banding defect record in the database; constructing a cumulative spectrum by probabilistic summation of isolated spectra; analyzing the cumulative spectrum using an image quality assessment/analysis engine.

20100106714

12519953

1. A method of obtaining a set of probabilistic functions for configuring a search algorithm for solving a combinatorial-optimization problem, the search algorithm including one or more procedural components, the method employing for each procedural component a corresponding data structure representing options for configuring the procedural component, each data structure comprising a plurality of nodes associated together in a tree structure, a plurality of said nodes being traversal split nodes representing respective choices which are to be made to configure the corresponding procedural component, the traversal split nodes being associated with respective ones of the probabilistic functions, said method comprising: (a) selecting current probabilistic functions; (b) producing one or more candidate algorithms, each candidate algorithm being produced by traversing the tree structures by performing a traversal algorithm in which a plurality of said nodes are labeled successively as a current node, and, upon the current node being a traversal split node, performing the associated current probabilistic function to make the choice represented by the current node; (c) an evaluation step of evaluating the candidate algorithms; and (d) obtaining modified probabilistic functions and returning to step (b) until a termination criterion is met.

7623270

11145021

1. An ordered dithering method for processing a starting image having a first chromatic resolution and formed by N×M pixels, for obtaining an output image having a second chromatic resolution, said second resolution being lower than said first chromatic resolution, said starting image being suitable for being decomposed in three color channels, respectively R (red), B (blue) and G (green), and a brightness channel (A), said method comprising the steps of: predisposing a first and a second dither matrix, each of said matrices comprising a multiplicity of threshold values ordered in j rows and j columns, where j is smaller than both N and M, repeatedly applying the first dither matrix to the R, B and A channels of the starting image and the second dither matrix to the G channel of the starting image for comparing the value of each of the pixels that compose said channels with a selected respective threshold value belonging to the respective dither matrix; wherein said first and second dither matrices comprise the same threshold values, said threshold values being arranged differently within said two matrices.

7941359

11768274

1. A computer-based method for processing and combining investment recommendations from research providers such as stock analysts, comprising: providing a server running a research team management module on a digital communications network; providing identifiers for a set of research providers to a client node linked to the communications network; with the research team management module, generating a research team comprising two or more of the research providers based on selections received from the client node; assigning team rules with the research team management module to the research team defining an algorithm for aggregating recommendations of research providers on the research team; accessing recommendations of the research providers on the research team for a security; generating a team recommendation for the security by processing the accessed recommendations using the algorithm defined by the team rules, wherein the algorithm comprises combining the accessed recommendations after applying weights to the accessed recommendations that are defined in the team rules for both positive and negative recommendations for each of the research providers on the research team; and reporting the team recommendation to the client node.

20140113638

14144212

1. A management method for coverage optimization, the method comprising: obtaining, by a management apparatus for coverage optimization, measurement reports of a coverage optimization target region; determining, by the management apparatus for coverage optimization, an actual value of a coverage optimization target within the coverage optimization target region according to the measurement reports; and performing, by the management apparatus for coverage optimization, coverage optimization processing on the coverage optimization target region when the actual value of the coverage optimization target is smaller than a preset expected value of the coverage optimization target.

9354997

14666081

1. A method for tracking computing service health, the method comprising: by an asset health monitoring system comprising a hardware processor and memory: assigning a confidence indicator to a computing service of a data center; selecting a first test to run against the computing service, wherein the selected first test is associated with a type of service provided by the computing service and is assigned a first weight; selecting a second test to run against the computing service, wherein the selected second test is not associated with the type of service provided by the computing service and is assigned a second weight less than the first weight; obtaining first test results from the first test; obtaining second test results from the second test; modifying the confidence indicator of the computing service by a first value based at least partly on the first weight assigned to the first test and the first test results; and modifying the confidence indicator of the computing service by a second value based at least partly on the second weight assigned to the second test and the second test results.

20150078552

14548972

1. A method of analyzing a biological sample comprised of the steps: (a) obtaining a biological sample that contains DNA; (b) amplifying the DNA to produce a product; (c) detecting the product to generate data, where the data can be explained by more than one genotype value; (d) assuming a genotype value which is stored in a nontransient memory; and (e) determining a likelihood using a computer in communication with the memory, where the likelihood is defined as a probability of observing the detected data, and said probability is conditioned on the genotype value and other parameters.

8965865

12032340

1. A device for identifying documents that include a searchable form relevant to a topic, the device comprising: a processor; a non-transitory computer-readable medium operably coupled to the processor, the computer-readable medium comprising instructions that, upon execution by the processor, perform operations comprising (a) receiving a document; (b) determining if the received document comprises a form, wherein the form includes a field presented to a user requesting information from the user; (c) if the received document is determined to comprise a form, determining if the form is a searchable form, wherein a searchable form returns non-trivial information to a requestor in response to a submission of the form; (d) if the form is determined to be a searchable form, determining if the form is relevant to an identified topic; and (e) if the form is determined to be relevant to the identified topic, identifying the document as a searchable form relevant to the identified topic.

20140129588

14070603

1. A method for prioritizing queries in a cloud based database, comprising: determining a priority score in real time under an imprecise query execution time; and incrementally maintaining query priority scores.

20100057807

12583842

1. A system for processing genetic data, including: a processor configured to: receive two or more genetic data sets for an individual from one or more genetic data sources; merge the genetic data sets from the one or more genetic data sources, including identifying a duplicate SNP between the genetic data sets and determining one or more data values to be stored for the duplicate SNP; and store a single set of merged genetic data for the individual; and a memory coupled to the processor and configured to provide the processor with instructions.

9691007

14840109

1. An identification apparatus, comprising: data obtaining circuitry that obtains input data; feature quantity obtaining circuitry that obtains a feature quantity corresponding to the input data; a plurality of classifiers that receives input of the feature quantity, performs classification based on the input feature quantity, and outputs a single first class value, which is a value corresponding to a class obtained by the classification, respectively; identification circuitry that inputs the feature quantity into each of the classifiers, and generates a second class value, which is a single classification result, based on a plurality of the first class values obtained from the classifiers; and reliability generation circuitry that generates a reliability of the second class value based on variations across the plurality of the first class values, wherein the reliability generation circuitry generates the reliability so that the magnitude of the variation of the plurality of the first class values and the magnitude of the reliability of the second class value have a negative correlation.

9465793

14617338

1. A method of grammar checking, the method comprising: receiving text through a communications network at a first computing device-based grammar checking facility from a second computing device, wherein the grammar checking facility automatically detects a plurality of possible grammatical errors in the text through software algorithms, and categorizes each of the detected plurality of possible grammatical errors as one of at least a high confidence possible error and a low confidence possible error, wherein a high confidence possible error is considered an identified error and a low confidence possible error is one the grammar checking facility can not determine exists with high enough certainty; providing, automatically from the first computing device-based grammar checking facility through the communications network to each of a plurality of human proofreader computing devices of a plurality of human proofreaders in a crowd-source population, at least one corresponding excerpt of the text containing a possible grammatical error categorized as a low confidence possible error as a result of the automated detection of the grammar checking facility so that an augmented error detection process is collectively performed by the plurality of human proofreaders in parallel for those grammatical errors categorized as low confidence possible errors to determine whether an actual error exists, wherein an error determined by a human proofreader to be an actual error is either corrected by the human proofreader to produce a correction result or is sent back to the grammar checking facility for automatic correction or for distribution as an identified error to at least one human proofreader; wherein the grammar checking facility may automatically correct at least some of the identified errors to produce corrected text portions; managing, by the grammar checking facility, the automatic distribution of at least some of the identified errors to the plurality of human proofreaders, so that a human augmented grammar correction is collectively performed by the plurality of human proofreaders in parallel to produce correction results, wherein each of the plurality of human proofreaders has an associated ranking and receives at least one corresponding excerpt of the text containing an identified error based on the associated ranking, and wherein each of the plurality of human proofreader computing devices is separate from the first computing device and the second computing device; receiving, by the grammar checking facility, the correction results of the plurality of human proofreaders and automatically incorporating the correction results with any automatically corrected text portions of the grammar checking facility to contribute to an at least one corrected version of the received text; and sending the at least one corrected version back to the second computing device.

20080028296

11460262

1. A method of converting text to code that is compliant with a markup language, comprising the steps of: applying a schema to said text, wherein said schema comprises a regular expression having printer tokens embedded therein and having sections, each of said sections being delimited by a grouping operator; matching said text with said regular expression to identify portions of said text that match each of said sections; and for each of said sections concatenating said printer tokens and respective identified portions of said text to generate an output that is compliant with said markup language, wherein said printer tokens each cause a constant string to be generated in said output.

7584101

10923038

1. A system for monitoring a spoken language message comprising: an interface operational to capture the spoken language message; a speech processor including a parser operational to implement a search expression syntax to decode a search expression into a number of (i) target search phrases and (ii) rules defining required relationships; and a speech engine operational to search the spoken language message for one or more of said target search phrases and, in response, provides search results identifying a location of any candidate utterances matching said target search phrase together with confidence values indicating a certainty of each of the candidate utterances to corresponding ones of said target search phrases; and said speech processor responsive to said search expression for identifying one or more of said target search phrases to said speech engine and analyzing said search results to determine whether a condition specified by said search expression is satisfied; and a rules processor responsive to template imformation for providing enhanced confidence values based on a combination of respective ones of said search phrase confidence values and said template information.

7953156

10569126

1. A data encoding system comprising: an encoder for receiving input data and generating corresponding encoded output data, the encoder including: processing means for processing the input data to generate, for each input data therein, a plurality of corresponding data layers including at least one base layer and at least one enhancement layer, wherein the processing means includes encoding means for receiving the input data and generating therefrom the encoded output data, the encoding means further comprising: block selecting means for selecting one or more sub-regions of the at least one enhancement layer, wherein the selected one or more sub-regions comprise regions determined suitable for having their enhancement layer residual data implemented by way of a parameter model, further wherein non-selected sub-regions comprise unsuitable sub-regions for modelling, and model extraction means for modelling the one or more suitable sub-regions for representation thereof in the encoded output data by way of descriptive model parameters.

9703670

14590049

1. A process for controlling a performance state machine, comprising: automatically identifying notifications from an execution trace of an application, the execution trace including a plurality of trace events within a period which has endpoints, the notifications identified through comparison of trace events to notification events for at least three of the following notification categories: application startup, page outline load, page data load start, page data load finish, page to page transition, application input, window size change, media query, binding update, page background task start, page background task finish, developer-defined scenario start, developer-defined scenario finish; automatically placing a state in a performance state machine for each identified notification; automatically aggregating application performance data for each transition between identified notifications, the performance data collectively including data in at least two performance data categories; automatically inserting performance data aggregations in the performance state machine; displaying a visual representation of the state machine states, transitions, and performance data aggregations on a display screen; capturing altered performance of the application in an updated execution trace after the placing and inserting steps; and altering at least one state, transition, or performance data aggregation of the state machine after the capturing step.

20030185976

10106385

1. A method for thin film deposition, the method comprising: providing a shadow mask material having expansion characteristics that closely match expansion characteristics of a substrate during a thin film deposition process; forming a shadow mask from the shadow mask material; and using the shadow mask to deposit a thin film material on the substrate using the thin film deposition process.

7873472

12574957

1. A Kalman filter programmed with time updating error states and measurement updating error states relating to received data sets, said Kalman filter configured to: iterate both the time updating error states and the measurement updating error states when a first criteria is satisfied; and iterate only the measurement updating error states when the first criteria is not satisfied.

20130219816

13780635

1. A hotel room, comprising: a sleeping zone including a bed; and at least one workout zone that is usable for both hotel room use and fitness use.

7535469

10428818

1. An apparatus for creating a three-dimensional caricature based on a user's input facial image, comprising: a memory unit for storing ASMs (Active Shape Models) required to create the three-dimensional caricature, and three-dimensional polygon face basic models; a pre-processing unit for detecting positions of eyes from the input facial image and normalizing the size of the facial image, the pre-processing unit calculating deviation values for eye candidate regions, calculating an error rate for the eye candidate regions by assigning a weight to each of the deviation values and summing the deviation values together, and determining whether the error rate for the eye candidate regions is within an allowable range; a facial feature initial position-detecting unit for detecting each initial position for facial features from the normalized facial image; an ASM loading unit for loading the ASMs stored in the memory unit in the normalized facial image so as to correspond to the detected initial position; an ASM adapting unit for adapting the loaded ASMs so as to extract feature points for the facial features; and a caricature-creating unit for creating a three-dimensional polygon face caricature by loading the three-dimensional polygon face basic model from the memory unit and then modifying the loaded three-dimensional polygon face basic model according to coordinate values of the feature points extracted through the ASM adapting unit.

20110137800

12633501

1. A computer-implemented method of identifying an anomalous product in a supply chain, the method comprising: maintaining a set of anomalous patterns of events of a product in the supply chain; transmitting at least one of the anomalous patterns of events to nodes of the supply chain; receiving messages from nodes that have received the at least one pattern at a third party, wherein the third party is not a node of the supply chain, the messages indicating whether or not the occurrence of an event of the product in the supply chain at the node matches an event in the anomalous pattern of events that has been transmitted to the node, wherein messages indicating that an event at the node matches an event in the anomalous pattern of events are securely encrypted by the node prior to transmission to the third party, wherein the encryption is based on a key that is unknown to the third party; and determining, via at least one processor of the third party, that the product is an anomalous product, wherein the determination is based on the messages from nodes indicating that a sequence of events occurring at one or more nodes matches a sequence of events in the anomalous pattern of events.

8311774

11956809

1. A method for making predictions based on a non-parametric empirical model used in monitoring a system, the method comprising: providing a processor; receiving at the processor a query vector of multiple query sensor values for different monitored parameters for the non-parametric empirical model characterizing the system; determining, with the processor, robust distances between the query vector and each of a set of predetermined historical vectors, each historical vector having multiple historical sensor values, for the non-parametric empirical model based on an implementation of an elemental kernel function including: performing an elemental calculation between each query sensor value of the query vector and a corresponding historical sensor value of each historical vector, wherein each elemental calculation results in a single elemental contributor for each pair of corresponding query and historical sensor values, eliminating at least one, but less than all, of the elemental contributors formed from at least one comparison between the query vector and the historical vector, and depending on the values of the elemental contributors, calculating the robust distance between the query vector and the historical vector using a calculation with the remaining elemental contributors; determining weights for the monitored parameters based on the robust distances calculated using the query vector; combining the weights with the predetermined historical vectors to make predictions for the system.

9607102

14478121

1. A method comprising: receiving, by a computing device comprising a natural language understanding automatic speech recognition computing engine device, a first natural language input comprising one or more words; activating, by the natural language understanding automatic speech recognition computing engine device, a first task based on the first natural language input, wherein the first task is associated with one or more first task agents configured for retrieving information associated with the first task; prompting, by the natural language understanding automatic speech recognition computing engine device and via a first of the one or more first task agents, for a subsequent natural language input based on a first transcription of the first natural language input and based on a first intent associated with the first task; receiving, by the natural language understanding automatic speech recognition computing engine device and while the first task is activated, a second natural language input comprising one or more words; responsive to determining, by the natural language understanding automatic speech recognition computing engine device, that a task activation switching parameter associated with the first task is not a false value and that a second intent associated with the second natural language input is different from the first intent associated with the first task, determining, by the natural language understanding automatic speech recognition computing engine device: one or more candidate second tasks that are capable of being activated based on one or more task switching rules that identify one or more tasks that are allowed to interrupt the activated first task, wherein an interrupted task is arranged in a task stack memory component of the computing device; and one or more candidate third tasks that are incapable of being activated based on the one or more task switching rules; activating, by the natural language understanding automatic speech recognition computing engine device, one of the one or more candidate second tasks, wherein the activated candidate second task is associated with one or more second task agents configured for retrieving information associated with the activated candidate second task; responsive to satisfying the one or more second task agents with the first natural language input, the second natural language input, or an additional natural language input, performing, by the computing device, an action associated with the activated second candidate task; determining, by the natural language understanding automatic speech recognition computing engine device, whether the second natural language input satisfies the one or more first task agents associated with the first task; performing, by the computing device, an action associated with the first task responsive to the second natural language input satisfying the one or more first task agents; and prompting, by the natural language understanding automatic speech recognition computing engine device and via one of the one or more first task agents, for a second subsequent natural language input based on the first transcription of the first natural language input responsive to the second natural language input not satisfying the one or more first task agents.

7535862

10533658

1. A digital broadcast system with increased probability of a whole message being successfully transmitted, comprising; a multiplexor to combine one or more bits from multiple messages into a digital symbol, so each symbol has bits from multiple messages; a DA converter, which could be comprised of a separate DA converter and an RF modulator, that converts the digital symbol into an analog symbol; an AD converter, which could be comprised of a separate RF demodulator and AD converter, that converts the analog symbol back into a digital symbol; a demultiplexor that recreates each message from corresponding parts of multiple digital symbols; wherein the symbols transmitted by the system between the multiplexor and demultiplexor are selected from a hierarchy of non-confusable groups; and wherein the “hierarchy of non-confusable groups” is a hierarchical grouping of the symbols, created as follows: a. find groups of symbols for which the receiver will not be confused about which group the symbol belongs to, for certain levels of noise; b. arrange the groups into a hierarchy by noise level; and wherein i. the analog symbols are labelled with a digital symbol composed of multiple parts or bits, such that each bit of the label makes a choice at a particular level of the hierarchy, wherein ii. the more significant bits are defined as those bits that make a choice at higher levels of the hierarchy; iii. with the result that when using digital symbols with binary bits all the symbols with 1 in the most significant bit are in one top level group, the symbols with 0 in the most significant bit are in the other top level group, and the most significant bit specifies which group of the groups in the top level of the hierarchy the symbol is in; iv. the next most significant bit splits each top level group as in iii, and together these two bits specify which group of all the groups in the second level of the hierarchy the symbol is in; v. and this group splitting is applied recursively with each succeeding bit until using all the bits including the least significant bit specifies which group of the groups in the lowest level of the hierarchy the symbol is in; and wherein each message is transmitted using bits of the label having the same significance in every symbol sent to transmit the message.

8521774

12860328

1. A computer-implemented method performed by one or more data processing apparatus, comprising: receiving a first data request from a user device, the first data request specifying a first type of aggregated data being requested and one or more first criteria for selecting data from a multidimensional dataset to derive a first value for the first type of aggregated data; responding to the first data request, wherein the responding comprises: deriving the first value for the first type of aggregated data using the data selected from the multidimensional dataset according to the one or more first criteria; and determining a first latency for responding to the first data request using the multidimensional dataset, the first latency being indicative of an amount of time, after receipt of the first data request, that is required to derive the first value using the multidimensional dataset; defining a pre-aggregated dataset based on the first data request, the pre-aggregated dataset, the pre-aggregated dataset being a proper subset of the multidimensional dataset used to derive the first value; calculating a benefit score for the pre-aggregated dataset based on a difference between the first latency and a second latency that is indicative of an amount of time required to respond to the first data request using the pre-aggregated dataset; determining that the benefit score meets a predetermined threshold value; and storing the pre-aggregated dataset from the multidimensional dataset upon determining that the benefit score of the pre-aggregated dataset meets the predetermined threshold value.

9189840

13934685

1. An electronic drawing generation apparatus that generates an electronic drawing given to an electromagnetic field simulator for analyzing an electric field and a magnetic field of a substrate where a circuit is formed based on the electronic drawing, the apparatus comprising: a shape determination device that determines a necessary part in the substrate, the necessary part needing to be subjected to simulation by the electromagnetic field simulator; a shape edit device that cuts out the necessary part determined by the shape determination device; a storage storing a design rule database that includes design rules; and a storage storing an analysis technique database that includes a list of analysis techniques complying with the electromagnetic field simulator, wherein the shape determination device includes a design rule check section that determines a design-rule violating part as the necessary part, the design-rule violating part being a part violating the design rules included in the design rule database, and a necessary shape determination section that determines the necessary part based on the design-rule violating part and the analysis techniques included in the analysis technique database.

8060543

11119427

1. A system to carry out a method of tracking resource use, comprising: a general-purpose digital computer programmed to determine a time measurement of when the resource is allocated; determine a time measurement of when the resource is first used; determine a time measurement of when the resource is last used; determine a time measurement of when the resource is deallocated; determine a metric using at least one of the time measurements; classify the resource according to the metric, wherein the metric includes retention duration corresponding to a difference between the time measurement of when the resource is deallocated and the time measurement of when the resource is last used, wherein the classifying includes determining whether the resource is a retained resource, and wherein the resource is determined as the retained resource when, after the resource is last used the resource is not deal located after a threshold time; and analyze memory usage information of a computer program that uses the resource in connection with the classifying of the resource, wherein analyzing the memory usage information includes identifying memory leaks in the computer program according to the classifying of the resource as the retained resource and indicating code corrections of the computer program related to the retained resource; wherein the resource is a software object; wherein deallocating the resource includes at least one of: setting a flag for the resource and adding an identifier for the resource to a list of resources to be deallocated; and wherein the time measurements correspond to at least one of: a count of garbage collection cycles and a number of method calls since the beginning of program execution.

20090316805

12143809

1. A method, comprising: exchanging signaling information with a base station in an orthogonal frequency division multiple access network; feeding back a channel gain to the base station after transmission; receiving one or more allocated subchannels from the base station, wherein the allocation reduces energy usage; and increasing the energy efficiency of transmission to the base station based on the one or more allocated sub-channels.

20080317337

11821980

1. A system for decomposing a digital image, comprising: a digital image stored as a word-graph comprising words and visualized features, and zone hypotheses that group one or more of the words; and an image decomposer, comprising: a zone modeler to express causal dependencies of the zone hypotheses through a learned generative zone model to which costs and constraints are assigned; and a zone inference engine to infer an optimal set of the zone hypotheses, which are non-overlapping, through a heuristic search of the costs and constraints.

7728723

11789024

1. A portable electronic device comprising: a motion detector for generating motion data characterizing local movement of the portable electronic device; a motion intensity determiner configured to determine an instantaneous motion intensity value for the user of the portable electronic device from the motion data; and an active time counter configured to determine an active time accumulation that sums up the time periods, during which the instantaneous motion intensity value meets predefined activity criteria, the active time counter being configured to start determining the active time accumulation after a time threshold that is proportional to a user parameter.

9261505

14063938

1. A method of diagnosing congenital cytomegalovirus (CMV) infection, the method comprising the steps of: (a) obtaining umbilical cord blood or fetal blood from a subject; (b) contacting said umbilical cord blood or fetal blood with monoclonal antibodies that specifically bind a panel of selected markers that comprise the group sFlt-1 and cmvIL-10; and; (c) determining whether the markers are differentially expressed in said umbilical cord blood or fetal blood compared to umbilical cord blood or fetal blood from a non-infected subject; thereby providing a diagnosis for congenital CMV infection.

9934273

14736167

1. A method, comprising: performing, at a particular node of a rewriting decisions tier of a stateful network flow management service, a plurality of metadata update iterations, wherein a particular metadata update iteration of the plurality of metadata update iterations comprises: substituting, within a metadata collection used for packet rewriting decisions at the particular node, a first local decisions summary with a second local decisions summary, wherein the second local decisions summary comprises indications of one or more packet rewriting decisions made at the particular node for one or more network flows subsequent to a set of packet rewriting decisions indicated in the first local decisions summary, wherein a particular network flow is distinguishable from other network flows by a combination of one or more of: a network protocol, a source network address, a source network port, a destination network address and a destination network port; substituting, within the metadata collection, a first flow state summary with a second flow state summary, wherein the second flow state summary corresponds to one or more packet rewriting decision notifications received at a different tier of the stateful network flow management system from the rewriting decisions tier subsequent to a set of packet rewriting decision notifications corresponding to the first flow state summary; initializing, within the metadata collection, a third local decisions summary to be used to store indications of additional packet rewriting decisions made at the particular node; storing, within the metadata collection, a third flow state summary received from the different tier, wherein the third flow state summary corresponds to one or more additional packet rewriting decision notifications received at the different tier subsequent to packet rewriting decision notifications corresponding to the second flow state summary; and determining, at the particular node of the rewriting decisions tier using an aggregation of at least a portion of the metadata collection, at least one element of a rewrite entry to be used to generate, in accordance with a packet processing requirement of a client, one or more transformed packets corresponding to one or more received packets.

10056158

15819995

1. A medical system for determining metastases in an image of an anatomical body part, comprising: an analytical device for generating images of an anatomical body part; at least one computer operable to receive the images from the analytical device and having at least one processor and memory with instructions, the analytical device operable to receive an enhanced image of the anatomical body part using a contrasting agent and receive a non-enhanced image of the anatomical body part without using the contrasting agent, the instructions, when executed on the computer, configuring the computer to: spatially correlate the enhanced image and the non-enhanced image to create a common reference system; wherein both the enhanced image and the non-enhanced image include two dimensional layers of voxels; transform at least one of the enhanced image and the non-enhanced image to create a bijective assignment between the voxels and the respective image; create a normalized difference image and acquire a non-tumor region in both the enhanced image and the non-enhanced image; wherein each of the voxels of the enhanced image and the voxels of the non-enhanced image have voxel intensities and wherein the normalized difference image has a plurality of voxels each with an associated voxel intensity; acquire an intensity threshold of the normalized difference image to differentiate between the voxel intensities caused by the contrast agent and the voxel intensities not caused by the contrast agent; using the intensity threshold to determine a three-dimensional binary image, acquire metastasis geometry data which describe geometrical properties of a metastasis in the binary image; determine a set of adjacent image elements; analyze the 2D properties of the set; and determine that the set represents a metastasis if the set exhibits two-dimensional geometrical properties which comply with the geometrical properties described by the metastasis geometry data.

8417504

11811695

1. A computer-implemented method for converting results from a simulation of a description of a circuit into one or more transactions of a protocol, wherein a message of the protocol is a subpart of a transaction of the protocol, the method comprising: using one or more computers: receiving a set of simulation data, the set of simulation data corresponding to a time-slice of results from a simulation of a circuit description; comparing signal values of the set of simulation data to signal values associated with messages of the protocol; determining a sequence of messages by identifying matches between the set of simulation data and messages of the protocol; comparing the determined sequence of messages to paths within a state machine corresponding to the protocol, wherein; the state machine has a plurality of states and transitions between states, and the plurality of transitions corresponds to messages of the protocol; determining transactions by identifying a path between states of the state machine that corresponds to the determined sequence of messages, wherein the path has a known first state and a known last state; selecting a group of the determined transactions; comparing the selected group of determined transactions to predetermined groups of transactions; determining a match between the selected group of determined transactions and one of the predetermined groups of transactions; based on the match, converting the selected group of determined transactions into a single sequence of transactions; and storing the sequence of transactions to a memory storage location.

20050015169

10622521

1. A method, comprising: a collection software module collecting real-time manufacturing data for a first product; a design-for-manufacturing software module importing design data for a second product; the design-for-manufacturing software module importing the real-time manufacturing data; the design-for-manufacturing software module comparing the real-time manufacturing data with the design data; and the design-for-manufacturing software module flagging an overlapping element of the real-time manufacturing data and the design data, wherein the overlapping element meets a variance criteria.

8706421

11738411

1. A computer-implemented system for predicting binding information relating to a binding of a protein and a ligand, comprising the following computer components stored in one or more memory storage devices and executable by one or more processors: a trained binding model comprising a hidden variable representing an unknown alignment of the ligand with the protein at a binding site of the protein, the trained binding model further comprising one or more parameters selected from a group Major Histocompatibility Complex (MHC)-specific weights, learnable contact potentials, and a learnable soft-step function; the one or more parameters of the trained binding model being estimated based at least in part on machine learning algorithms to minimize an error between the predicted binding information and a true binding information; a prediction component configured to predict the binding information by employing information about a protein's sequence, a ligand's sequence, and the trained binding model; and the trained binding model using a shift variable to influence predicting the binding information by altering a predicted amino acid composition.

20100179847

12354481

1. A method for representing operational risk information in a business process model, said method comprising: receiving, at a computer device, first data defining a job type that is to be processed in a business process model, said job types having associated job attributes specifying for determining an order of activities to be performed; receiving, at said computer device, second data for each job type, said second data specifying one or more resources and associated functions of resources that support activity execution and one or more preconditions to be fulfilled by the resources performing said functions, said second data for each job type further comprising a defined set of performance measures related to activity execution and to job output quality, said job output quality including job quality states defined according to different levels of quality; receiving, at said computer device, third data defining a set of risk events that potentially compromise said performance measures, a risk event having assigned one or more attributes specifying risk event frequency and severity level, said set of risk events being linked to one or more resources; receiving, at said computer device, fourth data specifying one or more preconditions for said activities in terms of requirements to be fulfilled to begin activity execution; providing a function for each activity that maps a state of a resource, job, external factor, as well as an occurrence or non-occurrence of one or more errors, to output states of said resources and jobs and to said activity execution performance measures; and, implementing a graphical model notation for depicting, on said computer device, a business model representation extended to incorporate said first, second third and fourth data using said activity mapping function, said business model representation displayed to include representation and impact of operational risk.

9444866

14700001

1. A computer-implemented method, comprising: receiving device metrics from a user device; determining a minimum network condition to continue streaming multimedia content to the user device without interruption based on the received device metrics; predicting a future network condition for the user device at a next time point and a future location of the user device; determining whether the future network condition is less than the minimum network condition; and determining at least one of an amount and rate of the multimedia content to be sent to and pre-buffered at the user device to achieve streaming of the multimedia content without interruption at the future location.

7900700

12184099

1. A method of determining completion criteria for a coal bed methane reservoir having a plurality of coal seams, comprising: obtaining an acoustic log and a resistivity image log for each of the plurality of coal seams; determining an acoustically determined cleat density for each of the plurality of coal seams using the corresponding acoustic logs; determining maximum horizontal stress direction for each of the plurality of coal seams using the corresponding acoustic logs; determining cleat orientation for each of the plurality of coal seams using the corresponding resistivity image logs; selecting one of the plurality of coal seams upon which to perform a completion operation based on the acoustically determined cleat density, maximum horizontal stress direction, and cleat orientation; and determining the completion criteria for the coal bed methane reservoir using the acoustically determined cleat density, maximum horizontal stress direction, and cleat orientation, wherein the completion operation is performed on the coal bed methane reservoir using the completion criteria.

5571676

08487986

1. A method for identifying one or more genetic alterations in a target sequence present in a first genomic DNA sample, which comprises: a) hybridizing said DNA sample with a second DNA sample, wherein said second sample does not contain the alteration(s), to form heteroduplex DNA containing a mismatch region at the site of an alteration(s); b) cleaving one strand of said heteroduplex in the target sequence to form a single-stranded gap across the site of said alteration(s); c) treating said cleaved heteroduplex with a DNA polymerase in the presence of dideoxynucleotides to determine the nucleotide sequence across said gap; and d) comparing said nucleotide sequence with a predetermined cognate wild-type sequence to identify said genetic alteration(s).

20120095952

12907219

1. A storage medium storing instructions executable by a processor to perform a method comprising: generating feature representations comprising distributions over a set of features corresponding to objects of a training corpus of objects; and inferring a topic model defining a set of topics by performing latent Dirichlet allocation (LDA) with an Indian Buffet Process (IBP) compound Dirichlet prior probability distribution, the inferring being performed using a collapsed Gibbs sampling algorithm by iteratively sampling (1) topic allocation variables of the LDA and (2) binary activation variables of the IBP compound Dirichlet prior probability distribution.

20110188649

12696700

1. A computer implemented method for analyzing a dial plan, comprising the computer implemented steps of: receiving an existing dial plan; modeling the existing dial plan as a directed graph; and analyzing the directed graph to determine compliance with a set of edge rules; and analyzing the directed graph to determine compliance with a set of connectivity type rules.

10070607

15456606

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

20180032554

15220098

1. A system for automatically analyzing a data model and identifying anomalies within the data model, the system comprising: a memory device comprising computer-readable program code; a communication device; and a processing device operatively coupled to the memory device and the communication device, wherein the processing device is configured to execute the computer-readable program code to: based on input received from a graphical user interface, retrieve data comprising a plurality of elements and a plurality of tables, the data retrieved from a database; identify each element as a fact or a dimension based on at least one of a data type corresponding to the element, a column name corresponding to the element, and one or more constraints corresponding to the element; identify each of the tables associated with the data as either a fact table or a dimension table, wherein the plurality of tables comprises at least one fact table and at least one dimension table; determine that a set of elements within a single column of a first dimension table is a primary key for the dimension table by determining that each element of the set is unique to one another; identify a reference key corresponding to the primary key; based on identifying the reference key corresponding to the primary key, determine at least one relationship between at least two tables; generate a data model of the data retrieved from the database; identify data anomalies from the at least one relationship, wherein data anomalies are ragged hierarchies, many to many relationships, and double counting; generate a data analysis report comprising: generating a list of the columns of the tables associated with the data model, a list of other tables that share at least one column with the at least one dimension table, one or more lists of data anomalies, and a list of parents and children, wherein a child is a column associated with the reference key and a parent is a column associated with the primary key; compiling the list of columns, the list of other tables, the one or more lists of data anomalies, and the list of parents and children; and present the data analysis report to a user.

20140173112

13713983

1. A method comprising: receiving, by a server computer system, a request to launch a deployment; determining a set of matches from a pool of cloud providers, wherein the set of matches comprises cloud providers meeting minimum requirements for the deployment; identifying a selection policy for the deployment, the selection policy comprising priority ranking criteria and probability ranking criteria; and determining one of the cloud providers for the deployment from the set of matches based on the priority ranking criteria and the probability ranking criteria.

20140369410

14370773

1. Method of encoding an HDR video of high dynamic range together with an LDR video, the LDR video providing a lower dynamic range depiction of the HDR video content, the method comprising using processing means for encoding a first tone mapped version of the HDR video, called a first LDR video, and a second tone mapped version of the HDR video, called a second LDR video, extracted from the HDR video independently of the first LDR video and predictive encoding the second LDR video using the first LDR video as reference, and lossless encoding global illumination data further extracted from the HDR video.

20110267921

12770829

1. A method for seismic inversion of vertical seismic profile (VSP) data in an oilfield having a subterranean formation penetrated by a wellbore, comprising: obtaining an initial velocity model of the subterranean formation, the initial velocity model comprising acoustic velocities of wave propagation in proximity to the wellbore; determining an acquisition geometry for obtaining the VSP data, the acquisition geometry comprising a plurality of receiver locations within the wellbore and a source location; performing a seismic survey to obtain the VSP data based on the acquisition geometry; analyzing, using a central processing unit (CPU) of a computer system, direct arrival signals of the VSP data to generate transit time data for wave propagation from the source location to the plurality of receiver locations; modifying, using the CPU, the initial velocity model to generate an updated velocity model by performing a tomographic inversion of the transit time data; generating, using the CPU, an elastic model of the subterranean formation by performing the seismic inversion of the VSP data using the updated velocity model; and adjusting the operations of the oilfield based on the elastic model.

9155506

13897755

1. A method for processing MRT data of a brain of a patient, wherein three-dimensional MRT data resolved in voxels of the brain of the patient and brains of a normative database of a plurality of neurologically healthy human individuals are available, comprising the steps of: segmenting the MRT data of the brain of the patient for each voxel into portions of grey substance, white substance and liquor by way of a classification algorithm, transforming the data to be compared with corresponding data of the normative database into a standardized stereotactic space, resulting in one or more normalized tissue maps that contain proportions determined by the classification algorithm, wherein the transformation occurs before, after or synchronous with segmentation, and subjecting the tissue map or tissue maps of the brain of the patient to a voxel-wise statistical comparison with correspondingly normalized and segmented data of the normative database, wherein the voxel-wise statistical comparison of the tissue map, or tissue maps, is a morphometric comparison, wherein statistically significant voxels in the tissue map, or tissue maps, of the brain of the patient are identified that belong to a region dominated by the white substance that contains more grey substance than should be expected from the normative database, or that belong to a region dominated by the grey substance that contains more white substance than would be expected from the normative database.