Datasets:

patent

/

AIPD_evo_claim_one

like 0

7647212

10855515

1. A computer-based method for carrying out a negotiation concerning set of actions to execute a print job performed by selected ones of a plurality of participants, wherein at least one of the plurality of participants encapsulates a constraint solver in a service, comprising: defining processing instructions in a memory of the system for carrying out the negotiation using the service encapsulating the constraint solver to facilitate printing via a processor; and executing the processing instructions, via the processor, to carry out the negotiation with the service encapsulating the constraint solver; wherein said executing the processing instructions for carrying out the negotiation with the service encapsulating the constraint solver further comprises: (A) establishing encapsulation input in the memory that includes: (a) a mapping between one or more of a price, a size, and a delivery date of print-job parameters of the service and corresponding variables of the constraint solver, (b) a translation between negotiation statements on the one or more of a price, a size, and a delivery date of the print-job parameters of the service and domain constraints imposed on the corresponding variables of the constraint solver, and (c) a set of semantic constraints of the service on variables of the constraint solver; (B) constructing a graph in the memory for negotiating the set of actions to be performed, wherein each action corresponds to one or more invocation patterns, each node of the graph defining a negotiation context that has associated therewith a constraint store with at least a set of domain constraints stored therein; (C) propagating constraints defined by the set of semantic constraints and the set of domain constraints associated with nodes of the graph to other participants in the negotiation as domain constraints augment the set of semantic constraints during the negotiation utilizing a protocol defined by one or more primitives that are instantiated by the one or more invocation patterns; and (D) executing one or more actions based at least in part upon the interdependencies between the one or more invocation patterns, the one or more actions facilitate printing of at least one print job, each print job creates at least one hard copy document based at least in part upon the processing instructions.

9378058

13775678

1. A method implemented on at least one machine each having at least one processor, storage, and a communication platform connected to a network for dynamic control of a processing system having a plurality of tiers, the method comprising: obtaining queue lengths of a plurality of nodes in one of the plurality of tiers; receiving a control objective from a higher tier, wherein one or more requests from the higher tier are processed by the plurality of nodes in the tier; computing a control model of the tier based on the obtained queue lengths of the tier, wherein one or more parameters of the control model are automatically optimized based on the received control objective from the higher tier; and determining at least one control action based on the control mode and the control objective, wherein the steps of obtaining, receiving, computing, and determining are performed in the tier at a frequency that is determined based on a number of control actions available to the processing system per unit of time and that is higher than a frequency at which the steps of obtaining, receiving, computing, and determining are performed in the higher tier.

9262928

14044721

1. A method of predicting an achievable level of privacy of a flight path, the method comprising: receiving, by a computer comprising a processor and memory, an indication of a flight route of an aircraft; receiving, by the computer, an indication of one or more privacy enhancement techniques; estimating, by the computer, an air traffic density for one or more airspaces along or near the flight route, the estimating based on information obtained from one or more aviation information databases; estimating, by the computer, an achievable level of privacy of the flight path based, at least in part, on the air traffic density for one or more airspaces and the one or more privacy enhancement techniques; and outputting, to a display communicatively coupled to the computer, an indication of the estimated achievable level of privacy.

7889666

12005191

1. A tangible article of manufacture excluding propagating signals and storing machine readable instructions for implementing a framework for troubleshooting a virtual private network (VPN) backbone in real-time, the machine readable instructions, when executed, causing a machine to implement: a plurality of event identification modules to receive messages from a corresponding number of monitors in the VPN backbone and identify the received messages as events if a change occurs with a predetermined time window, or if the message is a deviation from a predefined metric, each event identification module having an output; a plurality of event classification modules each having an input coupled to a corresponding event identification module output, each event classification module to classify each identified event depending on the type of change indicated by the event, each event classification module having an output; a temporal correlation module having a plurality of inputs, each input coupled to each event classification module output, the temporal correlation module to perform time-window based and statistical based correlation for the identified and classified events, the temporal correlation module having an output; a spatial correlation module having an input coupled to the temporal correlation module output, the temporal correlation module to filter the correlated events, the spatial correlation module having an output; an impact analysis module having an input coupled to the spatial correlation module output, the impact analysis module to estimate a VPN impact based on an event type and degree, the impact analysis module having an output; and a root cause and mitigation module having an input coupled to the impact analysis module output, the root cause and mitigation module to identify each event's root cause location and failure, determine a mitigation strategy for that event, and output the mitigation strategy.

20060004683

10881279

1. A system for generating a decision network from text, the system comprising: an information extraction component that extracts a quantum of evidence and an associated confidence value from a given text segment; an evidence classifier that associates each quantum of evidence with one of a plurality of hypotheses; and a fusion engine that builds a decision network from the plurality of hypotheses, an associated base structure, the extracted quanta of evidence, and the confidence values.

20030141860

10248537

1. An automatic integrated circuit testing system using an integrative computer, comprising: at least one testing computer for carrying and testing an integrated circuit; at least one automatic plugging/unplugging machine for connecting the integrated circuit into the testing computer and removing the integrated circuit out of the testing computer after the testing; and at least one controller device electrically connected to the testing computer and the automatic plugging/unplugging machine for controlling the movement of the automatic plugging/unplugging machine and the testing conducted by the testing computer; wherein the testing computer with the integrated circuit connected thereto forms an integrative computer.

20070038416

11161651

1. A generic model simulation method comprising: mapping a specifically formatted process representation into a generic process model; and, providing said generic process model to a simulation engine.

20080182343

11668553

1. A method of processing a wafer comprising: receiving the wafer and wafer data, wherein the wafer is received by a measurement subsystem, a wafer state is established for the wafer, and the wafer data includes historical and/or real-time wafer temperature data; receiving an input message including a pass-through message, or a real-time feedforward message, or any combination thereof, wherein the pass-through message includes historical wafer data and the real-time feedforward message includes real-time wafer temperature data; creating, by a Transparent Coupling Device (TCD), real-time feedforward data using the real-time feedforward message, wherein the real-time feedforward data is created when input message includes a real-time feedforward message, and is not created when the input message does not include a real-time feedforward message, wherein the real-time feedforward data includes real-time wafer temperature data; feed-forwarding the real-time feedforward data to a controller in the measurement subsystem when a feedforward state is a first value, and not feed-forwarding the real-time feedforward data when the feedforward state is a second value, wherein the feedforward state is the first value when the real-time feedforward data can be fed-forward before a measuring process is performed for the wafer, and wherein the feedforward state is the second value when the real-time feedforward data cannot be fed forward before the measuring process is performed for the wafer; and either creating a tuned measurement recipe, a tuned measurement profile, or a tuned measurement model, or any combination thereof using a Real-Time Parameter Tuning (RTPT) procedure that uses the real-time wafer temperature data as tuning data when a RTPT state is a first value and the input message includes a real-time feedforward message; or not creating the tuned measurement recipe, the tuned measurement profile, or the tuned measurement model, or any combination thereof when the RTPT state is a second value and/or the input message does not include a real-time feedforward message.

9588810

11835435

1. A computer-implemented memory management system, comprising: a request buffer for receiving memory access requests to a shared memory from multiple threads; and a scheduling component for prioritizing scheduling of requests of a given thread of said multiple threads to increase parallel execution of the given thread requests, such that whenever a request of the given thread is in-progress, one or more remaining requests of the given thread are scheduled before scheduling requests of other threads of said multiple threads that are not in-progress, wherein a thread of said multiple threads is in-progress whenever a memory access request from that thread to the shared memory is currently being serviced.

10093277

15370613

1. A method of controlling an operation standby time of a driver convenience system installed in a vehicle using a control unit including a memory and a processor, the method comprising: setting a plurality of learning positions; generating a plurality of test cases based on a day of a week and a time associated with each of the plurality of set learning positions; receiving a plurality of sensor signals and a plurality of switch signals associated with the driver convenience system; generating a learned neural network algorithm by using a neural network algorithm to learn an operation standby time of each of the plurality of generated test cases based on the plurality of sensor signals and the plurality of switch signals associated with the driver convenience system; and determining an operation standby time of the driver convenience system at a current learning position using the learned neural network algorithm, wherein, when a condition for a specific operation is met at the current learning position, the driver convenience system performs the specific operation after the determined operation standby time has elapsed.

20110178394

13005843

1. A computer-implemented method for performing computer-assisted procedures involving a first set of N three-dimensional points representing locations in a first space of first fiducials and a second set of N three-dimensional points representing locations in a second space of second fiducials corresponding to the first fiducials, where N is an integer greater than 2, the method comprising: employing a current rigid transformation o the first set to obtain a current transformed set of N three-dimensional points; determining a linearized transformation that minimizes a weighted fiducial registration error between the current transformed set and the second set, the linearized transformation comprising a translation vector and a linearized matrix; obtaining an updated rigid transformation based on the current rigid transformation, the translation vector of the linearized transformation, and a rotation matrix that is closest to the linearized matrix; applying the updated rigid transformation to the first set to obtain an updated transformed set of N three-dimensional points; and if a motion associated with the updated transformed set fails to meet at least one criterion, repeating the steps of determining, obtaining, and applying using the updated rigid transformation and the updated transformed set.

20140173241

13713584

1. A method of generating optimized memory instances using a memory compiler, the method comprising: providing data pertinent to describing a memory to be designed; making front-end models and back-end models to supply a library; receiving design criteria via a user interface; and optimizing design of the memory among speed, power and area according to the provided library and the received design criteria, thereby generating memory instances.

9519735

14492866

