Datasets:

patent

/

AIPD_evo_claim_one

like 0

20170185453

15435516

1. A method performed by a computing device to dynamically scale data collection and analysis associated with an application executing on the computing device, the method comprising: performing data collection to collect data regarding an activity, a performance, or a state of the application executing on the computing device; analyzing the collected data to generate a report regarding the activity, the performance, or the state of the application executing on the computing device; transmitting the generated report to a computing service hosted on a remote server via a computer network; and dynamically scaling the data collection, including: comparing one or more available resources of the computing device to one or more criteria received from the computing service for scaling the data collection; and based on the comparison, performing one or more of: allocating additional resources of the computing device to the data collection; de-allocating at least one of the one or more resources of the computing device from the data collection; enabling a feature of performing the data collection; or disabling another feature of performing the data collection.

9836622

14430866

1. A computer implemented method for determining a privacy-utility trade off, the method comprising: quantifying privacy content of a private data associated with a user based on uniqueness of information in the private data, wherein the quantifying comprises determining a theoretic randomness and uncertainty of information in the private data of the user, and wherein the private content comprises sensitive information about the user; determining a privacy-utility trade off point model based on analytical analysis of the privacy content of a private data associated with a user, a privacy requirement of the user, and a utility requirement of third party utilizing the private data of the user, wherein the privacy-utility trade off point model is indicative of optimal private data sharing technique with the third party for determining optimal sharing point, and wherein the optimal sharing point is a difference between the privacy content of the private data and that of a transformed private data; identifying privacy settings for the user based on risk appetite of the user, utilizing the determined privacy-utility tradeoff point model, wherein the risk appetite of the user is indicative of the user's utility requirement and private data sharing capabilities; and sanitizing the private data of the user by perturbation based on the identified privacy settings for the user wherein the perturbation reduces a granularity of the private data, and wherein the sanitization further comprises: ascertaining the privacy requirement of the user, and the utility requirement of third party based on the privacy setting of the user; and determining the optimal sharing point based on the privacy-utility trade off point model and the ascertained privacy requirement of the user, wherein the quantifying further comprises computing Kullback-Leibler divergence to determine relative entropy between the private data of the user and a standard non-private data, wherein the divergence is indicative of the privacy content of the private data.

20070255645

11685061

1. A method for optimal partitioning of segments in a consumer credit segmentation tree comprising: defining a first attribute-based independent variable on a first tree using a primary dependent variable having two classes; defining a second attribute-based independent variable on the first tree using the primary dependent variable; defining risk tiers for the first attribute-based independent variable on the first tree using a first risk score and the primary dependent variable; defining risk tiers for the second attribute-based independent variable on the first tree using a second risk score and the primary dependent variable; superimposing the first tree structure, based on the primary dependent variable, onto a second tree; and defining profiles in the risk tiers for the second attribute-based independent variable with a profile dependent variable having two classes, completing the second tree, wherein the second tree is used to segment a population according to credit related behavior.

8364612

12559921

1. A machine learning system comprising: an input arranged to access a plurality of relational databases; at least one store holding a model of a probabilistic relational database formed from one or more of the plurality of relational databases, the model including one or more relation schemas, each relation schema having a plurality of probabilistic attributes, wherein the model includes relational algebra instructions that query data from the one or more of the plurality of relational databases, the relational algebra instructions including: one or more factor operations each of which specifies a mapping for the queried data from each relational database to a probability distribution; for each relation schema, at least one augmentation clause that adds the plurality of probabilistic attributes to the relation schema; and at least one factor clause that specifies how a factor node is to be connected between probabilistic attributes in a factor graph data structure; a processor arranged to translate the model into the factor graph data structure using rules stored at a memory; and an inference engine arranged to perform an inference according to the factor graph data structure by using the queried data from each relational database and updating values of the plurality of probabilistic attributes for each relation schema.

20030156061

10289450

1. A method for controlling an array antenna, said array antenna comprising: a radiating element for receiving a radio signal; at least one parasitic element provided apart from the radiating element by a predetermined distance; and a variable reactance element connected to the parasitic element, thereby changing a directivity characteristic of said array antenna by changing a reactance value of said variable reactance element for operation of said variable reactance element as either one of a director and a reflector, wherein said method includes a step of calculating and setting the reactance value of said variable reactance element for directing a main beam of said array antenna in a direction of a desired wave and directing nulls in directions of interference waves on the basis of a received signal received by said radiating element so that a value of an objective function expressed by only the received signal becomes either one of the maximum and the minimum by using an iterative numerical solution of a nonlinear programming method.

6033364

08966848

1. A method of determining if reperfusion has occurred in a myocardial infarct patient after receiving thrombolytic therapy, comprising: (a) detecting a first variable comprising a first serum creatine kinase MB level in a myocardial infarct patient undergoing thrombolytic therapy at the an onset of said thrombolytic therapy; then (b) detecting a second variable comprising a second creatine kinase MB level in said patient a predetermined time after the onset of said thrombolytic therapy; and (c) detecting a third variable comprising a presence or absence of chest pain a predetermined time after the onset of said thrombolytic therapy; (d) detecting a fourth variable comprising a serum myoglobin level in said patient a predetermined time after the onset of said thrombolytic therapy; (e) generating a probability of the presence of a persistent occlusion from said first through fourth variables, the absence of a persistent occlusion indicating that reperfusion has occurred in said patient.

20020053545

09920993

1. A method of data processing and evaluation comprising the steps of: (a) correcting the data points of a chromatogram for baseline to provide a corrected-chromatogram; (b) smoothing the data points of the chromatogram to provide a smoothed-corrected-chromatogram; and (c) determining an entropy value for the smoothed-corrected-chromatogram based on the product of a data point value and a logarithm of the data point value for a plurality of data points of the smoothed-corrected-chromatogram.

9152652

13828254

1. A method performed by data processing apparatus, the method comprising: identifying responsive images for a search phrase that includes two or more terms; determining, by one or more processors, interaction rankings for each of the responsive images based on a number of user interactions with the responsive image; creating, by one or more processors, two or more sub-queries based on the search phrase, the sub-queries each being a proper subset of the two or more terms; for each sub-query from the two or more sub-queries: determining, by one or more processors, sub-query model rankings for the responsive images based on a sub-query model for the sub-query and visual features of the responsive images, the sub-query model being an image relevance model for the sub-query; and determining, by one or more processors, a search phrase score for the sub-query model, the search phrase score being based on a measure of similarity between positions of the responsive images in each of the interaction rankings and the sub-query model rankings; and selecting, based on the search phrase scores for the sub-queries, one of the sub-query models as a model for the search phrase, the selected sub-query model having a search phrase score that meets a threshold search phrase score.

20170272497

15616366

1. A computer-implemented, data processing method comprising: controlling, by a server computer, a network computer to identify data packets associated with a data stream originated by a user application; controlling, by the server computer, the network computer to generate a set of characterization data that is associated with the data stream originated by the user application; comparing the set of characterization data with a set of training characterization data to determine a type of the user application that originated the data stream; based on the type of the user application that originated the data stream, determining whether to set a quality of service setting to a high quality of service value; in response to determining that the quality of service setting is to be set to the high quality of service value, modifying the quality of service setting for the data stream by setting the high quality of service value for the user application.

20080249969

12051532

1. A mobile device system comprising: at least one mobile device; at least one remote utility component, wherein the remote utility component includes at least one information component, content component, service component, application component, or combination thereof; at least one information source component that provides contextual information to the at least one mobile device, wherein the information source component includes at least one sensory data component, information look up component, user interface component, or combination thereof; and wherein the at least one mobile device determines at least a subset of the remote utility components to make available to a user of the at least one mobile device based at least in part on the contextual information provided to the at least one mobile device.

9002485

13942316

1. A method for determining play data, the method comprising: correlating at least one tag to a participant; receiving blink data transmitted by the at least one tag; determining tag location data based on the blink data; receiving participant role data; comparing the tag location data to participant dynamics/kinetics models based at least in part on the participant role data; determining participant location data based on the comparing the tag location data to the participant dynamics/kinetics models receiving field data; comparing the participant location data to formation models based at least in part on the participant role data and the field data; determining formation data based on the comparing the participant location data to the formation models; comparing the formation data and participant location data to play models; and determining play data based on the comparing the formation data and participant location data to the play models.

20160092786

14498898

1. A method comprising: maintaining a model at an online system, the model receiving a plurality of features and generating a response based on the received features; determining a set of new features available for the model based on data maintained by the online system; determining a superset of features for the model, the superset of features comprising the plurality of features used by the model and the new features available for the model; determining measures of feature impact for one or more of the features in the superset of features, the measure of feature impact associated with a feature based at least in part on an effect of the feature on an accuracy of the model; generating a plurality of groups of features from the set of features based at least in part on the determined measures of feature impact, each group of features including one or more features differing from features included in the other groups of the plurality of groups; training the model using each of the plurality of groups of features, each group of features resulting in a performance metric for the model; and presenting information describing the performance metric of the model for each of the groups of features.

9111062

14075917

1. A computer-implemented method for optimizing a lithographic process in a simulation domain, the simulated lithographic process having data representing an illumination source and a mask, the method comprising: performing, by the computer, a free-form optimization process; placing, by the computer, sub-resolution assist feature (SRAF) seeds in a description of the mask based on a result of the free-form optimization process; and performing, by the computer, a constrained optimization process, including growing the SRAF seeds while taking into account manufacturability constraints for both the illumination source and the mask.

8521546

11835543

