Datasets:

patent

/

AIPD_evo_claim_one

like 0

8572525

12861777

1. A method, comprising: by a computing device: receiving layout data for a plurality of calibration layouts, each of the plurality of calibration layouts having a layout topology belonging to a class of layout topologies; deriving density information for the plurality of calibration layouts based on the layout data; receiving printed contour information for the plurality of calibration layouts; deriving contour deviation information for the plurality of calibration layouts based on the printed contour information; and generating a model for predicting printed contour deviations for the class of layout topologies based on the density information and the contour deviation information, wherein the model is generated using a response surface methodology.

9767250

14570852

1. A computer-implemented method for designing a biological model, the method comprising: displaying a user-interface having groups of elements identified as identical, each element having an associated biological model of a set of biological models, each biological model comprising a plurality of elements and interactions between elements, the plurality of elements being biological molecules; enabling a drag and drop user input within the user-interface that selects a particular element from a first group of the group of elements, drags the particular element from the first group of the group of elements to a second group of the group of elements, and releases the particular element near the second group; responsive to receiving the drag and drop user input, updating the first group to remove the particular element and the second group to include the particular element; and creating a combined model by combining the set of biological models according to the updated groups.

20140046934

13570043

1. A computer implemented method for providing search results, the method comprising: determining, using one or more processors, an entity reference from a search query; identifying, using one or more processors, a ranked list of properties associated with a type of the entity reference based on a knowledge graph; identifying, using one or more processors, a property for generating a presentation of search results from the ranked list of properties, based at least in part on the search query and on the type of the entity reference; determining, using one or more processors, a presentation technique associated with the property for generating a presentation; and causing to be presented, using one or more processors, search results based on the presentation technique.

9195699

10913143

1. A method of generating an index for a body of data, said method comprising: receiving a plurality of values associated with a plurality of respective attributes characterized by a plurality of respective hierarchies; generating entries in the index, the entries including a parent entry having lower bounds associated respectively with the values, each lower bound of said lower bounds representing a lowest point in a hierarchy having a particular value at which aggregation occurs, which is indicated by a plurality of matching rows with identical attribute or dimension values, and located at respective positions within the respective hierarchies; determining child positions, wherein one of the child positions is associated with one of the lower bounds of the parent entry and is located at a first position in one of the respective hierarchies, and the one of the child positions is strictly included within the one of the lower bounds of the parent entry within the one of the respective hierarchies; generating child entries based on the parent entry, wherein one of the child entries includes a child lower bound that is located at a second position in one of the respective hierarchies and the child lower bound is strictly included within the one of the lower bounds within said one of the respective hierarchies; and storing the one of the child positions in association with the parent entry and the one of the child entries.

20020194158

09851675

1. A computer-implemented method for retrieving documents comprising: inputting the text of one or more documents, wherein each document includes human readable words; creating context windows around each said word in each document; generating a statistical evaluation of the characteristics of all of the windows, wherein the results are not a function of the order of the appearance of words within each window; and combining the results of the statistical evaluation for each window.

20120185814

13280623

1. A computer-readable, non-transitory storage medium storing a program for causing a computer to execute a process comprising: extracting features, which are mutually independent, by using data stored in a data storage unit storing, for each group of circuits implemented on a semiconductor device, the number of actual failures occurred in the group and a feature value of each feature that is a failure factor; generating an expression of a failure occurrence probability model, which represents a failure occurrence probability, which is obtained by dividing a total sum of the numbers of actual failures by the number of semiconductor devices, as a relation including a sum of products of the feature value of each of the extracted features and a corresponding coefficient, by carrying out a regression calculation using data stored in the data storage unit; and calculating an indicator value for design change of the semiconductor device from the generated expression of the failure occurrence probability model.

20110082781

12573693

1. A computer-implemented method for automatically adjusting a particular inflection point function, the method comprising: receiving a plurality of input time series, wherein each input time series of the plurality of input time series (a) represents a review rate and (b) corresponds to a different inflection point in the particular inflection point function; wherein the review rate of each input time series of the plurality of input time series indicates a percentage of a plurality of electronic commerce transactions that are associated with a particular score or higher; for each time series input of the plurality of input time series: proportional logic generating a trend review rate output; integral logic generating an integral delta output; derivative logic generating a derivative delta output; based at least in part on the trend review rate output, the integral delta output, and the derivative delta output, a controller generating a new inflection point value for the inflection point that corresponds to said each input time series; the controller adjusting the particular inflection point function based on each of the new inflection point values to generate an updated inflection point function; receiving a raw score that represents a fraud risk of a particular electronic commerce transaction; and generating and storing a final score for the particular electronic commerce transaction based at least in part on the raw score and the updated inflection point function.

8839114

12834851

1. A computer program embodied on a non-transitory computer readable medium, comprising: computer code for identifying a model of an actual state of a network; computer code for identifying a model of planned changes to the network; computer code for synchronizing the model of the actual state of the network and the model of the planned changes to the network to identify differences between the model of the actual state of the network and the model of the planned changes to the network, where the synchronizing includes: identifying a first list of objects from the model of the actual state of the network, where the first list of objects is generated as a unified data model (UDM) document by: constructing a plurality of Structured Query Language (SQL) statements from UDM metadata for extracting data from the model of the actual state of the network, executing the SQL statements against the model of the actual state of the network, receiving returned data, processing the returned data into UDM output using the UDM metadata, converting identifiers of the objects included in the UDM output into unique persistent keys utilizing a unique persistent key cache, and storing the unique persistent keys in the UDM document; identifying a second list of objects from the model of the planned changes to the network; comparing the first list of objects with the second list of objects; and determining a difference between the first list of objects and the second list of objects, based on the comparison; computer code for generating a graphical representation of a variant model associated with the network, utilizing the differences between the model of the actual state of the network and the model of the planned changes to the network, the variant model including the model of the actual state of the network with the identified differences between the model of the actual state of the network and the model of the planned changes to the network; computer code for providing, to a user, the graphical representation of the variant model including the model of the actual state of the network with the identified differences between the model of the actual state of the network and the model of the planned changes to the network; computer code for determining, utilizing the graphical representation of the variant model, that an operational context of the model of the actual state of the network is without an aspect of operation present in the model of the planned changes to the network; and computer code for, in response to the determination that the operational context of the model of the actual state of the network is without the aspect of operation present in the model of the planned changes to the network, creating a first plan and copying a portion of the model of the planned changes to the network to the first plan.

20090328045

12147079

1. One or more computer-readable media storing computer-executable instructions that, when executed on one or more processors, perform acts comprising: receiving a memory trace comprising a plurality of memory access events, each of the plurality of memory access events representing the execution of a memory access instruction by a computer having a sequentially consistent memory model, wherein the plurality of memory access events are stored in a first order, the first order corresponding to an order in which the represented memory access instructions were executed; determining whether the memory access instructions could, when executed on a computer having a relaxed memory model, be executed in a second order, the second order being different from the first order; when the memory access instructions could be executed in the second order, outputting an indication that the memory access instructions are not relaxed memory model safe; and when the memory access instructions could not be executed in an order different than the first order, outputting an indication that the memory access instructions are relaxed memory model safe.

8141155

13014124

1. A computer-implemented method for technology risk assessment, comprising: identifying software characteristic values, each being associated with one of a set of software characteristics including at least respective user oriented, software oriented, system oriented and security oriented software characteristics, the software characteristics being associated with multiple sets of at least one software process each, wherein each software characteristic defines a property of an associated software process as a value within a range, wherein each software characteristic value reflects a degree of contribution to at least one of multiple security risk categories by the software process; determining a modifier and applying it to the software characteristic value of at least one of the software characteristics of at least one of the software processes, the modifier depending on an extent to which a technology control increases or decreases a degree of contribution by the software process to at least one of the security risk categories associated with the software characteristic; calculating risk indexes, at least one for each of the multiple security risk categories regarding each of the software processes, the risk indexes including at least respective confidentiality, data, reviewability, communication and security risk indexes, wherein for each software process each risk index is determined as a function of at least a subset of the software characteristic values of the software process, and wherein at least one of the subsets includes the modified software characteristic value; aggregating at least some of the risk indexes into (i) a computer network risk index based on the corresponding risk indexes of the set of software processes that are executed at a computer device or (ii) a computer device risk index for the computer device; and presenting an enterprise risk assessment on a display device, wherein the enterprise risk assessment is based on the risk indexes for the software processes, and the computer network risk index or the computer device risk index, wherein the enterprise risk assessment indicates whether computer devices have particular aggregated risk index values for one or more of the multiple security risk categories.

9549199

15052198

1. A method comprising: processing an input video sequence to determine a motion vector at a first level of accuracy; refining the motion vector at a second level of accuracy; selecting, with a selection element, a subset including less than all of candidate pixel locations at least partially based on whether a best candidate pixel location of the second level of accuracy is the same as a best candidate pixel location of the first level of accuracy; and determining the motion vector at a third level of accuracy based on the subset of candidate pixel locations, wherein when the best candidate location of the second level of accuracy is not the same as the best candidate pixel location of the first level of accuracy, selecting the subset of candidate pixel locations comprises selecting candidate pixel locations proximate to the best candidate pixel locations of the second level of accuracy that are between the best candidate pixel location of the second level of accuracy and the best candidate pixel location of the first level of accuracy.

10095981

15466342

1. A method for solving an optimization task using a system including multiple computing resources, the method comprising: receiving input data comprising (i) data specifying system parameters of the optimization task to be solved, and (ii) data specifying task objectives for solving the optimization task, comprising one or more local task objectives and one or more global task objectives; processing, by a local optimization engine, the received input data to obtain one or more initial solutions to the optimization task based on the local task objectives, comprising: transmitting, using a router, from the local optimization engine and to a first quantum computing resource, (i) the received data specifying the optimization task to be solved, and (ii) data representing one or more of the local task objectives, the router determining which computations to outsource to the first quantum computing resource; and receiving, from the first quantum computing resource and at the local optimization engine, data representing an initial solution to the optimization task; and processing, by a global optimization engine, the generated one or more initial solutions using a second quantum computing resource to generate a global solution to the optimization task based on the global task objectives, comprising: transmitting, from the global optimization engine and to the second quantum computing resource, (i) data representing the one or more obtained initial solutions to the optimization task, and (ii) the received data specifying the optimization task to be solved, and (iii) data representing the one or more global task objectives; and receiving, from the second quantum computing resource and at the global optimization engine, data representing the global solution to the optimization task; comparing, using a comparison module, the data representing the global solution to the one or more global task objectives to determine whether the global solution satisfies the one or more global task objectives; and adjusting values of the system parameters using the generated global solution to the optimization task.

8495431

13483252

1. A method for generating at least one identifier for uniquely identifying an electronic device, wherein the electronic device contains a number of static storage elements, and wherein the method comprises: cycling power provided to the static storage elements multiple times; reading values of the static storage elements after the power cycling to collect a set of power-up states; repeating the cycling and reading for multiple environmental temperatures of the device to collect the sets of power-up states for the multiple environmental temperatures; determining expected values of the power-up states for the static storage elements from the collected sets of power-up states; computing probabilities that the expected values of the power-up states will be assumed by the static storage elements; and computing the at least one identifier from the collected sets of power-up states and the computed probabilities.

20150061929

14294580

