Datasets:

patent

/

AIPD_evo_claim_one

like 0

20040098693

10335087

1. A method of identifying a group of routes for a set of nets, wherein the group of routes includes one route for each net in the set of nets, the method comprising: a) identifying a set of routes for each net; b) iteratively selecting one identified route for each net, c) during each iteration, selecting the identified route that least increases a tracking cost that accounts for each of the previously selected routes.

9861052

15074170

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

7742905

11066945

1. A computer-implemented method of executing a simulation of a computer platform, said simulation comprising a plurality of simulation models, said method comprising: accessing a dynamic quantum whose current value specifies a maximum number of units of execution that a first simulation model of said plurality of simulation models is allowed to perform; invoking respective simulation models of said plurality of simulation models for executing said first simulation model and a second simulation model simultaneously; and providing the current value of said dynamic quantum to each of said simulation models when invoking each of said simulation models, wherein said executing said first simulation model renders a unified view of said plurality of simulation models, and wherein said first simulation model directly accesses memory of said second simulation model to avoid invoking said second simulation model to avoid a dependency that would otherwise cause said first simulation model to halt prior to completing said maximum number of units of execution.

20140101186

13647004

1. A method comprising: using at least one data processor, constructing a plurality of sets having social network service members as entities by associating each of the social network service members with each of a predetermined selection of professional outcomes by school of graduation of the member; selecting one of the plurality of sets; using a similarity algorithm, calculate the similarity score of at least some of the plurality of sets in the plurality of sets to the selected one of the plurality of sets; and presenting for rendering the k sets in the plurality of sets with the highest similarity scores.

9124986

13533293

1. A listening device adapted for being located in or at an ear of a user and comprising: an input transducer for converting an input sound to an electric input signal; an output transducer for converting a processed electric signal to an output sound; a forward signal path being defined between the input transducer and the output transducer and comprising a signal processing unit for processing the electric input signal or a signal derived from the electric input signal and providing a processed output signal; a manually operable user interface located on the listening device allowing a user to control a function of the listening device; and a feedback estimation system for estimating a feedback path estimate from the output transducer to the input transducer, the feedback estimation system comprising an adaptive filter, the adaptive filter comprising a variable filter part and an algorithm part comprising an adaptive algorithm, the variable filter part being adapted for providing a transfer function to a filter input signal and providing a filtered output signal, the transfer function being controlled by filter coefficients determined in the algorithm part and transferred to the variable filter part, the feedback estimation system further comprising an update control unit adapted for controlling the adaptive algorithm including a transfer of the filter coefficients to the variable filter part, wherein the update control unit is adapted to monitor the manually operable user interface and to provide that an activation of the manually operable user interface is used for influencing the control of the adaptive algorithm, wherein the update control unit comprises a timing unit that controls when newly calculated or stored filter coefficients are transferred to the variable filter part of the adaptive filter, and wherein the timing unit is adapted to influence timing of a calculation of the filter coefficients and/or the transfer of the filter coefficients to the variable filter, when the manually operable user interface has been activated.

7526455

11418448

1. A decision support system, comprising: a database containing data from a plurality of disparate data sources; and an electronic device configured to classify the database data and assign weighted values to the data based at least in part on the classification, the electronic device further configured to analyze the database data so as to provide at least one recommended action and outcome information for the at least one recommended action.

7720652

10968862

1. An article of manufacture comprising: a storage medium; and a plurality of executable instructions stored on the storage medium that, when executed, direct a device to convert a location history to a stochastic model of the location history by applying at least one recurring time period to the location history, the recurring time period being divided into a number of time intervals, the stochastic model comprising a multi-dimensional matrix that includes multiple entries each corresponding to a combination of one of the time intervals and one of multiple locations, each entry including at least one probability that an object is present at the corresponding one of the locations during the one of the time intervals, the probability being calculated by dividing a total number of times that the location history shows the object as being at the corresponding one of the multiple locations during the corresponding one of the time intervals by a total number of recurrences of the time period.

8460567

12165801

1. A method of etching a substrate, comprising: disposing a substrate in a processing system, said processing system comprising a first chamber region, a second chamber region, and a substrate treatment region, wherein a separation member is disposed between said first chamber region and said second chamber region, said first chamber region having a first pressure, said second chamber region having a second pressure, said substrate treatment region having a third pressure; forming plasma in said first chamber region; extracting electrons from said plasma; collision-quenching said electrons in order to form less energetic electrons; forming a quiescent plasma with a population of negatively-charged ions using said less energetic electrons in said second chamber region; and etching one or more features in said substrate by exposing said substrate to said population of negatively-charged ions in said quiescent plasma; wherein said forming plasma further comprises: providing a first process gas for said forming said plasma, wherein said first process gas comprises as an incipient constituent a noble gas; and disposing a pressure barrier between said second chamber region and said substrate treatment region; wherein said pressure barrier is configured to produce a controlled pressure differential between said second chamber region and said substrate treatment region, said pressure barrier comprising one or more openings therethrough to permit adjusting said second pressure for efficient collision quenching in said second chamber region, wherein controlling the pressure differential to achieve efficient said collision-quenching of said electrons is performed using a pressure control system; wherein said separation member comprise openings sufficiently large to permit electron extraction and sufficiently small to prevent electron heating across said separation member; and wherein said first chamber region having a first power source, said first power source being a direct current (DC) negative voltage in order to reduce a plasma potential of said plasma or to reduce electron temperature of said plasma or both.

10031945

15385085

1. A method, comprising: determining, by a computer processor, a set of non-redundant features associated with a dataset, wherein determining the set of non-redundant features comprises: determining a correlation metric between a first feature and a second feature; determining that the correlation metric satisfies a threshold value; determining that the first feature has a larger mean correlation with respect one or more features in the set of non-redundant features than the second feature; and including the first feature in the set of non-redundant features and excluding the second feature from the set of non-redundant features based at least in part on the first feature having the larger mean correlation; determining, by the computer processor, a set of one or more feature subspaces, wherein each feature subspace comprises a respective at least one feature from the set of non-redundant features; determining, by the computer processor, a set of one or more candidate exploratory actions, wherein each candidate exploratory action comprises a respective feature subspace and a respective instance of a respective outlier detection algorithm; determining, by the computer processor, an optimal subset of one or more exploratory actions from among the set of one or more candidate exploratory actions; executing, by the computer processor, at least one exploratory action in the optimal subset to obtain outlier data; processing, by the computer processor, the outlier data to obtain one or more outlier views; and presenting, by the computer processor, the one or more outlier views via one or more user interfaces.

4333341

06157662

1. An apparatus for measuring the acceleration of gravity comprising: an elongated container, mounted with its longitudinal axis vertical, and having an opening in its top; a capillary tube extending through the opening in the top and being vertically adjustable so that the distance between the end of the tube within the container and bottom of the container may be varied; a reservoir containing mercury connected to the other end of the capillary tube by a conduit providing a pressure head at the other end of the capillary; means for varying the pressure head; means for sensing departure of a drop of mecury from the end of the tube within the container and sensing arrival of the drop at a fixed point a known distance from the end of the tube; and means for measuring the time interval between the departure and arrival of the drop of mecury.

7987417

11800236

1. A computer system for detecting a template, comprising: a web page template detector for performing page-level template detection on a web page; a web page template classifier operably coupled to the web page template detector for identifying a web page template of the web page; a storage operably coupled to the web page template detector for storing a plurality of templateness scores assigned by the web page template classifier for nodes of the web page; and an isotonic smoothing engine operably coupled to the web page template detector for smoothing the plurality of templateness scores using generalized isotonic regression on a tree.

8886202

13216697

1. A method for an Operation, Administration and Maintenance (OAM) entity in a mobile communication network which is divided into different tracking areas, the OAM is configured with a northbound interface Itf-N or a private interface Itf-S, the OAM exchanges information with other network entities through the northbound interface Itf-N or the private interface Itf-S, wherein the OAM is configured to add a new base station to a tracking area, comprising: obtaining geographic location information of the new base station through the northbound interface Itf-N or the private interface Itf-S by the OAM, distance from the new base station to a neighboring base station, and paging capacity of tracking areas which are around the new base station; and adding the new base station to a tracking area with smallest paging capacity according to the geographic location information of the new base station, the distance from the new base station to the neighboring base station, and the paging capacity of the tracking areas which are around the new base station.

20090119236

12170335

1. A neural network comprising a plurality of neurons, the plurality of neurons comprising a plurality of elemental neurons and a plurality of structural neurons; all elemental and structural neurons being able to be associated via active connections; all elemental neurons being able to express their elemental values, and all structural neurons being able to express a pair of neurons with which they associate.

20040014558

10423926

1. A control apparatus for an automatic transmission of a vehicle including a gear ratio calculating unit for controlling the automatic transmission to transfer an output of an engine of the vehicle to driven wheels after changing the gear ratio, and calculating the gear ratio, and a speed-change control unit for controlling the gear ratio based on the result of the calculation, comprising: a target driving torque generating unit for generating a value of the target driving torque based on a adaptation coefficient indicative of a running state and a vehicle speed, a driving torque calculating unit for calculating a value of driving torque based on the adaptation coefficient, the vehicle speed and the engine speed, a correcting unit for obtaining a correcting value for correcting the value of the target driving torque based on the value of the driving torque calculated by said driving torque calculating unit and correcting the target driving torque, a gear-ratio-change-command unit for generating a gear-ratio-change-command based on the correction value obtained by said correcting means and commanding the change in the gear ratio, wherein said speed-change control unit changes the gear ratio based on the gear-ratio-change-command from the gear-ratio-change-command unit.