1. A system for pricing insurance premiums for a group including at least one individual based upon aggregate risk information, comprising: a plurality of client devices, each client device of said plurality of client devices including a display, an input device for entering information, an output device that is configured to alert an individual that information is requested from the individual and a data port, each client device configured for acquiring a first set of data from each individual of the group and a second set of data from each individual of the group, the second set of data being acquired after a time period has elapsed after acquisition of the first set of data; a medical measurement device coupled to said data port of each client device; and a server device, the server device operably connected to each client device of said plurality of client devices via a communication pathway, the server device configured to: analyze the first set of data and the second set of data to compute a first risk score by selecting a risk-assessment model against which to compare the first set of data, the risk-assessment model including at least one of an established risk-assessment model and a unique risk-assessment model, the selection of the risk-assessment model based on at least one of: information provided to the input device, the first set of data, information about a risk-related behavior, a risk-related trend, a forward-looking risk-assessment of a selected individual, a forward-looking risk-assessment of a selected subset of a population, known scientific information regarding a health risk, and known scientific information regarding disease progression, compute a second risk score for the group, divide individuals into at least a first subset and second subset of said group, said individuals being divided based upon at least one health factor associated with the first set of data regarding health information, store said first risk score of the first subset of the group and the second subset of the group, compute a first insurance premium for the first subset of the group based upon the first risk score of the first subset of the group and a first insurance premium for the second subset of the group based upon the first risk score of the second subset of the group, store said second risk score of the first subset of the group and the second subset of the group, and compute a second insurance premium for the first subset of the group and the second subset of the group based upon the second risk score for the first subset of the group and the second subset of the group, said second insurance premium being further computed based upon said at least one health factor associated with the first set of data regarding health information for which individuals of said group are divided into said first subset of said group and said second subset of said group, wherein the second insurance premium computed for the first subset of the group and the second subset of the group includes a determination of an adjustment to the first insurance premium based on a change in the first risk score as compared to the second risk score as it relates to said at least one health factor.

8255243

13181736

1. A method of underwriting an insurance policy comprising: identifying a vehicle; forming, in a physical memory of a data processing system, a plurality of data groupings using a processing device of the data processing system, wherein each of the plurality of data groupings include at least one vehicle history data variable of the identified vehicle; processing the at least one vehicle history data variable of at least one data grouping of the plurality of data groupings using the processing device of the data processing system; determining an overall value of said at least one data grouping using the processing device of the data processing system; generating a score, using the processing device of the data processing system, based upon the overall value of said at least one data grouping; and outputting from the data processing system information relating to underwriting of an insurance policy for the identified vehicle that is based on said score.

10092360

15088463

1. A system for patient-specific image processing comprising: a data storage device storing instructions for patient-specific image processing; and a processor configured to execute the instructions to perform a method comprising: receiving or generating data associated with non-invasively produced time-varying medical images of a vasculature having at least one change in blood flow or blood vessel morphology during a cardiac cycle of a patient; receiving measurements of an observed value of the blood vessel morphology and an observed value of blood flow using the received or generated data; generating a three-dimensional dynamic model of the vasculature for simulation processing based on the non-invasively received time-varying medical images; identifying one or more boundary conditions of the three-dimensional dynamic model for adjustment; iteratively predicting at least one of a value of a blood vessel morphology and a value of blood flow using the generated three-dimensional dynamic model, and iteratively adjusting the identified boundary conditions, until the predicted values are in conformity with at least one of the observed value of the blood vessel morphology and the observed value of the blood flow; and simulating the three-dimensional dynamic model using the adjusted boundary conditions to non-invasively calculate a blood flow-characteristic.

7671860

11213553

1. A computer implemented method for determining at least some coordinates of at least some points on an implicit curve resulting from an intersection of a plurality of graphical objects, the method comprising: determining, by a computer, one or more parameterization regions of the implicit curve resulting from the intersection; determining, by the computer, one or more convergence regions of the one or more parameterization regions, wherein the determining one or more convergence regions comprises (a) and (b): (a) testing for convergence for a given parameterization region via a Kantorovich condition while adjusting the given parameterization region by Newton steps; (b) responsive to determining that the given parameterization region does not converge after adjusting the given parameterization region via Newton steps, subdividing the given parameterization region into a plurality of subdivisions and separately testing for convergence of the plurality of subdivisions; receiving, by the computer, a sparse parameterized representation of at least a portion of the implicit curve, the representation comprising sparse convergence region descriptor data for describing the one or more convergence regions and sparse starting point descriptor data for deriving starting points associated with the one or more convergence regions; at runtime, based at least on the sparse starting point descriptor data of the starting points associated with the one or more convergence regions, deriving, by the computer, the coordinates of at least some of the starting points associated with the one or more convergence regions; and applying, by the computer, Newton iteration starting from the derived coordinates of the at least some of the starting points to determine at least some coordinates of one or more points on the implicit curve; wherein applying Newton iteration starting from the derived coordinates of the at least some of the starting points is guaranteed to converge to a solution.

20100153332

12336927

1. A data processing system, comprising: a data mining system for mining data from a data warehouse in accordance with a data model, wherein the data model defines how data groups can be partitioned; and a data group analysis system that calculates a set of diagnostic measures and performs statistical significance tests for a defined data group.

8706514

11253164

1. A method for mediating anomaly notifications in health data, comprising: performing on a computer: receiving anomalies generated by different algorithms, with each anomaly in the anomalies comprising anomaly variable data; comparing fields in one of the anomaly variable data to a table defining cases; assigning one of the cases to the one anomaly variable data when a field in the one anomaly variable data matches an entry in the table; determining a distance between the one anomaly variable data and the one case; assigning a relevance to the one anomaly variable data based upon the distance; adding a relevance field to the one anomaly variable data; assigning the relevance to the relevance field; associating in the table the one case to the one anomaly variable data; providing an interactive environment for collaboration among multiple users; dispositioning the one case based upon results of the collaboration; and retiring the one case.

9320604

14602172

1. A method for providing surgical parameter data, the method comprising computer-implemented steps of: a] being responsive to patient specific information data for deriving patient data, the patient specific information data being indicative of one or more dynamic characteristics; and b] determining a set of possible surgical parameter data according to the patient data and patient acquired data, the patient acquired data being indicative of one or more desired post-surgery activities, the patient acquired data comprising post-surgery activities preference data; and a further step of selecting the surgical parameter data from the set of possible surgical parameter data according to the post-surgery activities preference data.

7747548

11302406

1. A method of evaluating tactile sensations of a car seat cover, comprising: identifying a type of the car seat cover; obtaining values for one or more physical characteristic factors of the car seat cover in accordance with the identified type of the car seat cover; quantitatively evaluating a first set of tactile sensations with regard to the type of the car seat cover, including determining quantitative numerical values of the first set of tactile sensations based on the one or more physical characteristic factors including mechanical and thermal/physiological characteristic factors input to a statistical recursive model for the evaluation of a corresponding tactile sensation of the first set; grading the mechanical and thermal/physiological characteristic factors and the determined quantitative numerical values of the first set of tactile sensations, yielding a first set of grade values; quantitatively evaluating a second set of tactile sensations with regard to the type of the car seat cover, including setting the quantitative numerical values of the first set of tactile sensations as input values, subjecting the set input values to an artificial neural network model for the evaluation of a corresponding tactile sensation of the second set, and determining quantitative numerical values of the second set of tactile sensations; grading the determined quantitative numerical values of the second set of tactile sensations, yielding a second set of grade values being within a predetermined range; and displaying the first and second sets of grade values, wherein the identified type of car seat cover comprises a leather type, and wherein the values for the mechanical and thermal/physiological characteristic factor values comprise values for at least one of the group consisting of: S(Softness), μ(sliding resistance coefficient), RB(bending resilience (%)), RT(tensile resilience (%)), P(moisture vapor permeability(mg/cm 2 /hr)) and q max (maximum value of initial heat flux (J/cm 2 ·sec)).

20130091484

13253181

1. A method of customizing architecture design work products to requirements of an application, using an architecture design solution repository including architecture design solutions comprising a plurality of data object trees each with a plurality of data object nodes, the method comprising the steps of: a computer retrieving a question regarding the requirements of the application from the data object node of the architecture design solution repository; the computer displaying the question regarding the requirements of the application to an application user through an interface; the computer receiving an indication of answers chosen by the application user to the question displayed; the computer indicating within the data object node which answers were chosen by the application user; the computer determining from which data object node to retrieve another question based on the answers indicated by the application user, and repeating from the computer displaying questions regarding the requirements of the application to the application user through the interface until all questions are answered; the computer determining which architecture design solution within the architecture design solution repository matches the requirements of the application indicated by the application user; the computer generating an architecture design work product based on matching the data object nodes to architecture design solutions within the architecture design solution repository.

20130117003

13446333

1. A method for structuring hardware information in a computer system, the method comprising: modeling Target Independent Model (TIM), which is independent from a hardware; structuring hardware information based on Meta Object Facility (MOF)-Hardware Component Modeling Language (HCML); and transforming the TIM into a Target Specification Model, which depends on the hardware, based on the structured hardware information and the model transformation language, wherein the step of structuring hardware information based on Meta Object Facility (MOF)-Hardware Component Modeling Language (HCML), comprises: defining a MOF-based Hardware Component Modeling Language (HCML) meta-model; and defining a model by using a meta-model of the HCML and representing architecture information on the model.

9424360

13795833

1. A method performed by data processing apparatus, the method comprising: receiving data identifying a physical location; obtaining data identifying a plurality of events occurring in the physical location during a particular time period; computing a respective plurality of signal scores for each of the events, wherein computing the respective plurality of signal scores for each of the events comprises: obtaining search results for a search query that includes a first term identifying the physical location and a second term indicating an interest in events occurring in the physical location; determining a position in a ranking of the search results of a highest-ranked search result that mentions the event; determining a frequency with which the event is mentioned in resources identified by the search results; and using the position of the highest-ranked search result and the frequency with which the event is mentioned in resources identified by the search results to compute a first signal score of the plurality of signal scores for the event; computing a respective popularity score for each of the plurality of events by combining the respective plurality of signal scores for the event; and generating a ranking of events occurring in the physical location during the particular time period based at least in part on the popularity scores.

9836320

15067625

1. A method of collecting performance metrics data from Java virtual machines, comprising: setting up a virtual storage structure of a collector on a computing system for collecting performance metrics data from a plurality of Java virtual machines; pushing, at each of the plurality of Java virtual machines through a corresponding performance monitoring Java agent, performance metrics data collected by the Java virtual machine to the virtual storage structure of the collector; pulling, at a performance monitoring system through a collector application programming interface (API), the performance metrics data collected by the plurality of Java virtual machines from the virtual storage structure of the collector; analyzing the performance metrics data pulled from the virtual storage structure of the collector by the performance monitoring system; and generating, by the performance monitoring system, a performance alert when the performance metrics data analyzed indicates one or more system abnormalities; wherein setting up a virtual storage structure comprises: setting up a global vector table (GVT) and structures for storing performance metrics data collected from each of the plurality of Java virtual machines, a program call (PC) routine, and a system-wide addressable name-token with a unique name comprising a collector identifier (ID), and a token having a PC number, a GVT address and an address space token (STOKEN).

8799186

13882867

