Datasets:

patent

/

AIPD_evo_claim_one

like 0

20050209767

10802151

1. A method of analyzing a turbine engine to determine a normal engine condition or a faulty engine condition, said method comprising the steps of: acquiring at least one engine operating parameter; calculating at least one engine residual value from said at least one engine operating parameter; normalizing said at least one engine residual value to yield at least one normalized engine residual; mapping, via a clustering technique, said at least one normalized engine residual as at least one input vector into an engine condition space having a plurality of clusters, each of said plurality of clusters representing either a normal vector engine condition or a faulty vector engine condition; identifying a closest cluster within said engine condition space, said closest cluster being closer to said at least one input vector than any other of said plurality of clusters; and determining a normal engine condition for the engine undergoing analysis if said closest cluster represents a normal vector engine condition, and determining a faulty engine condition for the engine undergoing analysis if said closest cluster represents a faulty vector engine condition.

RE43154

12057768

1. A method for systematically monitoring and recording performance parameters for a computer system, comprising: periodically measuring values for a set of performance parameters associated with the computer system while the computer system continues operating, wherein the set of performance parameters can include: internal performance parameters maintained by software within the computer system, physical performance parameters measured through sensors located in proximity to the computer system, and canary performance parameters associated with synthetic user transactions periodically generated for performance measuring purposes; recording the values on a data storage device; wherein the recording process keeps track of temporal relationships between events in different performance parameters; and subsequently allowing the recorded values for the set of performance parameters to be analyzed.

20160171152

14983128

1. (canceled)

20080232829

11737443

1. An adaptive consumables level gauge for an imaging machine, comprising: a display that visualizes remaining levels of consumables on a gauge; a consumables gauge circuit that receives at least one distinguishable usage indicator serving as a reference to approximate consumable dispense rate of a consumable product and estimates the level of the gauge based on the at least one distinguishable usage indicator and at least one predefined calibration constant; and a feedback control circuit that obtains a correction factor based on a cumulative usage indicator value at the time of actual consumables replacement to be used in subsequent determination of consumables level gauge estimates.

20130041925

13206960

1. A computer-implemented method for migrating business process content, the method comprising: identifying a rule set associated with at least one process binary, the at least one process binary comprising a compiled business process model for runtime execution; identifying at least one deployed process binary associated with the identified rule set; and modifying a portion of the at least one retrieved deployed process binary based on the identified rule set.

9324191

14122143

1. A method for constructing an image model of an object from at least one image data input, the method comprising the steps of: extracting at least one state comprising a configuration of object features, the features being represented by a set of values of the at least one image data input, and a state comprising a configuration of object features, the features being represented by a set of values of an intermediate learning model; determining a target state by performing a weighted combination of the at least one state of the at least one image data input, and of the state of the intermediate learning model, with the weights reflecting confidences of the states, the confidences being determined during the state extraction; performing at least one image transformation by using the determined target state on the at least one image data input, thereby generating at least one transformed image; aggregating the at least one transformed image with intermediate learning model information into a single two-dimensional or three-dimensional image, thereby generating an updated estimate of the image model; providing the updated estimate of the image model as the image model to an output while also providing the updated estimate of the image model in a feedback loop to a model object learning module for deriving an update of the intermediate learning model; and repeating the previous steps in an iterative process.

20050091199

10692166

1. A method for creating a query for a database, wherein the method automatically prevents inclusion of an unnecessary table join in the query.

20130021469

13186004

1. A method in a computer system for classifying a seed by determining which of any of a group of seed structures the seed is detected to have, the computer system including a processor and a memory coupled to the processor, the method comprising: subjecting the seed to a first spectral signal; recording a first reflection of the spectral signal; causing the processor to produce a first image data of the recording; storing the first image data in the memory; causing the processor to identify one or more seed structures for the seed based on the first image data stored in the memory; wherein the seed structures include a seed coat, a root, a stem, and a leaf; causing the processor to classify the seed based on the one or more identified seed structures.

20050210255

10802981

1. A method comprising: determining randomly distributed features in an object; compressing data representing the randomly distributed features; encoding the compressed data with a signature; and creating a label that includes the object and the encoded data.

20110106455

12802064

1. A method of characterizing a solid small molecule organic material comprising subjecting the solid small molecule organic material to x-ray total scattering analysis.

20110096983

12605999

1. A method for transcribing text from an artifact to an electronic file, the method comprising: providing a computer system, wherein the computer system comprises a computer-readable storage device; receiving, at the computer system, an image of the artifact, wherein text is present on the artifact; analyzing, at the computer system, a first portion of the text; identifying, at the computer system, at a first confidence level equal to or greater than a threshold confidence level, characters representing the first portion of the text; storing, at the computer-readable storage device, the characters representing the first portion of the text; analyzing, at the computer system, a second portion of the text appearing on the artifact; identifying, at the computer system, at a second confidence level below the threshold confidence level, a plurality of candidates to represent the second portion of the text; and presenting, at the computer system, the plurality of candidates to a user for selection.

20140273902

13897719

1. A method for calibrating an I/Q receiver, comprising: receiving a first mismatch parameter indicating a mismatch between I and Q channels of the I/Q receiver; and estimating a second mismatch parameter from the first mismatch parameter using a polynomial model.

20140188780

14154236

1. A method for characterizing a set of documents, comprising: identifying a network of multilevel hierarchically related documents having direct and indirect references associated with content relationships; for each respective document, determining a set of latent topic characteristics based on an intrinsic content of the respective document and a set of latent topic characteristics based on a respective content of other documents which are directly referenced and indirectly referenced through at least one other document to the respective document; representing a set of latent topics for the respective document based on a joint probability distribution of at least the latent topic characteristics based on the intrinsic content and the respective content of other documents which are directly referenced and indirectly referenced through at least one other document to the respective document, dependent on the identified network and a random process; and storing, in a memory, the represented set of latent topics for the respective document.

9508164

14162065

1. A method of performing of an iterative reconstruction process, forming part of a method for reconstructing an image of an examined object using a spiral computed tomographic scanner, is carried out by a procedure comprising of: performing of a 2D FFT of a reconstructed image μ i,j t ; a resulting matrix M k,l t is a frequency representation of the reconstructed image μ i,j t ; performing multiplication of elements of the resulting matrix M k,l t which is obtained in a previous step of the iterative reconstruction process by corresponding elements of a matrix H k,l ; a resulting matrix A k,l t is a frequency representation of a referential image a k,l t for an image {tilde over (μ)} i,j t obtained after a back-projection operation; performing of a 2D IFFT of the matrix A k,l t obtained in a previous step of the iterative reconstruction process; a resulting matrix represents the referential image a k,l t for the image {tilde over (μ)} i,j t obtained after the back-projection operation; transforming, by a nonlinear function, of differences between corresponding pixels of a referential image a k,l t obtained as a result of a previous step of the iterative reconstruction process and pixels of the image {tilde over (μ)} i,j t obtained after the back-projection operation; a resulting matrix is a matrix b k,l t ; performing of the 2D FFT of the matrix b k,l t obtained in a previous step of the iterative reconstruction process; a resulting matrix B k,l t is a frequency representation of the matrix b k,l t ; performing multiplication of elements of the matrix B k,l t obtained in a previous step of the iterative reconstruction process by corresponding elements of a matrix H k,l ; a resulting matrix C k,l t is a frequency representation of a matrix of corrections for the reconstructed image μ i,j t ; performing of the 2D IFFT of the matrix C k,l t obtained in a previous step of the iterative reconstruction process; a resulting matrix c k,l t represents a matrix of corrections for the reconstructed image μ i,j t ; performing a correction of the reconstructed image μ i,j t ; using of a criterion of an iterative process for stopping.

8661423

12771130

1. A method for automatically identifying one or more quasi-identifier data fields in a dataset, the method comprising: identifying a program having access to the dataset, the program including one or more program statements for reading or writing a value in one or more fields in the dataset; determining a first output program statement in the program, where the first program output statement is a program statement for writing a first value into a sensitive data field in the dataset; determining, with a processor, a first set of program statements in the program, where the first set of program statements includes one or more program statements that contribute to the computation of the first value written into the sensitive data field; wherein determining the first set of program statements further comprises: comparing a number of indirect references in the program with a threshold number, and adaptively determining the first set of program statements using dynamic program analysis if the number of indirect reference is equal to or greater than the threshold; adaptively determining the first set of program statements using static program analysis if the number of indirect references is less than the threshold; and, analyzing, with the processor, the first set of program statements, and determining, based on the analysis of the first set of program statements, one or more quasi-identifier data fields associated with the sensitive data field in the dataset.

8086047

11724008

1. A method for operating a computer to analyze image evaluation data from electronic survey respondents to evaluate preferences related to two dimensional and three dimensional images, the method comprising: receiving data files, wherein said data files include designated area data, image attributes, and opinions of a plurality of survey respondents for one or more survey images in an electronic survey, wherein the designated area data corresponds to designated areas in one or more of the survey images; providing a user interface to permit an operator to reformat said designated area data and set analysis parameters; performing cluster analysis to said data files to reduce the dimensionality of said designated area data and to classify areas of the survey images that generate positive and negative responses; producing coordinate data to map cluster classifications onto the survey images; producing coordinate data for construction of a heat map of said designated area data; performing descriptive statistical analysis to said data files; identifying clusters of interest based on the designated areas; assigning a cluster score to at least one cluster of the clusters of interest, wherein the cluster score is generated based on a proportion of the plurality of survey respondents that designated at least one area of the designated areas associated with the at least one cluster; linking the opinions corresponding to the designated areas and results from said descriptive statistical analysis to said clusters of interest; and saving analysis results for processing by a viewing means.

20020052815

09737035

1. A method for automated underwriting of segmentable financial instrument assets using a portfolio valuation system, said method comprising the steps of: defining clusters of financial instruments by common attributes; receiving an expert opinion of value from selected samples of the clusters; checking values for combinations of attributes; and reconciling the values.