1. A meteorological observation system using vehicles, comprising: a meteorological observation device embedded in each of the vehicles and configured to periodically detect surrounding weather information and to photograph weather conditions; the vehicle configured to run on a road using radar devices for detecting a front and right and left sides of the vehicle, which are sensors for supporting driving and prevent a collision, and to provide mobility to the meteorological observation device; a meteorological server configured to collect pieces of the weather information from the meteorological observation devices moving in respective areas through wireless communication and to provide the pieces of weather information to a meteorological observation center; the meteorological observation center configured to use information, received from the meteorological server, as statistical data or meteorological observation and forecast data, wherein the meteorological observation device is configured to comprise: a sensor unit configured to detect temperature, humidity, wind speed, a direction of a wind around the vehicle being driven; a radar unit configured to output signals of specific frequencies toward the front or right and left sides of the vehicle in order to measure a distance between the vehicle being driven and another vehicle which is driven ahead of the vehicle being driven; a control unit configured to estimate an amount of rainfall or an amount of snow fall using a loss characteristic of radio waves output by the radar unit; a photographing unit configured to photograph scenes around the vehicle being driven and to generate an image on which weather conditions of a corresponding area are able to be diagnosed; a memory unit configured to store the weather information detected by the sensor unit and the control unit and image information provided by the photographing unit; and a communication unit configured to send the information stored in the memory unit to the meteorological server at a remote place.

20170116034

15040155

1. A computer implemented method for service demand based performance prediction of an application under test with varying workloads, the method comprising: identifying a range of concurrencies in the application under test; computing an optimum number of load testing points for interpolation within the identified range of concurrencies; computing concurrency levels at the computed load testing points; generating service demand samples at the computed concurrency levels; generating an array of interpolated service demands for the identified range of concurrencies based on the computed optimum number of load testing points and the generated service demand samples; and computing throughput and response time for the identified range of concurrencies based on the generated array of interpolated service demands.

20030146939

09961465

1. In a system having a display device and user input mechanisms including a pointer, a query result page comprising: a plurality of results, each associated with an item in a data store of information; a plurality of defined areas, each associated with at least one such result; a first defined area arranged to intuitively imply a relation with respect to a first result; a first data item in said data store, referred by and associated with said first result; and at least one preview window associated with said result page and displaying preview information regarding said first result when said pointer navigates over said first defined area.

8687177

12899055

1. A system comprising: an illumination source, wherein said illumination source is configured to illuminate at least one of: a first region of a sample to thereby generate a first plurality of interacted photons and a second region of said sample to thereby generate a second plurality of interacted photons; a fiber array spectral translator device, wherein said device comprises a two-dimensional array of optical fibers drawn in into a one-dimensional fiber stack so as to effectively convert a two-dimensional field of view into a curvilinear field of view and, a Raman spectrometer wherein said Raman spectrometer is configured so as to effectively separate said first plurality of interacted photons into a first plurality of wavelength bands; a LIBS spectrometer wherein said LIBS spectrometer is configured so as to effectively separate said second plurality of interacted photons into a second plurality of wavelength bands; a Raman detector to thereby generate a Raman data set representative of said first region; and a LIBS detector to thereby generate a LIBS data set representative of said second region of said sample.

8630975

13310098

1. A method for characterizing a corpus of documents each having one or more references, comprising: identifying a network of multilevel hierarchically related documents having direct references, and indirect references, wherein the references are associated with content relationships; for each respective document, determining a first set of latent topic characteristics based on an intrinsic content of the respective document; for each document, determining a second set of latent topic characteristics based on a respective content of other documents which are referenced directly and indirectly through at least one other document to the respective document, the indirectly referenced documents contributing transitively to the latent topic characteristics of the respective document; representing a set of latent topics for the respective document based on a joint probability distribution of at least the first and second sets of latent topic characteristics, dependent on the identified network, wherein the contributions of at least the second set of latent topic characteristics are determined by an iterative process, wherein the represented set of latent topics is modeled at both a document level and a reference level, by differentiating the two different levels and the multilevel hierarchical network which is captured by a Bernoulli random process; and storing, in a memory, the represented set of latent topics for the respective document.

20140100920

13908368

1. A method of developing scores from customer experience data comprising: receiving, at a server, information related to: i) a customer's experience with a company, the information including data associated with the customer's perception of two or more experience categories, and ii) the customer's specific interactions with the company, the information including data associated with interactions between the consumer and the company for two or more interaction categories; using a first algorithm executed on the server to weight the customer experience data to develop an experience score for the company; using a second algorithm executed on the server to weight the customer specific interaction data to develop an interaction score for the company; using a third algorithm executed on the server to develop a composite score for the company; and rendering an image of at least one of the experience score, the interaction score, or the composite score for the company for presentation of the image via a computer.

9776893

14120985

1. A mobile station for diagnosing and modeling site specific effluent treatment facility requirements to arrive at least at one proposed full-scale plant model optimized for the site and for achievement of full-scale plant effluent treatment goals comprising: a mobile platform including power intake, effluent intake and fluid outflow facilities; a plurality of available down-scaled treatment technologies including a first suite of selectably actuatable effluent pre-treatment apparatus housed by said mobile platform and connected with said effluent intake facility of said mobile platform, an effluent polishing treatment array housed by said mobile platform and connected with said suite of pre-treatment apparatus, and a suite of selectably actuatable effluent post-treatment apparatus housed by said mobile platform and connected with said effluent polishing treatment array and said fluid outflow facility of said mobile platform; a plurality of evaluation instrumentation connectable with at least some of different ones of said power intake, said effluent intake, said fluid outflow facilities, and said plurality of available down-scaled treatment technologies for analyzing effluent treated at the site and providing evaluation data output; and a controller connectable at said mobile platform for process control at said plurality of available down-scaled treatment technologies and data accumulation from said evaluation instrumentation to thereby optimize a site specific effluent treatment regimen and establish a site specific effluent treatment facility model, said controller including processing means for receiving indicia indicative of said evaluation data output from said evaluation instrumentation to provide a field of raw effluent condition entry values, for determining treatment goals for said raw effluent to provide a field of treated effluent condition entry values, for utilizing said fields to determine an initial treatment model including a selection of, and use parameters for, selected ones of said treatment technologies from said plurality of available down-scaled treatment technologies, for utilizing said fields to initially reject a selection of other said treatment technologies from said plurality of available down-scaled treatment technologies, and for evaluating efficacy of effluent treatment in accord with said treatment model at said station.

10024904

15666790

1. A method implemented in a computer infrastructure having computer executable code tangibly embodied on a computer readable storage medium having programming instructions operable to: separate random variation in a logarithm of a leakage current into a correlated random component and an uncorrelated random component; determine a first standard deviation of the correlated random component for an ensemble device; determine a second standard deviation of the uncorrelated random component for the ensemble device; generate a statistical model for electrical features of the ensemble device, based on a number m of individual devices within the ensemble device, a sub-threshold slope, an uplift factor, the first standard deviation, the second standard deviation, and statistical random variables; and during semiconductor manufacturing, fabricating integrated chips with minimal leakage and improved power optimization based on the generated statistical model for electrical features of the ensemble device.

9770004

15454351

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

9710371

14924507

1. A method, comprising: receiving software failure information; parsing the software failure information to generate a raw matrix of software terms, software failures, and an indication of a number of times each software term was found in each software failure; determining an importance of each software term of the raw matrix with respect to the software failures of the raw matrix to generate a weighted matrix; generating a failure space based on the determined importance that indicates each software term-software failure pair of the weighted matrix as a vector; and determining a set of clusters representing the vectors in the failure space.

20170017751

15249401

1. A method for identifying a candidate individual for participation in a clinical trial using an ancestral-specific reference genome constructed by steps comprising: a) obtaining a familial genome data set comprising DNA sequences from members of the candidate individual's family; b) comparing the DNA sequences within the familial genome data set to obtain a corrected familial genome data set; c) preparing a first composite familial genome data set from the corrected familial genome data set; d) repeating steps a-c for a second, third or more families to obtain a second, third or more composite familial genome data sets; e) evaluating the first, second, third or more composite familial genome data sets for single nucleotide polymorphisms (SNPs) and/or haplotypes and assigning statistical significance to the SNPs and/or haplotypes; f) grouping the first, second, third or more composite familial genome data sets based on single nucleotide polymorphisms (SNPs) and/or haplotypes that are statistically significant; g) preparing the ancestral-specific reference genome by compiling the SNPs and/or haplotypes shared by a group of composite familial genome data sets with the same ancestry; and h) comparing a DNA sequence of the candidate individual's genome with the ancestral-specific reference genome, wherein the presence or absence of a clinically relevant genetic marker indicates that the individual is or is not a candidate for participation in the clinical trial.

20080249975

11697132

1. A system for adaptive generation of problem determination decision procedures, comprising: a monitoring module operable to identify changes to system states, to one or more values of the system states, and one or more actions associated with the system states; a universal representation module operable to store available knowledge associated with the system states, the one or more actions, and probabilities associated with occurrence of the system states; a problem identification to solution mapper module operable to provide a nearly optimal order of interrogating for said one or more values of the system states and further operable to suggest an associated action; a problem resolution log monitor module operable to monitor logs of the system states and associated actions; and a change to update controller operable to receive monitoring information from the monitoring module and the problem resolution log monitor and determine whether the available knowledge associated with the system states, the one or more actions, and the probabilities associated with the system states stored by the universal representation module needs updating.

6151565

09144080

1. A computer-implemented decision support machine for comparing two alternatives, comprising: memory means for storing a decision data structure having a plurality of decision factors, each said decision factor having a weight assigned thereto, the plurality of weighted factors comprising a predetermined two-dimensional benchmark pattern; input means for inputting a first plurality of scores for a first competing alternative to the decision factors of said decision data structure, and for inputting a second plurality of scores for a second competing alternative to the decision factors of said decision data structure; processing means for (i) transforming the first plurality of scores into a first two-dimensional contribution pattern, (ii) transforming the second plurality of scores into a second two-dimensional contribution pattern, (iii) pattern matching the first contribution pattern and the benchmark pattern to produce a first matching index, and (iv) pattern-matching the second contribution pattern and the benchmark pattern to produce a second matching index; and output means to output at least one output signal corresponding to at least one of the first and second matching indexes to provide a comparison of said competing alternatives.

8437029

13161167

1. A method of choosing jobs to run in a stream based distributed computer system, comprising: determining jobs to be run in a distributed stream-oriented system in accordance with a priority threshold above which jobs will be accepted, below which jobs will be rejected, to maximize projected importance by: deciding with a processor which jobs to run, and which templates among running jobs to choose; and allocating appropriate processing power to processing elements in the templates of the running jobs.

20160247299

14630712

1. A method for reconstructing magnetic resonance imaging data, the method comprising: acquiring a measurement dataset using a magnetic resonance imaging device; determining an estimated image dataset based on the measurement dataset; performing an iterative reconstruction process to refine the estimated image dataset, wherein each iteration of the iterative reconstruction process comprises: updating the measurement dataset and a sparse coefficient dataset based on the estimated image dataset and a plurality of belief propagation terms, incorporating a noise prior dataset into the measurement dataset, incorporating a sparsity prior dataset into the sparse coefficient dataset, updating the plurality of belief propagation terms based on the measurement dataset and the sparsity prior dataset, and updating the estimated image dataset based on the plurality of belief propagation terms; and generating a reconstructed image and confidence map using the estimated image dataset.

9953284

13837782