20060262846

10569126

1. A data encoding system including an encoder for receiving input data and generating corresponding encoded output data, the encoder including digital processing means for processing said input data to generate for each input therein a plurality of corresponding data layers including at least one basic layer and at least one enhancement layer, and encoding means for receiving said data layers and generating therefrom the encoded output data, said encoding means further comprising block selecting means for selecting one or more sub-regions of said at least one enhancement layer and modelling said one or more sub-regions for representation thereof in the output data by way of descriptive model parameters.

7827529

11291184

1. A method of generating a distribution of performance ratios between multiple computer systems, the method comprising: in a system that includes at least one microprocessor, application-specific integrated circuit, or programmable logic device: for each computer system, obtaining results from multiple tests configured to test performance of the computer systems; for each of the multiple tests, calculating a ratio between the computer systems' test results, wherein calculating the ratio involves dividing a result or a combination of results from a first computer system from the multiple computer systems for a given test by a result or a combination of results from a second computer system from the multiple computer systems for the given test; weighting one or more of the calculated ratios relative to an expected use of the computer systems by a user; generating a histogram from the calculated ratios to indicate a distribution of the calculated ratios; and from the histogram, predicting a probability of an expected level of performance of one of the computer systems compared to another of the computer systems.

20140280035

13828196

1. A method for generating an execution plan for a query in a relational database system, comprising: generating one or more initial logical representations of the query; performing an exploration process around each of the one or more initial logical representations of the query, the performing of the exploration process around a particular initial logical representation of the query comprising applying transformation rules to generate one or more additional logical representations of the query that are logically equivalent to the particular initial logical representation of the query and that are within a maximum allowable transformation distance of the particular initial logical representation of the query; generating one or more execution plans for each initial logical representation of the query and each additional logical representation of the query; and selecting an execution plan from among the generated execution plans.

8357848

12975321

1. A method for evaluating and scoring the vocal and rhythmic delivery of words and syllables by means of one or more computer devices and one or more optional communication networks, the method comprising the steps of: capturing a user's voice signals as they are performing or through a recorded performance; invoking a stored evaluation policy that is independent of and not based on any pre-recorded vocal performance of another, said evaluation policy specifying one or more evaluation methods to apply to the captured voice signals analyzing said voice signals according to the invoked evaluation policy specified methods; and invoking a stored scoring policy that is independent of and not based on any pre-recorded vocal performance, said scoring policy specifying scoring methods to apply to evaluated voice signals, including a method of assigning a score value based on a rhyming of lyrics in the user's performance.

20130267427

13908813

1. A method of analyzing a plurality target nucleic acids in each cell of a population, the method comprising the steps of: providing multiple reactors each containing a single cell in a polymerase cycling assembly (PCA) reaction mixture comprising a pair of outer primers and one or more pairs of linking primers specific for tire plurality of target nucleic acids; performing a PCA reaction in the reactors to form, fusion products of the target nucleic acids in the reactors; and sequencing the fusion products from the reactors to identify the target nucleic acids of each cell in the population.

20090138505

11944962

1. A method comprising: defining a plurality of criteria; analyzing a group of media content items with respect to the plurality of criteria to provide analysis results; programmatically assigning weights to the plurality of criteria as a function of the analysis results; and scoring at least one media content item as a function of the weights assigned to the plurality of criteria.

20140052729

14113555

1. A continuous query result estimator for use in a data stream management system to reduce data stream processing times, the data stream management system being configured to execute a continuous query against data items received via at least one input data stream to generate at least one output data stream, the continuous query result estimator comprising: a classification module configured to classify a set of at least one data item received via the at least one input data stream into one of a plurality of input data groups; a data store configured to store, in association with each of the input data groups, a respective rule for estimating a result of executing the continuous query against a data item belonging to the input data group; and a result estimation module configured to: select a rule from the rules stored in the data store on the basis of the classification performed by the classification module; and apply the selected rule to the received set of data items to generate an estimate for a result of executing the continuous query against the received set of data items.

7698062

11332187

1. A method of identifying a most convenient point of interest for a traveler traveling along a route to a destination, comprising the steps of: identifying a location of a cellular telephone of the traveler; receiving a traveler-specified type of point of interest indicating the type of point of interest the traveler wishes to go to while traveling to the destination; receiving from the cellular telephone via a wireless cellular network traveler-specified convenience criteria, wherein the traveler-specified convenience criteria comprises a maximum amount of desired time before the point of interest is reached; searching through a network server database containing points of interests and their locations for points of interest of the type specified by the traveler meeting the traveler-specified convenience criteria; and providing via the wireless cellular network to the cellular telephone of the traveler instructions to travel to at least one of the points of interest identified in the searching step if the searching step resulted in finding at least one point of interest meeting the convenience criteria.

5404402

08167782

1. A secure processor comprising: clock means for providing a clock signal; means for modulating said clock signal by a random signal to produce a random stream of clock pulses; and a microprocessor clocked by said stream of clock pulses for processing data in accordance with a security algorithm.

8631039

12773889

1. A computer-implemented method for normalizing an in-memory representation of stored data for faster superscalar processing, the method comprising: accessing stored data that includes multiple columns, each column having a data type; selecting a column in the accessed data to determine an appropriate in-memory representation; determining a data type of the selected column; determining whether row data associated with the selected column can be normalized based at least in part on the determined data type of the selected column; determining a fixed size value for a normalized data representation, wherein the fixed sized value is sized such that it can be processed by a superscalar processor as a single instruction; and upon determining that the row data can be normalized, converting the row data associated with the selected column into the normalized data representation, wherein the normalized data representation is a format that allows performing parallel processing of multiple instances of the normalized data representation using the superscalar processor and that represents multiple data types as the determined fixed size value that can be processed by the superscalar processor in the single instruction, wherein the preceding steps are performed by at least one processor.

20080235208

11690328

1. A computer-implemented method of using previously acquired search results to perform a new search using a computer, the method comprising: accessing a database of search terms and user selection clicks on retrieved documents; calculating a matrix X, wherein matrix X is defined as a matrix having rows corresponding to rows of the database and columns corresponding to search terms in the database row; calculating a vector Y, wherein Y is defined as a representation of a document chosen by a user corresponding to a row of the database; calculating B vector values using the X matrix, the Y vector, and an iteratively reweighted least squares (IRLS) method, where the IRLS method executes in a time proportional to a time complexity function of O(d*k*k+i max *a 2 ), where k is the average number of nonzero elements per row in X, d is the number of data point rows in X, a is the number of columns in X and i max is a constant; storing the B vectors; receiving a new set of search terms and generating a corresponding search vector z; calculating the dot product of B and z to produce weighted scalar values of relevant documents in the database; and ordering the relevant documents in the database using the weighted scalar values; and displaying, on a computer monitor, an ordered list of the relevant documents corresponding to the new set of search terms.

8053191

11897939

1. A method for assembling nucleic acid segments, the method comprising providing a first and second population of nucleic acids, each population having at least a first, second, third and fourth restriction sites, wherein each population comprises at its 5′ end a 5′ activation sequence located between the first and second restriction sites and at its 3′ end a 3′ activation sequence located between the third and fourth restriction sites; generating a first population of nucleic acid segments having the 5′ activation sequence but lacking the 3′ activation sequence by digesting the first population of nucleic acids using a first set of restriction enzymes that cleave the nucleic acids at the first and third restriction sites; generating a second population of nucleic acid segments having the 3′ activation sequence but lacking the 5′ activation sequence by digesting the second population of nucleic acids using a second set of restriction enzymes that cleave the nucleic acids at the second and fourth restriction sites; combining the first and second populations of nucleic acid segments with a first linearized nucleic acid vector that is digested with one or more restriction enzymes that produce restriction site overhangs that are complementary to the overhangs generated by the first and fourth restriction enzymes on the first and second populations of nucleic acid segments, wherein the first linearized nucleic acid vector comprises (i) at its 3′ end a coding sequence of a first marker gene 5′ of the first restriction site, and (ii) at its 5′ end a coding sequence of a second marker gene 3′ of the fourth restriction site, and isolating ligated first nucleic acid vectors that express the first and the second marker genes, wherein expression of the first and the second marker genes is indicative of correct assembly of the first and second populations of nucleic acid segments and wherein expression of the first marker gene is regulated by the first activation sequence and expression of the second marker gene is regulated by the second activation sequence.

7860724

10283529

1. A system for optimized management of workflow associated with fulfillment of medication prescription orders in a personnel-driven pharmacy operation, and for minimizing a pharmacy workflow cost function associated with the fulfillment of the prescription orders, the pharmacy including at least two separate and different storage devices each having at least one medication storage location associated therewith, each medication storage location configured to store at least one medication, the system comprising: a control computer electronically connected to a pharmacy information system, said control computer configured to receive the prescription orders provided by the pharmacy information system and being programmed to perform the workflow optimization, said control computer including: a medication inventory database for describing the medications stored at each storage location within the pharmacy; a prescription order database for storing the received prescription orders; wherein the control computer is configured to select the medication storage location from which to obtain the medication required to fulfill each prescription within the prescription order; wherein the control computer is configured to determine a prescription sequence corresponding to the sequence in which each prescription is fulfilled, first to last, within the prescription order, the prescription sequence determined to minimize the cost function associated with fulfillment of the prescription order; wherein the control computer is configured to present, in human-readable form, the prescription sequence for the prescription order and the storage location for each sequenced prescription within the prescription order to direct the personnel to the storage locations, first to last, according to the prescription sequence; and wherein the control computer is configured to generate a print-label command; and a label printer electronically connected to the control computer configured to print a label including prescription information and machine-readable indicia for each sequenced prescription responsive to the print-label command, said label for application to a container for each prescription within the prescription order.