8135680

12429377

1. A computer implemented iterative process for generating entity representations in a computer implemented database using a record matching formula and for generating parameters for the record matching formula, each entity representation comprising at least one record, the database comprising a plurality of records, each record comprising a plurality of fields, each field capable of containing a field value, wherein at least a portion of parameters for the record matching formula are configured for a particular field value associated with a selected field, and wherein the process provides for linking records or entity representations with non-identical field values, the process comprising: applying a symmetric, reflexive and transitive function to each field value in the selected field of each of a plurality of records in the database, whereby applying the symmetric, reflexive and transitive function to each field value in the selected field of each of a plurality of records in the database defines a partition of the plurality of records, wherein the partition of the plurality of records comprises a plurality of parts, each of the parts associated with at least one field value appearing in the selected field; calculating a first logarithm of a first probability that an arbitrary record in the database is in a part associated with the particular field value, wherein the first probability comprises a ratio of records in the part associated with the particular field value to a total number of records in the database; forming a plurality of entity representations in the database, each entity representation comprising at least two records linked using a first instance of the record matching formula, at least one entity representation comprising at least two records linked using a first instance of the record matching formula that comprises the first logarithm of the first probability; calculating a second logarithm of a second probability that an arbitrary entity representation in the database comprises a record that is in the part associated with the particular field value, wherein the second probability comprises a ratio of entity representations in the part associated with the particular field value to a total number of entity representations in the database; linking at least two entity representations in the database based on a second instance of the record matching formula, wherein the second instance of the record matching formula comprises the second logarithm of the second probability, whereby a number of entity representations in the database is reduced by the linking entity representations relative to a number of entity representations in the database prior to the linking at least two entity representations; and retrieving information from at least one record in the database.

20160034314

14451420

1. A method of scheduling executions of a plurality of real-time processes, comprising: (A) during run-time scheduling the process executions, such that predetermined constraints comprising (1) deadline, (2) exclusion relations wherein each exclusion relation being defined between a selected pair of processes comprising a first process and a second process, not allowing preemption of an execution of said first process by an execution of said first process if said first process excludes said second process. will be satisfied, (B) allowing preemption of an execution of a particular first process at any point in time by an execution of a particular second process if said particular first process does not exclude said particular second process and if said preemption allows said predetermined constraints to be satisfied at run-time, (C) , computing latest start times for the uncompleted processes, such that if any one of the uncompleted processes does not start at its latest start time, then said any one of the uncompleted processes may not be able to satisfy at least one of the predetermined constraints, (D) during run-time allowing each process to overrun until the latest start time of another uncompleted process or the deadline of said each process is reached, programming the timer to interrupt a currently executing process at times which include at least one of the latest start times, (E) during run-time recomputing at least one of the latest start times, wherein the latest start time of a first process A may be increased, if the remaining computation time of a second process B has decreased due to a partial or complete execution of said second process B.

10096132

15416271

1. A feature point positioning apparatus comprising: a memory storing computer-executable instructions; and one or more processors configured to execute the computer-executable instructions such that the one or more processors are configured to, iteratively update a first form coefficient based on, a nonlinear feature extracted from an image, and a regression factor matrix obtained through training, and detect a position of the feature point of the image based on, the updated first form coefficient, and a statistical form model obtained through training.

6032144

08862459

1. A method comprising the steps of receiving a computer programming language database system query; generating at least one relational algebraic expression in response to said query by employing at least one of a collection of equivalence rules involving the multiset version of the relational algebraic theta-semijoin operator; selecting at least one of said relational algebraic expressions; and accessing said computer programming language database based on said selected expression.

20100049480

12193955

1. A method for optimal model-based multivariable balancing for distributed hydronic networks, comprising: determining a simplified mathematical model for a distributed hydronic system, wherein said simplified mathematical model is parameterized utilizing a plurality of lumped parameters that depends on a plurality of hydraulic resistances and pumped parameters; identifying said plurality of lumped parameters utilizing a plurality of available measurements and said simplified mathematical model in order to form a parameterized model; and calculating a plurality of balancing valve settings by reformulating said simplified mathematical model based on said parameterized model and by solving a mathematical optimization problem utilizing global differential information.

9354381

13591409

1. A dot pattern generation apparatus for use in a display device comprising: a memory storage device; a processor device communicatively coupled to said memory storage device and configured to calculate a spatial arrangement of a plurality of elements of a discrete pattern, the plurality of elements being arranged in a spatially discrete manner, wherein to calculate the spatial arrangement, the processor device is configured to: determine, for each of said elements, a density in an initial position given to said element from a density distribution of said elements in a region where said elements are arranged in said discrete pattern and configured to place, for each of said elements, a figure and a movement range of said figure, said figure having a size corresponding to said density and representing a region where said element repels other elements; minimize an objective function for imposing a penalty on each of a collision between said figures and a protrusion of said figure from said movement range using a position of each of said figures as a decision variable and configured to compute an optimal solution of the position of each of said figures; and output the optimal solutions of the positions of said figures as the spatial arrangement of said elements to a display device, wherein each of said elements is a dot, said discrete pattern is a dot pattern including the plurality of dots being two-dimensionally discrete, each of said figures is a circle, and a radius r i of the circle i is determined according to an inequality: r i = r 0 ⁢ a ρ > r 0 ⁢ π 2 ⁢ 3 ⁢ ρ where r 0 denotes a radius of said dot being said element, ρ denotes a filling factor of said dots in the initial positions, and a is a constant that satisfies the inequality, and wherein said display device includes a backlight unit having a light guide plate that generates a luminance distribution for said display responsive to a scatter pattern, said output solution including position coordinate data representing positional coordinates of each dot in said discrete dot pattern applied to generate the scatter pattern in the light guide plate to reduce a luminance non-uniformity for said display.

9798731

13787506

1. A method of performing delta compression of multiple chunks of data, the method comprising: from a source of chunks, generating multiple sketches to represent each chunk using a randomized process; from the generated sketches, determining a subset of similar sketches based on a probabilistic based function; and performing delta compression on the chunks of the source of chunks which are represented by the similar sketches in the determined subset, performing the delta compression including storing a given chunk from the source of chunks which are represented by the similar sketches in the determined subset and storing deltas for chunks, other than the given chunk, from the source of chunks which are represented by the similar sketches in the determined subset.

8135719

12429382

1. A computer implemented iterative process for generating entity representations in a computer implemented database using a record matching formula and for generating parameters for the record matching formula, the database comprising a plurality of records, each record comprising a plurality of fields, each field capable of containing a field value, wherein at least a portion of parameters for the record matching formula are configured for a particular field value appearing in a selected field of at least one record, the process comprising: , using the computer, a field value weight, the field value weight reflecting a first probability that an arbitrary record in the database comprises the particular field value in the selected field of the arbitrary record, wherein the first probability comprises a ratio of records in the database that include the particular field value in the selected field to a total number of records in the database; forming a plurality of entity representations in the database, each entity representation comprising at least two records linked using a first instance of the record matching formula, at least one entity representation comprising a first record comprising the particular field value, the first record linked to a second record using a first instance of the record matching formula comprising the field value weight; , using the computer, a revised field value weight, the revised field value weight reflecting a second probability that an arbitrary entity representation in the database comprises the particular field value in the selected field of a record in the arbitrary entity representation, wherein the second probability comprises a ratio of entity representations in the database that include the particular field value in the selected field to a total number of entity representations in the database; linking at least two entity representations in the database based on a second instance of the record matching formula, wherein the second instance of the record matching formula comprises the revised field value weight, whereby a number of entity representations in the database is reduced by the linking at least two entity representations relative to a number of entity representations in the database prior to the linking at least two entity representations; and retrieving information from at least one record in the database.

20140052750

13585286

1. A method of updating cached database query results in a distributed database system, wherein the distributed database system comprises a data cache platform maintaining the pre-computed database query results and a computation platform for computing the cached database query results based on data maintained in the computation platform, the method comprising: determining, by the data cache platform, probabilities of the cached database query results being outdated, wherein the determination depends on a probabilistic model and on the occurrence of asynchronous real-time events, the probabilistic model models discrepancies between the cached database query results maintained in the data cache platform and presumed actual database query results, the real-time events are indeterministic with regard to the expiration of the cached database query results and only have a probabilistic influence on the discrepancies between the cached database query results maintained in the data cache platform and presumed actual database query results, the probabilities are generally determined based on the probabilistic model and are possibly amended on the occurrence of asynchronous real-time events; automatically issuing, by the data cache platform, re-computation orders to the computation platform for updating cached database query results on the basis of the determined probabilities of the pre-computed database query results being outdated, wherein cached database query results having a higher probability of being outdated than others are ordered to be re-computed; and receiving, at the data cache platform, the updated pre-computed database query results as results of the re-computation orders.

20150063700

14268904

1. A method comprising: determining a set of bifurcation points for a character cluster; computing a plurality of scores, each score corresponding to a hypothesis in plurality of hypotheses, wherein each hypothesis in the plurality comprises a set of words generated from the character cluster, based, in part, on a subset of the bifurcation points; and selecting a hypothesis from the plurality of hypotheses based on a score associated with the selected hypothesis.

8255724

12525115

1. A method of operating a mobile device comprising: operating the mobile device in a low power mode, switching the mobile device to a high power mode, in response to an event, identifying the event as specific type of event, selecting a time period according to the identified type of event, preventing a sleep mode algorithm, which decides if the mobile device is switched to the low power mode, from executing for said time period, and executing said algorithm upon expiration of said time period, wherein the mobile device does not automatically switch to said low power mode upon expiration of said time period but instead executes the sleep mode algorithm that decides if the device enters said low power mode.

7899761

11113962

