Datasets:

patent

/

AIPD_evo_claim_one

like 0

20140080720

14089720

1. A method for performing prenatal diagnosis of a sequence imbalance in a biological sample obtained from a female subject pregnant with a fetus, wherein the biological sample includes nucleic acid molecules that are part of nucleic acid sequences, the biological sample including nucleic acid molecules from the fetus and the female subject, the method comprising: for each of a plurality of the nucleic acid molecules in the biological sample: measuring a size of the nucleic acid molecule, and identifying which nucleic acid sequence the nucleic acid molecule is derived from; calculating, by a computer system, a first statistical value from the sizes of nucleic acid molecules from a first sequence; identifying one or more reference sequences that have a GC content that is similar to a GC content of the first sequence; calculating, by the computer system, a second statistical value from the sizes of nucleic acid molecules from the one or more reference sequences; determining a parameter using the first statistical value and the second statistical value, the parameter being a difference or a ratio of the first statistical value and the second statistical value; and determining a classification of whether a sequence imbalance exists for the first sequence based on a comparison of the parameter to a cutoff value.

8038076

12017665

1. A method of controlling a solenoid-operated fluid valve that has an output hydraulic pressure that varies in accordance with an input solenoid control current delivered from a drive circuit, comprising the steps of: providing a model characterizing the plant dynamics of the solenoid-operated fluid valve and the drive circuit, the model being dependent on at least one operating parameter that may vary; measuring the value of the operating parameter; adjusting one or more gain constants for a selected control strategy, based on the measured operating parameter value, using the model; and determining a required solenoid control current based on the selected control strategy including the adjusted gain constants therefor; and applying the required solenoid control current to the solenoid-operated fluid valve.

20020010702

08794134

1. A method for handling first and second versions of a data object for storage and transmission, the method comprising the steps of: performing a consecutive linear pass over both versions; identifying a first matching byte-level string, occurring in the second version, which matches a string in the first version; and producing a set containing (i) identified matching segments and, (ii) for each of the identified matching segments, an offset reflecting the relative positions of the matching segments within the first and second versions; whereby, for versions whose matching strings are both local and sequential, the set closely approximates a set produced by a method of scanning the entire second version to find a best possible match with a string in the first version.

10032180

14316245

1. A method for forecasting demand comprising: generating a virtual promotion, wherein the virtual promotion comprises a combination of a category or sub-category, a location, and a price range; calculating a probability that a particular consumer would buy the virtual offer in a predetermined time period, wherein the probability is generated at least based on historical data related to the particular consumer and one or more related consumers; determining an estimated number of units to be sold for the virtual offer as a function of at least the probability, the estimated number of units representing a predicted demand; calculating a real time demand, wherein the real time demand is generated based on a plurality of generated identification pairs for the predetermined time period, wherein calculation of the real-time demand comprises: accessing, in real-time, user search data, the user search data generated by a user interacting with a promotion and marketing service to identify a requested promotion, the user search data comprising at least location specific data; generating an identification pair for the search data, the identification pair comprising a first classification and a second classification, the first classification identifying a promotion tuple, comprising at least a category of promotion, and the second classification identifying a location identified by the locations specific data, the first classification and the second classification generated by: normalizing the user search data, supplying the normalized user search data to a classifying model as attribute data and training the classifying model to recognize one or more patterns of attribute data, wherein the first classifier and the second classifier is a trainable classifier adapted using a supervised learning method, the first classifier and the second classifier adapted based on a training data set; determining, using a processor, total demand by summing the predicted demand and the real time demand; and subsequent to the determination of the total demand, distributing the total demand to multiple hyper-locations and multiple sub-categories due to the determination of the total demand for a portion of the virtual offers being identified by or including high level locations or categories, wherein the distribution of the total demand among the multiple hyper-locations and among the sub-categories comprising the distribution of the real time demand among the multiple hyper-locations and among the sub-categories.

20070077540

11376628

1. A flight training system, comprising: an in-flight component comprising: (a) a first processor; and (b) a first computer readable medium in communication with the first processor and comprising a first set of instructions executable by the first processor, the first set of instructions comprising: (i) instructions to collect a set of flight data about an aircraft during a training flight; and (ii) instructions to store the set of flight data on the first computer readable medium; and a ground component comprising: (a) a set of controls to provide control of a simulated aircraft; (b) a second processor in communication with the set of controls; (c) a second computer readable medium in communication with the second processor and comprising and a second set of instructions executable by the second processor, the second set of instructions comprising: (i) instructions to receive, from the in-flight component, the set of flight data collected during the training flight; (ii) instructions to provide a simulation of the training flight, based on the set of flight data collected during the training flight; (iii)instructions to receive a set of control data from the set of controls, to allow a student to participate in the simulation of the training flight; (iv)instructions to receive a set of modified flight data; and (v) instructions to modify the simulation of the training flight, based on the received set of modified flight data.

20140279782

13803404

1. A computer-implemented method comprising: selecting one or more users that are connected to a particular user by way of a social networking service or by a relationship described by a graph stored in a database, wherein each user interacts with one or more services; accessing, for each of the selected users, an interest score of the selected user that reflects the selected user's predicted interest in the particular topic, or interest data that that is used to determine the interest score of the selected user; accessing a model that is used for generating the interest score of the particular user that reflects the particular user's predicted interest in the particular topic, wherein the interest score of the particular user is generated based at least on the interest scores or interest data of the selected users for the particular topic; and applying the interest scores or interest data of the selected users for the particular topic to the model to generate the interest score of the particular user for the particular topic.

20060200755

11073418

1. A method for transforming operations on an attribute of data, the data being updated by multiple devices having a local copy of the data, the method comprising: applying at a first device a first operation to a first copy of the data and sending the first operation to a second device, the first operation having a first operator and a first range; applying at the second device a second operation to a second copy of the data and sending the second operation to the first device, the second operation having a second operator and a second range; when the second device did not apply the first operation before applying the second operation, transforming at the first device the second operation to resolve any conflict with the first operation and applying the transformed second operation to the first copy of the data after the first operation has been applied; and when the first device did not apply the second operation before applying the first operation, transforming at the second device the first operation to resolve any conflict with the second operation and applying the transformed first operation to the second copy of the data after the second operation has been applied, wherein the transforming ensures that after applying the transformed operations the first copy and the second copy of the data are consistent.

9501551

13928170

1. A system for categorizing items, the system comprising: a data store that stores item information related to a first plurality of items offered for sale using a network-based service; and a computing device having one or more processors, wherein the computing device is configured to operate the network-based service and is in communication with the data store, and wherein the network-based service is operative to: receive a request for a category recommendation for an item of the first plurality of items, the request including first item information associated with the item; and submit the first item information to a categorization service, wherein the categorization service is operative to: generate an item vector from the first item information according to a vector space model; compare the item vector to at least one category vector, wherein the at least one category vector comprises a representation of at least a portion of a textual description of an item category according to the vector space model, wherein the item category is maintained by the network-based service and associated with a second plurality of items; determine the category recommendation to be the item category when a deviation of an angle between the item vector and the at least one category vector is less than a threshold value; and update the first item information to include the item category.

8014590

11301292

1. A computer based partitioned modeling method for flexible recognition and extraction of patterns directed by human comprising the steps of: a) Input a plurality of user directed specification of image regions from learning image to be processed including “Patterns to enhance” region, “Patterns to suppress” region and “Background” region; b) Perform feature extraction on the image region having characterization feature output wherein the characterization feature output contains features derived from pre-processed grayscale intensity statistics of the image to be processed; c) Perform a plurality of hierarchical clustering using the characterization feature for background pattern removal and remaining patterns for patterns to enhance and patterns to suppress having a plurality of hierarchical partitions outputs corresponding to background, patterns to enhance and patterns to suppress; d) Perform model generation using the hierarchical partitions for each of the background, patterns to enhance, and patterns to suppress having their partition model outputs wherein the model generation further comprises a background learning step, a foreground pattern extraction step and a foreground pattern learning step and wherein the partition model outputs are used for partitioned matching for recognition and extraction of patterns.

7725897

10997550

1. A method for performing real-time processing of data comprising: providing a strict real-time schedule for performing a set of tasks on a plurality of processors in a multi-processor computing system; providing a pseudo-real-time schedule for performing the set of tasks on one or more of the plurality of processors, wherein the pseudo-real-time schedule provides real-time execution of the set of tasks in a typical case but does not guarantee real-time execution of the set of tasks in a worst case; evaluating a prevailing set of operating conditions; alternately selecting the strict real-time schedule or the pseudo-real-time schedule based on the evaluation of the prevailing set of operating conditions; and performing the set of tasks on one or more of the plurality of processors according to the selected schedule; wherein the pseudo-real-time schedule is dynamically selected by making one or more successive modifications of the strict real-time schedule and determining after each modification whether the modified schedule has acceptable pseudo-real-time performance.

6129673

09093464