1. A simulation method, comprising: providing a plurality of input data sets for an integrated circuit (IC) model; performing a first simulation using a computing unit by applying a first of the plurality of input data sets to the IC model to generate a first simulation result, wherein the first input data set includes a first input device parameter with a first baseline parametric value and a second input device parameter with a second baseline parametric value; performing a second simulation by applying a second of the plurality of input data sets to the IC model to generate a second simulation result, wherein the second input data set includes the first input device parameter but with a first parametric value that differs from the first baseline parametric value and also includes the second input device parameter with the second baseline parametric value; determining a sensitivity of the IC model to the first input device parameter by comparing results of the first and second simulations; defining a simulation order for remaining input data sets of the plurality of input data sets according to the sensitivity of the IC model to the first input device parameter; and manufacturing an integrated circuit on a semiconductor substrate, wherein the manufactured integrated circuit corresponds to the IC model.

20120254398

13076633

1. A computer-implemented method of analyzing network traffic related to domain names, comprising: storing network traffic data associated with DNS requests for NXDs; receiving an analysis request associated with at least one identified domain name; creating, based on the stored network traffic data, an NXD list comprising NXDs that received at least one DNS request during a time period; computing, based on the stored network traffic data, a similarity metric for each NXD listed in the NXD list; and providing an analysis report identifying potentially valuable NXDs based on the computed similarity metrics.

8566749

13735993

1. A method, comprising: generating at least one display output using at least one computer from multi-parameter N-dimensional data, wherein data dimensions are indexed by one of (a) three index pseudo-dimensions or (b) two index pseudo-dimensions and one time dimension, the display output depicting volumetric data spaces selected from C N M = N ! M ! ⁢ ( N - M ) ! possible ways to depict multi-parameter data with M-dimensional data spaces, said possible ways comprising at least one of (i) three mutually perpendicular axes comprising a time axis and two index pseudo-dimension axes, or (ii) a time sequence of volumetric data spaces with three index pseudo-dimension axes; generating, in response to user input selecting higher-order volumetric data space, a display output depicting the higher-order volumetric data space having three mutually perpendicular axes comprising three index pseudo-dimension axes or a time axis and two index pseudo-dimension axes; generating, in response to user input selecting lower-order volumetric data space and a data point along one of the mutually perpendicular index pseudo-dimension axes, a display output depicting the lower-order volumetric data space having three mutually perpendicular axes comprising three index pseudo-dimension axes or a time axis and two index pseudo-dimension axes; and generating, in response to user input selecting at least one of a point in time, a point on index pseudo-dimension axis, or a set of data sets, a display output depicting the data spaces for the selected data sets having three mutually perpendicular axes selected from: three index pseudo-dimension axes, or a time axis and two index pseudo-dimension axes.

20120143808

12959207

1. An apparatus to identify a target object, the apparatus comprising: an object detection module that detects a plurality of objects by matching data from one or more sensors to known data of a target object, the object detection module determining one or more correlation metrics for each object; an object tracking module that tracks geographic locations for at least a subset of the plurality of objects over time using subsequent data from the one or more sensors; a contextual data module that determines one or more contextual indicators for at least a subset of the plurality of objects based on the data from the one or more sensors; and an artificial intelligence module that estimates probabilities that each of at least a subset of the plurality of objects comprises the target object based on the correlation metrics, the geographic locations, the contextual indicators, and one or more target contextual indicators associated with the target object, the artificial intelligence module estimating the probabilities using an artificial intelligence model.

8478709

12719198

1. A method of evaluating client status, comprising: receiving client data representing events from a set of different event types performed by clients, wherein the clients are in a non-contractual setting with a firm offering products or services to the clients; estimating, using a computer and based on the client data, parameters of a statistical model that describes client behavior, wherein a churn type of event is encoded in the statistical model as an absorbing state of a stochastic process, with a time of transition to the absorbing state modeled as being infinite, wherein the churn type of event is not observable in the client data, and performance of the churn type of event places the clients in a permanently inactive condition with the firm, and wherein at least one of the parameters corresponds to the churn type of event; calculating a likelihood of churn for a plurality of the clients at one or more time points using the statistical model and its estimated parameters; and selecting a client for which the likelihood of churn meets a predefined condition, the client selected to remain active with the firm.

8762303

12441956

1. A method for performing genetic algorithm-based feature selection, the method comprising: dividing a set of data samples into at least a first sub-set of data samples and a second sub-set of data samples, wherein the first sub-set of data samples and the second sub-set of data samples include different sub-sets of the set of data samples; applying a data splitting pattern to the first sub-set of data samples, splitting the first sub-set of data samples into a first training set of data samples and a first testing set of data samples, wherein the first training set of data samples and the first testing set of data samples include different data samples of the first sub-set of data samples; creating a first classifier based on the first training set of data samples and the first testing set of data samples; applying one or more different data splitting patterns to the first sub-set of data samples, splitting the first sub-set of data samples into one or more training sets of data samples and one or more testing sets of data samples, wherein the one or more training sets of data samples and the corresponding one or more testing sets of data samples include different data samples of the first sub-set of data samples; creating one or more classifiers based on the one or more training sets of data samples and the corresponding one or more testing sets of data samples; integrating the first classifier and the one or more classifiers, generating an integrated classifier; and outputting the integrated classifier to a genetic algorithm as a fitness value for a candidate feature subset, wherein genetic algorithm-based feature selection is performed using the integrated classifier.

20090238304

12408226

1. A method of processing information prior to emission thereof on a multi-antenna emission, comprising preceding said information and scaling said precoded information prior to emission thereof, the precoding comprising applying a perturbation to said information before transmission, said perturbation being expressible as a perturbation vector, wherein said perturbation vector is selected by defining a lattice representing possible identities of information to be sent, defining a reduced lattice from said lattice, selecting a first candidate perturbation vector from said reduced lattice, selecting further candidate perturbation vectors, transforming said candidate perturbation vectors from expression in said reduced lattice into expression in said defined lattice, selecting one of said transformed candidate identities as perturbation to be applied, and said scaling comprising scaling said information after perturbation on the basis of a transmitted power constraint, wherein said selecting of one of said transformed candidate identities is performed on the basis of a scaling factor employed in said scaling.

8566218

12246755

1. A computer-implemented method of order allocation, the computer-implemented method comprising: establishing an inner market representing a first portion of an order book at a computer-implemented trading host, wherein the inner market is defined as a function of an inner market parameter; establishing an outer market at the computer-implemented trading host, wherein the outer market represents a second portion of the order book that includes the remainder of the order book not represented by the inner market of the order book; allocating, via a FIFO allocation processor, a first portion of an incoming order to the inner market utilizing a first-in, first-out (FIFO) algorithm; and allocating, via a pro-rata allocation processor, a second portion, in excess of the first portion, of the incoming order to the outer market using a pro-rata algorithm.

8831339

13527032

1. A system for classifying a test image, said system comprising: at least one processor programmed to: receive a data graph of the test image; receive a graph lattice, the graph lattice including a plurality of nodes, each of the plurality of nodes including a subgraph, a weight and at least one mapping of the subgraph to data graphs of a plurality of training images, the plurality of training images corresponding to a plurality of classes; map the data graph of the test image by the subgraphs of the plurality of nodes; compare mappings between the graph lattice and the data graphs of the training images with mappings between the graph lattice and the data graph of the test image to determine, for each of the training images, a weighted vote of similarity between the data graph of the training image and the data graph of the test image, the weighted vote based on the weights of the plurality of nodes; and, determine a class of the test image from the weighted votes of the training images, the class of the test image being the class of the training image with the highest weighted vote above a threshold number of votes.

9484014

13771545

1. A method of performing hybrid text-to-speech processing, the method comprising: receiving text data; determining a sequence of linguistic units corresponding to the text data, the sequence of linguistic units comprising a first linguistic unit and a second linguistic unit; determining to use a first parametric speech synthesis technique for the first linguistic unit, wherein the first parametric speech synthesis technique comprises synthesizing speech using a computerized voice generator; generating a representation of the first linguistic unit using a model for the first linguistic unit and using the first parametric speech synthesis technique; determining to use a unit selection speech synthesis technique for the second linguistic unit; retrieving a pre-recorded speech unit for the second linguistic unit from a unit selection database, wherein the pre-recorded speech unit comprises recorded speech that has been processed with an encoder and a decoder prior to storage in the unit selection database, to configure the pre-recorded speech unit with acoustic properties consistent with speech generated by the first parametric speech synthesis technique; concatenating the representation of the first linguistic unit and the pre-recorded speech unit to generate audio data; and causing audio corresponding to the audio data to be output using an audio speaker.

20130061195

13668113

1. A method implemented on a data processing system for circuit design, the method comprising: identifying one or more first portions of a design of a circuit, each of the one or more first portions containing a set of elements interconnected via timing critical nets; generating weights for the timing critical nets, the weights being generated after identifying the one or more first portions; executing a placer algorithm which uses the weights for the timing critical nets to place the set of elements on a representation of the design.

5546408

08257594

1. A method for specifying a test sequence for a circuit, the circuit being modelled to have a plurality of external contact nodes, a plurality of internal nets, and at least one sub-circuit having input/output nodes connected to the internal nets, comprising the steps of: modelling possible first faults associated with the external contact nodes, the plurality of internal nets, and the input/output nodes of the at least one sub-circuit; modelling only specified ones of possible second faults associated with at least one of one or more of the internal nets and one or more nets that are internal to the at least one sub-circuit; and generating a specification of a sequence of test pin excitations that are predetermined to detect the presence of the possible first and second faults.

20140279766

13799819

