Datasets:

patent

/

AIPD_evo_claim_one

like 0

8285616

12748336

1. A computer-implemented method for causing a computer associated with a database to provide an enhanced credit evaluation report, said method comprising: collecting from a source, data about an entity of interest, for storage in said database; linking said entity of interest to a related entity in a corporate family tree stored in said database; receiving a request for said enhanced credit evaluation report about said entity of interest; obtaining user-specified rules or criteria for evaluating credit of said entity of interest; dynamically selecting from a database of trade experiences stored in said database, based upon said user-specified rules or criteria, (a) trade experiences for said entity of interest and for said related entity, and (b) trade experiences for a peer group; dynamically assessing performance across said trade experiences for said entity of interest; and generating, using said computer, said enhanced credit evaluation report of said entity of interest based upon a comparative analysis of said trade experiences for said entity of interest and for said related entity and said trade experiences for said peer group.

9245248

14014707

1. A method comprising: receiving, by a computer system comprising computer hardware, an identity of a metric of interest and a future time point; retrieving, by the computer system, a prediction configuration previously associated with the metric of interest, the prediction configuration comprising a period combination; wherein the period combination comprises a plurality of time periods, each time period comprises one or more segments, and each segment of the one or more segments comprises adapted historical values of the metric of interest incrementally inserted therein; for each time period of the plurality of time periods: the computer system identifying, for the future time point, a corresponding segment of the one or more segments; accessing, by the computer system, a set of adapted historical values from the corresponding segment; and computing, by the computer system, an intermediate predicted value from the set of adapted historical values, the computing comprising: testing for a trend in the set of adapted historical values; based on a result of the testing, determining whether the set of adapted historical values satisfies criteria for performing linear regression; responsive to a determination that the set of adapted historical values satisfies the criteria for performing linear regression, computing the intermediate predicated value using linear regression; and responsive to a determination that the set of adapted historical values does not satisfy the criteria for performing linear regression, computing the intermediate predicted value based on an average of the set of adapted historical values; and calculating, by the computer system, a predicted value for the metric of interest based on the computed intermediate predicted value.

20090006386

12146267

1. A computer implemented method for presenting a view of a result obtained from interaction with a collection of information, the method comprising the acts of: determining at least one identifying characteristic within at least one result set returned from interaction with a collection of information; determining a statistical distribution of the at least one identifying characteristic within the at least one result set; modifying the at least one result set based on the statistical distribution of the at least one identifying characteristic; and returning the modified result set.

7849077

11481686

1. A computer implemented method, comprising: receiving a query, the query being configured to cause a search logic to retrieve one or more documents, the documents comprising text elements and metadata elements; creating from the query a series of sub-queries {SQ 1 ,. .. SQ N }, N being an integer greater than 1, the series of sub-queries including a sub-query based on one or more of a numeric metadata link score and a numeric metadata URL depth; the series of sub-queries being configured so that a sub-query SQ X will cause the search logic to retrieve fewer documents than a sub-query SQ Y when X<Y; the series of sub-queries being configured so that a sub-query SQ A will cause the search logic to retrieve documents having a higher relevancy than a sub-query SQ B when A<B; and providing, in order according to the configuration of the series of sub-queries, one or more sub-queries from the series of sub-queries to the search logic until a pre-determined number of documents are retrieved by the search logic.

9619805

13431276

1. A computer-implemented method for query optimization, the computer-implemented method comprising executing instructions in a computer system to perform the operations of: receiving a request for a fact regarding a product offered for purchase in a product catalog from a client, wherein receiving the request for a fact includes receiving a product identifier associated with the product offered for purchase; in response to receiving the request for the fact regarding the product offered for purchase in the product catalog from the client, generating the fact regarding the product offered for purchase in the product catalog and returning the fact regarding the product offered for purchase in the product catalog to the client in response to the request; determining a probability that the client will request one or more additional facts regarding the product offered for purchase in the product catalog, wherein the probability that the client will request the one or more additional facts is determined at least in part on historical requests data describing a probability that the one or more additional facts will be requested following a request for the fact; determining an estimated cost of generating the one or more additional facts regarding the product offered for purchase in the product catalog, wherein the estimated cost is determined at least in part based upon historical cost data describing an actual historical cost to generate the one or more additional facts, the estimated cost comprising one or more of an estimated time, memory usage, processing capacity, or network bandwidth required to generate the one or more additional facts; speculatively generating the one or more additional facts regarding the product offered for purchase in the product catalog based upon the determined probability and the estimated cost of generating the one or more additional facts regarding the product offered for purchase in the product catalog; storing the speculatively generated one or more additional facts regarding the product offered for purchase in the product catalog for use in responding to a future fact request regarding the product offered for purchase in the product catalog from the client; updating the historical cost data with an actual cost to generate the one or more additional facts; receiving a request from the client for the one or more additional facts; and responding to the request for the one or more additional facts with the one or more additional facts.

9036815

13487198

1. An echo cancellation system, comprising: a speaker, for outputting a acoustic signal, which is represented as x(n); a microphone, for receiving an input audio signal, which is represented as d(n); a convergence statistic generator, receiving the input audio signal, the acoustic signal and a error signal, for generating a convergence parameter; a variable step-size generator, receiving the error signal and the acoustic signal, for generating a step size parameter in accordance the error signal and the acoustic signal; a decision device, receiving the convergence parameter and the step size parameter to output a adjusted step size parameter, wherein the adjusted step size parameter is equal to a boundary value when the convergence parameter is greater than a convergence threshold, wherein the adjusted step size parameter is equal to the step size parameter when the convergence parameter is smaller than the convergence threshold; an adaptive weight control unit, receiving the acoustic signal, the adjusted step size parameter and the error signal to generate a coefficient vector; a transversal filter, receiving the acoustic signal and the coefficient vector to generate an echo cancellation signal; and an error signal generator, receiving the input audio signal and the echo cancellation signal to generate the error signal in accordance with the difference between the input audio signal and the echoless output signal; wherein the variable step-size generator comprises: an error power computing unit, receiving the error signal, for calculating an energy of the error signal, and generating an error power signal, which is represented as {circumflex over (σ)} e 2 (n), wherein n is a time index; wherein the error signal is represented as e(n), the calculation of the error power signal {circumflex over (σ)} e 2 (n) comprises: {circumflex over (σ)} e 2 ( n )=α{circumflex over (σ)} e 2 ( n− 1)+(1−α) e 2 ( n ), wherein, α is a smoothing factor; wherein the input audio signal comprises a noise signal, the variable step-size generator comprises: a noise power estimator, receiving the error signal and the acoustic signal for estimating the noise signal and calculating an energy of the noise signal to output a noise power signal, which is represented as {circumflex over (σ)} v 2 (n); wherein the step size parameter represents μ(n+1), wherein n is time index, and the variable step-size generator comprises: a first multiplier, for multiplying the error power signal {circumflex over (σ)} e 2 (n) and (1−α) to obtain (1−α){circumflex over (σ)} e 2 ; a second multiplier, for multiplying the noise power signal {circumflex over (σ)} v 2 (n) and β to obtain β{circumflex over (σ)} v 2 ; a divider, for dividing (1−α){circumflex over (σ)} e 2 (n) by β{circumflex over (σ)} v 2 (n) to obtain (1−α){circumflex over (σ)} e 2 (n)/β{circumflex over (σ)} v 2 (n); a delay element, for delaying the adjusted step size parameter μ(n+1) a unit of time to obtain μ(n); a third multiplier, for multiplying the μ(n) and α to obtain αμ(n); an adder, for adding (1−α){circumflex over (σ)} e 2 (n)/β{circumflex over (σ)} v 2 (n) and αμ(n) to obtain the step size parameter μ(n+1), which is represented as: μ( n+ 1)=αμ( n )+(1−α){circumflex over (σ)} e 2 ( n )/β{circumflex over (σ)} v 2 ( n ), wherein n is time index, α is forgetting factor, β is beta parameter, wherein β>0.

9751212

15147901

1. A computer-implemented method for executing a handover action, the method comprising: receiving, using one or more computer processors, sensor data from one or more sensors coupled to a robot unit, the sensor data describing one or more of surroundings of the robot unit and an object manipulated by the robot unit; calculating, using the one or more computer processors, a probability of a perceptual classification related to one or more of the robot unit, a human action, an environment, an electro-mechanical state based on the sensor data; calculating, using the one or more computer processors, an affordance based on the probability of the perceptual classification using a preference model; determining, using the one or more computer processors, a handover action based on the affordance; executing, using the one or more computer processors, the handover action; and updating, using the one or more computer processors, the preference model based on feedback.

20030194710

10121240

1. A method for making a substantially molecularly smooth attachment surface, comprising the steps of: providing a substrate that is smooth to within about 10 atomic diameters of the substrate material; applying an attachment material to the smooth substrate; and etching away at least a portion of the substrate to reveal a smooth matching surface of the attachment material.

8370527

12139197

1. A method of control of collaborative devices by a service gateway, the method comprising: providing at least two collaborative devices, each collaborative device comprising a client device and an embedded Java server, each collaborative device coupled for data communications to the service gateway; providing a registry service in the service gateway to which the collaborative devices are also coupled for data communications; providing in the service gateway at least one registry table, the registry table comprising registry records, each registry record representing a capability of a collaborative device, the registry records comprising data elements describing, for each collaborative device, capabilities, tertiary relationships, and network connectivities; providing in the service gateway a service bundle of OSGI-compliant Java servlets comprising at least one predetermined algorithm for controlling the collaborative devices, each predetermined algorithm dedicated to a particular tertiary relationship; and controlling by the service gateway the collaborative devices in accordance with the predetermined algorithm, wherein controlling the collaborative devices in accordance with the predetermined algorithm further comprises: finding a registry record bearing a set point for the particular tertiary relationship; reading from a client device a sensor value of the particular tertiary relationship; comparing the set point and the sensor value, wherein the comparing produces a comparison result; finding, in dependence upon the comparison result, a registry record having an identified capability appropriate to the comparison result for the particular tertiary relationship; and effecting through a client device the capability identified in the found registry record.