1. An infrared (IR) sensing assembly which measures temperature of an object, the sensing assembly comprising: a substrate having a first surface and a second surface opposite the first surface; a first sensing element connected to the first surface, wherein the first sensing element receives IR radiation from an IR source; a second sensing element connected to the second surface, wherein the second sensing element is substantially shielded from IR radiation, the first and second sensing elements are substantially thermally separate from one another, and the first and second sensing elements exhibit a substantially similar response to IR radiation; and at least one thermal insulation layer bounded substantially on all sides by at least a portion of the substrate, at least a portion of the first sensing element, and at least a portion of the second sensing element, to maintain thermal separation between the first sensing element and the second sensing element.

7803919

11427230

1. An isolated polynucleotide comprising the bovine ABCG2 nucleotide sequence shown in SEQ ID NO: 183, wherein the nucleotide sequence comprises a missense mutation that encodes a substitution of tyrosine-581 to serine (Y581S).

10064375

15450142

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

20030076912

09929464

1. A decision directed phase locked loop circuit, comprising: a phase detector which receives a sequence of baseband complex samples and current phase estimates and generates phase differences between said baseband complex samples and current phase estimates; a block decoder which decodes said baseband complex samples to generate partial decoder values and decoded data; a phase error generation circuit which receives said baseband complex samples and said partial decoder values from said block decoder and which generates feedback phase error terms based on said baseband complex samples and said partial decoder values; a loop filter which filters said phase error terms; and a phase accumulator that updates the current phase estimate on each iteration of the phase locked loop.

20070174808

11728089

1. A method for determining a process model that models an effect of one or more semiconductor manufacturing processes, the method comprising: receiving a test layout; receiving empirical data which is generated by subjecting the test layout to said one or more semiconductor manufacturing processes; receiving a set of kernels, wherein at least one kernel in the set of kernels includes a blocked-area term, wherein the blocked-area term's value at an evaluation point in the test layout is associated with a blocked area at the evaluation point; and determining the process model using the test layout, the empirical data, and the set of kernels.

9215152

13955484

1. A method for monitoring networks using a system comprising a processor and memory, the method comprising: (a) mapping resources of the system to determine an analytic capacity; (b) analyzing fundamentals respective to the analytic capacity to determine a subset of data to be analyzed, wherein the fundamentals are at least partially identifiable by analyzing metadata of network traffic; (c) analyzing the metadata for the fundamentals in the subset to determine a wireless connection to be monitored, further comprising: (i) scanning the networks in user mode to determine routers on each channel, (ii) placing the routers detected in a router list, (iii) scanning the networks in monitor mode to determine users connected to the networks, (iv) placing the users detected in a user list, and (v) analyzing the router list and the user list to determine the network traffic for monitoring to be placed in a traffic list; (d) optimizing the subset for analysis efficiency, further comprising: (i) analyzing the fundamentals in the traffic list, (ii) removing the fundamentals that communicate the network traffic that is redundant from the traffic list, (iii) ranking the fundamentals remaining in the traffic list according to analytical priority, and (iv) designating the resources of the system to the each of the fundamentals to be analyzed; (e) monitoring the network traffic relating to the fundamentals to be analyzed prior to expiration of a grand reset period; and (f) resetting after the grand reset period has expired.

9892223

15697803

1. A computer implemented method comprising computer-readable instructions stored on a non-transitory computer readable storage medium and executed on a computing device comprising a hardware processor and a memory for designing SoC by synchronizing a hierarchy of SMDPs, the method comprises: initializing a chip topology from an SoC specification or a database, wherein the step of initializing comprises extracting details regarding chip, chip skeleton, clock, Input outputs, partitions that are retrieved from the received SoC specification input and a chip database library; creating a plurality of domains and a plurality of subdomains artificial intelligence (AI) setup in form of Markov Decision Process (MDP), Semi Markov Decision Process (SMDP)s, Hierarchical Abstract Machines (HAM)s and MAX-Q to generate chip specific graph library, and wherein the artificial intelligence setup comprises a combination of an AI agent, an AI environment, and a task, wherein the AI setup is created using pre-defined exploration and exploitation algorithms, and reinforcement learning techniques; generating Q values for each domain using AI agent, wherein the AI agent is configured to interact with AI environment through task to extract Q values for each domain; associating the chip topology to a Markov Decision Process (MDP) with HAM constraints; branching the chip topology to a plurality of SMDPs or MDPs; activating the plurality of SMDPs or MDPS, and wherein the plurality of activated SMDPs or MDPs is terminated on achieving a preset Q-value or a preset objective; synchronizing the plurality of SMDPs or MDPs after termination; activating a plurality of subdomains at a same level, and wherein the plurality of activated subdomains is terminated on achieving a preset Q-value or a preset objective; synchronizing the plurality of subdomains after termination; initiating a physical verification of the plurality of SMDPs or MDPs; storing the extracted Q values of each domain and subdomain in a hierarchical SMDP structure in a form of SMDP Q table in a big data database for optimization for planning SoC; and acquiring optimal chip architecture for designing SoC, wherein the optimal chip architecture corresponds to a maximum Q value of a top level in the SMDP Q table.

20150237092

14700001

1. A computer-implemented method, comprising: receiving device metrics from a user device; determining a minimum network condition to continue streaming multimedia content to the user device without interruption based on the received device metrics; predicting a future network condition for the user device at a next time point and a future location of the user device; determining whether the future network condition is less than the minimum network condition; and determining at least one of an amount and rate of the multimedia content to be sent to and pre-buffered at the user device to achieve streaming of the multimedia content without interruption at the future location.

20090236515

12477025

1. A method for obtaining spectral data, comprising the steps of: (a) mixing a small molecule with a large molecule so that the small molecule binds non-covalently to the large molecule to form a large molecule/small molecule complex; and (b) performing electrospray ionization mass spectrometry to obtain spectral data relating to the large molecule-small molecule complex.

20130204820

13369080

1. A method of learning using a spiking neural network, comprising: (a) delaying an input spike in a neuron model according to a current delay associated with an input to the neuron model, wherein the input spike occurs at an input spike time relative to a reference time for the neuron model; (b) emitting an output spike from the neuron model based, at least in part, on the delayed input spike; (c) determining an actual time difference between the emission of the output spike from the neuron model and the reference time for the neuron model; and (d) adjusting the current delay associated with the input based on a difference between a target time difference and the actual time difference, the current delay, and an input spike time for the input spike.

20160294704

14675670

1. A system, comprising: a processing unit; and a memory unit that stores instructions that, when executed by the processing unit, cause the processing unit to perform operations comprising receiving a feedback instance creation request, examining the feedback instance creation request to determine an objective to be met by a new feedback instance model, building a specification for the new feedback instance model, and creating the new feedback instance model in accordance with the specification.

8224856

11944962

1. A computer implemented method comprising: defining a plurality of criteria; analyzing, by a computing device, a group of media content items with respect to the plurality of criteria to provide analysis results, wherein the group of media content items is associated with a user profile, wherein analyzing, by the computing device, the group of media content items with respect to the plurality of criteria comprises: determining a number of media content items from the group of media content items satisfying each of the plurality of criteria; and providing the number of media content items from the group of media content items satisfying each of the plurality of criteria as the analysis results; programmatically assigning, by the computing device, weights to the plurality of criteria for the user profile as a function of the analysis results; and scoring, by the computing device, at least one media content item as a function of the weights assigned to the plurality of criteria.

7516423

10890349

1. A method of designing an electronic circuit using a design process comprising: formulating an optimization problem, said optimization problem comprising a plurality of design variables relating to said electronic circuit and defining at least one design objective; identifying one or more decorrelations between two or more of said design variables, said identifying one or more decorrelations comprising at least dividing a search space associated with said optimization problem into a plurality of partitions and evaluating said partitions; generating, using a computerized system, an optimized solution to said problem using an evolutionary process, said act of generating based at least in part on said act of identifying; and using said solution to implement at least a portion of hardware or logic associated with said circuit.

8634638

12488911

1. A computerized method for creating a classifier, comprising the steps of: receiving, by a computer, a training sample set and a candidate part-based action set; creating, by the computer, one or more weak classifier sets based on the training sample set and the candidate part-based action set wherein the weak classifier sets have assigned error rates based on a comparison of the training sample set and the candidate part-based action set; and creating, by the computer, a strong classifier based on the one or more weak classifier sets by combining a first weak classifier with a lowest assigned error rate from a selected first weak classifier set with a second weak classifier with a lowest assigned error rate from a selected second weak classifier set.

20150081739

14488535

1. A method of dynamically generating traversal code for a graph analytics environment, the method comprising: in one or more processing systems, identifying a query expression from a relational analytics environment; generating the traversal code for the graph analytics environment based on the query expression; executing the traversal code in the graph analytics environment on a graphical database; and communicating the results of the traversal code to the relational analytics environment.

9946750

14474682

1. A computer-implemented method for generating statistics for processing database queries, the method comprising: receiving, by a query compiler, from a client device, a plurality of database queries by a database system, the database queries processing data stored in database tables of the database system; identifying, by the query compiler, missing statistics while generating execution plans for database queries, the identifying comprising, for each of the plurality of database queries: requesting a statistical information useful for generating an execution plan for a database query; and determining that the requested statistical information is not available; and storing information describing the requested statistical information as missing statistics, responsive to determining that the requested statistical information is not available; ranking the identified missing statistics based on a number of times each missing statistics was identified as being not available during generation of execution plan; determining a subset of the identified missing statistics for use in generating execution plans for subsequent database queries, wherein determining the subset comprises selecting identified missing statistics based on the ranking; receiving, by the query compiler, the subsequent database queries; generating, by the query compiler, an execution plan for the one of the subsequent database queries using at least one of the identified missing statistics from the subset; executing, by an execution engine, the generated execution plan for the one of the subsequent queries to determine a result set; and sending the determined result set to the client device.