1. A computational system for performing an online choice model, the system comprising: at least one processor; at least one memory operatively coupled to the at least one processor; and a plurality of modules, each of the modules comprising instructions for execution by the at least one processor, the plurality of modules comprising: a problem definition module comprising a problem definition user interface for receiving a plurality of attributes from a user wherein each attribute has an associated plurality of attribute levels; an online choice model survey module comprising: an experimental design generator module for generating a survey experimental design and an associated plurality of treatments; comprising a library of experimental designs, wherein the experimental design generator module determines the signature of the attribute space from the received plurality of attributes and associated attribute levels; and for one or more experimental designs in the library of experimental designs, performs one or more transformations until the signature of the transformed experimental design matches the signature of the attribute space to obtain one or more matching transformed experimental designs; wherein each transformation preserves the information properties of the untransformed experimental design; wherein the experimental design generator module selects the survey experimental design from the one or more matching transformed experimental designs; and wherein the experimental design generator module obtains a set of treatments from the selected survey experimental design; an online survey assembly module which receives the plurality of treatments and assembles an online survey from one or more survey templates pages, and a plurality of treatment representations created using the plurality of treatments received from the experimental design module; a data collection and sampling module for conducting the assembled online survey, wherein the data collection and sampling module allocates treatments to survey respondents and collects responses using the assembled online survey; a model generation module for receiving the data collected by the data collection and sampling module and building a model to obtain a plurality of model parameter estimates and errors from which a utility estimate can be obtained for each attribute level; and a model explorer module comprising a model explorer user interface for allowing the user to enter one or more attribute levels and obtain a model prediction of the expected utility; wherein the one or more transformations comprise one or more of the following group of transformations: factorial splitting of a factor F into two sub factors A, B where A×B=F and A or B match at least one unmatched factor in the signature; factorial expansion of a factor F into a new factor A×F where A×F matches at least one unmatched factor in the signature; factor truncation of a factor F into a new factor F−A where F−A matches at least one unmatched factor in the signature; full factorization by generation of a new factor F where F matches at least one unmatched factor in the signature; and deleting a factor F when all the other factors in the signature are matched.

7987143

12702939

1. A computer-implemented method of performing a multi-objective evolutionary algorithm (MOEA) based engineering design optimization of a product, said method comprising: creating an archive in a storage device coupled to a computer system configured for performing the MOEA based engineering design optimization, the engineering design optimization comprises a plurality of generations in accordance with an evolution scheme of MOEA, each of the generations containing a set of product design alternatives in a predefined design space of the product; obtaining a corresponding set of solutions by evaluating each of the product design alternatives in accordance with design objectives; updating the archive with one or more non-dominated solutions after said evaluation of said each of the generations, said one or more non-dominated solutions being determined from the corresponding set of solutions and the archive's existing members; creating a termination criterion of the MOEA based optimization from an optimization performance indicator derived from the archive's update history that include total number of members, number of members being culled and number of members being added at said each of the generations, said termination criterion including when a consolidation ratio is greater than 0.25 at current generation, said consolidation ratio being configured as said optimization performance indicator as a ratio of number of members in the archive at a prior generation that are also present in the archive at the current generation to the total number of members in the archive at the current generation; and designating the non-dominated solutions in the archive as a set of optimized product designs when the termination criterion has been met.

20100313205

12481509

1. A method comprising: executing instructions by a special purpose computing apparatus to: characterize a distribution of past real-time events in one or more electrical digital signals representing the real-time events based, at least in part, on at least one key attribute associated with said real-time events; map the real-time events to key value pairs; and generate one or more electrical digital signals representative of a partitioning of the key-value pairs among a plurality of reducer nodes based, at least in part, on the distribution.

20050283775

10919115

1. A computer-implemented method comprising: identifying a loop within a piece of program code; identifying, within a body of the loop, a plurality of isomorphic statements having adjacent memory accesses; transforming the plurality of isomorphic statements into one or more vector operations; and generating single-instruction multiple-datapath (SIMD) code from the one or more vector operations.

20080228750

11724559

1. A method, comprising: receiving a particular query that comprises one or more terms; making a plurality of comparisons, wherein each comparison is between the particular query and a different query of a plurality of queries; and based on the plurality of comparisons, generating one or more relevance features.

8024327

12146185

1. In an information retrieval system, a computer-implemented method for information processing, comprising: accessing, by a computer system, a set of documents obtained from the information retrieval system; establishing, automatically by the computer system, at least one identifying characteristic within the set of documents; analyzing, by the computer system, the set of documents to obtain a statistical distribution based on values associated with the set of documents, the set of documents having a given size; computing a value of a function that measures distinctiveness of the obtained statistical distribution relative to a baseline statistical distribution of values associated with a baseline set of documents; normalizing the value relative to a distribution of values of the function that measures distinctiveness over a space of document sets, wherein a respective value of the function that measures distinctiveness corresponds to a respective document set within the space of document sets, wherein each document set in the space has a size that is comparable to the given size, and the act of normalizing the value includes an act of performing a computation on the value that accounts for the given size of the set of documents; and outputting a response derived from the normalized value.

20080243748

11343991

1. A rule set partitioning based packet classification method for Internet, comprising: performing Horizontal Cut for the rule set; and performing Vertical Cut for the rule set.

20100036826

12580815

1. A method for integrating relational and hierarchical data, schema definitions, and queries in a data processing system, comprising the steps of: converting one or more schema definitions into an intermediate schema language component of an intermediate data language when one or more schema definitions are provided; converting one or more query expressions into an intermediate query language component of the intermediate data language when one or more query expressions are provided; and compiling, in an intermediate data language processing engine, at least one of the intermediate schema language component and the intermediate query language component into a run-time representation in accordance with a relational-hierarchical analysis; wherein the data processing system comprises a processor and memory for performing the converting and compiling steps.

7515983

11776789

1. A method of determining production starts in a manufacturing environment, said method comprising: inputting production starts, said production starts each having an initial recommended start date and quantity; grouping said production starts into production lots according to grouping rules, said grouping comprising lotsizing said production starts; assigning at least two potential start dates and associated priorities to each of said production lots, said at least two potential start dates comprising a critical start date and at least one non-critical start date, each of said at least two potential start dates having a start date-dependent priority; and capacitating said production lots so as to allow production of production lots to be started by non-critical start dates according to priority provided that available capacity exists and provided that subsequent production starts of production lots by critical start dates are not impacted, said capacitating comprising determining, based on said at least two potential start dates and associated priorities, when said production lots can be started without exceeding said available capacity.

20170147470

14947503

1. A method of generating time based data, the method comprising: defining a time based data generation scenario, the time based data generation scenario comprising: at least one event, the event representing an action at a specific time; a plurality of time segments, each time segment defining a particular temporal phase of the scenario and at least one time segment being embedded with the at least one event; and a time envelope to embed time segments; specifying in at least one time based attribute rule a data attribute that is not time based, each of the at least one time based attribute rule linking the time envelope to the embedded time segments and the at least one event generating at least a portion of a time based data object by executing the time based data generation scenario, the time based data object including data representing at least one of the plurality of time segments, and the embedded at least one event, and the specified at least one time based attribute rule; providing the generated time based data object to a memory buffer; interrupting the generating of the time based data object after determining the memory buffer is full; continuing the generating of the time based data object from where it was interrupted; and at least one of verifying and demonstrating functionality of a software application by providing the generated time based data object representing a data generation scenario for consumption by the software application.

10120929

14457019

1. A system for categorizing items, the system comprising: a network-based service configured to: receive a request to categorize an item of interest, the request including item information regarding the item of interest; and transmit the request to an item categorization service; a data store configured to store categories for items, wherein at least a portion of the categories are hierarchically organized with respect to one another; and the item categorization service, wherein the item categorization service is in communication with the data store and the network-based service, and wherein the item categorization service is adapted to: assign a first category to the item of interest by: identifying a plurality of first category candidates based at least in part upon a relevance value associated with the item information and one or more of the categories for items stored by the data store, wherein at least a portion of the first category candidates are hierarchically organized; determining which of the first category candidates has the most first category candidate attributes of the first category candidates; and selecting the first category candidate that has the most first category candidate attributes as the first category of the item of interest; and assign a second category to the item of interest by: determining one or more rules associated with the first category of the item of interest; identifying a plurality of second category candidates using the rules; and selecting a second category of the item of interest from the plurality of second category candidates.

4719586

06794077

1. A method for controlling a process for manufacturing discrete workpieces and for automatically adjusting an apparatus for producing the workpieces with a controlled dimension about a selected centered mean of a distribution of measured controlled dimensions, said apparatus including a system memory, the method comprising the steps of: determining a mean value; storing a correction value in the system memory; selecting a system closure rate: measuring the controlled dimension of a last workpiece; calculating an expected dimension for a next workpiece based on the measured controlled dimension of the last workpiece and the selected closure rate; manufacturing the next workpiece; measuring the controlled dimension of the next workpiece; comparing said measured dimension of the next workpiece with the measured dimension of the last workpiece and the expected dimension; adjusting the correction value stored in the system memory in accordance with said comparison; calculating an adjustment value proportional to said adjusted stored correction value; and adjusting said apparatus in accordance with said adjustment value.

5394509

07861068

1. A method for searching for improved results from a process, which process is performed according to a set of parameters, comprising the steps of: a. providing at least one trial set of parameters for the process; b. performing the process to obtain a result for each trial set for which a result has not been obtained; c. selecting at least one trial set from the provided trial sets on the basis of an overall ranking of the trial sets based on a selected criterion, wherein the selected criterion is both quality and diversity; and d. perturbing at least one of the selected trial sets to obtain an additional trial set for the process; e. repeating step b providing the selected trial sets and the additional trial sets for further analysis.

8845495

13650884

1. One or more non-transitory computer storage media having computer-executable instructions embodied thereon, that when executed by a computing system having a processor and memory, cause the computing system to perform an athleticism rating method for evaluating the athleticism of an athlete in a particular sport, the method comprising: measuring a first athletic result for the athlete, the first athletic result based on a performance of the athlete in a first performance drill rationally related to a first desired athletic performance characteristic in the particular sport; measuring a second athletic result for the athlete, the second athletic result based on the performance of the athlete in a second performance drill rationally related to a second desired athletic performance characteristic in the particular sport; and within the computing system, applying the first result and the second result to a sport-specific normalizing equation adapted for the particular sport to calculate a single athleticism score representing a rating that is specific to the particular sport for the athlete.

