Datasets:

patent

/

AIPD_evo_claim_one

like 0

20140140495

13681420

1. A method for routing activities to contact center agents in a contact center comprising a processor, the method comprising: identifying, by the processor, an activity to be routed to one of the contact center agents; identifying, by the processor, one or more parameters for handling the activity; identifying, by the processor, one or more contact center agents; retrieving, by the processor, preference settings for each contact center agent of the identified one or more contact center agents; for a particular contact center agent of the identified one or more contact center agents, overriding, by the processor, the preference settings for the particular contact center agent in response to at least one of receiving a preference override from a contact center administrator, or detecting that quality of performance of the contact center agent is below a threshold quality; and routing, by the processor, the activity to one of the identified contact center agents based on the identified one or more parameters and the retrieved preference settings that are not overridden.

20150199802

14156019

1. A system for use in inspecting an object, said system comprising: at least one array of visual imaging devices configured to capture a plurality of two-dimensional images of the object, said at least one array configured to capture a first set of two-dimensional images over a first predetermined interval and a second set of two-dimensional images over a second predetermined interval that is after the first predetermined interval; and a computing device coupled to said at least one array of visual imaging devices, said computing device configured to: extract point clouds of the object from the first and second sets of two-dimensional images; generate a three-dimensional model of the object from the extracted point clouds; determine variations in the extracted point clouds from the first and second sets of two-dimensional images; and utilize the determined variations to detect potential anomalies in the three-dimensional model.

8099374

12487225

1. A behavior estimating system for estimating a behavior manner of an instructor, comprising: a state recognizing element which recognizes a position of a state variable, which is displaced as the instructor moves, at one or a plurality of reference time points as the position of one or a plurality of reference points; and a trajectory generating element which generates, on the basis of the position or positions of the reference point or points recognized by the state recognizing element, a plurality of estimated trajectories representing estimated positions of the state variable in a time-series manner according to a plurality of first models which correspond to a plurality of behavior manners of the instructor and represent shape characteristics of individual reference trajectories indicative of the time-series changing manners of the position of the state variable and a second model which represents a motion of the instructor in which the position of the state variable and one or a plurality of n-th order time differential values (n=1, 2,.. .) thereof continuously change, under a condition that the estimated trajectories pass the reference point or points or a range or ranges in the vicinity thereof, wherein fluctuations of the first models are allowed, stabilities of the first models in the process of generation of the plurality of estimated trajectories by the trajectory generating element are assessed on the basis of cumulative amounts of the fluctuations, and a behavior manner corresponding to one of the first models which exhibits a highest stability is estimated as a behavior manner of the instructor.

7827209

11862830

1. A method in a test and measurement instrument of analyzing data representing a physical phenomenon, comprising: presenting data representing the physical phenomenon in a data presentation; receiving a data selection indicating a portion of the data presented in the data presentation; generating a data object in response to the data selection; adding the data object to an analysis sandbox; and generating an analysis construct from the data object in response to analysis objects in the analysis sandbox.

20010049600

09872069

1. A system for performing a speech verification of an utterance, comprising: a search module configured to generate an N-best list of recognition candidates corresponding to said utterance; a pseudo filler score calculator coupled to said search module for determining a pseudo filler score that is based upon recognition scores corresponding to said recognition candidates; a confidence measure calculator for utilizing said pseudo filler score and a best recognition score of a best recognition candidate to determine a confidence measure; and a comparator configured to compare said confidence measure to a threshold value for determining whether to verify said best recognition candidate.

9098810

14672017

1. A method for recommending actions to affect an outcome of a process, the method comprising a computer system automatically performing the following: receiving from a user an identification of an outcome to be affected; processing a data set containing observations of the process, the observations expressed as values for a plurality of variables and for the outcome, wherein processing the data set determines behaviors for different variable combinations with respect to the outcome, the variable combinations defined by values for one or more of the variables; receiving an identification of one or more actionable variables from the plurality of variables; for pairs of a first variable combination and a second variable combination, wherein the first and second variable combinations are the same except that one or more of the actionable variables take first values in the first variable combination and take different second values in the second variable combination, predicting an impact of changing the actionable variables in the first variable combination from the first values to the second values by applying (a) the behavior of the second variable combination to (b) a population of the first variable combination; and recommending actions to change actionable variables based on the predicted impacts.

8019670

12830017

1. A method for generating risk forecasts in financial securities, comprising the steps of: selecting a set of securities; selecting at least two risk factors associated with investment risk in the securities; determining, for each selected risk factor, the risk factor's return; constructing a risk factor covariance matrix corresponding to the selected risk factors; constructing an idiosyncratic variance matrix corresponding to the securities in the selected set of securities; determining, for each selected risk factor, a risk factor loading coefficient for each security in the set by, at the least, performing a time series regression to obtain the sensitivity of each security's return to variations in the risk factor's return; projecting the risk factor covariance matrix into a future forecast, thereby producing a future forecast of the risk factor covariance matrix, wherein the step of projecting the risk factor covariance matrix into a future forecast comprises utilizing information in implied volatility; and projecting the idiosyncratic variance matrix into a future forecast, thereby producing a future forecast of the idiosyncratic variance matrix, wherein the determined risk factor loading coefficients, the future forecast of the risk factor covariance matrix, and the future forecast of the idiosyncratic variance matrix can be used together to determine a forecast of the variance-covariance matrix for all securities in the selected set of securities.

20150278213

14242843

1. A method of ranking data visualizations, comprising: at a computing device having one or more processors and memory, wherein the memory stores one or more programs for execution by the one or more processors: receiving user selection of a plurality of data fields from a set of data; identifying a plurality of data visualizations that use a majority of the user-selected data fields; for each of the plurality of data visualizations, computing a score based on a set of ranking criteria, wherein a first ranking criterion of the set of ranking criteria is based on values of one or more of the user-selected data fields in the set of data; and creating a first ranked list of the data visualizations, wherein the first ranked list is ordered according to the computed scores of the data visualizations.

20090063111

11847543

1. A method implementable in a computer system for producing a vector indicative of the output of a discrete time filter (DTF) in response to a waveform comprising a sequential series of voltages each comprising a unit interval, wherein the DTF comprises a plurality of taps with corresponding weights, comprising: specifying the number N of taps and each taps′ corresponding weight in the computer system, wherein each Xth tap is delayed by (N−X) unit intervals; populating a matrix with N rows and M columns in the computer system, wherein each column represents a unit interval, and wherein the Xth row comprises the sequential series of voltages scaled by the Xth tap's weight shifted by (X−1) columns; and adding in the computer system the columns of the matrix to produce a vector indicative of the DTF output.

20080141782

11793274

1. A method of measuring residual stress of material using an instrumented indentation technique, comprising the steps of: repeatedly applying and removing an indentation load to and from a reference specimen of the material in a stress-free state, thus generating an indentation load-depth curve in a stress-free state; measuring a maximum indentation load and a maximum indentation depth from the indentation load-depth curve in a stress-free state; calculating an actual indentation depth (h c ) from the maximum indentation depth and calculating a contact area (A c ) from the actual indentation depth; and measuring hardness (H IT ) of the material from the contact area, thus generating a stress-free curve (stress reference curve) for the reference specimen; repeatedly applying and removing an indentation load to and from an actual specimen of the material in a stressed state, thus generating a stressed curve for the actual specimen; and measuring the residual stress of the material using both a load difference (ΔL) obtained from comparison between the stress reference curve and the stressed curve and a contact area (A s ) in a stressed state obtained from a loading curve.

20050239032

10829517

1. A method for curriculum planning using a curriculum planning tool, said method comprising: selecting a grade level, an academic discipline, and a course within the academic discipline; entering local objectives to be met by the selected course; aligning the local objectives with one or more standards; mapping the selections, local objectives, and standards into one or more key concepts that support interdisciplinary connections and promote conceptual development; developing instructional activities for the selected course that teach key concepts, processes, and critical content; and assessing the curriculum against the standards using criterion-reference assessments that are aligned with a learning process complexity and based on instructional activities.

9245049

13496773

1. A method for preparing an ontology for searching, the method comprising: compressing an ontology such that one individual in each set of semantically equivalent individuals in a same concept remains in a compressed ontology; determining semantically equivalent relations among the one individual and individuals in different concepts in the compressed ontology; determining semantically restricted relations among the one individual and other individuals in the different concepts in the compressed ontology; determining semantically equivalent concepts among the same and different concepts in the compressed ontology; determining semantically restricted relations among the same and different concepts in the compressed ontology; and constructing a semantically restricted relation graph based at least on the semantically restricted relations among the one individual and the other individuals and the semantically restricted relations among the same and different concepts, wherein a query is answered using the semantically restricted relation graph.

8224338

12291281

1. A method, comprising: executing, by a computing system including a processor, a linear programming joint optimization model based on a set of business planning parameters and determining a network configuration change for a dedicated network and a network configuration change for a radio access network with an objective of meeting a cost function related to a telecommunications carrier, wherein the executing of the linear programming joint optimization model is based on an index of access circuits, an index of optimization models, an index of bundle groups, an index of time periods, an index of access vendors, an index of circuit types, and an index of migration types.

8165870

11054819

1. A computer-implemented method of processing textual adaptation data for creating a statistical language model that provides prior probability estimates for word sequences, the method comprising, with a computer: receiving textual adaptation data comprising textual data which is suitable for creating the statistical language model and non-dictated textual data which is not suitable for creating the statistical language model; segmenting the textual adaptation data into a sequence of units; extracting a first set of features for each unit in the sequence; normalizing the sequence of units to form a normalized sequence of units; extracting a second set of features for each unit in the normalized sequence of units; processing the data using a processor operating as a classifier to filter out the non-dictated textual data from the textual adaptation data, thereby identifying at least the textual data suitable for creating the language model, the processing including using a classification model which uses a combination of the first and second sets of features; outputting the textual data suitable for creating the statistical language model; and generating the statistical language model from the suitable data, wherein the statistical language model provides prior probability estimates for word sequences to guide a hypothesis search for a likely intended word sequence.