20140025622

14038457

1. A computer-based method comprising: analyzing, by a data discernment computer, first input data; identifying, by the computer and based upon the analyzing, first item information associated with a first item; analyzing, by the computer, a master database to identify a first relationship between the first item and a first existing item, wherein the first existing item is one of a plurality of existing items; and creating, by the computer, a first intelligent business object (IBO) to store at least one of: at least a portion of the first item information and the first relationship.

9263042

14340833

1. A computer-implemented method comprising: obtaining, by a server for each of multiple words or sub-words, audio data corresponding to multiple users speaking the word or sub-word; training, by the server for each of the multiple words or sub-words, a hotword model for the word or sub-word based on the audio data for the word or sub-word, wherein the hotword model for the word or sub-word is a model that is used to detect an utterance of the word or sub-word in audio input data without transcribing the word or sub-word from input audio data; storing each of the trained hotword models as a pre-computed hotword model; receiving, by the server, a candidate hotword from a computing device; identifying, by the server, one or more of the stored pre-computed hotword models that correspond to the candidate hotword; and providing, by the server, the identified, one or more of the stored pre-computed hotword models to the computing device.

8706882

13218853

1. An apparatus for allocating devices to a communication route, comprising: a memory for storing network topology information defining the communication route, and device information including a device-cost assigned to each of a plurality of candidate-devices that may be allocated to a plurality of segments on the communication route; and a processor to: generate an integer/linear programming problem for obtaining a feasible device-allocation allowing the candidate-devices to be allocated to the communication route under constraints determined based on the network topology information and the device information, the integer/linear programming problem defining an objective function for calculating an objective function value, generate a sequence of feasible device-allocations, by sequentially generating a next feasible device-allocation from a current feasible device-allocation while improving the objective function value until the objective function value is not improved any more, and determine a last one of the sequence of feasible device-allocations to be an optimum device-allocation having an optimum objective function value, wherein the next feasible device-allocation is generated by replacing a basic candidate-device being used for the current feasible device-allocation with an alternative candidate-device so as to improve the objective function value, the alternative candidate-device being selected, from nonbasic candidate-devices not being used for the current feasible device-allocation, based on reduced-costs calculated for the nonbasic candidate-devices, a reduced-cost indicating a degree of a change in the objective function value when the change is caused by replacing a basic candidate-device with a nonbasic candidate-device having the reduced-cost.

9443196

14041317

1. A method comprising: receiving, at a network operation console in a datacenter, notification of a datacenter problem, the datacenter having a complex federated topology of interconnected devices hosting applications and services; retrieving topology information, relating to datacenter entities associated with the datacenter management problem, from a plurality of topology repositories in the datacenter storing objects related to entities in a plurality of datacenter domains including application, compute, network, and storage domains, and their interconnect information; building a problem domain defined by a set of datacenter topology entities likely to be related or contributory to a cause of the datacenter management problem; categorizing events from the domains according to a precedence probability of a plurality of planes defined by categories including fault, configuration, audit, performance, security, and others having respective relative degrees of probability of occurring in the datacenter; building a causal map corresponding to the problem domain according to the events categorized under respective planes; analyzing the causal map to determine a most precedent event on the causal map of the events categorized under the respective planes according to the precedence probability; inferring a causal event of the datacenter management problem according to the most precedent event as determined by the analysis of the causal map; and resolving the datacenter problem according to the inferred causal event of the datacenter management problem as determined by the most precedent event to affect operation of the datacenter.

8533136

13036917

1. A method of generating a nonlinear simulation model of a device under test (DUT), the method comprising: receiving large-signal nonlinear waveform data based on responses of the DUT to input signals; determining a set of first dynamical variables and a set of second dynamical variables from the nonlinear waveform data; calculating values of second dynamical variables; providing nonlinear constitutive relations as functions of the first dynamical variables and the calculated values of the second dynamical variables; and compiling the nonlinear simulation model of the DUT using the identified nonlinear constitutive relations.

20020075284

09922498

1. A method comprising: receiving a source value from a source value set, the source value set comprising a plurality of source values; receiving a destination value from a destination value set, the destination value set comprising a plurality of destination values; and generating a unique transition sequence as a function of the source value having been received, and the destination value having been received.

20100131421

12323596

1. A method for determining changes to a business process model, comprising: specifying any change operations to the business process model; and utilizing a joint process structure tree to localize dependencies between any of the change operations.

20160210883

15085307

1. A defibrillating simulator comprises: an apparatus for adapting a defibrillator for training, the apparatus comprising: a pair of electrode covers to be mounted on electrodes of the defibrillator for receiving an electrical discharge generated by the defibrillator delivered through the electrodes; an impedance connected to the pair of electrode covers to receive therethrough the electrical discharge and absorb some of the electrical discharge to generate an electrically reduced electrical discharge; an analyzer for analyzing the electrically reduced electrical discharge and providing analysis data representative of the electrical discharge; a scenario unit for providing at least one training scenario comprising physiological data; and a processing unit receiving the training scenario and the analysis data, the processing unit correlating the analysis data with the training scenario to generate training results.

7939211

12853177

1. A method for controlling the operation of a hydrogen-producing fuel processing system that includes a fuel processor and a control means that, in use, automates the operation of the hydrogen-producing fuel processing system, at least to transition the hydrogen-producing fuel processing system between a plurality of operating states, wherein the plurality of operating states includes at least a standby state, in which the operating temperatures and pressures within the fuel processor are maintained but in which hydrogen gas is not being generated in more than an amount required to operate the hydrogen-producing fuel processing system, and a running state, in which the fuel processor receives a feed stream and produces a hydrogen gas stream therefrom, wherein the method comprises: receiving inputs of selected operating parameters of the hydrogen-producing fuel processing system, at least while the hydrogen-producing fuel processing system is in the standby state; determining whether a measured value of a selected operating parameter is above or below a determined threshold value or value range; selecting, responsive at least in part to the determining, whether the hydrogen-producing fuel processing system is to be transitioned to a selected operating state available to the hydrogen-producing fuel processing system; and sending, responsive at least in part to the selecting, command signals to transition the hydrogen-producing fuel processing system from the standby state to the running state.

20030154054

10064731

1. A method for objectively monitoring a noise level occurring in a product during use comprising the steps of: imparting energy to the product to simulate an in use condition of the product; measuring the sound emitted from the product; establishing a threshold metric; generating an objective metric based on the measured sound; comparing the objective metric with the threshold metric; and generating feedback, the feedback including information relating to the comparison of the objective metric and the threshold metric.

20160283202

14697475

1. In a server computer, an optimized database analytics method comprising: storing a data model in memory in the server, the data model including a programmatically defined structure; selecting a target programming language; providing an API access layer for a client to access the server, wherein the API access layer includes a base client library implemented in the target programming language; generating a model specific interface library that is conformant with a syntax of the target programming language and that matches the defined structure of the stored data model; adding the model specific interface library to the API access layer for use by the client to interact with the data model using the target programming language; coding the defined structure of the stored data model to form at least one internal source code file; and compiling the internal source code file into native machine code for linking into a function table associated with the data model so that operations expressed by the client in the target programming language may be executed utilizing native machine code on the server in response to client requests received via the API access layer.

20100049580

12544027

1. A shopping apparatus comprising means for enabling establishment of collab means for automatically determining a shopping interest of the shopper; means for automatically determining a likelihood that a specific consultant can and will provide relevant information; means for ranking each of said at least one consultant based on the likelihood of receiving advice helpful to said shopper from that consultant; means for the shopper selecting at least one consultant from said at least one consultant; and means for establishing communication between the shopper and said at least one consultant for soliciting and obtaining said advice.

10055671

14752395

1. A method of automatically assessing perceptual visual quality of a plurality of image sets, the method comprising: obtaining, by a processor, features from each image set of the plurality of image sets; generating a set of quality scores for each image set of the plurality of image sets based on the corresponding features; comparing the set of quality scores corresponding to the plurality of image sets; and automatically determining at least one image set of the plurality of image sets having an optimal perceptual visual quality among the plurality of image sets based on the outcome of the comparison.

20140207427

13745914

1. A computer implemented method for selecting markers for modeling epistasis effects, the computer implemented method comprising: receiving, by a processor, a set of genetic markers and a phenotype; determining, for each of the set of genetic markers, a relevance score with respect to the phenotype; setting a threshold based on the relevance score of a genetic marker in the set of genetic markers with a highest relevancy score; determining, for at least one genetic marker in the set of genetic markers, a relevance score for at least one interaction between the at least one genetic marker and at least one other genetic marker in the set of genetic markers; and adding the at least one interaction to a top-k feature set based on the relevance score of the at least one interaction satisfying the threshold, wherein each feature in the top-k feature set is one of a genetic maker and an interaction each comprising a top-k relevance score.

8954309

13149663