20100060643

12206691

1. A computer-implemented method for drawing directed acyclic graphs, the method comprising: receiving, in a computing system, information representing a directed acyclic graph, a computer processor of the computing system configured for: generating a layout of the directed acyclic graph, the layout comprised of one or more subgraphs, each subgraph comprising two or more nodes and edges that connect pairs of nodes, the nodes and edges being defined in x- and y-coordinates; reducing the number of edge crossings in the layout of the directed acyclic graph; straightening the edges of the layout of the directed acyclic graph; compacting one or more subgraphs along x-coordinate axis to generate a compacted DAG layout; and assigning new y-coordinates to the nodes of the one or more subgraphs such that the nodes do not overlap in the y-coordinate to generate a new layout of directed acyclic graph.

20100094767

12483887

1. A method comprising: automatically generating a causal model corresponding to a user; estimating a plurality of components of the causal model using event parameters of a first set of events undertaken by the user in an account of the user; and predicting expected behavior of the user during a second set of events using the causal model.

8346765

12802816

1. A method for generating ranked search results, comprising: receiving a plurality of matching information items that match a search request; ranking at least some of the plurality of matching information items using a linear ranking model that linearly combines a first plurality of feature values to obtain a first set of ranked results, wherein the linear ranking model combines the first plurality of feature values in a linear fashion using weight coefficients corresponding to the first plurality of feature values; ranking at least some of the first set of ranked results using a nonlinear ranking model that nonlinearly combines a second plurality of feature values to obtain a second set of ranked results, wherein the nonlinear ranking model combines the second plurality of feature values in a nonlinear fashion using weight coefficients corresponding to the second plurality of feature values; and providing a search response based on the second set of ranked results.

8001074

12023920

1. A computer-implemented method of extracting time-series behavior based on time-series information, the method comprising: loading into a computer time-series data, wherein the loaded time-series data comprises time-series data points comprising an input-component-part and an output-component-part, the input-component-part comprising one or more input components and the output-component-part comprising one or more output components, the one or more input components collectively representing a value from an input space and the one or more output components collectively representing a value from an output space, wherein loading time-series data further comprises incorporating at least one time-related input component of at least one data point into the loaded time-series data; dividing into fuzzy regions a range of possible values for each component of the time-series data; assigning with one or more computer processors a fuzzy membership function to each fuzzy region; generating with one or more computer processors non-conflicting fuzzy rules that are determined at least in part by the fuzzy membership functions and at least in part by how a plurality of the time-series data points are clustered; determining a mapping from the input space to the output space based on defuzzification of the fuzzy rules; and displaying the mapping in a manner that allows a user to perform time-series prediction or time-series-trend recognition.

20100204961

12367311

1. A computer implemented method for integrating multiple engineering design systems in a computer aided design (CAD) system, comprising: (a) displaying, on a display device of the CAD system, a design generator configured, via an application programming interface (API), to accept input from a designer that results in the creation of an engineering design wherein the engineering design comprises two or more different worksheets, wherein each worksheet: (i) represents a different aspect of the engineering design; (ii) comprises one or more local design objects, wherein each local design object: (1) represents a functional aspect of a component; and (2) is independent from a physical representation of the component; (iii) comprises one or more relation objects, wherein each relation object models constraints of one or more properties of the one or more design objects; (b) organizing the one or more local design objects and one or more relation objects in an Functional Layout Document (FLD); (c) storing the FLD in a data center comprising a shared database within the CAD system, wherein the shared database is shared by the two or more worksheets; and (d) using the FLD, via user input and the display device, to design an engineering design.

20080065436

11530039

1. A method of supply chain facility performance analysis, the method comprising: maintaining supply chain facility configuration information for a plurality of supply chain facilities; identifying variables that are attributed to performance of the supply chain facilities; collecting data corresponding to one or more of the variables for selected chain facilities in the plurality of supply chain facilities; performing performance analysis for the selected supply chain facilities using the data as input, the performance analysis including executing a data envelope analysis (DEA) based three-stage performance analysis model, executing a statistical analysis and executing a sensitivity analysis; and outputting the results of the performance analysis, the results including a performance ranking of the selected supply chain facilities, a prescription for performance improvement, a correlation analysis, and a sensitivity analysis.

9646271

12851995

1. A computer implemented method of allocating human resources to a cohort, the computer implemented method comprising: a processor identifying at least one attribute held by each member of a group of human resources; the processor receiving, from a planned cohort, a request for multiple human resources that collectively possess a set of predefined attributes, wherein no single human resource possesses all of the predefined attributes; the processor assigning multiple cohorts to a workgroup, wherein each of the multiple cohorts satisfies at least one unique need of a project to which the workgroup is assigned, wherein the project is in a particular field; the processor data mining on-line content by using a crawling logic to identify every paper written by a candidate cohort member, wherein the crawling logic identifies said every paper written by the candidate cohort member and available from an on-line database, and wherein the crawling logic blocks an identity of the on-line database from being revealed to non-crawling logic; the processor determining, based on the data mining, that the candidate cohort member used a term from a specialized lexicon of a particular field in every paper written by the candidate cohort member during a current year in which the data mining occurred; the processor determining, based on the data mining, that the candidate cohort member never used the term from the specialized lexicon of the particular field in any paper written by the candidate cohort member before the current year in which the data mining occurred; the processor, in response to the data mining determining that the candidate cohort member used the term from the specialized lexicon of the particular field in every paper written by the candidate cohort member during a current year in which the data mining occurred, and in response to the data mining determining that the candidate cohort member never used the specialized lexicon of the particular field in any paper written by the candidate cohort member before the current year in which the data mining occurred, assigning the candidate cohort member to the planned cohort to create an updated planned cohort; the processor receiving a request for data that describes the updated planned cohort from a requester; and the processor, in response to receiving the request for the data that describes the updated planned cohort, transmitting the data that describes the updated planned cohort to the requester.

8620916

13416320

1. A method of data acquisition, said method comprising: downloading a user's sent materials from a communication data repository; analyzing the sent materials and extracting data portions that are authored by the user; generating statistical values from the extracted data; transmitting the generated statistical values to one or multiple repositories; receiving the generated statistical values on one or multiple server machines; and aggregating statistical values of multiple users, wherein said aggregating statistical values of multiple users comprises inferring personal expertise of each user who transmits the generated statistical values from the user's extracted data.

8185377

12147750

1. A system for evaluating translation quality of a machine translator, comprising: a bilingual data generator configured to intermittently access a wide area network and generate a bilingual corpus from data received from the wide area network; a linguistic analysis component configured to add otherwise latent linguistic information to the bilingual corpus to obtain an augmented bilingual corpus; an example extraction component configured to receive an ontology input indicative of a plurality of ontological categories of evaluation and to extract evaluation examples from the augmented bilingual corpus based on the ontology input; and a processor that is component of a computing device that utilizes an evaluation component to evaluate translation results from translation by a machine translator of the evaluation examples and to score the translation results according to the ontological categories.

8595376

13153632

1. A system comprising: a broadcast server; a narrowcast server; and a service manager configured to: detect a number of user terminals accessing content provided by the broadcast server and the narrowcast server; and upon the number of user terminals meeting a pre-determined threshold, qualify for a predetermined timeframe at least one of a first content item provided by the broadcast server to be provided by the narrowcast server and a second content item provided by the narrowcast server to be provided by the broadcast server.

8712897

13484552

1. A stock analysis method for performing an analysis on a plurality of stocks to select target ones to be bought/sold from the stocks, the company of each of the stocks belonging to a corresponding classified industry, said stock analysis method comprising the steps of: a) calculating stock return data of each of the stocks, market return data, and classified industry return data of each of the corresponding classified industries based on historical stock price information within a historical trading period that includes a current trading period and that consists of a number (N) of consecutive time intervals; b) according to the stock return data, the market return data and the classified industry return data obtained in step a), determining whether a stock return of each of the stocks in each of the N time intervals is greater than a classified industry return of the corresponding classified industry in a corresponding one of the N time intervals, whether the stock return of each of the stocks in the corresponding one of the N time intervals is greater than a market return in the corresponding one of the N time intervals, and whether the classified industry return of the corresponding one of the classified industries in the corresponding one of the N time intervals is greater than the market return in the corresponding one of the N time intervals; c) based on results determined in step b), grouping the stocks so that each of the stocks in each of the N time intervals is grouped into a corresponding one of a number (G) of different groups; d) obtaining clustering data of each of the stocks corresponding to each of the N time intervals and associated with the groups based on a specific one of the groups using a clustering mode; e) estimating by a computer, analysis data of each of the stocks corresponding to a coming time interval based on at least the clustering data obtained in step d); and f) determining any ones of the stocks whose analysis data estimated in step e) matches predetermined selection criteria as the target ones of the stocks; wherein, in step d): the clustering mode is one of a combination clustering mode and a permutation clustering mode; in the combination clustering mode, the clustering data of each of the stocks corresponding to an i th one of the N time intervals includes the corresponding one of the groups in the i th one of the N time intervals, and a number (S i ) of the time intervals in a reference period from [i−(Q−1)] th to i th ones of the N time intervals, where 1≦i≦N and 2≦Q≦i, wherein a corresponding one of the stocks is grouped into said specific one of the groups in the number (S i ) of the time intervals; and in the permutation clustering mode, the clustering data of each of the stocks corresponding to the i th one of the N time intervals includes the corresponding one of the groups in the i th one of the N time intervals, and group permutation pattern consisting of the corresponding ones of the groups that correspond respectively to [i−(Q−1)] th to i th ones of the N time intervals.

20040013303

10199581

1. An image recognition method comprising normalizing static image data; and classifying the normalized static image data using a support vector machine with a defined kernel that implicitly evaluates a linear kernel on input data after a one-time precomputation of an image training data set.

6037626

09101848

1. A semiconductor neuron, comprising: at least one input electrode, consisting of a plurality of partial electrodes, coupled capacitively for signal transmission to a floating gate whose potential controls a current of a MOS field effect transistor; a respective neuron input being connectable to partial electrodes of the plurality of partial electrodes such that a total surface area of the partial eltrodes connected to the respective neuron input corresponds to a respective weight of the respective neuron input, and whereby sub-electrodes of the input electrodes are connected to neuron inputs via multiplexers.

8471849

13559488

