Datasets:

patent

/

AIPD_evo_claim_one

like 0

20110179393

12688278

1. A method for calibrating a photolithography process model for modeling a photolithography process, wherein the photolithography process is followed by an etch process, the method comprising: constructing an etch bias model which models a critical dimension (CD) difference between a measured CD value of a feature after the photolithography process and a measured CD value of the feature after the etch process; receiving measured CD data for a layout which is measured after the photolithography process; and fitting the photolithography process model based at least on the measured CD data and the etch bias model, thereby causing the photolithography process model to be aware of etch effects.

9584756

14328121

1. A method for determining displacement by motion for a sequence of images, the method comprising: receiving an input image sequence comprising a plurality of image frames individually including multidimensional image data corresponding to a plurality of pixel locations at different times; providing a fully constrained nonlinear equation set including: a plurality of displacement vector invariant equations, a forward displaced frame difference equation using as input data from only two of the image frames at one time t.sub. 1 and an other time t.sub. 2 , respectively, and a backward displaced frame difference equation using as input data from only the same two image frames; using at least one processor, solving the equation set using an iteration equation and the image data of only the two image frames at times t.sub. 1 and t.sub. 2 to determine a displacement field describing the displacement vectors at pixel locations at the one time by solving displacement field values at the other time from the plurality of displacement vector invariant equation; and determining, using the at least one processor, displacement by motion for the sequence of images based on the solved equation set.

7941334

09974377

1. A method for aggregating demand from multiple demand calculation systems running independently, said method comprising: receiving, by a merging unit, parts demand data output from at least two independent demand calculation systems for at least two divisions of an organization, wherein said independent demand calculation systems comprise automated materials requirements planning-(MRP) systems, and wherein feeding of said parts demand data from said independent demand calculation systems to said merging unit is automatically triggered by running of said independent demand calculation systems such that the most current parts demand data is received; aggregating said parts demand data from said at least two independent demand calculation systems to produce an overall demand data for parts needed by said organization; and storing said overall demand data in an information warehouse in a common format.

7991718

11770541

1. A system that facilitates generating an inference about a destination of a current trip, comprising: a component that makes a log of information about trips, the log comprising previously observed locations that were destinations of the trips; and a modeling component, comprising at least one processor, that generates predictions of a destination of the current trip based at least in part upon a combination, the combination being a combination of outputs of: an open-world submodeling component that provides probabilities, based on the log of locations, that locations that are not in the log are the destination of the current trip; and a closed-world submodeling component that provides probabilities that locations in the log are the destination of the current trip, the closed-world submodeling component inferring the probabilities based on information in the log that indicates probabilities that previously observed locations will recur as a destination of a trip, wherein the modeling component generates a prediction of the destination of the current trip by combining, for each of a plurality of locations, a probability provided by the open-world submodeling component and a probability provided by the closed-world submodeling component.

20030093257

10010572

1. A distributed simulation system comprising a plurality of nodes, wherein each node of the plurality of nodes is configured to simulate a different portion of a system under test using a simulator program configured to perform a simulation as a series of timesteps, and wherein each timestep includes at least a first phase and a second phase, and wherein each node of the plurality of nodes is configured not to cause the simulator program to evaluate a model of the different portion of the system under test during the first phase even if one or more commands are received by that node during the first phase, and wherein each node of the plurality of nodes is configured to cause the simulator program to evaluate the model during the second phase in response to receiving a command including one or more signal values for signals of the model.

20070100586

11584038

1. A method of testing an electronic circuit comprising: receiving a signature from a time compactor associated with the circuit design; determining a list of initial candidate fault locations using one or more error functions associated with the time compactor, the error functions being indicative of scan cells in the circuit that at least partially contribute to the value of one or more failing compactor bits in the signature; and storing the list of initial candidate fault locations on one or more computer-readable media.

20160132505

14693529

1. A method for ranking search results received from a plurality of distinct search resources, the method comprising: receiving from each of a plurality of search resources, a set of ranked search results, wherein each search result identifies an item and wherein each search result includes metadata characterizing the item; determining, by a computer processor, a unified ranking for the search results, wherein the unified ranking maintains a relative ranking of each set of results as received from the plurality of search resources, wherein a ranking of a first result in the unified ranking is determined based on metadata of the first result and metadata of each second result having a lower rank than the first result in the associated set of results; and ordering the search results by the determined unified ranking.

8983940

13552596

1. A method for object retrieval and localization, comprising: performing, by one or more computing devices: obtaining an initial ranking of a collection of a plurality of images, with regard to a query object included in a query image, the initial ranking based on a similarity score for each of the images of the collection to the query object, the similarity score determined using a spatially-constrained similarity measure; generating a ranking of the collection with regard to each of one or more nearest neighbors to the query object as indicated by the initial ranking of the collection, said generating the ranking comprising: for each of the one or more nearest neighbors, searching the collection according to a localized object of the respective nearest neighbor to determine the similarity scores for the collection, the localized object being a best match object of the respective nearest neighbor to the query object in the query image; ranking the collection according to the similarity scores; and generating a new ranking of the collection with regard to the query object according to the initial ranking and the generated rankings with regard to each of the one or more nearest neighbors.

8583576

13482196

1. A computer-implemented method comprising: obtaining a plurality of model representations of predictive models, wherein each model representation is associated with a respective user and expresses a respective predictive model; and selecting a model implementation for each of the model representations, each model implementation comprising one or more computer programs operable to be executed on one or more computing devices, each model implementation being selected for a corresponding model representation based on one or more system usage properties associated with the user associated with the corresponding model representation, wherein the one or more system usage properties comprise one or more of the following: (i) an amount of system resources that the user has consumed over a given period of time, (ii) a time of day during which system resources were previously used by the user, or (iii) an amount of money that was previously paid by the user for the system resources.

8843427

13195349

1. A computer-implemented method, the method comprising: receiving a training data set that comprises a plurality of examples, wherein each example comprises one or more features and an answer; generating a plurality of modified training data sets, wherein generating each of the modified training data sets comprises applying a respective filter or combination of filters to examples in the training data set to generate the examples of the modified training data set, the filter or combination of filters altering one or more of the examples; training a plurality of predictive models, including training each of one or more predictive models using a different respective modified training data set of the plurality of modified training data sets; determining a respective accuracy for each of the plurality of predictive models; identifying a most accurate predictive model based on the determined respective accuracies; and specifying an association between the training data set and the filter or combination of filters used to generate the modified training data set that was used to train the most accurate predictive model.

9280784

14604338

1. A method for measuring engagement comprising: presenting a first set of stimuli to a first subset of a first set of subjects in a first environment; capturing neural data from the first set of subjects; capturing environmental data from the first environment; wherein environmental data comprises at least one of ambient temperature data and ambient lighting data; presenting the first set of stimuli to a second subset of the first set of subjects in a second environment; capturing environmental data from the second environment; wherein environmental data comprises at least one of ambient temperature data and ambient lighting data; calculating a first set of neural similarities between each possible pairing of subjects of the first set of subjects; and generating a first measure of engagement from the first set of neural similarities; wherein generating the first measure of engagement comprises weighting neural similarities of the first set of neural similarities according to captured environmental data.

10037691

15475954

1. A method implemented by an information handling system that includes a memory and a processor, the method comprising: forming an infraction detection zone in response to detecting a traffic infraction of a driver driving a vehicle, wherein the infraction detection zone comprises a set of traffic control devices and wherein a location of the traffic infraction is at an infraction area; sending a set of configuration parameters to the set of traffic control devices that comprise vehicle identification data; identifying, based on the vehicle identification data, one or more driving behaviors of the driver through the infraction detection zone; determining an amount of historical traffic infractions from a plurality of different drivers at the infraction area; in response to determining that the amount of historical traffic infractions does not exceed a threshold, issuing a citation based on analyzing the one or more driving behaviors; and in response to determining that the amount of historical traffic infractions exceeds the threshold, suppressing the citation and recording the traffic infraction of the driver.

20100312546

12477918

1. A computer-implemented recognition system, comprising: a constraints component of context-specific constraints for recognition processing of an input into recognition results; and a reconciliation component for reconciling the recognition results into a single recognition result.

9835541

15458827

1. A method of distinguishing particles having similar characteristics, comprising: establishing a fluid stream; entraining particles in the fluid stream, each individual particle belonging to one of at least two populations; detecting a plurality of signals affiliated with individual particles in the fluid stream, the signals comprising signal data; converting the signal data from the signals into n-dimensional parameter data, the n-dimensions including individual dimensions corresponding to respective signals in the plurality of signals, wherein the at least two populations of the individual particles overlap in one of the n-dimensions; mathematically altering the n-dimensional parameter data by at least rotating the n-dimensional parameter data to increase spatial separation in the dimension having the overlap; and real-time classifying the n-dimensional parameter data of each of the individual particles with the rotated n-dimensional parameter data; and discriminating between the individual particles based upon the step of real-time classifying.

8386285

13115748

1. A computer-implemented method for demand modeling and prediction for a set of products in a retail category, the method comprising: obtaining aggregated sales data in a retail category, said aggregated sales data comprising a combination of: a first sales data set having a time series of unit-prices and unit sales for a set of designated products in a product set from said retail category, said time series data being provided over a sequence of sales reporting periods from one or more retail stores; and, a second sales data set including data associated with attributes of a product in said first sales data set; generating a model for price movements and price dynamics from said time series data of unit-prices in the aggregated sales data; generating a model for market share of each said product in the retail category using the aggregated sales data and said integrated additional product attribute data; generating a model for an overall market demand in the retail category from the aggregated sales data; and, obtaining a predicted demand for one or more said products in the designated product set in retail category by combining the models for said price movements and price dynamics, said market share, and said overall market demand, wherein a programmed processor device performs said obtaining, said generating a price movement model, said generating a market share model, said generated overall market demand and said combining.