20040225861

10429942

1. A method for generating sequences of memory addresses for a memory buffer having N*M locations, the method comprising: making a first address and a last address of every sequence respectively equal to 0 and to N*M−1; assigning a first sequence of addresses; each address but the last address of another sequence of addresses being generated by multiplying a corresponding address of a previous sequence by N, and performing a modular reduction of this product with respect to N*M−1; calculating a greatest bit length of every address and calculating an auxiliary constant as the modular reduction with respect to N*M−1 of the power of two raised to twice the greatest bit length; and performing for each sequence of addresses the operations of storing an auxiliary parameter equal to an N&plus;1 th address of the current sequence, computing a first factor as the modular product with respect to N*M−1 of the auxiliary constant based upon a ratio between the auxiliary parameter and the power of two raised to the greatest bit length, and generating all addresses but the last of a sequence by performing the Montgomery algorithm using the first factor and an address index varying from 0 to N*M−2 as factors of the Montgomery algorithm, and with the quantity N*M−1 as modulus of the Montgomery algorithm, and the greatest bit length as the number of iterations of the Montgomery algorithm.

20050010571

10495495

1. A method of adjusting one or more policies on a communication network comprising; ranking a set of network users for a given interval of time based on each user's score graph and producing a set of network policies correlated to the ranking.

7664484

11148849

1. A method for pooling telecommunication users to reduce telecommunication service costs, the method comprising: ranking a plurality of telecommunication users in an order based on service time usage per month; pooling the telecommunication users into first and second groups such that the first group includes the highest ranked telecommunication user and the second group includes the remaining telecommunication users; averaging the service time usage for the telecommunication users in each group to obtain a service time usage average for each group; selecting, for each group, a cost-effective rate plan from a number of available rate plans, the cost-effective rate plan selected on the basis of the service time usage average; applying the service time usage average to the selected rate plan for each telecommunication user in the respective group to obtain an estimated cost for each telecommunication user; mathematically combining the estimated costs for each telecommunication user to obtain a total estimated cost; moving the highest ranked telecommunication user in the second group to the first group; repeating the averaging, selecting, applying, combining, and moving until only one telecommunication user remains in the second group; and determining one or more of the most cost-effective pooling combinations and corresponding rate plans based on the respective total estimated costs.

8229726

11544341

1. A computer system for performing application-level analysis of simulated hardware on a processor of the computer system, comprising: a hardware simulator, wherein the hardware simulator is capable of executing software on the simulated hardware and intercepting interactions between the software and the simulated hardware; and a framework, wherein the framework includes a plurality of analysis modules arranged in a multi-level configuration through which a data stream of one or more data entities corresponding to the interactions between the software and the simulated hardware travels and is processed at each level of the multi-level configuration, the multi-level configuration of the plurality of analysis modules defining an analysis tree with nodes, wherein a root node of the analysis tree is represented by a parent analysis module and each node originating from the root node is represented by a child analysis module, the analysis tree providing hierarchical analysis of data stream, wherein the framework allows dynamic reconfiguration of the plurality of analysis modules within the analysis tree as the one or more data entities travel through the framework, the one or more of the plurality of analysis modules within the analysis tree configured to dynamically filter the data stream by dividing the data stream into a plurality of data sub-streams, wherein each data sub-stream is directed to a respective analysis module for processing based on one or more characteristics associated with the data sub-streams, the one or more of the plurality of analysis modules further configured to dynamically perform one or more of classification, annotation or transformation of the one or more of the plurality of data sub-streams during execution of the software, wherein each of the plurality of analysis modules is dynamically interchangeable to generate a reconfigured framework, the dynamic interchanging includes dynamic cloning of the child analysis module corresponding to a particular analysis module within the analysis tree upon detection of a new source code function, the reconfigured framework updated with the cloned child analysis module is used in performing different types and depths of analysis.

20030023413

09790247

1. A method for modeling a system, comprising the steps of: configuring a metamodel with a specified environment in a directed weighted multi-graph representation; validating said metamodel; representing a user-generated model; and checking compatibility of said user model with said validated metamodel.

20090116438

12261297

1. An apparatus operable in a wireless wideband communication system, the apparatus comprising: a processor configured for arbitrarily selecting a prospective time horizon, generating an aspirational optimal target bandwidth allocation based at least in part on a plurality of flows observed by the apparatus, and utilizing the aspirational optimal target bandwidth allocation to at least one of assign flows to users to an entirety of the flows or to allocate flows to users over the prospective time horizon; and a memory coupled to the processor for persisting data.

9130839

11171925

1. A system that synchronizes a plurality of network performance tests via a network performance test pattern, wherein the system is configured to: generate an estimated traffic load calculated based on a test traffic amount produced from at least one network performance test of the plurality of network performance tests expected to be executed, by a first collection device of a plurality of collection devices, on a first link of the first collection device, where the first link is one of a plurality of logical links that interconnect to the plurality of collection devices; generate the network performance test pattern based on the estimated traffic load; and send a trigger message according to the network performance test pattern to the first collection device to execute the at least one network performance test of the plurality of network performance tests, wherein the network performance test pattern identifies the plurality of collection devices in a sequence and instructs the system to send the trigger message to a pair of collection devices according to the sequence.

8112742

12177711

1. A method of using synthetic data values to debug a transformation rule of a data integration application so that the synthetic data values may be reused to debug other transformation rules in the same data integration application and to debug transformation rules in other data integration applications, wherein the synthetic data values are artificial data values used to test functionality and mask actual production data values, the method comprising: a. receiving a specification for a first data integration application, in which the specification includes: extraction rules to extract production data from a data repository, transformation rules to operate on said extracted data to create transformed data, and storage rules to store the transformed data into a data repository, wherein each of said transformation rules specifies semantic identifiers as inputs, and wherein said semantic identifiers have names that indicate the meaning of said inputs, and wherein the semantic identifiers represent production data having names that may differ from the names of the semantic identifiers; b. receiving synthetic data values to use as test values for at least some of the inputs of at least some of the transformation rules, in order to test the functionality of said at least some of the transformation rules; c. associating in a persistent data store the synthetic data values with the semantic identifiers associated with said at least some of the inputs; d. determining whether a specification for a second data integration application includes transformation rules specifying at least some semantic identifiers that are associated with synthetic data values in the persistent data store and, if so, recalling the synthetic data values associated with said at least some semantic identifiers; and e. using at least some of the recalled synthetic data values as test values for testing said transformation rules included in the specification for the second data integration application; f. such that synthetic data values used to test a first data integration application may be reused by a developer to test a second data integration application, even if the second data integration application specifies different transformation rules and data repositories.

20120041948

13282160

1. A method of evaluating a rules-driven processing of data by a data processing system comprising steps of creating a first set of data files simulating a variety of content types having predetermined classifications under a set of rules, seeding the first set of data files having predetermined classifications among a second set of data files that do not have predetermined classifications under the same set of rules into an electronic Enterprise Content Management system including both a physical storage layer and a workflow layer for processing the seeded first and second sets of data files, performing a data mining operation within the electronic Enterprise Content Management system for classifying the seeded first and second sets of data files according to the set of rules, and comparing the classifications of the first set of data files performed by the data mining operation with their predetermined classifications, and scoring results of the comparisons for evaluating the performance of the data mining operation.

5521814

08324863

1. A system for optimizing and controlling a process comprising: (a) means for obtaining and receiving data, on-line and in real-time, representing the levels of a plurality of independent input variables of said process and the levels of at least one dependent output variable of said process; (b) means for storing said data; (c) means for determining the interrelationships among said plurality of independent input variables and the relationships between said plurality of independent variables and said at least one dependent output variable; (d) means for generating a plot of said level of a selected one of said at least one dependent output variables at incremental levels of a selected one of said plurality of input variables over a pre-selected range of levels of said selected one of said plurality of said independent input variables; (e) means for providing data representing at least one objective for said system relating to said at least one dependent output variable; (f) means for obtaining a calculated level of a selected one of said plurality of independent input variables to meet said objective by determining the maximum or minimum level of said plot; (g) means for moving said selected one of said plurality of independent variables to said calculated level; and (h) means for obtaining a calculated level for each of said plurality of independent variables in turn and for iteratively moving each of said plurality of independent variables to said respective calculated level.

20140316749

14092238

1. A method of designing an exhaust assembly, comprising the steps: developing an initial exhaust assembly design; evaluating the initial design based on a design guide; developing an interim exhaust assembly design based on the initial design and a parametric model; evaluating the interim design using a computational fluid dynamics model; and developing a final exhaust assembly design based on the parametric and the fluid dynamics models.

9454641

14341017

1. A method, comprising: obtaining a raw spatio-temporal dataset acquired from scanning a brain of a subject performing a given task; constructing a full spatio-temporal model using the raw spatio-temporal dataset, wherein the full spatio-temporal model represents brain activity that occurs in all regions of the subject's brain in response to the subject performing the given task; selecting model parameters from the full spatio-temporal model which meet or exceed a threshold parameter that defines a level of causal relation between voxels in the obtained dataset, wherein the threshold parameter is based on a prediction power threshold value that specifies a threshold for which brain activity in a given voxel predicts brain activity in another voxel; generating a reduced model representation of the full spatio-temporal model using the selected model parameters; storing the reduced model of the full spatio-temporal model in a data storage system; and utilizing the reduced model of the full spatio-temporal model to predict future brain activity of the subject by performing a process comprising: accessing the reduced model of the full spatio-temporal model from the data storage system; obtaining scan data representing a current estimate of brain activity of the subject performing the given task at an initial time T 0 ; utilizing the obtained scan data to initialize the reduced model of the spatio-temporal model with the current estimate of the brain activity at the initial time T 0 ; and utilizing model parameters of the initialized reduced model of the spatio-temporal model to predict future brain activity of the subject at one or more times subsequent to the initial time To without having to utilize scan data of current activity of the subject for the one or more times subsequent to the initial time T 0 ; wherein the method is performed by a computer executing program code.