20070198322

11359356

1. An integrated process for optimizing operations at a contact center, the method comprising the steps of: defining contact center business goals; planning at least one campaign to implement the goals; scheduling and deploying a workforce in accordance with the campaign to produce a plurality of agent-customer interactions; measuring performance of an agent on at least a portion of the agent-customer interactions to produce a set of quality metrics for the agent; analyzing the quality metrics to produce a rating of the measured interactions; combining at least a portion of quality metrics to produce performance indicators; and using the performance indicators in the planning step of a second campaign or another iteration of the at least one campaign.

20110093495

12901160

1. A computer implemented method of generating a tree for finding items stored in memory, said method comprising: determining a first value indicative of a location in a memory where an item is stored; encoding said first value in an integer; and storing said integer in a tree, said tree being searchable based on identifiers associated with said item.

7552033

10027943

1. A method for diagnostically evaluating energy consumption of a facility, comprising: receiving energy consumption data associated with the facility; generating facility data associated with the facility; receiving external variable data associated with the facility corresponding to the energy consumption data; generating a first energy consumption model for the facility using the facility data, the energy consumption data, and the external variable data, the first energy consumption model corresponding to actual energy consumption of the facility; generating a second energy consumption model for the facility using the facility data and the external variable data, the second energy consumption model corresponding to expected energy consumption of the facility; and diagnostically evaluating the energy consumption of the facility using the first and second energy consumption models.

20040230858

10438130

1. A method for producing software reliability and availability data, the method comprising: accepting a reliability model; accepting software application event data; mapping the event data to the reliability model; and producing reliability and availability data based, at least in part, on the reliability model and on the software application event data.

9697441

13451817

1. A method comprising: preparing a discriminator to be used for discriminating partial data; extracting a plurality of partial data from learning data; extracting at least one local data in each of the plurality of partial data; classifying the plurality of partial data by the discriminator to obtain a discrimination degree related to a difference between the at least one local data and a decision boundary of the discriminator for each of the plurality of partial data; evaluating a usefulness degree of the extracted partial data based on the discrimination degree; selecting at least a portion of the plurality of partial data to be used to be associated with the discriminator from the plurality of partial data based on the usefulness degree; and recording information of the selected partial data as an example to the discriminator.

10042955

14617503

1. A system comprising: a memory comprising an integrated data set comprising a combination of relational-model data type definitions, object-oriented data definitions, and XML definitions, wherein the integrated data set includes: data provided by a plurality of sources including a first source and a second source, rules to decompose the data provided by the plurality of sources into data attributes, and rules to compose documents from the data attributes decomposed from the data provided by the plurality of sources; and a processor configured to: receive, from the first source, first data included in the integrated data set; receive, from the second source, second data included in the integrated data set; and generate at least one document in at least one XML format or an XML-like format using the a rule for composing the at least one document included in the integrated data set, wherein the at least one document includes a portion of the first data and a portion of the second data identified by the integrated data set, and wherein the first source and the second source, respectively, comprise at least one of: (i) an XML document, (ii) a relational database, or (iii) an object oriented input.

10064376

15450163

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

20080086446

11543494

1. A method, executable in a database system, comprising: receiving at least one query that specifies requests involving blocks of data; identifying a sequence relating to an order in which the blocks are to be retrieved into a storage for processing the requests, wherein identifying the sequence is based on the at least one query; and providing an output for the at least one query based on retrieving the blocks into the storage according to the identified sequence.

20120027308

12848246

1. A method, comprising: receiving a glyph; reducing the received glyph to a predefined format; normalizing the reduced glyph; comparing the normalized glyph to a plurality of image prototypes; and outputting at least one of the plurality of image prototypes based on the comparison of the normalized glyph to the plurality of image prototypes.

20080027514

11690655

1. A method comprising: providing test stimulation to a patient according to a plurality of programs, wherein each of the plurality of programs comprise an electrode combination; for at least one of the plurality of programs, receiving a positive input that indicates a positive effect resulting from provision of stimulation according to the program; for at least one of the plurality of programs, receiving a negative input that indicates an adverse effect resulting from provision of stimulation according to the program; and automatically sorting the plurality of tested programs based upon the positive input and negative input.

7657383

10856600

1. A method of compactly representing and storing a complete subject genome comprising: programming a computer to carry out the following steps: constructing a base reference genome for a species, wherein said base reference genome is a benchmark or model genome for the species; providing the subject genome, said subject genome being a genome of a member of the species; retrieving the base reference genome; comparing the subject genome to the base reference genome; identifying all differences between the subject genome and the base reference genome; assigning one or more items of descriptive information to each of the differences, wherein each of said items of descriptive information describes a particular deviation of the subject genome from the base reference genome resulting in each of said differences; compiling the items of descriptive information describing all the differences between the subject genome and the base reference genome into a data set, wherein the data set represents the complete subject genome, and wherein the data set does not include data other than the items of descriptive information describing each difference between the subject genome and the base reference genome; and storing the data set representing the complete subject genome on a machine readable storage; and using the stored data set for genetic research or medical treatment.

20120203535

13449329

1. A method for performing model checking, the method performed by a computer having a processor and a memory, the method comprising: concurrently executing, with respect to a model, one or more model reducers and one or more model checkers; and synchronizing information between a portion of the one or more model checkers and model reducers, thereby improving performance of at least one module without a-priori suspending an operation of the module, wherein the at least one module is selected from the group consisting of the one or more model reducers and the one or more model checkers.

8793236

13666880

1. A method, comprising: performing, by a computer: associating one or more participating actions with a success event; wherein each of the one or more participating actions comprises a user action on a network-based content site; determining a historical influence score for each of the one or more participating actions based on a previously measured metric associating the one or more participating actions with previous instances of the success event; and assigning a current success influence score to each of the one or more participating actions based on the respective participating action's historical influence score as a proportion of a total of the historical influence scores of the one or more participating actions.

20090287738

12085847

1. A web-based system comprising a server, database and a web-portal to provide an integrated feedback management system for the assessment of educational services, comprising: an interface to: input definitions of graduate attributes at various levels of complexity; input definitions of learning outcomes related to teaching theory at various levels of complexity; a database to map relationships between: graduate attributes at particular levels of complexity and their related teaching methods and assessment items; learning outcomes at particular levels and their related teaching methods and assessment items; a processor to: automatically respond to the assessment results for a particular student and determine and record both the graduate attribute levels of complexity, and learning outcomes levels, achieved by that student.

6052053

08955547

1. A system for monitoring the efficacy of a plurality of electrostatic discharge (ESD) devices comprising: a) a plurality of ESD device monitors, each monitor being in communication with at least some of the ESD devices; b) a plurality of data hubs, each one of the data hubs having a clock and a memory and each of the data hubs being in communication with at least one of the plurality of ESD device monitors; and c) a computer in communication with the data hubs for storing and displaying data retrieved from the monitors via the data hubs in which the computer retrieves the data by periodically polling the data hubs.

20150339576

14286004

1. A method, in a data processing system, for optimization of mixed-criticality systems, the method comprising: receiving, by a processor in the data processing system, a plurality of strategies, wherein the plurality of strategies are in a fixed order of criticality; for each strategy in the plurality of strategies, obtaining, by the processor, a multivariate objective function and a multivariate constraint in a multivariate decision variable; maximizing, by the processor, a number of strategies of the plurality of strategies that are feasible in combination; and generating, by the processor, a solution that is feasible for the number of strategies that are feasible in combination, such that the objective of a least-critical strategy that is feasible in combination with the other strategies in the number of strategies is optimized.

9407475

14341869

1. A method of soft output multiple-input-multiple-output (MIMO) decoding, the method comprising: generating a tree-graph of bits based on: MIMO rank of a receiver, number of bits per layer in the graph, and type of modulation, wherein the tree-graph comprises a root node, leaf nodes, nodes, and branches connecting the nodes; performing sphere decoding by determining a radius covering a subset of nodes within said tree-graph; managing, based on the sphere decoding, tables comprising metrics and counter metrics usable for log likelihood ratio (LLR) generation; predicting, based on a specified prediction scheme, predicted counter metrics for partial paths in the tree-graph that comprise nodes and branches outside the determined radius; and updating at least a portion of the tables comprising the metrics and the counter metrics with the predicted counter metrics when the predicted counter metrics are better in maximum likelihood terms than the counter metrics stored in the tables, wherein predicting a counter metric for a specific partial path in the tree-graph is done by adding a Euclidean distance of a full path with a lowest metric found (metric ML ) minus a partial Euclidean distance for a level i of the full path with the lowest metric found (PED i ML ) to a partial Euclidean distance for level i of the specific partial path (PED i ) and i is an integer between 1 and the number of levels in the tree-graph.

9558017

14218555