8352405

13091405

1. A non-transitory computer readable medium carrying instructions for a sentiment classifier for sentiment classification of content comprising: an aspect classifier configured to classify content as being related to a particular aspect of a plurality of aspects of information, the aspect classifier incorporating at least a portion of a domain specific sentiment lexicon to assist in classifying the content, wherein the domain specific sentiment lexicon is configured by: (i) domain specific words and/or phrases from an annotated corpus which has been filtered, (ii) domain specific words and/or phrases obtained via a search of the world wide web using a predetermined linguistic pattern and filtering the returned search results, and (iii) domain specific words and/or phrases obtained via a dictionary expansion technique performed on the domain specific words and/or phrases obtained by at least one of (i) or (ii); a polarity classifier configured to classify the content classified by the aspect classifier as having one of a positive sentiment of the particular aspect of information, a negative sentiment of the particular aspect of information or as having no sentiment of the particular aspect of information, the polarity classifier incorporating at least a portion of the domain specific sentiment lexicon to assist in classifying the content; and an aggregator configured to receive and aggregate results of predictions generated by the aspect classifier and results of predictions generated by the polarity classifier.

8543985

12753291

1. A method for model checking of concurrent multi-threaded programs with bounded lock chains, comprising: analyzing individual program threads in a concurrent multi-threaded program, using a model checking program stored in a memory storage device, to determine sets of reachable states and lock access patterns for bounded lock chains by: tracking sets of states reachable from a given set of states; and tracking lock acquisitions and releases by maintaining a bi-directional lock causality graph; using an acceptance condition of the lock causality graph to combine analysis results from multiple threads to determine whether there is a violation of a correctness property in the concurrent multi-threaded program; reducing a reachability problem by taking a specialized cross product that removes pairs that are not reachable; and keeping projection automata separate to circumvent a state explosion problem and avoid construction of a global automata.

4194890

05874167

1. In a pressure swing process for fractionating at least one component from a gaseous mixture by selective adsorption in each of at least two adsorption zones by sequentially passing the gaseous mixture from a feed stream through a first adsorption zone until the first zone is about saturated while simultaneously purging and then pressurizing a second adsorption zone and then passing the gaseous mixture from the feed stream through the second adsorption zone until the second zone is about saturated while simultaneously purging and then pressurizing the first adsorption zone, the improvement comprising withdrawing gas from one of said adsorption zones at the end of the adsorption operation therein in a direction countercurrent to feed flow and directly introducing the withdrawn gas along with the gaseous mixture from the feed stream into the other of said adsorption zones in a direction cocurrent with feed flow and after pressurization thereof to equalize the pressures in said adsorption zones from the feed ends thereof.

9534993

13882891

1. A method for estimating an unknown load acting on an aircraft structure, comprising: providing an aircraft structure having a plurality of accelerometers mounted thereto, a processor receiving a signal from each of the accelerometers, and a graphical user interface; measuring with the processor a plurality of accelerometer responses of the aircraft structure to the unknown load; calculating with the processor a plurality of hypothetical loads each associated with a different one of the plurality of accelerometer responses; calculating with the processor an entropy associated with each of the hypothetical loads and determining the location on the aircraft structure of the hypothetical load having the lowest entropy; and identifying the location on the graphical user interface.

20050185729

10818536

1. A processing system for digitally modulated information having a plurality of received signals, said system comprising: a multiuser detector coupled to said received signals, wherein said multiuser detector produces a set of reliability measures for said received signals; at least two decoder banks coupled to said multiuser detector, wherein said decoder banks produce a set of conditional probabilities and a set of bit estimates; at least two recoder banks coupled to said decoder banks, wherein said recoder banks produce a set of recoded estimates; and a compare and adjust unit coupled to said multiuser detector, said decoder banks and said recoder banks, wherein said compare and adjust unit compares said recoded estimates and said conditional probabilities and produces a set of adjusted estimates.

9298489

14105982

1. A computer system containing at least one processor for monitoring one or more virtual machines in a cloud computing environment, the computer system comprising: a baseline module of a virtual machine executing on a host computer, the baseline module configured to: 1) monitor performance of software of the virtual machine executing on the host computer to collect software information, 2) monitor performance of hardware components of the host computer to collect hardware information, and 3) create a plurality of machine readable baseline files based on the collected software information and hardware information; and a benchmark module, executing on a storage and processing computer separate from the host computer, the benchmark module configured to: 1) comparatively analyze at least two of the plurality of machine readable baseline files to determine differences in the software information between the at least two machine readable baseline files, 2) determine differences in the hardware information between the at least two machine readable baseline files, and 3) generate a plurality of benchmark reports based on the determined differences; a trends module, executing on the storage and processing computer separate from the host computer, the trends module configured to: 1) comparatively analyze the plurality of benchmark reports by performing a statistical analysis of the differences in software information and the differences in hardware information over a period of time, and 2) generate at least one user readable trends report based on the comparative analysis of benchmark reports; and a user actions module, the user actions module configured to provide at least one of the plurality of benchmark reports to a user and to display a dynamic input form to the user when the provided at least one benchmark report indicates at least one threat to the cloud computing environment, wherein the dynamic input form enables the user to address the at least one threat.

9222070

11782264

1. A method for producing activated CD8+ T cells specific to one or more melanoma antigens for administration to a subject, comprising: a. harvesting CD8+ T cells and CD8-depeleted mononuclear cells from the subject; b. culturing said CD8+ T cells with a non-naturally occurring antigen-presenting cell line (nnAPC) presenting one or more melanoma antigenic peptides for a period of time sufficient for activation of CD8+ T cells that are specific for the melanoma antigenic peptides, wherein the melanoma antigenic peptides have the amino acid sequences of peptide fragments of one or more melanoma-associated antigens; wherein at least one of the melanoma-associated antigens is selected from the group consisting of tvrosinase, gp100, and MART-1, and wherein said melanoma antigenic peptides are each about six to twelve amino acids in length; c. adding said CD8+ T cells to media that contains at least one cytokine selected from the group consisting of IL-2, IL-7 or conditioned growth medium (CGM), wherein said cytokines can be used individually or in combination to expand the CD8+ T cells; d. irradiating said CD8-depleted mononuclear cells with a sufficient dose of γ-radiation to prevent proliferation of said CD8-depleted mononuclear cells; e. isolating adherent CD8-depleted mononuclear cells from the irradiated cells; f. loading the CD8-depleted mononuclear cells with about 1 to 50 μg/ml of the melanoma antigenic peptides; g. restimulating said CD8+ T cells by mixing said CD8+ T cells with the peptide-loaded CD8-depleted mononuclear cells at a ratio of about ten CD8+ T cells to one CD8-depleted mononuclear cells; h. expanding the CD8+ T cells; and i. inoculating the subject with collecting the activated CD8+ T cells specific to melanoma antigenic peptides for administration to the subject.

9760664

14792779

1. An information handling system comprising: one or more processors; a memory coupled to at least one of the processors; and a set of computer program instructions stored in the memory and executed by at least one of the processors in order to perform actions of: executing a plurality of first sensitivity tests on a circuit model using a first signal arrival time value, the executing resulting in a plurality of first test results; adjusting the first signal arrival time value to a second signal arrival time value in response to determining that the plurality of first test results do not meet a pre-determined probability threshold; executing a plurality of second sensitivity tests on the circuit model using the second signal arrival time value, the executing resulting in a plurality of second test results; in response to determining that the plurality of second test results meets the pre-determined probability threshold, computing a timing constraint sensitivity utilizing the second signal arrival time value; determining whether the timing constraint sensitivity is within a pre-defined tolerance of a characterized sensitivity of the circuit model, wherein the characterized sensitivity was generated by a software modeling system during library characterization of the circuit model; and adjusting one or more modeling parameters of the software modeling system based upon the determining, wherein the software modeling system generates a changed characterized sensitivity of the circuit model using the adjusted one or more modeling parameters.

8170967

12132335

1. An assisted decision-making system comprising: a processor; and a memory comprising: a knowledge base comprising a plurality of executable stories, a given executable story comprising: an executable belief network comprising a plurality of hypotheses; and a plurality of evidence templates representing respective text segments containing information related to the plurality of hypotheses comprising the belief network, a given evidence template listing at least two of the location, magnitude, mechanism, and associated actor of an event of interest described in a represented text segment; and computer executable instructions, executed by the processor, comprising a plurality of decision algorithms that retrieve executable stories from the knowledge base, modify the retrieved executable stories, and return the modified executable stories to the knowledge base.

20020001338

09781700

1. An improvement for acquiring synchronization to a chip-sequence signal having, a plurality of chips, embedded in a spread-spectrum signal, comprising: a shift register for storing a replica or delayed replica of the chip-sequence signal, with said shift register having a plurality of taps corresponding to the plurality of chips, respectively; a plurality of comparators, connected to the plurality of taps, respectively, for comparing the chip-sequence signal embedded in the spread-spectrum signal with the replica of the chip-sequence signal stored in said shift register, thereby generating for the plurality of taps of said shift register a plurality of compared values at said plurality of comparators, respectively, and thereby generating for each comparator from a sequence of comparisons, a multiplicity of compared values; a plurality of counters, connected to the plurality of comparators, respectively, for up and down counting, from each comparator, a respective multiplicity of compared values, respectively, appearing at an output of a respective comparator of said plurality of comparators, thereby generating a plurality of totals, respectively, at outputs of the plurality of counters; and selecting means, coupled to said plurality of counters, for selecting a value from the plurality of totals.

7882560

11415022