20120143591

12957394

1. A computer-implemented training system for speech translation, comprising: a discriminative training component derived from a decision rule of a speech translation component, the speech translation component recognizes speech input using a recognition process and translates a recognition output to multiple hypotheses as translation output using a machine translation process, the discriminative training component includes an objective function that integrates the recognition process and the machine translation process; and a processor that executes computer-executable instructions associated with at least the training component.

20080021576

11697650

1. A method of analyzing large scale survey results comprising: obtaining a sparse data set representing a subset of an original data set comprising a plurality of individuals' responses to a plurality of questions, wherein the sparse data set comprises less than ninety percent of the responses in the original data set; analyzing the sparse data set using a general diagnostic model; and obtaining estimated person parameters using the general diagnostic model.

9228234

14080656

1. A method for determining the number of copies of a chromosome or chromosome segment of interest in the genome of a gestating fetus, the method comprising: measuring genetic data at a plurality of loci on at least one chromosome that is expected to be disomic in both the mother and the fetus in a mixed sample of DNA comprising fetal DNA and maternal DNA; determining a ratio of fetal to maternal DNA in the mixed sample from the measured genetic data at the plurality of loci on the at least one chromosome that is expected to be disomic in both the mother and the fetus; measuring genetic data at a plurality of loci on a chromosome or chromosome segment of interest in the mixed sample of DNA; creating one or more hypotheses specifying the number of copies of the chromosome or chromosome segment of interest in the genome of the fetus; determining, on a computer, the probability of each of the hypotheses using the measured genetic data for the chromosome or chromosome segment of interest and the ratio of fetal to maternal DNA; and selecting the hypothesis with the greatest probability, thereby determining the number of copies of the chromosome or chromosome segment of interest in the genome of the fetus.

20090106172

11873440

1. A system implemented on a machine that determines a number of non-spurious arcs associated with a learned graphical model, comprising: a component that receives or obtains from an interface a dataset and a learning algorithm, the component utilizes the learning algorithm and the dataset to generate the learned graphical model and a plurality of graphical models associated with null distribution datasets, the component enumerates a number of arcs confederated with each of the graphical models associated with the null distribution datasets and based at least in part on the enumerated number of arcs determines an average number of arcs affiliated with the graphical models associated with null distribution datasets, the component determines a total number of arcs associated with the learned graphical model, the average number of arcs associated with the null distribution datasets and the total number of arcs associated with the learned graphical model output as the number of non-spurious arcs associated with the learned graphical model.

20120052473

13215462

1. A learning apparatus comprising: a learning sample storage unit configured to store therein a plurality of learning samples that are classified into a plurality of categories; a selecting unit configured to perform, plural times, a selection process of selecting a plurality of groups each including one or more learning samples from the learning sample storage unit; and a learning unit configured to learn a classification metric for classifying the plurality of groups selected in each selection process and generate an evaluation metric including the learned classification metrics.

20140317608

14248500

1. A computer implemented method of optimizing a binary code in a language having access to a binary coded decimal (hereinafter referred to as BCD) variable by converting a BCD operation to a decimal floating point (hereinafter referred to as DFP) operation, the method comprising: generating a first compiler expression of the binary code; analyzing a use-definition chain and/or a definition-use chain for the first compiler expression; generating a second compiler expression by identifying logical BCD variables in the first compiler expression based on a result of the analysis; assigning temporary variables to the identified logical BCD variables, wherein the second compiler expression includes packed decimal operations and the assigned temporary variables; and converting at least one of the packed decimal operations in the second compiler expression and at least one of the assigned temporary variables to the DFP operation if sign information and precision information are not lost by the conversion from the BCD operation to the DFP operation, wherein identifying logical BCD variables in the first compiler expression based the result of the analysis includes, in the use-definition and/or definition-use chains of operands in the first compiler expression, regarding an operand of definition (def) and an operand of use (use) as the same logical BCD variables.

6124864

08948721

1. A method for developing a scene model from a visual image sequence containing a sequence of visual image frames, the visual image sequence including a visual representation of one or more visual objects, the method comprising the steps of: (a) analyzing portions of the visual image sequence in accordance with input parameters using a machine vision process by performing the steps of: (i) defining an image-based data object in an image-based model of the visual image sequence containing a pixel representation corresponding to a portion of at least one frame of the visual image sequence; (ii) defining an abstraction-based data object in an abstraction-based model of the visual objects containing an abstract representation of at least a portion of one of the visual objects represented by the visual image sequence; and (iii) storing a link data object in a correlation mesh data structure indicating a correspondence between the image-based data object and the abstraction-based data object; (b) refining an abstraction-based model of the visual imago sequence by performing the steps of: (i) accepting input parameters to define in the abstraction-based model of the visual objects a new abstraction-based data object containing a new abstract representation of at least a portion of one of the visual objects contained in the visual image sequence that differs from the abstract representations contained in abstraction-based objects defined in the analysis step (a); and (ii) adding a link object in the correlation mesh data structure indicating a correspondence between the new abstraction-based data object and another data object defined in the scene model; and (c) iteratively improving the scene model by performing certain selected ones of steps (a) through (b) in an order as specified by user input until a desired level of refinement is obtained in the scene model such that selected link objects in the correlation mesh data structure added in iterations of the refining step (b) are used to provide additional input parameters to subsequent iterations thereby allowing the scene model to converge.

20060253265

11256304

1. A gas formation calculation system, comprising: a computer processing device for calculating a formation of free gas within the body of a diver.

20090296648

12344380

1. A method, comprising: operating a receiver connected with n r receive antennas to receive uplink signals from K users having n t transmit antennas each; and scheduling which users are to transmit in a same time-frequency-code slot, where a particular user pairing configuration is denoted by π within a set of all configurations Π, and where scheduling comprises expressing mutual information as an additive objective function and maximizing the additive objective function over a particular choice of πεΠ.

8255208

13216111

1. A method of merging entropy codebook application ranges within an audio signal, comprising: obtaining an audio signal that includes quantization indexes, identification of segments of said quantization indexes, and indexes of entropy codebooks that have been assigned to said segments, with a single entropy codebook index having been assigned to each said segment; identifying potential merging operations in which specified segments potentially would be merged with each other; estimating bit penalties for the potential merging operations; and performing the potential merging operation having the lowest estimated bit penalty.

20110218786

13110286

1. A computer-implemented method for dynamic performance modeling of computer application services comprising the steps of: abstracting, using a computer system, behavior of a service to three phases: serial, parallel and dormant, thus yielding a Serial Parallel Queueing Network (SPQN) model with a small number of parameters; estimating, using a computer system, the parameters of the model based on stochastic approximation techniques for solving stochastic optimization problems to capture periodic behavior of the service; and using the periodic behavior of the service for performance prediction and computer resource management of the service.

5506774

08233255

1. A navigation apparatus, equipped in a movable body, comprising: a position measuring means for measuring a self-position of the movable body; an input means for inputting a destination position; a displaying means for displaying a present position, which is measured by said position measuring means, and an optimum course from the present position to the destination position; a memory means for storing map information including course data beforehand; and an optimum course searching means coupled to said memory means and said displaying means, for selecting points, at which a course is bent and not selecting points at which the course is straight, from among points on various courses from the present position to the destination position as objective points for optimization by use of the map information stored in said memory means, evaluating said bent courses between the selected objective points without evaluating the straight courses from among the non-selected points and searching the optimum course by selecting a course, which evaluation is the best one among the evaluated various courses, as the optimum course.

20070027786

11543599

1. A method for calculating the financial status of a company, comprising the steps of: calculating the company's value in accordance with the formula dV V = ( r + λ ) ⁢ dt + σ ⁢ ⁢ dW - dN wherein V is the value of the company, r is the risk neutral rate, λ is the intensity of jump arrivals, σ is the company's volatility, N) is the standard Poisson process, W is the standard Wiener process, and t is a time between 0 and T, the maturity of the debt; and using the company value to calculate a financial metric for the company.

7653510

12056020

1. A load calculating device comprising: a variable acquiring unit configured to acquire, as monitoring variables, a detected value by a sensor monitoring a state of a circuit board and a performance characteristic obtained by a tool monitoring performance of the circuit board, wherein one or more electronic components are mounted on the circuit board; a first storage configured to store a first statistical model that is one of; a regression model determining an intermediate variable from the monitoring variables, an occurrence frequency distribution relating to the monitoring variables and the intermediate variable, and a probability distribution relating to the monitoring variables and the intermediate variable; a second storage configured to store, for at least one place on the circuit board, a second statistical model that is one of: a regression model determining a physical quantity from the intermediate variable, an occurrence frequency distribution relating to the intermediate variable and the physical quantity, and a probability distribution relating to the intermediate variable and the physical quantity; and an arithmetic processor configured to calculate the intermediate variable from the monitoring variables acquired by the variable acquiring unit according to the first statistical model and calculate the physical quantity on the at least one place from the calculated intermediate variable according to the second statistical model, wherein the intermediate variable is a variable which expresses a different physical quantity than the physical quantity calculated according to the second statistical model and is not monitored by the monitor or the tool.

7996340

11959697

1. A computer-implemented workforce analysis method for solving L1-based clustering problem of multinomial distributions of workforce data, the method comprising the steps of: acquiring workforce allocation data; arranging the workforce allocation data in sets of fraction data with respect to the L1 distances; clustering the sets of fraction data t corresponding set of cluster centers, or L1 distances for each set; minimizing the sets of fraction data based on the cluster centers or L1 distances; and outputting analysis results of the clustering problem; wherein the steps are executed by a processor.