1. A method, comprising: defining, by the one or more processors, a chromosome data structure that includes a plurality of first variables that are permitted to evolve in value and corresponding respective second variables, wherein the second variables are Boolean flags that indicate if the corresponding respective first variable is to be evaluated in a current generation; identifying, by the one or more processors, one or more objective functions for evaluating chromosome data structures; receiving, by the one or more processors, a baseline chromosome data structure, wherein the baseline chromosome data structure represents a known solution; identifying, by the one or more processors, a range flag, wherein the range flag indicates at least a maximum number of genes of a chromosome data structure that are permitted to be different from the baseline chromosome data structure when evaluating the one or more objective functions; generating, by the one or more processors, one or more chromosome data structures based at least in part on the range flag, wherein each of the one or more chromosome data structures comprise a first set of genes and a second set of genes, wherein each of the genes of the second set of genes corresponds to a respective gene of the first set of genes and indicates whether the corresponding gene of the first set of genes is permitted to be different from the baseline chromosome data structure in evaluating the one or more objective functions; and determining, by the one or more processors, one or more objective values corresponding to the one or more chromosome data structures based at least in part on the baseline chromosome and the one or more objective functions.

20130034910

13563812

1. A system for diagnosing, monitoring or prognosing Multiple Sclerosis or stages thereof, or predicting the course of the disease or a patient's response to a treatment regimen, the system comprising: (a) an apparatus comprising at least one sensor comprising nanomaterials selected from single walled carbon nanotubes coated with a first organic coating, metal nanoparticles coated with a second organic coating, and a combination thereof; (b) a detection means; and (c) a processing unit comprising a pattern recognition analyzer, wherein the pattern recognition analyzer receives sensor output signals and compares them to stored data so as to enable the diagnosis, monitoring or prognosis of Multiple Sclerosis or stages thereof, or the prediction of the course of the disease or a patient's response to a treatment regimen.

8051061

12033308

1. A method for query suggestion performed by a processor executing computer-executable instructions stored on a memory device, the method comprising: for an input query in source language, identifying a query in target language from a query log of a search engine, the query in target language and the input query in source language having a cross-lingual similarity, the identifying the query in target language from the query log comprising: providing a plurality of candidate queries in target language; evaluating the plurality of candidate queries in target language at least partly by deducing a monolingual similarity between the input query in source language and a translation of a respective candidate query from target language to source language; and ranking the plurality of candidate queries in target language using a cross-lingual query similarity score, the cross-lingual query similarity score being based on a plurality of features and a weight of each feature in calculating the cross-lingual query similarity score; and suggesting the query in target language as a cross-lingual query at least partly based on click-through information of documents selected by users for the query in target language.

8869129

12610571

1. An apparatus for scheduling an instruction, the apparatus comprising: an analyzer configured to analyze a dependency of a plurality of recurrence loops; and a scheduler configured to schedule the recurrence loops based on the analyzed dependencies, wherein the scheduler first schedules a dominant loop that has a loop head that has no dependency on another loop, from among the plurality of recurrence loops, and in response to a dependency of a plurality of loop heads of the plurality of recurrence loops being tangled with one another, the scheduler gives priorities to the plurality of loop heads based on a number of non-scheduled predecessors for each respective loop head from among the plurality of loop heads having dependencies that are tangled with one another, and schedules the corresponding recurrence loops based on the priorities given to the respective loop heads.

20080120261

11560733

1. A method comprising: determining a first expectation of the number of communications from a first person to a second person, wherein said first expectation is based on: i) a first probability, p 1Ec1 , of the membership of said first person in a first class c 1 , ii) a second probability p 1Ec2 , of the membership of said first person in a second class c 2 , iii) a third probability, p 1Eg1 , of the membership of said first person in a first group g 1 , iv) a fourth probability, p 1Eg2 , of the membership of said first person in a second group g 2 , v) a fifth probability, p 2Ec1 , of the membership of said second person in said first class c 1 , vi) a sixth probability, p 2Ec2 , of the membership of said second person in said second class c 2 , vii) a seventh probability, p 2Eg1 , of the membership of said second person in said first group g 1 , and viii) an eighth probability, p 2Eg2 , of the membership of said second person in said second group g 2 .

7849389

11543956

1. A decoder that is operable to decode an LDPC (Low Density Parity Check) coded signal, the decoder comprising: a symbol sequence estimate and symbol node update block that is operable to employ an updated edge message to make an estimate of a symbol within the LDPC coded signal; and wherein: the edge message corresponds to an edge that connects a check node and a symbol node within an LDPC coded modulation bipartite graph.

7953265

11603861

1. A method for automatically processing a volumetric diagnostic image dataset, comprising: defining a first seed point within a lesion, the lesion being within a first image dataset representative of a subject; defining a first boundary in three dimensions within the first image dataset, the first seed point and the lesion being within the first boundary; determining at least one parameter based on the first image dataset; obtaining at least one preliminary lesion parameter; selecting a first segmentation algorithm from a plurality of segmentation algorithms based on the at least one determined parameter and the at least one preliminary lesion parameter; and segmenting the lesion using the first segmentation algorithm.

7779025

11298606

1. A computer network including a computer-implemented data evaluation tool for evaluating electronic data sets and capable of displaying an output of the evaluation on a display medium, comprising: a communications network; a first server in data communication with the communications network; a first electronic database stored on the first server and populated with data records in a plurality of record series, the data records including a plurality of attribute data records containing data fields populated with discrete information and at least a plurality of time-series of data records containing data fields populated with time-series information; a plurality of analysis modules on the first server, each of the plurality of analysis modules adapted to input a set of client-customized operations to the record series in the database and output results that satisfy the operations, the analysis modules providing mathematical manipulation of attribute and/or time-series data to generate new time-series data or a scalar result, the mathematical manipulation comprising at least one mathematical manipulation that integrates two or more of the record series, the analysis modules comprising a data query module capable of querying across different studies in the database and retrieve specific data subsets that meet client-defined criteria, and the analysis modules comprising a data analysis module having an ability to perform mathematical manipulations of the attribute and/or time-series data on the data subsets satisfying the query results; a data analysis customizing function, permitting the client to customize in an interactive, arbitrary manner the data query module and the data analysis module by selecting study data from the database and analysis function operators from a library of functions and arranging them in a desired, sequential order, wherein the analysis function operators perform mathematical manipulations on the study data for generating the result; at least one of said analysis customization, utilizing the data query module, wherein the client customizes the query using at least one of the study data from the database and a plurality of analysis function operators from the library of functions sequentially arranging the data and the functions as a function chain, so that the output of one function serves as the input to a subsequent function, the function chain effecting a selection based on client-supplied constraints applied to attribute and/or time-series data, resulting in the retrieval of data subsets that satisfy client query customization intent; at least one of said analysis customization functions utilizing the data analysis module, wherein the client customizes analysis using at least one of the study data from the database and a plurality of analysis function operators from the library of functions sequentially arranging the data and the functions as a function chain, so that the output of one function serves as the input to a subsequent function, the function chain operating on the data subsets retrieved by the query module and using client-supplied constraints to perform mathematical operations to attribute and/or time-series data, resulting in derivative scalar and/or time-series data that satisfy client analysis customization intent applied to results of query module; and a first interface associated with a first client computer in data communication with the communications network, the first interface adapted to sending a request to one of the plurality of analysis modules and adapted to displaying on the first client computer the result.

20100293122

12550872

1. A system, comprising: a memory for storing computer-executable instructions for an application program interface; and a processor in communication with the memory, wherein the processor is configured to execute the computer-executable instructions to enable a user of the application program interface to: specify parameters associated with an evolutionary algorithm, wherein an execution of the evolutionary algorithm is in accordance with the specified parameters; define a chromosome data structure that includes a plurality of variables that are permitted to evolve in value in accordance with the execution of the evolutionary algorithm in order to generate one or more child chromosome data structures; identify one or more objective functions for evaluating chromosome data structures, including the generated one or more child chromosome data structures; and define an output format for providing one or more optimal chromosome data structures of the evaluated generated child chromosome data structures as designs to the identified objective functions.

20150081847

14031342

1. A method comprising: providing, by a content delivery network, at least one of a downloading service or a streaming service of programs, wherein the programs are provided to user devices via unicast transmissions; obtaining, by a network device, usage data that indicates a usage of the at least one of the downloading service or the streaming service; analyzing, by the network device, the usage data; determining, by the network device, whether at least one of a multicast offloading or a broadcast offloading is to be invoked on behalf of a program included in the programs and designated for unicast delivery, in response to the analyzing; and providing the program to a set of user devices via at least one of a multicast transmission or a broadcast transmission in response to determining that the at least one of the multicast offloading or the broadcast offloading is to be invoked.

20070189611

11276112

1. A method implemented at least in part by a computer, the method comprising: calculating a competitive measure for verification of an unspecific person, the competitive measure being from a discriminative classifier based on a Bayesian competitive model, the Bayesian classifier being adaptable to unknown new classes; and integrating the Bayesian competitive model with a generative verification in view of a set of confidence criteria to make a decision regarding verification of the unspecific person.

20040221060

10426501

1. An automated method of designing a network, the method comprising the steps of: obtaining one or more traffic demands; and computing a network, the network being computed by determining one or more routes for the one or more traffic demands using a design-based routing methodology based on feedback from a network management-based routing methodology.

8529446

11806335

1. A method of planning a clinical study with a study and data management system, the method comprising: gathering, in a knowledge database of the study and data management system at least partially executed by a processor, data correlated to at least a first clinical study, the first clinical study being an image-based study with a plurality of images being acquired by a plurality of imaging modalities, wherein the gathered data includes image data, metadata and image study results, the metadata being associated with the image data and containing configuration settings of at least one of the imaging modalities, the configuration settings being settings of the imaging modalities utilized when acquiring the associated image data during the first clinical study; correlating the image study results to the configuration settings of the imaging modalities; and automatically determining optimum configuration settings for imaging modalities to be used in a future clinical image study by accessing the knowledge database.

4018652

05647802