1. A computer system including instructions recorded on a non-transitory computer-readable medium and executable by at least one processor, the system comprising: a conflict resolution manager configured to cause the at least one processor to manage software component dependencies for applications using declarative constraint definitions, the conflict resolution manager including, a component analyzer configured to analyze and detect direct and transitive software component dependencies on one or more libraries; a constraint checker configured to enable specification of constraint definitions in a declarative language, and to identify and check software component dependencies for one or more libraries that violate the constraint definitions including accessing at least one database with stored vulnerability data and comparing the one or more libraries to the vulnerability data to identify, in a manifest file, one or more violations of the constraint definitions; an optimizer configured to implement an algorithm for, analyzing applications and resolving software component dependencies on the one or more libraries that violate the constraint definition, wherein resolving software component dependencies includes, generating a plurality of dependency expressions using the declarative language, iteratively determining a subset of the plurality of dependency expressions that satisfy the constraint definitions, and rewriting the manifest file to omit one or more libraries that violate the subset of the plurality of dependency expressions, the manifest file being rewritten in response to determining at least one software component violates at least one constraint declared in the manifest file, wherein rewriting the manifest file further includes determining a plurality of libraries that are unused by the at least one software component and removing the plurality of libraries that are unused from the manifest file; and a storage handler configured to access a database and store information related to the constraint definitions, the software component dependencies, and the algorithm for analyzing applications and resolving software component dependencies.

9493822

13393255

1. A device for the specific selection of target molecules, comprising: at least one reaction zone comprising a microarray, wherein the microarray comprises a substrate, on which substrate one or more species of capture molecules are immobilized, wherein the target molecules interact with the capture molecules in the reaction zone, the reaction zone further comprising one or more temperature regulating units for regulating the temperature within the reaction zone; at least one non-bound zone, wherein non-bound target molecules that did not interact with the capture molecules are reactivated in the non-bound zone, the non-bound zone comprising one or more temperature regulating units for regulating the temperature within the non-bound zone a fluid connection region, in which the reaction zone is in fluid connection with the non-bound zone; at least one pump for pumping a fluid through the fluid connection region and between said reaction zone and said non-bound zone, wherein the fluid carries the non-bound target molecules; mixing structures in the fluid connection region for mixing the fluid; wherein the reaction zone, the non-bound zone and the pump are arranged in a closed loop so that fluid is pumped between the reaction zone and the non-bound zone; and wherein the non-bound zone comprises a meandering flow path, wherein at least 40% of the device comprises the meandering flow path, and wherein the meandering flow path has a bifurcation leading to an internal loop having a pump for repetitive passing of the fluid through the meandering flow path.

20100165090

12509926

1. A method for capturing biometric data of a hand comprising the steps of: digitally photographing a designated contactless capture area not having any predefined hand-positioning structures or platen for receiving a hand, to obtain a captured image of the capture area that includes a naturally-posed hand; extracting a frontal hand image of the naturally-posed hand by applying an Active Appearance Model (AAM) to the captured image; and computing a plurality of hand geometry measurements of the frontal hand image.

20060136879

11001327

1. A method for transforming a formula in a simple-subset, comprising: inputting a property specification language formula, the formula comprising a plurality of forms; and applying one or more of a set of transformation rules to transform the property specification language formula into a Sugar Extended Regular Expression (SERE) implication, the SERE implication being of one form.

7715408

11717359

1. A method for establishing communication schedules for a distributed real-time computer cluster comprising nodal computers, comprising the steps of: a) creating a grid by a computer which contains parameters necessary to enable basic communication between nodes of a cluster; b) providing nodal communication schedules for all nodes planned to be used as invariant components, said nodal communication schedules having been derived based on the parameters contained in said grid and any node-specific parameters from said invariant components; and c) deriving cluster communication schedules from said nodal communication schedules which contain, in addition to all parameters of the grid and the node-specific parameters of the invariant components, those parameters which are relevant to the remaining nodes of the cluster; d) wherein said nodal communication schedules for said invariant components may be used in any grid having the same parameters.

20080204098

11710103

1. A method for sharing current among multiple phases and/or paralleled modules in a power stage, comprising: obtaining an input power of the power stage; adaptively changing duty cycles of the multiple phases and/or the paralleled modules until the minimum input power is obtained; and using the duty cycles that correspond to the minimum input power for the multiple phases and/or the paralleled modules.

20030110147

10091109

1. A computer-implemented process for using feature selection to obtain a strong classifier from a combination of weak classifiers, comprising using a computer to perform the following process actions: (a) inputting a set of training examples, a prescribed maximum number of weak classifiers, a cost function capable of measuring the overall cost, and an acceptable maximum cost; (b) computing a set of weak classifiers, each classifier being associated to a particular feature of the training examples, (c ) determining which of the set of weak classifiers is the most significant classifier; (d) adding said most significant classifier to a current set of optimal weak classifiers; (e) determining which of the current set of optimal weak classifiers is the least significant classifier; (f) computing the overall cost for the current set of optimal weak classifiers using the cost function; (g) conditionally removing the least significant classifier for the current set of optimal weak classifiers; (h) computing the overall cost for the current set of optimal weak classifiers less the least significant classifier using the cost function; (i) determining whether the removal of the least significant classifier results in a lower overall cost; (j) whenever it is determined that the removal of the least significant classifier results in a lower overall cost, eliminating the least significant classifier; (k) recomputing each classifier in the current set of optimal weak classifiers associated with a feature added subsequent to the eliminated classifier while keeping the earlier optimal weak classifiers unchanged; (l) repeat actions (f) through (k) until it is determined the removal of the least significant classifier does not result in a lower overall cost and then reinstating the last identified least significant classifier to the current set of optimal weak classifiers; (m) determining if the number of weak classifiers in the current set of optimal weak classifiers equals the prescribed maximum number of weak classifiers or the last computed overall cost for the current set of optimal weak classifiers is less than the acceptable maximum cost; and (n) whenever it is determined that the number of weak classifiers in the current set of optimal weak classifiers does not equal the prescribed maximum number of weak classifiers and the last computed overall cost for the current set of optimal weak classifiers exceeds the acceptable maximum cost, repeating actions (c) through (m) until it is determined that the number of weak classifiers in the current set of optimal weak classifiers does equal the prescribed maximum number of weak classifiers or the last computed overall cost for the current set of optimal weak classifiers becomes less than the maximum allowable cost, then outputting the sum of the individual weak classifiers as the trained strong classifier.

9805138

14616032

1. An apparatus for performing clustering of documents, the apparatus comprising: a distance measure component configured to compute a path-based distance D ij path = min r ∈ ℛ ij ⁡ ( O ) ⁢ { max 1 ≤ l ≤  r  ⁢ e 1 } between a document i and a document j in an undirected graph (O, E) that includes one or more cycles, where O is a set of N documents including the document i and the document j and E is a set of edges connecting pairs of documents in the undirected graph with each edge having an edge weight, and where ij (O) is the set of all routes between the document i and the document j in the undirected graph , the route r comprises a sequence of edges l=1,. .. , |r|, and e l is the edge weight of the l th edge along the route, the distance measure component comprising an electronic data processing device programmed to compute the path-based distance D ij path by operations including (i) computing a minimum spanning tree over the undirected graph and (ii) computing a path-based distance between the document i and the document j in the minimum spanning tree and (iii) setting the path-based distance D ij path between the document i and the document j in the undirected graph equal to the path-based distance between the document i and the document j in the minimum spanning tree; and a clustering component configured to construct clusters comprising sub-sets of documents of the set of documents O, the clustering component comprising the electronic data processing device further programmed to perform a clustering process including the operations of invoking the distance measure component to compute path-based distances between pairs of documents of the set of documents O and grouping similar documents into said clusters based on the computed path-based distances.

9384758

14754539

1. A computer-implemented method for matching audio sequences, the method performed by a computer processor and comprising: deriving, by the computer processor, a first probability density function P M outputting a probability that an initial correspondence score for a pair of chroma vectors of an audio sequence indicates a semantic correspondence between the chroma vectors; deriving, by the computer processor, a second probability density function P R outputting a probability that the initial correspondence score for a pair of chroma vectors of an audio sequence indicates that the chroma vectors have a random correspondence, the deriving of P R comprising: randomly selecting a set of pairs of audio sequences; deriving initial correspondence scores for the set of pairs of audio sequences; and fitting the initial correspondence scores to a probability distribution; deriving, by the computer processorusing P M and P R , a match function indicating whether a given pair of chroma vectors of an audio sequence correspond semantically; obtaining a first audio sequence; comparing, by the computer processorusing the match function, the first audio sequence with a plurality of known audio sequences; and based on the comparing, identifying, by the computer processor, a best-matching audio sequence for the first audio sequence from the known audio sequences.

20080177813

11563900

1. A method for measuring time series relevance using state transition points, comprising: measuring a computer resource metric to obtain a time series data: inputting the time series data and relevance threshold data; converting all time series value to ranks within [0,1] interval; calculating the valid range of the transition point in [0,1]; verifying that a time series Z exists for each pair of time series Z and Y, such that the relevances between X and Z, and between Y and Z are known; deducing the relevance of X and Y, the relevance of X and Y must be at least one of, (i) higher than the given threshold, and (ii) lower than the given threshold; terminating all remaining calculations for X and Y provided Z is found; segmenting time series if no Z time series exists and using the segmented time series to estimate the relevance; applying a hill climbing algorithm in the valid range to find the true relevance; and using the true relevance to identify critical resources, the critical resources used for capacity planning.

20080082356

11542397

1. A computer implemented method for automatically selecting an optimal control cohort, the computer implemented method comprising: selecting attributes based on patient data; clustering of treatment cohort records to form clustered treatment cohorts; scoring control cohort records to form potential control cohort members; and selecting the optimal control cohort by minimizing differences between the potential control cohorts members and the clustered treatment cohorts.

9341483

13794316