20110314000

12818237

1. A method for transformation rule profiling for a query optimizer, comprising: obtaining a database query configured to be optimized by the query optimizer of a database system; finding an optimized query plan for the database query using a host set of transformation rules; removing individual transformation rules from a query plan generation, wherein one transformation rule is removed and checked at a time; generating a test query plan after one transformation rule has been removed; determining whether the test query plan is different than the optimized query plan in the absence of the removed transformation rule; and creating an equivalent set of transformation rules that includes transformation rules where the test query plan generated from the equivalent set of transformation rules is equivalent to the optimized plan.

8700541

13364829

1. A modeling method of neuro-fuzzy system, comprising: a rule-defining process dividing a plurality of training data into a plurality of groups to accordingly define a plurality of fuzzy rules; and a network-building process constructing a fuzzy neural network based on the fuzzy rules obtained by the rule-defining process; wherein the rule-defining process further comprises a sub-process (a) retrieving an input-output pair of the training data, a sub-process (b) determines whether any fuzzy rule is built so as to execute a sub-process (c) if no fuzzy rule is built or to execute a sub-process (e) if at least one fuzzy rule has been built, the sub-process (c) defining a fuzzy rule corresponding to the retrieved input-output pair by function approximation, a sub-process (d) determining whether there is any ungrouped input-output pair of the training data so as to execute the network-building process if no ungrouped input-output pair exists or to execute the sub-process (a) otherwise, and the sub-process (e) calculating an input similarity value and an output difference value between the retrieved input-output pair and a respect fuzzy rule for each one of the fuzzy rules, determining whether the input similarity value of a respect fuzzy rule is larger than or equal to a similarity threshold value as well as the output difference value of this fuzzy rule is smaller than or equal to a difference threshold value, assigning the retrieved input-output pair into a group corresponding to one of the fuzzy rules and then renewing coefficients of this fuzzy rule if any fuzzy rule has an input similarity value not smaller than the similarity threshold value as well as the output difference value thereof is not larger than the difference threshold value or executing the sub-process (c) otherwise, wherein the fuzzy rule corresponding to the group including the retrieved input-output pair has a largest input similarity value.

9286524

14687820

1. A computing device comprising: one or more processors for controlling operations of the computing device; and a memory storing data and program instructions used by the one or more processors, wherein the one or more processors are configured to execute instructions stored in the memory to: receive an image of a vehicle environment; process the image using a convolutional neural network including at least one convolutional layer, at least one max-pooling layer, and at least one fully connected layer; calculate a prediction regarding whether the image contains a traffic lane marking segment based on outputs generated by the convolutional neural network; calculate geometric characteristics of the traffic lane marking segment based on the outputs generated by the convolutional neural network; and train the convolutional neural network based on the geometric characteristics of the traffic lane marking segment only if the prediction is that the image contains the traffic lane marking segment.

7967293

12215724

1. A game set for playing a modified game of poker using dice, the game set comprising: (i) at least one set of “m” number of dice wherein “m” is at least three, each of the dice possessing the same number of sides, an equivalent number of consecutive numerical values with one numerical value per side of each dice, and a suit, wherein each side and numerical value of dice are associated with said suit; wherein the dice in a set contain the same number numerical values, and are of m number of different suits, and not two of the dice having the same suit, said numerical values being regular numerals, Roman numerals or pips; and (ii) a set of instructions describing the rules of the game, wherein the rules comprise: (a) having two or more players draw a hand comprised of “m” number of dice in said set of dice wherein “m” is at least three and the same for all players engaged in a play; (b) comparing each hand to an established ranking system of hands to determine the hand of highest rank; and (c) selecting a winner of a play as the hand of highest rank according to the ranking system of hands; wherein the ranking system of hands ranks suits from highest suit rank to lowest suit rank and associates numerical values with said suit ranks according to a set of rules which provides for at least the following hand ranks: a “royal flush” corresponds to a hand of dice showing a full set of consecutive numerical values wherein the highest numerical value is associated with the suit of highest rank, and consecutively lower numerical values are associated with suits of consecutively lower rank, the suit of lowest rank associated with the lowest consecutive numerical value, and there being only one combination of numerical values constituting the “royal flush”; a “straight flush” corresponds to a hand of dice showing a full set of consecutive numerical values wherein the highest numerical value is associated with said suit of highest rank, and consecutively lower numerical values are associated respectively with said suits of consecutively lower rank in the same manner as found in the royal flush, and the suit of lowest rank associated with the lowest numerical value in the same manner as found in the royal flush, except that at least one numerical value is different from one of the numerical values of the royal flush, and there being multiple combinations of numerical values constituting a straight flush; “nothing” corresponds to a hand of dice, which does not contain a repeat of a number, or a full set of consecutive numbers; wherein the hands in the ranking system of hands are ranked according to the probability of drawing a particular hand, the hand of lowest probability being of highest rank and the hand of highest probability being of lowest rank, except that “royal flush” is always of highest rank and “nothing” is always of lowest rank.

20040267523

10603212

1. A method of assessing speech quality comprising the steps of: determining a first and second speech quality assessment for a first and second speech signal, the first speech signal being a distorted version of the second speech signal; and comparing the first and second speech qualities to obtain a compensated speech quality assessment.

20160197790

15072720

1. A log analysis system comprising: a first processor unit configured to append common information to analysis target information generated by events; the processor unit being configured to make information granularities uniform based on the contents of the analysis target information and the common information to output analysis unit information; and a second processor unit configured to integrate the analysis unit information output from the first processor unit to generate detection target event candidates, the second processor unit being configured to determine whether or not the events have at least one specific quality, the events having generated the analysis target information specified by the detection target event candidates.

20100125477

12618474

1. A system for deploying and managing software services, comprising: a computing environment that includes a plurality of virtualized and non-virtualized machines to which services and applications can be deployed; a plurality of agents, wherein each agent resides on one of the plurality of virtualized and non-virtualized machines in the computing environment and can be used to manage the software processes and resources running in the computing environment and can also render the resources as a resource pool; a rules engine that: compares administrator defined constraints with runtime metrics, wherein a constraint of the administrator defined constraints is a user defined service level agreement (SLA) that is captured by a metric or state that is derived from meta data or metrics and the runtime metrics are provided to the rules engine by a monitor service; generates events when a constraint is violated by a metric of the runtime metrics, each event generated by the rules engine carries with it information necessary to handle the event including the scope of a constraint failure that caused the event.

7506324

10934247

1. A computer implemented method for data transformation for a standard data format, comprising: receiving an Extensible Stylesheet Language transformation specification having expressions containing XPath expressions, wherein the Extensible Stylesheet Language transformation specification is received by an Extensible Stylesheet Language transformation specification compiler; invoking an XPath compiler to tokenize and construct a parse tree of the XPath expressions contained in the Extensible Stylesheet Language transformation specification; returning the parse tree from the XPath compiler to the Extensible Stylesheet Language transformation specification compiler; generating a hierarchical transformation object model using schema fragments parsed from a source schema tree associated with the Extensible Stylesheet Language transformation specification, wherein the hierarchical transformation object model provides an object model representation of the XPath expressions contained in the Extensible Stylesheet Language transformation specification; and converting the Extensible Stylesheet Language transformation specification into an application specific transformation document using the hierarchical transformation object model, wherein the application specific transformation document enables execution of the Extensible Stylesheet Language transformation specification within an application specific runtime environment.

7856356

11642132

1. A speech recognition system for a mobile terminal, the system comprising: an acoustic variation channel unit for transforming a speech signal into feature parameters and Viterbi-decoding the speech signal to produce a varied phoneme sequence by using the feature parameters and predetermined models; and a pronunciation variation channel unit for Viterbi-decoding the varied phoneme sequence to produce a word phoneme sequence by using the varied phoneme sequence and a predetermined DHMM (Discrete Hidden Markov Model) based context-dependent error model.

9118754

11549218

1. A method for operating a voice communications network by a voice communications system having a database, comprising: storing on the database in a private public number table a first association between a private number of a user and a plurality of public numbers of a voice communication network, wherein the private number is controlled by the user, and wherein the plurality of public numbers are provided by the voice communications system; creating a second association between a first telephone number with a first public number of said plurality of public numbers; authenticating the user of the private number without reliance on a static reproducible data code; receiving an incoming call to the first public number from the first telephone number of a calling party, and routing the incoming call to the private number; receiving an outgoing call from the private number to an outgoing number, wherein the outgoing number is associated with the voice communications system; validating the outgoing call by identifying the private number and using the identified private number to query the private public number table stored on the database for the first association; upon validation of the outgoing call, receiving from the user of the private number a selection of the first public number from the plurality of public numbers; receiving from the user an input of the first telephone number to call; routing the outgoing call to the first telephone number; transmitting the first public number as calling party information to a communication device associated with the first telephone number; and altering the second association between the first telephone number and the first public number.

20140058991

14010436

1. In an optimizing predictive computation model, a method comprising: selecting model parameters that are expected to take real values within a predetermined range; and iteratively: (a) receiving a set of input values; (b) executing the computation model based on the input values; (c) updating the values of the model parameters to minimize a loss function; and (d) examining each of the model parameters, such that, when an examined model parameter attains a value that is idempotent to the computation model, or passes through such a value during updating, or reaches a forbidden state, removing the examined model parameter and computations involving the examined model parameter from the computation model.

20100019759

12431300

1. An apparatus for detecting a state of an object, comprising: m (m>=1) electromagnetic field generation means provided near a space, the space being occupied by the object when the object is in a particular state; n (n>=1) electric field strength measurement means for identifying and measuring electric field strength which occurs from each of the m electromagnetic field generation means; characteristic extraction means for calculating characteristics from m×n time-series data of the electric field strength; and state identification means for identifying, by statistical processing, the state from the characteristics and characteristic data in each state for learning.

8527998

13569620