1. A method, comprising: receiving, by one or more master processors, an indication of one or more candidate projects, one or more sets of estimates of metrics associated with the one or more candidate projects, and one or more objectives for an initial due diligence of the one or more candidate projects; allocating, by the one or more master processors and based at least in part on work requests from one or more slave processors, the one or more sets of estimates of metrics associated with the one or more candidate projects to the one or more slave processors; performing, based at least in part on the one or more sets of estimates of metrics, an evolutionary algorithm to optimize to the one or more objectives, wherein the evolutionary algorithm comprises determining objective values corresponding to the one or more objectives using one or more slave processors; identifying, by the one or more master processors and based at least in part on performing the evolutionary algorithm, a plurality of non-dominated solutions, the non-dominated solutions representing an optimization according to the one or more objectives; determining, by the one or more master processors, a respective percentage (P) corresponding to each of the one or more candidate projects, wherein each respective percentage (P) is a percentage of the plurality of non-dominated solutions in which each of the corresponding one or more candidate projects are included; identifying, by the one or more master processors and based at least in part on the one or more sets of estimates, a respective confidence level (C) corresponding to each of the one or more candidate projects; generating, by the one or more master processors and based at least in part on the respective percentage (P) and the respective confidence level (C) corresponding to each of the one or more candidate projects, a respective priority score (R=P(I−C)) corresponding to each of the one or more candidate projects; providing, by the one or more master processors, an indication of each of the respective priority scores corresponding to each of the one or more candidate projects; and allocating due diligence funding to the one or more candidate projects according to the respective priority score (R) corresponding to the one or more candidate projects.

20130308468

13896871

1. A method of reconstructing a path between two endpoints, the method comprising the steps of: generating by a processor, based on border control gateway protocol (BGP) messages received in memory, a set of connectivity modes, each connectivity mode representing an autonomous system (AS)-level path between a first endpoint and a second endpoint; for each one of the connectivity modes in the set, identifying by the processor a pivotal region, the pivotal region comprising at least one AS; generating by the processor, based on routing data received in memory, a plurality of feasible physical paths, each physical path representing a router-level path between a proxy to the first endpoint and a proxy to the second endpoint; for the plurality of feasible physical paths, determining by the processor a frontier set, the frontier set comprising at least one router interface; selecting by the processor a connectivity mode from the set of connectivity modes, and identifying a router interface in the frontier set such that the identified router interface is determined to be associated with at least one of the ASs in the pivotal region of the selected connectivity mode; and designating by the processor a router-level path associated with the identified router interface as a plausible path.

20130116749

13570998

1. A computer-implemented method, comprising: obtaining, by a computer processor, user-input of at least one of a code and a file in a session associated with first log-in credentials of a first user; responsive to the input of the at least one of the code and the file, obtaining, by the processor, data representing a volume; and displaying, by the processor and in a display device, a representation of the volume relative to at least one of a graphical representation of a stimulation leadwire and a graphical representation of an anatomical region; wherein the at least one of the code and the file was generated prior to the input of the at least one of the code and the file, during a session associated with second log-in credentials of a second user.

8972391

12572739

1. A non-transitory computer readable storage medium having a computer program stored thereon, the program comprising instructions that, when executed by data processing apparatus, cause the data processing apparatus to perform operations comprising: analyzing a recent search activity period of a user to determine a short-term category of interest of the user, wherein the analyzing comprises comparing queries submitted by the user during the recent search activity period with categories of selected search results that were selected by the user during the recent search activity period; obtaining a plurality of search results responsive to a query, each of the plurality of search results having a respective score; for each particular search result of a first plurality of the search results: calculating a category selection value for the particular search result, wherein the category selection value for the particular search result is based on a measure of a count of selections of the particular search result as a portion of combined selection counts for search results responsive to the query for a plurality of users for the short-term category of interest; calculating a general selection value for the particular search result, wherein the general selection value for the particular search result is based on a measure of a count of selections of the particular search result as a portion of combined selection counts for search results responsive to the query for a plurality of users for any category of interest; calculating a category relevance for the particular search result, wherein the respective category relevance for the particular search result is based on a difference between the respective category selection value for the search result and the respective general selection value for the particular search result; selecting one or more search results of the plurality of search results, each selected search result being selected based on the selected search result having a category relevance that exceeds a threshold; adjusting the respective score for each of the selected search results based on, at least, the category selection value for each selected search result and the general selection value for each selected search result; and ranking the search results of the plurality of search results according to the respective adjusted scores for the selected search results and the respective scores for search results that were not selected.

20130132054

13672781

1. A method, comprising: generating a patient-specific anatomical model of coronary arteries and the heart from medical image data of a patient; generating a multi-scale functional model of coronary circulation based on the patient-specific anatomical model; and simulating blood flow in at least one stenosis region of at least one coronary artery using the multi-scale function model of coronary circulation.

8713535

12165603

1. A method for detecting software application usage on a client device, the method comprising the steps of: categorizing components of applications that are instantiated on the client device, the categorization being performed based on at least one of usage pattern of the components or correlation of the components to active usage, the categorization classifying the components into categories that includes primary processes, user interaction with a user interface and auxiliary processes, wherein primary processes run when the application is being actively used, and terminate when the application is not being actively used, user interaction with a user interface interaction enables detection of the software application usage by monitoring interaction patterns with the user interface, and auxiliary processes run without correlation to application usage; providing the categorized components as elements in a usage manifest that is published to the client device, the categorized components being respectively monitored by a plurality of usage counters for generating usage metrics based on a frequency of unique launches of an application or a duration of each unique use of an application responsively to the monitoring; and implementing a software usage detection service on the client device, the software usage detection service arranged for monitoring one or more of the components according to the usage manifest to detect usage of the applications based on the categorization of the one or more components.

10114814

15277892

1. A system for processing and actionizing patient experience data, the system comprising: a server comprising a natural language processing (NLP) engine; and a relational database; wherein a plurality of communications is received at the server, each of the plurality of communications comprises comment data collected from publicly available data of an Internet web site or from one or more surveys, wherein the comment data comprises structured or unstructured patient experience data; wherein the comment data from each of the plurality of communications is transformed to structured patient experience data and stored at the relational database in a response table that includes one or more records, wherein each record corresponds to the comment data from a communication, and wherein each record comprises the corresponding comment data and a timestamp; wherein the comment data from each of the plurality of communications is parsed for individual phrases to generate a plurality of phrases; wherein one or more phrases are selected from the plurality of phrases based on a predetermined parameter; wherein the NLP engine is to predict one or more annotations for the one or more phrases based upon a score, wherein to predict the one or more annotations for the one or more phrases based upon the score comprises to (i) predict one or more annotations for the one or more phrases based upon a machine learning score, wherein the one or more annotations comprise a sentiment, a theme, or any named entity of the one or more phrases, (ii) determine whether the machine learning score is less than a predetermined threshold score, and (iii) predict the one or more annotations for the one or more phrases based upon a reference score in response to a determination that the machine learning score is less than the predetermined threshold score; wherein the one or more annotations are stored at the relational database in an annotation table that includes one or more records in response to prediction of the one or more annotations, wherein each record corresponds to an annotation, and wherein each record includes the sentiment, the named entity, a primary tag indicative of a subject matter, or a secondary tag indicative of the theme; and wherein the server is to generate a dashboard web page for a user that includes the one or more annotations in response to prediction of the one or more annotations.

20070294110

11561240

1. A method for searching codified electronic medical data to identify a pool of potential study participants, said method comprising: receiving a plurality of conditions at a user interface; receiving a plurality of parameters for tailoring a search of said codified electronic medical data, said parameters being used to assign a weight to said conditions; and, searching said codified electronic medical data to create a pool of candidates according to said weighted conditions.

20140258322

13975002

1. A semantic-based search system comprising: a log generating unit configured to generate a common log storing knowledge corresponding to general knowledge and a user log stored by reflecting user preference; an instance analyzing unit configured to analyze vector characteristics corresponding to an instance among interpretation alternatives according to a keyword input by a user; a weighted value calculating unit configured to calculate weighted values of confidence values and cosine similarity values of interpretation alternatives including vector characteristics of the instance with respect to at least an one of the common log and the user log; and an aligning unit configured to align rankings of the interpretation alternatives according to the keyword input on the basis of the calculated weight values of the confidence values and the cosine similarity values.

8485896

11039065

1. A method implemented in execution of a computer program application, tangibly stored on a machine-readable medium, for verifying a new player's eligibility to participate in on-line gaming on an on-line gaming system, the method comprising: receiving identification information provided by the new player; determining, based on the identification information provided by the new player, which one or more verification checks will be performed for the new player; performing, with a processor, the one or more verification checks determined to be performed, the one or more verification checks selected from the group consisting of a face value check, the face value check based on the country of residence and the date of birth specified by the new player, a location check, an age check, a residence check, a financial institution check, and a risk check, the one or more verification checks providing a risk assessment for allowing the new player to participate in on-line gaming, the one or more verification checks comprising: requesting data about the new player from one or more data source providers, the one or more data source providers being external to an entity operating the on-line gaming system and at least one data source provider operated by an entity different from the entity operating the on-line gaming system, receiving the data from the one or more data source providers, and calculating a check score based on received data from the one or more data source providers, wherein calculating the check score includes: determining a result code based on the received data from the one or more data source providers, the result code representing the received data from the one or more data source providers as defined by the entity operating the on-line gaming system, and mapping the result code to a check score, the check score being defined by the entity operating the on-line gaming system and representing to provide the risk assessment for allowing the new player to participate in on-line gaming; calculating, with a processor, a verification score to be used to verify the new player's eligibility for participating in on-line gaming, the calculation being based on the check score calculated for each of the one or more verification checks performed; and determining a verification action to perform based on the verification score.

8260731

12342300

1. An information classification system that classifies information by assigning a classification identification value to the information, comprising: a computer system, including: a knowledge base that receives classification information to be classified as a word string, conducts language analysis of the classification information to acquire a plurality of keywords that the classification information includes and classify the plurality of keywords into elements made up of a classification target word and a related word that modifies the classification target word, and conducts a search with the related word being for a judgment condition for decision of the classification while separating the classification target word from the related word, so as to assign the classification identification value to the information; a classification candidate extraction section that extracts the classification identification value that the knowledge base assigns to generate an automatic classification result; and a classification update section that receives the automatic classification result, displays a GUI for classification confirmation allowing confirmation of correctness of the automatic classification result, and corrects registered items in the knowledge base with a correction value received through the GUI for classification confirmation while referring to log data that is a processing history about automatic classification for the language analysis and the element classification; wherein the knowledge base comprises: a language analysis section that extracts a plurality of keywords from the classification information while referring to a word dictionary database; and a language element classification section that classifies the extracted plurality of keywords into the classification target word and the related word that modifies the classification target word by referring to a classification database and when a binary condition is registered for the classification target word, prioritizes a judgment based on the binary condition.

20100011346

12172476

1. A method for analyzing the performance of software development process activities, the method comprising: selecting a process activity to be analyzed; determining a metric describing the performance of the selected process activity; collecting a statistically sufficient number of metric data on the base of the selected process activities performed; analyzing the collected metric data and assessing the performance of the software development process activity by applying statistical process control techniques, wherein a variation of the performance is affected by intrinsic process variation and Poisson effects, wherein the collected metric data are each transformed into a distance from a centerline defined by a mean value of the metric data, whereby the metric data are normalized in units of an expected variation due to Poisson effects, wherein as control limits empirical natural process limits are determined, derived from a moving average of the transformed metric data.