1. A method comprising: receiving information associated with a plurality of renderings of a three-dimensional (3D) model, wherein the information associated with the plurality of renderings identifies portions of interest of the 3D model which are inspected while the 3D model is rendered on a display; determining frequencies with which the portions of interest are inspected based on the received information, wherein a given frequency for a given portion of interest is determined based on a number of times the given portion is inspected throughout the plurality of renderings; determining priority values for the portions of interest based on the frequencies with which the portions of interest are inspected, wherein a priority value of a given portion of interest indicates a priority of the given portion of interest relative to the portions of interest; and determining via a processor a statistical model for the 3D model based on the priority values for the portions of interest.

8620461

12565873

1. A system for updating tuning parameters of a controller, said system comprising: a controller accessing a memory having one or more memory units for storing a first data set for use with a compiled controller template and a second data set for use with the compiled controller template; a processor; a computer-usable medium embodying computer program code, said computer program code comprising instructions executable by said processor and configured for: identifying a compiled controller template for operating the controller, the compiled controller template including an algorithm representing a dynamic operating process of a system to be controlled by the controller; generating the first data set indicative of an explicit control law associated with a solution to a model predictive control optimization problem related to the dynamic operating process of the system, wherein the first data set is associated with a specified data structure having said at least one data set; and updating variables to generate a second data set, separate from the first data set; and enabling the controller to switch from using the first data set to using the second data set without altering said compiled controller template in order to repeatedly tune said controller without performing a recompilation with respect to said compiled controller template.

20070107077

11270996

1. A method of producing a transformed Brassica cell by particle bombardment, comprising: (a) Culturing an explant derived from a pre-incubated microspore, said explant comprising a cell, under a condition of plasmolysis for a period of about half an hour to about 4 hours prior to bombardment; (b) introducing a DNA construct by microprojectile bombardment into an exposed cell on a surface of the explant, wherein the explant is under the condition of plasmolysis; and (c) continuing to culture the explant under the condition of plasmolysis for a period of about 4 hours to about 20 hours, to produce a transformed Brassica cell.

5420508

08127258

1. Nuclear magnetic resonance analysis apparatus comprising: (a) means for producing and receiving free induction decay signals from a plurality of known samples, (b) means for decomposing said free induction decay signals into calibration component equations, (c) means for forming explanatory variables from said calibration component equations, (d) means for forming principal components by linear transformation from said explanatory variables, and (e) means for forming a regression model equation of said principal components, (f) means for producing and receiving a free induction decay signal from a sample of interest, (g) means for decomposing the sample free induction decay signal of (f) above into component curves and for forming the principal components from said sample signal of (f) above, and (h) means for regressing and analyzing the sample free induction decay signal from said model regression equation to predict the true types, properties and quantities of the target nuclei and mass characteristics of sample materials.

20150332106

14653187

1. A method of registration and recognition of a user of a service, through identification codes derivable from biometric data, comprising the steps of: a. registering a user, through a respective registration event, wherein each registration event comprises: acquiring from the user to be registered at least one biometric datum of the user; encoding, by a coding procedure, the at least one acquired biometric datum into a respective registration identification code of the user to be registered; associating said registration identification code to the user to be registered; registering the user as a registered user, and the associated registration identification code as the registration identification code of the registered user; b. recognizing a registered user, among a plurality of registered users, through a respective recognition event, comprising: acquiring from the user to be recognized said at least one biometric datum of the user; encoding, by said coding procedure, the at least one acquired biometric datum into a respective recognition identification code of the user to be recognized; preparing, based on the registration identification codes, registered at a plurality of registration events, a comparison set comprising a plurality of comparison identification codes; comparing the recognition identification code with each of said plurality of comparison identification codes; estimating, for each of said comparisons, a respective matching level; recognizing or refusing recognition of the user to be recognized based on the estimated matching levels; wherein each of said comparisons between the recognition identification code and one of the comparison identification codes comprises processing carried out by applying at least one trained algorithm, and wherein the recognition event further comprises the step of further training said at least one trained algorithm.

20040230597

10691278

1. A method in a data processing system having a program, the method comprising the steps performed by the program of: generating a dataset having at least one exposure level to failure of a computer-based system and a corresponding rule identifier of a rule used to calculate the exposure level, the rule asynchronously receiving information about the computer-based system and calculating the exposure level based on the received information; comparing the generated dataset to a previously generated dataset by comparing the at least one exposure level of the dataset to an at least one exposure level with the same rule identifier in the previously generated dataset, the previously generated dataset being associated with a known problem with the computer-based system; and calculating a probability of a problem with the computer-based system based on a number of exposure levels in the generated dataset matching exposures levels in the previously generated dataset.

9994906

15431349

1. A method for the detection of a fetal chromosomal aneuploidy in a pregnant female comprising i) receiving a biological sample from said pregnant female, ii) preparing nucleic acids from said biological sample, iii) amplifying a selected set of target DNA sequences in at least one quantitative multiplex PCR reaction wherein at least one amplified DNA sequence comprises at least one SNP for which the female is heterozygous, iv) sequencing of the amplified target DNA sequences, and v) calculating the sum of read counts for all amplified DNA sequences of a suspected chromosomal aneuploidy followed by normalization, against the sum of read counts for all amplified DNA sequences of a reference chromosome from said biological sample to determine by statistical methods a set score indicative for the presence of a fetal chromosomal aneuploidy.

8356273

12375686

1. A method implemented by a computer, including a processor, that has been programmed with instructions that cause the computer to analyze feasibility of designing an electronic assembly composed of at least one subassembly, the method comprising: defining, by the processor, a functional architecture of the electronic assembly that includes a list of functions, the list of functions including at least one function; acquiring characteristics of the at least one function; determining the number of subassemblies according to at least one physical constraint or user defined constraint; distributing the functions of the list of functions among the subassemblies of the electronic assembly according to the number of subassemblies determined; determining characteristics of the subassemblies of the electronic assembly; and analyzing, by the processor, the electronic assembly, said analysis including analyzing the distribution of the functions within each one of the subassemblies using at least one criterion associated with a characteristic acquired or determined.

20150344946

14699891

1. A method for genotyping one or more genetic markers, comprising: (a) ligating at least one adaptor to at least one restriction fragment to produce at least one adaptor-ligated restriction fragment; (b) amplifying by solution PCR the at least one adaptor-ligated restriction fragment with at least one primer pair to produce a library of at least one amplified adaptor-ligated double stranded restriction fragment, wherein the amplified adaptor-ligated restriction fragment comprises an identifier tag; (c) sequencing a pool of two or more libraries of tagged amplified adaptor-ligated restriction fragments using high throughput sequencing technology, wherein each library comprises a unique identifier tag, wherein the sequencing comprises amplifying by PCR on a solid support; (d) clustering the sequences; and (e) identifying genetic markers within the library and/or between libraries using the identifier tag.

8984024

14065319

1. A sub-block parser configured with a variable sized window, where the variable sized window is used by the parser to parse a block of data into smaller sub-blocks of data by passing the variable sized window over the block of data to identify sub-block boundary locations, where the smaller sub-blocks of data are mutually exclusive subsets of the block of data, where a window location is defined by b[k−A+1. .. k+B], b being the block of data, k being an integer, A being an integer, and B being and integer greater than A, and where a sub-block is defined by the location of two boundaries placed by the parser at two different window locations, where A and B vary as a function of an attribute of the block of data being parsed.

8680461

11919323

1. A continuous sampling analysis method comprising: providing gas-phase samples to an analysis component configured as a mass spectrometer; configuring processing circuitry of the analysis component to acquire data according to a first analysis component parameter set; using the analysis component configured to acquire data according to the first analysis component parameter set, analyzing an earlier sample to acquire a first data set including analyte ion abundance; using the processing circuitry, processing the first data set to prepare a second analysis component parameter set, the processing comprising comparing the analyte ion abundance of the first data set to a predefined threshold analyte ion abundance and determining a difference between the analyte ion abundance of the first data set and the predefined threshold; configuring the processing circuitry of the analysis component to acquire data according to the second analysis component parameter set, the second analysis component parameter set being different from the first analysis component parameter set; and using the analysis component configured to acquire data according to the second analysis component parameter set, analyzing a later sample to acquire a second data set including analyte ion abundance.

8131684

13052856

1. A tangible computer-readable medium, storing instructions executed by a computer system to implement a method for indexing data, the instructions comprising: instructions for receiving input from a user defining a classification; instructions for receiving input from the user defining an analytic for the classification; instructions for determining a definition of relevance parameters that characterize the classification; instructions for populating a cortex of data in a tangible computer readable database, the cortex of data being populated based on the classification of the data to be indexed; instructions for determining, using a processor based machine learning engine, relevant data from the cortex of data based on the definition of relevance parameters, the relevant data being data which is determined to be relevant to the classification defined by the user; instructions for analyzing the relevant data from the cortex of data based on the relevance parameters to determine attributes in the relevant data; instructions for generating an index of the attributes from the relevant data based on the analyzing of the relevant data; instructions for storing the index in the cortex; and instructions for receiving a query from an analytics tool, the query specifying the classification and an analytics measure, wherein the index is used by the analytics tool to provide results for the query using the analytics measure as applied to the data in the relevant data indexed in the classification.

8849785

12688006

1. A computer-implemented method comprising: obtaining search results that are identified as responsive to an original search query; determining a frequency with which a particular term occurs in text associated with one or more of the search results; determining a frequency with which the particular term occurs in other text; determining that the frequency with which the particular term occurs in the text associated with the one or more search results differs, by a threshold extent, from the frequency with which the particular term occurs in the other text; in response to determining that the frequency with which the particular term occurs in a text associated with the one or more search results differs, by the threshold extent, from the frequency with which the term occurs in the other text, providing, for display, a representation of the particular term, a demote control to specify that the search results for the reformulated search query that include the particular term are to be demoted, and a promote control to specify that the search results for the formulated search query that include the particular term are to be promoted; receiving data indicative of a selection of the demote control or the promote control; and in response to receiving the data indicative of the selection of the demote control or the promote control, reformulating the original search query to promote or demote the particular term.

20180146880

15822652