1. A computerized method, comprising: controlling a computer to define at least one key event to be monitored by at least one agent; controlling the computer to create a graphical model for the at least one key event; controlling the computer to observe the at least one key event; controlling the computer to infer a degree of attack on the computer system based on an automated observation of the at least one key event in conjunction with a result of an effect the at least one key event has on the graphical mode, where controlling the computer to infer the degree of attack on the computer system comprises modifying a probability of attack on the computer system based on the observation of the at least one key event in conjunction with the result of the effect the at least one key event has on the graphical model; controlling the computer to monitor the output of the graphical model, the output indicating whether the probability of attack is greater than a threshold value; and controlling the computer to automatically adjust a security policy based on an output of the graphical model, where adjusting the security policy is performed automatically without user intervention, and where adjusting the security policy includes re-posturing a probabilistic security policy to correspond to the degree of attack; where the graphical model includes a plurality of nodes, where controlling the computer to create the graphical model for the at least one key event comprises controlling the computer to create at least one initial probability for nodes in the plurality of nodes in the graphical model and controlling the computer to adjust the at least one initial probability of at least one node in the plurality of nodes as a function of at least one statistical datum associated with a previous security attack, where the at least one initial probability is defined according to the probability security policy.

20130151254

13755975

1. An acoustic front-end device comprising: a frame parser module receiving an acoustic signal and parsing the received acoustic signal into a plurality of frames; a plurality of correlation modules, each of the plurality of correlation modules comprising one or more acoustic property sets, each of the correlation modules correlating each of the plurality of frames with the one or more acoustic property sets; a controller; one or more speech codebooks; and wherein the controller retrieves one or more speech characteristic samples from the one or more speech codebooks based on the acoustic property set correlations.

20040072663

10679854

1. A circular fitness apparatus, comprising: a central hollow circular base; a bottom plate attached to the central hollow circular base, wherein the bottom plate is used to help seal the central hollow circular base to a surface; a vertical pole attached in a central vertical hollow component of the central hollow circular base; one or more moveable mounting brackets attached to the vertical pole including a plurality of attachment points for attaching a plurality of exercise attachments, wherein the attached plurality of exercise attachments allows simultaneous group or individual exercises to be completed at various locations around the vertical pole and wherein each of the plurality of attachment points can be used to attach a plurality of exercise attachments; a plurality of exercise attachments attachable at one end to the one or more moveable mounting brackets with a first removable clip and attachable at another end to a handle attachment via a second removable clip, wherein the plurality of exercise attachments provide a plurality of different levels of resistance for exercise activities; and a plurality of handle attachments attachable to the plurality of exercise attachments via a plurality of second removable clips, wherein the plurality of handle attachments include a pre-determined size large enough to allow an exercise participant to complete a physical activity via the vertical pole while changing positions without interfering with any of an exercise participant's body parts.

20180203848

15407713

1. A method for trait prediction comprising: receiving a text sequence comprising words, each of the words including at least one character, some of the words comprising more than one character; generating a character embeddings for each of the characters of the text sequence, each character embedding being a multidimensional representation of a respective one of the characters; generating word representations for words of the text sequence with a trained character sequence model, based on the character embeddings, each word embedding being a multidimensional representation of a respective one of the words of the text sequence, the character sequence model comprising a first recurrent neural network that receives the character embeddings for a word of the text sequence and outputs the word representation for the word; generating a sequence representation for the text sequence with a trained word sequence model, based on the word representations; generating at least one trait prediction with a trained trait model, based on the sequence representation; and outputting the trait prediction or information based on the trait prediction, wherein at least one of the generating character embeddings, generating word representations, generating the sequence representation, and generating at least one trait prediction is performed with a processor.

7716573

11237497

1. A computer-implementable method for mining data from a UML model and displaying underlying subject domain of the UML model in a readily understandable format, the method comprising: generating a graphics file for a Unified Modeling Language (UML) diagram; creating an Extensible Markup Language (XML) schema that reflects an underlying subject domain that is to be used when creating an XML representation of a UML model that incorporates relationships described by the UML diagram; converting the UML model into an XML file in conformance with the XML schema, wherein the XML file comprises XML formatted written descriptions of attributes of elements represented in the UML model; transforming the XML file into a plurality of HyperText Markup Language (HTML) files, wherein the HTML files include written descriptions of attributes of and relationships among elements represented in the UML model, and wherein at least one of the HTML files references the graphics file; and displaying the HTML files along with the referenced graphics file in a format that reflects the underlying subject domain of the UML model instead of UML syntax.

9129214

13829064

1. A method comprising: receiving title interaction data, wherein the title interaction data specifies, for each user of a plurality of users, an order in which the user interacted with a plurality of titles; generating a plurality of statistical models, each statistical model of the plurality of statistical models specifying a plurality of probabilities, wherein the plurality of probabilities represent, for each first title of the plurality of titles and each second title of the plurality of titles, a likelihood that a user will interact with the first title then next interact with the second title; wherein generating the plurality of statistical models is performed by creating a global statistical model based on the title interaction data and applying noise to the global statistical model to create each of the plurality of statistical models; refining the plurality of statistical models based on the title interaction data to produce a plurality of refined statistical models; determining a plurality of weight values corresponding to the plurality of refined statistical models for a particular user of the plurality of users, wherein each weight value of the plurality of weight values corresponds to a respective refined statistical model of the plurality of refined statistical models; identifying, for the particular user, one or more recommended titles of the plurality of titles based on the plurality of weight values and the plurality of refined statistical models; wherein the method is performed by one or more computing devices.

20140136548

14156963

1. A computer implemented method, comprising: calculating, by a computer-based system for assessing data sources, a numerical difference of a first count and a second count, wherein the first count is of records in a regulated data source having an identical value for a first data field as at least one other record in a plurality of regulated data sources, wherein the regulated data source is in the plurality of regulated data sources, wherein the second count of records in the regulated data source has no identical values for the first data field in the plurality of regulated data sources, assigning, by the computer-based system and based on the difference, a first regulated data source ranking for the first data field for the regulated data source of the plurality of regulated data sources; and assigning, by the computer-based system, a second regulated data source ranking for a second data field for the regulated data source.

20030018556

09900724

1. A method for evaluating an investment portfolio comprising: accessing data for a plurality of companies in an investment portfolio; fiscally realigning the data; calculating at least one predetermined set of values for each company using the fiscally realigned data; aggregating the at least one predetermined set of values to create aggregated values for the investment portfolio; and creating a performance indicator as a function of the aggregated values.

8554562

12618731

1. A computer program product for speaker diarization, the computer program product comprising: a non-transitory computer readable medium; computer program instructions operative to: obtain pre-trained acoustic models of individual speakers and/or groups of speakers; receive speech data with multiple speakers; divide the speech data into frames; for each of a plurality of frames, calculate for one or more of the pre-trained acoustic models, a probability that the speaker of the frame is the speaker of the pre-trained acoustic model; for each of the plurality of frames, determine an acoustic feature vector representing the frame; for each of the plurality of frames, modify the respective acoustic feature vector of the frame to include one or more elements representing the calculated respective one or more probabilities; and segmenting or clustering the received speech using the modified feature vectors of the plurality of frames, wherein said program instructions are stored on said computer readable medium.

20080194418

11914099

1. A method, comprising: isolating fragment tags near restriction sites from genomic DNA by: (a) contacting a preparation of genomic DNA with a restriction endonuclease; (b) subjecting the preparation of genomic DNA to shearing force to fragment the DNA; and (c) isolating DNA fragments from the resulting preparation based at least in part on their length, which DNA fragments are the fragment tags, wherein (a) and (b) can occur in either order or concurrently; hybridizing the fragment tags from two individuals or samples to a collection of nucleic acid elements; and detecting differential hybridization, where differential hybridization indicates a sequence difference between the two individuals or samples.

8494988

12550858

1. A method, comprising: receiving, by a slave processor from at least one master processor, a pair of parent chromosome data structures, wherein each parent chromosome data structure provides a plurality of genes representative of variables that are permitted to evolve; identifying, by the slave processor, at least one evolutionary operator for generating at least one child chromosome data structure; identifying, by the slave processor, a plurality of constraint functions for evaluating the feasibility of the at least one child chromosome data structures; determining, by the slave processor, at least one feasible chromosome data structure within a feasible solution set based at least in part on the pair of parent chromosome data structures, the at least one evolutionary operator, and the plurality of constraint functions; and transmitting, by the slave processor to the at least one master processor, the at least one feasible chromosome data structure.

9195458

13955017

1. A computerized method of analyzing code of a software program for dominance relationships between a plurality of functions of the software program, the method comprising: receiving source code of a software program, the source code having a plurality of functions; identifying a plurality of intraprocedural dominator graphs each for another of the plurality of functions of the source code; combining the plurality of intraprocedural dominator graphs to create a combined interprocedural dominance graph with edges that logically connect between nodes of the plurality of functions of the source code; identifying a plurality of interprocedural dominance relations between nodes in different functions of the plurality of functions of the source code using the combined interprocedural dominance graph; and analyzing the received software program according to the plurality of interprocedural dominance relations; wherein the method further comprises: identifying one or more interprocedural dominance candidates in the combined intraprocedural dominator graph; computing an interprocedural dominator set for each of the interprocedural dominance candidates; and wherein combining comprises computing the combined interprocedural dominance graph by logically adding interprocedural edges between the one or more interprocedural dominance candidates and one or more dominators from the interprocedural dominator set.

4416995

06300943

1. A system for determining the activity of a select chemical upon a bacterial sample containing bacteria in a bacterial growth medium and the select chemical, the system comprising: dispensing means for adding radioactively-labelled thymidine or thymidine analog to the bacterial sample; incubating means for maintaining a desired incubation environment for the bacterial sample before and after addition of radioactively-labelled thymidine or thymidine analog to the bacterial sample; separator means for separating said bacteria from said bacterial growth medium, said select chemical, and a portion of said radioactively-labelled thymidine or thymidine analog after incubation; and radioactivity measuring means for measuring radioactive radiation emanating from said separated bacteria.