8654866

13705131

1. A digital subscriber line communication system, the communication system comprising: a digital subscriber line access multiplexer (DSLAM) for distributing a near end crosstalk (NEXT) model of anticipated disturbance from neighboring disturber subscriber lines; and at least one modem having a transmit path and a receive path and coupled to the DSLAM, the modem using the distributed NEXT model to adjust a dynamic range of an analog portion of the receive path.

9691026

15076560

1. An electronic device comprising: a first data storage configured to store a plurality of data sets based on multiple data sources, wherein the plurality of data sets include services related data; an aggregation engine configured to combine data from the plurality of data sets into one or more aggregated data sets wherein the combination is based on categories associated with the one or more data sets; a pre-computation engine configured to analyze the plurality of data sets, wherein the analysis generates analytics or intermediate models based on the one or more data sets; a training set generator configured to provide one or more training sets related to the plurality of data sets, wherein the training sets are based on known values; a model builder configured to: determine, using a combination of at least two of the services related data, the analytics or intermediate models, the aggregated data sets, and the one or more training sets, one or more services provided by one or more service providers; generate one or more models, wherein the one or more models provide a mapping of at least one service to one or more service providers; evaluate the one or more models based on known values; and store, in a second data storage device, an expertise indication based on the one or more models, for providing to a graphical user interface in response to a search requested using a graphical user interface for at least one service provider associated with a specified service.

20070288495

11423924

1. A database design tuning system comprising the following computer-implemented components: an interface component that acquires a database schema; and a logical tuner component that automatically optimizes the schema for performance with respect to a workload.

9111547

13591489

1. A method for determining a semantic concept associated with an audio signal captured using an audio sensor, comprising: receiving the audio signal from the audio sensor; using a data processor to automatically analyze the audio signal using a plurality of semantic concept detectors to determine corresponding preliminary semantic concept detection values, the semantic concept detectors being associated with a corresponding plurality of semantic concepts, each semantic concept detector being adapted to detect a particular semantic concept; using a data processor to automatically analyze the preliminary semantic concept detection values using a joint likelihood model to determine updated semantic concept detection values; wherein the joint likelihood model determines the updated semantic concept detection values based on predetermined pair-wise likelihoods that particular pairs of semantic concepts co-occur; identifying one or more semantic concept associated with the audio signal based on the updated semantic concept detection values; and storing an indication of the identified semantic concepts in a processor-accessible memory; wherein the semantic concept detectors and the joint likelihood model are trained together with a joint training process using training audio signals, at least some of which are known to be associated with a plurality of semantic concepts, and wherein each of the semantic concept detectors determines the preliminary semantic concept detection values responsive to an associated set of audio features, the audio features being determined by analyzing the audio signal.

7844946

11535205

1. A method comprising: translating a source instruction construct to form a first transactional objective instruction construct; executing the first transactional objective instruction construct; intercepting an aborted transaction associated with the executed first transactional objective instruction construct when a conflict is detected; maintaining a graph of nodes and edges associated with the executed first transactional objective instruction construct to predict a deadlock situation; resolving the predicted deadlock situation associated with the first transactional objective instruction construct based on the graph; and identifying the source instruction construct as a candidate for translation prevention in response to the conflict associated with the first transactional objective instruction construct.

8560319

12008912

1. A method of classifying a segment of a multimedia program as one of a news segment and a commercial segment, comprising: (a) receiving an audio portion of the multimedia segment; (b) sampling the audio portion at a predetermined rate; (c) combining a predetermined number of samples into a clip; (d) determining a plurality of signal property features of the clip, the signal property features including a smooth pitch ratio; (e) analyzing the plurality of signal property features of the clip using a linear approximation algorithm, the linear approximation algorithm being a hard threshold classifier algorithm wherein it is determined whether each of the plurality of signal property features of the clip satisfies a respective threshold value; and (f) characterizing the clip as the commercial segment if all of the plurality of signal property features of the clip satisfy the respective threshold value, and characterizing the multimedia program segment as the news segment if at least one of the plurality of signal property features of the clip does not satisfy the respective threshold value.

20130007268

13608400

1. A method for enabling monitoring across one or more domains, wherein the method comprises: identifying information technology resources across one or more domains; collecting information technology dependency information relating to the information technology resources identified across one or more domains; collecting monitoring data from the information technology resources identified across one or more domains; and using the dependency information to aggregate the monitoring data into one or more pre-determined metrics.

20130130219

13476877

1. A method for providing a dynamic continual improvement educational environment for a user, the method comprising: designing dynamic educational content for presentation to the user, wherein concepts of the educational content are graphically linked in a relational order; selectively implementing the presentation of the educational content to the user, wherein the presentation is automatically adapted to a learning pace of the user; and iteratively implementing at least a portion of the presentation to the user over an extended period of time to maintain the user's understanding of the educational content.

8504035

13291730

1. A method comprising: receiving mobile phone operational data indicative of user equipment location, the mobile phone operational data comprising location area update messages and periodic registration messages: filtering the mobile phone operational data based on time and area to select a portion of user equipment location information to produce filtered mobile phone operation data; performing travel estimation based on the filtered mobile phone operation data, including performing interpolation on data associated with one or more individuals in a population to estimate intermediate positions of a trajectory of each of the one or more individuals for a specified time period using a shortest path estimation algorithm that determines a shortest path between pairs of points based on geographic information associated with the user terminals, weights associated with geographic areas, and probabilities associated with likelihoods of a user terminal moving between geographic areas; and counting a number of individuals in population at a given time and at a given area.

8515736

12894752

1. A computer-implemented method of semantic classification, the computer-implemented method comprising: receiving, at a computerized training manager, a first utterance for use in training a first computerized semantic classifier, the first computerized semantic classifier having a set of manually-created semantic classes for labeling transcribed utterances, the first utterance being a transcribed utterance manually classified in a first semantic class within the set of manually-created semantic classes; semantically labeling the first utterance by a second computerized semantic classifier, the second computerized semantic classifier being a previously-trained computerized semantic classifier; semantically labeling existing utterances by the second computerized semantic classifier, the existing utterances accessed from a database of existing utterances, the database of existing utterances containing transcribed utterances used to train previously-trained computerized semantic classifiers; identifying, by the computerized training manager, existing utterances that are semantically similar to the first utterance based on semantic labeling from the second computerized semantic classifier; and training, by the computerized training manager, the first computerized semantic classifier using the semantically similar existing utterances.

20120296676

13274869

1. A computerized method of transforming disparate data for use in rendering a decision involving a potentially insurable risk, said method comprising: receiving data from a plurality of sources, said data being in a plurality of formats; extracting the received data and converting the extracted data into one or more standard formats; filtering the converted data by relevancy to the decision to be rendered; generating presentable knowledge from the converted data; presenting the knowledge to a decision-making entity for rendering the decision; monitoring one or more actions on the presented knowledge by the decision-making entity; and adjusting one or more of said extracting, converting, filtering, and generating as a function of the monitored actions.

20170046535

14821860

1. A method of improving privacy-protection during the exchange of STD test results, the method comprising: importing STD test results and identification information of the individual user; importing business and business identification information of the establishment user; the user selecting presets for STD-related criteria and minimum requirements for the exchange of STD test results to occur; the user manually inputting user-definable criteria and minimum requirements; the establishment user inputting user-definable criteria and minimum requirements; the user attempting to exchange STD test results with other users; displaying percentages of criteria met after adjusting for criterion weight functions if all involved parties meet all users' minimum requirements; and displaying STD test results only if all users allow the exchange of STD test results; thereby improving the privacy-protection of the exchange of STD test results.

20120059702

13198493

1. A computer-implemented method, comprising: receiving, in a portal of a transaction handler, an input specifying a set of users; identifying, by a computing apparatus, a set of triggers, each of the triggers identifying a set of one or more conditions which, when satisfied by a transaction processed by the transaction handler for a user in the set, cause transmission of a message to the user; and ranking, by the computing apparatus, the triggers based at least in part on transaction data of the users recorded by the transaction handler to generate a ranked list of the triggers.

8656376

13223489

1. A method for providing intrinsic supports for a digital signal processing (DSP) processor with very long instruction word (VLIW) architectures and distributed register files, the DSP processor comprising a plurality of clusters, each cluster comprising a plurality of functional units, a plurality of local register files connected to one of the plurality of functional units, and at least one global register file, each of the at least one global register files comprising a plurality of global banks connected to one of the plurality of functional units, the method comprising the steps of: generating a program representation with cluster information on instructions of the DSP processor, wherein the cluster information is provided by a program with cluster intrinsic coding; identifying data stream operations indicating parallel instruction sequences applied on different data sets in the program representation; identifying data sharing relations indicating data shared by the data stream operations in the program representation; identifying data aggregation relations indicating results aggregated from the data stream operations in the program representation; and performing register allocation for the DSP processor according to the identified data stream operations, the data sharing relations and the data aggregation relations, wherein the step of performing register allocation comprises a sub-step of: performing register bank assignment for the plurality of local register files and the at least one global register file; performing data replication for paralleling accessing; and performing physical register assignment.

20150051910

13969825