1. An apparatus for determining the concentration of microorganisms in a water specimen, said apparatus comprising a rigid body having a plurality of first wells and a plurality of second wells therein, the first wells being of equal volume and the second wells being of equal volume with the volume of the second wells being different from that of the first wells, the rigid body also having an inlet which opens outwardly from the body and forms an entry into which the water specimen may be introduced into the body, the rigid body further having filling channels leading up to and opening into the first and second wells, there being a separate filling channel for each first well and for each second well with each filling channel communicating with the inlet such that a water specimen introduced into the inlet passes into the filling channels and then into the wells, the upstream end of each filling channel being in communication with the inlet independently of the other filling channels so that the water specimen will flow into each well without passing through another well; means closing the ends of the wells and the sides of the filling channels for isolating the interiors of the wells and filling channels from the surrounding atmosphere except through the inlet, said means being transparent; and a culture medium in the wells.

20120233132

13044873

1. A method for establishing term co-relationships using sentence boundaries, said method comprising: providing a document corpus containing text data to be analyzed; analyzing the document corpus to identify sentence boundaries and produce a list of sentences; extracting terms and establishing term correlations from the list of sentences; and validating the term correlations to produce a validated term correlation database.

8407259

12901160

1. A computer implemented method of generating a tree for finding items stored in memory, said method comprising: determining a first value indicative of a location in a memory where an item is stored; determining a second value indicative of a bias level for said item, said bias level for performing a sorting operation on a search result list comprising said item; determining a third value indicative of an offset within said item where a component of said item begins; determining a fourth value indicative of a length of said component within said item to enable said component to be found; including said first value, said second value, said third value, and said fourth value in generating an integer representing said component of said item, said first value, said second value, said third value, and said fourth value being determinable from said integer; and storing said integer at a node in a tree according to characters associated with said item, said tree being searchable based on said characters.

20060020439

10897339

1. A system for discovering gene regulatory models, comprising: a data selection system that clusters gene expression data into a set of clusters and identifies a representative subset of genes from the set of clusters; and a relational fuzzy modeling system that builds a relational fuzzy model using the representative subset.

8849804

13572460

1. A computer-implemented method comprising: accessing a plurality of search results for multiple different queries submitted by a client device; generating an interest category profile for a user identifier associated with the client device, the interest category profile comprising a hierarchical classification of estimated interest categories based on the plurality of search results for the multiple different queries; storing the interest category profile in a database, wherein each category of the interest category profile has a weighting associated therewith; identifying a parent interest category of the interest category profile, wherein the parent interest category comprises a top level of the hierarchical classification; filtering the interest category profile to remove a sub-interest category from the hierarchical classification; based on the filtering, extracting the sub-interest category and transferring a weighting associated with the sub-interest category into the parent interest category of the stored interest category profile; and distributing the weighting of the sub-interest category to one or more other interest categories of the hierarchical classification.

8117288

10963101

1. A computer-implemented method to optimize an allocation of a software application across two or more parallel computational nodes on a parallel-processing system, the computer-implemented method comprising: receiving a communications profile of a software application comprising a plurality of software computations i for execution across two or more parallel computational nodes j on a parallel-processing system coupled together by a communications fabric, wherein at least a first software computation of the plurality of software computations communicates application data from at least a second software application of the plurality of software computations i, and wherein the communications profile includes an amount of software application data communicated between each of the software computations given by C(i, j); implementing, from the communications profile of the software application which has been received, an initial heuristic map defined by mapping each of the software computations i, in a domain D of all the software computation i on a given computational node, for i=1 to D by iteratively performing until i=D the following: mapping one of the software computations i=1 to one of the computational nodes j at a first arbitrary location of a node (x, y, z); mapping all domains with which domain i communicates either to the one of the computational nodes j at the initial location of the node (x, y, z) or to one of the computational nodes j in a neighboring location on the parallel processing system while satisfying the constraint of Int(p)≦n(x, y, z)≦Int (p+1), wherein n(x, y, z) is a number of domains mapped to the node (x, y, z), wherein D domains, which are to be mapped to a supercomputer computer with a number of nodes L×M×N, where p=D/(L×M×N)) be the number of domains mapped to each supercomputer node on average, and wherein Int(p) is the integer part of p; mapping domain i=2, in response to domain i=2 is not yet mapped, to one of the computational nodes i at a second arbitrary location of a node (x′, y′, z′) and the domains with which it communicates either to a same computational node at the second arbitrary location of a node (x′, y′, z′) or one of the computational nodes j in a neighboring location a neighboring computational node on the parallel processing system while satisfying the constraint of Int(p)≦n(x, y, z)≦Int(p+1); generating a Markov chain of maps from the initial heuristic map using Monte Carlo simulation with Free Energy given by F=Σ i,j C(i, j)H(i, j) where H(i, j) is an inter-node cost communication function; and mathematically minimizing H(i, j) using only the inter-node communication cost function for a total amount of software application data transferred between the parallel computational nodes j, wherein minimizing the inter-node communication cost minimizes inter-node communication time using simulated annealing, and wherein computation costs are uniform across the two or more parallel computational nodes j, wherein the total amount of software application data transferred between the parallel computational nodes i is minimized by at least one of a global time and a discrete time interval so as to reduce the inter-node communication cost of the software application, and the simulated annealing is performed by selecting a new candidate map M N i from M N i-1 , of a set of candidate maps M i =M N i when R<exp[−β{F(M N i −F(M i-1 )}/F min ], where R is a random number uniformly distributed in (0, 1) and where i is a non-negative integer and M o is the heuristic map and M i is derived from M i-1 by applying a Metropolis Algorithm and β is the inverse temperature β=1/T, F min is a minimum calculated Free Energy, and new candidate mappings M N i are generated using a same β value until the Free Energy decreases to a stable equilibrium.

8489700

11290883

1. A method of monitoring the performance of a multi-nodal computer system, comprising: instrumenting a set of system events to define a plurality of instrumented events, wherein the system events are related to the distribution of workload across each of the nodes of the multi-nodal computer system and wherein instrumenting comprises associating the system events with respective instrumentation routines which are invoked upon occurrence of the respective instrumented event; when an instrumented event, of the plurality of instrumented events, occurs over the course of executing a thread on the multi-nodal computer system, performing a respective instrumentation routine, wherein the instrumentation routine is configured to record data regarding the existing state of the multi-nodal computer system; and continuing to execute the thread after performing the instrumentation routine.

9792555

14106919

1. A method for probabilistic fatigue life prediction of a turbine part, comprising: in a fatigue life prediction processor, receiving a probability of detection model; in the fatigue life prediction processor, receiving an initial crack size probability density function (PDF) for the turbine part based on the received probability of detection model; in the fatigue life prediction processor, receiving probabilistic identification of model parameters; in the fatigue life prediction processor, receiving a model parameter PDF based on the received probabilistic identification of model parameters according to: ƒ(ln C,m )˜MVN(μ (ln C,m) ,Σ (ln C,m) ), where MVN is a multivariate normal distribution, C and m are model parameters from fatigue testing data, μ (ln C,m) is a mean vector and Σ (ln C,m) is a covariance matrix; receiving a crack growth model based on the received initial crack size PDF, the model parameter PDF and material/load factors; determining uncertainty propagation using an analytical or simulation-based method based on the crack growth model based on uncertainty of at least one of material properties, geometries, sensitivity of instruments, and loading of the turbine part; in the fatigue life prediction processor, computing a fatigue life prediction for the turbine part based on the uncertainty propagation and crack growth model; and implementing a maintenance plan for the turbine part based on the fatigue life prediction.

20070192163

11353932

1. A method reliant upon responses to a hierarchical-based metric for quantifying both degrees of satisfaction and values for attributes relating to an organization, wherein said method comprises: a) providing a data-gathering interface, and receiving a plurality of completed hierarchical-based metrics from at least one participant through the data-gathering interface; b) providing a data-gathering interface, receiving a plurality of completed hierarchical-based metrics from at least one participant through the data-gathering interface, storing the completed plurality of hierarchical-based metrics onto a computer-based medium, compiling the completed plurality of hierarchical-based metrics, and publishing the compiled plurality of hierarchical-based metrics; or c) providing a data-gathering interface, receiving a plurality of completed hierarchical-based metrics from at least one participant through the data-gathering interface, storing the completed plurality of hierarchical-based metrics onto a computer-based medium, compiling the completed plurality of hierarchical-based metrics, publishing the compiled plurality of hierarchical-based metrics, and retrieving the stored hierarchical-based metric results for comparison with hierarchical-based metrics previously received and stored; wherein each hierarchical-based metric comprises an attribute related to an organization, means for each participant to indicate satisfaction with said attribute, and means for each participant to assess value of importance with said attribute.

9577940

14189027

1. A method for identity-aware load balancing, the method comprising: identifying, using an attribute communicated with a packet, at an application executing in a data processing system, a sender of the packet, wherein the packet is directed to a set of resources managed by a load balancer; selecting a rule corresponding to the sender; changing, based on the sender, a manner of queuing the packet at the load balancer prior for a load balancing operation using a subset of resources; executing, using a processor and a memory, the rule to identify a characteristic of an algorithm, the identified characteristic being usable in the load balancing operation of the load balancer; communicating the packet and the identified characteristic of the algorithm to the load balancer; causing, responsive to the communicating, the load balancer to select an algorithm for a load balancing operation with the packet such that the selected algorithm includes the identified characteristic of the algorithm; and further causing, responsive to the communicating, the load balancing operation to instruct the subset of resources to use a determined type of cryptography with the packet.

20130031025

13571197