1. A computer-implemented method of determining system configurations, comprising: determining, by a computer system, a set of configurations for a system; measuring performance of the system for members of the determined set of configurations; creating, based at least in part on the measured performance, a model of the system; receiving, from a user, one or more user-specified objective functions, based at least in part on the model of the system; identifying one or more configurable parameters related to the system; identifying a relationship between the one or more configurable parameters; identifying at least one variable constraint related to the system based at least in part on the identified relationship; determining a valid set of values to be assigned to the one or more configurable parameters and the at least one variable constraint based at least in part on the identified relationship, wherein the value of the at least one variable constraint maps to the valid set of values assigned to the one or more configurable parameters; generating an optimal configuration of the system with respect to the one or more user-specified objective functions based at least in part on the model and the valid set of values assigned to the one or more configurable parameters and the at least one variable constraint; and providing the generated optimal configuration for tuning the system.

7888931

12366164

1. A method of calculating the desired thickness of a winding layer for use in a magnetic component, comprising: determining the magnetic field intensity at the inner boundary of a first winding layer; determining the magnetic field intensity at the outer boundary of said first winding layer; calculating a ratio between said magnetic field intensities; and calculating the desired thickness of said first winding layer as a function of said ratio.

20080114713

12002199

1. A method of generating prospective ability data, comprising estimating availability for at least one future temporal block, responsive to receiving an availability request, by applying availability rules to temporal block data associated with said at least one future temporal block.

20070083837

11530038

1. A computer-based method for designing the layout of an electronic circuit with several components, which are represented as planar geometrical shapes, the method comprising the steps: defining and storing at least one geometrical relation between at least two components; modifying the position or the planar geometrical shape of any component; and calculating new positions for components to maintain the geometrical relations between the modified component and selected other components for which a geometrical relation has been defined.

20030025992

10187431

1. A method for detection of a structure on a specimen, comprising the steps: illuminating said specimen, imaging said specimen onto a detector, detecting repeatedly said specimen with a different resolution of the imaging system in each case, thereby producing image data in each case, and conveying the detected image data to a statistical and/or numerical analysis operation.

20150006126

13932493

1. A method for fitting primitive shapes to a set of three-dimensional (3D) points, comprising the steps of: converting the set of 3D points to a distance field, wherein each element in the distance field is associated with a distance to a nearest point in the set of 3D points; hypothesizing a set of two or more candidates of the primitive shapes; determining a score for each candidate using the distance field; and selecting the candidate as the primitive shape to fit to the 3D points according to the scores, wherein the steps are performed in a processor.

20050137920

10745837

1. A computer-implemented information technology (IT) enterprise management system comprising: a computer-implemented relational database, the database including data entities organized into data groups, the data groups comprising: an information technology (IT) services data group; an IT resources data group; an IT consumers data group; and an IT projects data group, including IT projects; and a project portfolio management application module.

20120150788

13225398

1. A method for predicting future behavior, comprising: collecting historical data related to a behavior; processing the historical data into intervals related to the behavior; processing the intervals of historical data into a plurality of patterns; comparing current data related to the behavior with the patterns to determine a best fit pattern that is most similar to the current data; applying the data in the best fit pattern to predict future data related to the behavior.

8020170

12078969

1. An information processing apparatus comprising: a processor; a display part configured on the processor to receive an input from a user and display a message to the user; a constraint processing part configured to process constraints among functions of a printer based on the input which the display part has received, and generate constraint information; and a message generating part configured to manage a plurality of terms in a form of a term list, and combine terms of the plurality of terms to generate the message to be displayed by said display part based on the constraint information generated by said constraint processing part; a constraint definition information storing part configured to store constraint definition information describing definitions of the constraints based on a type and specification of the printer; and a term information storing part configured to store the plurality of terms; wherein said constraint processing part reads the constraint definition information, and generates the constraint information based on contents of a change in a setting of the function of the printer received by the display part; and said message generating part reads terms of the plurality of terms and combine the terms to generate the message based on the constraint information; wherein said constraint information comprises identification information for identifying each function and a value which each function may have, information concerning a structure of conditions in which each function and the value which the each function have are subject to constraint, and information concerning whether the conditions which are elements of the structure are currently valid.

20140331200

13937998

1. An apparatus for assessing standards compliance during computer development, comprising: an interface operable to receive a first selection from a user, the first selection comprising a design assessment ruleset to be used for evaluating a computer change, the design assessment ruleset comprising one or more design assessment rules, each design assessment rule associated with a condition that determines whether the design assessment rule is evaluated; a memory operable to store the design assessment ruleset; and a processor communicatively coupled to the interface and the memory, the processor operable to: determine whether the condition associated with each design assessment rule is satisfied; communicate to the user a design evaluation question relating to each design assessment rule whose associated condition is satisfied, an answer to the design evaluation question indicating an extent to which the computer change complies with the design assessment rule; and determine one or more design scores based on the answer to each design evaluation question.

3996675

05604830

1. A combination imitation cake and dish set educational toy comprising: a. a cylindrical multipiece imitation cake with mounting receptacles for letters and candles and formed by a plurality of pie-shaped fractional slices defining different included angles; b. a plurality of artificial candles of such size and shape that they may be easily but snugly mounted in candle receiving and mounting recesses; c. a plurality of attachable, removable letter-shaped symbols provided with mounting studs matching the mounting receptacles provided on the upper surface of the cake and with sufficient letter symbols to spell a plurality of words; d. an attachable, removable garter-like elastic strap fabricated to simulate a cake decoration ring when installed around the assembled cake cylinder that actually functions to hold the assembled parts of the artificial birthday cake together; e. a cake plate having a circular plate lip extending around the upper and outer edge defining a shallow circular cylinder having a bottom surface sized to snugly hold the imitation cake; and f. a plurality of flat disks sized to fit the shallow cylinder of the cake plate and marked to indicate fractional pieces corresponding to the individual cake pieces and combinations thereof.

20110066577

12559921

1. A machine learning system comprising: an input arranged to access at least one relational database; at least one store holding a model of a probabilistic relational database formed from the at least one relational database, the model comprising a relational database schema comprising at least one relation schema which itself comprises a relation name and a plurality of attributes at least some of which are probabilistic attributes; the at least one store holding the model such that it comprises a plurality of relational algebra instructions at least some of which are arranged to query data from the relational database and at least some of which comprise factor operations each of which specifies a mapping to a probability distribution; a processor arranged to translate the model into a factor graph data structure using specified semantics being rules stored at the memory; an inference engine arranged to carry out inference according to the factor graph data structure by using the data in the relational database and updating values of the probabilistic attributes.

4887607

07169224

1. A polygraph examination apparatus comprising in combination: a polygraph machine including input leads adapted to be connected to the human body so that the specific human body functions of galvanic skin response, blood pressure, respiration, and pulse and their associated output signals can be monitored; and a spectrum analyzer electronically connected in parallel with said polygraph machine such that the output signals of the human body functions being monitored on said polygraph machine are concurrently monitored on said spectrum analyzer.

9009148

13329345

1. A computer-implemented method for ranking documents, comprising: identifying a plurality of query-document pairs based on clickthrough data for a plurality of documents; building a latent semantic model based on the plurality of query-document pairs, wherein the plurality of query-document pairs comprises a plurality of query-title pairs, wherein the title in each query-title pair is a title of one of the documents of the plurality of documents, and wherein building the latent semantic model comprises building a bilingual topic model, a query being considered as expressed in a first language and the document being considered as expressed in a second language, by using the plurality of query-title pairs to learn a semantic representation of a query based on a likelihood that the query is a semantics-based translation of each of the plurality of documents; ranking the plurality of documents for a Web search based on a distance between vector representations of a query and a title of each of the plurality of documents within a semantic space, wherein a projection matrix is used to map the vector representations of the query and the title of each of the plurality of documents to the semantic space, wherein the semantic space comprises a dense, low-dimensional space; and ranking the plurality of documents for the Web search based on the latent semantic model.

20090006378

12062411

1. An information retrieval system for of documents stored in a database, said documents being stored as document-keyword vectors generated from a predetermined keyword list, and said document-keyword vectors forming nodes of a hierarchical structure imposed upon said documents, said system comprising: a neighborhood patch generation subsystem for generating groups of nodes having similarities as determined using a hierarchical structure, said patch generation subsystem including a subsystem for generating a hierarchical structure upon said document-keyword vectors and a patch defining subsystem for creating patch relationships among said nodes with respect to a metric distance between nodes; and a cluster estimation subsystem for generating cluster data of said document-keyword vectors using said similarities of patches; and a graphical user interface subsystem for presenting said estimated cluster data on a display means.

20170212977

15002550

1. A method comprising: accessing, by a processor from a memory, an integrated circuit design comprising multiple instances of a design block at different locations within an integrated circuit, wherein each of the multiple instances of the design block comprises at least one modifiable periphery section adjacent to a periphery of the design block and a primary input, wherein primary inputs of the multiple instances of the design block are connected by corresponding data signal pathways, respectively, to logic for receiving a signal, and wherein, due to the different locations, at least some of the corresponding data signal pathways are configured differently; determining, by the processor, arrival times of the signal at the primary inputs of all of the multiple instances of the design block, respectively; and, modifying, by the processor, the modifiable periphery section of each specific instance of the design block having an arrival time equal to or less than a preselected threshold arrival time in order to generate an updated integrated circuit design the modifying being performed to reduce any of power consumption by the specific instance of the design block and an area of the specific instance of the design block, and the modifying comprising performing any of the following with respect to at least one device within the modifiable periphery section of the specific instance of the design block: bypassing; changing a threshold voltage type; changing a drive strength; and, restructuring by changing device size or device type.