1. A system for identifying trends of fault occurrences in a manufacturing process, the system including computer-readable medium tangibly embodying computer-executable instructions for: receiving a plurality of data series and input parameters, the input parameters comprising a time step parameter, said data series including discrete data elements that identify the fault occurrences in the manufacturing process; preprocessing the plurality of data series according to the input parameters, to form binned and classified data series, where the discrete data elements in each of the data series are classified into a particular bin depending on when they occurred per the time parameter, wherein preprocessing the plurality of data series includes clustering the classified data series to iteratively arrange the data elements into clusters to provide a predetermined criteria, and wherein preprocessing the plurality of data series includes classifying the data elements that identify the fault occurrences according to frequency of occurrence, mean time to repair and/or duration of downtime and selecting the most frequently occurring fault occurrences and/or the fault occurrences resulting in the longest downtime duration; processing the binned and classified data series, the processing comprising: initializing a model for trend prediction including determining the number of known states in the model based on the data series and associating a state of the model for each class of data determined by the binned and classified data series; training the model for trend prediction of the binned and classified data series to form a trained model, said model being trained to predict trends of the data series by determining the probability of states of the data as classified and binned and the probability of transition of the data from state to state where the state probabilities are calculated for the data series by evaluating a probability in a training window, wherein training the model includes training the model to predict the frequency of occurrence, the mean time to repair and/or the downtime duration of the fault occurrences, using the model to predict frequency and/or duration of the fault occurrences during a testing period that immediately succeeds a training period of the model to identify trend predictions of the fault occurrences, and evaluating the accuracy of the trend predictions by comparing the trend predictions during the testing period with actual data obtained during the testing period; and deploying the trained model for trend prediction in the manufacturing process, the deploying comprising: outputting trend predictions that identify predictions of fault occurrences that may occur during the manufacturing process; and updating training of the model when new data is obtained during the manufacturing process.

20150378984

14318750

1. A method for augmenting a semantic model from unstructured data, the method comprising: determining, by a computer processor, a root of a first element of a semantic model; generating, by the computer processor, a search token, based at least in part on morphological rules applied to the root of the first element and a preposition added to the root of the first element; determining, by the computer processor, at least one phrase that substantially matches the search token, by applying the search token to unstructured data; and adding, by the computer processor, a predicate of the at least one phrase, to a second element of the semantic model, wherein the predicate expresses a relationship between the first element of the semantic model and the second element of the semantic model.

9530328

14568123

1. An intelligent teaching and tutoring test method implemented on a teaching and tutoring test system including a teaching and tutoring system database, a network community service database, and a plurality of remote data processing devices wherein the teaching and tutoring system database, the network community service database, and the remote data processing devices are interconnected via the Internet; wherein the teaching and tutoring system database includes a learning test server, a test analyzing server, and a learning progress server wherein the learning test server, the test analyzing server, and the learning progress server are interconnected; wherein the learning test server includes a test questions database and a test answers database; wherein the test analyzing server includes a test comparison database, a test paper file database, a test paper recognition database, and a test paper comparison database; and wherein the learning progress server includes a test score record database, a wrong answer question record database, a review test question record database, and an error-prone question record database, the method comprising the steps of: (a) allowing a learner to access the test questions database through one of the remote data processing devices; (b) allowing the learner to make an online selection of one of a curriculum test questions bank, a unit test questions bank, an item type test questions bank, a previous learning test questions bank, a previous proficiency test questions bank, an error-prone questions bank, a learning progress questions bank, a review test questions bank, and a proprietary questions bank; (c) allowing the learner to conduct a direct self-learning test through a manual selection or a random computer selection of test questions after answering an online test; (d) causing a master server to compare the learner's answers with answers in a questions bank of the test answers database, and store a test comparison file as comparison and analysis results in the test comparison database; (e) causing the master server to store a test score record of the test comparison file in the test score record database, and store a wrong answer question record of the test comparison file in the wrong answer question record database; (f) causing the master server to calculate and analyze data of wrong answer question records of a plurality of learners in the wrong answer question record database, store analysis results as an error-prone question record, and store the error-prone question record in the error-prone question record database wherein if a test score in the test score record of the test comparison file is less than a score sample level set by the master server, the wrong answer question record stored in the wrong answer question record database will be discarded; (g) causing the master server to calculate and analyze the data of the wrong answer question records in the wrong answer question record database wherein if accumulated wrong answer times of the same question exceed a predetermined standard set by the master server, the master server stores the results as a review test question record, and store the review test question record in the review test question record database; (h) causing the master server to store a test question of the wrong answer question record of the wrong answer question record database in the learning progress questions bank of the test questions database and create proprietary learning progress review test questions data for different learners; (i) causing the master server to store the test question of the review test question record of the review test question record database in the review test questions bank of the test questions database and create proprietary review test questions data for different learners; (j) causing the master server to store the test question of the error-prone question record of the error-prone question record database and create error-prone questions reference data for all learners; (k) causing the master server to randomly select the test questions in the learning progress questions bank or the review test questions bank of the test questions database, store the selected test questions in the proprietary questions bank of the test questions database, and create proprietary teaching and tutoring review test questions data for different learners; and (l) causing the master server to, through the learner's personal account having access to an external network community service database, publish the learner's test score, and upload the test comparison file on the learner's personal webpage in the external network community service database so that the learner can refer to the wrong answer question records of the test comparison file, correct and study the wrong answer questions, conduct subsequent reviews, and be capable of utilizing error-prone questions data as reference data for learning.

8954396

11558857

1. One or more tangible computer-readable storage devices having computer-readable instructions stored therein that, when executed by a computing device, cause the computing device to perform acts comprising: receiving a set of one or more constraints for Open Packaging Convention (OPC) package validation; receiving constraint grammar, the constraint grammar including application-specific limitations on OPC packages; comparing the set of one or more constraints with the constraint grammar to determine whether the set of one or more constraints conforms to the constraint grammar; receiving a package; identifying one or more parts of the package, wherein each part of the one or more parts is reachable by a chain of relationships; determining, without user interaction, whether the one or more parts and their relationships conform to the set of one or more constraints; and if any of the one or more parts or their relationships do not conform to the set of one or more constraints, providing data identifying the one or more parts or their relationships that do not conform to the set of one or more constraints; and if the one or more parts and their relationships conform to the set of one or more constraints, distributing the package to one or more computing applications.

7844540

12262586

1. A method for determining an optimal allocation in a combinatorial auction, the method comprising: (a) receiving a plurality of bids each of which includes a plurality of sub bids, wherein each sub bid is comprised of one of the following: (1) one good and a price associated with the good or (2) a logical operator logically connecting at least two child sub bids and a price associated with the logical operator, wherein, for each sub bid, the price associated with the good or the logical operator is either an explicit price that is included with the sub bid or the price is assigned a value of zero when the sub bid does not include an explicit price; (b) defining an objective for the plurality of bids; (c) defining for each bid a plurality of mathematical relationships without logical operators, wherein said mathematical relationships collectively represent the bid; and (d) causing optimizing software running on a processor to process the received bids to achieve the objective subject to the mathematical relationships, wherein step (c) includes, for each sub bid comprised of one good and a price associated with the good, defining: a first mathematical relationship between a pair of Boolean variables that relate (1) the one good being allocated to the bid that includes the sub bid to (2) satisfaction of the sub bid, wherein the sub bid is satisfied when the one good is allocated thereto; and a second mathematical relationship that relates (1) a value of the sub bid to (2) a product of the price of the sub bid times a value of a Boolean variable related to the satisfaction of the sub bid.

7516172

08510740

1. In a system for digital information processing, said system having a memory, a method for generating data representative of a quotient Q=a 0 a 1 a 2. .. a b from data representative of a divisor Y=y 1 y 2. .. y n and data representative of a dividend X=x 1 x 2. .. x a , comprising the steps of: (a) aligning the first non-zero bit of X with the first non-zero digit of Y; (b) defining a signed-digit partial remainder series R i where R 0 =Y, a first sign series of the partial remainder S i where S 0 =0, a second sign series of the partial remainder S ri , a quotient bit series a i , and a counter i beginning from zero; (c) subtracting X from R i which yields next signed-digit partial remainder R i+1 ; (d) setting the sign of R i+1 to S ri+1 ; (e) setting the result of exclusive-OR of S i and S ri+1 to the true sign of the next remainder S i+1 ; (f) setting a i to 1 if S i+1 =0 or R i+1 =0; (g) setting a i to 0 if S i+1 =1; (h) inverting the signs of all digits of R i+1 if S i+1 =1; (i) shift R i+1 left by one bit; (j) adding 1 to i; (k) repeating steps (c) to (j) until i reaches a predetermined value or R i+1 =0; and (l) storing in said memory as said data representative of a quotient, a quotient resulting from step (k).

20130124574

13654152

1. A computer readable storage medium storing a program of instructions executable by a machine to perform a method of integrating diverse sources of data and data streams comprising: selecting a scenario based on a topic; creating a multi-relational directed graph based on the scenario; identifying and converting resources in accordance with the scenario and updating the multi-directed graph based on the converted resources; identifying data feeds in accordance with the scenario and updating the multi-directed graph based on the data feeds; identifying analytical routines in accordance with the scenario and updating the multi-directed graph using the analytical routines; and identifying data outputs in accordance with the scenario and defining queries to produce the data outputs from the multi-directed graph.

9846601

14922595