1. A natural language understanding system using at least one hardware implemented computer processor for automatic unsupervised clustering of dialog data from a natural language dialog application, the arrangement comprising: a log parser configured to extract structured dialog data from application logs; a dialog generalizing module configured to automatically generalize the extracted dialog data using different independent generalization methods to produce a generalization identifier vectors aggregating the results of the generalization methods used; and a data clustering module configured to automatically clustering the dialog data based on the generalization identifier vectors using an unsupervised density-based clustering algorithm without a predefined number of clusters and without a predefined distance threshold.

10095757

14961502

1. A computer-implemented method comprising: an engine receiving time series data; the engine referencing a first input to create from the time series data, a first representation comprising a covered time period, a compression model, an error bound, and a storage medium, wherein the configuration designates the first representation as lying within a hot zone; the engine storing the first representation within the storage medium; the engine referencing a second input to create from the time series data, a second representation differing from the first representation in at least one of the covered time period, the compression model, the error bound, and the storage medium; and the engine storing the second representation, wherein: the second input comprises a vertical configuration determined according to a cost model of an advisor component; and a second time period of the second representation overlaps the covered time period of the first representation.

9658948

14501288

1. A computer implemented method of analyzing a system comprising a plurality of workloads comprising a plurality of software system modules, the method comprising: storing historical defects of ones of the plurality of software system modules for which defect fixes have been provided; storing risk criteria of the historical defects and the defect fixes; executing at least one of a plurality of test cases comprising test case software that, when run on the software system, tests the software system; capturing a log of test case execution modules comprising software system modules that are accessed during said executing; developing, by a processor, a risk score database comprising risk scores for the plurality of software system modules for which defect fixes have been provided, wherein the risk scores are based at least in part on the risk criteria; generating, by said processor, workload maps comprising intersections between said log of test case execution modules and said risk scores for at least some of the plurality of software system modules; and based at least in part on said workload maps, generating data that identifies a prioritization of the plurality of test cases.

7567889

10524551

1. A system for generating codebook objects for an artificial neural network from input data comprising: a processor; a memory coupled to the processor; computer code loaded into the memory for executing on the processor, for implementing the following functionality: (a) providing data objects to be processed as input data and providing data objects of exploration space; (b) generating a topology-preserving mapping, by: (i) ordering neurons in ordering space, according to a given pattern; (ii) assigning codebook objects in outcome space to the neurons; (iii) processing codebook objects according to the calculation rule of a topology-preserving mapping, by use of data objects of the exploration space; and (iv) outputting the processed codebook objects as output data; (c) determining the order of neurons in the ordering space by using at least a part of the provided data objects, and (d) providing data objects of the exploration space which are independent of the input data.

6115631

09215401

1. A method of determining the probability of ruminating behavior in a person of known age, sex and use of medication, using an electroencephalographic machine operable for reading human brain waves, a computer operable for receiving the output of said electroencephalographic machine, a device operable to display a paradigm of a pre-selected design, illumination, and frequency, said computer also capable of synchronizing the recording and averaging said brain waves when the paradigm is illuminated, which comprises: attaching the electrodes of an electroencephalographic machine to the scalp of said person in accordance with the American Electroencephalographic Society's Electrode Placement International 10-20 Standard System for measuring a person's brain waves; positioning said person to view a paradigm to visually evoke a potential in said person's brain; displaying to said person a plurality of sequentially displayed paradigms and simultaneously measuring the brain waves of said person for each of the displayed paradigms during the time of display; averaging said brain waves to determine the visually evoked response to said displays of said paradigms; measuring the maximum amplitude, in microvolts, of said visually evoked response at a plurality of points in time over approximately 500 ms of time after termination of each of the displays of said paradigms; transmitting to said person a plurality of audio signals and simultaneously measuring the brain waves of said person for each of the audio signals during the time said auditory signals are being transmitted; averaging said brain waves to determine the auditory evoked response to said transmissions of said audio signals; measuring the maximum amplitude, in microvolts, of said auditory evoked response at a plurality of points in time over approximately 500 ms of time after termination of each of the transmissions of said audio signals; conducting and recording the quantitative electroencephalographic activity of said person; measuring the amplitude of said quantitative electroencephalographic activity; conducting a logistic regression analysis of said visually evoked response over a period of time of approximately 500 ms after termination of each of said displays of said paradigm, said auditory evoked response over a period of time of approximately 500 ms after termination of said transmission of said audio signals, said electroencephalographic activity, and said person's age, sex, and whether said person is taking medication, to establish a predictive algorithm; and computing the probability of ruminating behavior using said algorithm.

9773382

14569086

1. A computer-implemented method for providing increased wagering flexibility to an individual bettor in the process of making a multiple armed event wager from an electronic wager input device having a display, the method comprising steps of: providing and accessing a wagering system of the type including a central computer system accessible by at least one network terminal in bi-directional electronic communication therewith via an electronic network and having a bettor viewable display, the central computer hosting an executable instruction set for computing intermediate odds between a minimum odds value and a maximum odds value as a function of bettor-controlled modification and redistribution of equal starting shade values associated with respective individual arms of said multiple armed event wager used to determine whether the bettor has won a respective individual arm of said multiple armed wager; selecting a plurality of teams by said bettor via said display, each selected team associated with an individual one of said events, to thereby establish a multiple team combined wager; determining baseline odds for said multiple armed wager, said baseline odds based upon application of said equal starting shade values to each of the selected plurality of teams competing in the respective events; defining a maximum point value by which the line of an individual team can be shaded; defining a point increment value by which the shaded points can be adjusted; calculating a minimum odds value of all teams winning, for purposes of the wager, when a maximum positive shade is applied to the initial line of every team included in the wager; calculating the maximum odds of all teams winning, for purposes of the wager, when a maximum negative shade is applied to the initial line of every team included in the wager; choosing, by said bettor via said display, a quantity of points to shade the initial lines of each of said respective selected teams and choosing a positive or negative shading direction in which to apply said chosen quantity of points to each said starting line, wherein said step of choosing results in a bettor-defined redistribution of said chosen quantity of points; combining the chosen quantity of points shaded for each team to obtain a total point shade value; calculating, as a function of the total point shade value, respective revised odds for the wager, the revised odds for the wager being intermediate of the respective calculated minimum and calculated maximum odds values; and placing the wager at the calculated revised odds.

20140244980

13775678

1. A method implemented on at least one machine each having at least one processor, storage, and a communication platform connected to a network for dynamic control of a processing system having a plurality of tiers, the method comprising: obtaining queue lengths of a plurality of nodes in one of the plurality of tiers; receiving a control objective from a higher tier, wherein one or more requests from the higher tier are processed by the plurality of nodes in the tier; computing a control model of the tier based on the received queue lengths, wherein one or more parameters of the control model are adjusted based on the received control objective; and determining at least one control action based on the control mode and the control objective.

9547571

14717608

1. A method for determining a health of a block of memory comprising: programming, by a command issued by a memory controller, a dummy wordline with a known data pattern, wherein the dummy wordline acts as a buffer for normal wordlines; reading from the dummy wordline; comparing the read out with the known data pattern; determining whether any errors between read out and the known data pattern exceed a threshold; and adjusting read parameters based on the errors.

20030045806

09423951

1. A mattress for monitoring patient movement for a patient lying on the mattress, the mattress including at least a plurality of independent like movement sensors for measuring movement at different locations on the mattress to generate a plurality of independent movement signals.

9652328

14274829

1. A computer program product for restoring an application from a kernel dump file, the computer program product comprising: one or more computer-readable storage media and program instructions stored on the one or more computer-readable storage media, the program instructions comprising: program instructions to identify an application that was running at a time of a system crash; program instructions to receive a kernel dump file that was created responsive to the system crash; program instructions to determine a restoration dataset stored in the kernel dump file; program instructions to determine, based on the restoration dataset, if data generated by the application at the time of the system crash was paged out to swap space; program instructions, responsive to determining data generated by the application at the time of the system crash was paged out to swap space, to extract swap space information; and program instruction to restore the application based, at least in part, on the restoration dataset and the swap space information, wherein the application is restored to the state it was in at the time of the system crash.

8204727

12561854

1. A computer-implemented method for use in modeling a geomechanical reservoir system, comprising: receiving, through a computer system, data indicative of physical properties associated with the geomechanical reservoir system; generating, through a computer system, fracturing predictions by solving a system of partial differential equations that model the geomechanical reservoir system; wherein the system of partial differential equations comprises a reservoir flow model, a geomechanical model, and a fracture model of the geomechanical reservoir system; wherein the system of partial differential are coupled through a fully-expanded Jacobian; wherein the solving of the system of partial differential equations comprises solving simultaneously in a single timestep the fully-expanded Jacobian based upon the received physical properties data; and wherein the fracturing predictions model the geomechanical reservoir system for the timestep; and outputting or displaying, through a computer system, the generated fracturing predictions.

10127085

14650747