1. A method for continuously optimizing data archive management scheduling, said method comprising: receiving inputs, by a processor of a computer system via a job scheduler, from an archive management system, wherein the inputs comprise task information, replica placement data, infrastructure topology data, and resource performance data; said processor modeling a flow network from the received inputs, such that the flow network represents data content, software programs, physical devices, and communication capacity of the archive management system, and such that an optimal path of the flow network from a task of at least one archive management task to a worker program of the archive management system represents an optimal initial schedule for the worker program to perform the task, wherein said modeling comprises creating vertexes organized in multiple levels and creating multiple edges sequentially connecting the vertexes of the multiple levels, wherein the multiple levels consist of N+1 levels denoted as LEVEL 0 , LEVEL 1 ,. .. , LEVEL N , wherein N is at least 2, wherein LEVEL 0 comprises a source vertex, wherein LEVEL 1 comprises at least one task vertex associated with said at least one archive management task, wherein EDGE K is directed from the vertex of LEVEL K-1 to the vertex of LEVEL K for K=1, 2,. .. , N, where EDGE 1 indicates that a first task associated with a first task vertex of LEVEL 1 is scheduled by the job scheduler, and wherein EDGE 1 has a first weight equal to a time unit to perform the first task; said processor computing the optimal initial schedule from the optimal path in the flow network; said processor transferring the computed optimal initial schedule to the archive management system to perform the optimal initial schedule; said processor receiving monitoring results of operations of the transferred optimal initial schedule from the archive management system; said processor creating an adjusted schedule as a result of dynamically adjusting the optimal initial schedule based on the received monitoring results; said processor transferring the adjusted schedule to the archive management system to perform the adjusted schedule such that the archive management system generates new monitoring results of operations of the transferred adjusted schedule; and creating at least one path from the source vertex to a sink vertex in LEVEL N following created edges such that the at least one path represents a respective job schedule for a task in the at least one path by use of at least one storage device volume and at least one computing server in the at least one path to be performed by at least one worker program in the at least one path, wherein the optimal path is a path having a minimum sum of weights of edges in the at least one path.

9092989

13689866

1. A computerized device comprising: a processor; and a user interface operatively connected to said processor, said user interface receiving a question comprising question terms, said processor automatically searching sources of data containing passages to produce candidate answers to said question, said searching being based on said question terms, and said searching identifying passages that support each of said candidate answers based on scoring features that indicate whether said candidate answers are correct answers to said question, said processor automatically creating a scoring feature-specific matrix for each scoring feature of said scoring features, each said scoring feature-specific matrix specifying all different combinations of said passages, said candidate answers, and said question terms as vectors and comprising score fields for score values for each specific question term with respect to a specific passage and a specific candidate answer, and each score field containing a score value corresponding to a vector and indicating how a passage term of said specific passage aligns with said specific question term to support said specific candidate answer as being a correct answer to said question; said processor automatically combining said vectors by calculating a statistical measure of said vectors to produce a collapsed score for each of said question terms, said statistical measure comprising a collapsing function; said processor automatically combining collapsed scores to produce a combined score for each of said candidate answers; and said processor automatically ranking said candidate answers based on each said score value.

20040133352

10291225

1. A method, for evaluating a biological condition of a subject, based on a sample from the subject, comprising: deriving from the sample a profile data set, the profile data set including a plurality of members, each member being a quantitative measure of the amount of a distinct RNA or protein constituent in a panel of constituents selected so that measurement of the constituents enables evaluation of the biological condition; and in deriving the profile data set, achieving such measure for each constituent under measurement conditions that are substantially repeatable.

6015296

08794686

1. An apparatus for generating nonlinear motion, comprising: a rod; an electromagnet positioned in proximity to said rod; at least one magnet slidable upon said rod; and means for controlling the operation of said electromagnet, wherein said controlling means receives periodic input that causes said electromagnet to deflect said at least one magnet in nonlinear motion upon said rod.

9781609

15230678

1. A method, by a processor, for testing a wireless network environment, comprising: selecting a collection of candidate wireless network test locations for testing wireless network communication according to defined constraints, conditions, testing parameters, or a combination thereof; dispatching a mobile wireless access point (WAP) to at least one stationary location from the collection; commanding a mobile receiver to progressively move to each candidate test location along a testing route of the collection; dynamically measuring the testing attributes relating to wireless network communication performance for each of the candidate test locations along the testing route of the collection; and identifying qualified WAP locations from the candidate test locations based on the measured testing attributes.

20150169666

14106103

1. A computer-implemented method to facilitate consistency between a glossary and a repository, wherein the glossary includes one or more terms, wherein the repository includes a plurality of information sets, wherein each information set includes a definition for a respective term and a range of valid values for the respective term, the method comprising: receiving a request to approve a first information set in the repository, wherein the first information set pertains to a first term in the glossary; designating the first information set as an active information set for the first term; receiving a subsequent request to assign the first term in the glossary to a second information set in the repository, wherein the second information set is different from the first information set; and programmatically determining an information set to designate as the active information set for the first term, based on a predefined consistency criterion and by operation of one or more computer processors, wherein the determined information set is selected from a plurality of information sets associated with the first term, the plurality of information sets including the first information set and the second information set.

10091435

15176017

1. A computer-implemented method for image segmentation, comprising: receiving images captured by cameras in a camera array; determining optical flow fields between pairs of the images captured simultaneously by two or more cameras in the camera array; computing one or more pseudo depth maps from the optical flow fields, wherein pseudo depths in each pseudo depth map of the one or more pseudo depth maps indicate relative depths of pixels with respect to other pixels in the pseudo depth map but not actual depth measurements, and wherein at least one of the one or more pseudo depth maps is computed by performing steps including: removing from an associated one of the optical flow fields a global translational component of motion, thereby producing a residual flow field, offsetting the residual flow field by a component-wise minimum of the residual flow field, and normalizing a magnitude of the offset residual flow field to a range; and segmenting one or more of the images based, at least in part, on one or more of the computed pseudo depth maps.

8473486

12962751

1. A method to be executed at least in part in a computing device for training a parser to optimize search operations, the method comprising: receiving a query and a plurality of returned documents with relevance judgments; parsing the query and the documents to obtain parse trees; computing tree edit distances for each query-document pair based on the parse trees; incorporating the tree edit distances to a ranking function employed for ranking the documents for the received query; determining updated parser parameters from the ranking function; and updating the parser with the updated parser parameters in an iterative manner until a predefined threshold is reached.

20070143092

11300973

1. In a computationally based modeling environment, a method of modeling a physical entity, the method comprising: selecting a physical component of the physical entity being modeled, wherein the physical component is defined by at least a structural physical parameter and at least one physical behavior; and defining a model element with the structural physical parameter using at least one structural variable, the model element further defined by the at least one physical behavior; wherein the at least one structural variable is functionally defined.

20160129272

14539802

1. A method to control non-paresthesia stimulation of nervous tissue of a patient, the method comprising: delivering a non-paresthesia stimulation waveform to at least one electrode located proximate to nervous tissue of interest, the non-paresthesia stimulation waveform including a series of pulses configured to excite at least one of A-delta fibers or C-fibers of the nervous tissue of interest, the non-paresthesia stimulation waveform defined by therapy parameters; sensing sensory action potential (SAP) signals from the nervous tissue of interest; analyzing the SAP signals to obtain SAP activity data for at least one of an SAP C-fiber component or an SAP A-delta fiber component; determining whether the SAP activity data satisfies a criteria of interest; and adjusting at least one of the therapy parameters to change the non-paresthesia stimulation waveform when the SAP activity data does not satisfy the criteria of interest.

7738129

11374399

1. A method of choosing jobs to run in a stream based distributed computer system, comprising: determining jobs to be run in a distributed stream-oriented system in accordance with a priority threshold above which jobs will be accepted, below which jobs will be rejected, to maximize projected importance by: using a processor to decide which jobs to run, and which templates among running jobs to choose; allocating appropriate processing power to processing elements in the templates of the running jobs by selecting the template which best utilizes an amount of resources, and produces the most importance to the system; and uniformly overprovisioning the template to react robustly to dynamic changes in importance, jobs, and streams to minimize network utilization among candidate nodes.

9733627

14459024

1. A method for performing management and diagnostic functions in an advanced process control (APC) system, the method comprising: providing a cloud computing system communicatively coupled by a first communication device to at least one APC control computer; said cloud computing system including an APC management computer having a first processor connected to a first storage device having a first non-transitory machine-readable storage medium storing a data collection module, an APC diagnostics module and a step testing module and said APC management computer is programmed to implement said data collection module, said APC diagnostics module and said step testing module causing said APC management computer to execute: retrieving operating process data from said APC control computer including a plurality of APC history data from an APC history file; performing an iterative step test on said APC system, wherein said iterative step test modifies at least one test parameter of said operating process data and identifies changes to a set of remaining parameters of said operating process data resulting from modification of said test parameter; determining at least one process variable from said iterative step test; generating at least one process model based on said process variable; transmitting said process model to said APC control computer; performing a diagnostic testing on said APC history data; generating at least one new process model setting based on said diagnostic testing; displaying said at least one new process model setting; determining if said at least one new process model setting has been approved; and in response to determining that said at least one new process model setting has been approved: transmitting said at least one new process model setting to said APC control computer; and triggering said APC control computer to install said at least one new process model setting.

8364613

13246596

1. A computer-implemented method, comprising: storing a first predictive model in computer-readable memory, the first predictive model having been defined based on a first training dataset provided by an owner of the first predictive model and being operable to generate an output based on a query; enabling access for a user to the first predictive model based on permissions defined by the owner, while inhibiting access for the user to the first training dataset such that the first training dataset is inaccessible to the user; receiving a second training dataset from the user, the second training dataset being distinct from the first training dataset; modifying the first predictive model based on the second training dataset to provide a second predictive model; storing the second predictive model in computer-readable memory; and enabling access for the user to the second predictive model.