1. A method for predicting usage of a program resource during running of a program, the method comprising: collecting, at least once within each period of a plurality of periods of usage of a program resource, resource usage data for the program resource while a program using the program resource is running; decomposing the resource usage data collected for the plurality of periods into a trend component reflecting a variation trend of program running resource usage, a seasonal component reflecting a periodic variation in the program running resource usage, and a random component reflecting a random variation in the program running resource usage; determining a first prediction function for the trend component, a second prediction function for the seasonal component, and a third prediction function for the random component, wherein the second prediction function for the seasonal component is an i th data point of the seasonal component, wherein i=t mod T, wherein t is prediction time, and T represents a duration of each period of the plurality of periods; adding together the first prediction function, the second prediction function, and the third prediction function to obtain an overall prediction function for the program resource; and predicting the usage of the program resource based on the overall prediction function, wherein predicting the usage includes at least one of predicting program running resource usage at a future set time, predicting when the program resource will be exhausted, or predicting when program running resource usage will reach a set threshold in the future.

20140157239

13691558

1. A system for peer-based code quality analysis, the system comprising: a computer, including a computer readable medium and processor; a peer-based code quality analysis tool, executing on the computer, which is configured to receive one or more source code files, perform an analysis of the one or more source code files based on a plurality of rules, compare results of the analysis to peer results data to determine a percentile based score, and create an interactive report which includes the results of the analysis and the percentile based score.

6134539

09219080

1. A method for creating a business simulation utilizing a rule-based expert system with a spreadsheet object component that includes data and calculations required for the business simulation and communication of information to provide a dynamic, goal based educational learning experience, comprising the steps of: (a) accessing the information in the spreadsheet object component of the rule-based expert system to retrieve information indicative of a goal; (b) querying a student to determine characteristics of the student; (c) integrating information based on characteristics of the student that motivates accomplishment of the goal; (d) utilizing the information in the spreadsheet object component of the rule-based expert system to integrate goal-based learning information based on characteristics of the student in a structured, dynamic business simulation designed by a profiling component to motivate accomplishment of the goal; (e) monitoring answers to questions posed to evaluate progress toward the goal utilizing the spreadsheet object component of the rule-based expert system and providing dynamic, goal-based, remediation learning information feedback from a remediation object component including a knowledge system and a software tutor comprising an artificial intelligence engine which generates individualized coaching messages to further motivate accomplishment of the goal; (f) analyzing the answers from the student utilizing system tools to compare the answers with a standard for achieving the goal; and (g) reporting progress toward the goal.

20060048044

11197123

1. A method for displaying consequences in an electronic spreadsheet, the method comprising: specifying a set of cells of the spreadsheet and a set of logical constraints on possible values of the cells; dynamically partitioning the set of cells into base cells and computed cells; assigning to the base cells a set of user-specified values, wherein the user-specified values are possibly inconsistent with the specified logical constraints; computing non-explosive logical consequences of the user-specified values and the set of logical constraints to produce a complete set of entailed values for the set of computed cells; reducing the number of entailed values for each computed cell whose number of entailed values exceeds a predetermined number of allowed values for the computed cell; and displaying a subset of the entailed values and a subset of the user-specified values.

20150242242

14432107

1. A method for directing a workload between distributed computing environments, the method comprising: (a) continuously obtaining performance and use data from each of a plurality of computer clusters, a first subset of the plurality of computer clusters being in a first region and a second subset of the plurality of computer clusters being in a second region, each region having known performance characteristics, zone of performance and zone of reliability; (b) receiving a job for routing to a distributed computing environment; and (c) routing the job to a given computer cluster in response to the obtained performance and use data, and the region encompassing the given computer cluster.

7914288

10960883

1. A computer system comprising a communications adapter connected to a network over a medium, a CPU, a computer screen, and a memory having computer instructions for implementing a method of providing learning activities in an organization, including computer instructions for operating one or more spreadsheet databases, said method comprising the steps of: mapping existing learning programs to job categories in a computer spreadsheet, said spreadsheet operating on said system; defining a desired mix of learning types, said learning types consisting of work apart, work embedded, and work enabled learning types, for each of said job categories in said computer spreadsheet; prioritizing said categories by entering priorities in the columns of said computer spreadsheet based on a criteria consisting of business impact, strategic alignment, ability to influence, or primary learning type; mapping new programs to said work apart, work embedded, or work enabled learning types by entering mapping data in the desired mix spreadsheet; mapping said new programs to content types in said computer spreadsheet; for said job categories having a high priority, reworking said existing learning programs into said desired mix of learning types, and allocating resources for new programs according to said mapping to content types; procuring learning packages or developing new packages of said work apart, work embedded, or work enabled learning types by using the allocated resources; and displaying on said computer screen said mapping including the procured packages or developed new packages.

8499022

13476100

1. A method of determining a consensus clustering and correspondence matrices from a plurality of membership matrices, comprising: iteratively computing, with an automated processor, from r membership matrices M (1) ∈ n×k1 ,. .. , M (r) ∈ n×kr , k∈ + , the consensus clustering represented by M∈ n×k and the r correspondence matrices S (1) ∈ k×k ,. .. , S (h) ∈ kh×k , by minimization of an objective function comprising a consensus function f, updating S (h) using update rule: S ( h ) ← S ( h ) - Θ ⊙ ( ∂ f ∂ S ( h ) ) until predetermined convergence conditions are achieved, wherein ⊙ denotes the Hadamard product of two matrices, Θ is a matrix of step size parameters, and updating M using update rule: M ← M = 1 r ⁢ ∑ h = 1 r ⁢ M ( h ) ⁢ S ( h ) until predetermined convergence conditions are achieved; and storing the computed consensus clustering and the correspondence matrices in a memory.

9248377

14494401

1. A method for adapting operation of a computing device based on a play personality of a user, comprising: obtaining information that indicates the play personality of the user; wherein the information indicates which play type, of a plurality of play types, satisfies the user's need for play; wherein the plurality of play types includes two or more of: Object, Pretend, Social, Rough and Tumble, Body, Exploratory, Celebratory, Competitive, Ritual, Narrative, Fantasy or Games/Gaming; determining that the user is using the computing device; during execution of software that generates output displayed on the computing device while the user is using the device, adapting operation of the software based, at least in part, on the play personality of the user; wherein the method is performed by one or more computing devices; wherein the one or more computing devices include the computing device.

20020078039

09739993

1. A computer-implemented data mining system, comprising: (a) an Interface Tier for supporting interaction with users, wherein the Interface Tier includes an On-Line Analytic Processing (OLAP) Client that provides a user interface for generating SQL statements that retrieve data from a database, and an Analysis Client that displays results from a data mining algorithm; (b) an Analysis Tier for performing one or more data mining algorithms, wherein the Analysis Tier includes an OLAP Server that schedules and prioritizes the SQL statements received from the OLAP Client, an Analytic Server that schedules and invokes the data mining algorithm to analyze the data retrieved from the database, and a Learning Engine performs a Learning step of the data mining algorithm; and (c) a Database Tier for storing and managing the databases, wherein the Database Tier includes an Inference Engine that performs an Inference step of the data mining algorithm, a relational database management system (RDBMS) that performs the SQL statements against a Data Mining View to retrieve the data from the database, and a Model Results Table that stores the results of the data mining algorithm.

20130185093

13785729

1. A computer-implemented method of dynamically producing a diagnostic test procedure sequence to diagnose a disease or disorder of a patient, comprising: selecting a first plurality of diagnostic test procedures related to a symptom exhibited by the patient; arranging an order of the first plurality of diagnostic test procedures based on a probabilistic disease or disorder analysis and time required to perform each of the first plurality of diagnostic test procedures; formatting a step of a first diagnostic test procedure from among the first plurality of diagnostic test procedures for display on a display device; displaying the formatted step on the display device; arranging an order of a second plurality of diagnostic test procedures, which includes one diagnostic test procedure of the first plurality of diagnostic test procedures, during execution of the first plurality of diagnostic test procedures, and based on intermediate diagnostic test information obtained from execution of the first diagnostic test procedure; and displaying a step of a second diagnostic test procedure from among the second plurality of diagnostic test procedures on the display device, wherein each of the above steps is performed by a computer.

20130271361

13800486

1. A method for detecting and classifying talking segments of a face in a visual cue in order to infer emotions, the method comprising: normalizing and localizing a face region for each frame of the visual cue; obtaining a histogram of structure descriptive features of the face for the frame in the visual cue; deriving an integrated gradient histogram (IGH) from the descriptive features for the frame in the visual cue; computing entropy of the IGH for the frame in the visual cue; performing segmentation of the IGH to detect talking segments for the face in the visual cues; and analyzing the segments for the frame in the visual cues to infer emotions.

7954698

11862977

1. A method for matching a customer having at least one financial transaction account at a financial institution to a financial product, the method comprising: (a) measuring a historical flow of cash transactions in at least one of the financial transaction accounts at the financial institution to generate one or more cash transactions datasets for the customer, the historical flow of cash transactions comprising deposits and withdrawals, wherein the one or more cash transactions datasets for the customer are generated by classifying the deposits and withdrawals into the one or more cash transactions datasets comprising fixed deposits, variable deposits, fixed withdrawals, and variable withdrawals; (b) using the customer cash transaction datasets to forecast one or more financial substitution factors for the customer; and (c) using at least one of the forecasted financial substitution factors to match the customer with the financial product or to an incentive linked to the financial product.

9830458

14262349

1. A computer-implemented method for managing a plurality of computing assets, the method comprising: identifying a plurality of computing assets of an enterprise network from a list of network addresses associated with each respective computing asset by probing each network address for digital certificate information presented by the respective computing asset in response to the probing; for at least a first computing asset of the one or more of the computing assets: identifying, by operation of at least one computer processor, one or more attributes associated with a digital certificate installed on the first computing asset, identifying one or more configuration attributes of the first computing asset, wherein the one or more configuration attributes include a plurality of network addresses configured on the first computing asset, an indication of whether the plurality of network addresses are reachable outside of the enterprise network, an indication of applications and operating systems installed on the first computing asset, and naming conventions associated with the first asset, and assigning a classification to the first computing asset based on the attributes of the identified digital certificate and based on the configuration attributes of the computing asset, wherein the classification is used to prioritize security incidents occurring on the plurality of computing assets; receiving one or more security incidents for a set of the one or more computing assets, wherein the set is restricted to a first assigned classification of the one or more computing assets, and wherein the one or more security incidents occurred over a specified time period; and prioritizing the one or more security incidents based on the first assigned classification and an underlying event associated with each of the one or more security incidents.