1. A computer-implemented method for quantifying liver function in a patient, the method executed by one or more processors programmed to perform the method, the method comprising: obtaining, at one or more processors, one or more three-dimensional (3-D) images of a patient's liver, the one or more 3-D images collected using magnetic resonance imaging (MRI), positron emission tomography (PET), or single-photon emission computed tomography (SPECT); for each of the one or more 3-D images: analyzing, by the one or more processors, the 3-D image to identify a plurality of contrast concentration parameters collected over time; generating, by the one or more processors, a linear liver pharmacokinetic model using the plurality of contrast concentration parameters collected over time; calculating, by the one or more processors, a contrast uptake rate metric for liver cells and a fractional distribution volume for blood based on the linear liver pharmacokinetic model, wherein the contrast uptake rate metric is indicative of liver function in the patient; and displaying, by the one or more processors, an indication of the contrast uptake rate metric to provide an assessment of the liver function in the patient to a healthcare professional.

20130019221

13622313

1. A method of optimizing of a library for use in circuit design comprising: providing an initial circuit netlist; providing one or more sets of existing cells; providing one or more sets of additionally admissible cells, which are additional to the one or more sets of existing cells; using at least one computer processor, remapping the initial circuit netlist to find cells that reduce implementation costs considering the initially existing set of cells and the additional set of admissible cells to obtain a remapped netlist; and outputting the remapped netlist and one or more new cell library specifications and descriptions, wherein the one or more new cell library specifications and descriptions further comprises a subset of the preexisting cells and a subset of the admissible cells which potentially reduce design costs.

9955662

15448627

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

20100306854

12497354

1. A method for obfuscating data, the method including: reading values occurring in one or more fields of multiple records from a data source; storing a key value; for each of multiple of the records, generating an obfuscated value to replace an original value in a given field of the record using the key value such that the obfuscated value depends on the key value and is deterministically related to the original value; and storing the collection of obfuscated data including records that include obfuscated values in a data storage system.

20170293725

15455591

1. A computer-implemented method for predicting answers to questions concerning medical image analytics reports, the method comprising: splitting a medical image analytics report into a plurality of sentences; generating a plurality of sentence embedding vectors by applying a natural language processing framework to the plurality of sentences; receiving a question related to subject matter included in the medical image analytics report; generating a question embedding vector by applying the natural language processing framework to the question; identifying a subset of the sentence embedding vectors most similar to the question embedding vector by applying a similarity matching process to the sentence embedding vectors and the question embedding vector; and using a trained recurrent neural network (RNN) to determine a predicted answer to the question based on the subset of the sentence embedding vectors.

9336271

12901897

1. A method of optimizing a query, comprising: determining a cost estimate for a query; determining a budget for optimizing the query based on the cost estimate; determining a normalized complexity of the query; determining a strategy based on the normalized complexity and the budget, wherein the strategy specifies a limit to a search space enumerated during optimization of the query; and optimizing the query based on the strategy.

20080281809

11803019

1. A method of analyzing search behavior, comprising: storing data associated with a search and use of a plurality of search results; identifying one or more of the plurality of search results as a session of related search results; calculating one or more relevance factors for each search result included in the session of search results; and providing a relevance classification for each search result included in the session of search results based on a relevance of each search result to a search query that was used to locate each search result.

20140169682

14188413

1. A method, comprising: a computer system identifying one or more distortion categories for one or more image frames, wherein the identifying is based on distorted image statistics for the one or more image frames; and the computer system determining a quality of the one or more image frames based on the identified one or more distortion categories; wherein reference image frames for the one or more image frames are not available to the computer system in performing the identifying and the determining.

20110087622

12972407

1. A method for selecting among a plurality of alternatives comprising the steps of: selecting a plurality of assumptions; selecting a plurality of attributes that relate to a user's objectives; selecting a relative importance for each of said plurality of attributes; selecting a plurality of tradeoff values that rank an importance of one of said plurality of attributes with respect to another one of said plurality of attributes; automatically calculating a user's priorities based on said relative importance for each of said plurality of attributes and said series of tradeoff values; automatically calculating an expected chance of success for a plurality of scenarios based on a combination of at least two of said plurality of attributes and at least one of said plurality of assumptions; automatically calculating a satisfaction score for a plurality of scenarios based on the user's calculated priorities and a combination of at least two of said plurality of attributes; and presenting at least one scenario from the plurality of scenarios with an expected chance of success that is greater than a predetermined minimum success value and that has the highest calculated satisfaction score as compared to the satisfaction score of the other of said plurality of scenarios.

20040068626

10264165

1. A method comprising: receiving a location of a source node and a location of a sink node; and in response to receiving the location of the source node and the location of the sink node, generating a minimum-delay routing path from the source node to the sink node, wherein the minimum-delay routing path contains buffers and synchronization elements.

20130094755

13705237

1. A method for microscopic three-dimensional imaging of a sample in which image information from different depth planes of the sample is acquired and is stored in a spatially resolved manner so as to be correlated to its spatial coordinates X, Y, Z, and in which the three-dimensional image of the sample is reconstructed electronically from the stored image information, comprising the steps of: obtaining a three-dimensional image of a sample comprising a fluorescing substance or of a sample to which a fluorescing substance is added by selective plane illumination microscopy; illuminating the sample by an excitation beam which is shaped as a light sheet; obtaining an image information of the sample based on the emission radiation coming from the sample; positioning at least one reference object comprising a fluorescing substance or a reference object having a fluorescing substance next to or in the sample; acquiring the detection direction from which the image information; changing the detection direction relative to the sample and relative to the reference object; acquiring image information from the reference object from each detection direction given by a change; storing the image information from the reference object from each detection direction given by a change in a spatially resolved manner in spatial coordinates X, Y, Z; acquiring image information from different depth planes of the sample from each detection direction given by a change; storing the image information from different depth planes in a spatially resolved manner in spatial coordinates X, Y, Z; obtaining transformation operators for translation, rotation and deformation based on the spatial coordinates X, Y, Z of the stored image information from the reference object so that image information from the same source from the different detection directions can be overlapped; reconstructing the three-dimensional image of the sample from the spatial coordinates X, Y, Z of the image information obtained from the sample based on these transformation operators.

9385845

13449249

1. A computer-implemented method of distributing a value within a distributed computing system having a master system in communication with a plurality of worker systems, comprising: assigning partitions of a graph to the worker systems, the graph representing relationships among a set of tangible items that model a real-world condition having an associated problem; determining configuration information describing a configuration of the distributed computing system; selecting a distribution scheme, from among a plurality of distribution schemes, for distributing a value from the master system to the plurality of worker systems based on the configuration information, each of the plurality of distribution schemes defining a different hierarchal arrangement for distributing the value from the master system to the plurality of worker systems; and distributing the value from the master system to the worker systems according to the selected distribution scheme, wherein the worker systems are configured to use the value to produce an output representing a solution to the real-world problem, wherein the plurality of distribution schemes comprise a first distribution scheme where the worker systems receive the value directly from the master system and a second distribution scheme that organizes the worker systems into at least a first subset and second subset of worker systems, where the first subset of the worker systems receive the value directly from the master system and the second subset of the worker systems receive the value indirectly from the master system via the first subset of the worker systems.

10021608

15329461

1. A method in a radio network node for determining whether a wireless device is a suitable candidate for handover to a target cell for load balancing reasons, the radio network node serving a source cell to which the wireless device is connected, the method comprising: determining a first level of coverage of the target cell based on a first measurement report; storing measurement data obtained from a second measurement generated by the wireless device, which second measurement relates to the source cell, and which second measurement is at least one of a layer 2 measurement and a layer 1 measurement; establishing a correlation between the determined first level of coverage of the target cell and the stored measurement data; updating statistical data based on the established correlation; and determining whether the wireless device is a suitable candidate for handover to the target cell for load balancing reasons based on: the updated statistical data; and measurement data obtained from a third measurement, which third measurement relates to the source cell and to the wireless device, and which third measurement is at least one of a layer 2 measurement and a layer 1 measurement.

20170167742

15374552

1. A thermostat management server comprising: one or more processors; and one or more memory devices comprising instructions that, when executed by the one or more processors, cause the one or more processors to perform operations comprising: receiving, from a plurality of thermostats, information that characterizes energy usage associated with the plurality of thermostats; receiving, from a utility provider computer system, parameters characterizing proposed future demand-response events; selecting a combination of thermostats from the plurality of thermostats for which the energy usage can be reduced; simulating a demand response event based on the parameters and using different weather conditions for the combination of the plurality of thermostats; generating statistical probabilities of meeting a plurality of capacity reduction levels based on the different weather conditions; selecting a capacity reduction level from the plurality of capacity reduction levels based on the statistical probabilities; and sending the capacity reduction level to the utility provider computer system.

20030100970

09995645

1. A method of monitoring apparatuses of manufacturing integrated circuit (IC), while a plurality of lots of wafers are processed by a plurality of apparatuses, used for monitoring a plurality of apparatus events, the method of monitoring apparatuses of manufacturing IC comprising: providing a database with a plurality of data of the apparatus events; downloading the data of the apparatus events from the database; calculating a plurality of achievement indices by using the data of the apparatus events; establishing a control chart by using the achievement indices; establishing a knowledge archive of rules by using the data of the apparatus events, the achievement indices, and the control chart, and determining a plurality of limitative rules to detect an abnormal point; forming a calendar file by sorting the data of the apparatus events with time; and executing a step of replaying the apparatus events so as to proceed a rectification.

20080071595

11944617

1. A system for business performance management (BPM) of a business unit defined by business processes, comprising: one or more tokens, each of which represents a business event from one of said business processes; a BPM loop comprising a plurality of nodes, said plurality of nodes including at least a sensing node for receipt via said tokens of event data corresponding to said business event and an execution node for sending action data to a business unit for implementation in response to said business event; one or more policies which govern transformation by said nodes of said event data into said action data, wherein each of said tokens is passed sequentially from node to node in a particular order around said BPM loop, beginning with said sensing node and ending with said execution node, application of a policy at a node being triggered by said token, each said node further comprising a data acquisition element for acquiring data from another node, a data processing element for transforming data in accordance with one of said policies, and a data output element for transmitting data to another node, wherein said event data is received by said sensing node in real time, said policies transform said event data in real time, and said action data is sent to said business unit in real time, and wherein said policies may be adapted dynamically, including removal or addition of nodes in said plurality of nodes, responsive to changes in said business process or a monitoring and control objective related thereto.

8874610

13311586