20160048926

14457462

1. A method of auditing a transaction, the method comprising: receiving, at a processor, data characterizing the transaction, the data including a first price for a travel service to be provided by a service provider; determining, by the processor, a second price for the travel service based on a pricing rule of the service provider; determining, by the processor, if the first price matches the second price; in response to the first price matching the second price, allowing, by the processor, the transaction; and in response to the first price not matching the second price, determining, by the processor, an action based on a set of transactions that occurred prior to the transaction.

20050278570

10865206

1. A method for providing error data processing having user-defined parameters, comprising: applying user-defined error thresholds to a plurality of user-definable error threshold rules; processing error events; storing information related to the processed error events; and determining when one of the plurality of user-definable error threshold rules has been satisfied based on the stored information.

20130111250

13284684

1. A data processing system, the data processing system comprising: a data detector circuit operable to apply a data detection algorithm to a data input to yield a detected output; a data decoder circuit operable to apply a data decode algorithm to a data set derived from the detected output to yield a decoded output; and a power usage control circuit operable to force a defined number of global iterations applied to the data input by the data detector circuit and the data decoder circuit regardless of convergence of the data decode algorithm.

20170083009

14919720

1. A computer-implemented method for scheduling a treelike hybrid K-cluster tool to generate a one-wafer cyclic schedule, the treelike hybrid K-cluster tool having K single-cluster tools denoted as C 1 , C 2 ,. .. , C K , with C 1 being a head tool of the treelike hybrid K-cluster tool, the single-cluster tool C k , k∈ K , having a robot R k for wafer handling, the method comprising: given a value of cycle time, generating a part of the schedule for a section of the K-cluster tool by performing a generating algorithm, the section of the K-cluster tool being either an extended sub-tree (EST) or a sub-tree (ST); wherein the generating algorithm for EST k or ST k , with C i being a downstream adjacent tool of C k and with Θ being the given value of cycle time for EST i , ST i or B i , comprises the steps of: (S1) if Θ is not an optimal cycle time for EST k or ST k , and if k∉F and A i(n[i]) ≠0, then performing Steps (S1.1), (S1.2) and (S1.3); (S1.1) for m∈S i , calculating Δ m 's according to Δ m =A m(n[m]) /Σ p∈S m B[p ] if m>i and Δ m = Δ i = { Φ i ( S , S ) - A i ( n [ i ] ) for Condition 1 , Φ i ( S , S ) 1 + ∑ p ∈ S i B [ p ] for Condition 2 , Φ i ( D , S ) 1 + ∑ p ∈ S i B [ p ] for Condition 3 , if m = i , where Condition 1 is that 0 < A i ( n [ i ] ) ≤ ∑ p ∈ S i B [ p ] × Φ i ( S , S ) 1 + ∑ p ∈ S i B [ p ] and S-S case is considered, Condition 2 is that A ( i + 1 ) ( n [ i + 1 ] ) ≥ ∑ p ∈ S i B [ p ] × Φ i ( S , S ) 1 + ∑ p ∈ S i B [ p ] and S-S case is considered, and Condition 3 is that D-S case is considered; (S1.2) if Δ=min{Δ p |p∈S i }=Δ i , then performing Steps (S1.2.1), (S1.2.2) and (S1.2.3) with: Y=Φ i (S,S)−A i(n[i]) when Condition 1 is satisfied; Y = Φ i ( S , S ) 1 + ∑ p ∈ S i B [ p ] when Condition 2 is satisfied; and Y = Φ i ( D , S ) 1 + ∑ p ∈ S i B [ p ] when Condition 3 is satisfied; (S1.2.1) in EST i or B i , for p∉S i , if p∉L, then setting ω p((b[p] _ 1)-1) =A p((b[p] _ 1)-1) +Δ, else setting ω p0 =A p0 +Δ; (S1.2.2) in EST i or B i , if p∈S i and p∉F, then setting: ω pj =A pj +Y for j∈D[p ], or for j∈ n[p] {n[p ]} if p∈L; ω p((b[p] _ 1)-1) =A p((b[p] _ 1)-1) +Σ q∈S p {p} B[q]×A i(n[i]) /(Σ p∈S i B[p ])+Δ, or ω p0 =A p0 +Δ if p∈L ; and ω p(n[p]) =A p(n[p]) −Σ q∈S p B[q]×Y; (S1.2.3) in EST i , if p∈S i and p∈F, then setting: ω pj =A pj +Y,j∈D[p ]; ω p((b[p] _ 1)−1) =A p((b[p] _ 1)−1) +∈ q∈S p−1 B[q]×Y+Δ; ω p((b[p] _ 1)−1) =A p((b[p] _ 1)−1) +∈ q∈S p−1 B[q]+Y,d∈{ 2 , 3 ,. .. ,f[p]}; and ω p(n[p]) =A p(n[p]) −Σ q∈S p B[q]×Y; (S1.3) if Δ=min{Δ p |p∈S i }=Δ f ≠Δ i , then performing the Steps (S1.2.1), (S1.2.2) and (S1.2.3) with Y=Δ f followed by repeating the Steps (S1.1), (S1.2) and (S1.3); where: L denotes an index set of leaf tools in the treelike hybrid K-cluster tool; F denotes an index set of fork tools in the treelike hybrid K-cluster tool; ST j denotes a ST (sub-tree) with C j being a fork tool, and EST i is an EST (extended sub-tree) of ST j with none of C i , C i+1 ,. .. , C j-2 , C j-1 being a fork tool; B i , starting from C i and ends at C m , m∈L, denotes a linear multi-cluster tool in the treelike K-cluster tool; ω ij is a robot waiting time of R i at Step j, j∈Ω n[i] , n[i] being an index of a last processing step of C i ; A kj is a robot waiting time at Step j for R k , computed under an assumption that Θ=Π, Π being a fundamental period of a bottleneck tool among the K single-cluster tools; S i is a set of single-cluster tools connected to C i and selected from the K single-cluster tools; B[k]=n[k]−1; b[p]_d is an index denoting a d-th outgoing module of C p ; D[p] be a set of processing steps in C y ; f[i], 1≦f[i]≦n[i], denotes the number of outgoing modules in C i , i∉L; Φ i+1 (S, S)=4λ i+1 +3μ i+1 +A (i+1)(n[i+1]) −Θ+4λ i +3μ i when C i and C i+1 are S-S, and Φ i+1 (D, S)=4λ i+1 +3μ i+1 +A (i+1)(n[i+1]) −Θ+λ i , when C i and C i+1 are D-S; λ i is a time taken by R i to load or unload a wafer in C i ; μ i is a time taken by R i to move between process modules of C i for transiting from one processing step to another; L ={1, 2,. .. , L} for a positive integer L; and Ω L = L ∪{0}.

7979380

12072010

1. A computer implemented method, comprising: consolidating acquired data of at least one of past values and present values of a system from a plurality of sources; generating virtual data of future values of the system by applying the acquired data to a predictive model; receiving additional acquired data; and dynamically updating the virtual data by applying the additional acquired data to the predictive model, wherein the additional acquired data replaces a portion of the generated virtual data, the additional acquired data including a first time stamp that matches a second time stamp of the replaced portion of the generated virtual data.

20110206260

13126274

1. A method of acquiring at least one clinical MRI image of a subject comprising the following steps: acquiring a first survey image with a first field of view, the first survey image having a first spatial resolution, locating a first region of interest and at least one anatomical landmark in the first survey image, determining the position and the orientation of the first region of interest using the anatomical landmark, the position and the orientation of the first region being used for planning a second survey image, acquiring the second survey image with a second field of view, the second survey image having a second spatial resolution, the second spatial resolution being higher than the first spatial resolution, generating a geometry planning for the anatomical region of interest using the second survey image, acquiring a diagnostic image of the anatomical region of interest using the geometry planning.

20080091401

11870920

1. Method for the construction, within a computer system, of at least one model of a complex electronic system including a plurality of constituents, each system model including a hierarchised set of modelled constituents, said construction method comprising, for each model: obtaining a multiple instance hierarchical model including at least one instance vector corresponding to a plurality of instances of one and the same modelled constituent, each instance vector being able to be located at any level of a hierarchical decomposition tree of said multiple instance hierarchical model: expanding said multiple instance hierarchical model into an expanded model, by expansion of at least one instance vector included in said multiple instance hierarchical model.

20090060259

11849503

1. A method of confirming the identity of an item having an identifier, the method comprising: acquiring an image of the item having the identifier; extracting a first set of geometric point features from the image of the item; reading identification code data from the identifier on the item; retrieving a second set of geometric point features from a feature database based on the identification code data, the database comprising geometric point features associated with a plurality of known items; comparing the first set of geometric point features from the image with the second set of geometric point features corresponding to the identification code data; and determining whether the item in the image corresponds to the identification code data read from the identifier on the item based on comparison of the first set of geometric point features with the second set of geometric point features.

20080228480

11928922

1. A speech recognition method, comprising: model selection step which selects a recognition model based on characteristic information of input speech; and speech recognition step which translates input speech into text data based on said selected recognition model.

9270747

13082449

1. A method of monitoring a first communications connection and a second communications connection in anticipation of performing a change-over, the method comprising: identifying a data communications requirement of a first network device currently communicating via the first communications connection with a second network device; transmitting a data test message over the second communications connection; receiving a response to the data test message wherein the response to the data test message is compared to previously measured test data associated with the first communications connection to determine which of the first and second communications connections provides a more optimal data connection; determining an average measured bandwidth over a predefined interval comprising a plurality of connection tests exceeds a current connection bandwidth of the first communications connection by a predefined percentage threshold; and determining a change-over from the first communications connection to the second communications connection would provide a more optimal data connection based on the identified data communications requirements of the first network device and the predefined percentage threshold being exceeded.