9195905

13041818

1. A method for detecting a curve structure in an image, comprising: detecting a plurality of curve segments in the image; generating a graph based on the curve segments, wherein the graph comprises a plurality of nodes, including a respective node corresponding to each of the plurality of curve segments detected in the image, and a plurality of edges connecting the plurality of nodes, wherein each node of the plurality of nodes is connected by respective edges to multiple other nodes of the plurality of nodes and each edge represents a possible connection between the curve segments corresponding to the nodes connected by the edge; and detecting a curve structure in the image by determining a path from a source node to a destination node in the graph.

10026043

13714569

1. A computer-implemented method of optimizing a blending plan for concentrated consumable products, comprising: receiving, by an application server, a plurality of input associated with a blending plan for the production of a concentrated consumable product over a predetermined interval of time, the plurality of inputs including a time interval data, one or more component raw material attributes for components utilized in producing the concentrated consumable product wherein the raw material attribute includes Brix, quantities of the components provided by one or more suppliers, data identifying the concentrated consumable product produced from blending the components and data identifying an intermediate product within the components utilized in producing the concentrated consumable product, wherein the intermediate product is utilized in combination with one or more other components in the blending of the concentrated consumable product, the intermediate product comprising a pre-blended concentrate; applying, by the application server, a plurality of constraints to each of the plurality of inputs to optimize the blending plan over the predetermined period of time, the plurality of constraints comprising: a quality bound associated with enforcing quality for the concentrated consumable product, a raw material bound associated with one or more categories of raw materials utilized in blending the concentrated consumable product, a component bound associated with the blending of components comprising the concentrated consumable product, supply requirements for the components utilized in blending the concentrated consumable product, a component demand requirement for the components utilized in blending the concentrated consumable product, a component conservation requirement utilized in blending the concentrated consumable product, a capacity bound associated with capacity limitations of blenders and suppliers with respect to the components utilized in blending the concentrated consumable product and one or more business rules associated with blending requirements for producing the concentrated consumable product, wherein the component conservation requirement comprises balancing produced and stored quantities of the concentrated consumable product with a supply of the components, the components being stored over at least a present and a previous interval of time; generating, by the application server, an optimized blending plan which optimizes an objective function comprising the plurality of inputs and the plurality of constraints to at least one of minimize those costs associated with the production of the concentrated consumable product and minimize deviations from a target quality associated with the production of the concentrated consumable product; and blending components based on the optimized blending plan to produce a concentrated consumable product, wherein the concentrated consumable product is a concentrated fruit juice.

8145588

12643159

1. A method for determining a connectivity-metric for a graph representative of a network of interest, the method comprising: accessing a graph that represents a network of interest, the graph comprising a plurality of nodes representing points in the network of interest, and a plurality of edges corresponding to the plurality of nodes; generating a plurality of bit-vectors respectively corresponding to at least one of the plurality of nodes or the plurality of edges, wherein individual bits in the bit-vectors respectively provide a logical indication of connectedness; and determining the connectivity-metric by applying a logical bit operation to the plurality of bit-vectors; wherein the connectivity-metric is a clustering determination, and determining the connectivity-metric comprises using the plurality of bit-vectors to determine a clustering coefficient of a clustering algorithm; wherein the clustering coefficient is defined as three times the number of triangles within the graph divided by all possible triples; wherein triangles are defined as the number of fully connected groups of three nodes and triples are defined as nodes that are directly connected to two distinct other nodes; and wherein the accessing, generating, and determining steps are performed on at least one particular machine, said at least one particular machine comprising at least one physical computing device.

20140025351

13632705

1. A method for determining a generator dispatch plan for a power grid under uncertain conditions comprising: receiving data modeling power flow of active generation units over nodes of a power grid network of multiple local buses interconnected via transmission lines, said active generation units including conventional energy generators producing energy; receiving during a first time interval data of a set of forecast scenario modeling uncertainty in renewable energy output, said set capturing a finite number of scenarios generation for an immediately successive 2 nd time interval; formulating an optimization problem modeling economic dispatch problem under renewable-generation uncertainty; solving optimization problem during said first time interval to obtain power dispatch levels for said generators and energy levels exchanging with a spot market for each scenario at said 2 nd time interval that minimizes expected cost of power generation and cost of exchanging energy with a spot market modeled for each said modeled uncertainty, wherein one or more processor units in communication with a memory storage device performs said receiving said modeling power flow and uncertainty data, said formulating and solving.

9398313

13339722

1. A method for encoding picture data, the method comprising: encoding at least one texture element of said picture data to obtain at least one encoded texture element, forming at least one texture encoding parameter in said encoding, encoding at least one depth element associated with said at least one texture element to obtain at least one encoded depth element, applying filtering to depth data in said encoding of at least one depth element, wherein the filtering is loop filtering, and controlling said filtering using said at least one texture encoding parameter.

8055104

12040894

1. A method of evaluating a data capturing system of a forms processing system including at least one of an optical character recognition system engine and a Key From Image system where image snippets appear to Keyers on computer screens comprising steps of incorporating simulated forms data as images image snippets of predetermined contents into a workflow of the data capture system; the simulated forms data image snippets being computer generated from the predetermined contents, supplying truth data corresponding to the predetermined contents of the simulated forms data image snippets to an electronic scoring module in an electronic digital form, interpreting the simulated forms data image snippets within the workflow of the data capture system for inferring contents of the images simulated forms data image snippets through the at least one of the optical character recognition system engine and the Key From Image system where the image snippets appear to Keyers on the computer screens, sending the inferred contents of the forms data image snippets from the data capture system to the electronic scoring module in an electronic digital form, selecting benchmark comparison criteria through a graphical user interface in communication with the electronic scoring module, comparing the inferred contents of the simulated forms data image snippets to the truth data corresponding to their predetermined contents within the electronic scoring module, and scoring results of the comparison in accordance with the benchmark comparison criteria within the electronic scoring module for evaluating the data capture system, wherein the simulated forms data subject to interpreting provide statistically significant results.

20130197894

13751413

1. A drug development system implementing a transparent development model, the system comprising: at least one processor operatively connected to a memory, the at least one processor when executing provides: a protocol builder subsystem configured to define a clinical trial, wherein the protocol builder subsystem is configured to define parameters of the clinical trial responsive to input from registered users, and wherein the protocol builder subsystem is configured to publish the input received on the parameters for the clinical trial for access on the drug development system; a drug development engine configured to manage execution of the parameters of the clinical trial, wherein the drug development engine includes: a collection component configured to receive remote trial execution data, wherein the collection component is configured to receive at least health and treatment information from a patient population defined for the clinical trial; and a user interface configured to publish at least a portion of the trial execution data for review on the drug development system, and wherein the user interface is configured to accept and publish user input regarding the at least the portion of the trial execution data.

8229174

13285496

1. A method of estimating motion and occlusion at a current site in a current frame from a video stream having three or more frames, the method comprising: identifying a plurality of motion vector candidates for each of a forward direction and a backward direction, the identification of at least some motion vector candidates performed at a block level, a pixel level, or a combination thereof using the steps of: initializing the motion vector candidate, and updating and refining the motion vector candidate, the updating using a measure of ill-conditioning of a gradient based estimation of the motion vector candidate and the refining using one or more update energies based on interframe difference, spatial motion correlation, and temporal motion correlation; generating a plurality of candidate pairs, each candidate pair in the plurality of candidate pairs having a forward motion vector from the plurality of motion vector candidates for the forward direction and a backward motion vector from the plurality of motion vector candidates for the backward direction and a occlusion state vector having a forward occlusion state and a backward occlusion state; determining an energy for at least some of the plurality of candidate pairs using a processor by jointly evaluating the forward motion vector and the backward motion vector of at least some of the plurality of candidate pairs based on interframe difference, spatial motion correlation, temporal motion correlation, and spatial occlusion correlation; and estimating motion and occlusion for the current site by selecting a candidate vector from the plurality of candidate vectors based on the determined energies.

20120230408

13412045

1. A method for decoding an encoded video bit stream in a video decoder, the method comprising: decoding a merge flag for a inter-predicted prediction unit (PU) from the encoded bit stream; and reconstructing the inter-predicted PU based on a value of the merge flag, wherein a merge flag is always encoded in the encoded bit stream for each inter-predicted PU that is not encoded using skip mode.

20160285571

14670465

1. A method for processing a plurality of signals, the method comprising: receiving one or more observations characterizing a wireless channel; performing a channel estimation to determine a probabilistic channel model for the wireless channel, wherein the channel estimation comprises numerically updating one or more multipath gain estimates and one or more multipath delay estimates based on the one or more received observations and a probability distribution associated with the probabilistic channel model; and processing the plurality of signals using the probabilistic channel model.

8234146

12043245

1. A computer-implemented method for conducting controlled online marketing research with budgetary control, said method comprising: receiving user selection criteria, by a computer, for entry of a user into an online experiment, when said user visits an online site, where said online experiment is conducted; determining, by said computer, that said user selection criteria, for entry of said user, match user selection criteria for one of a plurality of existing experimental groups and an existing control group stored in said computer system, said user selection criteria comprising: tracking said user's online browsing to match browsing events; determining whether said user is a new user or an existing user in one of said plurality of existing experimental groups and said control group; a number of users for each of said existing plurality of experimental groups and said control group; an experimental time period for said online experiment; and a budget for said online experiment, based on probabilistic costs of future user actions implemented by prediction tools; determining, by said computer, that said user satisfies said user selection criteria for entry into said online experiment, matching said user to a previous participant of said online experiment, assigning said user to one of said plurality of existing experimental groups and said control group, other than that to which said previous participant belongs, entering said user into said online experiment, and conducting said online experiment; and outputting, by said computer, an analysis of a change in a marketing variable with respect to a response variable given by said user measured during the experimental time period for said online experiment, said marketing variable comprising any of a price of product, a discount, an advertisement, a bundling of products, and a product design or packaging.