1. A method for scheduling a task in cloud computing, comprising: parameterizing, by a cloud computing task scheduling system, feature information of the task, wherein the feature information comprises at least one of: Central Processing Unit (CPU), memory, bandwidth, resource cost and reciprocal of a failure rate; classifying, by the cloud computing task scheduling system, the task according to a priority of the task or a judgment index for executing the task, if the task has no priority; performing, by the cloud computing task scheduling system, a computation through a Bacteria Foraging Optimization Algorithm (BFOA) according to a classification result to determine a best working node; and executing the task by the best working node; wherein performing the computation through the BFOA algorithm according to the classification result to determine the best working node comprises: encoding the parameterized feature information of the task according to the classification result to obtain encoded feature information, and recording the encoded feature information of the task to a task information database; selecting N working nodes to form an initial bacterial colony, wherein each node of the N working nodes selected serve as bacterial individual i of the initial bacterial colony, where 1≤i≤N; decoding respectively the encoded feature information corresponding to each bacterial individual according to an algorithm decoder library; computing a fitness value of the each bacterial individual, wherein the fitness value for a current bacterial individual is computed after a taxis operation is performed on the current bacterial individual; performing a taxis operation on the each bacterial individual, wherein performing the taxis operation for a current bacterial individual comprises evaluating a current position of the current bacterial individual based on computing its fitness value, rotating the current bacterium individual to randomly generate an initial step of swimming, determining whether the fitness value of the new position is better, and when it is better, performing a quorum sensing operation on the each bacterial individual of the bacterial colony to allow the bacterial individual to sense the environment around to test whether the bacteria individual is in the best position in the bacterial colony; performing a duplication operation on the each bacterial individual, wherein performing the duplication operation comprises sequencing bacteria individuals according to priority of fitness values, eliminating half of the bacteria individuals of the bacteria colony having poor fitness values, and generating new bacteria individuals by duplicating the remaining bacteria individuals; performing a migration operation on the each bacterial individual in response to a bacterial individual of the bacterial colony satisfying a predefined migration probability, wherein performing migration operation comprises the bacterial individual dying out, and randomly generating a new bacteria individual in any position of a solution space, which may be more close to a global best solution and more favorable for the taxis operation to escape from a local best solution; determining whether a best bacterial individual obtained currently meets a user expectation value; in response to determining that the best bacterial individual obtained currently meets the user expectation value, selecting a working node corresponding to the best bacterial individual obtained currently as the best working node; and in response to determining that the best bacterial individual obtained currently not meeting the user expectation value, returning to a step of computing the fitness value of the each bacterial individual; wherein computing the fitness value of the current bacterial individual after the taxis operation is performed on the current bacterial individual i further comprises: ⁢ J i ⁡ ( j + 1 , k , l ) = J i ⁡ ( j , k , l ) + J cc ⁡ ( θ i ⁡ ( j + 1 , k , l ) , P ⁡ ( j + 1 , k , l ) ) J cc ⁡ ( θ , P ⁡ ( j , k , l ) ) = ∑ i = 1 N ⁢ J cc ⁡ ( θ , θ i ⁡ ( j , k , l ) ) = ∑ i = 1 N ⁢ [ - d attr ⁢ exp ( - w attr ⁢ ∑ m = 1 D ⁢ ( θ m - θ m i ) 2 ] + ∑ i = 1 N ⁢ [ h rep ⁢ exp ( - w rep ⁢ ∑ m = 1 D ⁢ ( θ m - θ m i ) 2 ] ⁢ P ⁢ ( j , k , l ) = { θ i ⁡ ( j , k , l ) | i = 1 , 2 , … ⁢ ⁢ S } where, J i (j,k,l) is a fitness value of a bacteria individual i after a jth taxis operation, a kth duplication operation and Ith migration operation; J cc (θ i (j+1,k,l),P(j+1,k,l)) is an inter-individual sensitivity value of the bacterial individual i; θ i (j+1,k,l is an updated position of the bacteria individual i after a (d−1)th taxis operation; P(j+1,k,l) is an individual position of the bacteria individual i in the bacterial colony after a (d−1)th taxis operation; P(j,k,l) is an individual position of the bacteria individual i in the bacterial colony after a jth taxis operation; d attr and w attr represent a quantity and a releasing velocity of an attractive factor respectively; h rep and w rep represent a quantity and a releasing velocity of a repelling factor respectively; ∑ i = 1 N ⁢ [ - d attr ⁢ exp ( - w attr ⁢ ∑ m = 1 D ⁢ ( θ m - θ m i ) 2 ] represents cybotaxis influence, on the bacterial colony, brought by a position where a ith bacterium individual locates; exp ( - w attr ⁢ ∑ m = 1 D ⁢ ( θ m - θ m i ) 2 represents a coefficient of the cybotaxis influence, on the bacterial colony, brought by the position where the ith bacterium individual locates; ∑ m = 1 D ⁢ ( θ m - θ m i ) 2 represents a variance of the position where the ith bacterium_individual locates; θ m represents a mth dimension of the position where the bacterial colony locates; θ m i represents a mth dimension of the position where the ith bacterium individual locates; D represents the number of dimensions of a bacterial search environment; ∑ i = 1 N ⁢ [ h rep ⁢ exp ( - w rep ⁢ ∑ m = 1 D ⁢ ( θ m - θ m i ) 2 ] represents repelling influence of the position where the ith bacterium individual locates on the bacterial colony; and exp ( - w attr ⁢ ∑ m = 1 D ⁢ ( θ m - θ m i ) 2 represents a coefficient of the repelling influence of the position where the ith_bacterium locates on the bacterial colony.

20150080767

14551882

1. A method to automatically derive answers to the questions of two clinical functional assessment instruments activities of daily living (ADLs), and all but one of the instrumental activities of daily living (IADLs) relying on sensors targeting the side-effects of the activities, said method comprising: date and time stamping sensor firings; and setting a set of rules method where the spatio-temporal relationships of sensor firings are examined and analyzed to infer the occurrence of activities of interest, wherein said rules include at least one of the following: a rule to automatically bathing/showering, a rule to automatically detect dressing, a rule to automatically detect toileting events, a rule to automatically detect the ability to ambulate (get out of bed/chair), a rule to automatically detect problems in controlling bladder and/or bowels, a rule to automatically detect the ability to feed oneself, a rule to automatically detect the ability to get to places outside of walking distance, a rule to automatically detect the ability to shop for groceries, a rule to automatically detect the ability to prepare meals, and a rule to automatically detect the ability to do house work.

9900270

14536710

1. A computer system comprising: one or more processors, one or more computer-readable memories, one or more computer-readable tangible storage devices and program instructions which are stored on at least one of the one or more computer readable tangible storage devices for execution by at least one of the one or more processors via at least one of the one or more computer readable memories, the program instructions comprising: program instructions to capture one or more instant messages exchanged among a plurality of participants as a conversation, wherein a conversation builder captures incoming and outgoing instant messages of the plurality of participants, and builds a conversation buffers for buffering the one or more instant messages; and program instructions to store the conversation as a record in a records management system, wherein the conversation includes message content of text-based instant message, voice-based instant message, and video-based instant message of the conversation, identification of the plurality of participants the one or more instant messages, current location of the plurality of participants of the one or more instant messages, and time the one or more instant messages was captured, in response to a determination that the buffered conversation meets a predetermined context based criteria, wherein the predetermined context based criteria is one of a sender-based criteria, keyword-based criteria, and a timing-based criteria defined by the participants for storing the conversation as a record in a records management, wherein frequency of keyword appearing in the one or more instant messages is identified, or detected and stored in the records management server, and wherein the timing based criteria provides transmission of relevant conversations of one or more instant messages exchanged between the participants, wherein the relevant conversations are transmitted to the records management server during certain hours, minutes, or time of day the one or more instant messages are exchanged.

6129681

08934595

1. An apparatus for analyzing information relating to physiological and psychological conditions comprising a neural network receiving a physiological fluctuation signal as an input and estimating psychological conditions based on frequency variations of the physiological fluctuation signal.

8923582

13485057

1. A method for computer aided detection, the method comprising: determining a pixel threshold value for an analysis of an image selected by a user, wherein the image includes a plurality of pixels; determining a segmentation setting for the analysis, the segmentation setting specifying a size of a portion of the image to be used during the analysis; analyzing, using a computer, the image by determining a difference between a first segment of the image and a second segment of the image and comparing the difference to the pixel threshold value and the segmentation setting; and identifying, using a computer, potential abnormalities in the image based on the analysis.

7818412

12147551

1. A method for determining which of a plurality of sensors to ping for information, comprising: determining a value of information for receiving data with respect to a first segment of a model of a phenomenon; and requesting data from at least one sensor amongst a plurality of sensors based at least in part upon the determined value of information and preferences for sharing data defined by at least one user that corresponds to the at least one sensor.

9703804

14615576

1. A computer-implemented method, the method performed by at least one processor and comprising: determining clusters of points of interest (POIs) within a geographic region; calculating popularity values for the clusters based on popularity data associated with the POIs included in the clusters; selecting, among the clusters, a cluster of POIs having a popularity value, of the popularity values, exceeding a threshold popularity value; determining a preliminary geographic boundary for the selected cluster based on a density percentage of the POIs from the selected cluster of POIs; comparing an area within the preliminary geographic boundary with a threshold amount of area, and setting the preliminary geographic boundary as a final geographic boundary when the area within the preliminary geographic boundary does not exceed the threshold amount of area; and storing data specifying an area of the final geographic boundary and a name of the selected cluster for display on a user device.

9082087

13204647

1. A system, comprising: a server in communication with a network and a database, and a software application stored on the server, the software application being executable by the server, and comprising computer instructions for: generating a custom revenue cycle model having a success path, the custom revenue cycle model including a plurality of stages and one or more transitions between different stages of the plurality of stages, wherein each of the plurality of stages is either a revenue stage or a detour stage, wherein the success path includes stages within the plurality of stages; receiving one or more transition rules from a user, where the received one or more transition rules define the one or more transitions between different stages of the plurality of stages, where each of the one or more transition rules controls movement of a lead along a corresponding transition from one stage to another stage within the custom revenue cycle model, wherein each of the one or more transition rules is defined by at least one trigger corresponding to one or more actions of the lead, wherein each of the one or more transition rules is mutually exclusive with respect to others of the one or more transition rules such that no more than one of the one or more transition rules controls movement of a given lead at a given time within the custom revenue cycle model; storing the custom revenue cycle model; observing one or more actions of one or more leads; generating, by an automated process, lead movements of the one or more leads between some of the plurality of stages by way of the one or more transitions based on the one or more transition rules, the lead movements generated by applying the one or more transition rules received from the user to the observed one or more actions of the one or more leads; tracking, by an automated process, the generated lead movements between different ones of the plurality of stages in the custom revenue cycle model; and generating a lead view interface for visual display on a display screen of a computing device, the lead view interface displaying the generated lead movements as tracked between different ones of the plurality of stages in the custom revenue cycle model.

20110150447

12643802

1. An apparatus for controlling automatic focus, comprising: (a) a computer processor configured for controlling an imaging device and associated focus control element; (b) memory coupled to said computer processor; and (c) programming stored in said memory and executable by said computer processor for carrying out an autofocusing process comprising: (i) capturing object images; (ii) estimating depth between captured image pairs to arrive at a depth estimation; (iii) determining a weighted mean of depth estimations and variance which spans both past and present depth estimations; (iv) adjusting focus with a focusing movement performed in response to said weighted mean of the depth estimations; and (v) repeating steps (i) through (iv) until said variance reaches a value that indicates sufficient confidence that a proper focus position has been attained.

20090006320

11950719

1. A method for applying a query to an event stream, comprising: storing one or more event constraints; performing constraint aware complex event processing on the query and the event constraints; and optimizing the query at run time.

8645293

12814043

1. A method of optimizing a plurality of objectives, the method comprising the steps of: initializing a set of simplices, wherein the step of initializing includes initializing (k−1)-simplices in a k-D space; selecting a simplex from the set of simplices; computing one or more weights based at least in part on the selected simplex; and generating a point on a tradeoff surface by utilizing the one or more weights in a weighted-sum optimization; wherein the initializing, selecting, computing and generating steps are performed via a processor device.

8180751

12263414

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

4570638

06542022

1. Apparatus for obtaining optical response data from selected body portions of individual subjects indicative of the intrinsic internal physiological state of tissue within such body portions, comprising: a manually-manipulatable test instrument having at least first and second component members mounted for movement relative to one another and support means disposed therebetween for holding such members in selected mutually spaced relative positions; said first component member including light source means for emitting selected light from said first member; said first component member being adapted to fit closely against a selected body portion from which clinical data is desired to be obtained, in a manner to project said emitted light into the interior of such body portion; light-receiving means carried by at least said second component member for receiving at least part of the light projected into said selected body portion; said support means including position-variable elements for movement of one of said component members relative to the other to change the nominal optical distance between said source and said light-receiving means; means operatively coupled between said light source means and said light-receiving means for measuring the particular length of said nominal optical distance at various positions of said relative movement which effects change in such distance; and means for producing signals for computation representative of the nominal optical distance determined by said length-measurement means.

20090262877

12104778

1. A method of reducing the generation of frequency spurs in the performance of a processing task normally performed within a reference clock period, said method comprising the steps of: dividing said task into a plurality of atomic operation computations for execution in a software loop; randomizing the execution of one or more atomic operations in each iteration of said software loop; and wherein said atomic operations are clocked using a processor clock having a frequency significantly higher than that of said reference clock.

20140146078

13685301

1. A non-transitory program storage device readable by a computer, tangibly embodying a program of instructions executed by the computer to perform the method steps for selecting an analysis procedure for a value series, the method comprising the steps of: displaying a value series on a computer display monitor; receiving one or more sequences of user provided annotations, wherein said annotations overlay at least a sub-interval of said value series on said computer display monitor; using said sequences of user provided annotations to select an optimal value series analysis method from a set of value series analysis methods, wherein selecting an optimal value series analysis method includes determining parameter values for said optimal value series analysis method; and presenting said selected optimal value series analysis method and parameters, and said optimal reconstruction of said annotation sequences to the user.

20030212572

10437547

1. A method of computing a patent valuation estimate of a patent monopoly over an applicable period comprising a plurality of subperiods, the method comprising the steps of: (a) determining a plurality of subperiodic incremental values of the patent monopoly, each subperiodic incremental value being associated with a different subperiod, by computing subperiodic differences between profits derived from goods covered by the patent monopoly under conditions of the patent monopoly and corresponding profits in a hypothetical environment without the patent monopoly; (b) determining discount interest rates for each subperiod of the applicable period, based on uncertainties associated with forecasting future revenues and risk of infringement of the patent monopoly; and (c) computing a discounted present value of the patent monopoly as aggregate present value of the subperiodic incremental values of the patent monopoly by discounting each of the subperiodic incremental values to present value using the discount interest rate of the subperiod associated with said each subperiodic incremental value, and aggregating the discounted subperiodic incremental values.

20140062886

13601898

1. An input method for a communication device having a processor, the method comprising: receiving an input string; ranking, by the processor, a predicted string associated with the input string, wherein the ranking depends on whether the input string is a substring of the predicted string and at least on one of a typing speed and a typing confidence; and displaying the ranked predicted string.

20160224902

14713205

1. A method for parallel Gibbs sampling from a plurality of discrete probability distributions, wherein the method comprises: receiving parameters for the plurality of discrete probability distributions; initializing a partial sums table based on a matrix product of the parameters, wherein the partial sums table comprises a plurality of blocks having a maximum size W that is 2 to a power of X; applying X iterations of butterfly patterned replacements to each of the plurality of blocks such that a last row of each of the plurality of blocks is un-transposed; drawing, in parallel from the plurality of discrete probability distributions, a respective plurality of z values, wherein the drawing performs a first binary search on the last row of the plurality of blocks to determine a candidate block and a second binary search within the candidate block to draw each of the plurality of z values; and wherein the method is performed by one or more computing devices.

20140379552

14314250

1. (canceled)

9118706

11772078

1. A method performed by one or more processors, the method comprising: creating, by the one or more processors, a project that includes one or more assessment criteria selected by a user from a plurality of assessment criteria; obtaining, from a plurality of different network security tools associated with the one or more processors, assessment data associated with one or more network devices, for a particular assessment criterion of the one or more assessment criteria, wherein the assessment data includes a first data file in a first format and a second data file in a second format that differs from the first format, and a first unit of measurement and a second unit of measurement for the particular assessment criterion, wherein the first unit of measurement differs from the second unit of measurement; normalizing, by the one or more processors, the assessment data including at least one of converting the first data file to the second format or converting the first unit of measurement to the second unit of measurement; organizing, by the one or more processors, the normalized assessment data to form the project; and providing a user interface utilized in outputting at least one of a report or an export file including the normalized assessment data.

8930864

13633911

1. A method for sharing and re-using a single voltage parameterized statistical timing model corresponding to a macro during timing analysis of an integrated circuit (IC) chip design provided with at least one voltage domain and at least one instance of the macro, the method comprising: a) using a computer, computing timings of said macro employing said macro single voltage parameterized statistical timing model; b) obtaining information of voltage domain for macro instantiation; c) comparing said voltage domain information of said macro instantiation with a voltage domain information of said single voltage parameterized statistical timing model to detect a voltage domain information mismatch; d) generating a self-correction transformation upon discovery of said voltage domain information mismatch that dynamically updates said single voltage parameterized statistical timing model to correspond to said voltage domain of said macro instantiation; e) dynamically updating results of said macro's said computed timings based on said dynamically updated statistical timing model; and f) using said updated timing results, performing said timing analysis of said IC chip design.

7644062

11716010

1. A computer implemented method, comprising: transforming a base query to generate a transformed query; wherein the base query includes a union between each base branch of a plurality of base branches; wherein each of two or more base branches of said plurality of base branches joins a set of tables; wherein the sets of tables of the two or more base branches of the plurality of base branches include a common table set shared by all the sets of tables, said common table set including a common table; wherein each of the two or more base branches of the plurality of base branches include a respective set of tables that does not include said common table set; wherein the step of transforming the base query includes replacing the plurality of base branches with a first group branch that joins the common table and an inline view, the inline view comprising a union between a plurality of respective branches, wherein the plurality of respective branches includes, for each base branch of said plurality of base branches, a FROM list that: references the respective set of tables, and does not reference the common table; and wherein the method is performed by one or more computing devices.

10161228

15960874

1. A method for managing a multilateral physical snaky well using an inflow performance relationship (IPR) and hydraulic fracturing work, comprising: acquiring an operating surface facilities pressure and one or more physical parameters from the multilateral physical snaky well including at least a well bottom-hole pressure, a gas-to-oil ratio, and a liquid in-flow rate; determining a grid model from a plurality of grid models for the multilateral physical snaky well; simulating a plurality of well geometries for the determined grid model, the plurality of well geometries including a horizontal well, and a plurality of snaky lateral wells having different numbers of undulations and multiple orientations; performing sensitivity analysis to determine an impact of a plurality of snaky well parameters on the IPR of the multilateral physical snaky well; performing regression analysis based on the sensitivity analysis to determine Vogel based quadratic coefficient that estimates the IPR of the multilateral physical snaky well; computing by circuitry, a transformation of the plurality of snaky well parameters to provide transformed parameters and determining a sum of squared errors of the plurality of snaky well parameters; computing by circuitry, the IPR based on a linear weighting of the transformed parameters; predicting a performance of the multilateral physical snaky well based on the IPR and the one or more physical parameters; identifying a permeability in which a production amount is increased based on the operating surface facilities pressure and the predicted performance; and adjusting a permeability of a plurality of laterals of the multilateral physical snaky well using hydraulic fracturing work on the multilateral physical snaky well to match the identified permeability.

8165530

12382363

1. A method for transmitting channel information in a multi-antenna system, the method comprising: calculating channel quality information (CQI) with respect to each mode; comparing the CQI with respect to each mode to a threshold value with respect to each mode; transmitting CQI with respect to a mode having higher CQI than the threshold value as channel information; and receiving updated threshold values which update the threshold value with respect to each mode, wherein the updated threshold values are updated by using the transmitted CQI.

20150244626

14189027

1. A method for identity-aware load balancing, the method comprising: identifying, at an application executing in a data processing system, a sender of a packet using an attribute communicated with the packet, wherein the attribute is sufficient to identify a sender of the packet, and wherein the packet is directed to a set of resources managed by a load balancing application; selecting a rule corresponding to the sender; executing, using a processor and a memory, the rule to identify a characteristic of an algorithm usable in a load balancing operation of the load balancing application; and communicating the packet and the identified characteristic of the algorithm to the load balancer, wherein the communicating causes the load balancer to select an algorithm for a load balancing operation with the packet such that the selected algorithm includes the identified characteristic of the algorithm.

10003560

13727991

1. A method, comprising: identifying, by a computing device, social signal data based on social signals published using social media accounts, the social signal data including first information that includes a content of the social signals and second information that is different than the first information, wherein the second information includes metadata; identifying, by the computing device, conversations in the social signals using said second information; grouping, by the computing device, the conversations into topic clusters using the first information, wherein said grouping using the first information comprises: forming a first set of topic clusters that corresponds to a first time; and forming one or more second sets of topic clusters that correspond to one or more second different times, respectively; and wherein, responsive to the grouping using the first information, a first one of the conversations is grouped with a second one of the conversations into a same one of the topic clusters of the first set or the one or more second sets, the first one of the conversations based on a root social signal of the social signals that is not explicitly linked, by the second information, with a different root social signal on which the second one of the conversations is based; and linking, by the computing device, the topic clusters together into a plurality of conversation streams, wherein a first conversation stream of the plurality of conversation streams includes a topic cluster of the first set and at least one associated topic cluster of the one or more second sets, and wherein a second conversation stream of the plurality of conversation streams includes a different topic cluster of the first set and at least one associated topic cluster of the one or more second sets; calculating, by the computing device, strengths of the different conversation streams based on a quantity of the social signals contributing to the conversation streams and a quantity and types of followers associated with the conversation streams; and deriving, by the computing device, a score for one of the social media accounts based on the strengths of the conversation streams.

7978672

12689626

1. A system for link-state source routing in an ad hoc network, the system comprising: a send buffer that holds packets while route discovery is performed; a maintenance buffer that is used for route maintenance; a request table that is used to identify duplicate route discovery requests; at least one link quality metric module that determines quality of links to neighboring nodes; and a neighbor cache for translating layer 2.5 virtual addresses into physical addresses, wherein the link-state source routing is performed using the layer 2.5 virtual addresses, wherein a forwarding node is configured to modify a source route with one or more updated link quality measurements, wherein a destination node is configured to update the destination node's link cache with link quality information for a source route, and to send to a source node a route reply message that conveys link quality information for the source route, and wherein the route reply message is sent by way of an independently-discovered route from the destination node to the source node.

7580853

11734998

1. A method of providing a marketing guidance report for a proposed electronic game, comprising: providing an analysis tool comprising a processor and computer readable memory storing software instructions, where the processor is configured to derive relationships between sales data and game features upon execution of the software instructions; collecting result set data on historical games, the result set data including sales and review data with respect to first and second historically available electronically embodied games; collecting historical feature data on development features with respect to the historical games including a time made available, a publisher, a developer, a title, a brand, a franchise, an absence of a feature, a feature frequency, an interaction of features, and a restriction on content; collecting additional feature data on development feature of the proposed game; classifying the development features of the historical games and proposed game into classes according to a hierarchical classification scheme where features having common attributes are within a same class; allowing a recipient to select at least a first feature from a first class, and a second feature from a second, different class; allowing the recipient to select the result set data to be used for a prediction; deriving relationships between at least the first and the second selected features with respect to the result data by using the analysis tool to run a regression analysis on the result set data, the historical feature data, and the additional feature data; generating, using the analysis tool, the prediction with respect to the selected result set data for the proposed game having at least one of the first and the second features, wherein generating the prediction comprises a trend analysis on the relationships by using a clustered pattern recognition; and using a server to configure a remote computer to present the recipient with a marketing guidance report for the proposed game that comprises the trend analysis of the relationships with respect to the prediction of the result set data selected by the recipient.

10068297

12969453

1. A remote non-intrusive monitor of a space of a building for occupants, comprising: a non-intrusive sensor module coupled to a power line for monitoring a space, the non-intrusive sensor module is configured to monitor the space from a position exterior a building encompassing the space; and a processor connected to the sensor module; and wherein: the sensor module senses data on the power line and provides signals representative of electrical power used at the space in response to power system disturbances in the power supplied to the building from a utility power system; the signals representative of the electrical power are analyzed by the processor; and analysis by the processor of the signals results in information about how a space and/or an element, component, environment, and/or occupant, if any, of the space responds to power system disturbances in the power supplied to the building.

7822695

11849209

1. A system for organizing a database management system (dbms) comprising: a computer microprocessor; a computer operating system; a transformational spatio-temporal object relational (T-STOR) dbms; and data objects; wherein the computer microprocessor uses the computer operating system to organize and access data in the T-STOR dbms wherein the data objects are stored in specific locations of the T-STOR dbms; wherein the data objects are temporal objects that transform over time; and wherein the data objects are organized by temporal priority.

20040024770

10395020

1. A data visualization system comprising: a finite set of discrete data values maintained in computer memory; a retrieval component configured to retrieve a set of data values from computer memory; a display component configured to display a representation of each of the set of the retrieved data values centered on respective data points; and a contour generator configured to generate and display a contoured representation around each data point, such that each data point is displayed as a local maximum.

9875440

14691439

1. A method of processing information, comprising: receiving a message; processing the message with a trained artificial hierarchical stacked neural network implemented with at least one automated processor, comprising a plurality of hierarchical layers, each respective hierarchical layer being trained according to at least one training criteria, the at least one training criteria differing for respective ones of the plurality of hierarchical layers, and comprising at least one set of outputs which together represent a non-arbitrary organization of actions based on an architecture of the respective hierarchical layer and the prior training of the respective hierarchical layer; the message being received as an input by a respective first hierarchical layer of the trained artificial hierarchical stacked neural network; generating a search query for at least one database external to the hierarchical stacked neural network, based on the message, the search query being generated within the hierarchical stacked neural network as a neural network layer output from a respective second hierarchical layer of the trained artificial hierarchical stacked neural network at a respectively higher hierarchical level than the respective first hierarchical level which receives the message; communicating the search query through an automated communication channel, wherein the at least one database is configured to receive the search query from the automated communication channel and produce a database response based on an index of a plurality of database records corresponding to the search query; receiving the database response from the at least one database through the automated communication channel, as a neural network input into a respective third hierarchical layer of the trained artificial hierarchical stacked neural network; generating an output as a non-arbitrary organization of actions from a respective fourth hierarchical layer of the trained artificial hierarchical stacked neural network, selectively in dependence on the database response.

20100293119

12550801

1. A method, comprising: receiving, by a master processor, an initial population of parent chromosome data structures, wherein each parent chromosome data structure provides a plurality of genes representative of variables in which associated values are permitted to evolve; selecting, by the master processor, pairs of parent chromosome data structures from the input population of parent chromosome data structures; applying, by the master processor, at least one evolutionary operator to the genes of the selected pairs of parent chromosome data structures to generate a plurality of child chromosome data structures; allocating, by the master processor, the generated plurality of child chromosome structures to a plurality slave processors, wherein each slave processor evaluates one or more of the plurality of child chromosome data structures with a plurality of objective functions and generates respective objective function values; receiving, by the master processor, objective function values for a portion of the plurality of allocated child chromosome data structures; merging, by the master processor, the parent chromosome data structures with the received portion of the child chromosome data structures for which objective function values have been received; and identifying, by the master processor, a portion of the merged set of chromosome data structures as an elite set of chromosome data structures based at least in part on the received objective function values, wherein the prior steps are performed for a plurality of iterations, including a first iteration and a second iteration, until termination criteria is satisfied, and wherein during a second iteration subsequent to the first iteration, the master processor receives objective function values for late child chromosome data structures associated with the one or more pairs of parent chromosome data structures allocated to slave processors during the first iteration, wherein during the second iteration, the elite set of chromosome data structures is utilized as the input population when performing the prior steps, and wherein during the second iteration, the late child chromosome data structures for which objective function values have been received are merged with the parent chromosome data structures that are associated with the input population of elite chromosome data structures.

8362950

13187877

1. A method for predicting GNSS satellite trajectory extension data in a mobile apparatus, said method comprising steps of: obtaining at least one satellite navigation message for one of satellites; determining an estimated satellite trajectory prediction model according to the obtained satellite navigation message; and propagating at least one set of satellite trajectory extension data by using the estimated satellite trajectory prediction model.

20120084106

12914484

1. A computer-implemented method for determining a configuration for a supply chain for a cylinder gas distribution network, the method comprising: receiving a set of input data characterizing attributes of the supply chain to be configured, wherein the input data includes at least (i) a set of potential locations for one or more distribution hubs and one or more filling plants for the supply chain, (ii) a set of one or more customer locations, (iii) a set of one or more products available to be delivered to the customers from the distribution hubs; merging the one or more products characterized in the input data into one normalized product; determining, by operation of an equivalent cylinder solver, a secondary transportation solution, wherein the secondary transportation solution fixes one or more locations for distribution hubs from the set of potential locations, and specifies transportation flows from the fixed distribution hubs to each of the set of one or more customers using the normalized product; and determining, by operation of a primary stock solver, a primary transportation solution, wherein the primary transportation solution fixes one or more locations for filling plants, from the set of potential locations, and specifies transportation flows from the fixed filling plants to the fixed distribution hubs using the secondary transportation solution.

20040249628

10453349

1. A computer-implemented method for estimating a set of parameters for each of a plurality of language models that correspond to a plurality of classes, the method comprising: setting initial values for the sets of parameters; and adjusting the sets of parameters jointly in relation to one another to increase a conditional likelihood of a class given a word string.

20050012266

10820617

1. A game comprising: (a) a substantially flat longitudinal playing surface having two ends; (b) a marker, placed at one end of the playing surface; (c) a scoring goal, placed at the end of the playing surface opposite the marker, the scoring goal having an outer scoring area located on the playing surface, an inner scoring area located on the playing surface at least partially within the perimeter of the outer scoring area, a game pole inserted into the playing surface within the area of the outer scoring area, and a ball for placing on top of the game pole; and (d) at least two game balls for pitching or bowling at the scoring goal.

7685092

11470796

1. In a computer system operatively connected to a database system, a method for monitoring and analyzing database performance problems under usage of an interface to a database performance database storing performance data collected during runtime of said database in a redundancy-free form, wherein said performance data is extracted from said performance database and transformed into a problem-specific form specific for a query formulated by a database administrator for detecting a respective individual database performance problem, wherein said query uses multi-dimensional cubes and is based on a logic coupling between said redundancy-free and said problem-specific form, the method comprising: storing a problem-cube model implementing said logic coupling and comprising information on the mapping relationships between a database performance problem and a respective cube or one or more cube sets appropriate for a problem analysis of a respective performance problem; in response to detecting a specific performance problem automatically filling said cubes with respective performance data from said performance database by exploiting said implemented logic coupling; and outputting the filled cubes to an output interface usable to deploy said filled cubes for cube-based database performance analysis.

20090012678

11966643

1. A system for classifying vehicle occupants, comprising: a detector installed in a vehicle seat and adapted to sense variation in current occurring when an occupant is seated in the seat; and a controller for determining whether the occupant is seated and which type of occupant is sitting, using a current value measured by the detector, and transmitting a result of determination to an airbag control unit, the controller operating, wherein the controller compares the measured current value (X) with a preset zero value, infant maximum value (Acrs), adult minimum value (Aadt), and threshold value (Athd) existing between the infant maximum value and the adult minimum value, and thus determines that no occupant is seated when X=zero value, that an infant is seated when zero value<X<Athd, and that an adult is seated when Athd<X<Aadt, the controller changes determination thereof in such a way that, when Acrs≦X< Athd, an occupant is determined to be an adult when a current value, measured after this condition is met, is equal to or greater than the adult minimum value (Aadt), and the controller changes determination thereof in such a way that, when Athd≦X<Aadt, an occupant is determined to be an infant when a current value, measured after this condition is met, is equal to or less than the infant maximum value (Acrs).

20130204876

13829472

1. A method for performing workflow process on at least one content document comprising: a) receiving, by at least one processor, the at least one document content; b) organizing, by the at least one processor, the at least one document content; c) discovering, by the at least one processor, at least one metadata relating to the at least one document content; and d) taking action, by the at least one processor, on the at least one document content, based on said (a), (b), and (c).