1. A method for estimating an expected value of a financial contract, the method comprising: receiving observable market data; calibrating one or more financial models using the market data to obtain estimates for one or more model parameters corresponding to each of the one or more financial models; generating a set of model risk metrics, the set of model risk metrics comprising: for each of the one or more financial models, one or more corresponding financial model partial derivative functions representing a rate of change of the financial model with respect to each of its corresponding model parameters; and for each of the model parameters, one or more corresponding model parameter partial derivative functions representing a rate of change of the model parameter with respect to each of the market data, parsing the contract into a set of contract valuation functions, the set of contract valuation functions depending, at least in part, on a subset of the model parameter estimates and the set of contract valuation functions including an ultimate contract valuation function representative of the value of the contract; generating a set of contract valuation risk functions corresponding to the set of contract valuation functions, each of the set of contract valuation risk functions comprising one or more partial derivatives of a corresponding contract valuation function with respect to all inputs to the corresponding contract valuation function; estimating an expected value for the contract, the expected value for the contract comprising an expected value for the ultimate contract valuation function; and estimating one or more expected values for risk of the contract, each expected value for the risk of the contract comprising an expected value for one of the contract valuation risk functions corresponding to the ultimate contract valuation function.

9215030

14238651

1. A method for allocating spectral capacity in an optical network comprising the steps of: receiving a connection demand specifying a source node, a destination node and a capacity; routing the connection demand to define a set of links connecting the source node and the destination node; adding the connection demand to a connection demand list associated with each link in the set of links; determining a set of candidate lightpaths, where each candidate lightpath provides connectivity over one or more links belonging to the set of links; determining a set of connection demand matching lightpaths by selecting candidate lightpaths providing connectivity over an unallocated subpath, the unallocated subpath having one or more links where each link has the connection demand in the connection demand list; determining a spectral resource saving for each connection demand matching lightpath; allocating a subpath by selecting a connection demand matching lightpath based on spectral resource saving and by deleting the connection demand from the connection demand list of each link having connectivity provided by the selected connection demand matching lightpath; and if another unallocated subpath remains, repeating the steps of determining a set of connection demand matching lightpaths and allocating.

8787732

13227352

1. A non-transitory computer readable medium storing a media-editing application which when executed by at least one processing unit exports metadata associated with a composite presentation, the media-editing application comprising sets of instructions for: exporting, from the media-editing application, a composite presentation that was created by the media-editing application, said composite presentation having an associated set of metadata and a set of export rules, wherein the set of metadata has data that describes the composite presentation; identifying, based on the set of export rules for the set of metadata, a subset of the associated set of metadata to export with the composite presentation; and exporting, from the media-editing application, the identified subset of the metadata set.

9870546

14493451

1. Computer apparatus for analyzing industrial turnaround or construction project execution estimates, the apparatus comprising one or more data stores, one or more processors in operative communication with the data stores, and one or more tangible computer-readable media upon which is encoded machine-readable software which, upon its execution, is configured so that the system carries out a process comprising: receiving from one or more user interfaces, and storing in one or more of the data stores, current estimated data expressed initially as, or convertible into, and one or more of current estimated cost data, current estimated man-hour data and current estimated duration data, attributable a plurality of risk-determinative conditions for one or more project tasks; receiving from one or more of the user interfaces, and storing in one or more of the data stores, historical estimated potential inefficiency contributor data expressed initially as, or convertible into, one or more of historical estimated cost data, historical estimated man-hour data and historical estimated duration data, attributable to each of the risk-determinative conditions for the project tasks; receiving from one or more of the user interfaces, and storing in one or more of the data stores, one or more quantitative adjustments to the current estimated data and the historical estimated potential inefficiency contributor data, which quantitative adjustments at least in part account for either anomalous historical risk which is no longer anticipated with respect to the historical estimated potential inefficiency contributor data, or newly known risk which is anticipated with respect to the current estimated data, or both, and by means of the processors summing the quantitative adjustments, if any, respectively with the current estimated data and the historical estimated potential inefficiency contributor data attributable to each of the risk-determinative conditions for the project tasks, to yield validated current estimated data and validated historical estimated potential inefficiency contributor data attributable to each of the risk-determinative conditions for the project tasks; calculating by means of one or more of the processors a difference between a current estimated inefficiency factor applied to the validated current estimated data and a projected inefficiency factor applied to the validated historical estimated potential inefficiency contributor data for each of the risk-determinative conditions for each of the project tasks, to yield an initial risk value for each of the risk-determinative conditions for each of the project tasks; receiving from one or more of the user interfaces, and storing in one or more of the data stores, a probability of occurrence for each of the risk-determinative conditions and calculating a quantified value of risk for each of the risk-determinative conditions by multiplying each of the initial risk values by the respective probability of occurrence; receiving from one or more of the user interfaces, and storing in one or more of the data stores, a probability of mitigation success for each of the risk-determinative conditions and any cost of mitigation to be undertaken; calculating by means of one or more of the processors a final risk value for each of the risk-determinative conditions, by multiplying each probability of mitigation success by the respective quantified value of risk for each of the risk-determinative conditions, and summing the resulting product with the cost of mitigation to be undertaken; and generating by means of one or more of the processors a final risk value output configured to enable a representation of the final risk value for each of the risk-determinative conditions to be electronically displayed.

20030152261

10336201

1. A robot apparatus acting autonomously based on an inner state of the robot apparatus, comprising: storage means for speech recognition, as a dictionary for speech recognition, having stored therein the relationship of correspondence between a word and the pronunciation information thereof; word sound expression storage means, as a table for word sound expressions, having stored therein the relationship of correspondence between the word and the word reading expressing letters thereof; imaging means for photographing an object; image recognition means for extracting the predetermined patterns of images from the image photographed by said imaging means; sound collecting means for acquiring the surrounding sound; speech recognition means for recognizing the speech from the sound collected by said sound collecting means; reading information generating means for conferring plural word reading expressing letters, inferred from the predetermined patterns of images extracted by said image recognition means, based on said table for word sound expressions, and for generating the pronunciation information corresponding to the reading for each of the plural word reading expressing letters or characters thus conferred; and storage controlling means for comparing the pronunciation information generated by said reading information generating means to the pronunciation information of the speech recognized by said speech recognition means and newly storing the closest information of pronunciation in said dictionary for speech recognition as being the pronunciation information corresponding to the pattern recognition result extracted by said image recognition means.

5485610

08292575

1. A process implemented by a computer system for generating a physical design for a database, the database to include data records and index records, the index records to access data stored in the data records, comprising: retrieving a set of expert rules from a memory of the computer system; accepting a logical schema as input, said logical schema to describe a logical arrangement of the database; accepting a data volume definition as input, said data volume definition to describe an amount of data to be stored in the database; defining a plurality of first operations, each first operation of said plurality of first operations to access the data of the database; accepting a first workload description as input, said first workload description to specify a first workload for each first operation of said plurality of first operations; grouping selected first operations of said plurality of first operations into a plurality of second operations, each second operation including at least one first operation, and each first operation being grouped in at least one second operation; accepting a second workload description as input, said second workload description to specify a second workload for each second operation of said plurality of second operations; grouping selected second operations of said plurality of second operations into a plurality of third operations, each third operation including at least one second operation, and each second operation being grouped in at least one third operation; accepting a third workload description as input, said third workload description to specify a third workload for each third operation of said plurality of third operations; selectively applying said set of expert rules to said logical schema and said data volume description and said first workload description and said second workload description and said third workload description to generate the physical design of the database, the physical design to specify how the data will be physically stored in the data records and how the data records are accessed by the index records.

7672672

11148897

1. A method executed by a processor, comprising: calculating a penalty value representing a quantification of cost associated with a channel assignment if said channel assignment does not satisfy predetermined constraints, wherein the channel assignment associates one or more channels with each sector of a wireless communications network and wherein said predetermined constraints include channel separation information indicating a minimum channel separation requirement between pairs of sectors; modifying said channel assignment in accordance with a penalty function if said channel assignment does not satisfy predetermined constraints; and modifying said channel separation information in accordance with additional predetermined constraints including carrier to interference values representing strength of a signal transmitted at a frequency if first and second sectors included in the wireless communication network are both assigned the same frequency, said carrier to interference values considering the strength of the signal from the first sector operating at a first channel in conjunction with interference generated by the second sector also operating at the first channel.

20120095694

13279514

1. A method for quantifying measurements of a protein, the method comprising the steps of: selecting a metric for determining substantially optimal combination of true positives and false positives in at least one data set; applying an optimization technique; and obtaining, from the results of the optimization technique, a value for at least one optimization parameter, said value for at least one optimization parameter resulting in substantially optimal combination of true positives and false positives; wherein the obtaining at least one optimization parameter comprises obtaining a value of a number of independent measures; wherein obtaining a value of a number of independent measures comprises obtaining at least one combination of a value of a number of independent measures and a value for a confidence measure; said independent measures comprising measures of a parameter of the protein obtained using different measurement criteria; wherein a number of true positives and false positives are a function of at least one combination of the number of independent measures and the confidence measure.

20030046006

10231902

1. A method for classifying AVO anomalies in near-offset and far-offset seismic data volumes, comprising the steps of: (a) calculating a plurality of initial AVO seismic attributes in the near-offset and far-offset seismic data volumes; (b) constructing a probabilistic neural network from the calculated initial AVO seismic attributes; (c) calculating AVO anomaly classifications in a portion of the near-offset and far-offset seismic data volumes, using the constructed probabilistic neural network; (d) repeating steps (a) through (c) until the calculated AVO anomaly classifications in the portion of the near-offset and far-offset seismic data volumes are satisfactory; and (e) calculating AVO anomaly classifications throughout the near-offset and far-offset seismic data volumes, using the constructed probabilistic neural network.

20090290800

12471341

1. A system for processing exogenous feature vectors to recognize patterns, each exogenous feature vector being a feature vector input to said system, said system comprising at least one processing unit that comprises (a) storage means for storing at least one expansion correlation matrix; (b) expansion means, responsive to a feature subvector input to said processing unit, for generating at least one orthogonal expansion of a subvector of said feature subvector; and (c) estimation means for using said at least one expansion correlation matrix and said at least one orthogonal expansion to produce a representative of a probability distribution of a label of said feature subvector.