20030051232

09943209

1. A method of debugging software comprising: obtaining a software module; obtaining a first input test vector; obtaining a bug list; generating a first output vector by applying said first input test vector to said software module; applying a comparison test to said first output vector to determine whether a bug exists in said software module; applying a module decomposition test to said software module when the result of said comparison test is positive; and appending said software module and said first input test vector to said bug list when the result of said module decomposition test is negative.

20130297370

13993725

1. A scheduling software comprising: a stochastic model having one or more jobs associated with one or more resources and input parameters, wherein each job of the one or more jobs has one or more user-defined targets, wherein each associated job and resource includes (i) elements with variability defined by probability distributions and (ii) unplanned events; a first subroutine operably connected to the stochastic model, wherein the first subroutine executes the stochastic model in a deterministic mode to generate a finite-capacity schedule based on the one or more jobs; a second subroutine operably connected to the stochastic model, wherein the second subroutine executes the stochastic model a number of times specified by a user or calculated by an automatic subroutine executed by the second subroutine to generate multiple finite-capacity schedules, wherein each execution of the stochastic model incorporates (i) variations in the elements based on a sampling from the element probability distributions and/or (ii) the unplanned events to generate and record a set of resulting target samples for each of the one or more user-defined targets for the one or more jobs; a third subroutine to compute one or more risk measures from the recorded set of resulting target samples for the one or more user-defined targets; and a fourth subroutine to display the one or more risk measures across the one or more jobs, whereby the user determines whether the one or more risk measures of the finite-capacity schedule is acceptable.

20150301878

14685352

1. A method of preventing and detecting conflicts and errors through prognostics and diagnostics, comprising: at least one control unit; receiving a list of parameters associated with a system of cooperative units and interactions between the cooperative units by at least one control unit; performing detection, including: a) providing a list of at least two constraints, each constraint defining a task to be accomplished or a requirement to be satisfied by one or more cooperative units by a first time; b) identifying one or more constraints from the list, which need to be satisfied by a defined time; c) identifying for each identified constraint whether any conflict or error exists; where a conflict occurs whenever an inconsistency between two or more cooperative units occurs, and an error is associated with any condition that is inconsistent with the list of parameters; d) marking the constraints for which an error or conflict has been identified; e) incrementing a mark count for each cooperative unit associated with each marked constraint; performing at least one of diagnosis and prognosis in the at least one control unit based at least in part on the marked constraints.

20030115216

10028471

1. A method for characterizing market distribution for a business having a plurality of business representatives, the method comprising: determining a location for each of the plurality of business representatives; determining a location for each of a plurality of competitor representatives comprised by one or more competitors to the business; populating at least one database with the locations for the business representatives and the locations for the competitor representatives; and assigning a locator identification to each distinct location for use as a pointer to the locations within the at least one database.

7797062

10674966

1. A system that optimizes industrial business operations, comprising: a processor; a memory communicatively coupled to the processor, the memory having stored therein computer-executable instructions configured to implement the industrial business operations including: a component that receives data relating to a plurality of machines that are part of the industrial business operations; a correlation engine that analyzes the data and correlates efficiency information for at least two of the plurality of machines to derive correlated system efficiency information; an optimization component that employs the correlated system efficiency information to select an operating point within an allowable range of operation about a system setpoint and controls the industrial business operations in part according to the operating point, the operating point selected to optimize a total energy utilization of the plurality of machines based on the correlated system efficiency information; and a prognostics engine that generates an inference of a future state of a subset of operations for the plurality of machines based in part on the received data; wherein at least a subset of the plurality of machines comprise respective prognostic components that share state information with one another; and wherein the prognostic engine and the prognostic components collaborate to control an operating rate of at least a subset of the plurality of machines.

20080059284

11570775

1 ) A method of forecasting commodity consumption by an individual within a population, the method comprising: a) deriving at least one population commodity consumption forecasting model from population historical consumption data; b) for at least one individual of the population, deriving an individual commodity consumption forecasting model from said at least one population commodity consumption forecasting model and from individual historical consumption data; and c) forecasting future individual commodity consumption for said individual using said individual commodity consumption forecasting model.

20060190236

11358536

1. A method comprising: simulating a propagation of a plurality of messages corresponding to an application among nodes of a modeled network, providing a graphic representation of the propagation of the plurality of messages, providing a user interface to the graphic representation to facilitate receiving message operations, receiving one or more of the message operations, and resimulating the propagation of the plurality of messages based on the one or more message operations.

9152611

13954634

1. A computer-implemented method for generating a global optimal solution to a mixed integer nonlinear programming (MINLP) problem wherein a part or all of optimization variables of the MINLP problem are restricted to have discrete values, the method comprising: computing by a computer system a first integer solution to the MINLP problem with a given starting point using an MINLP solver; computing a set of stable equilibrium points (SEPs) of a nonlinear dynamical system associated with a relaxed continuous problem of the MINLP problem, wherein the SEPs surround the first integer solution and form one or more tiers; identifying from the SEPs a set of new starting points for the MINLP problem; computing integer solutions to the MINLP problem with progressively tightened bounds, starting from the new starting points using the MINLP solver; and generating by the computer system the global optimal solution based on the integer solutions after one or more iterations of computing the SEPs, identifying the new starting points and computing the integer solutions.

20170257100

15450017

1. A configurable computing element selectively realizing a first or second math function, comprising: a semiconductor substrate including transistors thereon; at least first and second three-dimensional printed memory (3D-P) arrays stacked above said semiconductor substrate, wherein said first 3D-P array stores at least a first portion of a first look-up table (LUT) for said first math function, and said second 3D-P array stores at least a second portion of a second LUT for said second math function; at least a configurable interconnect coupling with said first and second 3D-P arrays, wherein said configurable computing element selectively realizes said first or second math function depending upon at least a configuration signal on said configurable interconnect.

20110302112

12794150

1 ) A computer implemented method using a computing device with a processor and memory having instructions stored thereon which are executed by the processor to perform a method, comprising: receiving multiple cycle lengths of seasonal effects that are identified in time series data; using a time domain analysis of the time series data to build a model; and using the model to predict future events or future data points.

8321356

11874681

1. A system for delivering real-time landed cost information comprising a tariff cost for an indicated good associated with a specific country, comprising: a database adapted to store content associated with a plurality of countries, the content comprising: a harmonized system (HS) module for storing a data structure representing an HS tree associated with the plurality of countries, the HS tree having a hierarchy of nodes in which the good can be classified, wherein the nodes comprise at least 1) a plurality of classification nodes, each classification node accounting for a logical classification in the HS tree that is not distinguished by an HS code, 2) a plurality of standard nodes, each standard node being associated with a respective HS code for a particular country of the plurality of countries, and 3) a plurality of merged nodes, each merged node representing two or more countries' standard nodes having a shared node description, wherein each classification node has at least one of one or more subordinate standard nodes from the plurality of standard nodes or one or more subordinate merged nodes from the plurality of merged nodes; wherein cross-reference data is stored and identifies different non-merged nodes in the HS tree that have the same meaning; a tariffs module for storing tariff data associated with said HS codes, the tariff data being used to calculate tariff costs for goods, wherein specific tariff data is selected for a particular good based on an HS code being associated with the specific tariff data and the specific good; a compliance module for storing import or export data associated with the HS codes, the import or export data indicating restrictions associated with importing or exporting the goods, wherein specific import or export data is selected for the particular good based on the HS code being associated with the specific import or export data and the specific good; and a processor configured to: (1) receive a query over an application programming interface (API) requesting said real-time landed cost information for the indicated good for said specific country; (2) access the database to retrieve a corresponding HS code associated with the good, using the cross-reference data to find the node that corresponds to the HS code for the specific country; (3) access the tariffs module to retrieve corresponding tariff data associated with said good to determine the tariff cost, the corresponding tariff data being retrieved based on the corresponding HS code; (4) access the compliance module to retrieve corresponding import or export data indicating one or more corresponding restrictions, the corresponding import or export data being retrieved based on the corresponding HS code; (5) calculate the landed cost information comprising at least the tariff cost; and (6) generate a response to the query comprising the landed cost information and the one or more corresponding restrictions for said good.

7773806

11397040

1. A method of segmenting an object in a set of image data using one or more prior instances of the object, comprising: determining a nonparametric estimate of a statistical shape distribution from the one or more prior instances of the object in a subspace spanned by the one or more prior instances of the object by a kernel density estimator; determining a nonparametric estimate of a statistical intensity distribution from one or more prior instances of the object by a kernel density estimator; combining the kernel density estimator of the statistical shape distribution with the kernel density estimator of the statistical intensity distribution in a Bayesian expression conditioned on the set of image data, wherein the expression is provided in accordance with: E ⁡ ( α , h , θ ) = ⁢ - ∫ Ω ⁢ ( H ϕ ⁢ log ⁢ ⁢ p in ⁡ ( I ) + ( 1 - H ϕ ) ⁢ log ⁢ ⁢ p out ⁡ ( I ) ) ⁢ ⁢ ⅆ x - log ( 1 N ⁢ ⁢ σ ⁢ ∑ i = 1 N ⁢ ⁢ K ( α - α i σ ) ) ; selecting a segmentation of the object in the set of image data by executing a level set method by a processor which optimizes the Bayesian expression; and the processor generating an image of the segmented object on a display.

20110222611

13130127