7908203

11783250

1. A computer system comprising one or more processors programmed to: (a) receive data describing a trading order; (b) select one or more first trading algorithms from a plurality of available stored algorithms for execution of said trading order; (c) commence execution of said trading order via said one or more first trading algorithms; (d) evaluate quality of execution, during said execution, of said trading order via said one or more first trading algorithms; (e) compare said evaluated quality of execution to a threshold of acceptability based on a prediction of future performance of execution of said trading order by said one or more first trading algorithms; and (f) if said evaluated quality of execution compares unfavorably to said threshold of acceptability, switch said execution of said trading order to one or more second trading algorithms.

7778469

10678935

1. A computer implemented method for discriminatively selecting keyframes representative of segments of a source digital media, comprising the steps of: obtaining said source digital media for which keyframes are to be selected, wherein said source digital media comprises a plurality of segments, wherein said plurality of segments comprises a plurality of frames, said plurality of frames comprising candidate keyframes; pre-processing said source digital media to obtain a plurality of feature vectors, said feature vectors being representative of the candidate keyframes; determining in-class similarity values for said candidate keyframes, wherein the in-class similarity values are determined by comparing the feature vectors for the candidate keyframes to other feature vectors found solely within the same segment the candidate keyframes come from; determining out-of-class similarity values for said candidate keyframes, wherein the out-of-class similarity values are determined by comparing the feature vectors for the candidate keyframes to other feature vectors found solely outside of the segment the candidate keyframes come from; discriminatively selecting a keyframe for each segment based on both the in-class similarity values and the out-of-class similarity values of the candidate keyframes, wherein each selected keyframe is both representative of the segment the selected keyframe originates from and distinguishable from other selected keyframes which are representative of the remaining plurality of segments; wherein the chronological order of the selected keyframes as they appear within the source digital media is maintained during the step of discriminatively selecting a keyframe for each segment; and wherein the method steps are done by at least one processor.

9911088

14267608

1. A computer-implemented process for maximizing task completion rates, comprising: using a computer to perform process actions for: receiving specifications for multiple different tasks, each task having a plurality of task contexts from one or more task publishers; receiving a separate machine-learned predictive worker model for each of a plurality of non-human virtual workers in a worker pool; receiving one or more current contexts for each of the non-human virtual workers in the worker pool; jointly evaluating all of the multiple different tasks, the task contexts, the worker models, and the current contexts to construct a plurality of optimized bundles of one or more of the multiple different tasks, the plurality of bundles together including all of the multiple different tasks; the joint evaluation further comprising formulating the combination of the multiple different tasks, the task contexts, the worker models, and the current contexts as a submodular and monotonic objective function and solving that objective function as a constrained optimization problem to compute a single predicted task completion rate that covers all of the multiple different tasks; and automatically recommending each of the bundles to particular non-human virtual workers from the worker pool, such that the single predicted task completion rate over all of the multiple different tasks is maximized by the bundle construction and task recommendation.

9476977

14294580

1. A meteorological observation system using vehicles, comprising: a vehicle; a meteorological observation device embedded in the vehicle and configured to periodically detect weather information and to photograph scenes around the vehicle; a meteorological server configured to collect the weather information from the meteorological observation device in the vehicle in an area corresponding to the meteorological server through wireless communication and to provide the weather information to a meteorological observation center, the meteorological observation center configured to receive the weather information from the meteorological server; wherein the meteorological observation device comprises: a sensor unit configured to detect temperature, humidity, wind speed, a direction of wind around the vehicle; a radar unit configured to output an output signal of a specific frequency toward front or right and left sides of the vehicle and to collect a reflected signal which is made after the output signal collides against an object around the vehicle in order to measure a distance between the vehicle and the object; a control unit configured to estimate an amount of rainfall or an amount of snow fall by using a loss characteristic of radar signals including the output signal and the reflected signal; a photographing unit configured to photograph the scenes around the vehicle and to generate image information corresponding to the scenes; a memory unit configured to store the weather information including the temperature, the humidity, the wind direction of wind around the vehicle detected by the sensor unit and the amount of rainfall or the amount of snow fall estimated by the control unit and the image information generated by the photographing unit; and a communication unit configured to send the weather information stored in the memory unit to the meteorological server.

8923608

13783581

1. A computer-implemented method for evaluating training data comprising: receiving training data comprising a labeled training set of digital objects, at least some of the digital objects in the labeled training set including a label indicating that the digital object is positive for a respective class selected from a predetermined set of classes with which a classifier is to be trained; grouping the positively labeled digital objects in the labeled training set into positive label groups, one positive label group for each class in the set of classes, each label group comprising digital objects having a label indicating the digital object is positive for the respective class; with a trained categorizer, assigning a score vector to each digital object in the labeled training set of digital objects, the score vector comprising a score for each category of a predetermined set of categories; applying at least one heuristic to the training data to evaluate the training data for training the classifier based on the assigned score vectors and training data labels; and based on the at least one heuristic, providing an evaluation of the training data prior to training the classifier.

20180089525

15279979

1. A method implemented on a computer for segmenting an input image into line segments and word segments, the input image being a binary image containing text, the method comprising: (a) horizontally down sampling the input image using a first down-sampling ratio; (b) detecting connected regions in the down-sampled image obtained in step (a); (c) identifying horizontally neighboring connected regions that belong to same lines to form line lists containing such horizontally neighboring connected regions; (d) segmenting the input image into a plurality of line segments, each line segment being a region of the input image that corresponds to a bounding box in the down-sampled image containing all connected regions in a corresponding line lists obtained in step (c); and for each of the line segments obtained in step (d), (e) horizontally down sampling the line segment using a second down-sampling ratio; (f) detecting connected regions in the down-sampled line segment obtained in step (e); and (g) segmenting the line segment obtained from step (d) into word segments using the connected regions obtained in step (f), wherein the second down-sampling ratio is smaller than the first down-sampling ratio.

8639551

11496948

1. A method for workforce related resource planning, comprising: receiving, by a computer system, workforce related resource data associated with a planning horizon having a plurality of time periods, wherein the workforce related resource data includes demand data and supply data; and creating, by the computer system, a probability distribution of a workforce gap between the demand data and the supply data for each of the time periods to quantify risks associated with the workforce related resource planning, wherein the probability distribution of the workforce gap is based on a probability distribution of demand calculated from: a probability distribution of workforce requirements during a given period based on probabilities of workforce required by corresponding project opportunities and probabilities of winning the corresponding project opportunities; and a probability distribution of workforce replacement requirements based on a distribution of workforce assigned to projects and a probability of attrition of workforce assigned to the projects.

8712742

13176288

1. A method, comprising: providing by a device for establishing a model W for emulating a physical quantity P which depends on at least one input parameter x, defining by the device a set X comprising N distinct parameter values x_i for said at least one input parameter x, N being an integer greater than or equal to 1, measuring by the device a first measuring of the physical quantity P, Pm 1 for each of the N distinct parameter values x_i of the at least one input parameter x, while keeping all other input parameters fixed, constructing by the device a Vandermonde matrix VM using said set of N parameter values x_i of said at least one input parameter x, and computing by the device the model W for emulating the physical quantity P based on the Vandermonde matrix and the first measured physical quantity Pm 1 according to the equation W=(VM T *VM) −1 *VM T *Pm 1 .

7996347

12098057

1. A method, comprising: generating a plurality of information technology solution alternatives for an enterprise organization; evaluating the plurality of information technology solution alternatives within an automated architectural framework based upon at least one information technology evaluation metric; creating an automated incremental solution deployment strategy based upon the evaluated plurality of information technology solution alternatives; and selecting an information technology solution from the plurality of information technology solution alternatives for deployment based upon the automated incremental solution deployment strategy.

20120092169

13378937

1. A method for determining fall risk instability for a specific individual comprising: measuring data from sensors located in the shoes of an individual in motion; analyzing the measured data to determine trends in the data; analyzing the measured data to determine variances in the trends; and determining fall risk instability based on the determined variances.

20100315290

12485409

1. A method for determining a geolocation of a non-cooperative target, the method comprising: a) acquiring with at least one collector one or more actual signal measurements corresponding to a signal emitted from an emitter on the target, wherein the one or more signal measurements include at least one of a direction of arrival, a target range, a time difference of arrival, a range rate, a range sum, and a frequency difference of arrival; b) receiving with a processing device the actual signal measurements and navigational data regarding the collector; c) calculating an estimated target location of the non-cooperative target with the processing device as a solution to a non-linear optimization problem using a globally convergent optimization algorithm, wherein an objective function to be minimized is a weighted sum-of-squares of differences between the actual signal measurements and calculated values corresponding to signal measurements that theoretically should be produced for a particular target location; and d) outputting the estimated target location to a display configured to display the estimated target location or to another electronic device.

20030144229

10194035

1. An oligodeoxynucleotide composition comprising at least two oligodeoxynucleotides of at least about 10 nucleotides in length, wherein the oligodeoxynucleotides comprise an unmethylated CpG motif, and wherein the oligodeoxynucleotides comprises a sequence represented by the formula 5′ N 1 N 2 N 3 T-CpG-WN 4 N 5 N 6 3′, wherein W is A or T, and N 1, N 2, N 3, N 4, N 5, and N 6 are any nucleotide; and wherein the at least two different oligodeoxynucleotides differ in their nucleic acid sequence.

20110289078

13113031