20150193559

14591320

1. A method for creating three dimensional lattice structures in computer-aided design models and comprising: receiving a solid model containing a plurality of boundary surfaces for a void region; computing a bounding box of the solid model and a plurality of grid points on an axis-aligned grid within the bounding box; creating a lattice cell layout for a lattice structure within the void region; computing an implicit model defined by a scalar value for each of the grid points on the axis-aligned grid, wherein the scalar value for each grid point is determined by: calculating a surface distance based on a minimum distance for the grid point to the boundary surfaces; calculating a lattice distance based on the minimum distance for the grid point to the lattice structure; and setting the scalar value based on a lesser of the surface distance and the lattice distance; and extracting the lattice structure in the solid model based on the implicit model.

20070156501

11325140

1. A computer-implementable method comprising: scheduling a meeting; and determining a set of policies for selecting a replacement meeting moderator if an original meeting moderator is not present in said meeting.

7519478

11270063

1. A method of obtaining an analyte value in biological fluid of a user with an analyte sensor having two electrode sets coupled to a microprocessor, the method comprising: contacting the two electrode sets with biological fluid of a user, in which each electrode set includes an iontophoretic electrode and an electrochemical sensor element in contact with the biological fluid and each of the two iontophoretic electrodes function as either a cathode or anode while in contact with the fluid; measuring a current signal at each of the anode and cathode; measuring a current signal related to the analyte from the sensor element associated with a cathode at each half-measurement cycle; determining, via the microprocessor a baseline current signal for a given sensor in which the iontophoretic electrode functions as a cathode based on the last two data points of the current signals from the given sensor in a previous half-cycle in which the given sensor is associated with an anode; subtracting, via the microprocessor, the background baseline current from the current signal related to the analyte; integrating, via the microprocessor, the current signal related to the analyte over time; upon over subtraction of the current signal related to the analyte, stopping, via the microprocessor, the integrating of the current signal related to the analyte when the maximum integral is reached; correlating the maximum integral of the current signal related to the analyte as being proportional to the analyte value; and displaying, via the microprocessor, the analyte value of the biological fluid of the user for diagnostic purposes.

8620788

13416372

1. A system for managing financial data related to an allowance account and a diversionary account for one or more users, comprising: a communications interface for receiving user data related to a plurality of allowance account and diversionary account designations, each allowance account designation corresponding to at least one spending related sub-account and each diversionary account designation corresponding to at least one savings related sub-account, each spending and savings related sub-account further having an associated priority rating provided by the user, at least a first of the savings related sub-accounts being linked to one of a bank savings account, brokerage account, mutual fund account, education savings account, retirement account, deferred annuity account during an accumulation phase, and certificate of deposit account, and a second of the savings related sub-accounts being linked to another one of a bank savings account, brokerage account, mutual fund account, education savings account, retirement account, deferred annuity account during an accumulation phase, and certificate of deposit account; a data storage device configured to store the received user data related to the plurality of allowance account and diversionary account designations; a computer processor configured to execute program instructions to: receive, via the communications interface, data related to a third party financial transaction; correlate the third party financial transaction data with at least one of the plurality of spending and savings related sub-accounts; determine one or more allowance account and diversionary account rebalancing transactions based upon the correlated sub-account for the third party financial transaction and the associated priority rating of the sub-account; and transmit data related to the one or more allowance account and diversionary account rebalancing transactions to a financial account management system for execution; wherein responsive to the one or more allowance account and diversionary account rebalancing transactions comprising re-allocation from one of the spending related sub-accounts to the first savings related sub-account, the data transmitted to the financial account management system for execution comprising data for automated transfer of funds from a debit checking account linked to the spending related sub-account to the account linked to the first savings related sub-account.

8935060

13942832

1. A driver assistance system for an agricultural working machine, comprising at least one control/regulating unit including a memory and which adjusts and monitors working parameters, quality parameters or both of the agricultural working machine in an automatable manner using a family of characteristics stored in the memory, and enables that a selectable process implementation strategy is specified in order to automatically monitor and/or adjust at least one working parameter, quality parameter or both of the agricultural working machine, wherein the driver assistance system ( 28 ) suggests that the process implementation strategy ( 61 ) be changed at least when the specified setpoint value of one or more of the quality parameters ( 40 ) cannot be reached within the preselected process implementation strategy ( 61 ).

8417811

12640331

1. A method for projecting hardware usage in a computing system, comprising the steps of: extracting historical hardware usage data in a computing device from the computing system, the hardware usage data characterizing hardware usage of the computing system over an historical time period; identifying a plurality of usage factors affecting hardware usage of the computing system, the plurality of usage factors comprising at least one rate factor corresponding to a rate at which operations in the computing system occur over a unit of time, and a cumulative factor corresponding to an amount of data storage consumed by the computing system; extracting historical usage factor data corresponding to at least one usage factor in the computing device from the computing system, the usage factor data characterizing occurrences of the at least one usage factor over the historical time period; and performing at least one regression analysis on the historical usage factor data in the computing device, the regression analysis determining a first hardware usage function characterizing a relationship between the at least one usage factor and the historical hardware usage data.

8140516

12329781

1. A data processing system implemented method of directing a data processing system to improve execution efficiency of a database workload to be executed against a database, the database comprising database tables, the database workload identifying at least one of the database tables, the data processing system implemented method comprising: identifying candidate database tables being identifiable in the database workload, the identified candidate database tables being eligible for organization under a clustering schema; simulating database workload performance based on clustering data points along each of a plurality of candidate clustering dimensions at an estimated finest useful dimension granularity (FUDG) coarsification level; selecting the identified candidate tables according to whether execution of the database workload is improved if the selected identified candidate table is organized according to the clustering schema; and organizing the selected identified candidate tables according to the clustering schema prior to the database workload being executed against the database.

20130080129

13240999

1. A multi-component model engineering system comprising: a library of model components each comprising a function for describing the behavior of a sub-set of the state variables of a multi-component dynamical system, and having at least one parameter; a data access engine arranged to access empirical data measured from the dynamical system, the data being accessed from a plurality of different datasets; an inference engine arranged to learn one or more of the parameters of specified ones of the model components and to learn a probability distribution for each parameter which represents a degree of uncertainty of the parameter; a model-data association engine arranged to link a plurality of specified model components from the library of model components to form a multi-component model and to associate each model component with parameters to be learnt, with data from at least one of the datasets the model-data association engine also being arranged to pass the specified model components to the inference engine in a format suitable for use by the inference engine to learn the parameters and probability distributions of the specified model components using the data associated with the specified model components.

8527262

11767104

1. A program storage device readable by machine, tangibly embodying a program of instructions executable by the machine to perform a method for processing natural language text, comprising: receiving as input a natural language text sentence comprising a sequence of white-space delimited words including inflicted words that are formed of morphemes including a stem and one or more affixes; automatically parsing the inflicted words into their constituent morphemes; grouping the parsed morphemes of the inflicted words with the same syntactic role into constituents; identifying a plurality of verb-constituent pairs in the text sentence; predicting potential arguments for each constituent of the grouped morphemes, wherein the constituents are associated with a verb by the verb-constituent pairs and each prediction is weighted for a respective argument and grouped morpheme being considered; assigning a probability to each of the potential arguments, wherein the probability indicates a probability that the potential argument applies to a respective constituent; and outputting a plurality of semantic roles for a given verb/constituent pair as the potential arguments with corresponding probabilities, wherein predicting potential arguments for each constituent of the grouped morphemes and assigning the probability to each of the potential arguments includes: performing lexical/surface analysis; performing morphological analysis; performing semantic analysis; performing syntactic analysis; and integrating results of the lexical/surface analysis, the morphological analysis, the semantic analysis, and the syntactic analysis into a statistical model based on Maximum Entropy to produce a probability model for predicting potential arguments for each constituent of the grouped morphemes and assigning the probability to each of the potential arguments.

9536519

14926544

1. A device, comprising: a processing system including a processor; and a memory that stores executable instructions that, when executed by the processing system, facilitate performance of operations, comprising: obtaining video media content, wherein the video media content comprises images, audio content, and closed captioning of text from the audio content; detecting an occurrence of a textual phrase in the closed captioning data of the video media content as a detected occurrence; obtaining an audio segment from the audio content corresponding to the textual phrase as a selected audio segment; computing a phonetic transcription for the selected audio segment as a computed transcription; selecting, from a speech recognition library, a plurality of identified phonetic transcriptions associated with the textual phrase, wherein the speech recognition library comprises audio pronunciation data for the textual phrase and identified phonetic transcriptions of the textual phrase; comparing the computed transcription with the plurality of identified phonetic transcriptions from the speech recognition library; determining if the computed transcription differs from the plurality of identified phonetic transcriptions from the speech recognition library; and responsive to determining that the computed transcription differs from the plurality of identified phonetic transcriptions, adding the computed transcription and the textual phrase to the audio pronunciation data in a group of the plurality of identified phonetic transcriptions in the speech recognition library.