1. A method for identifying stability exceptions in a data log comprising: determining at least one key that is present in the data log, wherein the data log is comprised of at least one data set, at least one of which includes a corresponding plurality of iterations indicating binary transition states of the corresponding data set at different points in time, and wherein each key of the at least one key denotes a different, respective data item in the data log; for each data set of the at least one data set and for each key of the at least one key, generating a map indicating, for each iteration of the corresponding data set, whether the corresponding key is present in the corresponding iteration; determining adherence, by a processor, of at least one expression pattern rule that models data item stability characteristics over data set iterations to the map generated for each data set and for each key to determine whether the corresponding map satisfies the at least one expression pattern rule; and identifying at least one key exception as at least one unstable data item, respectively, in the data log based on the determining adherence.

20170091591

15279835

1. An eye tracking system comprising: a video capture component configured to provide a video of an environment and a set of gaze tracking coordinates representing, for each of a plurality of frames comprising the video, a position within the environment at which a user is looking; a library, configured to store a plurality of feature sets representing respective areas of interest, with each area of interest including an object label representing an object of interest within the environment; an image annotation component configured to extract a plurality of features from a region of interest, defined around the gaze coordinates for a given frame, and match the extracted features to an area of interest in the library to produce a selected area of interest and a confidence value; and a verification component configured to accept the selected area of interest if the confidence value meets a threshold value and send the region of interest to a human expert at a user interface to assign an object label to the region of interest if the confidence value does not meet the threshold value; wherein the library is dynamically updated in response to input from the human expert to add new areas of interest and new object labels to the library.

20120203056

13376559

1. An apparatus comprising: a cannula having a shape closely matched to the anatomy of the right ventricle of the human heart, wherein the cannula has an outflow port configured to be located proximal the pulmonary artery (PA) and an inflow port located proximal the inferior vena cava ( 1 VC).

20100299380

12446223

1. A digital signal processor for interpolating a gain to be applied to a digital signal, the process including: first memory means for storing a target gain coefficient; second memory means for storing a current gain coefficient; response determining means for determining an output gain coefficient based on the target gain coefficient and the current gain coefficient; means for storing the output gain coefficient in the second memory means in place of the current gain coefficient, to be used as the current gain coefficient in subsequent operations.

20150269740

14661524

1. A method comprising the steps of: obtaining one or more images; estimating a foreground region of interest from the one or more images; determining a plurality of segments of the foreground region of interest; calculating amplitude statistics for respective ones of the plurality of segments; classifying respective segments as being respective portions of static foreground objects or as being respective portions of dynamic foreground objects based at least in part on the calculated amplitude statistics and one or more defined patterns for known static and dynamic objects; and removing one or more segments classified as static foreground objects from the foreground region of interest; wherein the steps are implemented in an image processor comprising a processor coupled to a memory.

8958328

13610108

1. A method, comprising: receiving at a terminal of a satellite communication system a load balancing table transmitted over a home carrier; selecting one of a plurality of system segments in accordance with load information included in said received load balancing table, wherein the selecting is performed independently and without knowledge of segment selections made by other terminals in the satellite communication system, and without transmitting a load balancing request to a hub of said satellite communication system; selecting a bandwidth manager from one or more bandwidth managers included in the selected system segment; extracting from the load balancing table one or more descriptors corresponding to a forward channel corresponding to the selected system segment; tuning to the forward channel of the selected segment using the extracted descriptors; sending from the terminal a logon request to the hub; and selecting a traffic processing server from one or more traffic processing servers included in the selected system segment.

8086556

12605754

1. A computerized method of evaluating a reliability of using ambiguous input geographic data to generate a geocoded bounding object, the method comprising: selecting a first plurality of n different types of locate test to be used to convert the ambiguous input geographic data into a bounded object output having latitude and longitude information; retrieving a known certainty value (l−u) associated with each test in the selected first plurality of n different types of locate tests, wherein each test comprises a unique uncertainty value u; defining a weighting constant (w) for each test in said selected first plurality of n different types of locate tests, the weighting constant within a range of 0.0 to 1.0; and generating an apposite bounding surface defining the reliability of the bounded object output with respect to the ambiguous input geographic data, the apposite bounding surface defined as the combination of all matches from the plurality of n different types of locate tests.

20080033703

11834716

1. A structural optimization system comprising: a part for changing computer-aided design model which receives a computer-aided design model and a design variable and changes the computer-aided design model according to the design variable and outputs it; a part of calculation which receives a computer-aided design model from the part for changing computer-aided design model and calculates a natural vibration mode and a natural frequency and outputs them; a part for making natural vibration mode image which receives a natural vibration mode from the part of calculation and makes a natural vibration mode image as a visualized form of the natural vibration mode and outputs it; a part of binarization which receives a natural vibration mode image from the part for making natural vibration mode image and binarizes the natural vibration mode image by a threshold value and outputs a binary image; a part for extracting pattern information which receives a binary image from the part of binarization and extracts pattern information from the binary image and outputs it together with the binary image; a part for distinguishing natural vibration mode which receives a binary image from the part of binarization and pattern information from the part for extracting pattern information and distinguishes the natural vibration mode to be tracked from natural vibration modes after computer-aided design model change using the pattern information and outputs it; and a part for calculating optimum solution which receives a natural vibration mode from the part for distinguishing natural vibration mode and finds a design variable which makes the natural frequency of the natural vibration mode a target value and outputs it.

8479149

12234185

1. A computer-implemented method, comprising: receiving one or more viewing concepts of a software system; identifying one or more viewing instances comprising one or more concept instances or descendants of the one or more concept instances, the one or more concept instances or descendants of the one or more concept instances associated with at least one of the one or more viewing concepts or one or more sub-concepts of the one or more viewing concepts; and assigning layer indices to the one or more viewing instances based on one or more associated viewing instances relationships for use in generating a visualization of the one or more viewing instances and/or the one or more viewing instances relationships, the visualization generated for rendering on an output device in communication with a computer, wherein at least one of the one or more viewing instances relationships are inbound uses relationships; wherein the assigning layer indices to the one or more viewing instances comprises: a) initializing a current layer index value; b) selecting at least one unindexed viewing instance having no inbound uses relationships associated with at least one other unindexed viewing instance, wherein the selecting the at least one unindexed viewing instance comprises removing a cycle condition if respective of unindexed viewing instances have at least one inbound uses relationship associated with at least one other unindexed viewing instance; and c) assigning the current layer index value to the selected at least one unindexed viewing instance; wherein the removing the cycle condition comprises iteratively selecting at least one viewing instances uses relationship associated with at least one unindexed viewing instance until at least one unindexed viewing instance has no inbound uses associated with at least one other unindexed viewing instance based on viewing instances uses relationships associated with unindexed viewing instances minus the at least one selected viewing instances uses relationship or until viewing uses instances relationships with unindexed viewing instances have been selected at least once.

7814139

11923608

1. A method of processing data at a host computer, comprising: receiving a data file at the host computer containing records of a plurality of HTTP (HyperText Transfer Protocol) transactions of a plurality of users, each of the HTTP transactions including at least one URL (Uniform Resource Locator); converting the data file into a common file format at the host computer; cleansing the data file in the common file format at the host computer by applying a plurality of URL rules to remove session identifiers while accounting for the use of proxies, thereby producing a cleansed data file containing at least one modified URL; performing a panel selection process at the host computer, comprising: conducting a periodic survey of a subset of Internet users to determine characteristics of an Internet community that includes the subset of Internet users, the characteristics including demographic characteristics; selecting a panel of users from the subset of Internet users, the panel of users having a targeted combination of the demographic characteristics; retaining the data file only when it contains a user identifier of a user in the panel of users; performing a transformation process, comprising: removing from the data file those URLs that do not contain the user identifier; determining which URLs in the data file belong to a session of the user in the panel of users; assigning a session identifier to the session; creating a plurality of session data files, each of which contain the user identifier, a time stamp, the URLs in the data file that belong to the session, and the session identifier; decomposing the URLs in each of the plurality of session data files so that the URLs in each of the plurality of session data files are decomposed URLs; and hashing the decomposed URLs so that the decomposed URLs are hashed, decomposed URLs; calculating a metric of user behavior at the host computer based upon the hashed, decomposed URLs; merging the metric of user behavior into a file containing a plurality of metrics of online user behavior at the host computer; and transmitting from the host computer to a remote machine the file containing the plurality of metrics of online user behavior, wherein the file containing the plurality of metrics of online user behavior enables a third party to forecast offline demand for a good or service based on the plurality of metrics of online user behavior.

8956858

13827585

1. A tactical and portable PCR and HRM genetic analysis and identification system comprising: a PCR/HRM module encompassed within an enclosure, wherein said PCR/HRM module is structured and configured to perform PCR amplification and an HRM analysis on unknown DNA samples in the field; a computer readable medium having a bioforensics program code stored thereon and a computer processor encompassed within the enclosure, wherein said computer processor is interconnected to said PCR/HRM module, said computer processor is programmed by said bioforensics program to: compare the results of the PCR amplification and an HRM analysis on at least one unknown DNA sample by the PCR/HRM module to known control DNA samples, assign a probability of a match to one of the known control DNA samples, and assign a confidence level to the DNA sample based on the probability of a match to the known control DNA.

20170060943

15252306