9026442

14459696

1. A method comprising: identifying an acoustic model, wherein the acoustic model is trained on native speech in a target dialect; identifying a class of a speaker; and replacing a phoneme in the acoustic model with a modified phoneme, wherein the modified phoneme is a weighted sum of plausible phonemes in a lattice of plausible phonemes associated with the class of the speaker.

8606674

13684926

1. A computer-implemented analysis method comprising: generating, with a computer processor, a graphical representation of income inflow and outflow activity occurring within a group of one or more asset objects selected in association with one or more client asset accounts for a predetermined time period; generating, with the computer processor, a calculation of estimated future income for a future period associated with the predetermined time period; displaying, with the computer processor, the estimated future income value expected for the client asset accounts for the future period of the predetermined time period; and displaying, with the computer processor, a multi-segmented graphical display comprising: a first segment having a dimension proportioned to visually illustrate actual income outflow value from the selected accounts for the predetermined time period; a second segment having a dimension proportioned to visually illustrate actual income inflow value into the selected accounts for the predetermined time period; and a third segment having a dimension proportioned to visually illustrate estimated future income value for the selected accounts for the future period of the predetermined time period.

20050074168

10678935

1. A 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 digital information contains a plurality of segments; pre-processing said digital information to obtain a plurality of feature vectors; and discriminatively selecting a keyframe for each segment that is both representative of said segment and distinguishable from other selected keyframes.

20110172981

13120064

1. A method for analyzing the structural conformations of a target effector molecule comprising: a. providing a target effector molecule having an artificial elongated sequence comprising one or more variable kinks; b. obtaining residual anisotropic interaction and spin relaxation data from said target effector molecule having said elongated structure using nuclear magnetic resonance spectroscopy, X-ray crystallography or both; c. creating a plurality of atomic-resolution dynamical ensembles reflecting motional trajectories of said target effector molecule by constructing computational models of said target effector molecule using one or more computer modeling programs comprising Molecular Dynamics, Monte Carlo, CHARMM, FELIX, QUANTA, or GrowMol; d. selecting a plurality of said dynamical ensembles using a computational simulation algorithm to generate a plurality of conformers that satisfy said residual anisotropic interactions and spin relaxation data obtained in step b; e. identifying a plurality of dominant conformers from said dynamical ensembles; and f. selecting and outputting said dominant conformers and motional trajectories of said target effector molecule.

20150160115

14620720

1. A system for performing computer aided flow cytometry experiments, the system comprising: detection electronics configured to obtain measurement data of a set of cytometric events for particles in a sample subjected to a flow cytometric experiment; a processor in data communication with the detection electronics, the processor configured to: obtain the measurement data; model the measurement data using a plurality of p-dimensional parametric distributions, the plurality of p-dimensional parametric distributions including at least a number, G, p-dimensional parametric distributions; provide an initial estimate of the parameters of said G p-dimensional parametric distributions; iteratively estimate updated parameters for each of the p-dimensional parametric distributions, wherein said estimating comprises: calculating, for each event, a posteriori probabilities that said event is a member of each of said parametric distributions, identifying a subset of said events that are within a neighborhood of at least one of said distributions based on a comparison of an event location to center points of respective distributions, wherein a number of events included in the identified subset of said events is less than a number of events in the set, and calculating, for each of the parameters for each of the p-dimensional parametric distributions, an updated estimate based on the calculated a posteriori probabilities for each event in the identified subset of said events, wherein said estimating is iterated at least once, and wherein subsequent calculation of the a posteriori probabilities is based on the updated estimate for the parameters; and after said iterative estimating, identify a gate indicating a population of the particles from each of the p-dimensional parametric distributions using the updated parameter estimates.

20100250574

12411524

1. A computer-implemented method for processing an abstract query of an underlying physical database, comprising: providing a database abstraction model, wherein the database abstraction model provides (i) a plurality of logical fields that each specify an access method defining a method for accessing data associated with a respective logical field, and (ii) a plurality of model entities, wherein each model entity specifies a set of logical fields that map to data related to a respective model entity and specifies an identifier in the underlying database used to identify instances of the respective model entity; receiving an abstract query composed from one or more logical fields of the database abstraction model, wherein at least a first logical field in the abstract query is specified in a dictionary term criteria condition, wherein the dictionary term criteria condition includes a list of one or more keywords, wherein the access method specified by the first logical field maps the first logical field to a plurality of documents related to a given instance of the model entity, and wherein the dictionary term criteria condition is evaluated by determining whether the plurality of documents related to the given instance of the model entity includes at least a distinct document containing a respective one of the one or more keywords; generating, from the abstract query, a resolved query of the underlying physical database; and storing the resolved query for execution against the underlying physical database.

20020004242

09905758

1. A dual selection cassette comprising (i) a first DNA segment having homology to a eukaryotic virus or eukaryotic viral vector and (ii) a second DNA segment having homology to said eukaryotic virus or eukaryotic viral vector, (iii) a positive selection gene promoter, and operably linked thereto, (iv) a DNA encoding a positive selection gene product, (v) a negative selection gene promoter and, operably linked thereto, (vi) a DNA encoding a negative selection gene product, wherein said DNA encoding a positive selection gene product is proximal to said DNA encoding a negative selection gene product, and (vii) a unique restriction enzyme site.

20110185328

13013654

1. A system for circuit floorplanning comprising: a central processing unit with data storage wherein a B*-tree data structure of a floorplan and circuit related constants reside in said central processing unit data storage; a multiprocessor with data storage; said B* tree structure of a floorplan along and said circuit related constants are copied to the multiprocessor data storage wherein multiple thread blocks, each consisting of a single thread, copy the tree to their own shared memories concurrently; said multiprocessor concurrently evaluates different moves in said different thread blocks; said multiprocessor evaluates an objective function producing objective function results and stores said objective function results in said multiprocessor data storage; wherein said objective function results are copied to said central processor data storage.

8972067

13105781

1. A system comprising: a risk calculation system programmed to calculate a risk based on a static input and a dynamic input; and a decision support system programmed to use the risk to derive a decision; and a plant control system programmed to update operations of a plant based on the decision, to observe a plant system, and to store plant system observations as historical data, wherein the decision predicts future plant conditions, wherein the static input comprises a business environment data, wherein the dynamic input comprises a signal representative of an unexpected maintenance event, and wherein the plant control system is configured to analyze the signal representative of the unexpected maintenance event and the historical data to credit the unexpected maintenance event in lieu of performing an equipment test event related to the plant system.

9298452

14052290

1. A method for improving quality of a code listing, the method comprising: receiving a code listing; receiving concept specification information corresponding to a concept to be identified in the code listing, the concept specification information comprising a code pattern illustrating the concept, wherein the code pattern comprises a predetermined length of source code or object code that defines the concept; using the concept specification information to define a rule by: parsing the code pattern to generate pre-configured prompts specific to the code pattern, and identify at least one token, receiving selection of a code element and a condition related to the code pattern in response to the pre-configured prompts, and defining the rule based on the received selection of the code element and the condition, and the at least one token and according to a token-to-rule mapping; identifying occurrence of the concept in the code listing based on the rule; generating, by a processor, information regarding the occurrence of the concept in the code listing as an indication of the quality of the code listing; and recommending a measure to transform the code listing to satisfy the concept to improve the quality of the code listing.

6086617

08898041

1. A user directed search method for optimizing a model having input and output parameters, where the steps of the method are performed using a computer having a memory device and the computer executes at least one executable program that simulates the model and the input and output parameters are inputs and outputs to the at least one executable program, and the steps comprise the following: a. Creating a dependency table stored in the memory device, where the dependency table correlates the input parameters to the output parameters of the model and the dependency table indicates how input parameter values should be permutated and the table is at least partially created by a user based on empirical data available to the user and based on user-defined goals; b. For a selected output parameter, specifying a group of input parameters, including some but not all of the inputs to the model, that influence the selected output parameter; c. Repeating step (b) for a plurality of the output parameters; d. For each output parameter of the plurality of output parameters, permutating values for the input parameters in the group of input parameters that influence the selected output parameter; e. Solving the model using the permutated values as the input parameters to the model by executing on the computer the at least one executable program using the permutated values as input values to the program; f. Optimizing the model by repeating steps (d) and (e) iteratively in accordance with one or more of the goals; g. Ending the optimization step (f) after an incremental gain in advancing the solution toward the goal is less than a predetermined minimal gain, and h. Outputting an optimized solution to the model after step (g).

9390211

14593903

1. In an electronic design automation (EDA) tool, a method for placing a circuit design, the method comprising: receiving a netlist for the circuit design, wherein the netlist describes interconnections between a plurality of cells; representing the netlist as a graph; performing, using one or more processors, fuzzy clustering on the graph to obtain a set of clusters and a set of probability values, wherein each probability value corresponds to a probability of a given cell belonging to a given cluster; partitioning the netlist based on the set of clusters and the set of probability values to obtain a partitioned netlist; placing the partitioned netlist to obtain a placed circuit design, wherein cells of each partition are placed in a layout bin corresponding to the partition; and optimizing the placed circuit design, wherein said optimizing reassigns at least one cell to a different layout bin based on the set of probability values.

8370282

12507276

1. A computer-implemented method, comprising: obtaining, by a data processing device, initial quality scores for relevant images for a query, the relevant images being images previously selected to be referenced by search results for the query; selecting, by a data processing device, a query-specific transformation factor for the query the transformation factor representing a measure of importance of image quality for computing relevance scores of relevant images for the query, the transformation factor being selected based, at least in part, on a comparison of a first number of previous user selections of high quality images for the query to a second number of previous user selections of high quality images for one or more other queries, a high quality image being an image having an initial quality score that meets a threshold score; computing query specific quality scores for the relevant images based on a function of the transformation factor for the query and the initial quality scores for the images; and computing adjusted relevance scores for the relevant images based on the query specific quality scores and initial relevance scores for the relevant images.