20150055467

14137957

1. For an electronic device that comprises a network interface card (NIC) with a plurality of queues for temporarily storing data traffic through the NIC, a method of managing the queues, the method comprising: assigning a subset of data traffic to a first queue; monitoring the subset of data traffic through the first queue; and based on the monitoring, re-assigning the subset of data traffic to a second queue.

20070143850

11415022

1. A method of providing computer security on a computer system, the method comprising: defining at least one key event to be monitored by at least one agent; creating a graphical model for the at least one key event; observing the at least one key event; inferring a degree of attack on the computer system based on an 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 model; and adjusting a security policy based on an output of the graphical model.

9401926

14251623

1. A method for monitoring and evaluating vulnerabilities and risks associated with an IT system of an enterprise, the method comprising: receiving data from a continuous monitoring system, wherein the continuous monitoring system is comprised a plurality of sensors that derive data from devices within the IT system, wherein the monitored devices include mobile devices, computing devices and network devices within the monitored IT system, further wherein the plurality of sensors are comprised of end point sensors, network sensors, and data loss prevention sensors; adding meta-tags to the received data; translating the received data after the addition of meta-tags; deconflicting the received data, wherein the data is deconflicted between data received by different sensors with the monitored IT system; further wherein the data is deconflicted between data received from different devices within the IT system; translating the deconflicted and meta-tagged data into a common format for storage; updating meta-tags and selected values for subsequent post-processing; sending notification of the updated status and updating records for the production of risk predictive analytics, risk trend analysis, and risk allocation tables; combining data using statistical and machine learning methods to extract threats and vulnerabilities; creating a master table of risks; applying risk analysis tools to the master table of risks to develop an enterprise wide risk profile; wherein the master table of risks is grouped by security category, severity and location; further wherein the step of applying risk analysis tools to the master table of risks includes analyzing and categorizing risk data so that the total and categorized risks and cost of mitigations are part of the risk profile; wherein the risk profile includes loss probabilities and remediation cost estimates; wherein the categorized risks and cost of mitigations are allocated among endpoints and organizational entities in the enterprise; providing a visual presentation component for presenting analysis of the risk profile; transmitting the security profile results to a database; extracting data from the database; analyzing the extracted data to identify threats, risks and the compliance posture of the monitored IT system, wherein the extracted data is combined with forensic and time series results; producing a listing of all IT risks for the monitored system; and applying a valuation to the identified IT risks for the monitored system, wherein the valuation is generated by integrating the listing of all IT risks with data representing business operations resources expenditures and allocations.