1. A method for managing transmission resources in a digital communication system comprising an access network, including a DSL system, and implementing resource management to reduce impairments, including cross-talk interference, in a metal access cable or cable binder, of the access network, comprising a number, N, of lines, the method comprising: determining, for each respective of said lines, e.g. a relevant line set comprising interference relevant lines for said respective line, applying resource management, of said lines N, using one or more algorithms based on the determined relevant line sets for said respective lines.

7647285

11556085

1. An online system to facilitate providing health and/or wellness assistance, comprising: means for obtaining unclean medical data from an unselected population via the Internet; means for automatically drawing conclusions from the unclean medical data, the means for automatically drawing conclusions from the unclean medical data employing a statistical algorithm, a machine-learning algorithm, a data-mining algorithm and/or an artificial-intelligence algorithm to draw at least one conclusion from the unclean medical data; means for receiving a query from a member of the unselected population; and means for providing the member of the unselected population with a conclusion based on at least the query and at least some of the unclean medical data relating to the member of the unselected population.

9043190

14254544

1. A computer-implemented method of identifying a personalized cardiovascular device based on patient-specific geometrical information, the method comprising: acquiring an anatomical model of at least part of a patient's vascular system; identifying the presence of disease at one or more locations of the anatomical model; defining one or more design variables of a personalized cardiovascular device to treat the disease; defining one or more performance metrics of the personalized cardiovascular device, the one or more performance metrics being chosen from one or more of: flow mechanic characteristics, solid mechanics characteristics, cost characteristics, and clinical event characteristics, wherein values of the one or more performance metrics are a function of values of the one or more design variables; performing, using a computer processor, one or more of geometrical analysis, computational fluid dynamics analysis, and structural mechanics analysis on the anatomical model; iteratively updating the values of the one or more design variables to calculate updated values of the one or more performance metrics by using one or more iterative updates of the anatomical model, each iterative update of the anatomical model taking into account deployment of an iteration of the personalized cardiovascular device; and identifying, using a computer processor, an iteration of the personalized cardiovascular device for the patient, based on a set of values of the one or more design variables that would optimize the one or more performance metrics in the anatomical model.

20140180647

14189393

1. A computer-implemented method for generating a three-dimensional (3D) model of an individual, the method comprising: receiving pose data that includes image data associated with the individual being in a pose; selecting from a database a morphable 3D generic human model based on a gender of the individual; adjusting a pose of the morphable 3D generic model based on the image data; identifying, based on the image data, one or more 3D appearance parameter objects included in the database; and adjusting via one or more processors one or more properties of the morphable 3D generic model based on the image data as well as the one or more 3D appearance parameter objects to produce the 3D model of the individual.

8768932

11803580

1. A method comprising: receiving, by one or more devices, a query that includes one or more terms; searching, by the one or more devices, a dataset, using the one or more terms, to obtain search results; obtaining, by the one or more devices, a user-specified attribute identifier that identifies an attribute to be used in ranking the search results, the identified attribute being different from a measure of relevance of the search results to the query; calculating, by the one or more devices, a combined score for each search result, included in the search results, based on the attribute value and a value corresponding to the measure of relevance of the search result to the query; ranking, by the one or more devices, the search results based on the combined score calculated for each search result to form a first ranking of search results; dividing, by the one or more devices and based on a threshold value associated with the measure of relevance of the search results to the query, the first ranking of search results into subsets of ranked search results, the subsets of ranked search results including a first subset of ranked search results and a second subset of ranked search results; ranking, by the one or more devices, search results included in the first subset of ranked search results and search results included in the second subset of ranked search results based on the attribute value to form a second ranking of search results, each of the search results, included in the first subset of ranked search results, being ranked relative only to other ones of the search results included in the first subset of ranked search results, and each of the search results, included in the second subset of ranked search results, being ranked relative only to other ones of the search results included in the second subset of ranked search results; and providing, by the one or more devices, the second ranking of search results.

20160267556

15162098

1. A system comprising one or more processors and a non-transitory storage medium comprising program logic for execution by the one or more processors, the program logic comprising: a native advertisement placement engine that: obtains a Document Object Model of an HTML document; identifies Document Object Model elements, of the Document Object Model, associated with native advertisement placement candidate containers; and based at least in part on analysis associated with the Document Object Model, and utilizing at least some of the identified elements, determines, within the Document Object Model, one or more native advertisement placement candidate containers, wherein the analysis comprises constructing and utilizing a suffix tree of a string of tags comprising tags in the Document Object Model.

20080059925

11468078

1. A method of verifying gating rules comprising the steps of generating test bench hardware design language code from the design source hardware design language code, and building a formal verification model comprising the testbench hardware design language code and the hardware design language for the design under test to provide a design verification tool.

6023578

08853208

1. A method for generating an object oriented application for an object oriented environment, said object oriented environment comprising a programming model and a data model, said method comprising the steps of: generating a computer program design for said object oriented model application using a modeling tool; and mapping the modeling tool generated computer program design to the data model of said object oriented environment to thereby create metadata in said data model wherein said mapping step comprises defining a first package, wherein said first package partitions the computer program design into at least two parts without requiring reference to model semantics.

20110224832

13039685

1. A control model updating device for calculating and updating a control model that is a function for approximating that which is to be controlled, doing so using analysis data that is provided in order to update a control model for that which is to be controlled, comprising: a control model calculating portion calculating the control model using the analysis data; a control model updating portion updating through accepting a control model calculated by the control model calculating portion; and a data suitability evaluating portion evaluating the suitability of the analysis data; wherein: the data suitability evaluating portion comprises: a characteristic prior knowledge storing portion storing prior knowledge regarding the characteristics obtained in advance regarding that which is to be controlled; a quadratic polynomial calculating portion calculating a quadratic polynomial that approximates the analysis data using a quadratic function; and a characteristic evaluating portion comparing the characteristics of the quadratic polynomial, calculated by the quadratic polynomial calculating portion, to the prior knowledge stored in the characteristic prior knowledge storing portion; and wherein the control model updating portion updates the control model when there is a match between the two in the comparison in the characteristic evaluating portion.

8958826

13938662

1. A mobility pattern mining device, comprising: a data collecting unit configured to collect a user's historical data; a stay point obtaining unit configured to obtain stay points of the user from the historical data; an extracting unit configured to obtain a semantic tree for a certain topic and extract topic related stay points from the stay points of the user by using the semantic tree for the certain topic; a determining unit configured to determine a candidate mobility pattern of the user based on the topic related stay points; and a selecting unit configured to select a frequent mobility pattern which best matches the candidate mobility pattern of the user from a frequent mobility pattern database related to the certain topic; wherein the frequent mobility pattern database is set in advance based on historical data for a plurality of users.

20150286926

14674428

1. A thermodynamic RAM circuit, comprising: a collection of kT-Core circuits, wherein each kT-Core among said collection of core kT-Core circuits comprises an AHaH circuit with a RAM interface.

20160295231

15052198

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

8229867

12277680

1. A computer executed method for selecting bits in a string-based genetic algorithm, the computer executed method comprising: a type of genetic operation to execute; responsive to a determination that the type of genetic operation is a crossover operation that swaps bits between a pair of bit strings by swapping bits on the pair of strings on at least one side of a crossover point receiving an input comprising the pair of bit strings; comparing the pair of bit strings to identify a set of non-matching points, wherein the non-matching points are identical bit positions within the pair of bit strings having different bit values for each of the pair of bit strings, wherein comparing strings in the pair of strings to identify a set of non-matching points comprises performing a logical exclusive OR (XOR) operation on the pair of bit strings to obtain an intermediate bit string, wherein the intermediate bit string indicates bits that are different between each bit string of each unique pair of bit strings; randomly selecting a set of points from the set of non-matching points; generating a new bit string corresponding to the crossover operation of the pair of bit strings using the set of randomly selected non-matching points.

9280741

13874522

1. In a device monitoring system constructed and arranged to communicate alerts, via a set of alerting rules, in response to changes within a computing environment, a method of providing alerting rules for a particular computing environment, the method comprising: storing multiple alerting rule sets in a rule set database, the multiple alerting rule sets providing sets of alerts when applied to configuration data of existing computing environments; selecting particular alerting rules among the multiple alerting rule sets stored in the rule set database, the particular alerting rules providing particular alerts when applied to configuration data of an existing computing environment; and providing the particular alerting rules to the particular computing environment, wherein each existing computing environment is managed by an expert user, each expert user receiving alerts from the device monitoring system in response to configuration changes within the existing computing environment managed by that expert user according to an alerting rule set stored in the rule set database, wherein each alerting rule of the multiple alerting rule sets includes (i) a configuration change identifier identifying a configuration change in an existing computing environment and (ii) a respective alert indicator indicating whether an alert is to be issued in response to the configuration change identified by the configuration change identifier, wherein selecting the particular alerting rules includes: performing a comparison operation between the existing computing environments and the particular computing environment, the comparison operation producing a comparison result indicative of whether the existing computing environments are similar to the particular computing environment; and picking, as the particular alerting rules, rules from the multiple alerting rule sets based on the comparison result.

8938116

13315066

1. A method for generating thumbnail images, comprising the operations of: extracting a plurality of pixel-level features from each of a plurality of source images, wherein each of the source images is associated with a thumbnail created by an editor; generating a plurality of unique bounding boxes for each source image; calculating a plurality of region-level features for each bounding box, wherein each region-level feature results from the aggregation of pixel values for one of the pixel-level features; learning a regression model, using at least the calculated region-level features and the thumbnail associated with the source image; and choosing a thumbnail from a plurality of unique bounding boxes in a new image, based at least in part on application of the regression model, wherein application of the regression model occurs if the source image is not approximately square, and wherein each of the operations is executed by one or more processors.

8014987

12061252