8423498

12718219

1. A computer system for analyzing a scenario task to determine contextual characteristics thereof, said system comprising: a processor including: an analytical processing component configured to parse a scenario task into parsed task requirements, the scenario task being at least partially associated with a cultural group of human subjects; an associative processing component configured to receive the parsed task requirements and to: associate a task requirement identifier with each parsed task requirement; associate each parsed task requirement with a task requirement resolution factor; and associate the task requirement identifiers to define a task requirement model; a correlative processing component configured to correlate the task requirement model with a database of scenario data elements, each scenario data element having one of a scenario data element identifier and a scenario resolution factor associated therewith, by correlating one of the task requirement identifiers and the task requirement resolution factors with the respective one of the scenario data element identifiers and the scenario resolution factors; and a compilation processing component configured to compile the correlated scenario data element identifiers and scenario resolution factors to form contextual characteristics having a hierarchical structure, the hierarchical structure having a plurality of categories, each category being defined by at least one attribute, wherein each attribute includes at least one parameter, with each parameter having a parameter value, the categories, attributes, parameters, and parameter values being associated with the correlated scenario data element identifiers and scenario resolution factors, the contextual characteristics cooperating to populate and provide context to the task requirement model.

8918756

13456745

1. A method for generating code from a class model for a modeled system, said class model specifying a plurality of elements of a modeling language, dependencies between and constraints on elements of said plurality of elements, the method comprising: an analysis step for analyzing said class model to identify a first possible source of under-specification with respect to the modeled system in said class model by using pattern recognition to find an occurrence of a first problem pattern of a plurality of problem patterns in said class model, said plurality of problem patterns being stored in a repository; a selection step for selecting a set of constraint patterns comprising at least a first constraint pattern, said at least first constraint pattern being linked in said repository to said first problem pattern, said at least first constraint pattern being a resolution to said first possible source of under-specification in the class model; a presentation step for presenting said set of constraint patterns to a user; a reception step for receiving a user selection from said user, said user selection comprising a selected constraint pattern from said set of constraint patterns; an instantiation step for instantiating constraints from said selected constraint pattern; and a code generation step for generating code based on said class model and the instantiated constraints.

8321407

12370690

1. A method for calculating a combined impact analysis repository comprising: accessing at least two impact analysis repositories comprising transactions; obtaining a transaction-refinement index for each of the impact analysis repositories; associating the combined repository with information from the most transaction refined impact analysis repository according to the obtained transaction-refinement index; associating the combined repository with information from the less transaction refined impact analysis repository in the case of a request to insert or delete a table record for tables that do not contain any impacted transaction in the more transaction refined impact analysis repository; and associating the combined repository with information from the less transaction refined impact analysis repository in the case of a request to update a table record for table columns that do not contain any impacted transaction in the more transaction refined impact analysis repository; wherein the step of obtaining the transaction-refinement index comprises calculating the transaction-refinement index by comparing the average number of impacted transactions per at least one of the following: database column for requests to update table records, or database table for request to insert or delete table records.

20040230872

10437657

1. A method for producing software reliability and availability metrics of at least one target computing device, the method comprising: collecting software application event data from the target computing device; analyzing the event data; producing software application reliability and availability data as state sojourns; and computing reliability and availability metrics based, at least in part, on the reliability and availability data state sojourns.

20040181521

10807871

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

9345550

14069209

1. A method for characterizing an accessibility of potential stimulus sites in connection with surgical planning for implant of a cardiac medical lead near a heart of a patient, the method comprising: obtaining image data representative of a coronary venous system for the heart of the patient to receive the lead; generating a venous map, based on the image data, representative of venous pathways for the heart of the patient; analyzing the venous map to identify pathway features of interest (PFOI) within at least one select region of the venous pathways; assigning scores to the PFOI based on at least one of predetermined feature-complexity relations or physician-entered complexity updates; and displaying treatment planning information to a user based on the scores, wherein the treatment planning information includes an identification of at least one of implant tools or a type of medical lead saved in a database as suggested to be used to locate an electrode of the medical lead at the corresponding stimulus site.

10023829

15585341

1. A method for making blue whiskey comprising the steps of: a. mixing methylene blue with pure alcohol and water creating a staining solution; b. pouring the staining solution into a wooden cask; c. removing the staining solution from the wooden cask; d. allowing the wooden cask to dry; e. pouring colorless whiskey into the wooden cask; f. aging the colorless whiskey in the wooden cask until the colorless whiskey reaches a desired shade of blue color.

20110167021

12946878

1. A numerical modelling apparatus, the apparatus comprising: an input unit arranged to receive signals containing data having information relating to a set of assets; a processor unit arranged to: a) provide a Risk Relation Matrix v having a plurality of elements, wherein each of the elements represents a relationship of risk related to a respective pair of the assets and each element is given by a scalar product of two risk vectors, such that each of the assets has an associated risk vector according to the elements of the risk relation matrix; b) decompose the Risk Relation Matrix v into eigenvectors and eigenvalues according to: V=E·Λ·E′ wherein E is a set of eigenvectors of the risk matrix v in columns, Λ is the corresponding diagonal eigenvalue matrix, and E′ is the transpose of E; and c) derive components of each of the risk vectors in the basis of unit independent risks by the corresponding row of the matrix product E·Λ 1/2 relating to each of the assets; and an output unit arranged to output the components of each of the risk vectors as a risk vector data set onto a tangible computer-readable recording medium or a display device.

20100284620

12775260

1. A method for determining a matching score between a first set of n 1 feature points, and a second set of n 2 feature points, the method comprising the procedures of: producing a triple-wise affinity tensor, including the affinity score of assignments of triplets of feature points of said first set of feature points and triplets of feature points of said second set of feature points; determining a leading eigenvector of said triple-wise affinity tensor; iteratively producing a binary optimal assignment vector by discretization of said leading eigenvector; and determining a matching score between said first set of feature points and said second set of feature points according to said triple-wise affinity tensor and according to said optimal assignment vector.

20170200065

14995032

1. In a digital media environment to facilitate management of image collections using at least one computing device, a method to automatically generate image captions using weak supervision data comprising: obtaining, by the at least one computing device, a target image for caption analysis; applying, by the at least one computing device, feature extraction to the target image to generate global concepts corresponding to the image; comparing, by the at least one computing device, the target image to images from a source of weakly annotated images to identify visually similar images; building, by the at least one computing device, a collection of keywords for the target image indicative of image details by extracting the keywords from the visually similar images; and supplying, by the at least one computing device, the collection of keywords indicative of image details as the weak supervision data for caption generation along with the global concepts.

7826184

12290246

1. A circuit interrupter for interrupting current on a line conductor, comprising: separable contacts in electrical communication with the line conductor; a trip mechanism for selectively opening said separable contacts upon receipt of a trip signal; a sensor in electrical communication with the line conductor; a processing device in electrical communication with said trip mechanism; a series arc detection sequence resident on said processing device, said series arc detection sequence comprising a plurality of series fault detection algorithms; and at least one filter circuit comprising a low-pass filter providing at least one signal from said sensor to said series arc detection sequence, said sequence selecting a particular algorithm from said plurality of algorithms based on said at least one signal, calculating a plurality of statistical features from said at least one signal, and generating said trip signal based on a comparison of said plurality of statistical features to said particular algorithm, wherein said low-pass filter circuit is configured to provide a low-pass signal from said sensor to said series arc detection sequence, said sequence selecting said particular algorithm from said plurality of algorithms based on said low-pass signal.

20060062084

10943754

1. A method, comprising: monitoring microseismicity, the monitoring comprising: receiving one or more seismic signals with one or more seismic detectors; generating a time evolving historical map of microseismic activity by spatial mapping based on the one or more seismic signals.

8290892

12247605

1. A computer-implemented method comprising: providing a single function optimization problem that is subject to non-linear constraints, linear constraints, and bound constraints; formulating, using an augmented Lagrangian pattern search algorithm, a sub-problem, from the single function optimization problem, which excludes the linear constraints and the bound constraints, and includes the non-linear constraints, the sub-problem including a penalty parameter and at least one Lagrangian parameter estimate; solving the sub-problem using the augmented Lagrangian pattern search algorithm while satisfying the linear constraints and the bound constraints, the sub-problem being solved in parallel using a plurality of computing devices, solving the sub-problem comprising: multiplying the penalty parameter, included in the sub-problem, by a penalty factor when a solution, to the sub-problem, is not minimized to a pre-determined accuracy or when the solution to the sub-problem does not satisfy a feasibility condition; generating a solution to the single function optimization problem using the solution to the sub-problem; and storing the solution to the single function optimization problem in a storage location accessible to a computing device.

7848836

11666114

1. A scheduling system for planning and scheduling production in an industrial production system, which scheduled production is to be executed by the production system under control of a manufacturing execution system, the scheduling system comprising: a multi-agent scheduling system; at least a part of a behavior of agents in said multi-agent scheduling system being customizable by visually defined scheduling rules; a definition and execution environment, shared by the scheduling system and manufacturing execution system, the definition and execution environment including: an editor operable to visually define both said scheduling rules and control rules of the manufacturing execution system, and an execution engine for executing said scheduling rules and control rules and making scheduling decisions based on an execution of said scheduling rules and control rules.