20110137702

12703531

1. A system for enabling workflow applications, comprising: a workflow envelope containing at least two different documents, both documents associated with a workflow process having multiple workflow process tasks; a workflow metrics store that stores metrics relating to the workflow process; a resource pool having a set of resources that can complete a workflow task; a workflow simulation engine component that receives a request compute an optimized resource list, employs models and historical data stored in the workflow metrics store, and runs multiple scenarios to identify a subset of the set of resources from the resource pool that can complete an identified workflow process task from the multiple workflow process tasks of the workflow process; and a workflow engine component that receives from an application a request for an optimized resource list to complete a workflow process task, requests the workflow simulation engine component to compute an optimized resource list and identify a subset of the set of resources from the resource pool that can complete the workflow process task, executes a workflow process task by employing the identified subset of the set of resources, and stores in the workflow metrics store metrics data about the executed workflow process task.

20100223500

12677886

1. A method for determining a probability of occurrence that an overall system fulfills a predefined system performance, wherein the overall system is composed of instances of different classes of partial systems and wherein each class of partial system has an associated class fault tree, the method comprising the steps of: (a) Calculating an overall performance for each failure combination of non-failed instances within a class; (b) Automatic selection of failure combinations, the calculated overall performance of which fulfills the predefined system performance; (c) Automatic generation of an overall fault tree based on the class fault trees of partial systems as a function of the selected failure combinations; and (d) Evaluation of the generated overall fault tree for calculating the probability of occurrence of a fulfillment of the predefined system performance by the overall system.

8935303

13729139

1. A method of optimizing an output ranked list of recommended items given an input user, an input item list, and an input context, comprising: providing a multidimensional data set that comprises information of interactions from a plurality of users with a plurality of items and in a plurality of contexts; factorizing the multidimensional data set into a number of two-dimensional matrices, the number of two-dimensional matrices being equivalent to the number of dimensions that the multidimensional data set has; computing a mathematical recommendation model by optimizing an objective function over the two-dimensional matrices into which the multidimensional data set has been factorized, the recommendation model comprising a score value for each combination of user, item and context; and computing the output ranked list by applying the computed recommendation model to the input user, input item list and input context, wherein the recommendation model further comprises a ranked list of recommended items for each user and context, being each ranked list determined by sorting the scores of the plurality of items for each user and context; and wherein the objective function is a continuous function with infinite continuous derivatives that quantifies a relevance of the recommended items of each ranked list of the recommendation model, calculated over at least some of the plurality of users and over at least some of the plurality of contexts.

7689978

10723850

1. A method of instructing a computer program to self-optimize, said method comprising: inputting a selection command that selects one function from a list of pre-selected functions for input into said computer program at a point of choice determined by a programmer, wherein each function from said list of pre-selected functions is associated with a reward; and allowing a learning protocol comprised of learning instructions in said computer program to track and reward said one function that is selected and to determine an approximate optimal choice of operation of said computer program based on said selection command and further comprising inputting a reward command that provides a reward, at a point of choice, determined by a programmer, in said computer program, for said one function selected by said selection command, which results in said approximate optimal choice for self-optimizing said computer program.

20140012531

13936117

1. A micro-processor, on-chip logic, or software implemented method for processing data from a MEMS (Micro-Electro-Mechanical-Systems) sensor disposed within a hand-held computer system programmed to perform the method, the method comprising: sensing, by the MEMS sensor disposed within the computer system, a single calibration data measurement point; and determining, with a processor disposed within the computer system, computed offset data for the MEMS sensor through a Single Point Offset Correction (SPOC) process using the single calibration data measurement point.

7849429

12053887

1. A method for memory conservation during statistical static timing analysis, the method comprising: creating a timing graph with a timing run in a statistical static timing analysis program; identifying a plurality of nodes in the timing graph that are candidates for a partial store; identifying one or more of the nodes as constraint points; persistently storing timing data at constraint points; retrieving persistent timing data from the constraint points; and calculating intermediate timing data at the plurality of nodes using retrieved persistent timing data during timing analysis, wherein the timing data is selected from the group consisting of statistical distributions of arrival times (AT), statistical distributions of required arrival times (RAT), statistical distributions of slews, tightness probabilities, and combinations thereof.

20090055890

12130243

1. A method for security planning with hard security constraints, comprising: receiving security-related requirements of a network to be developed using system inputs and processing components; and generating the network according to the security-related requirements, wherein the network satisfies hard security constraints.

20170331851

15663157

1. A processor-implemented method, comprising: sending a signal to cause a user interface to render a representation of a probabilistic network security measure of each network element from a set of network elements within a network security assessment graph; receiving an indication via the user interface of a change related to the network security assessment graph; determining a group of influenced network elements from the set of network elements in response to the change related to the network security assessment graph based on a factor matrix that represents a joint threat and safety probabilities for the set of network elements, the factor matrix including a factor indicative of a correlation between a pair of network elements from the set of network elements; dynamically updating the factor matrix for the group of influenced network elements to produce an updated factor matrix; dynamically updating the probabilistic network security measure for each network element from the set of network elements to produce an updated probabilistic network security measure for each network from the set of network elements based at least in part on the updated factor matrix and the change related to the network security assessment graph; and sending a signal to cause the user interface to render a representation of the updated probabilistic network security measure for each network element from the set of network elements within the network security assessment graph.

8346767

12764917

1. A method implemented on a computing device having a processor for summarizing image search results, comprising: using the computing device having the processor to perform the following: estimating an image relevance for each image in the image search results as a ranking of each image given by a search engine that provided the image search results in response to a query from a user to the search engine; computing an image quality for each image based on one or more image quality measures; clustering images in the image search results using a clustering technique that has as a first informative prior the image quality for each image and as a second informative prior the image relevance for each image to obtain a summary candidate collection containing image clusters and an exemplar image for each cluster; selecting and ranking each image in the summary candidate collection to obtain an image search results summarization; selecting a number representing a desired number of summaries; and presenting the image search results summarization to a user based on whether a number of images contained in the image search results summarization is less than the number representing a desired number of summaries.

9972143

15447403

1. A system for trend monitoring in an aircraft, the system comprising: a memory device; a display device; and a processor coupled to the memory device, a source of critical parameters, and the display device, the processor configured to: initialize, for a critical parameter, a first threshold (t1), and a first alert table (a1), wherein a1 comprises, for t1, a list of probable causes associated with exceedance of t1, a respective list of corrective actions, and a communication protocol for the display device; receive, at a first time, for the critical parameter, a valid first actual data, and a valid first predicted data; determine a first current deviation defined as a difference between the first valid actual data and the first valid predicted data; assert a flag upon determining that first current deviation exceeds t1; determine a content and format for an alert based on the asserted flag and the critical parameter; identify a probable cause and corrective action associated with the alert in response to referencing a1; and command the display device to render the alert, probable cause, and the corrective action, in accordance with a1.

4868750

07106127

1. A processor for parsing digitally encoded natural language text, such processor comprising means for receiving encoded natural language text for processing, dictionary means for storing words of the natural language together with a list of associated tags indicative of the possible grammatical or syntactic properties of each word, means for looking up a word of the text in the dictionary and annotating the word with its associated tags from the dictionary to provide a word record, means operative on word records of words of a sentence for defining a relative probability of occurrence of a tag sequence consisting of one tag selected from the word record of each word of a sequence of words of the sentence, means for constructing a selected set of tag sequences having a tag selected from the tags associated with each word of the sequence of words and determining a tag sequence of greatest relative probability of occurrence thereby identifying a single most probable tag for each word of the sequence, and grammatical processing means for identifying grammatical structure from the ordering of the single tag for each said word so as to obtain a parse of the sentence.

20090003703

11821858

1. A computer-readable medium having computer-executable instructions, which when executed perform steps, comprising: a) extracting features from a selected sample of a plurality of samples of digital ink training data, wherein the training data corresponds to digital ink representative of at least two different types of digital ink input, and the selected sample is associated with a recognition value as its label; b) processing a feature dataset of the selected sample into a recognition model including by adjusting the combined feature data of the class to which the selected sample belongs and maintaining data representative of the features in association with the recognition value; c) selecting another sample from the plurality and repeating steps a) and b) until each sample of the plurality has been processed; and d) providing a unified recognizer that recognizes an input item including between the two different types of digital ink input without mode selection or recognition parameter input, including by extracting features of the input item and determining which data representative of the features of a class the features of the input item best match, and outputting the recognition value associated with that data.

8190547

12146619

1. A computer-implemented method of exploring a search space of potential solutions to an optimization problem, the method performed by a computing device comprising at least a processor, memory, and a storage, the method comprising: sorting, by the processor, the search space according to a first object function, the first objective function being more computationally expensive and more computationally efficient than a second objective function; performing, by the processor, a bounded depth-first search over the search space to find intermediate sub-solutions to the problem using the first object function; storing, by the processor, K best sub-solutions in the storage while performing the depth-first search, and storing intermediate sub-solutions from the storage in a probabilistic cache, wherein the probabilistic cache stores the sub-solutions in the form of entries, each entry comprising indicia of a sub-solution and an associated cost, and wherein a new entry in the probabilistic cache is stored by randomly selecting a subset of entries in the probabilistic cache and replacing an entry in the subset with the new entry by comparing a cost of the new entry with the costs of the entries in the subset; finding L best partial results using sub-solutions from the storage, where result quality that would be provided by a sub-solution is measured using the second objective function; and storing at least a subset of the L best partial results in the memory of a of the computing device, wherein the subset of the L best partial results is then used as the search space and the sorting, performing, storing, and finding are performed accordingly to produce final solutions to the optimization problem.

20080181503

11699359

1. A method for dimensionality reduction of large data volumes comprising the steps of: a. providing a dataset Γ of data points given as vectors; b. building a weighted graph G on Γ with a weight function w ε , wherein w ε corresponds to a local coordinate-wise similarity between the coordinates in Γ; c. constructing a random walk on graph G via a Markov transition matrix P, which is derived from w ε ; d. performing a spectral decomposition of P to obtain right and left eigenvectors of P; and e. projecting the data points in Γ onto the right eigenvectors of P to obtain a set of projection values Γ B for each data point, whereby Γ B represents coordinates in a reduced space.

9769033

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; wherein, the step of sending the evaluation execution command to the EMS to obtain the service type data of the service to be evaluated and the single-point network element data on the service link comprises: when multiple evaluation items are evaluated at the same time and types of services to be evaluated corresponding to the multiple evaluation items are same, for each evaluation item sending the evaluation execution command to the EMS respectively; computing various evaluation execution commands and performing a combination process to the evaluation execution commands, to obtain one combined evaluation command, and obtaining the service type data of the service to be evaluated and the single-point network element data on the service link from the EMS according to the combined evaluation command; and splitting the obtained service type data and single-point network element data to each corresponding evaluation item; wherein, the method further comprises: executing the following steps when data of every single-point network element on the service to be evaluated are required to be obtained to evaluate a quality of the service: computing various evaluation execution commands and performing the combination process to the evaluation execution commands, to obtain one combined evaluation command, and obtaining the service type data of the service to be evaluated and the single-point network element data on the service link from the EMS according to the combined evaluation command; and splitting the obtained service type data and single-point network element data to each corresponding evaluation item.

8019803

11664990