20020143763

09827064

1. A method for analyzing a database for determining an approach for reorganization of the database, the method comprising: (a) receiving a list of database records to be analyzed; (b) analyzing each database record on the list wherein updates to the database are performed while the analyzing occurs; (c) designating as “qualified” each analyzed database record on the list which meets certain criteria; (d) adding identifying information for each qualified database record to a detail array; (e) repeating (b) through (d) until each database record on the list is analyzed; (f) aggregating qualified database record information based on information in the detail array; and (g) recommending a reorganization strategy based on the aggregated qualified database record information.

8199816

11887811

1. A method for predicting motion vectors for encoding enhancement layer video data, the method comprising the steps of upsampling a motion field of a base layer; assigning the motion vectors of the upsampled motion field to 16×16 macroblocks of an enhancement layer; generating motion vectors for 8×8 blocks from the motion vectors of 16×16 macroblocks, wherein the motion vectors for intra coded 8×8 blocks are interpolated from the motion vectors of four nearest inter coded 8×8 blocks; interpolating motion vectors of 4×4 blocks from the motion vectors of the 8×8 blocks; and performing an encoding mode decision; wherein for base layer skip mode, said 4×4 motion vectors are used as predictors.

9198054

14176691

1. An aggregate location dynometer in a physical wireless network server, said aggregate location dynometer comprising: a network monitor to monitor a wireless network for an indication of a viral event; a location aggregator to obtain a location of each of a plurality of wireless devices associated with said viral event; a crowd risk determinant, triggered by said network monitor, to determine a crowd risk based on an aggregation of said location of each of said plurality of wireless devices associated with said viral event; and an alert module to initiate an alert message relating to a public safety risk determined from an analysis of said viral event.