1. A processor-implemented method for estimating a position of a mobile station (MS) the method comprising: identifying a subset of points of interest in a plurality of points of interest by matching MS captured images of each point of interest in the subset of points of interest with at least one corresponding stored image of a point of interest selected from images of the plurality of points of interest, each point of interest in the subset of points of interest being associated with a corresponding visibility map comprising a set of grid points; computing a corresponding cumulative grid point weight for each grid point based on corresponding individual grid point weights, each individual grid point weight associated with one of the points of interest in the subset of points of interest; and computing an estimated location of the MS based on the corresponding cumulative grid point weight of each grid point.

20160364469

15186063

1. A method of clustering a set of objects having respective object types, respective object attributes, homogeneous relationships between respective objects of the same object type, and heterogeneous relationships between objects having a different object types, the method comprising: iteratively optimizing a clustering of the set of objects within a plurality of latent classes, dependent on object type, object attributes, homogeneous relationships, and heterogeneous relationships, by performing, in an expectation step, updating a set of posteriors to maximize a probability that an object is associated with a respective latent class, and in a minimization step, updating the plurality of latent classes based on the updated set of posteriors; and storing the optimized clustering.

8812435

11941382

1. A method for learning objects and facts from documents, comprising: on a computer system having one or more processors and memory storing one or more programs for execution by the one or more processors, without user intervention: selecting a source object from a plurality of objects stored in a fact repository, the source object having an object name and an attribute-value pair; selecting a source document from a plurality of documents based on a determination that a title of the source document includes the object name of the source object; and content of the source document includes an attribute and a value related to the attribute-value pair of the source object; identifying a title pattern for the title of the source document based on a first syntax of (i) the title of the source document, and (ii) the object name of the source object within the title of the source document; identifying a contextual pattern for the content of the source document based on a second syntax of (i) the attribute and (ii) the value related to the attribute-value pair of the source object, the contextual pattern being a structural pattern in which one or more attribute-value pairs, including the attribute-value pair of the source object, are presented; selecting a second document from the plurality of documents based on a determination that (i) the contextual pattern is found in the second document and (ii) a title of the second document matches the title pattern; identifying a new object name and a new attribute-value pair from the second document by applying the title pattern and the contextual pattern identified from the source document to the second document; and storing into the fact repository the new attribute-value pair and a new object having the new object name.

7998674

12067549

1. A method of assessing the risk of distant metastasis in a patient having nasopharyngeal carcinoma comprising evaluating, in a sample from said patient, the expression profile of a combination of genes comprising (i) tyrosine 3-monooxygenase/tryptophan 5-monooxygenase activation protein, zeta polypeptide (YWHAZ); (ii) small nuclear ribonucleoprotein polypeptides B and B1 (SNRPB); (iii) nuclear transport factor 2 (NUTF2); (iv) nucleoporin 205kDa (NUP205); (v) transketolase (TKT); (vi) guanine monphosphate synthetase (GMPS); (vii) chaperonin containing TCP1, subunit 3 γ (CCT3); (viii) t-complex 1 (TCP1); (ix) hypothetical protein FLJ12671 (FLJ12671); (x) poly(A) binding protein, cytoplasmic 1 (PABPC1); (xi) IMP (inosine monophosphate) dehydrogenase 2 (IMPDH2); (xii) UMP-CMP kinase (UMP-CMPK); (xiii) elongation factor Tu GTP binding domain containing 1 (EFTUD1); (xiv) eukaryotic translation initiation factor 3, subunit 12 (EIF3S12); (xv) Tax1 (human T-cell leukemia virus type I) binding protein 1 (TAX1BP1); (xvi) dynein, cytoplasmic, light polypeptide 2A (DNCL2A); (xvii) AP2 associated kinase 1 (AAK1); (xviii) phosphatidylinositol 4-kinase, catalytic, alpha polypeptide (PIK4CA); (xix) ARF GTPase-activating protein (FLJ00312); (xx) recombining binding protein suppressor of hairless (RBPSUH); (xxi) interferon gamma receptor 2 (IFNGR2); (xxii) splicing factor, arginine/serine-rich 4 (FLJ11021); (xxiii) non-POU domain containing, octamer-binding (NONO); (xxiv) survival of motor neuron protein interacting protein 1(SIP1); (xxv) ubiquitin protein ligase E3A (UBE3A); (xxvi) eukaryotic translation initiation factor 5A (EIF5A); (xxvii) c-mer proto-oncogene tyrosine kinase (MERTK); (xxviii) SWI/SNF related, matrix associated, actin dependent regulator of chromatin, subfamily a, member 2 (SMARCA2); (xxix) Radixin (RDX); (xxx) heterogeneous nuclear ribonucleoprotein R (HNRPR); (xxxi) DnaJ (Hsp40) homolog, subfamily A, member 2 (DNAJA2); (xxxii) DnaJ (Hsp40) homolog, subfamily A, member 1(DNAJA1); (xxxiii) CDNA FLJ34482 fis, clone HLUNG2004067 (AP!GBP1); (xxxiv) F-box protein 7 (FBXO7); (xxxv) KIAA0962 protein (KIAA0962); (xxxvi) trinucleotide repeat containing 6B (TNRC6B); (xxxvii) chromosome 11 open reading frame2 (C11orf2); (xxxviii) additional sex combs like 2 (ASXL2); (xxxix) apolipoprotein E (APOE); (xl) ADP-ribosylation factor GTPase activating protein 3 (ARFGAP3); (xli) SH3 domain binding glutamic acid-rich protein like 3 (SH3BGRL3); (xlii) ATP synthase, H+transporting, mitochondrial F0 complex, subunit e (ATP5I); (xliii) sterol carrier protein 2 (SCP2); (xliv) apolipoprotein B mRNA editing enzyme, catalytic polypeptide-like 3C (APOBEC3C); (xlv) B-cell translocation gene 1, anti-proliferative (BTG1); (xlvi) golgi autoantigen, golgin subfamily b, macrogolgin (with transmembrane signal), 1 (GOLGB1); (xlvii) chromosome 22 open reading frame 9 (C22orf9); (xlviii) Nijmegen breakage syndrome 1 (NBS1); (xlix) eukaryotic translation elongation factor 1 alpha 1 (EEF1A1); (l) thioredoxin reductase 1 (TXNRD1 ); (li) inositol polyphosphate-5 -phosphatase, 40 kDa (INPP5 A); (lii) solute carrier family 7 (cationic amino acid transporter, y+ system), member 1 (SLC7A1); (liii) IMP (inosine monophosphate) dehydrogenase 2 (IMPDH2); (liv) glutamyl-prolyl-tRNA synthetase (EPRS); (lv) chaperonin containing TCP1, subunit 2 β (CCT2); (lvi) chaperonin containing TCP1, subunit 1 α (TCP1); (lvii) anaphase promoting complex subunit 5 (ANAPC5); (lviii) nucleolar guanine nucleotide binding protein-like 2 (GNL2); and (lix) RNA binding motif protein 28 (RBM28).

20100082521

12241784

1. A computer-implemented method of model forecasting or model estimation that provides forecasts or estimates with respect to one or more attributes contained in an attribute-based hierarchy, wherein the one or more attributes are related to a physical hierarchy involving an organization, wherein the physical hierarchy is representative of an operational framework of the organization or products or services provided by the organization or combinations thereof, said method comprising: receiving physical hierarchical data indicative of the physical hierarchy's structure; receiving attribute input data that describes one or more attributes of entities of the physical hierarchy; creating an attribute-based hierarchy based upon the received physical hierarchical data and the received attribute input data; wherein the created attribute-based hierarchy contains at least one level described by the received attribute input data; and creating a mapping table that indicates relationships between the attribute-based hierarchy and the physical hierarchy; wherein data from the attribute hierarchy is used during model forecasting analysis or model estimation analysis of the one or more attributes; determining analysis results with respect to one or more entities in the physical hierarchy using the mapping table with respect to analysis performed with the attribute-based hierarchy.

20120283989

13463875

1. A server for communicating with a plurality of monitoring devices via a network, each of the monitoring devices acquiring monitoring variables (1˜H; H is an integral number larger than 1) from an observation target and generating an individual multidimensional distribution of the monitoring variables, the server comprising: a receiving unit configured to collect the individual multidimensional distribution from the each monitoring device, a first space defined by axes of the monitoring variables (1˜H) being divided into a plurality of first elements at the each monitoring device, the individual multidimensional distribution representing a probability density or a frequency of the monitoring variables belonging to each of the first elements in the first space; a first server side generation unit configured to generate first sampling data by sampling the individual multidimensional distribution collected, to determine a first discretion parameter using the first sampling data, the first discretion parameter indicating a method for dividing the first space, to divide the first space into a plurality of second elements by the first discretion parameter, and to generate an overall multidimensional distribution representing a probability density or a frequency of the first sampling data belonging to each of the second elements in the first space; a statistical estimation unit configured to determine indexes (1˜K; K is an integral number larger than 1) to evaluate a state of each observation target from the monitoring variables, using the overall multidimensional distribution; a second server side generation unit configured to generate a second sampling data by sampling the overall multidimensional distribution, to calculate index data of the indexes (1˜K) by calculating the statistical models with the second sampling data, to determine a second discretion parameter using the index data, the second discretion parameter indicating a method for dividing a second space defined by axes of the indexes (1˜K), to divide the second space into a plurality of third elements by the second discretion parameter, and to generate an overall index multidimensional distribution representing a probability density or a frequency of the index data belonging to each of the third elements in the second space; and a transmission unit configured to transmit the overall index multidimensional distribution and the statistical models (1˜K) to each monitoring device.

20130268131

13859242