20080270031

11739166

1. A geospatial modeling system comprising: a geospatial database for storing geospatial data points each having respective elevations associated therewith; and a processor for data thinning the geospatial data points by selecting discriminant points therefrom, said processor selecting discriminant points based upon (a) identifying a current patch having a plurality of spaced-apart current geospatial data boundary points, (b) selecting a current discriminant point within the current patch based upon sequentially stepping through the geospatial data points therein to determine respective elevation differences relative to the current geospatial boundary points and comparing the elevation differences to a threshold range, (c) identifying a plurality of new patches, each having a plurality of spaced-apart new geospatial boundary points including the current discriminant point, and (d) iteratively repeating steps (b) and (c) for each of the new patches until no further new discriminant point is selected.

20080004854

11847391

1. A method for simulating transient conditions in a circuit using a piecewise constant model, the method comprising the steps of: evaluating an error criteria to determine a maximum allowable change in one of a current and a voltage, including replacing a plurality of predefined steps of the piecewise constant model; simulating the transient conditions by implementing an adaptive step in the piecewise constant model according to the maximum allowable change; and analyzing the circuit based on a result of the simulating.

20090262650

12347444

1. A method for providing event correlation in a network, comprising: extracting a plurality of events of interest from a database; creating one or more event time series from the plurality of events of interest, wherein each of said one or more event time series comprises a set of events of a same type and of a same location that occur within a given time period; forming one or more composite events from said one or more event time series; performing one or more pair-wise correlations for at least one of: said event time-series, or said one or more composite events; and identifying one or more pair-wise correlations that are statistically significant.

9460075

14306267

1. A computer system for solving and answering an arithmetic or algebraic problem through a computer-based question-answer system in real-time, using natural language processing (NLP) and an online dictionary, the computer system comprising: one or more processors, one or more computer-readable memories, one or more computer-readable tangible storage devices, and program instructions stored on at least one of the one or more storage devices for execution by at least one of the one or more processors via at least one of the one or more memories, wherein the computer system is capable of performing a method comprising: creating and maintaining the online dictionary, wherein creating and maintaining the online dictionary comprises: determining a relationship between at least one verb and at least one math operator; mapping the at least one verb to at least one math operator based on the determined relationship; storing the mapped at least one verb to the at least one math operator in the online dictionary; identifying an effect of the stored at least one math operator on a plurality of subjects; identifying an effect of the stored at least one math operator on a plurality of objects; correlating the identified effect of the stored at least one math operator to the plurality of subjects; correlating the identified effect of the at least one math operator to the plurality of objects; updating the online dictionary with the correlated identified effect of the at least one math operator to the plurality of subjects; and updating the online dictionary with the correlated identified effect of the at least one math operator to the plurality of objects; receiving, by a processor associated with a first computer, an input statement, wherein the input statement is a geometric word problem that includes a plurality of geometric figures, angles, perimeters, and areas described by a plurality of words, entered by a user in natural language without a mathematical operator symbol, via a user interface associated with a computing system; determining whether each sentence within a plurality of sentences associated with the input statement is a well-formed sentence from a mathematical perspective, wherein determining whether each sentence within the plurality of sentences associated with the input statement is a well-formed sentence from a mathematical perspective comprises: performing part-of-speech (POS) tagging and parsing or parse tree generation on each sentence within the plurality of sentences; and determining a typed dependency for each sentence within in the plurality of sentences and if each sentence within the plurality of sentences requires anaphora resolution; converting each statement into a well-formed sentence based on the determining whether each sentence within a plurality of sentences associated with the input statement is a well-formed sentence from a mathematical perspective, wherein converting each statement into a well-formed sentence comprises: performing part-of-speech (POS) tagging and parsing or parse tree generation on each sentence within the plurality of sentences; and determining if a plurality of user input is required to resolve a plurality of ambiguity associated with at least one sentence within the plurality of sentences; in response to determining the plurality of user input is required to resolve the plurality of ambiguity, prompting the user for the plurality of input to resolve the plurality of ambiguity; and in response to receiving the plurality of user input, performing structural disambiguation for each sentence within the plurality of sentences; converting each well-formed sentence into a mathematical equation to form a set of equations, wherein forming the set of equations comprises receiving the plurality of input entered by the user and storing each mathematical equation in an online repository, wherein the converting the well-formed sentence into the mathematical equation and solving the set of equations comprises communicating online with a second computer to access the online dictionary containing a mapping between a plurality of verbs, a plurality of action words, and a plurality of mathematical operators, wherein the dictionary is created, updated, and maintained separately on a server, and wherein the dictionary specifies for each verb within the plurality of verbs or each action word within the plurality of action words, the effect of the plurality of at least one mathematical operator within the plurality of mathematical operators on an operand of a sentence and wherein the converting the well-formed sentence into the mathematical equation and solving the set of equations further comprises determining the effect of the plurality of at least one mathematical operator within the plurality of mathematical operators on the operand of the sentence based on electronically reading the dictionary and determining for each verb within the plurality of verbs or each action word within the plurality of action words, the effect of the plurality of the at least one mathematical operator within the plurality of mathematical operators on the operand of the sentence and performing a plurality of online-computing techniques, wherein the plurality of online computing techniques comprises performing part-of-speech (POS) tagging, performing parsing or parse tree generation, determining a typed dependency, and determining a subject, an object, a verb, an action, and a numeral from the typed dependency; retrieving the formed set of equations from the online repository; solving the retrieved set of equations to compute a mathematical result; and narrating the mathematical result in natural language, wherein the mathematical result is narrated as an automatic interactive response or a solution from the computer system in real-time and comprises converting the mathematical result into at least one natural language sentence.

8676726

12982819

1. A computer-implemented method comprising: generating a data structure, the data structure having nodes representing fraud or non-fraud conditions, and having associations between nodes, the data structure being generated from fraud and non-fraud data collected in an adaptive modeling process that determines the fraud and non-fraud conditions from past transactions; determining all unique paths between nodes of the data structure to define a rule for each path, each rule having one or more preconditions; converting each rule to a binary indicator variable to generate a set of binary indicator variables; deriving one or more complex variables from the set of binary indicator variables; determining, by an adaptive weights adaptor, an adaptive weight for each binary indicator variable to obtain weighted values of the set of binary indicator variables and an adaptive weight for each complex variable to obtain weighted values of the one or more complex variables; and providing the weighted values of the set of binary indicator variables and the weighted values of the one or more complex variables to an adaptive scoring engine to generate a score for new transactions, the score representing a likelihood whether each new transaction is fraudulent.

20090042630

12254174

1. A computer-readable medium having instructions stored thereon which are executable by a processing arrangement for performing functions comprising: accepting an initial commission from a player to enable the player to participate in a hand of a communal card poker game; facilitating submission of a wager by the player; calling the wager submitted by the player; determining a hand outcome based on a comparison of a resulting hand of the player and a resulting hand of dealer, each of the resulting hands comprising a subset of a set of cards including a plurality of community cards and a respective starting hand for the player and the dealer; providing a payout to the player if the player's resulting hand has a higher poker rank than the dealer's resulting hand; and retaining the player's initial commission.

8527522

12344871

1. A system that detects similarities between name strings in a document set, comprising: a processor and a memory, the memory comprising a preprocessing module, a matching module and a generation module; the preprocessing module configured to: extract a plurality of name strings from the document set by generating additional name strings based on an alternative spelling of one or more name strings in the document set, each name string comprising a similar entity with names that are misspelled, mistranslated, incorrectly transcribed, have multiple aliases, and/or have multiple equally valid spellings, the alternate spelling comprising determining typical misspellings, creating language specific lists of spelling corrections, and generating the alternative spelling based on the spelling corrections; the matching module configured to: detect possible matching pairs from the plurality of name strings, and detect a plurality of similarity scores to each of the possible matching pairs using a plurality of algorithms that execute in parallel; and the generation module configured to: generate a set of equivalent names by its relating name strings from the possible matching pairs based on a comparison between the similarity scores and a threshold.

9965802

14633974

1. A method for controlling a plurality of energy storage systems coupled to a power grid, the method comprising: providing a plurality of energy storage systems; providing a central processor and a plurality of storage system processors, the central processor being in communication with the plurality of storage system processors, each storage system processor being coupled to one of the plurality of energy storage systems; the central processor being programmed to generate a lookup table approximating a value function having four dimensions including: state of the storage system, price of electricity, prior low bid, and prior high bid; the central processor or the plurality of storage system processors being programmed to generate near-optimal charge/discharge instructions for the plurality of energy storage systems based on the generated lookup table; and charging/discharging the plurality of energy storage systems based on the generated charge/discharge instructions; wherein generation of the lookup table comprises: observing an initial numeric value for a first set of dimensions and exploiting monotonicity of the value function to update a first region of the lookup table; and iteratively observing subsequent numeric values for a next set of dimensions and exploiting monotonicity of the value function to update subsequent regions of the lookup table, the lookup table having numeric values for all possible sets of dimensions.

10147103