1. A method for estimating a distribution of a frequency response of a transfer system based on original information and degraded information obtained as a result of transfer of the original information in the transfer system, the frequency response including a phase characteristic of the transfer system, the method performed by a computer including a storage unit and a control unit, and comprising: identifying, with the control unit, a distribution of the degraded information represented by a complex probability density function; acquiring, with the control unit, a spectrum distribution of a distribution of the original information by applying a Fourier transform to the distribution of the original information which is represented by a complex probability density function; identifying, with the control unit, an initial estimated distribution of an impulse response of the transfer system, the impulse response is the probability density function representing the distribution of the degraded information when the distribution of the original information is represented by a unit impulse function; (1) acquiring, with the control unit, a first function by applying a Fourier transform to the estimated distribution of the impulse response; (2) acquiring, with the control unit, a second function by multiplying the first function by the spectrum distribution of the distribution of the original information; (3) acquiring, with the control unit, a third function by applying an inverse Fourier transform to the second function; (4) acquiring, with the control unit, a fourth function by dividing the distribution of the degraded information by the third function; (5) acquiring, with the control unit, a fifth function by applying a Fourier transform to the fourth function; (6) acquiring, with the control unit, a sixth function by multiplying the fifth function by a phase-reverse function of the spectrum distribution of the distribution of the original information; (7) acquiring, with the control unit, a seventh function by applying an inverse Fourier transform to the sixth function; (8) acquiring, with the control unit, a next estimated distribution of the impulse response by multiplying the estimated distribution of the impulse response by the seventh function; replacing, with the control unit, the estimated distribution of the impulse response by the next estimated distribution of the impulse response, and repeating said steps (1) to (8); and applying, with the control unit, a Fourier transform to the estimated distribution of the impulse response to acquire and output the distribution of the frequency response of the transfer system.

8812496

13422189

1. A system operative on a set of documents annotated by metadata specifying persons associated with documents and their social roles in the documents wherein the annotated documents define a group of representation modes including at least one content type and at least one social role, the system comprising: an electronic processing device configured to perform the operation of: computing a relevance score for a person of interest using a set of queries wherein each query has a target social role by performing one of the relevance scoring sequences R w (p,Q) listed in the tables: w QE DE m′ m″ k d Sequence 5 1 0 N/A B B B ⊕ r′ ⊕ m C (m) (⊕ r′ d x d , ⊕ r′ k ⊕ m″ E (m″) (q k )) 6 1 0 N/A B B A ⊕ r′ ⊕ m ⊕ r′ d C (m) (x d , ⊕ r′ k ⊕ m″ E (m″) (q k )) 7 1 0 N/A B A B ⊕ r′ ⊕ m ⊕ r′ k C (m) (⊕ r′ d x d , ⊕ m″ E (m″) (q k )) 8 1 0 N/A B A A ⊕ r′ ⊕ m ⊕ r′ d ⊕ r′ k C (m) (x d , ⊕ m″ E (m″) (q k )) 9 1 0 N/A A B B ⊕ r′ ⊕ m ⊕ m″ C (m) (⊕ r′ d x d , ⊕ r′ k E (m″) (q k )) 10 1 0 N/A A B A ⊕ r′ ⊕ m ⊕ m″ ⊕ r′ d C (m) (x d , ⊕ r′ k E (m″) (q k )) 11 1 0 N/A A A B ⊕ r′ ⊕ m ⊕ m″ ⊕ r′ k C (m) (⊕ r′ d x d , E (m″) (q k )) 12 1 0 N/A A A A ⊕ r′ ⊕ m ⊕ m″ ⊕ r′ d ⊕ r′ k C (m) (x d , E (m″) (q k )) 13 0 1 B N/A B B ⊕ r′ ⊕ m C (m) (⊕ r′ d ⊕ m′ E (m′) (x d ), ⊕ r′ k q k )) 14 0 1 B N/A B A ⊕ r′ ⊕ m ⊕ r′ d C (m) (⊕ m′ E (m′) (x d ), ⊕ r′ k q k )) 15 0 1 B N/A A B ⊕ r′ ⊕ m ⊕ r′ k C (m) (⊕ r′ d ⊕ m′ E (m′) (x d ), q k )) 16 0 1 B N/A A A ⊕ r′ ⊕ m ⊕ r′ d ⊕ r′ k C (m) (⊕ m′ E (m′) (x d ), q k )) 17 0 1 B N/A B B ⊕ r′ ⊕ m ⊕ m′ C (m) (⊕ r′ d E (m′) (x d ), ⊕ r′ k q k )) 18 0 1 B N/A B A ⊕ r′ ⊕ m ⊕ m′ ⊕ r′ d C (m) (E (m′) (x d ), ⊕ r′ k q k )) 19 0 1 B N/A A B ⊕ r′ ⊕ m ⊕ m′ ⊕ r′ k C (m) (⊕ r′ d E (m′) (x d ), q k )) 20 0 1 B N/A A A ⊕ r′ ⊕ m ⊕ m′ ⊕ r′ d ⊕ r′ k C (m) (E (m′) (x d ), q k )) w QE DE m′ m″ k d 21 1 1 B B B B 22 1 1 B B B A 23 1 1 B B A B 24 1 1 B B A A 25 1 1 B A B B 26 1 1 B A B A 27 1 1 B A A B 28 1 1 B A A A 29 1 1 A B B B 30 1 1 A B B A 31 1 1 A B A B 32 1 1 A B A A 33 1 1 A A B B 34 1 1 A A B A 35 1 1 A A A B 36 1 1 A A A A w Sequence 21 ⊕ r′ ⊕ m C (m) (⊕ r′ d ⊕ m′ E (m′) (x d ), ⊕ r′ k ⊕ m″ E (m″) (q k )) 22 ⊕ r′ ⊕ m ⊕ r′ d C (m) (⊕ m′ E (m′) (x d ), ⊕ r′ k ⊕ m″ E (m″) (q k )) 23 ⊕ r′ ⊕ m ⊕ r′ k C (m) (⊕ r′ d ⊕ m′ E (m′) (x d ), ⊕ m″ E (m″) (q k )) 24 ⊕ r′ ⊕ m ⊕ r′ d ⊕ r′ k C (m) (⊕ m′ E (m′) (x d ), ⊕ m″ E (m″) (q k )) 25 ⊕ r′ ⊕ m ⊕ m″ ⊕ r′ k C (m) (⊕ r′ d ⊕ m′ E (m′) (x d ), E (m″) (q k )) 26 ⊕ r′ ⊕ m ⊕ m″ ⊕ r′ d C (m) (⊕ m′ E (m′) (x d ), ⊕ r′ k E (m″) (q k )) 27 ⊕ r′ ⊕ m ⊕ m″ ⊕ r′ k C (m) (⊕ r′ d ⊕ m′ E (m′) (x d ), E (m″) (q k )) 28 ⊕ r′ ⊕ m ⊕ m″ ⊕ r′ d ⊕ r′ k C (m) (⊕ m′ E (m′) (x d ), E (m″) (q k )) 29 ⊕ r′ ⊕ m ⊕ m′ C (m) (⊕ r′ d E (m′) (x d ), ⊕ r′ k ⊕ m″ E (m″) (q k )) 30 ⊕ r′ ⊕ m ⊕ m′ ⊕ r′ d C (m) (E (m′) (x d ), ⊕ r′ k ⊕ m″ E (m″) (q k )) 31 ⊕ r′ ⊕ m ⊕ m′ ⊕ r′ k C (m) (⊕ r′ d E (m′) (x d ), ⊕ m″ E (m″) (q k )) 32 ⊕ r′ ⊕ m ⊕ m′ ⊕ r′ d ⊕ r′ k C (m) (E (m′) (x d ), ⊕ m″ E (m″) (q k )) 33 ⊕ r′ ⊕ m ⊕ m′ ⊕ m″ C (m) (⊕ r′ d E (m′) (x d ), ⊕ r′ k E (m″) (q k )) 34 ⊕ r′ ⊕ m ⊕ m′ ⊕ m″ ⊕ r′ d C (m) (E (m′) (x d ), ⊕ r′ k E (m″) (q k )) 35 ⊕ r′ ⊕ m ⊕ m′ ⊕ m″ ⊕ r′ k C (m) (⊕ r′ d E (m′) (x d ), E (m″) (q k )) 36 ⊕ r′ ⊕ m ⊕ m′ ⊕ m″ ⊕ r′ d ⊕ r′ k C (m) (E (m′) (x d ), E (m″) (q k )) and w Sequence 5bis ⊕ r′ ⊕ m C (m) (⊕ r′ d x d ), ⊕ m″ E (m″) (⊕ r′ k q k )) 6bis ⊕ r′ ⊕ m ⊕ r′ d C (m) (x d , ⊕ m″ E (m″) (⊕ r′ k q k )) 9bis ⊕ r′ ⊕ m ⊕ m″ C (m) (⊕ r′ d x d , E (m″) (⊕ r′ k q k )) 10bis ⊕ r′ ⊕ m ⊕ m″ ⊕ r′ d C (m) (x d , E (m″) (⊕ r′ k q k )) 13bis ⊕ r′ ⊕ m C (m) (⊕ m′ E (m′) (⊕ r′ d x d ), ⊕ r′ k q k ) 15bis ⊕ r′ ⊕ m ⊕ r′ k C (m) (⊕ m′ E (m′) (⊕ r′ d x d ), q k ) 17bis ⊕ r′ ⊕ m ⊕ m′ C (m) (E (m′) (⊕ r′ d x d ), ⊕ r′ k q k ) 19bis ⊕ r′ ⊕ m ⊕ m′ ⊕ r′ k C (m) (E (m′) (⊕ r′ d x d ), q k ) 21bis ⊕ r′ ⊕ m C (m) (⊕ m′ E (m′) (⊕ r′ d x d ), ⊕ r′ k ⊕ m″ E (m″) (q k )) 21ter ⊕ r′ ⊕ m C (m) (⊕ r′ d ⊕ m′ E (m′) (x d ), ⊕ m″ E (m″) (⊕ r′ k q k )) 21quarter ⊕ r′ ⊕ m C (m) (⊕ m′ E (m′) (⊕ r′ d x d ), ⊕ m″ E (m″) (⊕ r′ k q k )) 22bis ⊕ r′ ⊕ m ⊕ r′ d C (m) (⊕ m′ E (m′) (x d ), ⊕ m″ E (m″) (⊕ r′ k q k )) 23bis ⊕ r′ ⊕ m ⊕ r′ k C (m) (⊕ m′ E (m′) (⊕ r′ d x d ), ⊕ m″ E (m″) (q k )) 25bis ⊕ r′ ⊕ m ⊕ m″ C (m) (⊕ m′ E (m′) (⊕ r′ d x d ), ⊕ r′ k E (m″) (q k )) 25ter ⊕ r′ ⊕ m ⊕ m″ C (m) (⊕ r′ d ⊕ m′ E (m′) (x d ), E (m″) (⊕ r′ k q k )) 25quarter ⊕ r′ ⊕ m ⊕ m″ C (m) (⊕ m′ E (m′) (⊕ r′ d x d ), E (m″) (⊕ r′ k q k )) 26bis ⊕ r′ ⊕ m ⊕ m″ ⊕ r′ d C (m) (⊕ m′ E (m′) (x d ), E (m″) (⊕ r′ k q k )) 27bis ⊕ r′ ⊕ m ⊕ m″ ⊕ r′ k C (m) (⊕ m′ E (m′) (⊕ r′ d x d ), E (m″) (q k )) 29bis ⊕ r′ ⊕ m ⊕ m′ C (m) (E (m′) (⊕ r′ d x d ), ⊕ r′ k ⊕ m″ E (m″) (q k )) 29ter ⊕ r′ ⊕ m ⊕ m′ C (m) (⊕ r′ d E (m′) (x d ), ⊕ m″ E (m″) (⊕ r′ k q k )) 29quarter ⊕ r′ ⊕ m ⊕ m′ C (m) (E (m′) (⊕ r′ d x d ), ⊕ m″ E (m″) (⊕ r′ k q k )) 30bis ⊕ r′ ⊕ m ⊕ m′ ⊕ r′ d C (m) (E (m′) (x d ), ⊕ m″ E (m″) (⊕ r′ k q k )) 31bis ⊕ r′ ⊕ m ⊕ m′ ⊕ r′ k C (m) (E (m′) (⊕ r′ d x d ), ⊕ m″ E (m″) (q k )) 33bis ⊕ r′ ⊕ m ⊕ m′ ⊕ m″ C (m) (E (m′) (⊕ r′ d x d ), ⊕ r′ k E (m″) (q k )) 33ter ⊕ r′ ⊕ m ⊕ m′ ⊕ m″ C (m) (⊕ r′ d E (m′) (x d ), E (m″) (⊕ r′ k q k )) 33quarter ⊕ r′ ⊕ m ⊕ m′ ⊕ m″ C (m) (E (m′) (⊕ r′ d x d ), E (m″) (⊕ r′ k q k )) 34bis ⊕ r′ ⊕ m ⊕ m′ ⊕ m″ ⊕ r′ d C (m) (E (m′) (x d ), E (m″) (⊕ r′ k q k )) 35bis ⊕ r′ ⊕ m ⊕ m′ ⊕ m″ ⊕ r′ k C (m) (E (m′) (⊕ r′ d x d ), E (m″) (q k )) wherein p denotes the person of interest, Q denotes the set of queries, k indexes the queries of the set of queries and r k ′ denotes the target social role of query q k , x d denotes a document where d indexes the documents, C (. .. ) denotes comparison, ε (. .. ) denotes enrichment, ⊕ i denotes aggregation over indices i, m indexes the at least one similarity mode, at least one of m′ and m″ index the at least one enrichment mode where m′ denotes document enrichment mode and m″ denotes query enrichment mode and in the table columns headed m′ and m″ the symbol “B” denotes the enriching is performed before the computing of similarities, the symbol “A” denotes the enriching is performed after the computing of similarities, and the symbol “N/A” denotes the enriching is not performed; repeating the computing for each person of a set of persons of interest to compute a relevance score for each person of the set of persons of interest, and at least one of (i) ranking the persons of the set of persons of interest respective to relevance score and (ii) selecting a sub-set of persons from the set of persons of interest who have the highest relevance scores.