8831901

13161262

1. A computerized method for ranking tests of interest, the method comprising: determining a set of failure modes of interest by a processor; determining a set of tests of interest; computing a differentiation factor for each of the tests of interest; and ranking each of the tests of interest based on respective differentiation factors.

20100005088

12263414

1 ) A method, comprising: crawling a computer network to identify documents that name an individual; generating summaries of the documents with articles in an encyclopedia; building a profile of the individual with the summaries; and searching the profile to provide responses to search queries.

20130096909

13272553

1. A method for extraction of suggestions for improvement comprising: providing a structured terminology for a topic, the structured terminology including a set of semantic classes, each of a plurality of the semantic classes including a finite set of terms; providing a thesaurus of terms relating to suggestions of improvement; receiving a corpus of text documents, each document comprising a text string in a natural language; labeling text elements in the text strings which are instances of terms in the structured terminology with the corresponding semantic class; labeling text elements in the text strings which are instances of terms in the thesaurus; with a processor, applying a set of patterns to the labeled text strings to identify suggestions of improvement expressions, the patterns each defining a syntactic relation between text elements, the patterns including: for each of the semantic classes in the set, at least one pattern which specifies a syntactic relation in which one of the text elements in the relation is labeled as an instance of the semantic class, and wherein at least one of the patterns specifies a syntactic relation in which one of the text elements in the relation is labeled as an instance of one of the terms in the thesaurus; and outputting a set of suggestions for improvements based on the identified suggestions of improvement expressions.

20150031028

14367325

1. A method for quantifying a species of double-stranded nucleic acid molecules comprising a specific nucleic acid sequence in a sample, said method comprising: a) denaturing said double-stranded nucleic acid molecules in the sample by applying a physical force to said molecules; b) providing a single-stranded nucleic acid molecule corresponding to said sequence; c) renaturing said denatured double-stranded nucleic acid molecules of a) in the presence of said single-stranded nucleic acid molecule; d) detecting the double-stranded nucleic acid molecules where renaturation is blocked; and e) numerating the double-stranded nucleic acid molecules of d).

20030005175

10159209

1. A state machine for use in a process control system for managing processing of inter-task messages between tasks under control of a real-time operating system, the inter-task messages created as a result of hardware events and software events, the state machine comprising: a first data structure containing one or more first entries, each said one or more first entries including: a pointer to a second data structure, and a counffield, said one or more first entries each representative of a state, and said count field representative of a count of events valid for said state; and a said second data structure containing one or more second entries, each said one or more second entries including a Type field, an Event field, a Message ID field, and a state transition routine pointer for providing the address of the state transition routine.

8533711

12627950

1. A computer-implemented method, comprising: determining, by a host controller machine, candidate hosts to place a target virtual machine (VM); obtaining, by the host controller machine, a memory sharing history of the target VM with VMs hosted by each of the candidate hosts; for each candidate host in a set of the candidate hosts, determining, by the host controller machine, an average memory sharing history amount based on the memory sharing history of the target VM with the VMs hosted by the candidate host, wherein the average memory sharing history amount for a candidate host is determined only for the VMs hosted by the candidate hosts that have a standard deviation of memory sharing history below a threshold amount of memory sharing history with the target VM over a predetermined time interval; and adjusting, by the host controller machine, a general selection algorithm for the candidate host of the set of candidate hosts having a highest value of the average memory sharing history amount with the target VM.

20130227574

13823669

1. An information processing device comprising: a process function information storing unit for storing performance information representing performance of respective process functions executing predetermined processes, respectively; and a procedure correcting unit for correcting a procedure composed of the process functions so that a performance requirement representing performance required for the whole procedure is satisfied based on the performance information of the respective process functions.

20030069871

10034601

1. A Meta Model for building a knowledge-oriented software application using an object-oriented programming language, the Meta Model comprising: a Meta Knowledge Model comprising a specification of how the knowledge-oriented software application represents knowledge; a Meta Logic Model comprising a specification of how the knowledge-oriented software application derives new knowledge; a Knowledge Definition Model comprising a specification of how the knowledge-oriented software application is converted from a human-readable format to executable code; a Catalog Model comprising a specification of how the knowledge-oriented software application organizes the knowledge within an electronic device; and a Run-time Model comprising a specification of how the knowledge-oriented software application enables concurrent clients to manipulate the knowledge stored in the electronic device.

9973514

14874620

1. A method for assuring location data integrity with minimum location disclosure comprising steps of: using Prefix-verifiable Message Authentication Codes (PMAC) to assure the integrity of the location data exchanged between a client device executing an authenticator and a verifier, wherein under the PMAC scheme, a variable-length prefix of the location data and a one-way-irreversible transformation of a corresponding suffix of the location data are presented to the verifier to allow the verifier to compute a result for comparing a received PMAC to verify the received prefix without compromising confidentiality of the suffix; using the PMAC from the previous step to authenticate/verify for spatial and spatio-temporal predicates; and using one or more message authentication codes indexes and one or more optimization techniques to reduce computation and communication costs; wherein the PMAC is generated via steps comprising: generating a symmetric key and securely sharing this symmetric key between the authenticator and the verifier; generating a random value of r; generating a PMAC value of the location data string x at timestamp t with respect to the symmetric key generated in the first step; and storing at least one tuple of (r, PMAC(x, t)) together with the location data string x and timestamp t on the client device executing the authenticator for authentication/verification.

20060290698

11446491

1. A computer readable medium having computer-executable instructions, comprising: calculating the sharp points of a digital ink file; defining segments between the sharp points by mathematical expressions; and storing information about the sharp points and the mathematical expressions as a backbone spline of the digital ink file.

8778643

13802136

1. A method of increasing lipid levels in an algal cell population, comprising: contacting an algal cell population with at least one compound in an amount sufficient to increase lipid levels in said cell population, wherein said at least one compound comprises an antioxidant compound, and does not inhibit fatty acid metabolism.

8983944

13726220

1. A method for providing information about a main knowledge stream using an apparatus for providing the same, the method comprising: obtaining, at an information process module of the apparatus, reference links representing reference relationships among reference documents for each of a plurality of documents stored in a database; defining, at the information process module, one or more paths connecting the reference links for each of the plurality of documents; determining, at the information process module, a longest path among the defined paths as a basic path for each of the plurality of documents; calculating, at the information process module, probability values of the reference links by overlapping the determined basic paths; determining, at the information process module, a first document from among the documents and an input reference link for the first document, and performing at the information process module, a Markov chain model using a probability value of the input reference link; and calculating, at the information process module, the information about the main knowledge stream for the first document using a result obtained by performing the Markov chain model.

20140136188

14071631

1. (canceled)

20070239713

11392993

1. A method in a computing system for ranking web pages in a result set, comprising: establishing a system of ratings for combinations of a web page with a query term that reflect the level of relevance of the web page to the query term; in response to each of a plurality of content interactions performed by users, each content interaction performed with respect to a web page included as results in a result set that was generated in response to a query comprising a set of one or more query terms: adjusting a rating score for each combination of the web page and a query term among the set of query terms; and for each of a plurality of web pages included as results in a distinguished result set produced in response to a distinguished query comprising a set of distinguished query terms: selecting established and adjusted rating scores for each combination of the web page and a query term among the distinguished set of query terms, and determining a ranking score for the web page in the distinguished query result by combining the selected rating scores.

20180006957

15199265

1. A computing-device implemented method comprising: receiving a plurality of training data points, wherein each data point in the plurality of training data points includes a voice call quality value and values for a plurality of key performance indicators (KPIs) related to voice over wi-fi voice call quality; determining, for each KPI of the plurality of KPIs and using the plurality of training data points, a correlation between the KPI and the voice call quality value; selecting a subset of the plurality of KPIs based on the correlation; performing a plurality of discrete regression analyses based on the subsets of the plurality of KPIs and the voice call quality values to generate a plurality of regression results; determining an accuracy for each of the plurality of regression results; assigning weights to each of the plurality of regression results based on the determined accuracies; combining the plurality of regression results using the assigned weights to generate a final combined estimated voice over Wi-Fi (VoWiFi) voice call quality algorithm that accurately predicts the voice call quality value based on values for the selected subset of the plurality of KPIs; receiving a new subset of the plurality of KPIs; and determining the estimated VoWiFi voice call quality value based on the combined estimated VoWiFi voice call quality algorithm and the new subset of the plurality of KPIs.

10108520

15040155

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

20130046577

13657432

1. A method of determining a measure of engagement of an audience for a presentation providing a sensory stimulus comprising: exposing the audience to the presentation over a period of time, wherein said period of time is divided into two or more time slots; for each member of said sample population, measuring a plurality of biologically based responses to said presentation; for each time slot, determining at least one intensity value as a function of at least one of the measured biologically based responses, for each time slot, determining at least one synchrony value as a function of a rate of change of at least one of the measured biologically based responses; and for each time slot, determining at least one engagement value as a function of at least one of said intensity values and at least one synchrony value.

8762066

11981578