8737771

13005062

1. An annotation addition method of adding one or more annotations into an input medium file, comprising: an annotation detection model creation step of creating one or more annotation detection models based on one or more training samples formed by one or more existing media files having one or more annotations; an annotation coexistence coefficient extraction step of extracting one or more coexistence coefficients of any two annotations based on appearance frequencies of the annotations in the training samples; a medium file input step of inputting the input medium file; a sense-of-vision feature extraction step of extracting one or more sense-of-vision features from the input medium file, the sense of vision features which are extracted include a low level feature including at least a Fourier description of the input medium file, and a high level feature including at least a creation environment of the input medium file; an initial annotation obtaining step of obtaining one or more initial annotations of the input medium file; a candidate annotation acquiring step of acquiring one or more candidate annotations based on the initial annotations and the coexistence coefficients of the annotations in the training samples, wherein the candidate annotation acquiring step includes: determining, for each of the one or more training samples, coexistence frequencies of any two annotations in a same one of the one or more existing media files; calculating a number of the existing media files which include at least one of the annotation; and acquiring annotation coexistence coefficients of any two annotations, based on the number of the existing media files which has been calculated; and a final annotation set selection step of selecting a final annotation set suitable for describing content of the input medium file from the candidate annotations based on the sense-of-vision features of the input medium file and the coexistence coefficients by using the annotation detection models.

20150256675

14638894

1. A computer-implemented method, comprising: determining, by a processor, one or more mood metrics in each of two or more chat stages of a real-time textual conversation between an agent and a customer; tracking, by the processor, changes in the one or more mood metrics across the two or more chat stages of the real-time textual conversation between the agent and the customer; and determining, by the processor, at least one action associated with the real-time textual conversation based on the changes in the one or more mood metrics.

7925292

11341964

1. A cell reselection method for selecting a target cell in a cellular wireless communications system, comprising: observing over time signal characteristics of cells, the cells including at least potential target cells; observing a first indicator, which is indicative of the signaling level of a serving cell of the system, and observing second indicators, each one being indicative of a signaling level of one of the potential target cells; starting a timer for any potential target cell having a second indicator that indicates the signaling level of the respective potential target cell is better than the signaling level of the serving cell as indicated by the first indicator; determining that at least one timer has reached expiration; predicting, upon the expiration of the at least one timer, an indicator value at a future time for any cell having a running or expired timer, wherein the predicting is based on the observing of the second indicators; and delaying a cell reselection to a target cell to a time later than the expiration of the at least one timer if any potential target cell having an unexpired running timer has a best predicted indicator value at the future time.

20120246147

13489094

1. A computer-implemented method comprising: for each table in a database query, selecting one or more projections that reduce an estimated cost for executing the query for the table, based on a segmentation or sort order of the selected projections; based on a data distribution of one or more of the selected projections among sites in a computer network, generating, for the query, possible join orders that represent different combinations of data distribution operations applied to the outputs of one or more of the query's joins; and evaluating the join orders based on a cost model.

20120324092

13159516

1. A computer-implemented method for forecasting an available capacity for processing a workload in a networked computing environment, comprising: receiving and storing, in a computer data structure, capacity data corresponding to a set of peer systems in the networked computing environment; accessing historical data related to workload handling for each of the set of peer systems; forecasting the available capacity of the set of peer systems to process the workload based on the capacity data and the historical data; determining a consistency factor for each of the set of peer systems to prioritize the set of peer systems for processing the workload based on the historical data; and prioritizing the set of peer systems for processing the workload based on the capacity and the consistency factor.

7953683

11732773

1. A learning apparatus including a central processing unit, comprising: storage means for storing a network formed by a plurality of nodes each holding dynamics; learning means for learning the dynamics of the network in a self-organizing manner on the basis of observed time-series data; winner-node determining means for determining a winner node, the winner node being a node having dynamics that best match the time-series data, the winner node being determined according to a prediction error corresponding to an average square error between the time-series data and learning data; and weight determining means for determining learning weights for the dynamics held by the individual nodes according to distances of the individual nodes from the winner node; wherein the learning weight is calculated by raising an attenuation coefficient to a power determined by a ratio between the distance of the individual nodes from the winner node and a variable that is adjusted to decrease as time elapses, and wherein the learning means learns the dynamics of the network in a self-organizing manner by degrees corresponding to the learning weights.

20090124878

12353799

1. A system for processing data signals obtained from a glucose sensor, the system comprising: a receiving module that receives a signal from a glucose sensor over a period of time; and a processor module comprising programming that detects transient non-glucose related signal artifacts and replaces at least some of the signal artifacts with estimated glucose values.

8930304

14154236

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

9888641

15077019

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

7712062

12029440

1. A method for verifying a circuit design, the method comprising: by a computing device, automatically analyzing a description of the circuit design to identify a clock domain crossing signal between a first node in a first clock domain and a second node in a second clock domain; by the computing device, automatically generating a description of a metastability effects generator for injecting metastability effects; performing a simulation test of the description of the circuit design using the description of the metastability effects generator; and outputting a coverage report regarding a result of the simulation of the description of the circuit design using the metastability effects generator.

9871064

15283271

1. A method for forming shallow trenches of the dual active regions, comprising the steps of Step S 01 : providing a semiconductor substrate having first shallow trench regions and second shallow trench regions, on which forming an etch stop layer; Step S 02 : using a first accurate photomask to expose and develop a first photoresist covering the semiconductor substrate, until the etch stop layer has been exposed on the top of the first shallow trench regions and the second shallow trench regions; Step S 03 : etching the etch stop layer entirely in the exposed regions; Step S 04 : using a second low-cost photomask to expose and develop a second photoresist to expose the first shallow trench regions; Step S 05 : etching and forming the first shallow trenches with a preliminary depth in the first shallow trench regions, and then removing the second low-cost photomask, wherein an in-situ stripping process is utilized to remove polymer residues generated by the etching reaction; Step S 06 : taking the etch stop layer as a mask, and simultaneously etching the first shallow trench regions and the second shallow trench regions to form the first shallow trenches and second shallow trenches having different depths, wherein the depth of the first shallow trenches are deeper than that of the second shallow trenches.

8666951

13354577

1. A method of managing multiple versions of enterprise meta-models within an enterprise model using semantic based indexing, the method comprising the steps of: a computer receiving a search query from a user; the computer determining from the search query a topic and at least two versions of a topic map meta-model of the enterprise meta-models within the enterprise model to compare; the computer applying the search query from the user to a merged topic map meta-model of the at least two versions of the topic map meta-model by searching a topic map based index of the merged topic map meta-model for the topic, and producing a result; and the computer using the produced result to translate the topic from the search query in one of the at least two versions of the topic map meta-model of the enterprise meta-models to another version of the at least two versions of the topic map meta-model of the enterprise meta-models, and allowing data between the at least two versions of the topic map meta-model of the enterprise meta-models within the enterprise model to be correlated.

9129290

12392058

1. An apparatus for generating a prediction of customer behavior and for selecting and assigning an interaction channel to said customer from among a plurality of interaction channels, comprising: a memory; a customer interaction data engine processor communicatively coupled to said memory and configured for executing in said memory: transforming data received from a plurality of sources into a format acceptable for storage, said data comprising problem dimension data relating to a customer interaction arising from an issue associated with a product or service, product dimension data relating to a product or service purchased by a customer, structured and unstructured customer dimension data about a plurality of customers, and structured and unstructured agent dimension data about a plurality of agents; a data warehouse coupled to said customer interaction data engine, said data warehouse configured for storing said transformed data; and a predictive engine coupled to said data warehouse and communicatively coupled to said memory, said predictive engine processor configured for executing in said memory: receiving said stored data from said data warehouse; compiling said data and determining contributing variables, wherein said compiling and determining comprises computing contributing variables according to whether the variable is for a numerical or categorical prediction and wherein contributing variables for a numerical prediction or a categorical prediction are computed using one or more statistical or predictive algorithms comprising any of: linear regression, logistic regression, Naïve Bayes, neural networks, and support vector machines; using said contributing variables to generate predictive models; identifying predictive trends in customer behavior as a function of particular data from said stored data, said particular data comprising: a product or service purchased by customers, time that has elapsed from a time said product or service was purchased, customer location, a problem associated with said product or service, and customer impact associated with said problem associated with said product or service, wherein customer impact is a function of type of customer interaction and customer lifecycle; predicting any of: probability of a customer to face a particular problem or issue based on an engagement stage of the customer with the company, wherein the engagement stage is product or service specific and measured by time after purchase or is the stage of a life cycle of the customer; a customer's preference of a particular channel based on type of concern and reduction of resolution time through the particular channel; and a probable impact of a particular problem on a customer's loyalty, growth, and profitability score; and selecting and assigning an interaction channel to said customer from among a plurality of interaction channels based upon said predicting.

20070192263

11736049

1. A rostering system based upon genetic algorithms, said rostering system comprising: at least one storage medium; and a rostering engine, coupled to said at least one storage medium, said rostering engine being adapted to perform genetic algorithm evolution on an initial shift list matrix having one or more shift lists to thereby derive a roster, said genetic algorithm evolution being based upon dynamic adjusting factors, each of said dynamic adjusting factors being respectively associated with each of said shift lists.

7861118

11694864

1. One or more computer-readable media containing executable code for performing the following steps: recording execution of a first execution context comprising a first write instruction and a second execution context comprising a second write instruction; detecting one or more possible race conditions that may occur when concurrently executing the first execution context and the second execution context; filtering one or more false positive race conditions from the one or more possible race conditions to obtain a positive race condition; determining that the first write instruction writes a first value to a memory location during the positive race condition, and that the second write instruction writes a second value to the memory location during the positive race condition; comparing the first value to the second value; categorizing the positive race condition as a potentially harmful race condition when the first value is different from the second value; and categorizing the positive race condition as a potentially benign race condition when the first value is equal to the second value.