20110305366

12814507

1. In a computing environment, a method performed on at least one processor comprising: (a) processing a target dataset containing video data into a background model; (b) processing the background model into a current action model by processing a source dataset containing video data including action of interest data; (c) searching the target dataset using the current action model to find one or more subvolumes containing similar action of interest data; (d) updating the action model into an updated current action model based at least in part on the one or more subvolumes found in (c); and (e) repeating steps (c) and (d) for a plurality of iterations.

20050262412

10917711

1. A method for simulating a modular test system, comprising: providing a controller, wherein the controller controls at least one vendor module and its corresponding device under test (DUT) model; creating a simulation framework for establishing standard interfaces between the at least one vendor module and its corresponding DUT model; configuring the simulation framework; and simulating the modular test system using the simulation framework.

8027985

12472281

1. A computer-readable storage medium containing a program which, when executed by a processor, performs operations for ordering query results, the operations comprising: in response to a query issued by a requesting entity: receiving a list of data records ordered according to an initial order, the list of data records defining a result set for the query; identifying an analysis routine configured for processing the result set of the query; determining a suitability score for each data record in the list, the suitability score indicating a relative suitability of the data record as input to the identified analysis routine; wherein determining a suitability score for each data record comprises: identifying row qualifiers, each indicating a possible input field of the identified analysis routine; wherein each data record of the list of data records comprises one or more result fields; and at least one of the row qualifiers associates a given possible input field of the identified analysis routine with a corresponding preferred input value; and for each data record in the list: determining a relative proximity between the preferred input value of the given possible input field and a corresponding value of a matching result field of the data record; whereby the suitability score of a given data record in the list is determined on the basis of the identified row qualifiers and on the basis of the determined relative proximities; sorting the received list of data records on the basis of the determined suitability scores; and inputting the sorted list of data records to the identified analysis routine.

20130268504

13440863

1. A method of determining search engine rank for digital content, the method comprising: performing a search for digital content on a network using a search term to obtain search results; obtaining search engine optimization data from the search results; analyzing the search engine optimization data to determine a first position of digital content related to an entity with respect to a subset of the search results; and analyzing the search engine optimization data to determine a second position of the digital content related to the entity with respect to the search results.

9147218

13786838

1. A computer implemented method, comprising: forming, on a computing device, hierarchies having components that include a numerator time series with values from input data, a denominator time series with values from the input data, and a ratio time series of the numerator time series over the denominator time series; modeling, with the computing device, the components to generate forecasted hierarchies; and reconciling the forecasted hierarchies so that the forecasted hierarchies are statistically consistent throughout nodes of the forecasted hierarchies.

9934338

14359596

1. A computer-implemented method comprising: gathering sensor data regarding offset wells, based on measurements by one or more physical sensors associated with a drilling operation; gathering context data regarding the offset wells, the context data relating to aspects of the drilling operation that are not based on measurements by physical sensors associated with the drilling operation; placing the sensor data and the context data into a data store; creating a reduced data set by identifying a correlation between the sensor data and the context data in the data store, wherein the correlation is predictive of an operational outcome of the drilling operation, and the correlation is identified without preselected distance measures; creating a model based on the reduced data set; predicting the operational outcome based on the model; adjusting at least one drilling parameter for the drilling operation, based on the predicted operational outcome; and drilling a wellbore through a formation based on the at least one adjusted drilling parameter.

20020147617

09841756

1. A method of providing comparative cost information for health insurance plans comprising the steps of: incorporating parameters of health plans; assembling recent health care use and cost data for a reference population; acquiring personal and health information from users on themselves and their household members; estimating the distribution of out-of-pocket costs the user and his/her household is likely to face in the coming year in various health plans, based on the experience of comparable households in the reference population; and outputting premium and estimated out-of-pocket expenses.

9286356

14472677

1. A method performed by one or more processing devices, comprising: determining, based on usage of a social network by a user, a maturity score for the user, where the maturity score represents a measure of user development of the user within the social network; for a particular type of content associated with a resource, retrieving, from a set of utility score instructions, a utility score instruction for the particular type of content; wherein the utility score instruction defines, for the particular type of content in the social network, a relationship between a utility score and the maturity score; wherein the utility score represents a measure of utility of the particular type of content to the user as defined by the measure of user development in the social network; and wherein the utility score is determined independent of user input; wherein defined relationships across the set of utility score instructions promote a first pre-defined type of content among less mature users of the social network relative to other maturities of other users of the social network and promote a second pre-defined type of content among more mature users of the social network relative to the other maturities of the other users of the social network; and determining, based on the set of utility score instructions and the maturity score, utility scores for resources that are accessible to the user.

8321144

12421562

1. A method comprising: in a computer, computing a reproducibility score based on a peak association matrix and a mass/charge association map to test whether an isotope cluster, a label set, or a charge group is reproducible, wherein the computing of the reproducibility score comprises generating a three-dimensional array from the peak association matrix and the mass/charge association map, averaging rows of the peak association matrix to generate a first matrix of average vectors, calculating a first matrix of assimilated vectors from intensity values of the peak association matrix, and computing a first correlation coefficient using at least the first matrix of average vectors and the first matrix of assimilated vectors; and computing a quality score by scoring a transposed peak association matrix together with the mass/charge association map to test whether the isotope cluster, the label set, or the charge group is well formed, wherein the computing of the quality score comprises transposing the peak association matrix to generate the transposed peak association matrix, averaging rows of the transposed peak association matrix to generate a second matrix of average vectors, calculating a second matrix of assimilated vectors from the transposed peak association matrix, and computing a second correlation coefficient using at least the second matrix of average vectors and the second matrix of assimilated vectors.

20030200462

10462462

1. A method for detecting an anomalous operation of a computer system that executes a plurality of program modules, the method comprising: (a) monitoring transitions between and among defined points within an internal operating environment on the computer system and producing program execution trace data; (b) comparing the program execution trace data with data indicative of a nominal operation of the computer system; and (c) identifying an anomalous operation of the computer system based on the result of the comparison.

8204843

12330639

1. An events analyzer comprising: a probabilistic branching process learning engine comprising a computer programmed to optimize respective to a set of training data a set of branching transition likelihood parameters associating parent events of type k with child events of type k′ in branching processes wherein the set of branching transition likelihood parameters include: (i) type transition likelihood parameters indicative of likelihood that one or more events of type k′ follow an event of type k, and (ii) one or more lifetime parameters for each event type k indicative of a statistical lifetime of events of type k; and a probabilistic branching process inference engine comprising a computer programmed to infer a most probable branching process for a set of input data comprising events based on the optimized set of branching transition likelihood parameters.

20160260331

15012479

1. A method, comprising: ingesting, as input data, weather information, mission-specific flight parameters for an unmanned aircraft, and one or more operational rules for the unmanned aircraft, the weather information including at least one of current weather data, historical weather data, predicted weather data, and forecasted weather data for a specific geographic area, the mission-specific flight parameters defining a mission and including one or more of a payload, a flight plan, a craft type, and a geographical location of the mission, and the one or more operational rules at least relating to performance of the mission; analyzing the input data in a plurality of data processing modules within a computing environment in which the plurality of data processing modules are executed in conjunction with at least one processor, the data processing modules configured to confirm a validity of a flight certificate of mission authorization, and perform a risk assessment for the mission relative to the weather information and the mission-specific flight parameters by 1) computing one or more mission risk probabilities in a weather-based statistical analysis, and 2) comparing the weather-based statistical analysis with the operational rules to evaluate a flight condition of the unmanned aircraft for the performance of the mission; and generating, as output data, one or more of a mission compliance status confirming or denying compliance with the one or more operational rules for the performance of the mission, and at least one operational instruction for the unmanned aircraft.

8260646

12539256

1. A computer-implemented method for customer segmentation using adaptive spectral clustering, comprising: determining initial segmentation labels; determining new customer behavior data; formulating a single objective minimization function that integrates the initial segmentation labels with the new customer behavior data, the single objective minimization function including f T ⁢ Cf f T ⁢ A _ ⁢ f , wherein f=vector representing values for new customer labels; C=matrix representing the similarity between new customer labels and the new behavior content; Ā=matrix representing the dissimilarity between new customer labels and the initial customer labels; determining, by a processor, best fit to both the initial segmentation labels and the new customer behavior data simultaneously by minimizing the single objective minimization function, wherein the determined best fit includes one or more new customer segmentation labels, wherein the step of determining new customer behavior data includes formulating behavior data of a customer into a feature vector, wherein the single objective minimization function is minimized using eigen-value decomposition, the method further including: determining customer segmentation label adjacency matrix; determining customer segmentation label consistency measuring matrix; determining customer behavior content adjacency matrix; determining customer behavior content consistence measuring matrix, wherein the single objective minimization function uses the customer segmentation label adjacency matrix, the customer segmentation label consistency measuring matrix, the customer behavior content adjacency matrix, and the customer behavior content consistence measuring matrix.