15468308

1. A computer-implemented method, comprising: a. providing a data structure representing a matrix having rows representing entities and columns representing attributes of the entities; b. assigning each entity u of the entities and attribute i of the attributes an affiliation vector f u and f i respectively, the affiliation vector being indicative of the strength of affiliation of the entity or the attribute to N predefined initial clusters of cells of the matrix; c. providing a multiprocessor unit comprising streaming multiprocessors, each being configured for executing at least one respective thread block, a thread block comprising a predefined number of threads; d. determining a gradient vector of a likelihood function for finding optimal values of the affiliations vectors f u and f i , wherein the gradient vector comprises for a given attribute i a first term comprising Σ u:r u,i =1 G(f u ,f i ) or Π u:r u,i =1 G(f u ,f i ), where the sum and multiplication are over entities that have a dependency with the attribute i; e. initializing the first term using a predefined value and storing the initialized first term in a main memory of the multiprocessor unit; f. for each entity of the sum or the multiplication of the first term of the given attribute: launching a thread block for the entity-attribute pair (u, i); evaluating the function G(f u ,f i ) using the threads of the thread block; selecting a thread of the thread block, wherein the selected thread is configured for adding or multiplying the evaluated first term of the entity to the current value of the first term in the main memory unit using an atomic operation.

9652406

14701182

1. A method for data management in a multi-core computing storage environment by a processor device, comprising: using a batched data operation under a single lock to perform data demotion operations by using a Most Recently Used (MRU) listing to conduct a demotion scan using at least one of a MRU flush, a processor identification (ID), and a track change characteristic algorithm; wherein if the priority of a demotion scan is determined to be high, and a count of tracks on an active list is higher than a count of demote ready tracks, and a predetermined percentage of the count of demote ready tracks is less than a number of tracks needed to be freed by the demotion scan, moving the number of tracks from an active list to a demote ready list.

20080249966

12076917

1. A computer-implemented method, comprising: identifying a first data set and a second data set, establishing a plurality of relationships, each of the plurality of relationships linking an element of the first data set to an element of the second data set, assigning a link weight to each of the plurality of relationships, said link weight being modifiable by interaction between the elements linked by the each relationship, computing a similarity quotient for the each relationship of the plurality of relationships, the similarity quotient being a measure of similarity between the elements linked by the each relationship, and classifying the plurality of relationships based on values of the similarity quotients.

8949764

13479807

1. A method for determining a subset of a set of library cells of a library cell type for a timing arc of the library cell type, the method comprising: receiving a first generic logical effort value for the timing arc of the library cell type, wherein the first generic logical effort value is determined by aggregating specific logical effort values across multiple library cells of the library cell type receiving a generic parasitic delay value for the timing arc of the library cell type; and determining, by using a computer, the subset of the set of library cells of the library cell type, wherein said determining comprises: excluding library cells in the set of library cells of the library cell type whose specific logical effort values for the timing arc are greater than the first generic logical effort value by more than a first threshold, and excluding library cells in the set of library cells of the library cell type whose specific parasitic delay values for the timing arc are greater than the generic parasitic delay value by more than a second threshold.

10158554

13408138

1. A system for managing the network link topology of a directional wireless network, the system comprising: a network manager node adapted to receive resource requests from a plurality of communications nodes; a processor executing a management service; and a plurality of mobile communications nodes communicating resource requests to the network manager node for processing by the management service; wherein the processor is adapted to execute a method for managing a network link topology defined by a plurality of spatially-distributed, wireless, directional communications signal links comprising a physical layer of a directional wireless network amongst the plurality of mobile communications nodes, the method comprising the steps of: receiving a plurality of resource requests from the plurality of mobile communications nodes; determining one or more constraints upon the establishment of point-to-point, wireless, directional communications signal links between a first node, a second node, and a third node of the plurality of mobile communications nodes based upon a description of interruptions to lines-of-sight amongst the first node, the second node, and the third node, the description including a structural interference matrix, a topographical matrix, or an environmental model; classifying the received plurality of resource requests as at least one class of traffic flow overlay having the one or more determined constraints; determining an optimized network link topology solution for the network link topology, wherein the determination of the optimized network link topology is carried out by a Lagrangian Relaxation solver using the at least one class of overlay and the one or more determined constraints; and publishing a network link topology policy based upon the optimized network link topology solution to the plurality of mobile communications nodes, wherein the network link topology policy directs the first node of the plurality of mobile communications nodes to terminate a point-to-point, directional, wireless communications signal link between the first node and the second node of the plurality of mobile communications nodes and to establish a point-to-point, directional, wireless communications signal link between the first node and the third node of the plurality of mobile communications nodes.

20120239610

13424308

1. A computer-implemented method for mapping an eXtensible Business Reporting Language (“XBRL”) hypercube specification to a multidimensional database schema, the method comprising: obtaining, by the computer, a reporting hypercube specification comprising a plurality of “mapped” XBRL dimensions and a plurality of “mapped” XBRL measures of the XBRL hypercube specification; generating, by the computer, a database schema defining a multidimensional database corresponding to the XBRL hypercube specification, said multidimensional database comprising a fact table and a plurality of dimension tables, said fact table comprising a plurality of measure columns and a plurality of dimension columns corresponding respectively to said plurality of dimension tables; and generating, by the computer, a data map mapping each of said plurality of mapped XBRL dimensions to a corresponding one of said plurality of dimension tables, said data map further mapping each of said plurality of mapped XBRL measures to a corresponding one of said plurality of measure columns.

9292599

13874299

1. A decision-tree system comprising: one or more processing modules; and one or more non-transitory storage modules storing computing instructions configured to run on the one or more processing modules and perform acts of: storing structured data comprising a decision tree in a data store; storing a record to be analyzed according to the decision tree in an additional data store; storing one or more training records in a training data store; selecting, by a distinction module, between multiple paths extending from a node in the decision tree based at least in part on a unit of data from the record, the unit of data from the record carrying information relevant to a distinction of the node, the distinction module further comprising: a real-value module operable to make a first comparison between the unit of data from the record and a predetermined real value for the distinction of the node; and a set-value module operable to make a second comparison between the unit of data from the record and a predetermined set value for the distinction of the node, the set-value module is operable to make the second comparison by determining whether the unit of data from the record comprises an element of a set, the set defined by the predetermined set value for the distinction of the node, and the predetermined set value for the distinction of the node defines the set that comprises a unit of data with missing data; the distinction module further operable to select a path from the multiple paths based at least in part on at least one of: the first comparison; or the second comparison; accounting, by a training module operable to train the decision tree, for a known path of one of the one or more training records from the multiple paths extending from the node by both: a first relationship between a unit of training data from the one of the one or more training records and the predetermined real value for the distinction of the node; and a second relationship between the unit of training data and the predetermined set value for the distinction of the node; generating, by the training module, the decision tree in the data store as a probability estimation tree (PET) from the one or more training records by a machine learning algorithm; and using, by the machine learning algorithm, the missing data to: determine one or more nodes of the decision tree; or set the predetermined real value for the distinction of the node.

20050016421

09786967

1. A cement composition comprising 100 parts by weight of magnesium oxide comprising 5 to 25% by weight of at least any one of silicic acid, alumina and iron oxide, 3 to 35 parts by weight of a phosphate, 2 to 30 parts by weight of gypsum and 0.005 to 7 parts by weight of an oxycarboxylic acid or a ketocarboxylic acid.

8200640

12484406

1. A method for collective deduplication of entity references in data records stored in a database, the method comprising: executing, on a processor, an execution unit that implements a declarative deduplication language using a clustering algorithm and by accessing the database through a database server, wherein the declarative deduplication language is not a Structured Query Language, the execution unit receiving and executing arbitrary programs in the declarative deduplication language; accessing one or more relational tables of the database containing data records, where the data records contain references to varying real-world entities, and where the references include a plurality of sets of two or more entity references that are duplicates, wherein duplicates comprise references that have different respective textual representations of a same real-world entity; receiving entity-reference declarative program code of the declarative deduplication language that specifies entity references in the relational tables that are to be deduplicated; receiving constraint-specifying declarative program code of the declarative deduplication language that specifies one or more constraints that a deduplication of the entity references should satisfy; and generating output by the execution unit executing the entity-reference declarative program code and the constraint-specifying declarative program code, the output comprising one or more deduplication relations that identify whether or not two entity references are duplicates, and which satisfy the one or more constraints specified in the constraint-specifying declarative program code, wherein each output deduplication relation is an equivalence relation, wherein each equivalence relation partitions the output into corresponding disjoint subsets.

20080010268

11481686

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

20160154852

14931718

1. A computer-implemented method for searching in a database, comprising: in response to receiving a search request to search in a database, extracting from the search request a condition for searching in the database; selecting a search algorithm matching the condition from a plurality of search algorithms registered to the database, based on historical statistic data of a historical search conducted on the database; and obtaining a search result from the database by using the search algorithm, wherein the database is a time series database.

20060230025

11101727

1. A computer-implemented method comprising: generating a multidimensional model from a set of one or more instance documents that conform to an extensible business reporting language (XBRL); extracting financial data from the XBRL instance documents in accordance with the multidimensional model; and outputting an electronic report containing the extracted financial data.