1. An electrical power system comprising: a multiplicity of sensors in communication with an electrical grid, wherein said sensors monitor conditions within said electrical grid and produce condition data corresponding to said conditions within said electrical grid; a dynamic stochastic optimal power flow (DSOPF) control system in communication with said multiplicity of sensors for receiving said condition data and generating control data; an active power generation controller in communication with said electrical grid and said DSOPF control system; a reactive power generation controller in communication with said electrical grid and said DSOPF control system; and whereby said DSOPF control system calculates a DSOPF model representing an optimal power system state for said electrical grid based upon said condition data, then outputs said control data to one or more of said active power generation controller and said reactive power generation controller to control an amount of active and reactive power in said electrical grid.

6108648

08896931

1. A computer-operated apparatus for generating selectivity values in a database management system (DBMS), the DBMS having one or more tables for storing data, each table having zero or more user-defined routines (UDRs), said apparatus comprising: a feature vector extractor coupled to said one or more database tables, said feature vector extractor being adapted to convert said UDR into a base representation; a neural network coupled to the feature vector extractor for generating selectivity values based on the base representation; and an optimizer coupled to said neural network, said optimizer dynamically applying said neural network to determine an optimum query search sequence for the DBMS based on the generated selectivity values.

6054322

08737894

1. A method for discriminating individuals consuming over about 1000 g of alcohol per week from those consuming less than about 100 g of alcohol per week, comprising measuring a sialic acid level in a body fluid sample of the individual, wherein the body fluid is of a type containing sialic acid levels reflecting alcohol consumption, and comparing the measured level to a value above which there is a significant probability that the individual is consuming over 1000 g of alcohol per week.

20090264320

12380703

1. A method of preparing a yeast library by electroporation of yeast cells, the method comprising the steps of: providing a suspension comprising nucleic acid vectors, yeast cells, sorbitol, and CaCl 2 or MgCl 2 and electroporating the suspension at 0.5 kV/cm to greater than 12.5 kV/cm with a capacitance of about 10 to about 50 μF; thereby to obtain a library size of at least 1×10 9 .

20100161810

12339961

1. A method for electronic prognostication for a computer system, the method comprising: monitoring a performance parameter in a set of performance parameters from a set of computer systems that includes at least two computer systems, wherein monitoring the performance parameter includes systematically monitoring and recording the set of performance parameters from computer systems in the set of computer systems, and wherein the recording process keeps track of the temporal relationships between events in different performance parameters in the set of performance parameters; generating a training data set based on the performance parameter monitored from the set of computer systems, wherein generating the training data set includes concatenating two or more time-series of the performance parameter from computer systems in the set of computer systems; training the pattern-recognition model using the training data set; using the pattern-recognition model to look for anomalies in performance parameters gathered during normal operation of a target computer system; and generating an alarm when the pattern-recognition model detects an anomaly in the performance parameters from the target computer system.

20150117703

14063511

1. An object identification method, comprising: dividing an input video into a number of video shots, each containing one or more video frames; detecting target-class object occurrences and related-class object occurrences in each video shot; generating hint information including a small subset of frames representing the input video; performing object tracking and recognition based on the hint information; combining tracking and recognition results; and outputting labeled objects based on the combined tracking and recognition results.

8219392

11567052

1. A method of signal processing, said method comprising: performing a coding operation on a portion in time of a digitized audio signal, wherein said coding operation includes an ordered plurality of iterations; for each of the ordered plurality of iterations, calculating a corresponding value of a gain measure for the coding operation, wherein the value is based on a calculated energy of a residue of the iteration of the coding operation; for each of a plurality of first threshold values, determining the first iteration, among the ordered plurality, at which a specified relation between the corresponding calculated gain measure value and the threshold value has a particular state, and storing an indication of the position of the iteration within the ordered plurality; and comparing at least one of the stored order indications to at least one corresponding second threshold value, wherein said gain measure for the coding operation is a monotone function with respect to the position of the iteration within the ordered plurality.

10075695

14559067

1. An information processing method applied to an information processing device in which a 3D map and a spatial topological structure management-based feature library created in advance for a certain environment is contained, and different users in the certain environment are able to determine their location in accordance with images taken by themselves and the feature library, the method comprising: acquiring a first image taken by a first user; extracting one or more first feature points in the first image to obtain first feature descriptors for characterizing the first feature points; obtaining 3D locations of the first feature points based on a 3D location of the first user, the first image, and the feature library; determining feature descriptors to be updated based on the 3D location of the first user, the 3D locations of the first feature points, the first feature descriptors corresponding to the first feature points, and existing feature descriptors in the feature library; and updating the feature library based on the feature descriptors to be updated, wherein the step of determining feature descriptors to be updated comprises: selecting one of the first feature points in the first image; determining a minimum spatial node crossed by a line between the selected first feature point and the location of the first user; judging whether any feature descriptors of the feature library are contained within the minimum spatial node; and determining all of the feature descriptors contained within the minimum spatial node as feature descriptors to be deleted if the judgement is positive, wherein the minimum spatial node is a space resolution in the certain space environment, and the certain space environment is divided by the minimum spatial node, wherein the step of determining feature descriptors to be updated further comprises: determining respective first feature descriptors in the first image as feature descriptors to be added; acquiring a plurality of strength information of the feature descriptors to be added; and among the feature descriptors to be added, removing feature descriptors of which the plurality of strength information are less than a first threshold; and wherein the step of determining feature descriptors to be updated further comprises: determining respective first feature descriptors in the first image as feature descriptors to be added; calculating a similarity degree between the feature descriptors to be added and the feature descriptors in the feature library at the corresponding minimum spatial node, wherein they are considered to be similar if the similarity degree greater than a second threshold; and among the feature descriptors to be added, removing feature descriptors which are considered similar to the feature descriptors in the feature library.

20090228248

12085926

1. Method for computer-aided simulation of the temporal propagation of technical processes as evolution problem, which is described by at least two different mathematical models as sub-evolution problems which use discretisation entities which are different from each other and are propagated in time by means of model-specific algorithms, the simulation being implemented by means of a large number of calculation units, characterised in that the mathematical models are reproduced on a single coherent graph structure ( 1 ) with the discretisation entities as nodes ( 2 ) and the neighbourhood relations thereof as edges ( 3 ), edges ( 3 a , 3 b ) being produced between discretisation entities belonging to the same model and also edges ( 3 c ) between discretisation entities belonging to different models, respectively for the nodes assigned respectively to one mathematical model, for the edges ( 3 a , 3 b ) between nodes belonging to the same model and also for nodes belonging to different models, respectively specific evolution operators being indicated, and the graph being propagated in time using these evolution operators.

9021416

12268168

1. A product comprising: a machine readable medium other than a transitory signal; and application evaluation logic stored on the machine readable medium that when executed by a processor causes the processor to: identify an application, where the application comprises source code; generate a recommended application evaluation area for reviewing the application, the recommended application evaluation area comprising multiple distinct sub-regions, each sub-region assigned to a particular display task that facilitates evaluation of the application; present, as a first sub-region within the recommended application evaluation area, a concept query display region, and display query terms in the concept query display region wherein the query terms are associated with a first query or a second query collectively used to identify the application, wherein the first query is performed against only help documentation that provides trusted descriptions of API calls, and further wherein the second query includes the first query and an Application Programming Interface (API) descriptor retrieved from a first set of search results corresponding to the first query; present, as a second sub-region within the recommended application evaluation area, a concept distribution display region with a graphical representation of the application, where the graphical representation comprises a concept distribution locator that graphically identifies an implementation location within the source code of a selected term among the query terms; present, as a third sub-region within the recommended application evaluation area, a source code display region responsive to a selection of the concept distribution locator, and display in the source code display region a selected portion of the source code from the application for the implementation location within the application of the selected term; highlight, in the source code display region, selected source code components within the selected portion of the source code that the processor determined were relevant to the selected term; and present, as a fourth sub-region within the recommended application evaluation area, a metadata display region, and display, within the metadata display region, metadata identified for the application, the metadata including semantics information for the application found in the help documentation, and the API descriptor.

20040085228

10285131

1. A lossy data compression method for converting a source sequence over a source alphabet to a distorted sequence over a reproduction alphabet by intentionally introducing errors, the method comprising: parsing the source sequence into a plurality of source phrases; mapping each source phrase to a distorted phrase of equal length and that includes a distortion that is less than an allowed per-symbol distortion budget; and synthesizing the distorted sequence by concatenating the distorted phrases.

20170063336

15159672

1. A method of designing a band-pass filter, comprising: establishing a baseline filter design meeting first design criteria, the baseline filter design including a plurality of surface acoustic wave resonators, each surface acoustic wave resonator having a respective resonant frequency, the plurality of surface acoustic wave resonators organized by resonant frequency into two or more groups; establishing one or more alternative filter designs, each of the one or more alternative filter designs derived from the baseline filter design by reordering the resonant frequencies of two or more of the plurality surface acoustic wave resonators within at least one of the two or more groups; calculating a respective performance metric related to an input impedance over a pass band of each of the baseline filter designs and the one or more alternative filter designs; and selecting a final filter design from among the baseline filter design and the one or more alternative filter designs based on the respective performance metrics.

8898610

13487612

1. A method comprising: providing a plurality of cells in a cell library; filtering the cells according to function identification tag to obtain first filtered cells, wherein the function identification tag is a unique identification tag that identifies the logic functionality that is implemented by the cell; and using at least one processor, using topological characteristics to divide the first filtered cells into two or more subsets of the plurality of cells in the cell library, wherein the using topological characteristics to divide the first filtered cells into two or more subsets of the plurality of cells comprises: placing in a first subset selected cells of the first filtered cells having X number of devices of a first device type in series and Y number of devices of a second device type in series.

8265205

12198669