1. A method to convert spontaneous, subjective responses of network respondents into statistical opinion data, comprising: a computer communications network comprising at least one uniform resource identifier comprising at least one subject, and at least one respondent able to input at least one subjective response regarding at least one said subject; at least one computer controlled survey form delivered to said respondent requesting to respond to said subject, wherein said survey form comprises at least one fixed vocabulary question answered using an answer mechanism to select a response from one or more answer choices, and a function allowing said respondent to save changes to said survey form; said survey form further comprising: generalized phrasing of said fixed vocabulary question enabling relation to any said subject, said answer choices each comprising one pair of antonyms, each said antonym consisting of a word of definite character naming an unambiguous human value, belief, opinion, feeling, emotion, or judgment, and said answer mechanism is utilized to indicate one said antonym as said response, wherein more than one said answer choice may be responded to by said respondent per said survey; conversion of said subjective responses into mathematical values, comprising: said antonym pair further comprising the assignment of mathematical value negative X to one said antonym and the assignment of mathematical value positive X to the opposing antonym, said answer mechanism providing for scaled indication of said response anywhere within the continuum between said mathematical values, at least one said indication and utilization of said function to save changes to said survey form creating a converted response comprising at least one mathematical value associated with one said antonym relating to one said subject, wherein no use of said answer mechanism results in a value of 0 assigned to all said antonyms and does not produce a converted response; and at least one information processing system to deliver said survey form to said respondent, receive said converted response data, and assign identifiers to elements involved in said converted response for conductivity to database processing and delivery of outputs, said outputs comprising statistical opinion data regarding said subjects on said network.

20090150319

11950670

1. A method of monitoring, aggregating, and correlating business events in real time and processing results, wherein event processing is a function of event density, comprising: (a) receiving historical values by an analytic model, wherein said historical values are based on a plurality of keys and a plurality of data fields; (b) applying a plurality of rules to a plurality of said historical values, wherein each of said rules may be associated with one or more actions to be performed; (c) executing actions associated with said rules, wherein the actions include at least updating data; (d) determining whether more rules are to be applied; and (e) repeating steps (b)-(d) if it is determined that more rules need to be applied; and (f) storing said updated data in a monitor database.

20040034838

10623067

1. A method of generating a set of test patterns for one of simulating and testing a layout of an integrated circuit, the method which comprises the steps of: (a) generating a set of test patterns on a random basis; (b) applying the set of test patterns to an integrated circuit by using an automatic test equipment; (c) determining outputs of the integrated circuit; (d) processing the outputs in order to determine whether given test criteria are met; and (e) depending on a determination result in step (d), generating a new set of test patterns based on the set of test patterns generated in step (a) by using a genetic algorithm.

7895008

12049565

1. A method of performing measurement sampling in a production process, the method comprising: passing a lot through at least one tool in a manufacturing process; processing the lot at the at least one tool; determining a process sequence of the lot; employing a set of combinational logistics in a lot sampling engine to determine if sampling is indicated and, if sampling is indicated, establishing a sampling decision; querying a set of lot sampling rules from the lot sampling engine to evaluate the sampling decision; evaluating a statistical quality of the process if no set of lot sampling rules exists; and automatically determining whether the lot passing through the manufacturing process requires sampling based on the process sequence, combinational logistics, statistical quality and lot sampling rules.

20050172250

10773058

1. A method of performing static timing analysis on a design, the method comprising: performing multiple static timing analysis runs with the design, each run using a predetermined set of parameters; saving results from the multiple static timing analysis runs; and merging the results.

10095951

15351367

1. A computer-system-implemented method for generating at least one descriptor for an object, the method comprising: receiving extracted geometric shapes aligned with edge pixels associated with the object in an image; determining orientations for the geometric shapes; identifying a subset of the geometric shapes, wherein the subset includes an integer number k of the geometric shapes that are proximate to a given geometric shape in the geometric shapes; using the computer system, calculating pairs of angles representing relative displacement and relative orientation of pairs of geometric shapes in the subset, wherein a given pair of angles for a given pair of geometric shapes in the subset includes: a first angle at a location on a first geometric shape in the given pair of geometric shapes between the first geometric shape and a line t connected between the first and second geometric shapes in the given pair of geometric shapes, and a second angle at a location on the second geometric shape between the second geometric shape and the line t; and generating the at least one descriptor for the object by computing a 2-dimensional (2D) histogram of the pairs of angles based on cells defined by angular quantization values.

20040120488

10696907

1. A method, comprising: providing test input data elements and corresponding test output data elements, providing the test input data elements to a data classifier to generate result output data elements, generating measures of difference based on differences between each test output data element and each corresponding result output data element, based on the measures of difference, generating a performance measure of the data classifier.

20180089543

15813401

1. A computer-implemented method comprising: utilizing two or more classifiers to calculate, for an input image, probability scores for a plurality of classes based on visual information extracted from the input image and semantic relationships in a classification hierarchy, wherein each of the two or more classifiers is associated with a given one of two or more levels in the classification hierarchy with each level in the classification hierarchy comprising a subset of the plurality of classes; and classifying the input image based on the calculated probability scores.

20080222202

11849209

1. An adaptive dynamic computer system architecture having a plurality of system layers interconnected to one another, comprising: A first layer including a hardware system including microprocessors, application specific integrated circuits or continuously programmable field programmable gate arrays; A second layer including distributed nodes; A third layer including distributed transformational spatio-temporal object relational database management system; A fourth layer including a multi agent system of intelligent mobile software agents; A fifth layer including plasticity behavior in intrasystemic interaction; A sixth layer including plasticity behavior in environmental interaction; A seventh layer including a plurality of functional applications.

7685468

11630700

1. A method of generating a test case for an application or system modelled using a Stochastic Automata Network model including a plurality of automata, including the steps of: a) setting an initial global state as the current global state ( 100 ), wherein a global state comprises a set of local states each corresponding to one of the automata; b) creating a record of the initial global state ( 101 ); c) selecting an event ( 103 ) from a set of events that can be applied to the current global state; d) creating a record of the selected event ( 104 ); e) identifying those of the automata affected by the selected event ( 105 ) and updating the current global state by updating the states of the affected automata ( 106 ); f) creating a record of the current global state ( 107 ); and repeating steps c) to f) until a termination condition is satisfied.

9427183

13181341

1. A method for processing data from a continuous glucose sensor, the method comprising: providing a glucose sensor operably connected to electronic circuitry; monitoring, using the electronic circuitry, a signal generated by a working electrode of the glucose sensor, the signal comprising a glucose sensor data point; further monitoring, using the electronic circuitry, an output of a counter electrode of the glucose sensor; detecting, using the electronic circuitry, a signal artifact associated with the glucose signal based on the monitoring of the output of the counter electrode, wherein the detecting includes determining a first state of severity from a plurality of state of severities of the signal artifact; selecting a first signal estimation algorithm from a group of one or more signal estimation algorithms based on the determination of the first state of severity of the signal artifact, wherein the first signal estimation algorithm is different from the other plurality of signal estimation algorithms and wherein each of the plurality of signal estimation algorithms use historical and/or present signal data to estimate unknown signal data; applying using the electronic circuitry, the selected first signal estimation algorithm; generating an estimated sensor data point based on the application of the selected first signal estimation algorithm; and replacing, using the electronic circuitry, the sensor data point with the estimated sensor data point.

8700925

12552284

1. A system comprising: a central processing unit (CPU); and a graphics processing unit (GPU) coupled to the CPU; wherein power used by the CPU and power used by the GPU are regulated in tandem using a fuzzy logic control system operable for implementing a plurality of fuzzy logic rules, wherein inputs to the fuzzy logic control system include a first value for the power used by the CPU and a second value for the power used by the GPU, wherein the sum of the first value and the second value is compared to a shared supply power and thermal power budget value, and wherein a state of the CPU and a state of the GPU are regulated to maintain the sum within the shared supply power and thermal power budget value; wherein further the first value comprises the power used by the CPU integrated over a period of time, the second value comprises the power used by the GPU integrated over the period of time, and the shared power supply and thermal power budget shared power supply and thermal power comprises an integrated value of the budget over the period of time.

20070217516

11378148

1. A method of motion estimation in a video encoder, comprising: a. utilizing sub-pel diamond refinement; and b. applying uni-modal assumptions to determine which sub-pel points are checked within the sub-pel diamond refinement.

9281914

14314190

1. A network design apparatus comprising: a processor configured: to perform a first process including: determining, in response to a plurality of demands each requesting traffic between a pair of nodes in a network in which one or more wavelength multiplexed optical signals are transmitted, a plurality of communication routes each providing a connection between the pair of nodes in the network, and estimating, for each link in the network, communication channels to be established in each communication route, in accordance with a wavelength constraint condition that a number of the communication channels to be established be smaller than or equal to a first upper limit for a number of available optical signal wavelengths, to perform a second process including assigning, for each link in the network, wavelengths of optical signals to be multiplexed into the one or more wavelength multiplexed optical signals, to the communication channels, based on a result of the estimating of the first process and in accordance with a system constraint condition that a number of optical signals that have an identical wavelength and are redundantly usable be smaller than or equal to a second upper limit for a number of available transmission systems each configured to transmit a wavelength multiplexed optical signal, and to perform a third process including: determining, for each link in the network, a target number of wavelengths for reducing a required number of transmission systems that is required for accommodating the plurality of demands, based on a result of the estimating of the first process and a result of the assigning of the second process, and determining whether there is a possibility of reducing the required number of transmission systems to be operated, by determining whether the target number of wavelengths is achievable by at least one of a change in bandwidths of the communication channels and a change in the plurality of communication routes; and a memory configured to store information on the network and the plurality of demands, wherein, upon determining that there is a possibility of reducing the required number of transmission systems, the third process changes the wavelength constraint condition so that the first upper limit is defined as the target number of wavelengths and changes the system constraint condition so that the second upper limit is reduced, with respect to the each link; the first process re-estimates the communication channels in accordance with the changed wavelength constraint condition; and the second process re-assigns wavelengths of the optical signals to be multiplexed, based on a result of the re-estimating of the first process and in accordance with the changed system constraint condition.

9558458

13721087