20100142787

12630061

1. A method for left ventricle (LV) detection in a 2D magnetic resonance imaging (MRI) image, comprising: detecting a plurality of LV candidates in the 2D MRI image; detecting a plurality of apex candidates in the 2D MRI image; detecting a plurality of base candidates in the 2D MRI image; and selecting one of the plurality LV candidates by ranking the plurality of LV candidates based on geometrical relationships between each detected LV candidate and the other detected LV candidates, between each detected LV candidate and the detected apex candidates, and between each detected LV candidate and the detected base candidates using a trained ranking model.

20020082506

09927588

1. A method of obtaining physiologic parameter information of an animal or human other than blood pressure from a blood pressure signal indicative of sensed variations in blood pressure of the animal or human, the method comprising the steps of: signal processing, external from the animal or human, the blood pressure signal to develop an amplitude versus time waveform; extracting from the developed amplitude versus time waveform a sequence of selected blood pressure features derived from individual cardiac cycles of the amplitude versus time waveform over a selected time interval; fitting a mathematical model to the extracted sequence of selected blood pressure features to yield a fitted mathematical model; and computing the physiologic parameter information from the fitted mathematical model.

7895541

11901030

1. A semiconductor integrated circuit pattern verification method comprising: comparing shapes of simulation patterns, the simulation patterns being calculated by executing simulation on the basis of design patterns; based on results of the comparing, combining, into one group, a subset of the simulation patterns such that values of differences among shapes of simulation patterns in the one group are not more than a predetermined value; and verifying information of extracted simulation patterns extracted from the one group.

20150100248

14048183

1. A method of assessing chemical products, the method comprising: receiving input data including identification of a chemical substance at a processing device; evaluating a regulatory impact of the chemical substance based on at least one of global regulation data, regional regulation data and jurisdiction-specific regulation data, and outputting a regulatory impact assessment; evaluating potential hazards posed by the chemical substance based on available data related to characteristics of the chemical substance, and outputting a chemical hazard assessment; and generating a chemical assessment report indicating potential impact due to use of the chemical substance, the chemical assessment report indicating chemical assessment results that include the regulatory impact assessment and the chemical hazard assessment.

9959515

14796704

1. A method for decreasing a failure rate of each asset of a set of assets comprising: receiving, at a programmed hardware processor, data regarding an asset, said data including a failure rate function capturing a condition of said asset up to a point in time, a cost of preventative maintenance (PM) of said asset, a cost of an asset failure, and a cost of replacing an asset; receiving, at said programmed hardware processor, a further input specifying a time horizon; determining, at said programmed hardware processor, whether there is a need to replace said asset, and when a replacement of said asset is needed: computing, at said programmed hardware processor, a mean cost-rate optimization problem formulated as an objective function of a total cost of the asset over said specified time horizon, said total cost being a function of a cost of preventative maintenance (PM) of said asset for K−1 PMs, and an expected cost of repairs for an asset failure computed as a function of said failure rate function, and the cost of replacing an asset; computing, using the programmed hardware processor, an optimal number of preventative maintenance actions K and time intervals t k for each asset independently by minimizing said objective function with respect to an age of the electrical asset y k , where k represents a k th PM, wherein said schedule is formed without considering a labor and budget resource constraint; and the programmed hardware processor device further storing said optimal number of preventative maintenance time intervals for each asset as data in a memory storage device operatively coupled with said processor device; and the programmed hardware processor device generating a final maintenance schedule for the system of assets based on stored said optimal number of preventative maintenance time intervals by minimizing a deviation from the computed optimal PM time intervals subject to the labor and budget resource constraints.

20100191361

12358864

1. A computer-implemented method for controlling a manufacturing process, the method comprising: receiving dependent variable data measured during the manufacturing process, the dependent variable data representative of values of a first set of process parameters observed by one or more sensors; receiving manipulated variable data measured during the manufacturing process from a plurality of process tools and predicted manipulated variable data representative of a second set of process parameters. determining at least one of a predicted score value, a multivariate statistic, or both based on at least the received data; and determining operating parameters of the manufacturing process based on at least the predicted score value, the multivariate statistic, or both.

20150025714

14315871

1. A process for the control of movement of rail-based automated transport vehicles in a multi-branch rail system that contains in particular switches, lifts and other integrated rail-based units, including stations for loading and unloading, characterized by having a depiction of rail system in the control system of automated transport vehicle with all integrated rail-based units by means of nodes and edges as defined in graph theory.

8914599

12903028

1. A method comprising: recording in a queue of a data container, by a processing device, a first access to a first object of the data container by a first thread of a process; recording in the queue, by the processing device, a second access to a second object of the data container by a second thread of the process; and when the number of accesses recorded in the queue reaches a threshold, locking the data container to prevent threads of the process from accessing objects of the data container and evicting an object of the data container while the data container is locked.

8294718

13170099

1. A method for constructing a variogram model, which comprises: identifying a maximum direction of spatial continuity using a variogram map; displaying a rose diagram, the rose diagram comprising an edge and a plurality of vectors; rotating only the edge of the rose diagram to align the maximum direction of spatial continuity with an axis of the rose diagram; and adjusting the edge of the rose diagram using a graphical user interface until the edge of the rose diagram meets each end of each longest and shortest rose diagram vector.

10003198

14850649