1. A method comprising: receiving a signal that includes a desired signal component and an interference signal component, the desired signal component including a training sequence and at least one data field; demodulating the training sequence and a corresponding portion of the interference signal component using a joint detection Viterbi (JDV) algorithm to evaluate possible transmitted training sequences and interference signal sequences, and generate channel estimations for the desired signal component and the interference signal component, wherein demodulating the training sequence comprises convolving a channel impulse response with a plurality of known possible transmitted sequences; and demodulating the at least one data field according to the JDV algorithm using the channel estimations as initial channel estimates for the JDV algorithm.

20150204674

14431099

1. An improved Inertial Navigation System (INS), comprising: a) an INS unit which comprises: i. an IMU which in turn comprises a set of at least three gyros and at least three accelerometers, all mounted on a rotatable stage; and ii. an INS algorithm for measuring the behavior of said gyros and said accelerometers during a mission, and calculating a navigation solution based on said measurements; b) a north finding determination unit, which comprises: i. one or more from said IMU gyros and one or more from said IMU accelerometers; and ii. a north finding algorithm which utilizes measurements from said one or more north finding gyros and one or more north finding accelerometers during an initial conditions stationary state in which the stage is positioned in at least two separate stationary orientations, said north finding algorithm determines a north finding solution which is provided to the INS unit for initializing its said INS algorithm.

20140101306

13648975

1. A method for managing a plurality of instances of a Wide Area Network (WAN) optimizer executing on an intermediary device, the method comprising: (a) establishing, on a device intermediary to a plurality of clients and a plurality of servers, a plurality of instances of a Wide Area Network (WAN) optimizer to accelerate WAN communications between the plurality of clients and the plurality of servers; (b) monitoring, by the device, network traffic traversing the device for each of the plurality of instances of the WAN optimizer; and (c) selecting, by a manager executing on the device responsive to the monitoring, a change of a load balancing scheme to load balance the plurality of instances of the WAN optimizer.

20040028222

10343145

1. An encoder for encoding a covertext signal to generate a stegotext, the encoder comprising: first transformation means for carrying out a Fast Fourier Transform and rectangular polar conversion of the covertext signal so as to transform the covertext signal into a log power spectrogram; means for providing at least one key, the or each key being in the form of a two-dimensional pattern of predetermined size; a multiplier for adding or subtracting in the log power spectrogram domain multiples of the key or multiples of one or more of the keys if there is a plurality of keys, to blocks of the transformed covertext signal; means for controlling the addition or subtraction of the key or keys by the multiplier in accordance with data representing a desired code; and second transformation means for carrying out polar rectangular conversion and inverse Fast Fourier Transformation of the modulated covertext signal to generate a stegotext.

20070214460

11333256

1. A method for dynamic event matching, comprising defining a domain model for each domain; modeling individual requirements and preferences of a user to create a personal model; modeling dynamic requirements of a specific domain for the user; generating a dynamic event; obtaining the dynamic event using an information server for format transformation to create an event model; matching the personal model and the event model using a content-based method according to the domain model and the dynamic event; informing the user of the matching results; and adjusting the matching results according to user feedback.

9213943

14153257

1. A parameter inference method based on a Latent Dirichlet Allocation model, comprising: calculating the Latent Dirichlet Allocation model according to a preset initial first hyperparameter, a preset initial second hyperparameter, a preset initial number of topics a preset initial global count matrix of documents and topics, and a preset initial global count matrix of topics and words, to obtain a probability distribution between documents and topics and a probability distribution between topics and words; obtaining, by using an expectation maximization algorithm, a first hyperparameter, a second hyperparameter, and the number of topics that maximize log likelihood functions of the probability distributions; and determining whether the first hyperparameter, the second hyperparameter, and the number of topics converge, and when the first hyperparameter and the second hyperparameter do not converge, putting the first hyperparameter, the second hyperparameter, and the number of topics into the Latent Dirichlet Allocation model for calculation until an optimal first hyperparameter, an optimal second hyperparameter, and an optimal number of topics that maximize the log likelihood functions of the probability distributions converge, and outputting the probability distributions, the optimal first hyperparameter, the optimal second hyperparameter, and the optimal number of topics that are eventually obtained, wherein calculating the Latent Dirichlet Allocation model according to the preset initial first hyperparameter, the preset initial second hyperparameter, the preset initial number of topics, the preset initial global count matrix of documents and topics, and the preset initial global count matrix of topics and words, to obtain the probability distribution between documents and topics and the probability distribution between topics and words comprises: segmenting, by a master calculation apparatus, a document set into a plurality of document subsets, and setting the initial first hyperparameter, the initial second hyperparameter, the initial number of topics, the preset initial global count matrix of documents and topics, and the preset initial global count matrix of topics and words; sending, by the master calculation apparatus, each document subset of the plurality of document subsets, the initial first hyperparameter, the initial second hyperparameter, the initial number of topics, the preset initial global count matrix of documents and topics, and the preset initial global count matrix of topics and words to each slave calculation apparatus of a plurality of slave calculation apparatuses correspondingly such that each slave calculation apparatus of the plurality of slave calculation apparatuses solves the Latent Dirichlet Allocation model and updates a local count matrix of documents and topics and a local count matrix of topics and words according to a received preset initial global count matrix of documents and topics, a received initial global count matrix of topics and words, the received initial first hyperparameter, the received initial second hyperparameter, and the received initial number of topics; receiving, by the master calculation apparatus, the local count matrix of documents and topics and the local count matrix of topics and words that are returned by each slave calculation apparatus, and performing merging to obtain a global count matrix of documents and topics and a global count matrix of topics and words; determining, by the master calculation apparatus, whether a process of solving, by each slave calculation apparatus, the Latent Dirichlet Allocation model and updating the local count matrix of documents and topics and the local count matrix of topics and words converges, and when the process of solving the Latent Dirichlet Allocation model and updating the local count matrix of documents and topics and the local count matrix of topics and words does not converge, sending the global count matrix of documents and topics and the global count matrix of topics and words to each slave calculation apparatus correspondingly for calculation, and continuing to update the local count matrix of documents and topics and the local count matrix of topics and words until the process of solving the Latent Dirichlet Allocation model and updating the local count matrix of documents and topics and the local count matrix of topics and words converges, and outputting the global count matrix of documents and topics and the global count matrix of topics and words that are eventually obtained; and calculating, by the master calculation apparatus, the probability distribution between documents and topics and the probability distribution between topics and words according to the global count matrix of documents and topics and the global count matrix of topics and words.

7676004

11534201

1. A combinational fuzzy-decision Viterbi decoder, comprising: a parallel to serial (P/S) converter, for converting parallelly transmitted signals into serially transmitted signals; a fuzzy decision constellation decoder, for estimating a received signal based on a combination of modified Π and S-membership functions; and a Viterbi decoder, using the estimation based on the combination of modified Π and S-membership functions as the input thereof to calculate analog path metrics while each path metric being calculated by weighting the square Hamming distance between zero and one and thus ranged between zero and one; wherein, a minimal path metric is acquired by using the traceback through the trellis and thus transmitted message bits are determined.

9628477

14581659

1. A computing device comprising: one or more processors; a memory coupled with the one or more processors; a login module operated by the one or more processors to authenticate a first user of the device and establish a first access control state corresponding to a first user profile associated with the first user and to authenticate a second user of the device and establish a second access control state corresponding to a second user profile associated with the second user; a contextual authentication module operated by the one or more processors to select between the first and second user profiles based at least in part on a changed user characteristic; a presentation module operated by the one or more processors to present a resource based at least in part on the second user profile; and a motion sensor, wherein the contextual authentication module comprises a profile selection module operated by the one or more processors to select between the first and second user profiles based at least in part on an output of the motion sensor and previously stored first and second templates generated by a machine learning classifier in association with the respective first and second users, and the profile selection module comprises a biometric machine learning classifier, wherein the profile selection module is to perform a biometric information classification of the output of the motion sensor and select between the first and second user profiles based at least in part on the biometric information classification and the previously stored first and second templates.

6101626

09018678

1. A method for choosing the coding schemes, mappings and puncturing rates for a modulation/encoding system including the steps of: finding a code generator matrix such that the system is invariant to a certain transformation by which an invariancy may be created, wherein said finding step includes the steps of: choosing a coding scheme and a puncturing rate, determining a code generator matrix using said coding scheme and said puncturing rate, checking if said code generator matrix satisfies both of two invariancy equations, wherein said two invariancy equations are T.sub.u G=G' and u.sub.e G=e, wherein T.sub.u =G T G.sub.R.sup.-1, u.sub.e =e G.sub.R.sup.-1, G'=GT, e is a constant, and G.sub.R.sup.-1 is the right free inverse of G, and repeating said choosing and determining steps until said code generator matrix satisfies said both of two invariancy equations; and choosing a mapping scheme that can advantageously use said invariancy.

20160026247

14878540

1. A computer-based engineering knowledge acquisition system, comprising: a digital processor supporting a user-interactive training material associated with a respective domain that includes at least one diagram; a display monitor coupled to the processor and rendering to an acquirer-user at least one screen view of the user-interactive training material, the at least one screen view having any of text and graphics in a certain locational arrangement relative to graphical content; and an eye-tracking member coupled to the processor, the eye-tracking member (i) tracking eye movement of the acquirer-user viewing the at least one screen view, and (ii) detecting eye traces of the acquirer-user for the at least one screen view; in response to the detected eye traces, the processor generating a summary of knowledge acquisition patterns of the acquirer-user and assessing whether the acquirer-user has missed viewing one or more regions of the at least one diagram; and a rules engine coupled to the processor, the rules engine performing an evaluation of the acquirer-user's viewing of the at least one screen view based upon the detected eye traces and the generated summary of knowledge acquisition patterns, and the rules engine providing one or more metrics as real-time feedback to a user.