1. A method for identifying amino acid residues for variation in a protein variant library in order to affect a desired activity, said method comprising: (a) receiving data characterizing a training set of a protein variant library, wherein the data provides activity and an amino acid sequence for each protein variant in the training set; (b) from the data, developing a sequence-activity model for predicting activity as a function of multiple independent variables, wherein the sequence activity model comprises a plurality of linear terms and one or more non-linear terms, the linear and non-linear terms are separated by plus or minus signs, each linear term comprises the product of a coefficient and a bit-value independent variable, wherein the coefficient of the linear term indicates the relative impact on activity by the bit-value independent variable, and wherein the bit-value independent variable specifies the presence or absence of only one particular amino acid residue of a specific residue type at a specific sequence position, and each non-linear term is a cross-product term comprising the product of a coefficient and two or more bit-value independent variables, wherein the coefficient of the non-linear term indicates the relative impact on activity by the interaction of the two or more bit-value independent variables, and wherein each of the two or more bit-value independent variables specifies the presence or absence of a particular residue of a specific residue type at a specific sequence position; and (c) using the sequence-activity model to identify one or more amino acid residues at specific positions for varying or fixing to impact the desired activity, wherein operations (a)-(c) are performed by executing instructions on a computer system programmed to perform said operations.

20140055499

13769276

1. A computer-readable storage medium encoded with computer-executable instructions for performing operations that dynamically compose a sequence of views of an object, the operations comprising: receiving display content for the sequence of views; automatically rendering the sequence of views to create a graphical depiction of traversal of the object, including: determining an amount of time to display a particular view of the sequence of views, the amount of time selected for the particular view based at least in part on at least one of: a complexity of at least a portion of the object depicted in the particular view, and an indication of a user's familiarity with at least the portion of the object depicted in the particular view; and displaying the rendered sequence of views on an output device.

20150260034

14211751

1. A method for determining mineralogy of rock comprising: determining a model of arenites in the rock by using a processor to perform a first type of linear regression on a plurality of elemental dry weights of the rock based upon a sum of elemental dry weights of calcium and magnesium being at least a given value, or perform a second type of linear regression on the plurality of elemental dry weights based upon the sum of the elemental dry weights of elemental calcium and magnesium being less than the given value; determining a model of arkoses in the rock, by performing a third type of linear regression on the plurality of elemental dry weights, using the processor; determining a partitioning function, using the processor; and determining the mineralogy of the rock by using the processor to apply the partitioning function to the model of arenites and the model of arkoses, and add the model of arenites and the model of arkoses together to create a combined model.

20030222906

10367261

1. A system for application development, comprising: a data-modeling framework configured to enable a user to define a logical data model, the data-modeling framework dynamically translating the logical data model into a corresponding physical data model, wherein changes to the logical data model are automatically adjusted in the physical data model accordingly; and a content management framework coupled to the data-modeling framework, the content management framework configured to provide tools to enable the user to manage content associated with the physical data model based on the logical data model.

20090022311

12169795

1. A method of generating a cryptographic value that satisfies a pre-determined criteria, the method comprising the steps of: (a) selecting a secret value; (b) performing a cryptographic operation on said secret value to generate the cryptographic value; (c) determining whether the cryptographic value satisfies the pre-determined criteria; and (d) repeating the sequence of steps starting at step (a) until the cryptographic value satisfies the pre-determined criteria.

8166022

12542937

1. A computer program product comprising a non-transitory computer useable storage medium to store a computer readable program, wherein the computer readable program, when executed on a computer, causes the computer to perform operations comprising: receiving a query for which a query execution plan (QEP) is to be computed, wherein a set comprising all possible QEPs for the query describes a search space, wherein each QEP of the set references a plurality of quantifiers; dividing the search space into a plurality of subproblems for which constituent QEPs referencing a smaller number of quantifiers are to be created; generating a skip vector array (SVA) that indicates disjoint quantifier sets between two subproblems; partitioning the plurality of subproblems into a plurality of partitions, wherein each of the subproblems within a partition references the same number of quantifiers; allocating each of the plurality of partitions to a thread of a plurality of threads within a multiple thread architecture, wherein a partition containing subproblems referencing fewer quantifiers is executed before a partition containing subproblems referencing more quantifiers; receiving from each of the plurality of threads a constituent QEP for each subproblem; and combining two constituents QEPs at the QEP optimizer server to determine a QEP referencing the combined set of quantifiers for the two constituent QEPs.

9466009

14565342

1. An object data processing system comprising: at least one processor configured to execute: a plurality of diverse recognition modules stored on at least one non-transitory computer-readable storage medium, each recognition module comprising at least one recognition algorithm and having feature density selection criteria wherein the feature density selection criteria include rules that operate as a function of features per unit volume representing pixels squared times a depth of field; and a data preprocessing module executed by at least one processor, the data preprocessing module comprising an invariant feature identification algorithm and configured to: obtain a digital representation of a scene; generate a set of invariant features by applying the invariant feature identification algorithm to the digital representation; cluster the set of invariant features into regions of interest in the digital representation of the scene, each region of interest having a region feature density; assign each region of interest at least one recognition module from the plurality of diverse recognition modules as a function of the region feature density of each region of interest and the feature density selection criteria of the plurality of diverse recognition modules; and configure the assigned recognition modules to process their respective regions of interest.

7765538

10977694

1. A method of selecting patches having patch attributes and successor patch relationships among a set of patches to recommend one or more patches for installation on a computer system comprising: selecting one or more patch analyzer programs from a collection of such programs; executing each selected patch analyzer program to analyze the set of patches in comparison to the computer system and the patch attributes containing information associated with the set of patches, causing each selected patch analyzer program to generate one or more issues associated with patch installation by processing the set of patches to identify one or more patches compatible with the selected patch analyzer program from the set of patches and with the computer system's installed operating system, programs, and patches; identifying goals to resolve one or more of the issues through the installation of at least one of the identified one or more patches or a successor to the one or more patches based on the one or more patches, the one or more issues, and patch dependencies; and generating mutually consistent patch installation recommendations from the identification of the goals that satisfy as many goals as possible and that satisfy the patch dependencies of the one or more patches on the prior installation of other patches, based on patch attributes and successor patch relationships among the patches, each recommendation including a coordinated set of proposals to a user to install the one or more patches to achieve a given subset of the goals while satisfying the patch dependencies.

9424011

14231895

1. A computer program product for recursive expression simplification, the computer program product comprising: one or more computer readable tangible storage media and program instructions stored on at least one of the one or more storage media, the program instructions comprising: program instructions to identify a candidate loop, where the candidate loop includes one or more reduction variables and reduction operations; program instructions to alter grouping of loop invariants and loop variants within the candidate loop; program instructions to perform recursive expression simplification for an inner loop located within the candidate loop, wherein recursive expression simplification includes removing a mathematical operation from the inner loop and combining the removed mathematical operation with a result of an iterative calculation of the inner loop; program instructions to create a new reduction variable, wherein the new reduction variable is equal to the result of the iterative calculation of the inner loop; program instructions to create a prologue statement, wherein the prologue statement initializes the new reduction variable based on at least the removed mathematical operation; program instructions to replace an original loop reduction variable in the candidate loop with the new reduction variable; program instructions to create an epilogue statement, wherein the epilogue statement represents the replacement of the original loop reduction variable, such that the removed mathematical operation is performed subsequent to the iterative calculation of the inner loop; program instructions to determine if the inner loop is invariant with respect to an outer loop, wherein the outer loop is located within the candidate loop; and program instruction to, responsive to determining the inner loop is invariant with respect to the outer loop, perform invariant loop motion.

20170293687

15157722

1. A method, comprising: performing, by a processing device, a semantico-syntactic analysis of a natural language text of a corpus of natural language texts to produce a semantic structure representing a set of semantic classes; identifying a natural language text feature to be extracted from the semantic structure using a set of values of a plurality of feature extraction parameters; partitioning the corpus of natural language texts into a training data set comprising a first plurality of natural language texts and a validation data set comprising a second plurality of natural language texts; determining, in view of the category of the training data set, the set of values of the feature extraction parameters, by optimizing a function reflecting a number of natural language texts of the validation data set that are classified correctly by the text classifier model using the set of values of the feature extraction parameters; and classifying the natural language text by applying the text classifier model using the set of values of the feature extraction parameters.

20110107453

12939226

1. A method of selecting a maize plant with enhanced resistance to tropical rust comprising: a. detecting in the maize plant a first marker allele that is linked to and associated with: i. a “T” deletion at position 16 of PHMTR; or ii. a “GAG” haplotype at positions 337-339 of reference sequence SEQ ID NO:167; and b. selecting said maize plant that has the first marker allele.

RE41740

11706836

1. A computed tomography method, comprising: determining a maximum Z location error; determining a weighted average Z location error; selecting a threshold value associated with the maximum Z location error and the weighted average Z location error; prescribing an N+1 sector reconstruction algorithm; if the maximum Z location error is less than the threshold value or the weighted average Z location error is less than the threshold value, performing an N+1 sector reconstruction; and if the maximum Z location error exceeds the threshold value or the weighted average Z location error exceeds the threshold value, prescribing an N sector reconstruction.

5392487

08166942

1. A universal connector for connecting a windshield wiper blade framework having a connector channel to a windshield wiper arm comprising: a) first and second side plates spaced such that they are adapted to fit within the connector channel, each side plate defining a first hole having a first diameter and a second hole having a second diameter such that the second diameter is less than the first diameter, the first and second side plates positioned such that the first holes are coaxially aligned with each other and the second holes are coaxially aligned with each other; and b) a bridge plate assembly extending between and connected to each of the first and second side plates, the bridge plate assembly having a top and bottom rear edge; and c) an upper leaf spring having a substantially circular opening and an elongated slot therein, said upper leaf spring is connected to and extends from said top rear edge of said bridge plate assembly; d) a front lower leaf spring spaced from the upper leaf spring, the front lower leaf spring having a lower surface and at least one protruding conical tab extending from the lower surface, the front lower leaf spring positioned such that at least a portion thereof extends across the first holes said front lower leaf spring is connected to and extends from said bottom rear edge of said bridge plate assembly; and e) a rear lower leaf spring spaced from the upper leaf spring and positioned such that at least a portion thereof extends across the second holes said rear lower leaf spring coupled between and to each of said side plates.