10103977

15036877

1. A data flow distribution method, comprising: acquiring, by a software defined network (SDN) controller, data flow description information of a data flow; and deciding, by the SDN controller according to the data flow description information, whether the data flow needs a distribution, and when the data flow needs the distribution, delivering a distribution rule flow table to a distribution gateway, wherein before the SDN controller acquires the data flow description information of the data flow, the method further comprises: sending, by the SDN controller, a data flow table to a mobile network gateway and/or a distribution gateway, wherein the data flow table is used for indicating the mobile network gateway or the distribution gateway to send a data flow of a corresponding terminal to a Deep Packet Inspection (DPI) function for detection; wherein acquiring, by the SDN controller, the data flow description information of the data flow comprises: acquiring, by the SDN controller, the data flow description information of the data flow from the DPI; or, the mobile network gateway comprises one of: a user plane function of a Serving Gateway (SGW), a user plane function of a Packet Data Network Gateway (PGW), a user plane function of a Serving GPRS Support Node (SGSN), a user plane function of a Gateway GPRS Support Node (GGSN) or a user plane function of a non-3rd Generation Partnership Project (3GPP) gateway; or, the DPI is located at a data centre or located at a Traffic Detection Function (TDF).

20050149309

10750590

1. A method of specifying a trace array for a simulation in a data processing system, said method comprising: specifying one or entities within a simulation model with one or more statements in one or more hardware description language (HDL) files; in one or more statements in the one or more HDL files, specifying a trace array for storing trace data that will be generated through simulation of the simulation model; and storing said one or more HDL files.

20180123540

15342049

1. A method for fabricating an acoustic resonator or filter device, the method comprising: providing a substrate having a substrate surface region; forming a single crystal piezoelectric layer overlying the substrate surface region, the single crystal piezoelectric layer having a top piezoelectric surface region and a bottom piezoelectric surface region; forming topside metal electrode overlying a portion of the top piezoelectric surface region, the topside metal electrode having a topside electrode surface region, a topside electrode perimeter, and one or more topside electrode edges; forming a topside pillar structure overlying a portion of the top piezoelectric surface region within a vicinity of the topside metal electrode and outside of the topside metal electrode perimeter; forming a topside micro-trench within a portion of the single crystal piezoelectric layer; forming a topside metal having a topside metal plug within the topside micro-trench; forming a backside trench within the substrate exposing the bottom piezoelectric surface region and forming a substrate sidewall, the backside trench underlying the topside metal electrode and the topside micro-trench; forming a backside metal electrode underlying or in proximity of the bottom piezoelectric surface region within the backside trench, the backside metal electrode being electrically coupled to the topside metal, the backside metal electrode having a backside electrode surface region, a backside electrode perimeter, and one or more backside electrode edges; forming at least two metal pads for electrical connections, wherein at least one metal pad is electrically coupled to the topside metal electrode, and at least one metal pad is electrically coupled to the backside metal electrode; and forming a backside metal plug underlying the bottom piezoelectric surface region within the backside trench, the backside metal plug being electrically coupled to the topside metal plug and the backside metal electrode, wherein the topside micro-trench, the topside metal plug, and the backside metal plug form a micro-via.

20150205864

14671973

1. A method for identifying mood in content, comprising: generating a static representation of the content based on frequency data sampled from the content; filtering the static representation to capture intensity differences represented in the static representation and generating a filtered representation of the content; encoding the filtered representation to create a digitized representation of the content; identifying characteristics within the digitized representation that correspond to a first set of one or more moods among a set of moods; and generating a three-dimensional shape that corresponds to the first set of one or more moods.

20120297054

13112210

1. (canceled)

8144829

12380585

1. A method for medical imaging comprising: a) performing a multi-detector computed tomography (MDCT) scan of a patient to produce MDCT scan data; b) reconstructing MDCT image slices from the MDCT scan data; c) performing a cone-beam computed tomography (CBCT) scan of the patient using a CBCT beam source to produce CBCT scan data, wherein performing the CBCT scan comprises positioning a patterned lead sheet between the CBCT beam source and the patient to partially block x-rays from the CBCT beam source, such that the CBCT scan data is produced from a partially blocked CBCT beam; d) reconstructing CBCT image slices from the CBCT scan data; e) performing 3D rigid registration of the MDCT image slices and the CBCT image slices to obtain fused reconstructed images of the patient; wherein the method further comprises: storing a scatter distribution for the patient; and correcting for scatter by using scatter estimates derived from the scatter distribution together with a kernel-based scatter model.

8214189

12314334

1. A performance evaluation simulation apparatus that evaluates performance by performing a simulation on a software model and a hardware model in which a process to be performed is provisionally determined by using software and hardware from specifications of a system, the performance evaluation simulation apparatus comprising: a processor including a basic-process-unit dividing unit that divides the process into basic process units, which are execution units of the process to be performed in the software model based on an execution log that represents execution history obtained by executing the software model on an actual machine or simulation software; a throughput calculating unit that calculates a throughput of each of the basic process units obtained through division by the basic-process-unit dividing unit, from the number of instruction address strings or the number of address strings for data access kept in the execution log; an arrangement-structure changing unit that compares each throughput calculated by the throughput calculating unit and a predetermined threshold and changes an arrangement structure so that a basic process unit with a throughput exceeding the predetermined threshold is changed from the software model to the hardware model; a statistical-information generating unit that generates statistical information on which performance evaluation is based by performing a performance evaluation simulation on the basic process unit whose arrangement structure has been changed by the arrangement-structure changing unit to the hardware model and basic process units arranged in the software model, the performance evaluation simulation executing a bus access via an instruction cache and a data cache, to measure data required for operation analysis of the system; and a determination-condition setting unit that sets a target processor load factor or a bus occupancy by the target processor for determining the performance evaluation result of the target processor on which the performance evaluation simulation is to be performed, wherein the arrangement-structure changing unit, when the statistical information obtained after the performance evaluation simulation is performed does not satisfy the target processor load factor or the bus occupancy by the target processor set by the determination-condition setting unit, changes the predetermined threshold, compares the throughput calculated by the throughput calculating unit and the changed predetermined threshold, and changes an arrangement structure so that a basic process unit with a throughput exceeding the predetermined threshold is changed from the software model to the hardware model.

7895070

11124519

1. A method implemented in a computer, comprising: storing a model of a business process in a computer-readable storage medium of the computer˜wherein the model comprises a set of model elements, and a plurality of associations, and each association of the plurality of associations is configured to define one or more relationships between a plurality of model elements from the set of model elements; and presenting, using a processor of the computer, a class-specific view point of the model to a user of a first class of users, wherein the class-specific view point exposes details of a first phase of a plurality of phases of a business process definition, the class-specific view point hides a detail of a second phase of the plurality of phases of the business process definition, the processor is coupled to the computer-readable storage medium and a display unit of the computer, the presenting comprises displaying the class-specific view point, tracing the set of model elements and the plurality of associations, and presenting the set of model elements and the plurality of associations, the presenting is based at least upon the user having membership in the first class of users such that the presenting is prevented for a second user of a second class of users, and the first class of users and the second class of users are involved in different phases of the business process definition.

20050113647

10723364

1. A method for storing and processing physiological data in a medical recording device having continuous data collection and data storage of such data in multiple time-resolved tiers, comprising: sampling one or more physiological signals at a selected sampling rate; deriving physiological parameter values from the sampled signal; storing the parameter values as they are determined in a temporary memory buffer for a predetermined storage interval; determining a statistical aspect of the stored parameter values upon expiration of the storage interval; and writing the statistical aspect to a long-term memory buffer.

8014613

12046328

1. A method for predicting an offset factor for a target block of a multi-layer image, wherein said multi-layer image comprises a low-dynamic-range layer and a high-dynamic-range layer and said offset factor is used to predict said high-dynamic-range layer from said low-dynamic-range layer, said method comprising: a) determining a first scaling parameter and a first offset parameter for a first adjacent block, said first adjacent block being adjacent to said target block; b) determining a second scaling parameter and a second offset parameter for a second adjacent block, said second adjacent block being adjacent to said target block; c) fitting a mathematical model to said first scaling parameter, said second scaling parameter, said first offset parameter and said second offset parameter; d) determining a target scaling parameter for said target block; and e) determining a target offset parameter for said target block using said target scaling parameter and said mathematical model.

8930490

13345023

1. A method for collecting information, enriching said information and linking said enriched information, comprising: (a) on a computer device providing a lifestream data function to allow a user to collect a plurality of lifestreams, wherein said lifestream data function comprises: (i) a note taking function to allow said user to create a plurality of notes on said computer device, (ii) a recording function for collecting, recording or storing a plurality of recordings on said computer device, wherein said recordings are, in any combination, audio data recordings, video data recordings, or audio-video data recordings, and (iii) an annotation function for collecting, recording or storing a plurality of annotation data elements on said computer device, wherein said annotation data elements are externally sensed data of the environment of said user or physiological sensed data of said user, whereby said sensed data is either captured by said user or from said user using a data capture device; (b) on said computer device, or by a computer server or an online service each of them communicatively coupled with said computer device enriching each of said lifestreams and therewith creating a linked network of enriched lifestreams available to said user on said computer device by, in any combination: (j) linking one or more segments in each of said recordings with one or more annotation data elements, one or more notes, or a combination thereof, (jj) linking each of said notes with one or more annotation data elements, one or more segments of said recordings, or a combination thereof, or (jjj) linking each of said annotation data elements with one or more notes, one or more segments of said recordings, or a combination thereof; and (c) said computer device providing a filter or search function to said user for filtering or searching said enriched lifestreams or aspects of said enriched lifestreams on said computer device.