1. A method for performing a drilling operation for an oil field, the oil field having a subterranean formation with geological structures and reservoirs therein, comprising: creating a finite-difference model to simulate behavior of a drilling assembly used to drill a wellbore in the drilling operation by: modeling the wellbore as a visco-elastic boundary with friction; and modeling interaction of a drill bit of the drilling assembly with rock along the wellbore using structural compliance of the tool under compressive loading and a modified Hertzian contact formulation in which contact area, reaction forces, and torque are non-linearly dependent on depth of cut, rock strength, and drill bit geometry, wherein the depth of cut is calculated using actual bit cutting advance per revolution; performing a simulation of the drilling operation using the finite-difference model; analyzing a result of the simulation to generate an analysis; and generating, using a computer processor, a modified drilling operation by selectively modifying the drilling operation within the finite-difference model based on the analysis.

20090310658

12138657

1. A method for reducing peak-to-average power ratio (PAR) comprising: performing a startup procedure for a digital subscriber line (DSL) session having a handshake phase and a transceiver training phase; and using PAR reserved tones (PRT) to reduce PAR, wherein the handshake phase comprises determining a plurality of upper frequency tones for PAR reduction; reserving the plurality of upper frequency tones as PRT; and transmitting an upper frequency index based on the plurality of upper frequency tones.

8374976

12631590

1. A method for selecting a subset of training points near a query point from a set of training points for local learning, comprising the steps of: providing a set of training points χ, a query point x q ; determining a subset of training points X N near the query point x q from a set of training points χ according to argmax X⊂χ G ( X )= D T ( X )+λ e −H(X) , where the function argmax returns a value of X that maximizes the function G D T ( X )=Σ x∈X exp(−∥ x−x q ∥ p ) for p= 1,2 is a cumulative similarity from the query point to the subset of training points X n , e −H(X) evaluates an inverse range of distribution induced by X and γ is a control parameter greater than zero, and H is a Shannon entropy, wherein the providing and determining are performed in a processor.

20100286973

12763250

1. A method for targeting trait phenotyping of a plant breeding experiment, the method comprising: collecting soil data for at least one location; applying the soil data to a crop model; performing environmental monitoring at the at least one location to generate environmental data; updating the crop model with the environmental data; using the crop model to provide predicted crop conditions; determining environmental conditions for each of the plant breeding experiments; determining a likelihood of trait phenotype variations for each experiment using the environmental conditions and the predicted crop conditions; selecting a subset of the plant breeding experiments for collecting trait phenotype measurements based on the likelihood of trait phenotypic variation; collecting trait phenotype measurements from the subset of the plant breeding experiments.

20030016216

10251858

1. A numerical analysis mesh generating method comprising the steps of: inputting a geometric model under analysis; selecting a verification model having a geometry analogous to said geometric model; corresponding said geometric model to said verification model in terms of the geometry; reading a previously created mapping model approximated from said verification model with a lattice; modifying said mapping model of said verification model from a geometric correspondence between said geometric model and said verification model to create a mapping model for said geometric model; and mapping lattice points of said created mapping model for said geometric model to said geometric model to create a numerical analysis mesh.

20080015829

11778568

1. A method for determining a probability density function (PDF) of at least one performance metric in regard to an electromagnetic (EM) component of an electronic device or system, comprising the steps of: (a) providing variability information as an input to a simulation of the EM component, for each randomly varying parameter to be considered in determining the PDF for the at least one performance metric, wherein the variability information for each randomly varying parameter comprises a range and a nominal value for the randomly varying parameter; (b) for all of the randomly varying parameters to be considered, using the simulation to generate a response surface, wherein the response surface is defined over a statistical range for the randomly varying parameter, and as a function of a related variable on which the performance metric is dependent; (c) using a random vector generator to produce probabilities that the randomly varying parameter will be within each of a plurality of different incremental portions of the range provided in step (a), wherein the random vector generator employs a correlation matrix that correlates values of the randomly varying parameter with the related variable; (d) extracting the related variable from the response surface, based upon the probabilities of the randomly varying parameter; and (e) determining the PDF for each performance metric evaluated in regard to the EM component, as a function of the probabilities of each randomly varying parameter, relative to the related variable.

5439362

08280637

1. A method for increasing the probability that a mammalian offspring will be female or male comprising the step of immunizing a female mammal with a Y-SAM protein or an X-SAM protein, respectively.

20150323633

14707598

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

9501549

14263554

1. A method performed by data processing apparatus, the method comprising: identifying a primary ranking signal and a set of auxiliary ranking signals for ranking a set of criteria for a content item, wherein the primary ranking signal defines a first attribute for one of the criteria in the set of criteria and each auxiliary ranking signal in the set of auxiliary ranking signals a) defines a second attribute for one of the criteria in the set of criteria and b) is different than the primary ranking signal; for each particular criterion in the set of criteria: identifying a primary score representing a value of the primary ranking signal for the particular criterion; identifying a set of auxiliary scores for the particular criterion, each auxiliary score representing a value of an auxiliary ranking signal of the set of auxiliary ranking signals for the particular criterion; adjusting each auxiliary score in the set of auxiliary scores to generate adjusted auxiliary scores, the adjusting comprising applying, to at least a portion of the auxiliary scores, a transformation function that reduces an amount of skewness among the auxiliary scores that are associated with a particular auxiliary ranking signal from the set of auxiliary ranking signals; and determining a ranking score for the particular criterion based on a function of the primary score for the particular criterion and the adjusted auxiliary scores, the function suppressing effects of adjusted auxiliary scores for the particular criterion that do not satisfy a specified value and boosting the ranking score using adjusted auxiliary scores for the particular criterion that satisfy the specified value; selecting one or more criteria in the set of criteria for which to associate the content item based on the ranking score for each particular criterion; and providing the content item in response to receiving data specifying one or more of the selected criteria.

9507862

13804136

1. A method performed by at least one processor, the method comprising: accessing a document containing a plurality of facts; detecting a chronological value for each of the plurality of facts contained in the document; detecting a subject reference for each of the plurality of facts contained in the document, wherein the subject reference includes at least one of a person, a place, an object, or an event; determining an identity of the subject reference for each of the plurality of facts from a context in the document and a detection rule; and assembling the plurality of facts into a record based on the determined identity and the chronological value for each of the plurality of facts.

8250582

12567582

1. A method of reducing cost chargeback in an information technology computing environment including multiple resources, comprising: storing resource usage, allocation statistics for a plurality of resources and associated cost policies for the plurality of resources; determining time-based usage patterns for the plurality of resources from the allocation statistics; creating a correlation of response time with resource usages and outstanding input/output instructions for the plurality of resources; based on the time-based usage patterns and the correlation, obtaining a plurality of potential cost reduction recommendations; determining a plurality of integrals based on the plurality of potential cost reduction recommendations, and determining a statistical integral based on the allocation statistics; comparing a difference between the statistical integral and each of the plurality of integrals with a threshold to determine potential final cost reduction recommendations; and providing a final cost reduction recommendation selected from the potential cost reduction recommendations.

10001384

12617487

1. A method comprising: receiving, by an apparatus, data specifying a reference point-of-interest specified by a user and location data of a search region; retrieving, by the apparatus, a reference vector specifying a plurality of features associated with the reference point-of-interest; determining, by the apparatus, a plurality of candidates for similar points-of-interest based, at least in part, on the search region; retrieving, by the apparatus, candidate feature vectors specifying a plurality of features associated with respective candidates by at least real-time extracting semantic topics from one or more text descriptions and one or more user reviews for each of the candidates using a language model assigned a probability to each word thereof, and generating entries of the semantic topics in the feature vectors for each of the candidates, wherein the user reviews include one or more reviews by the user; determining, by the apparatus, a similarity score for each of the candidates via comparing the plurality of features of respective candidates to the plurality of features of the reference point-of-interest to determine a number of common features (n) shared between the plurality of features of the respective candidates and the plurality of features of the reference point-of-interest, and calculating the similarity score using an equation including a weighting vector (w), the reference feature vector (r), a respective candidate feature vector (p): similarity ⁢ ⁢ ( r , p ) = ∑ i = 1 -> n ⁢ w i ⁢ r i ⁢ p i where i=1 to the number of common features shared between the reference vector and the candidate feature vectors; and generating, by the apparatus, a list of one or more similar points-of-interest based on the similarity scores.

20150104062

14052782

1. A moving object detection method based on a Probabilistic Neural Network (PNN) model to distinguish a moving object pixel from a background object pixel in a video image delivered over a bandwidth limited network, and the method comprising: receiving a sequence of images of a fixed location; generating from the sequence of images a background model based on the PNN model having four layers comprising an input units layer, a pattern units layer, a summation units layer, and an output units layer; defining the nodes of the four layers of the PNN model, the weight coefficient for each of the nodes, and the relationships among the nodes; receiving a current frame of the sequence of images and dividing the frames into N by N blocks where N is a positive integer greater than 1; determining pixel blocks by eliminating from the N by N blocks the blocks which are statistically determined to contain only background pixels; and determining whether a pixel of the pixel blocks of the sequence of images is a moving object pixel or a background object pixel by comparing the maximum coefficient of the output units layer against an output threshold.

20110040715

12913285

1. A data processing system for calculating a distribution of a quantity over a number of receiver objects, the data processing system comprising: a number of application programs, each of the application programs being adapted to generate a distribution request; storage means for storing a number of rules, each rule being adapted for distribution of at least a portion of the quantity over the receiver objects and for storing an assignment of a sub-set of the rules to each application program, each rule within one of the sub-sets of rules having an assigned priority of execution and each sub-set of rules having an assigned identifier; and distribution calculation means for receiving the distribution request from one of the application programs, the distribution request comprising the identifier of the sub-set of rules assigned to the one of the application programs, the quantity to be distributed, and the identifiers of receiver objects over which the quantity is to be distributed, the distribution calculation means being adapted to access the storage means for execution of the sub-set of rules assigned to the one of the application programs in the order of the priorities assigned to the rules within the sub-set of rules.