1. A method for monitoring and suppressing a resonance applied to a grid-connected generation system, wherein the method comprises: monitoring a current sample voltage of a preset sample point of the grid-connected generation system; acquiring amplitudes of harmonics of the current sample voltage using a preset algorithm; verifying whether a resonance occurs in the grid-connected generation system based on the acquired amplitudes of the harmonics; and in a case that the resonance occurs in the grid-connected generation system, acquiring current corrections of parameters of inverters in the grid-connected generation system according to a preset rule, and adjusting the parameters of the inverters using the current corrections and a selected resonance suppressing algorithm until the resonance disappears in the grid-connected generation system, wherein the adjusting the parameters of the inverters using the current corrections and a preset resonance suppressing algorithm comprises: adjusting bandwidths of the inverters using the current corrections and a preset adjustment formula, wherein the preset adjustment formula is: { k p = k p + Δ ⁢ ⁢ U out k p < k p ⁢ ⁢ min k p = k p ⁢ ⁢ min , where K p indicates a proportion control parameter, ΔU out indicates the current corrections and K pmin indicates minimum allowable adjustment values of the bandwidths of the inverters, adjusting active damping coefficients of the inverters using a pre-stored active damping algorithm and the current corrections; and transmitting the current corrections to the inverters to control an inactive damping resistor to be connected to a respective one of the inverters.

9043748

13753080

1. A computer-implemented method comprising: applying, using a computing device, a coding standard to at least a portion of a graphical model during compilation of the graphical model to detect a violating segment of the graphical model, the violating segment violating the coding standard; displaying, using the computing device, the violating segment of the graphical model differently than a non-violating segment of the graphical model; displaying, using the computing device, information on violation of the coding standard associated with the violating segment of the graphical model; and automatically generating, using the computing device and the information on violation of the coding standard, an intermediate representation of the graphical model, the intermediate representation: removing the violation of the coding standard, and complying with the coding standard.

9235620

13585286

1. A method of updating query results in each of a plurality of distributed application platforms using a data cache platform for maintaining a first cache of query results and a computation platform for computing the query results, each query result including a pre-computed price for a travel recommendation, the method comprising: determining, by the data cache platform, probabilities of the pre-computed prices of the query results in the first cache being outdated based on a probabilistic model that estimates likelihoods that the pre-computed prices of the query results in the first cache are inaccurate based at least in part on meta-data attributes of the query results in the first cache; automatically issuing, by the data cache platform, re-computation orders to the computation platform for updating the query results in the first cache on a basis of the determined probabilities of the pre-computed prices of the query results in the first cache being outdated, wherein the query results in the first cache having a higher probability of being outdated than others are ordered to be re-computed; in response to receiving the re-computation orders, computing, by the computation platform, updated query results and transmitting the updated query results to the data cache platform and each of the application platforms, each of the application platforms maintaining a respective second cache of query results; receiving, at the data cache platform, the updated query results as results of the re-computation orders; enriching, by the data cache platform, the updated query results with the meta-data attributes; and updating, by the data cache platform, the query results in the first cache with the enriched query results, wherein the query results in each second cache are updated with the updated query results independently of the content of the second cache as a result of the re-computation orders issued by the data cache platform.

20060120488

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.

8626582

13209283

1. A method comprising: a computer-based system receiving purchase data relating to a purchase of an item by a user, wherein the purchase data includes a retailer-assigned identifier for the item; the computer-based system associating a manufacturer-assigned identifier with the retailer-assigned identifier, wherein the manufacturer-assigned identifier is different from the retailer-assigned identifier; and the computer-based system storing, in an account associated with the user, at least a portion of the received purchase data and the manufacturer-assigned identifier.

20130254280

13427584

1. A method of analyzing a community of social networking service users to identify one or more influential users within the community, the social networking service providing a platform enabling a user within the community to communicate with at least one other user within the community, the method comprising acts of: (A) employing at least one computer processor to determine a contribution to a first user within the community by at least one second user within the community, the contribution by each second user being defined at least in part by an affirmative step having been taken by the second user with respect to a communication by the first user received by the second user; and (B) employing at least one computer processor to calculate an influence score for the first user based at least in part on the contribution to the first user by each of the at least one second user.

8259883

12346855

1. An apparatus for timing recovery, applied to a communication system, comprising: a modulo processing circuit for receiving an input signal for performing a modulo operation; a slicer for rounding an output signal of the modulo processing circuit into an integer signal; a de-modulo processing circuit coupled to the slicer for performing a de-modulo operation on the output signal of the slicer to generate a de-modulo output signal; wherein the de-modulo operation indicates an inverse function of the modulo operation; wherein a value of the output signal of the modulo processing circuit is .+−.2*M*k; M is a modulo of the modulo processing circuit; and k is a non-negative integer; and circuitry configured to use the value in a timing recovery operation.

9956363

14797681

1. A method for respiratory support, the method comprising: delivering a measured pressure; calculating a net flow based on at least one measured inlet flow and at least one measured outlet flow; using a relationship between a first value related to the measured pressure, a second value related to the net flow and a third value related to patient effort to provide an estimate of patient effort, wherein the third value related to patient effort represents at least one unknown value, and wherein the estimate of patient effort is determined based on the unknown value being characterized by a smooth signal; updating an interim value used to calculate a previous computed patient effort based at least in part on the estimate of patient effort, wherein the interim value is represented by a composite parameter that does not directly correspond to a particular respiratory parameter; calculating a computed patient effort based at least in part on the updated interim value; and utilizing the computed patient effort to trigger a ventilation cycle.

20070088532

11250066

1. A method comprising: calculating confidence values of models; selecting a selected action from among a class of said models, wherein said selecting is based on said confidence values; executing said selected action incrementally using a feedback-based execution engine, wherein said executing said selected action comprises detecting divergent behavior and triggering re-calculation of workload throttling values, wherein said feedback-based execution engine is controlled by said workload throttling values and said workload throttling values are applied incrementally to said feedback-based execution engine during said executing of said selected action, and wherein said executing of said selected action is repeated until an objective function is maximized, wherein said objective function specifies performance goals of workloads; and refining said models by associating a safety margin to said models, wherein said safety margin is based on a difference between predicted and observed values of said models.

9639578

14961830

1. A method comprising: receiving a search parameter with a computer that is configured with an improved search mechanism; deriving, with the computer and the improved search mechanism, a search criterion from the search parameter and using the search criterion to obtain one or more first values from a first-key value family of a key-value data repository stored in a data storage device that is coupled to the computer; obtaining based on the one or more first values, with the computer and the improved search mechanism, one or more compressed values from a second key-value family of the key-value data repository; wherein the key-value data repository comprises a cluster of a plurality of computing nodes: wherein at least one key of the first key-value family is mastered by at least one node of the plurality nodes and at least one other key of the first key-value family is mastered by at least one other node of the plurality of nodes; wherein each and every node of the cluster of nodes is configured to obtain values for any key of the first key-value family; uncompressing, with the computer and the improved search mechanism, the one or more compressed values to produce one or more uncompressed values; identifying, with the computer and the improved search mechanism, based on the one or more first values to identify one or more portions of the one or more uncompressed values; returning, with the computer and the improved search mechanism, the one or more portions of the one or more uncompressed values as search results.

6086631

09057360

1. A post-placement residual overlap removal method for use in a core-based programmable logic device (PLD) programming process wherein the PLD is programmed to implement a logic operation, the PLD including a plurality of configurable logic blocks (CLBs) arranged in rows aligned in a horizontal direction and columns aligned in a vertical direction, the logic operation being defined by a plurality of cores, each core including a group of interrelated logic portions, wherein the logic portions of each core are assigned to a selected group of the plurality of CLBs during a placement portion of the PLD programming process to produce an original placement solution, the method comprising the steps of: defining a positional relationship between the cores using a horizontal constraint graph and a vertical constraint graph, the horizontal constraint graph including a plurality of horizontal paths determined by a horizontal positional relationship of the cores assigned to each row of CLBs, and the vertical constraint graph including a plurality of vertical paths determined by a vertical positional relationship of the cores assigned to each column of CLBs; determining the feasibility of the horizontal constraint graph and the vertical constraint graph by identifying critical paths in which the number of logic portions assigned to a row of CLBs or a column of CLBs is greater than the number of CLBs in the row of CLBs or the column of CLBs; if one of the horizontal constraint graph and the vertical constraint graph is infeasible, revising the infeasible constraint graph by reassigning the logic portions of a selected core such that the number of logic portions assigned to the CLBs of the critical path are reduced; repeating the steps of determining the feasibility and revising an infeasible constraint graph until both the horizontal constraint graph and the vertical constraint graph are feasible; and allocating slack along the paths of the horizontal and vertical constraint paths such that a revised placement solution is produced that is as close to the original placement solution as possible.

9661067

14580859

1. A method for facilitating a communication system to generate a set of messages for an agent to respond to a customer, comprising: converting a plurality of messages exchanged between the customer and the agent during a dialog to a plurality of structured messages, the plurality of messages exchanged using a chat application that is configured to execute on a first computing device associated with the agent and a second computing device associated with the customer, the converting comprising: tagging the plurality of messages, at least by the agent, with one or more features of a plurality of features, wherein each of the features depict one or more extracted aspects of the dialog; and storing the plurality of messages with their tagged features as the plurality of structured messages at a storage system associated with the communication system, the storage system comprising a second plurality of structured messages that represent a second plurality of messages exchanged between a plurality of agents and a plurality of customers, the second plurality of structured messages tagged with a second plurality of features; generating, by the communication system, a first message depicting an intent of the customer for contacting the agent, the generating comprising: extracting, based on one or more prediction techniques, a group of features and a group of messages from the plurality of structured messages, the second plurality structured messages, the plurality of features and the second plurality of features using a text mining process to generate mined data; determining the intent of the customer as a function of the mined data and a user profile of the customer; and generating, by the communication system, based on the determined intent, a second message containing one or more recommendations for responding to the customer.

20090074229

11664795

1. A method for camouflaging a visual presentation of measuring values of a test object comprising the steps: recording measuring values, forming camouflage data from the recorded measuring values with the help of a mathematical algorithm for changing the measuring values, and representing the camouflage data.

8995072

14135984

1. A servo system comprising: a detector circuit operable to apply a data detection algorithm to digital data to yield hard decisions; a convolution circuit operable to yield ideal digital data based on the hard decisions and on target values; a subtraction circuit operable to subtract the ideal digital data from the digital data to yield an error signal; a scaling circuit operable to scale the error signal to yield a scaled noise signal; an adder operable to add the scaled noise signal to the digital data to yield noise-added digital data; and a second detector circuit operable to apply a second data detection algorithm to the noise-added digital data to yield output hard decisions.

9118884

12339008

1. A method, comprising: receiving a new scheduled recording instruction comprising at least a program identifier and a time; comparing the new scheduled recording instruction to an existing recording schedule to determine if a recording conflict exists; rescheduling, when the recording conflict is determined to exist, programs corresponding to the existing recording schedule, the rescheduling including: determining priority values associated with the program corresponding to the new scheduled recording instruction and the programs corresponding to the existing recording schedule, and recursively applying a conflict resolution procedure, based on the determined priority values, to the program corresponding to the new scheduled recording instruction and the programs corresponding to the existing recording schedule, to yield a new recording schedule of all programs scheduled to be recorded, the recursive application of the conflict resolution procedure including repeatedly applying the conflict resolution procedure for each of the programs corresponding to the new scheduled recording instruction and the existing recording schedule; querying a program profile associated with the program to determine whether the program corresponding to the new scheduled recording instruction is broadcast in high definition; and storing the new recording schedule in a scheduling database, wherein when the program is broadcast in high definition, determining if a high definition tuner is available, and, when a high definition tuner is available, performing the comparing the new scheduled recording instruction, the rescheduling, and the storing of the new recording schedule in association with the high definition tuner.

20030221169

10365747

1. A method for making a parser for use in extracting record data from a set of XML documents with similar structure, the method comprising the steps of: a. identifying simple XPaths in the sample document; b. forming complex XPaths and clustering the complex XPaths by common substructure; c. scoring simple XPaths based on content in instances or differences in content among instances; d. scoring complex XPaths based on content in instances or differences in content among instances; e. forming candidate parsers, with each parser comprising a single record XPath that identifies records and one or more field XPaths that identify fields; f. scoring candidate parsers, with each candidate parser score based the scores of field XPaths, the number of records identified in the sample document by the record XPath, and the structural similarity between records; g. ordering candidate parsers according to scores.

8949157

12274744

1. A computer-based method for estimating a protein-compound interaction of chemical substances, wherein the chemical substances include: a first chemical substance, wherein the first chemical substance is a small molecule and comprises a first characteristic amount expressed as a first vector having a compound descriptor calculated from the structure and properties of the first chemical substance, wherein the structure and properties of the first chemical substance are expressed as a plurality of compound descriptors including constitutional descriptors, topological descriptors, walk and path counts, connectivity indices, information indices, 2D autocorrelations, edge adjacency indices, burden eigenvalue descriptors, topological charge indices, eigenvalue-based indices, functional group counts, atom-centered fragments, and molecular properties; and a second chemical substance, wherein the second chemical substance is a protein and comprises a second characteristic amount expressed as a second vector having a protein descriptor calculated from only an amino acid sequence of the second chemical substance; the method comprising: (A) constructing a learning model using a Support Vector Machine algorithm to obtain a hyperplane for performing pattern recognitions of one or more type of information of the first chemical substance and of the second chemical substance, both of which are to be estimated for protein-compound interaction, wherein the first characteristic amount of the first chemical substance having the compound descriptor expressed as the first vector and the second characteristic amount of the second chemical substance having the protein descriptor expressed as the second vector are map- transformed to maximize correlation between chemical space coordinate and biological space coordinate, (B) mapping a characteristic vector constructed by combining the first characteristic amount of the first chemical substance to be estimated for interaction and the second characteristic amount of the second chemical substance to be estimated for interaction, into the learning model constructed in step (A) for pattern recognitions, and (C) determining whether or not the first chemical substance to be estimated for interaction interacts with the second chemical substance to be estimated for interaction based on a mapped position of the characteristic vector in step (B) relative to the hyperplane obtained in step (A).

20070288899

11451851

1. A method for analyzing software, the method comprising: dynamically analyzing a software entity; retrieving at least one static metric indicative of a result of a previous static analysis of one of the software entity and a version of the software entity; integrating the retrieved at least one static metric into the dynamic analysis of the software entity; and storing at least one augmented metric resulting from integrating the retrieved at least one static metric into the dynamic analysis of the software entity.

8200454

12119900

1. A computer-implemented method for time series analysis, comprising: receiving time series data in a computer system; differentiating, by a processor subsystem of the computer system, the time series data 0, 1 and 2 times to generate three transformed time series; differentiating by the processor subsystem each transformed time series according to seasonal cycles 0, 1 and 2 times; determining, by the processor subsystem, a variance for each seasonally transformed time series; selecting one or more subsets of variances among the determined variances; identifying a trend behavior among each selected subset of variances; determining seasonality of the time series data by providing a frequency spectrum of the time series data; processing the frequency spectrum to create a processed frequency spectrum by: filtering the frequency spectrum for reducing noise of the data, truncating the frequency spectrum at low frequencies, and weighting high frequency contributions over low frequency contributions of the frequency spectrum; and extracting a periodic cycle based on the processed frequency spectrum; building combinations of trend types and seasonality types, the trend types including non-trend, additive trend and multiplicative trend, and the seasonality types including non-trend seasonality, additive seasonality and multiplicative seasonality; and selecting, by the processor subsystem, an appropriate combination of trend type and seasonality type of the time series data among the built combinations, based on the identified trend behaviors in the subsets of variances.

9940100

14473104

1. A computer-implemented method comprising: receiving a plurality of inverted lists of quantized data points, each inverted list having a centroid data point associated therewith, the centroid data point representing an average of all of the quantized data points in the respective inverted list; sorting, by a processor, each inverted list according to a squared distance between each quantized data point in the respective inverted list and the respective centroid data point in the same inverted list as the quantized data point; receiving a query data point; and selecting, by the processor, a set of quantized data points from across each of the sorted inverted lists, each selected data point being within a distance of the respective centroid data point, the distance defined by a squared distance between the query data point and the respective centroid data point, wherein a first vector from the respective centroid data point in the same inverted list as the selected quantized data point to the query data point is orthogonal to a second vector from the respective centroid data point in the same inverted list as the selected quantized data point to the selected quantized data point.

20100082407

12243811

1. A computer implemented method for financial transformation, comprising: establishing a hub and spoke network of models including at least a process model as the hub and at least components model, value drivers model, applications model, solutions models as the spoke connected to the process model; inferring a plurality of correlations among said models using daisy-chain analysis that navigates the hub and spoke network of models; generating heat map and performing analysis on the heat map; performing application short fall analysis, the shortfall analysis including at least selecting application, overlaying application, and identifying application shortfall; performing organization shortfall analysis, the organization shortfall analysis including at least selecting organization unit, overlaying organization unit, and identifying organization shortfall; performing solution analysis, the solution analysis including at least reviewing shortfall, selecting solution and analyzing solution; and performing business case analysis, the business ease analysis including at least a combination of CBM analysis and business case analysis, and benchmarking data-based business case analysis with financial metrics.