20100250232

12728715

1. A retrieval result outputting apparatus which outputs a result of example-sentence retrieval, comprising: an evaluating unit to evaluate degrees of matching on a character block basis between an input sentence and example sentences retrieved using the input sentence as a retrieval condition; an extracting to extract one of the retrieved example sentences as an extracted example sentence in accordance with the evaluation; a reevaluation portion selecting unit to select a portion of the input sentence as a reevaluation portion based upon the extracted example sentence; a reevaluating unit to reevaluate degrees of matching on a character block basis between the retrieved example sentences and the reevaluation portion of the input sentence; a re-extracting unit to re-extract another of the retrieved example sentences as a re-extracted example sentence in accordance with the reevaluation; and an outputting unit to output the extracted and re-extracted example sentences.

20160314236

14691599

1. A method for performing a hierarchical timing analysis and closure of an integrated circuit (IC) chip design component using load-sensitive feedback constraints, the method comprising: a) obtaining at least one original feedback constraint, a base load representation, and a sensitivity of said at least one original feedback constraint to said base load representation for one or more boundary pins of said component; b) performing an out-of-context timing analysis and closure of said component wherein an electrical parasitic of said one or more boundary pin is updated as part of said timing closure; c) obtaining an updated value of said load representation of said one or more boundary pin that accounts said electrical parasitic updates; d) computing an updated feedback constraint of said one or more boundary pin based on said one or more original feedback constraint, said base load representation, said sensitivity, and said updated value of the load representation; and e) employing said computed updated feedback assertion to perform a new timing analysis of said component as part of timing closure of the said chip design prior to chip manufacturing.

8972328

13527267

1. A method executed on a computing device for determining document classification probabilistically through classification rule analysis, the method comprising: identifying patterns and evidences within content of representative documents; constructing a classification rule based on an entity determined according to an analysis of the patterns and an affinity determined according to an analysis of the evidences; processing the content with the classification rule to: determine an entity count and an entity confidence level for the entity; determine an affinity presence and an affinity confidence level for the affinity; aggregate the entity count, the entity confidence level, the affinity presence, and the affinity confidence level to returned results; comparing the returned results to expected results to evaluate the classification rule against acceptance requirements; and if the classification rule meets the acceptance requirements, identifying confidence levels for the patterns and the evidences; else editing the classification rule.

20060194651

11356747

1. A game wherein one or more players move along a path according to predetermined rules of movement, the game apparatus comprising: a sequence of adjacent boxes outlined in the path; and graphics associated with a box, wherein the graphics designate one or more body parts of the player moving along the path that must touch a playing surface of the associated box.

8484269

12006333

1. A method for calculating a time-decayed aggregate from a data stream comprising a sequence of tuples, each tuple comprising an item identifier and an associated timestamp, comprising the steps of: generating a smooth decay function wherein said smooth decay function is a function of the difference between a current time and the timestamps; generating a set of linear data summaries, based at least in part on a first set of timestamps; generating a set of boundaries, based at least in part on the smooth decay function and on a second set of timestamps; adding, with a data processor, each tuple to a specific linear data summary based at least in part on the timestamp associated with the tuple; merging two linear data summaries based at least in part on the set of boundaries; and, calculating, with the data processor, said aggregate from the set of linear data summaries.

20080086437

11866554

1. A method for identifying a potential fault in a system, comprising: obtaining a set of training data; selecting a first kernel from a library of two or more kernels and adding the first kernel to a regression network; selecting a next kernel from the library of two or more kernels and adding the next kernel to the regression network; refining the regression network; and identifying a potential fault in the system using the refined regression network.

7778846

11781887

1. A computerized method of identifying potentially fraudulent healthcare reimbursement claims, comprising: determining, by at least one computer, a sequence of healthcare states for a client from healthcare reimbursement claims associated with the client; calculating, by at least one computer, a probability of the sequence based on previously-calculated probabilities of individual transitions between healthcare states, where the probability of the sequence is the geometric mean of the transition probabilities between each state and the next state in the sequence; and identifying, by at least one computer, the sequence as potentially fraudulent as a function of the probability of the sequence and providing an indication of same.

10082485

15321793

1. A method for leakage flux testing of ferromagnetic material to be tested, for detecting defects, the method comprising the steps of: magnetizing a test volume of the material to be tested by a constant magnetic field; scanning a surface of the material to be tested by a probe arrangement for capturing magnetic leakage fields caused by defects, said probe arrangement comprising a probe array with a multiplicity of magnetic-field-sensitive probes arranged next to one another in a first direction and held at a finite testing distance from the surface of the material to be tested during the testing, wherein the probes of the probe arrangement each have a probe width in the first direction which lies in the range from 20% of the testing distance up to 10 mm; and evaluating electrical probe signals for qualifying the defects, wherein the step of evaluating the electrical probe signals comprises the following steps: a mapping operation, in which signal information representing the probe signal is linked to spatial information representing the creation location of a probe signal for each probe signal in order to form spatially dependent signal data, a matrix-forming operation, in which the spatially dependent signal data, or signal data derived therefrom, are stored in fields, assigned with the correct location, of a basis matrix, and at least one evaluating operation, in which spatially dependent signal data from at least two fields of the basis matrix, adjacent to one another in an evaluating direction, are linked to one another using at least one evaluating algorithm.

20100023269

12573354

1. A method of managing a flow test in which a flow rate of fluid of a well is determined, the method comprising the steps of: receiving measurement data corresponding to fluid flow output from the well; operating a computer to identify a flow test time interval over which stable output flow measurements are represented in the received measurement data; operating a computer to determine an end of the flow test time interval; and then notifying a user of the completion of a flow test of the well, the flow test corresponding to the received measurement data over the flow test time interval.

9858051

13168450

1. A method comprising: in a processor of a security appliance coupled to a network, by the processor: monitoring data received by the security appliance from the network; converting a nondeterministic finite automata (NFA) graph for a given set of patterns to a deterministic finite automata (DFA) graph having a number of DFA states, the processor employing the DFA graph in order to apply the given set of patterns to the data for the monitoring, wherein the converting includes: mapping a DFA state of the number of DFA states to a corresponding set of one or more NFA states of the NFA graph; computing a first hash value of the one or more NFA states of the corresponding set; storing the first hash value in an entry of a DFA states table correlating the DFA state to the first hash value; and determining a transition DFA state from the DFA state for a character of an alphabet recognized by the NFA graph, based on whether a second hash value of transitions of the one or more NFA states for the character exists in an Epsilon Closure (EC) cache table, the EC cache table including hash value entries mapped to DFA states, and wherein, in an event the second hash value exists, setting the transition DFA state to be a given DFA state, the given DFA state mapped to the second hash value in the EC cache table.

8959200

12493652

1. A module for communicating real-time customizable alerts at a clinical diagnostic analyzer to an external monitor, the module comprising: a customized event detection sub-module embodied in hardware computer in the clinical diagnostic analyzer, wherein customized events include a first event, wherein a customized event comprises a specified logical combination of basic events, each basic event reflects a detection of a descriptor of the state of the colonial diagnostic analyzer, whereby customized facilitate maintenance of the clinical diagnostic analyzer; a connection sub-module embodied in hardware computer providing a link to the external monitor, wherein the external monitor, linked to the clinical diagnostic analyzer via a secure connection, receives an alert in response to the detection of the first event, wherein the alert does not include patient identifying information; a sub-module embodied in hardware computer for dynamically updating customized events to be detected to include a second event; and a data-logging facility embodied in hardware computer for logging information to be sent to or retrieved by the external monitor; wherein instructions to define the second event are communicated via instructions coded in a markup language to perform at least one of (a) dynamically modify a customized event, (b) add a new event, and (c) add a customized event.

20090307638

12466894

1. A method of selecting a structure and parameters of an electrical circuit component (ECC), the ECC having design variables, the ECC further having performance metrics, each performance metric being a function of at least one design variable, the method comprising steps of: (a) storing an arrangement of pre-defined, hierarchically interconnected building blocks of the ECC into a building block database, each building block representing a sub-circuit of the ECC, each building block having respective input parameters, the building blocks including atomic blocks, compound blocks, and flexible blocks, each individual compound block having at least one of a first atomic block, a first compound block and a first flexible block, each individual flexible block having alternative building blocks selectable through a choice parameter of each individual flexible block, each alternative block including at least one of an second atomic block, a second compound block and a second flexible block, the arrangement of pre-defined, hierarchically interconnected building blocks representing candidate topologies of the ECC; (b) selecting candidate topologies from the building block database to obtain initial candidate topologies; (c) selecting initial parameters for the initial topologies to obtained sized initial candidate topologies; (d) calculating performance metric values for the sized initial candidate topologies to obtain calculated performance metric values; (e) in accordance with the calculated performance metric values, determining if the sized initial candidate topologies fail to meet pre-determined criteria; (f) while the sized initial candidate topologies fail to meet a pre-determined criteria, in accordance with a search algorithm: (i) searching the candidate topologies for other candidate topologies; (ii) selecting parameters for the other candidate topologies to obtain sized other candidate topologies; (iii) calculating performance metric values for the sized other candidate topologies to obtain other calculated performance metric values; and (iv) in accordance with the other calculated performance metric values, determining if the sized other candidate topologies fail to meet the pre-determined criteria; (g) storing, in an output database, sized candidate topologies, and their respective performance values, that do meet the pre-determined criteria; and (h) displaying, for selection, the sized candidate topologies that meet the pre-determined criteria.

20100023445

12588009