10083108

15980438

1. A method for automatically crawling an application, comprising: navigating to an application interface using an application crawler and a sequence of commands; analyzing the application interface to find a set of user interface elements on the application interface; determining a set of commands that will interact with the user interface elements on the application interface; pushing each command in the set of commands onto a stack, individually, whereby each command is individually stored in the stack along with the sequence of commands; popping a new sequence of commands from the stack, wherein the new sequence of commands is: a command in the set of commands in sequence with the sequence of commands; and repeating the navigating, analyzing, determining, and pushing steps with: (i) the new sequence of commands replacing the sequence of commands; (ii) a new application interface replacing the application interface; (iii) a new set of user interface elements replacing the set of user interface elements; and (iv) a new set of commands replacing the set of commands.

20130148880

13315066

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

8417497

12354548

1. A method, executed by a computer, of updating a model of a subterranean structure, comprising: computing a partial decomposition of an operator that is used to compute a parameterization representing an update of the model, wherein the partial decomposition of the operator is selected from the group consisting of a partial singular value decomposition of the operator, and a partial eigendecomposition of a Fisher information operator; combining a term based on additional information with the partial decomposition of the operator to derive the update of the model.

7784013

11619587

1. A method of designing an integrated circuit comprising the steps of: providing a logic cell library to a synthesis tool, the cell library including a set of 40 or less complex and simple logic functions, the set of complex functions including a plurality of non-standard complex Boolean logic functions that are determined to collectively provide for logic minimization; providing a high-level representation of the integrated circuit to the synthesis tool, the high-level representation including circuit representations of Boolean logic functions; using the synthesis tool to translate the high level representation of the integrated circuit into the logic representation, wherein the logic representation is completely defined using the set of complex functions and the set of simple logic functions, and wherein a logic portion of the integrated circuit is substantially defined using the set of complex functions.

20080228325

11717525

1. A method of forecasting utility demand of a utility consuming entity for a future time period, the method comprising: selecting a utility demand matrix from a set of utility demand matrixes as a function of a future date, wherein the set of utility demand matrixes are classified by type-of-day, and representing a relation of past utility demand of the entity to time-in-day and outdoor temperature in the vicinity of the entity during the type-of-day; identifying a utility demand element from the utility demand matrix as a function of a future time-in-day interval and a known factor thereof; and generating a utility demand forecast of the entity for the future time period as a function of the identified utility demand element.

20110307112

12815886

1. A goal-based lighting controller, the goal-based lighting controller comprising: a network interface; a lighting system model of a lighting system; a goal module configured to receive a plurality of management goals for operation of the lighting system, the management goals being without light level settings for a plurality of light fixtures included in the lighting system; a demand model configured to convert the management goals into a power level for each respective one of the light fixtures, wherein the demand model determines a modeled operation of each respective one the light fixtures at the power level meets the management goals based on the lighting system model of the lighting system; and a hardware interface module in communication with the network interface, wherein the hardware interface module is configured to cause each respective one of the light fixtures to operate at the power level.

20120028268

13142598

1. A device comprising: a. at least one protein-binding agent which specifically binds to at least one appendicitis biomarker protein selected from the group of: leucine α-2 glycoprotein (LRG), mannan-binding lectin serine protease 2 (MASP2), α-1-acid glycoprotein 1 (ORM); and b. at least one solid support for the at least one protein binding-agent in (a), wherein the protein-binding agent is deposited on the solid support.

20140163966

14092518

1. A device, comprising: one or more processors to: obtain text of a document to be analyzed to identify glossary terms included in the text; perform a linguistic unit analysis on a linguistic unit, included in the text, to generate a plurality of ambiguous linguistic units from the linguistic unit; resolve the plurality of ambiguous linguistic units to generate a set of potential glossary terms that includes a subset of the plurality of ambiguous linguistic units; perform a glossary term analysis on the set of potential glossary terms to generate a set of glossary terms that includes a subset of the set of potential glossary terms; identify a set of included terms, of the set of potential glossary terms, that are included in the set of glossary terms; identify a set of excluded terms, of the set of potential glossary terms, that are excluded from the set of glossary terms; determine a semantic relatedness score between at least one excluded term, of the set of excluded terms, and at least one included term, of the set of included terms; selectively add the excluded linguistic term to the set of glossary terms to form a final set of glossary terms based on the semantic relatedness score; and output the final set of glossary terms for the document.

9367606

13474628

1. A method of presenting documents to a user, comprising: a. assigning relevance scores to a plurality of the documents, by a computer programmed to compute relevance scores based on a relevance model using one or more user input events, wherein at least one of the one or more user input events is an active selection of a user input feature about at least one document and is received outside a context of a presentation of search results of a search, the one or more user input events comprising input about the at least one document from at least one user; and b. presenting the documents to the user according to the relevance scores.

20030110162

09683274

1. A light weight subject indexing system, comprising: a candidate headword identification system for identifying candidate words in the subject line of a document which are not listed in a user modified common word list; a lexical context system for creating a lexical context for an identified candidate headword; a ranking system for ranking the set of identified candidate headwords for a collection of documents and selecting among them for inclusion in an index; and an index creation system for listing selected candidate headwords based on the results of ranking and selection.

7996198

11279839

1. A method of modeling one or more reservoirs using one or more well logs, each for a well at a location and each including one or more Relative amount of Small Size Range of the Size Spectrum of Clastic Particles (RSSRSS) values versus depth, the method including: for one or more well logs: identifying one or more facies units based on RSSRSS values; determining a thickness of one or more facies units; and determining a facies type of one or more facies units; categorizing one or more facies units; and connecting one or more facies units to create a reservoir model.

9984772

15455591

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

9576031

15018016

1. A method, comprising: determining, by a computer processor, a plurality of features associated with a dataset, wherein the plurality of features comprises a plurality of non-redundant features including a first feature and a second feature; determining, by the computer processor, a plurality of feature subspaces comprising a first feature subspace and a second feature subspace, wherein each feature subspace comprises a respective at least one feature from the plurality of features, and wherein determining the plurality of feature subspaces comprises: determining, by the computer processor, a first relevance metric for the first feature; determining, by the computer processor, a second relevance metric for the second feature; determining, by the computer processor, that the first relevance metric is greater than the second relevance metric; assigning, by the computer processor, a first rank to the first feature and a second rank to the second feature, wherein the first rank and the second rank together indicate that the first feature has greater relevance to the dataset than the second feature; determining, by the computer processor, that the first feature subspace includes only the first feature; and determining, by the computer processor, that the second feature subspace includes the first feature and the second feature; the method further comprising: determining, by the computer processor, a set of one or more candidate exploratory actions, wherein each candidate exploratory action comprises a respective feature subspace and a respective instance of a respective outlier detection algorithm; determining, by the computer processor, an optimal subset of one or more exploratory actions from among the set of one or more candidate exploratory actions; executing, by the computer processor, at least one exploratory action in the optimal subset to obtain outlier data; processing, by the computer processor, the outlier data to obtain one or more outlier views; and presenting, by the computer processor, the one or more outlier views via one or more user interfaces.

20160109868

14516331

1. A load driver circuit for driving a load comprising: a power supply circuit operably coupled to the load and configured to provide a load current operably passing through the load in accordance with at least one control signal; a measurement circuit coupled to the power supply circuit or the load and configured to measure, during operation of the load, at least one operation parameter of the load; and a signal processing circuit that receives the at least one operation parameter measured by the measurement circuit and configured to estimate, based on the at least one operation parameter and a parametric model that characterizes the load, one or more model parameters of the model.

7519582

11151056

1. A computer implemented method of performing a high-level multi-dimensional external fuzzy query on a multi-structural database, comprising: receiving a set of objects and a set of dimensions, said set of dimensions being selected as at least one of the group consisting of: time, content type, geography, and topic; formalizing each of said dimensions as a lattice, each lattice including a union of elements in said latticed dimensions and an intersection of elements in said latticed dimensions, wherein each said lattice corresponds to one of a single one of said dimensions or a plurality of said dimensions; defining a position of each object within each dimension; annotating said object with tokens corresponding to the position of the object in each dimension; receiving the external fuzzy query that includes a subset of the objects, a subset of the dimensions, a value limiting a number of returned collections, and a quality function for evaluating a quality of any candidate non-overlapping collection from all candidate non-overlapping collections having a size that is less than or equal to the limiting value; selecting an algorithm based on said external fuzzy query, said algorithm being selected from the group consisting of: discovery, max-monotone and sum-additive; determining an order of processing said dimensions within a subset of said dimensions; applying said selected algorithm to each of said dimensions in the order of processing of said dimensions; returning a non-overlapping collection from the candidate non-overlapping collections using a complex query algorithm, wherein the quality of the returned non-overlapping collection as defined by the quality function is at least as great as the quality of any other candidate non-overlapping collection, wherein said multi-structural database includes only semi-structured or unstructured data.

9111217

12860590