1. A method for optimizing an area of a ternary FPRM circuit using population migration algorithm, the method comprising: 1) establishing an area estimation model of the ternary FPRM circuit, wherein 1.1) the ternary FPRM circuit is expressed by a ternary FPRM logic function expression as follows: f p ( x n - 1 , x n - 2 , … , x 0 ) = ⊕ ∑ i = 0 3 n - 1 a i * ∏ j = 0 n - 1 x. j i j ( 1 ) where n is the number of variables of the function ƒ p (x n-1 , x n-2 ,. .. , x 0 ), x n-1 , x n-2 ,. .. , x 0 denotes the n input variables of the function ƒ p (x n-1 , x n-2 ,. .. , x 0 ), p denotes a polarity of the function ƒ p (x n-1 , x n-2 ,. .. , x 0 ), the polarity p is expressed in ternary form as p n-1 p n-2. .. p 0 , p j ε{0, 1, 2}, j=0, 1, 2,. .. , n−1, ⊖ represents a modulo-3 addition operation, Σ is a summation sign, the symbol “*” represents multiplication, subscript i=0, 1, 2,. .. , 3 n −1, i is expressed in ternary form as i n-1 i n-2. .. i 0 , a i is a coefficient of FPRM expansion, a i ε{0, 1, 2}; Π represents a modulo-3 multiplication operation, ∏ j = 0 n - 1 x. j i j has its expansion as follow: ∏ j = 0 n - 1 x. j i j = x. n - 1 i n - 1 x. n - 2 i n - 2 … x. 0 i 0 , where i j ε{0, 1, 2}, {dot over (x)} j =(x j ⊖p j ), {dot over (x)} j 0 =1={dot over (x)} j 1 ={dot over (x)} j , {dot over (x)} j 2 *{dot over (x)} j , polarity p and subscript i determine the representation of the variable {dot over (x)} j ; 1.2) the ternary FPRM logic function under polarity p is composed of two types of multi-input operations which are a multi-input modulo-3 addition operation and a multi-input modulo-3 multiplication operation respectively; based on expansion of a ternary FPRM logic function, the ternary FPRM logic function is decomposed into several multi-input modulo-3 addition operations and several multi-input modulo-3 multiplication operations, then each multi-input operation is individually decomposed into 2-input operations, to obtain 2-input modulo-3 addition operations and 2-input modulo-3 multiplication operations; wherein, the decomposition process is as follows: a 1st and a 2nd input variables of a multi-input operation are taken as two input variables of a first 2-input operation, to obtain an output variable of the first 2-input operation; the output variable of the first 2-input operation and the 3rd input variable of the multi-input operation are taken as two input variables of a second 2-input operation, to obtain an output variable of the second 2-input operation; the output variable of the second 2-input operation and the 4th input variable of the multi-input operation are taken as two input variables of a third 2-input operation, to obtain an output variable of the third 2-input operation; and so forth, till all the input variables of the multi-input operation have been taken as an input variable of a 2-input operation, thereby accomplishing the decomposition of the multi-input operation; the ternary FPRM logic function under polarity p is decomposed into several multi-input modulo-3 addition operations (also referred to as multi-input modulo-3 addition gates) and several multi-input modulo-3 multiplication operations (also referred to as multi-input modulo-3 multiplication gates), then represent N to denote the number of the multi-input modulo-3 addition gates resulted from the decomposition of the ternary FPRM logic function under polarity p, and represent W to denote the number of the multi-input modulo-3 multiplication gates resulted from the decomposition of the ternary FPRM logic function under polarity p; each multi-input modulo-3 addition operation is decomposed into several 2-input modulo-3 addition operations (also referred to as 2-input modulo-3 addition gates), and each multi-input modulo-3 multiplication operation is decomposed into several 2-input modulo-3 multiplication operations (also referred to as 2-input modulo-3 multiplication gates); the number of the 2-input modulo-3 addition gates resulted from the decomposition of the hth multi-input modulo-3 addition gate is denoted as No h ._of_Mod 3−A P , h=1, 2,. .. , N; the number of the 2-input modulo-3 multiplication gates resulted from the decomposition of the wth multi-input modulo-3 multiplication gate is denoted as No w ._of_Mod 3−M p , w=1, 2,. .. , W; represent S = ∑ h = 1 N No h. _of _Mod3 - A p + ∑ w = 1 W No w. _of _Mod3 - M p be an area estimation model of the ternary FPRM circuit, where S represents the area; ∑ h = 1 N No h. _of _Mod3 - A p represents the total number of 2-input modulo-3 addition gates resulted from the decomposition of the ternary FPRM logic function under polarity p; ∑ w = 1 W No w. _of _Mod3 - M p represents the total number of 2-input modulo-3 multiplication gates resulted from the decomposition of the ternary FPRM logic function under polarity p; 2) establishing a corresponding relationship between the ternary FPRM circuit and population migration algorithm: population migration algorithm includes the following key factors: population location, attraction of population location, the greatest attractive site, the greatest attraction, ground space of population mobility, concession region, population mobility, population migration and population disperse; the area optimization of the ternary FPRM circuit includes the following key factors: polarity, area size corresponding to polarity, optimal polarity, minimum area, optional polarity space, the zone where the optimal polarity exists, polarity jump to the zone where the optimal polarity exists and jump out of the local optimal polarity; the population location is mapped to area optimization of the ternary FPRM circuit, and represented as polarity; the attraction of the population location is mapped to area optimization of the ternary FPRM circuit, and represented as the area size corresponding to the polarity; the greatest attractive site is mapped to area optimization of the ternary FPRM circuit, and represented as the optimal polarity; the greatest attraction is mapped to area optimization of the ternary FPRM circuit, and represented as the minimum area; the ground space of population mobility is mapped to area optimization of the ternary FPRM circuit, and represented as an optional polarity space; the concession region is mapped to area optimization of the ternary FPRM circuit, and represented as the zone where the optimal polarity exists; the population mobility is mapped to area optimization of the ternary FPRM circuit, and represented as polarity transition; the population migration is mapped to area optimization of the ternary FPRM circuit, and represented as polarity jump to the zone where the optimal polarity exists; the population disperse is mapped to area optimization of the ternary FPRM circuit, and represented as polarity jump out of the local optimal polarity; 3) setting an attraction function for calculating the attraction of the population location in population migration algorithm: according to the area estimation model, an attraction function for calculating the attraction of the population location in population migration algorithm is set as follows: in population migration algorithm, greater attraction indicates higher economic level of the population location, whereas the area-optimal polarity requires the area to be as small as possible, and therefore, in order to combine both conditions, the reciprocal of the area is employed to represent the attraction, and the attraction function is obtained as follows: attraction = ( 1 / S ) * α = ( 1 / ( ∑ h = 1 N No h. _of _Mod3 - A p + ∑ w = 1 W No w. _of _Mod3 - M p ) ) * α ( 2 ) where the symbol “/” denotes a division operation, and attraction represents attraction value, greater attraction value indicates better area optimization effect of the circuit; α is a magnification coefficient, its value is equal to a natural number greater than 1000; 4) setting relevant parameters of population migration algorithm, wherein population migration algorithm has five parameters to be set: population scale s, the number of population mobility times 1, population pressure parameter q, shrinkage factor c, and the number of population disperse times z; represent the population scale s be equal to the number of input variables of the ternary FPRM logic function, i.e., s=n; the number of population mobility times 1 is the radius of the region where the population exists, and the radius where the population exists is denoted as Δt, l=Δt, Δt=3 s /s 2 ; the population pressure parameter q is Δt/10; the shrinkage factor c=0.3; when the ternary FPRM circuit is a small-scale circuit, the number of population disperse times z=15, and when the ternary FPRM circuit is a large-scale circuit, the number of population disperse times z=2; and 5) employing population migration algorithm to calculate and obtain the greatest attractive site and the greatest attraction, wherein the greatest attractive site is the optimal polarity of the ternary FPRM circuit, and the greatest attraction is the minimum area of the ternary FPRM circuit.

8386450

10807871

1. A method of optimizing execution of a query that accesses data stored on a data store connected to a computer, comprising: using statistics on one or more expressions of one or more pre-defined queries to determine an optimal query execution plan for the query; and executing the optimal query execution plan for the query in order to access the data stored on the data store connected to a computer and then output the accessed data.

8768872

13868762

1. A method comprising: determining a plurality of constraint compliant values; determining that a candidate solution, which was created from two or more of a plurality of candidate solutions via a crossover operation, fails to comply with a constraint condition for an optimization problem, wherein the two or more of the plurality of candidate solutions comply with the constraint condition; and assigning a value from the plurality of constraint compliant values to a constrained variable of the candidate solution in response to the determining that the candidate solution fails to comply with the constraint condition, wherein the value assigned from the plurality of constraint compliant values is randomly selected from the plurality of constraint compliant values, and wherein the at least one constrained variable is constrained to comply with the constraint condition.

20090172017

11967673

1. A machine-implemented method, comprising: identifying multiple datasets associated with one or more relational databases; normalizing data associated with each of the multiple datasets to produce a single normalized dataset; and applying a multiplicative regression analysis algorithm to the normalized data in the single normalized dataset to produce a demand model that incorporates the multiple datasets.

8687791

11361320

1. A method for routing an agent to a preferred communications platform, comprising: accessing a working environment via a domain name server (DNS) by an agent; accessing a server comprising a routing capability via the DNS; performing, by the routing capability, at least one of: password validation, agent ID lookup, and project ID lookup; based on the performing, validating, by the routing capability, a schedule of work for the agent with a home agent database; performing, by the routing capability, a preferred environment lookup with the home agent database, wherein the preferred environment lookup comprises selecting a preferred environment based on a site value, a project identification value, a project load value, and an attribute value of the agent, and the site value takes precedent over the project identification value which takes precedent over the project load value which takes precedent over the attribute value of the agent; and routing the agent to the preferred environment.

20060248521

11311423

1. A method, comprising processing source data using a target application and using a modified compiler library, the source data being migrated from a source system to a target system and being encoded in a source encoding, the source data having one or more portions encoded in the source encoding based on data type, the target application being a source application migrated to the target system, the modified compiler library being configured to convert at least one portion of the source data into an encoding that can be manipulated by the target application.

8812506

13156330

1. A method for constructing a search database using an ontology, the method comprising: via at least one processor: obtaining a list of items, each item corresponding to a potential search result; obtaining a list of terms from an ontology that describes all of the items, each term being an attribute of a corresponding item; dividing the terms into user-selectable search queries and non-selectable terms; activating the items and the terms as nodes in a network, wherein: the nodes are connected based on semantic relationships specified by the ontology, the network has three layers, a first layer including a node for each of the items, a second layer including a node for each search query, and a third layer including a node for each non-selectable term, the second layer nodes correspond to user-observed states of their respective terms, and the third layer nodes correspond to hidden states of the terms represented in the second layer; and configuring the network such that a probability of nodes in the first layer is determined by updating states of nodes in the third layer: deterministically based on the semantic relationships, and probabilistically based on at least one of (ii) frequency information indicating a frequency with which a term of a node in the third layer is known to occur when an associated item of a node in the first layer also occurs and (ii) a predefined false positive or false negative rate.

7592997

11142718

1. A method for determining a position of a user and a position of a moving device for augmented reality applications, the method comprising: using a tracking method and at least one different tracking method, or at least one tracking method and at least one movement model, simultaneously, to determine the position or positions; integrating data from the tracking method and at least one different tracking method, or from the at least one tracking method and at least one movement model via an interface; interacting between the tracking method and at least one different tracking method, or the at least one tracking method and at least one movement model by a configuration unit; and calculating the position of the user and the moving device by at least one processing unit based on data provided by the tracking method and at least one different tracking method, or the at least one tracking method and at least one movement model.