1. A method for allocating spatial resources, the method comprising steps of: a) providing a store layout; b) assigning categories to locations in the store layout, creating a first store layout with assigned category locations; c) translating the store layout with assigned category locations into a first distance relationship matrix; d) providing an ideal category relationship matrix, wherein the ideal category relationship matrix provides an indication of how closely pairs of categories are related to each other; e) calculating a total score for the first store layout with assigned category locations by comparing the first distance relationship matrix to the ideal category relationship matrix; f) implementing the category assignments in a store.

7899766

12069129

1. A method to produce in a computer system a bound on the error of a classifier over a set of working examples, the method comprising: assigning multiple possible output assignments of values to examples in a working set; applying a filter to the assignments to determine likely assignments, by computing a ranking of the training set and working set among some possible ways to partition the combined training set and working set into a possible training set and a possible working set; and storing the error of a maximum-error likely assignment.

9424656

14710254

1. A computer-based method for evaluating cataract surgical procedures by medical personnel, the method comprising the steps of: providing surgical procedure video data on a computer having a processor, memory and computer readable media and storing said surgical procedure video data on the computer readable media; identifying with a transform stored on the computer readable media a pupil area of an eye in the surgical procedure video data; segmenting the surgical procedure video data based on changes in the pupil area location; identifying in the surgical procedure video data each segment as an independent surgical procedure; determining time duration of each independent surgical procedure by the time duration of each segment; assigning a time duration value to the each independent surgical procedure; identifying with the transform stored on the computer readable media key images that indicate completion of a capsulorrhexis procedure; within the identified key images, measuring spatial features of a hole made in an anterior capsule of a cataract of the eye or simulated eye during capsulorrhexis; assigning a value to the measured spatial features of the hole; applying optical flow and resulting optical flow values to compute motion during the capsulorrhexis procedure; calculating a stability of the surgical procedure from the computed motion; assigning a value to the calculated stability of the surgical procedure; and outputting said assigned values for evaluation of the surgical procedure.

20070239705

11394271

1. A processor-implemented method of performing a similarity measure of a plurality of privacy-protected data, comprising: selecting a first value and a first context related to the first value; dividing the first value into a first plurality of substrings in an order preserving way; processing each substring of the first plurality of substrings through an obfuscation function to produce a first plurality of order preserved obfuscated substrings; selecting a second value and a second context related to the second value; dividing the second value into a second plurality of substrings in the order preserving way; processing each substring of the second plurality of substrings through the obfuscation function to produce a second plurality of order preserved obfuscated substrings; comparing the first and second plurality of order preserved obfuscated substrings, and determining a value similarity measure for the first and second values based on the comparison of the first and second plurality of order preserved obfuscated substrings; and comparing the first context and the second context, and determining a context similarity measure for the first context and the second context based on the comparison of the first and second contexts.

20110035342

12840885

1. A method for determining a margin requirement associated with a plurality of financial instruments within a portfolio, the method comprising: receiving a plurality of data associated with the plurality of financial instruments within the portfolio; determining a shock value for each of a plurality of risk factors within a multi-factor risk model, wherein the shock factor is determined based on the received plurality of data; calculating a maximum risk margin for each of the plurality of risk factors, wherein the maximum risk is a function of the shock value associated with each of the plurality of risk factors; and calculating a total multi-factor risk margin based on maximum risk margin for each of the plurality of risk factors.

9576023

14330461

1. A system for summarizing the relevance of a document to a conceptual query, the system comprising: a memory having computer readable computer instructions; and a processor for executing the computer readable instructions, the computer readable instructions including: receiving the conceptual query, the conceptual query comprising a listing of one or more concepts in a concept graph; accessing concepts extracted from the document, the concepts extracted from the document based on one or more differential tests performed on portions of text in the document and at least a subset of concepts in the concept graph; computing a degree to which the conceptual query is related to each of the extracted concepts, the computing responsive to a metric that measures a relevance between the one or more concepts in the conceptual query and each of the extracted concepts the computing comprising using a transition probability matrix to perform a weighting of each link in the concept graph that connect the one or more concepts in the conceptual query to the extracted concepts; creating a summary by selecting a threshold number of the extracted concepts having a greatest degree of relation to the conceptual query; and outputting the summary including the selected threshold number of the extracted concepts.

20060026204

10902584

1. A method for discovering terminology unique to a distinct subset of a general population, said terminology comprised of new terms as well as unique and obscure usages of previously known terms, said method comprising: a. analyzing a first collection of communications to identify at least one of: a source of communication and an instance of communication fit for consumption by said general population; b. accessing a database of communications, based on said at least one of: a source of communication and an instance of communication, either extracted from said first collection or obtained from said source of communication; c. creating a first usage dictionary, from said database of communications, said first usage dictionary comprising terms, definitions corresponding to term usages, and frequencies corresponding to term usage; d. creating a second usage dictionary from a second collection of communications intended for consumption by said distinct subset of said general population, said second usage dictionary comprising terms, definitions corresponding to term usages, and frequencies corresponding to term usage; e. comparing said second usage dictionary with said first usage dictionary to determine, for said first and second collections of communications: existence of terms not shared in common, differences in usage of terms shared in common, and disparities in frequencies of usages of terms shared in common; and f. establishing terminology unique to said distinct subset of said general population, based on said comparative differences between usage dictionaries.

20120021395

13006012

1. A method of a displaying test, the method comprising: displaying, on a display screen, a list of possible treatments of a test to a patient; displaying an area for receiving a subset of treatments of the list of possible treatments; receiving an ordered list of treatments from the list of possible treatments; and determining whether the set of received treatments are correct and have a correct order.

8112305

11668810

1. A method for estimation of changes in key performance indicator distribution, the method comprising: establishing, in a processor, a state-space model in a computer memory, the state-space model for handling measurement errors and modeling errors as noise, wherein time-varying indices have historical data and a correlation with key performance indicators; adaptively estimating, in the processor, parameters related to the time varying indices, and obtaining residuals from the adaptive estimate of the parameters; estimating, in the processor, a probability distribution in order to generate random numbers from the probability distribution; generating, in the processor, random numbers related to the estimated probability distribution, thereby enabling prediction of future indicator distributions through a Sequential Monte Carlo method; providing, in the processor, models to input key performance indicator intensity levels for a scenario level and to predict future values for a plurality of scenarios as point estimates; and distributing and synthesizing, in the processor, the point estimation results for the plurality of scenarios based on key performance indicator estimated probability distributions, wherein enabling prediction of future indicator distributions through a Sequential Monte Carlo method, includes: generating, in the processor, random numbers using a non-Gaussian white noise probability density; performing, in the processor, an update of the noise probability density as a function of time and modeling error for financial indices; calculating, in the processor, a likelihood of a data point using a conditional distribution of a noise probability density as a function of time and independent of the non-Gaussian white noise probability density; and re-sampling, in the processor, the data points based on a financial index data point distribution.

9939823

14296561

1. A first automation unit and at least one second automation unit for controlling and/or monitoring two or more pieces of equipment in a premises, to form, when implemented in said premises, a distributed control system, the first automation unit comprising: a first, local database to store at least data from sensors and controlled equipment controlled by said first unit and at least events determined by said first unit; at least one second database to store at least data from sensors and controlled equipment controlled by said at least one second unit and events determined by controller of said at least one second unit; a controller, forming part of said distributed system to analyze data in said first local database for activating equipment and to use data in said at least one second database for activating controlled equipment controlled by said at least one second unit; and a communication module to communicate at least said first local database with said at least one second unit; and said at least one second automation unit comprising: a third, local database to store at least data from sensors and controlled equipment controlled by said second unit and at least events determined by said second unit; at least one fourth database to store at least data from sensors and controlled equipment controlled at least by said first unit and events determined at least by said controller of said first unit; a controller, forming part of said distributed system to analyze data in said third local database for activating equipment and to use data in said at least one fourth database for activating controlled equipment controlled by at least said first unit; and a communication module to communicate at least said third local database with at least said first unit, to update its said second unit database.

9064321

14293771

1. A method for enhancing contrast resolution of an imaging or sensing system, comprising: receiving information from an array of transducers using multiple data channels; digitally filtering the received information on the multiple data channels using respective finite impulse response (FIR) filters corresponding to respective data channels, the FIR filters having multiple taps, the taps including tap weights determined (1) as a function of a distance of the array from an object that energy is being transmitted to or reflected from, and (2) corresponding to an a priori system model; and aggregating outputs of the finite impulse response filters to provide a sample.

20120239375

13050086

1. A non-transitory computer-readable storage medium having computer-executable program instructions stored thereon that when executed by a processor, cause the processor to perform steps comprising: (i) collecting data from a plurality of sources, wherein the collected data includes data related to a plurality of independent variables; (ii) storing the collected data; (iii) performing a plurality of checks on the collected data, wherein the plurality of checks include handling missing values, eliminating outlier values, and eliminating highly correlated independent variables in the collected data; (iv) analyzing the checked data to determine one or more of the plurality of independent variables to be used in predicting a target variable; (v) generating a model to estimate the target variable using the determined independent variables; and (vi) generating a plurality of graphs related to governance and risk compliance of the model, wherein the plurality of graphs include a variance inflation factor.

9722930

14075727

1. A method for placing components of a plurality of instances of a cloud application on nodes in a cloud infrastructure, the method comprising: receiving by a cloud controller scenario probabilities of a plurality of cloud application scenarios, wherein the plurality of cloud application scenarios define which of a plurality of application components to use and an order of operation for the plurality of application components; receiving by a cloud controller cloud infrastructure performance data; defining a performance metric of the cloud application based upon cloud infrastructure performance data; defining constraints on the placement of the plurality of application components; receiving a service level agreement performance requirement based upon a probability of meeting a specified performance requirement; optimizing the placement of the plurality of application components of the plurality of instances of the cloud application on nodes in the cloud infrastructure based upon the scenario probabilities, cloud infrastructure performance data, the performance metric, and the constraints on the placement of the plurality of application components to meet the service level agreement performance requirement.