1. A computerized method of analyzing a plurality of hypotheses based on evidence and analyzing diagnostic strength of evidence, comprising: receiving, by a computing device, one or more a plurality of hypotheses and one or more pieces of evidence; determining, by the computing device, whether the one or more plurality of hypotheses are competing or non-competing based on the one or more pieces of evidence, where the one or more pieces of evidence has a corresponding source; if the plurality of hypotheses are competing: receiving by the computing device, an evidence confirmation value for each of the plurality of hypotheses for each of the one or more pieces of evidence, determining, by the computing device, an evidence contribution value of each of the one or more pieces of evidence to confirming or disconfirming each of the one or more plurality of hypotheses, each contribution value is based on all of the evidence confirmation values, determining, by the computing device, a diversification index based on all of the evidence confirmation values and the contribution values, the diversification index is a measure of a degree of distinction in each of the one or more pieces of evidence, determining, by a computing device, a diagnostic strength value for each of the one or more pieces of evidence based on the contribution value, determining, by a computing device, a diagnostic strength value for each of the one or more pieces of evidence based on the contribution value, and graphically displaying, by the computing device, for each diagnostic strength value on a display device; and if the plurality of hypotheses are non-competing: receiving, by a computing device, for each of the one or more pieces of evidence corresponding to the plurality of hypotheses that are non-competing, an evidence credibility score that is determined independent of a reliability of the corresponding source to produce consistent results, and an evidence reliability score that is determined based upon the reliability of the corresponding source to produce consistent results, determining, by a computing device, a veracity score for each of the one or more pieces of evidence corresponding to the plurality of hypotheses that are non-competing based on the evidence credibility and reliability scores, and graphically displaying, by the computing device, at least one piece of evidence from the one or more pieces of evidence, at least one hypothesis from the plurality of hypotheses, and a link between the at least of piece of evidence and the at least one hypotheses, the link showing a corresponding determined veracity score on each diagnostic strength value to a display device.

8307245

12791265

1. A scenario creating apparatus which creates a scenario for verifying operation of an information processing system in which a plurality of servers including a database server are coupled, comprising a processor to execute a process including: collecting messages transmitted and received between the plurality of servers, when operation of the information processing system is being verified by a terminal apparatus that performs verification of operation; associating the collected messages with each other; sorting work models in ascending order of time at which access is made to the database server, the work models each being a group of the associated messages; and creating the scenario based on the sorted work models.

20140085480

14095997

1. A method of reducing video communication bandwidth requirements of a video surveillance network camera system that includes network communication paths between network video cameras producing video streams of scenes observed by the network video cameras and content-aware computer networking devices analyzing by video analytics video visual content of the video streams to provide managed video representing, at specified quality levels, samples of the scenes observed, the method comprising: associating with one or more of the network video cameras a content-aware computer networking device including video analytics, the content-aware computer networking device capable of preparing and distributing managed video based on video visual content produced from an associated network video camera video stream; receiving at the content-aware computer networking device the video visual content and configuration information, the configuration information defining an event of interest in a scene observed by the associated network video camera video stream such that the event of interest is depicted in the video visual content, the configuration information configuring the content-aware computer networking device to prepare and distribute the managed video in response to the video analytics detecting the event of interest; analyzing the video visual content by the video analytics to generate semantic descriptions of object characteristics and actions recognized from the visual video visual content; identifying the event of interest based at least in part on the semantic descriptions to prepare the managed video corresponding to the event of interest, the managed video representing, at a specified quality level, a sample of the scene observed by the associated network video camera video stream; storing the managed video in a local mass storage device that is contained in or connected to a housing of the content-aware computer networking device; and distributing the managed video through at least one of the network communication paths such that distribution of the managed video consumes substantially less network bandwidth than would be consumed by delivery through the at least one of the network communication paths of the associated network video camera video stream at the specified quality level in the absence of analysis by the video analytics.

20140019490

13549112

1. A method of event processing for graph structured data, comprising: storing graph-structured data in a store, the graph-structured data including a plurality of vertex, edge, and/or property graph elements; defining a first graph view of a characteristic of vertex, edge, and/or property graph elements; determining a subgraph as a subset of the plurality of vertex, edge, and/or property graph elements that have the characteristic of vertex, edge, and/or property graph elements defined by the first graph view; and processing the vertex, edge, and/or property graph elements of the subgraph responsive to a predefined event that occurs on at least one of the vertex, edge, and/or property graph elements of the subgraph.

8645250

13597930

1. A method of automatic fraud detection, the method comprising: obtaining, by a processor, transaction data from a plurality of transactions; segmenting, by the processor, the transaction data based on at least one attribute defined by a user; identifying, by the processor, one or more key indicators corresponding to the segmented transaction data; determining, by the processor, a correlation between the one or more key indicators and the at least one attribute defined by the user; and generating, by the processor, one or more suggested transaction rules based on the correlation.

6026399

08866314

1. A method for determining important attributes for discriminating between different values of a label attribute, the method comprising the steps of: receiving a set of records, each record having a plurality of attributes; permitting a user to choose the label attribute; permitting a user to choose at least one first attribute that is considered important; generating at least one second important attribute, said generated at least one second important attribute together with the said chosen at least one first important attribute discriminate well between the different values of the label attribute; generating non-cumulative purity for each of said chosen at least one first important attribute and each of said generated at least one second important attribute, said non-cumulative purity indicating how well each first and second important attribute individually discriminates between different values of the label attribute; and generating cumulative purity for each of said chosen at least one first important attribute and each of said generated at least one second important attribute, said cumulative purity indicating how well a respective important attribute in combination with other first and second important attributes discriminates between different values of the label attribute.

20090217182

12038658

1. A product comprising: a memory; a reference graphical user interface (GUI) type model stored in the memory; and GUI element typing logic stored in the memory and comprising: element selection logic operable to obtain a GUI element selection specifying a selected GUI element in a GUI. type retrieval logic operable to retrieve, from the reference GUI type model, a GUI element type selection list of available GUI element types; type selection logic operable to obtain a GUI element type selection specifying a selected GUI element type from the GUI element type selection list of available GUI element types; and type association logic operable to create a GUI element type mapping that links the selected GUI element type to the selected GUI element in the GUI.

20090158245

11958660

1. A UML design system for creating a UML model of a user interface environment, comprising: a system for defining use cases within the UML model; a system for associating an affinity representing a user-perceived relationship between use cases within the UML model; and a system for assigning a weight to the affinity within the UML model.

20130011070

13542326

1. A computer-based method of inferring and utilizing the aesthetic quality of photographs and other images, comprising the steps of: receiving a plurality of digitized images along with aesthetic-based ratings of the images provided by viewers of the images; performing one or more software operations on the digitized images to automatically extract a plurality of visual features representative of each image; and using one or more statistical methods to correlate the extracted visual features and the aesthetic-based viewer ratings to classify image on the basis of its aesthetic value, rate image on a scale relating to its aesthetics value, or select/eliminate image based upon aesthetic quality.

20120311708

13151173

1. A system for detecting malicious processes, the system comprising a processor running a plurality of processes, the processor configured to, for each process: collect a plurality of features of the process; apply a plurality of classification rules to the plurality of features to produce a plurality of weighted threat scores, wherein each of the plurality of classification rules corresponds to a one or more of a plurality of process categories; compare the plurality of weighted threat scores to a plurality of threshold values, wherein each of the plurality of threshold values corresponds to one of the plurality of process categories; and classify the process in the one or more process categories based at least on the comparison of the plurality of weighted threat scores to the plurality of predetermined thresholds.

9622450

15071695

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

8165946

13191390

1. A method, comprising: determining, by a computer for calculating a merchant transaction fee and based upon custom transaction fee rules, that a summary of charges (SOC) provides insufficient detail to determine the merchant transaction fee based on the SOC; in response to the determining that the SOC provides insufficient detail, determining first data by at least one of: acquiring, by the computer, a customer identifier (ID) from a transaction account database using a transaction account identifier (TXA-ID); correlating, by the computer, the customer ID with at least one of a customer profile, a customer type, a customer transaction history, and a customer location to determine a customer factor, wherein the first data comprises the customer factor; acquiring, by the computer, a merchant profile based upon a merchant identifier (ID) from a merchant database; correlating, by the computer, the merchant profile with at least one of a merchant type, a merchant transaction history and a merchant location, to determine a merchant factor, wherein the first data comprises the merchant factor; acquiring, by the computer, product data associated with a product ID from a product database; correlating, by the computer, the product data with at least one of a product type, a product transaction history, a product-customer demographic and a product price, to determine a product factor, wherein the first data comprises the product factor; and calculating, by the computer and in response to the determining the first data, the merchant transaction fee according to the custom transaction fee rules using first receipt of charge (ROC) data, the SOC and the first data, wherein the ROC data is obtained from a ROC database.

20080065573

11850437

1. A method of solving a discrete optimization problem using an analog optimization device, the method comprising: receiving an objective function and at least one constraint corresponding to the discrete optimization problem; converting the objective function into a first set of inputs for the analog optimization device; converting the at least one constraint into a second set of inputs for the analog optimization device; generating a third set of inputs wherein the thirds set of inputs is at least indicative of at least one penalty coefficient; processing the first set of inputs, the second set of inputs and the third set of inputs with the analog optimization device; and reading out a final state of the analog optimization device wherein at least a portion of a solution to the discrete optimization problem corresponds to the final state of the analog optimization device.

9633151

14675699

1. A computer implemented method for verifying an electronic design with clock domain crossing paths, comprising: executing a process with at least one micro-processor of a computing system, the process comprising: identifying, at a clock domain crossing (CDC) identification module including or coupled with a design traversal module and at least one micro-processor of a computing system, a first electronic design component for verification of the electronic design at least by traversing at least a portion of the electronic design; generating a representation of the electronic design at least by interconnecting one or more duplicated electronic design components, which are duplicated from one or more corresponding electronic design components in the electronic design, with the first electronic design component; injecting one or more CDC effect models into the presentation at least by reducing a set of injection candidates into a reduced set of injection candidates with an application of one or more CDC rules and by adding the one or more CDC effect models along one or more paths associated with the reduced set of injection candidates in the representation of the electronic design; and generating proof results at least via proving or disproving one or more checkers for the electronic design by verifying or simulating the representation with the one or more CDC effect models.