20050021256

10749416

1. A system for wavelet analysis of one or more time domain reflectometry (TDR) signals to determine one or more characteristics of one or more anomalies in a wire, the system comprising: a library of one or more reference wavelet analysis results that each correspond to one or more known anomalies having one or more known characteristics; and an analysis module operable to: receive a TDR signal that has reflected back up a wire from an anomaly in the wire; calculate a wavelet analysis result from a wavelet analysis of the TDR signal; access the library; compare the wavelet analysis result with one or more reference wavelet analysis results; if the wavelet analysis result corresponds to one or more particular reference wavelet analysis results, indicate that the anomaly in the wire has one or more particular known characteristics of one or more particular known anomalies corresponding to the one or more particular reference wavelet analysis results; and if the wavelet analysis result of the TDR signal does not correspond to one or more reference wavelet analysis results, indicate that the anomaly in the wire lacks one or more known characteristics of one or more known anomalies corresponding to one or more reference wavelet analysis results in the library.

20040111306

10685839

1. A project assessment system that assists to assess a project consisting of plurality of processes by computing forecast estimates of saidproject based on a set of information as starting information, progress information and up-to-date information of said project comprising: a computer process that computes, by using process planning information of said project, up-to-date actual progress information of said project and forecast model information of said project that defines estimates of variances of a plurality of parameters that are substantial measures of said project, at least one of estimation values of said parameters of said each process and another computer process that enables to assess said project by judging whether said estimation values satisfy a predetermined criterion or a result of a mutual comparison of said estimation values against each different process satisfies a predetermined criterion.