1. A method of operating a computer to facilitate a commercial transaction involving a plurality of negotiable trading parameters, including the following steps resulting from the execution of a computer program; accepting in respect of a first entity a desired trading profile including at least desired values or ranges of multiple of said trading parameters and information for establishing one or more functional relationships between variations in at least a key trading parameter and other of said trading parameters; establishing one or more mathematical relationships between variations in at least the key trading parameter and the other of said trading parameters; wherein said one or more mathematical relationships can be used to determine a set of trading profiles having substantially equal expected desirability values to said desired trading profile; and determining whether a submitted trading profile from a second entity has a desirability value that equals or exceeds the desirability value of said desired trading profile using said one or more mathematical relationships.

20020110273

09989245

1. A method of reconstruction of a tridimensional scene from a bidimensional video sequence corresponding to N successive images of a real scene, comprising in series, for each image, segmented into triangular regions, of the sequence: (A) a first depth labeling step, in which, each view being considered as the projection of a continuous 3D sheet, a multi-view matching is performed independently on each view in order to get a disparity map corresponding to the depth map of said 3D sheet; (B) a second 3D model extraction step, in which an octree subdivision of the 3D space is performed and the voxels lying in the intersection of all 3D depth sheets are kept.

9922433

14821703

1. A method for detecting a probability of a biomarker in a tissue of a patient based on generating a probability map, the method comprising: determining, by an imaging system, a dimension of a moving window from a subset of tissue samples stored within a big data database; determining, by the imaging system, a width of a computation voxel based upon the dimension of the moving window, wherein the computation voxel is a unit of the probability map that is obtained from an image of the tissue of the patient; moving, by the imaging system, the moving window across the image in a predetermined direction at fixed intervals, wherein the computation voxel is contained within a number of stops of the moving window; obtaining, by the imaging system, multiple measures of multiple imaging parameters for every stop of the moving window on the image, wherein two neighboring ones of the stops of the moving window are partially overlapped with each other; obtaining, by the imaging system, multiple first probabilities of the biomarker for the stops of the moving window by matching the multiple measures of the multiple imaging parameters to a classifier defined from the big data database; obtaining, by the imaging system, multiple second probabilities of the biomarker for the computation voxel based on information associated with the first probabilities to obtain the probability map; and determining the probability of the biomarker in the tissue of the patient at the computation voxel from the probability map, wherein the biomarker provides an indication of an event.

5412757

07798155

1. A fuzzy control system for controlling a physical object, the physical object being responsive to a control signal and producing a status signal corresponding to the status of the physical object, the fuzzy control system comprising: means for receiving the status signal from the physical object; means for generating a control reference value; means for selectively calculating a control deviation from the received status signal and the control reference value; operation means, connected to said selective calculating means, for performing a fuzzy inference operation on the control deviation calculated by said selective calculating means and a control deviation contained in a fuzzy rule, the fuzzy rule defined by expert knowledge, to obtain a control deviation membership function; calculating means for calculating matching between a membership function about an internal state of said physical object and a membership function about an internal state variable included in said fuzzy rule to obtain a matching point, and calculating a membership function about the control signal for said physical object and a membership function about a new internal state variable from an internal state variable membership value corresponding to the matching point; means for storing the membership function about said new internal state variable; and means for outputting said control signal to said physical object and controlling the physical object.

20170009208

15119534

1. A method of producing an MSC population with enhanced regenerative potential, comprising: a) culturing an MSC-containing population of cells in a culture medium to a confluence of 80% to 90% over each of at least four population doublings to provide a population enriched in large-MSC cells, wherein the four population doublings are measured from initial extraction of the MSC-containing population from a source; and b) biophysically sorting the MSC-containing population of cells produced in step (a) and collecting a large-MSC population of cells from the MSC-containing population, thereby producing an MSC population with enhanced regenerative potential.

20020187459

10143261

1. A gauge simulator for use in conjunction with pilot training comprising: a housing, a plurality of electrically controlled gauges mounted to said housing, each said gauge having a variable display value corresponding to an aircraft condition, a processor contained in said housing, said processor having outputs electrically connected to said gauges for controlling the display value of each said gauge, said processor being programmed to simulate gauge display values corresponding to predefined malfunctions of an aircraft.

20110219341

12719710

1. A method for performing interactive editing of an electronic circuit design, the method implemented with a processor, the method comprising: identifying an object in a layout of the electronic circuit design, wherein the object is to be manufactured with double patterning technology; checking whether the object corresponds to a double pattern violation; determining whether a corrective solution can be implemented to resolve the double pattern violation; and determining whether the corrective solution can be implemented interactively.

8844526

13435968

1. A method for ventilating a patient with a ventilator, comprising: delivering a fixed base flow that is undeterminable; monitoring a windowed differential lung volume during exhalation; determining that the windowed differential lung volume is at about zero after a decreasing trend toward zero; and triggering inspiration based on the first of at least one of the following events to occur: a net negative change in lung volume with increasing magnitude is detected that is greater than an inspiratory trigger threshold directly after the step of determining that the windowed differential lung volume is about zero; and a predetermined amount of time expires.

8891852

10979572

1. A method for configuring an image analysis device to inspect objects comprising: continuously moving a sequence of objects being manufactured in a production environment relative to a field of view of the image analysis device; capturing a sequence of images of the field of view, such that the sequence of images includes a plurality of images of each of a plurality of objects from the sequence of objects being manufactured in the production environment; displaying a portion of the sequence of images on a graphical user interface, the portion displayed chosen responsive to scrolling commands, the scrolling commands advancing the portion forward and backward in the sequence of images; choosing, during a training phase, a first training image from the displayed portion of the sequence of images of a training object, the first training image being selected depending upon particular features recognized on the training object during the training phase; configuring the image analysis device by creating, using the first training image chosen during the training phase, at least one vision tool to inspect objects similar in appearance to the training object of the first training image, the at least one vision tool being represented by a graphical image on the graphical user interface; and performing an image analysis operation on the first training image to detect a feature on the training object of the training image, by computing a logic value to determine whether the feature is located in the field of view for each of the plurality of images such that the feature is determined to be located in the field of view for at least one image of the plurality of images when the logic value for the feature located in the field of view for the at least one image is greater than a threshold value.

6079952

09018225

1. A method for controlling the compressive capacity of a multi-stage compressor based on the demand of an air conditioning system, each of said stages having an input, an output and means for compressing a fluid, said method comprising the steps of: operating said compressor at substantially less than full capacity by recirculating said output of each stage back to said input of said stage by opening a control valve for each stage; increasing the capacity in a first-stage by decreasing recirculation of said first-stage by closing the control valve for the first-stage according to a schedule based on said demand; and increasing the capacity in a second-stage by decreasing recirculation of said second-stage by closing the control valve for the second-stage according to a schedule based on said demand.

20080063045

11936193

1. A receiver adapted to receive and process a radio signal and initialize an initial value of a parameter, the receiver being characterized by means for: comparing a new delay of the received signal and an old delay of a previously received signal; if the new delay and the old delay are the same, then initializing the initial value of the parameter to be an existing value; and if the new delay and the old delay are not the same, then interpolating information and initializing the initial value of the parameter to be the interpolated value.

8078559

12132367

1. A machine for determining potential unknown unknowns for an assisted decision making system, where an unknown unknown is an item of data that is missing from a story of interest and whose absence is not accounted for in the story of interest, comprising: a processor; a memory containing: an information extraction algorithm that extracts evidence from unformatted text segments to produce an evidence template and an associated confidence value from a given text segment; a plurality of inferencing algorithms, a given inferencing algorithm receiving evidence templates from the information extraction component and generating a story fragment comprising at least one hypothesis, evidence supporting the at least one hypothesis, and respective belief values associated with the at least one hypothesis from the evidence stored in the knowledge base; and an arbitrator, associated with the assisted decision making system, that compares the at least one hypothesis and the evidence supporting the at least one hypothesis comprising the story fragment to a plurality of hypotheses and associated evidence comprising a story of interest associated with the assisted decision making system to determine if the story fragment is sufficiently related to the story of interest as to represent a potential unknown unknown within the story of interest.

20170004649

14788722

1. A method of modeling a three-dimensional object from plural image data sources, the method comprising: providing a first point cloud including a first plurality of points defined in space, the first plurality of points being derived from a first one or more images of the object, the first one or more images being of a first image type, each point in the first plurality representing a location on a surface of the three-dimensional object, and each point in the first plurality having a first confidence value on a first confidence scale; providing a second point cloud including a second plurality of points defined in space, the second plurality of points being derived from a second one or more images of the object, the second one or more images being of a second image type, each point in the second plurality representing a location on the surface of the three-dimensional object, and each point in the second plurality having a second confidence value on a second confidence scale; merging the first plurality and the second plurality of points into a third merged point cloud, each point in the third merged point cloud representing a location on the surface of the object, including: normalizing one of the first or second confidence scales with the respective second or first confidence scale; and for each location of the object for which a corresponding point exists in both the first point cloud and the second point cloud, selecting the point for inclusion in the merged point cloud from either the first point cloud or the second point cloud having a greater first or second normalized confidence value.

8635074

11855447

1. An interactive voice response interface for accepting orders from an inmate population in a correctional facility for items approved by the correctional facility and offered to the inmate population by a commissary service, the commissary service being subject to applicable order restrictions determined by the correctional facility, the order restrictions preventing selected inmates from purchasing certain items from the commissary service that are otherwise available for purchase by the inmate population; the interface comprising: a computer configured to: receive an incoming communication from an inmate to the commissary service; in response to the incoming communication, provide voice prompts to the inmate for ordering at least one item from the commissary service; receive an order submitted from the inmate for at least one item from the commissary service during the incoming communication; subject the received order to the applicable order restrictions in existence at a first point in time during the incoming communication; store the received order if it does not violate the applicable order restrictions at the first point in time; apply the applicable order restrictions to the stored order at a second point in time after termination of the incoming communication; and determine whether applicable restrictions in existence at the second point in time prevent fulfillment of the delivery of the accepted order to the inmate.