Datasets:

patent

/

AIPD_evo_claim_one

like 0

9251208

13462995

1. A method of merging search results, comprising: identifying a query from a user; splitting the query into sub-queries; for each of the sub-queries, determining a user importance value for said each sub-query to quantify how important said each sub-query is to the user relative to how important the others of the sub-queries are to the user, executing said each sub-query to obtain a search result for said each sub-query, and using the user importance value determined for said each sub-query to assign a user relevance score to the search result obtained for said each sub-query; and combining the search results for the sub-queries based on the user relevance scores assigned to the search results to obtain merged search results; and wherein: the execution of each of the sub-queries includes identifying a multitude of search results for at least one of the sub-queries; the combining includes grouping said multitude of search results into a plurality of clusters, and computing a relevance score for each of said clusters, wherein each cluster represents a high level entity; the determining a user importance value for said each sub-query includes identifying one of the sub-queries as a primary focus, and identifying another of the sub-queries as providing context, computing a probability p(Q) of each of the sub-queries, and computing information content of each of the sub-queries as log p(Q); and the combining the search results further includes, once the information content of the sub-queries are computed, merging the search results.

9501852

14155368

1. A method for image fusion, comprising: obtaining, via a processor, multiple images for a same scene; calculating, via the processor a fused image of the multiple images based on Bayes analysis by using a kernel function; and calculating, via the processor, the fused image based on the kernel function by using a constructed energy function.

9851263

14869290

1. A portable heating chamber system for pyrometric proficiency testing, comprising: an enclosing structure defining an interior zone and an exterior zone; within the interior zone, one or more air circulating means and one or more heat sources; a data acquisition device located in the exterior zone; multiple temperature sensors uniformly distributed within the interior zone, wherein each temperature sensor transmits sensor temperature data to the data acquisition device through a wired or wireless connection; a control sensor located at or near the center of the interior zone; in the exterior zone, a temperature controller which receives control temperature data from the control sensor and responds to the control temperature data by transmitting temperature control signals to the heat sources through one or more wired or wireless connections; wherein the temperature control signals are adapted and configured to achieve and maintain a constant and uniform control temperature in the interior zone; wherein the data acquisition device is adapted and configured to receive and record the sensor temperature data from each temperature sensor at regular intervals for a set test duration and to record a high and low temperature for each temperature sensor for the test duration; wherein the data acquisition device has multiple input channels, each of which is adapted and configured to receive the sensor temperature data from one of the temperature sensors; and wherein associated with each of the temperature sensors is a sensor correction factor, and wherein associated with each of the input channels is a channel correction factor.

10163060

14400074

1. A system for generating a hierarchical probability model generation system used for availability analysis, comprising: a memory storing instructions; and one or more processors configured to execute the instructions to: generate a temporary event tree by analyzing operating conditions of a multi-tier web application system based on availability requirements of the web application system; extract independent sets of configuration elements of the web application system by analyzing dependence between the configuration elements based on configuration information of the web application system, wherein the configuration elements correspond to a plurality of functions of the web application system; determine basic events based on the temporary event tree and the independent sets of the configuration elements, wherein the basic events are inputs of the temporary event tree and include independent and dependent basic events, the independent events being calculable independently of each other, the basic events being associated with operating status of the configuration elements; specify the independent basic events by extracting the basic events corresponding to the independent sets of the configuration elements; generate an event tree based on the independent basic events but not the dependent basic events; generate state transition models used to calculate occurrence probabilities of each of the independent basic events; and evaluate availability of the web application system based on the generated state transition models.

20120033804

13144407

1. A method for renewing code, executable or interpretable by an electronic computer, for a cryptographic algorithm capable of enciphering a piece of data D by means of a key K to obtain a cryptogram D* or decipher a cryptogram D* by means of a key K to obtain a piece of unencrypted data D, said code including at least N numerical constants, each numerical constant corresponding to an operand or to a mnemonic of an instruction of the code, the value of said numerical constants being independent of the piece of data D, the key K and the cryptogram D*, said method comprising: receiving a randomly drawn seed, the size of which, in terms of number of bits, is at least four times smaller than the number of bits needed to encode the N numerical constants of the cryptographic algorithm, expanding the seed deterministically to obtain a sequence of numbers, the sizes of which, in number of bits, are at least equal to the number of bits needed to encode the N numerical constants of the cryptographic algorithm, generating N new numerical constants from the sequence of numbers obtained, and replacing the N constants of the code of the cryptographic algorithm by the N new constants generated to obtain a code of a renewed cryptographic algorithm.

9968283

14551882

1. An automated method of inferring an activity of daily living of a human subject, the method comprising: date and time stamping sensor readings from a plurality of sensors; storing a computer-readable log of the date and time stamped sensor readings; and a computer processor obtaining the stored date and time stamped sensor readings and applying a set of rules that analyze spatial-temporal relationships of multiple sensors' readings to automatically infer that the human subject has engaged in a predetermined activity of interest, wherein said spatial-temporal relationships are defined as sequences of said multiple sensors' readings and locations of said plurality of sensors, and wherein the computer processor inferring that the subject has engaged in the activity of interest includes the computer processor making an inference as to whether the subject has engaged in the activity of interest without assistance from another person.

20110224966

13128605

1. A fueling plan evaluating system comprising: a fueling procedure formulating part configured to formulate fueling procedures of a nuclear reactor; an input setting part including: input means for inputting and setting values for calculations, a fueling procedure database configured to form storage management of the fueling procedures formulated by said fueling procedure formulating part, a reactor-core-simulator-calculation nuclear-model database configured to store physics models for performing calculations through reactor core simulation, and a calculation condition database configured to store calculation conditions for performing at least one of control rod worth calculations and reactor shutdown margin calculations; a maximum worth control rod candidate selecting part including a control rod worth calculating means for: inputting fuel loading and control rod patterns of each fueling procedure from said fueling procedure database, inputting a simpler second physics model, compared to a subdivided first physics model, the simpler second physics model to direct reactor shutdown margin calculations, from said reactor-core-simulator-calculation nuclear-model database, calculating, with said second physics model, from a difference between a degree of subcriticality of a reactor core in a state that all the control rods that can be inserted are inserted and a degree of subcriticality of the reactor core in a state that a focused single control rod or single pair of control rods is withdrawn, a control rod worth of said focused single control rod or single pair of control rods for each fueling procedure, calculating a control rod worth of a control rod or a control rod pair of each planned fueling procedure, and selecting a determined number of control rods or control rod pairs with large values of control rod worth as maximum worth control rod candidates; a reactor shutdown margin calculating part configured to: input the maximum worth control rod candidates selected by said control rod worth calculating means, input a subdivided first physics model used for reactor shutdown margin calculations from said reactor-core-simulator-calculation nuclear-model database, and calculate, using said subdivided first physics model for reactor shutdown margin calculations, for each of the maximum worth control rod candidates, reactor shutdown margin in a case that, from the fuel loading and control rod patterns, a focused maximum worth control rod candidate is withdrawn; and an output part including: means for inputting the reactor shutdown margin calculated by said reactor shutdown margin calculating part, and means for outputting or storing said reactor shutdown margin as an evaluation of a fueling plan for a nuclear reactor.

8122477

11973554

1. A system for electronically distributing video to one or more viewers, the system being managed by an operator at a particular distribution location, comprising: a) a storage vault, said storage vault containing one or more purchased copies of a video, said video being purchased from the owner of the video, said storage vault being disposed on-premise at the particular distribution location, said storage vault being locked so that said copies of said video are stored securely; b) an encoder wherein at least one copy of said video is digitally encoded into a video server storage unit; c) a display system for displaying said video to the viewers, said display system having display system software for interfacing between said video server storage unit and said display system; d) a distribution network for distributing said video from said video server storage unit to a display system; e) a usage timer system for calculating the remaining time of each of the rented out copies of a video and the shortest wait, tracking said wait for the benefit of users waiting for a video to become available, and, additionally, when a user “pauses” a play, said usage timer system begins to add the corresponding time to the “wait” time for that particular copy of the video; f) said display system also comprising a title availability/unavailability graphic user interface in a “time till available” window, wherein said title availability/unavailability graphic user interface displays to a viewer whether a video is available or if unavailable, when the title will become available; g) wherein the number of said videos distributed by said distribution network is less than or equal to the number of purchased copies of said video; and, h) wherein revenue is generated for the operator from renting digital copies of said purchased copies of said video a plurality of times.

7539488

11270811

1. A wireless network device, comprising: a controller; a wireless transceiver coupled to the controller and operative for communications in a wireless communication network; memory for storing an application program; the controller being adapted to execute the application program for controlling operation of the wireless network device; the controller being further adapted to receive, through the wireless transceiver, an instruction which causes the wireless network device to operate as a client in performing an over-the-air download (OAD) procedure for receiving the application program from another wireless network device which is operated as a server in the wireless communication network, and to operate the wireless network device as the client in performing the OAD procedure in response to such instruction; and the controller being further adapted to receive, through the wireless transceiver, one or more instructions which cause the wireless network device to operate as a server in performing the OAD procedure for sending the application program to another wireless network device which is operated as a client in the wireless communication network, and to operate the wireless network device as the server in performing the OAD procedure in response to such instructions.

7693737

11591129

1. A computer-based method for conducting an enterprise planning process by executing software on a networked computer system, the method comprising: storing a model of an organization in a database accessible by the computer system, wherein the model that has been stored includes a plurality of nodes hierarchically arranged into a number of levels; storing information, accessible by the computer system, that identifies a contributor for each node of the model; capturing, with the computer system, forecast data from a first contributor associated with a first node within a first level of the model; capturing, with the computer system, target data for the first node from one or more analysts that use at least one computing device that communicates with the computer system; updating, with the computer system, a current level of the model from the first level to a second, higher level, wherein the second level includes a second node associated with a second contributor, and wherein the second node is a parent of the first node; selectively presenting, with the computer system, the forecast data and the target data to the second contributor for reconciliation based on the current level of the model; responsive to selectively presenting the forecast data and the target data to the second contributor, receiving, with the computer system, review information from the second contributor regarding reconciliation of the forecast data and the target data; updating the current level, with the computer system, according to the review information; determining, with the computer system, when the current level is a highest level of the model; and generating, with the computer system, an enterprise planning report for the organization based on the forecast data when the forecast data is approved by a contributor associated with a root node within the highest level of the model.

20150039597

13954719

1. A method comprising, by one or more computing devices: accessing a first set of queries of an online social network received from one or more users of the online social network; parsing each query in the first set of queries using a first parsing algorithm to generate a query command based on each query, each query command comprising one or more query constraints, each query constraint being for a specified number of objects of a specified object-type as specified by one or more parsing-configuration parameters of the first parsing algorithm; retrieving, for each query constraint of each query command, the specified number of objects that match at least a portion of the query constraint from one or more data stores, each data store storing one or more objects associated with the online social network of the specified object-type for the query constraint; scoring, for each query command, each retrieved object based on a first scoring algorithm; and generating one or more revised parsing-configuration parameters based on a comparison of the scores of the retrieved objects and the specified number of objects of the query constraints.

8510142

13186919

1. An expert system comprising: a computing device for executing a plurality of engines, the computing device comprising a processor and a non-transitory computer readable storage medium; at least two expert system engines configured to generate conflicting first and second optimization recommendations, wherein a first expert system engine generates the first optimization recommendation in accordance with a first functional discipline of a construction project and a second expert system generates the second optimization recommendation in accordance with a second different functional discipline of the construction project; and a conflict engine coupled with the at least two expert system engines and configured to: identify a conflict between the conflicting first and second optimization recommendations, respectively, convert the conflict into a conflict object including a predicted impact of project metrics, and present the conflict object to a user via a conflict interface.

20150355891

14300633

1. A method for distributing sets of regular expressions to a fixed number of state machine engines, the method comprising: combining, with a processing device, a plurality of regular expressions into a single compound regular expression; creating a single nondeterministic finite automaton (NFA) including a plurality of NFA states based on the compound regular expression; performing an interference analysis for each pair of NFA states to identify all pairs of NFA states that would potentially interfere in an equivalent deterministic finite automaton (DFA); creating an interference graph representing all regular expressions associated with potentially interfering NFA states based on the results of the interference analysis; and performing a graph coloring algorithm on the interference graph to assign a different color to each represented regular expression in the graph.

8170913

10986440

1. A method for allocating advertisements to slots on a web site, the method comprising: receiving advertisement data from a plurality of advertisers, the advertisement data associated with a plurality of advertisements, the plurality of advertisements including a first set of advertisements associated with a first advertiser of the plurality of advertisers and a second set of advertisements associated with a second advertiser of the plurality of advertisers; receiving constraint data, the constraint data associated with a plurality of constraints; receiving a preference to maximize estimated clicks on the first set of advertisements associated with the first advertiser; and allocating, by a computer, the plurality of advertisements to at least one slot without violating any of the plurality of constraints, the first set of advertisements allocated in response to the preference according to a first optimization function that maximizes estimated clicks on the first set of advertisements without maximizing estimated revenue to the site, the second set of advertisements allocated according to a second optimization function that maximizes estimated revenue to the site.

9684490

14972291

1. A computer-implemented method performed by a computing device where the computing device includes at least a processor for executing instructions from a memory, the method comprising: identifying a selected runtime environment to execute an analytical model that includes analytical expressions; generating a user-script data structure, wherein the user-script data structure includes instructions for mapping the analytical expressions of the analytical model to executable expressions of the selected runtime environment based on a runtime specification of the selected runtime environment; generating a computerized specification object, wherein the computerized specification object includes: (i) a pre-script data structure specifying how the selected runtime environment is to access input data to be operated upon by the analytical model, (ii) the user-script data structure and the analytical model, and (iii) a post-script data structure specifying how to output results data produced by the analytical model from the selected runtime environment; transmitting the computerized specification object over a computer network to the selected runtime environment for execution of the analytical model by the selected runtime environment, wherein access is provided to a configuration file specifying a designation of a hardware execution configuration of selected nodes that are to be instructed to execute the analytical model, wherein the selected nodes are selected from a plurality of available nodes of the selected runtime environment; and receiving results data from the selected runtime environment.

8942659

13606843

1. A method of selecting an antenna array state for a multi-element reconfigurable transmitter and/or receiver antenna, comprising the steps of: a processor executing a learning algorithm that optimizes unknown signal to noise ratios of possible signal paths between at least one reconfigurable transmitter antenna and at least one reconfigurable receiver antenna over time over different antenna array states of said at least one reconfigurable transmitter antenna and said at least one reconfigurable receiver antenna; and the processor setting the antenna array configuration for the transmitter and/or a receiver antenna based at least in part on the antenna array states determined by said learning algorithm to lead to optimized signal to noise ratios between said at least one reconfigurable transmitter antenna and said at least one reconfigurable receiver antenna over time, wherein executing the learning algorithm includes formulating selection of an antenna array state as a multi-armed bandit problem for learning the unknown signal to noise ratios of said possible signal paths so as to maximize signal to noise ratio between said at least one reconfigurable transmitter antenna and said at least one reconfigurable receiver antenna over time.

20080288164

11749079

1. A system for actively analyzing air traffic conditions based on a plurality of inputs, comprising: an analysis component configured to produce at least one conflict-checked, operationally preferred flight trajectory revision for an operating vehicle; and a communications component configured to communicate the at least one conflict-checked flight trajectory revision.

9008671

13133819

1. A method implemented in a node of a multiple radio access technology (multi-RAT) system, comprising: acquiring resource status information associated with each RAT of the multi-RAT system; and maintaining an N-bit global flag representing an overall resource availability of the multi-RAT system based on the acquired resource status information, for use in admission control; wherein the N-bit global flag is encoded such that each of its N bits describes each of the multiple RATs; wherein the N-bit global flag is associated with a pre-defined set of overall resource availability states of the multi-RAT system; wherein the availability states are defined in terms of admission control decisions, and comprise at least one of the following admission control decisions: unconditional acceptance of all services; conditional acceptance of broadband guaranteed bit rate (GBR) services and unconditional acceptance of all other services; conditional acceptance of broadband GBR services, conditional acceptance of narrowband GBR services, and unconditional acceptance of other services; and unconditional rejection of all services; wherein conditional acceptance involves performance of admission control; and wherein unconditional acceptance and unconditional rejection do not involve performance of admission control.

7602524

11536985

1. A computer implemented method for analyzing a portion of the content of a digital image, comprising: identifying a digital image stored in a data storage area comprising a plurality of digital images; identifying a set of image processing instructions, wherein the image processing instructions carry out an analysis of the content of the digital image; retrieving a first sub-region of the digital image from the data storage area; executing the set of image processing instructions on the first sub-region; retrieving a second sub-region of the digital image from the data storage area; executing the set of image processing instructions on the second sub-region; analyzing the results of the image processing on the first sub-region and the second sub-region to provide an analysis of a portion of the digital image.

8098891

12277278

1. A method to perform multi-human three dimensional (3D) tracking, comprising: for each single view, providing two dimensional (2D) human detection candidates from a camera to a 2D tracking module wherein a Convolutional Neural Network (CNN) generates the 2D human detection candidates; a. independently performing 2D tracking in each 2D tracking module and reporting promising 2D tracking hypotheses to a 3D tracking module; b. selecting trajectories from the 2D tracking modules to generate 3D tracking hypotheses; and c. determining a difference score between the detection and the trajectory as a weighted sum of appearance, location, blob size, and orientation.

8321252

13362150

1. A computer system for managing air cargo yield for optimising a yield parameter resulting from assigning an offered capacity offered by a future instance of a cargo flight to each one of a plurality of different categories of requests competing for the capacity, the computer system comprising: a memory; and a processor in communication with the memory, wherein the computer system is configured to perform a method, the method comprising: separately defining the offered capacity by a weight capacity variable and by a volume capacity variable, the weight variable and the volume variable independent relative to each other; storing a set of historical profiles for each one of a plurality of previous instances of the cargo flight, the set including a historical profile of a historical value of the weight variable and the volume variable reserved by each category, assigning a probability to each previous instance of the cargo flight, estimating a potential profile of a potential value of the weight variable and the volume variable from each historical profile according to a corresponding current value of the capacity variable reserved by the category for the future instance of the cargo flight and according to a corresponding unconstrained demand of the weight variable and the volume variable for the category in the previous instance of the cargo flight, defining a historical scenario for each previous instance of the cargo flight, the historical scenario including a final potential capacity variable from each corresponding potential profile, the final potential variable comprising a final potential weight capacity variable and a final potential volume capacity variable; determining an authorisation to allocate the offered capacity for the weight variable and the volume variable of each category in the future instance of the cargo flight by applying a stochastic model to the historical scenarios according to the corresponding probabilities; providing a determination to a display of a computing unit of an acceptance or a rejection of a request for the cargo flight based on the authorization; and wherein each historical profile and each potential profile include a plurality of corresponding snapshots of the reserved capacity variable and of the potential capacity variable, respectively, the estimating the potential profile comprising: estimating an opening coefficient for each period comprised between two consecutive snapshots, the opening coefficient being indicative of a percentage of time during which the category was open in the period, calculating an emphasis value for each period as a weighted mean of a gradient in the period of the reserved capacity variable for the category in a subset of the corresponding historical profiles, estimating a potential gradient for each period as a linear interpolation between the gradient, and constructing the potential profile from a time corresponding to the current time by integrating the potential gradients starting from the corresponding current capacity variable.

8811715

13644151

1. A system for decoding a data symbol marked on an object, the system comprising a wafer identification fault server configured to: receive a digital image, the digital image comprising an image of a data symbol marked on an object, the data symbol comprising a message encoded in a set of data cells arranged in a regular pattern, each data cell comprising one bit of information encoded using a recognizable mark at a location of the data cell; process the digital image to form a set of classified data cells, wherein one or more classified data cells from the set of classified data cells comprises an error, each classified data cell being associated with a data cell from the set of data cells, and comprising: a data cell location of the associated data cell in the digital image; and a data cell state indicating a presence of a recognizable mark of the associated data cell in the digital image; transmit user interface data comprising the digital image and interactive graphics, the interactive graphics including at least one data cell control, each data cell control being associated with a classified data cell in the set of classified data cells; receive interaction data from the interactive graphics that modifies a data cell location, a data cell state, or both, of at least one classified data cell from the set of classified data cells to form a modified set of classified data cells; and generate an error free decoded message string based on the modified set of classified data cells.

9753895

14818349

1. A method for process variation analysis of an integrated circuit, the method comprising: generating a netlist describing electronic devices of an integrated circuit in terms of device parameters and process parameters, wherein the process parameters include local process parameters individual to the electronic devices and global process parameters common to the electronic devices; identifying critical electronic devices having device parameters with greatest contributions to one or more performance parameters of a design specification, wherein the design specification corresponds to the integrated circuit; determining sensitivity values for the global process parameters and local process parameters of the critical electronic devices, wherein the sensitivity values represent how much the one or more performance parameters change in response to variations in the global process parameters and the local process parameters of the critical electronic devices; sorting Monte Carlo (MC) samples, wherein the MC samples are vectors of values for the process parameters, and wherein the sorting is based on the sensitivity values and the values of the MC samples; performing a MC simulation on the sorted MC samples; and manufacturing the integrated circuit selectively depending on results of the MC simulation.

8346710

12696921

1. A computer-implemented method, comprising: receiving, at data processing apparatus, exposure data and control data, the exposure data describing exposed subjects and the control data describing control subjects, each of the exposed subjects being a subject that was exposed to a treatment, and each of the control subjects being a subject that was not exposed to the treatment, wherein the exposure data includes values for a plurality of features for each exposed subject, the plurality of features for each exposed subject including features describing actions taken by the exposed subject, and wherein the control data includes values for a plurality of features for each control subject, the plurality of features for each control subject including features describing actions taken by the control subject; determining, from the exposure data and the control data, a test statistic for each of a plurality of subject actions including a desired action and a plurality of placebo actions, wherein the desired action is an action that is hypothesized to be possibly affected by the treatment and each placebo action is an action that is hypothesized to be unaffected by the treatment, and wherein the test statistic for an action corresponds to an estimated effect that exposure to the treatment has on a likelihood that a subject will take the action; comparing, in the data processing apparatus, the test statistic for the desired action to the test statistics for the plurality of placebo actions; and determining, in the data processing apparatus, whether the test statistic for the desired action is statistically significant according to the comparison.

20110137847

12958368

1. A method comprising: determining, using one or more processors, covariates associated with a unit representing at least one of an individual and an account of the individual; determining, using the one or more processors, decision alternatives based on the covariates; determining, using the one or more processors, potential outcomes for the decision alternatives; and determining, using the one or more processors, a treatment effect by performing a statistical analysis using the potential outcomes.

10127609

14868620

1. A system comprising: (a) a portfolio, asset, and bid computer server including: a first network communication interface; a first processor; a first memory accessible to the processor; and first programming in the first memory comprising software modules, including a selling software module and a bidding software module, wherein execution of the first programming by the first processor configures the portfolio, asset, and bid computer server to perform functions, including functions to: receive, via the selling software module, a first communication data transmitted from a seller computing device via a network, the first communication data indicating a portfolio having a plurality of individual assets for sale; in response to receiving the first communication data, store the first communication data indicating the portfolio having the plurality of individual assets for sale in a database; receive, via the bidding software module, a second communication data from each of a plurality of bidder computing devices through the network, the second communication data received from each bidder computing device indicating a bid on one or more of the individual assets of the portfolio from a respective bidder, each bid including: one or more separate bid amounts for each individual asset of the portfolio, a minimum constraint that specifies a minimum purchase amount across all of the individual assets for sale in the portfolio issued by the respective bidder, and a maximum constraint that specifies a maximum purchase amount across all of the individual assets for sale in the portfolio issued by the respective bidder; in response to receiving the second communication data from each of the plurality of bidder computing devices, store the bid in the database; and after storing the first communication data indicating the portfolio having the plurality of individual assets for sale from the seller computing device and the second communication data indicating the bid from each of the plurality of bidder computing devices, receive, via the selling software module, a query from the seller computing device for an aggregate combination of bids on the plurality of individual asset of the portfolio; (b) an optimization computer server including: a second network communication interface; a second processor; a second memory accessible to the processor; and second programming in the second memory comprising software modules, including an optimization software module, wherein execution of the second programming by the second processor configures the optimization computer server to perform functions, including functions to: in response to the query for the aggregate combination of bids, determine, via the optimization software module, the combination of bids subject to the minimum and maximum constraints of the bids by: retrieving from the database and then storing in the second memory a portfolio array including M number of elements, each portfolio array element corresponding to a bid array of bids on the plurality of individual assets of the portfolio, wherein each bid array includes N number of elements, each bid array element corresponding to a bid amount on one of the plurality of individual assets in the portfolio, the minimum constraint, and the maximum constraint; and reducing a size of an iteration space to determine the aggregate combination by generating an accumulated unconditional bid array that selects the maximum bid amount for each individual asset of the portfolio from a plurality of unconditional bid arrays, wherein each unconditional bid array imposes no minimum or maximum constraints; (c) a secure local area network coupled to the portfolio, asset, and bid computer server and the optimization computer server to provide communications for the portfolio, asset, and bid computer server and the optimization computer server, including communications between the portfolio, asset, and bid computer server and the optimization computer server; (d) a firewall coupled to the secure local area network to provide a communication gateway to a wide area network serving the seller computing device and the plurality of bidder computing devices that are configured as clients of one or both of the portfolio, asset, and bid computer server and the optimization computer server; and (e) wherein the database is contained in a non-transitory storage device accessible to the first processor of the portfolio, asset, and bid computer server and the second processor of the optimization computer server, the database comprising a database structure for the first communication data indicating the portfolio having the plurality of individual assets for sale from the seller computing device and the second communication data indicating the bid from each of the plurality of bidder computing devices.

8244760

12631756

1. A computer program product comprising one or more physical devices having stored thereon computer-executable instructions that, when executed by one or more processors of the computing system, cause the computing system to perform a method of efficiently creating profile groups of users using a two step approach which creates segments of user attributes and then generates profile groups based on the segments, the created profile groups being used to customize a user interface of an application, the method comprising: an act of storing a plurality of user records, each user record including a plurality of user attributes; an act of providing a segment definition user interface configured to allow a user to define multiple segments, each segment defined according to a single user attribute and a function to apply to each user record to determine whether the user record is to be included in the segment; an act of receiving user input to the segment definition user interface that defines a plurality of segments, the user input defining a user attribute and a function for each segment; an act of providing a profile group definition user interface configured to allow a user to define a plurality of profile groups, each profile group being defined by an operation that determines which user records are to be included in the profile group by specifying two or more segments and one or more Boolean operations to apply to the user records in each set; an act of automatically populating each of the defined segments by applying the corresponding function for the segment against each of the plurality of user records such that each user record matching the corresponding function for the segment is included in the segment; and after the segments are populated, an act of automatically populating each defined profile group by performing the corresponding operation to determine which user records are to be included in the profile group.

9224041

11923904

1. A method comprising: selecting organizational table entry/target text fragment pairs of an organizational table from text fragments of a same document based on textual similarity, each pair of text fragments comprising a text fragment of an organizational table entry and a candidate target text fragment of the same document; training a classifier to identify organizational table entry/target text fragment pairs of the organizational table using a training set having positive examples including at least some of the selected organizational table entry/target text fragment pairs and negative examples including at least some text fragment pairs of the document not selected as organizational table entry/target text fragment pairs, the classifier considering features including at least one text formatting feature; and reselecting organizational table entry/target text fragment pairs of the organizational table of the document using the trained classifier.

10018922

15014677

1. A method for controlling a placement of an edge of an image of a reticle pattern formed on a wafer in a lithographic exposure process with an exposure tool having an optical projection system, the method comprising: determining first operational factors based on operation of said exposure tool, the first operational factors representing the exposure tool the first operational factors including i) setup parameters of said exposure tool; ii) optical aberrations of an illuminator and a projection lens of the optical projection system, the illuminator and the projection lens being in optical communication through a reticle carrying the reticle pattern; and iii) a signature of the optical system of the exposure tool; optimizing, with a computer device, a merit function to produce a value of a change of a setup parameter from the setup parameters, wherein the merit function represents a contribution of a first operational factor, from the first operational factors, to a first measure of a shift in a position of an edge of said image with respect to a target position thereof; and modifying, based on said value of the change, the exposure tool by changing at least one of a) one or more of a presence, position, orientation, size and shape of an optical component of the optical projection system; and b) a parameter of scanning synchronization of the exposure tool to form an image with a second measure of said shift, wherein the second measure is reduced in comparison with the first measure.

8782017

13323730

1. A computer implemented method employed in a relational database management system of compressing a data value which includes at least one internal delimiter, the method comprising: using a computing system having a processor to perform a process, the process comprising: parsing a data value corresponding to an RDF (Resource Description Framework) triple having a subject-predicate-object expression to locate the at least one internal delimiter; using the at least one internal delimiter to divide the RDF triple into a prefix and a suffix, in which the prefix includes a non-null, first portion of the RDF triple preceding the at least one internal delimiter, and the prefix and the suffix are separated by the at least one internal delimiter in the RDF triple; and placing the prefix and the suffix into at least two separate fields of an entry in the relational database management system to separately store the prefix and the suffix to compress the RDF triple, wherein a subject of the RDF triple corresponds to the suffix of the RDF triple.

7511811

11248910

1. A method of identifying sample components comprising: (a) preparing a sample comprising sample components, a first dye and a second dye; (b) placing the sample in the beam path of a first excitation line and a second excitation line; (c) sequentially firing the first excitation line and the second excitation line; (d) collecting fluorescence signals from the samples as a function of time; and (e) sorting the fluorescence by each excitation line's on-time window, wherein the sample components are identified.

8538983

13239069

1. An apparatus for electronically identifying a separation method for separating one or more chemical compounds in a sample, the apparatus comprising: a processor; and a memory having a set of instructions stored thereon, wherein the instructions, when executed by the processor, cause the processor to: receive a user query comprising a first chemical structure and a second chemical structure; access a relational database, wherein the relational database comprises substance data regarding a plurality of substances, wherein each substance of the plurality of substances comprises a respective set of chemical substance properties, and experimental run data from a plurality of completed separation experiments, wherein the experimental data comprises a set of separation method properties and a set of separation run properties, wherein each separation method property of the set of separation method properties and each separation run property of the set of separation run properties is linked in the relational database to at least one respective chemical structure object of a plurality of chemical structure objects, wherein each chemical structure object of the plurality of chemical structure objects corresponds to one or more compounds separated in a respective separation experiment of the plurality of completed separation experiments, and wherein each chemical structure object of the plurality of chemical structure objects is linked in the relational database to a respective set of chemical structure properties associated with a particular substance of the plurality of substances; identify, within the relational database, responsive to the user query, a) experimental data associated with separating the first chemical structure, and b) experimental data associated with separating the second chemical structure, wherein the experimental data associated with separating the first chemical structure comprises at least one of separation method properties and separation run properties for separating the first chemical structure, and the experimental data associated with separating the second chemical structure comprises at least one of separation method properties and separation run properties for separating the second chemical structure; determine one or more common values common to both a) the experimental data associated with separating the first chemical structure, and b) the experimental data associated with separating the second chemical structure; determine a preferred separation method for separating both the first chemical structure and the second chemical structure, wherein the preferred separation method comprises the one or more common values; and provide, as at least a portion of query results presented to a user responsive to the user query, the preferred separation method.

5416696

07952412

1. An apparatus For translating original words in an original sentence written by a first language into words in a translated sentence of a second language, comprising: sentence structure memory means for storing parts of speech of the original words which are required to analyze the sentence structure of the original sentence; first language grammar memory means for storing the grammar of a first language of the original sentence; second language word memory means for storing the words of the second language, wherein each of the original words classified as monosemy linguistically and semantically corresponds to a word of the second language stored in the second language word memory means and each of the original words classified as polysemy linguistically corresponds to a plurality of words of the second language stored in the second language word memory means; second language grammar memory means for storing the grammar of the second language; inflection memory means for storing inflection information of the words of the second language; processing means for (1) operating an artificial neural network in which a plurality of artificial neurons are assigned the words of the second language stored in the second language word memory means, positive links through which the artificial neurons assigned the words semantically relevant to one another are interconnected are weighted with positive values to increase the output values of the artificial neurons in cases where an external input is provided to one of the artificial neurons, and negative links through which the artificial neurons assigned the words semantically irrelevant to one another are interconnected are weighted with negative values to decrease the output values of the artificial neurons in cases where an external input is provided to one of the artificial neurons. (2) providing external inputs Im to artificial neurons Nm which are assigned words Wm of the second language linguistically and semantically corresponding to the original words classified as the monosemy to increase the output values of artificial neurons Nms assigned the words semantically relevant to the words Wm and to decrease the output values of artificial neurons Nmi assigned the words semantically irrelevant to the words Wm, (3) providing an external input Ip, one after another, to each of the artificial neurons Nms to considerably increase the output values of artificial neurons Nmp which belongs to the artificial neurons Nms and artificial neurons Np assigned the words of the second language linguistically corresponding to the original words classified as the polysemy, the external input Ip provided to each of the artificial neurons Nms being stored therein, and the value of the external input Ip previously stored in the artificial neurons Nms being uniformly reduced to again provide to each of the artificial neurons Nms as past records each time the external input Ip is provided to each of the artificial neurons Nms. (4) repeatedly converging the output values of all of the artificial neurons each time the external input Ip is provided to each of the artificial neurons Nms, (5) adopting words Wmp assigned to the artificial neurons Nmp, as translated words, of which the output values are considerably increased, and (6) adopting the words Wm as the translated words, the translated sentence being composed of the word Wmp and the words Wm; and translation means for translating the original sentence into the translated sentence according to a translation process in which (1) the sentence structure of the original sentence is analyzed by referring the parts of speech of the original words stored in the sentence structure memory means and the grammar of the first language stored in the first language grammar memory means, (2) the original words are changed to a series of words which are composed of the words linguistically corresponding to the original words classified as the monosemy and the words Wmp, Wm adopted in the processing means, and (3) a series of words of the second language are changed to the translated sentence by referring the grammar of the second language stored in the second language grammar memory means and the inflection information of the words of the second language stored in the inflection memory means.

20100131507

12696115

1. A computer-implemented method for building a dynamic classification dictionary, the method comprising: analyzing author-generated classification information regarding a document with a content analysis server and assigning a set of first taxonomic nouns to characterize the document based upon the author-generated classification information; examining a user-generated tag from a client computer characterizing a portion of the document and assigning a set of second taxonomic nouns to characterize the document based upon the user-generated tag characterization; identifying a search term that resulted in the user accessing the document from a content provider site server and assigning a set of third taxonomic nouns to characterize the document based upon the search term; evaluating attributes related to the manner in which the user accesses the document from the content provider site server and assigning a set of fourth taxonomic nouns to characterize the document based upon the attributes related to the manner in which the document was accessed; processing the document with a content analysis server to extract a set of fifth taxonomic nouns to characterize the document based upon a predetermined pattern rule; aggregating the set of first taxonomic nouns, the set of second taxonomic nouns, the set of third taxonomic nouns, the set of fourth taxonomic nouns, and the set of fifth taxonomic nouns into a composite set of taxonomic nouns with a dictionary builder server; and building a dynamic classification dictionary with the dictionary builder server by storing the composite set of taxonomic nouns.

8346525

12655988

1. A method of modeling solubility of a pharmaceutical component in a mixture that includes at least one pharmaceutical component and at least one solvent using a modeler, the method comprising the computer implemented steps of: a) providing a computer programmed to serve as a modeler, the modeler during execution being formed of (i) a databank of molecular descriptors of known pharmaceutical components and known solvents, and (ii) a calculator of molecular descriptors of unknown pharmaceutical components and unknown solvents, the modeler being configured to be executable by a processor; b) determining at least one conceptual segment, instead of a molecular structural segment, for the at least one pharmaceutical component, including for each conceptual segment, (i) identifying the conceptual segment as one of a hydrophobic segment, a hydrophilic segment, a polar segment, or a combination thereof, and (ii) defining a segment number for the conceptual segment, the segment number being based on experimental data and being one of carried in the databank of molecular descriptors of known pharmaceutical components or obtained using the calculator of molecular descriptors of unknown pharmaceutical components by best fit of experimental phase equilibrium data for binary systems of unknown pharmaceutical components and reference pharmaceutical components; c) determining at least one conceptual segment, instead of a molecular structural segment, for the at least one solvent, including for each conceptual segment, (i) identifying the conceptual segment as one of a hydrophobic segment, a hydrophilic segment, a polar segment, or a combination thereof, and (ii) defining a segment number for the conceptual segment, the segment number being based on experimental data and being one of carried in the databank of molecular descriptors of known solvents or obtained using the calculator of molecular descriptors of unknown solvents; d) providing the determined at least one conceptual segment to the modeler, and in response the modeler using the determined at least one conceptual segment for the at least one pharmaceutical component and the determined at least one conceptual segment for the at least one solvent, to compute solubility of the at least one pharmaceutical component in the mixture, the modeler computing the solubility by determining an activity coefficient of the at least one pharmaceutical component, the activity coefficient being formed of at least a local composition interaction contribution to the activity coefficient of the at least one pharmaceutical component based on the determined at least one conceptual segment; e) analyzing the computed solubility, said analyzing being by the modeler and resulting in the modeler forming a solubility model of the at least one pharmaceutical component in the mixture; and f) outputting the formed solubility model from the modeler to a computer display monitor.

5553144

08439934

1. A method for selectively electronically enabling functional capabilities of hardware elements in a data processing system, said method comprising the steps of: providing a data processing system including a plurality of hardware elements, wherein respective ones of said hardware elements include a predetermined set of functional capabilities; storing a multibit alterable code within a nonvolatile storage device within said data processing system, said multibit alterable code corresponding to a subset of said predetermined set of functional capabilities; and enabling said subset of said set of functional capabilities each time power is applied to said data processing system, said step of enabling being in response to a state of said multibit alterable code.

6105520

09301653

1. A quilt manufacturing system comprising: a plurality of quilting machines, each having a programmed controller operative to control the machines to produce quilted products on multi-layered material in accordance with product configuration data; a scheduling sub-system having communication links to each of the quilting machines; a customer order input station for receiving customer order data identifying quilted products to be manufactured for customers; digital storage media connected to the scheduling sub-system containing: data identifying each of the quilting machines and certain of their features that affect details of quilted products identified in the customer order data and made by the respective machines, data identifying material from which quilted products identified in the customer order data are made, and data of details of each respective product identified in the customer order data, which details specify materials of which the products are made and pattern and other machine parameter data required by a quilting machine to make the respective product; and the scheduling sub-system including a digital processor programmed to generate schedules for each of the machines and to download schedules to controllers of each of the machines to cause the production of quilted products identified in the customer data, the processor being programmed to evaluate the material identifying data, the product details data and the machine identifying and feature data, and to determine the content of the generated schedules based on the evaluation.

9213768

12780685

1. A method, comprising: receiving, at one or more computing devices, a query that includes a word having multiple meanings, having multiple senses, or that corresponds to multiple entities; when the word is not recognized by the one or more computing devices: determining, based at least in part on relative placement of alphabetic characters, numeric characters, and non-alphanumeric characters of the word, one or more entities to which the word corresponds, or choosing, based at least in part on the relative placement of alphabetic characters, numeric characters, and non-alphanumeric characters of the word, one meaning or sense; when the word is recognized by the one or more computing devices and the word refers to multiple entities, determining, with one or more computing devices, the entities to which the word corresponds; when the word corresponds to multiple entities in a same category, ranking, with one or more computing devices, the multiple entities in the same category to which the word corresponds using a set of attributes common to entities in the category, wherein the set of attributes is different than other sets of attributes common to entities in other categories; when the word is recognized by the one or more computing devices and the word has multiple meanings or senses, ranking, with one or more computing devices, the multiple meanings or senses of the word based on attributes of a user; when the word is recognized by the one or more computing devices and the word has multiple meanings or senses, ranking, with one or more computing devices, one or more meanings or senses of the word based on a measure of popularity of the one or more meanings or senses; when the word corresponds to multiple entities in a same category, or the word is recognized by the one or more computing devices and the word has multiple meanings or senses, choosing, with one or more computing devices, one meaning or sense based on the rankings; and generating, with one or more computing devices, either: a new query and query results based on the one meaning or sense, or query results based on the one meaning or sense.

20100173318

12724114

1. A method for determining a reduced genome, comprising: selecting a minimal set of reactions from a set of metabolic reactions that meets a growth rate target; mapping enzymes catalyzing the minimal set of reactions to a corresponding set of coding genes, the corresponding set of coding genes defining a reduced genome.

20120166530

12976859

1. A computer-implemented method for timing notifications of third-party content objects to a user of a social networking system, the method comprising: identifying third-party content objects associated with a user of the social networking system; establishing, for each of a plurality of time periods of a day, a maximum rate at which to provide notifications of third-party content objects to the user; providing a first set of notifications of third-party content objects to a user device of the user at the maximum rate for each of the plurality of time periods; identifying user interactions with the first set of notifications; identifying patterns in the user interactions describing characteristics of the user's interactions with the first set of notifications; adjusting the maximum rate for each of the plurality of time periods based at least in part on the identified patterns; and providing a second set of notifications of third-party content objects to the user device at the adjusted maximum rate for each of the plurality of time periods.

10073840

14136919

1. A method of automatically generating natural language patterns based on a knowledge graph, the method comprising: selecting a relation from a knowledge graph; extracting at least a first pair of words from the knowledge graph, wherein the first pair of words is connected by the relation; receiving a set of documents as a search result based on a first query, wherein the first query comprises at least one instruction to select documents based on the first pair of words; extracting, from the set of documents, at least one textual snippet based on the first query, wherein the at least one textual snippet includes at least in part the first pair of words; extracting a second query from a query click log, wherein the query click log comprises at least one search query against at least a part of the set of documents and at least one link to at least one document, and wherein the second query is associated with at least one link to the at least one document containing the at least one textual snippet; generating a first set of training patterns, wherein the first set of training patterns is based on association between the at least one textual snippet and the relation; generating a second set of training patterns, wherein the second set of training patterns is based on association between the second query and the relation; generating a third set of natural language patterns for the knowledge graph, wherein generating the set of natural language patterns further comprises selectively combining the first set of training patterns and the second set of training patterns based on at least one weight between the first set of training patterns and the second set of training patterns; and applying the generated third set of natural language patterns to the knowledge graph to automatically train a natural language dialog system.

9989505

14212480

1. A gas chromatography-mass spectroscopy (GC-MS) system for identifying an unknown sample, the GC-MS system comprising: a gas chromatograph configured to determine experimental chromatographic data for a calibration sample and an unknown sample, the experimental chromatographic data comprising a first retention time associated with the calibration sample and a second retention time associated with the unknown sample; a toroidal ion trap mass spectrometer configured to determine experimental mass spectral data for the unknown sample, the experimental mass spectral data comprising a mass spectrum associated with the unknown sample; and a controller coupled with the gas chromatograph and the toroidal ion trap mass spectrometer for receiving the experimental chromatographic data and the experimental mass spectral data, determining a retention index for the unknown sample by comparing the first retention time associated with the calibration sample to a retention time recorded for the calibration sample in an electronic database comprising reference mass spectral data, the retention index for adjusting the second retention time associated with the unknown sample to filter the electronic database comprising reference mass spectral data to identify a subset of a plurality of database entries, at least one of the plurality of database entries comprising mass spectral data measured using a quadrupole mass spectrometer, and comparing the experimental mass spectral data to the filtered subset of the plurality of database entries to identify the unknown sample and providing an identification of the unknown sample via an input/output device, wherein the comparison comprises matching the experimental mass spectral data for the unknown sample to at least one database entry of the filtered subset of the plurality of database entries based upon detecting by the toroidal ion trap mass spectrometer at least one of (A) a first mass fragment having a mass equal to the molecular weight of the unknown sample plus a value of one, (B) a second mass fragment having a mass equal to two times the molecular weight of the unknown sample plus a value of one, or (C) a third mass fragment with a neutral molecule.

8983892

13463935

1. An information processing apparatus comprising: a memory configured to have computer readable program stored thereon; and a central processing unit (CPU) arranged to receive the program from the memory and upon execution thereof to operate as (i) a first calculation unit that calculates a probability function with highest likelihood based on data, (ii) a second calculation unit that calculates a canonical distribution in statistical physics and a parameter of the canonical distribution as a fluctuation of the data, and (iii) an estimation unit that estimates a probability function using the probability function with the highest likelihood calculated by the first calculation unit, the fluctuation calculated by the second calculation unit, and the canonical distribution, wherein when the second calculation unit calculates the fluctuation of the data, n data items are used, and Kullback-Leibler information is calculated by the probability function calculated based on (n-1) data items by the estimation unit and one of a probability function with the highest likelihood calculated based on the n data items, a Bayesian posterior probability function, and an empirical distribution function.

8762934

12906050

1. A method of defining a business object model comprising: defining a plurality of named logical types, field-sets, business objects and sub-objects, structures and enumerations that are referenced in the model by their names, wherein defining the business objects further comprises listing the plurality of their fields, each field having a type attribute referencing a logical type defined in the model, and field-sets, each field-set referencing a corresponding field-set defined in the model and the plurality of business object operations and sub-objects; wherein defining business objects and sub-objects further comprises marking a single field or a field-set with a key attribute, which indicates that the key is serial (for fields only), or is user-supplied, or is a reference to another object's key attribute; and wherein no two objects can both have their key fields marked as serial or marked as user-supplied with the same logical types, and wherein no two objects can both have their key field-sets marked as user-supplied and as referencing the same field-set defined in the business object model.

8024277

12131162

1. A method for establishment of causal regulation network from time series data, comprising the following steps: obtaining a time-series dataset comprising data obtained at a series of time points; generating from a computer tool a first predetermined amount of causal regulation network templates as candidate networks, each candidate network structure being represented by an integer array for genetic algorithm operations; fitting data of said dataset into said candidate networks by downhill simplex method; calculating joint probability density (score) of said fitted candidate networks, S, according to the following equation, respectively: score ⁡ ( S ) = log ( P ( x ❘ S , Θ ⋒ ) - _ ) ) - d 2 ⁢ log ( R · n · ( T - 1 ) ) wherein score(S) approximates the logarithm of the joint probability density of a candidate network, S, and the parameters, {circumflex over (Θ)}, represent the values of the parameters Θ that maximize the likelihood function P(x|S,Θ), wherein: P ⁡ ( x ❘ S , Θ ) = ∏ t = 1 T - 1 ⁢ ⁢ ∏ i = 1 n ⁢ ⁢ p ⁡ ( x i , t ; θ i ) , wherein p(x i , t; θ i ) represents conditional probability density of datum i in said candidate network at time t, relatively to parameters θ i , Θ is the cell containing parameters θ I , n represents number of data included in said candidate networks and T represents number of time points, and x i is the value of datum i and is non-negative real; wherein: p ⁡ ( x i , t + 1 ; θ i ) = N ( x i ⁡ ( t + 1 ) - α i ⁢ ∏ j ⁢ x j ⁡ ( t ) ω ji - ( 1 - β i ) ⁢ x i ⁡ ( t ) , δ 2 ) wherein exponent, ω ji , is real, wherein, when ω ji is positive (negative), datum j induces (represses) the value of datum i and, α i and β i are both positive constants, quantifying the rate of induction and repression, respectively, x i ⁡ ( t + 1 ) = α i ⁢ ∏ j ⁢ ⁢ x j ⁡ ( t ) ω ji + ( 1 - β i ) ⁢ x i ⁡ ( t ) + ɛ i ⁡ ( t ) wherein ε i (t) is the measurement error for datum i at time t, δ 2 is variance of distribution in a Gaussian distribution representing said errors, ε i (t); and d 2 ⁢ log ⁡ ( R · n · ( T - 1 ) ) _ is a penalty against structure complexity, d equals to the number of parameters in said candidate network, n represents number of data included in said fitted candidate networks, T represents number of time points 0, 1, 2,. .. , T−1, and R represents number of repeats of said measurement; selecting from said fitted candidate networks a second predetermined number of candidate networks with the highest score values; mating and mutating said selected candidate networks according to the genetic algorithm to generate offspring candidate networks; fitting data of said dataset into said offspring networks and calculating score values of said offspring networks; determining whether the average of the obtained score values reaches a plateau; if not, repeating steps of said mating and mutating and said score calculation; otherwise, selecting a third predetermined number of the offspring candidate networks with highest score values; and outputting said selected offspring candidate networks as result of establishment of causal regulation network.

20160140142

15006482

1. A system for automatic folder ownership assignment in an enterprise computer network, the system comprising: actual modification scrutinizing functionality operative for ascertaining which first folders, among a first multiplicity of folders in an enterprise computer network, have been at least actually modified by entities other than IT administration entities, and adding said first folders to a list of base-folder candidates for ownership assignment; first pruning functionality operative for defining a second multiplicity of folders, said second multiplicity of folders being a subset of said first multiplicity of folders which does not include said first folders, all descendents of said first folders and all ancestors of said first folders; actual access scrutinizing functionality operative for ascertaining which second folders among said second multiplicity of folders, have been at least actually accessed by entities other than IT administration entities and adding said second folders to said list of base-folder candidates for ownership assignment; second pruning functionality operative for defining a third multiplicity of folders, said third multiplicity of folders being a subset of said second multiplicity of folders which does not include said second folders, all descendents of said second folders and all ancestors of said second folders; topmost folder scrutinizing functionality operative for ascertaining which third folders among said third multiplicity of folders are topmost folders and adding said third folders to said list of base-folder candidates for ownership assignment; and possible ownership assignment recommendation functionality operative for recommending possible assignment of ownership of at least one of said list of base-folder candidates.

20160084817

14844134

1. A method for exploration, production and development of hydrocarbons comprising: obtaining a sample comprising hydrocarbons; analyzing the sample for a geochemical signature, wherein the geochemical signature comprises one or more of a multiply substituted isotopologue signature and a position specific isotope signature; determining one or more of historical temperature, type of alteration, and extent of alteration from one or more of the multiply substituted isotopologue signature and position specific isotope signature; and developing or refining an exploration, development or production strategy based on the determined one or more of one of historical temperature, type of alteration, and extent of alteration.

8370332

13008886

1. A method implemented by data processing apparatus, the method comprising: obtaining search results that each satisfy a search query, the search results including a plurality of generic search results and a plurality of mobile search results, wherein the generic search results each identify a respective generic resource and have a respective search result quality score, and wherein the mobile search results each identify a respective mobile resource; and have a respective search result quality score; determining that the mobile search results fall into a plurality of non-overlapping mobile score sub-ranges based on the respective search result quality scores of the mobile search results; determining a corresponding generic score sub-range for one or more of the mobile score sub-ranges wherein the generic score sub-range is different than the mobile score sub-range; modifying the respective search result quality scores of one or more mobile search results that fall into a mobile score sub-range of the mobile score sub-ranges so that the modified respective search result quality scores fall within the corresponding generic score sub-range; ranking the search results based at least partly on the respective search result quality scores and the modified respective search result quality scores; providing the ranked search results to a client device; and wherein obtaining, determining, modifying, ranking, and providing are performed by the data processing apparatus.

20030176212

10078295

1. A method of operating a video gaming machine which simulates a real physical game initiated by placing an object in motion in accordance with a set of initial conditions and proceeding to one of a plurality of outcomes corresponding respectively to final resting conditions of the object, the method comprising: establishing in software a mathematical model of the game including a plurality of rules governing movement of the object once it is placed in motion, establishing a range of possible values for each of a plurality of parameters, randomly selecting for each parameter a value from its associated range of values to establish the set of initial conditions, running the set of initial conditions through the model for simulating movement of the object to a final resting condition to determine the outcome, and displaying the simulated movement of the object.

20160147209

14549515

1. A method for monitoring and management of a power distribution system, the method comprising: receiving sensory measurement data captured by a mobile inspection device during an inspection of power distribution system elements in a power distribution system; processing the received sensory measurement data to derive fault identification data that indicates a fault condition existing in one or more of the power distribution system elements; and utilizing the derived fault identification data to update a network model of the power distribution system.

7599797

11350655

1. A method of mitigating risk of subsurface well collision, comprising: obtaining a survey of a field wherein a subject well is to be drilled; running an anti-collision scan while planning or drilling the subject well to determine if a requirement to be fulfilled in the process of drilling the subject well is violated, the requirement being based on the field survey to avoid collision between the subject well and offset wells in the field; generating an anti-collision report indicating if and where along the subject well the requirement to be fulfilled in the process of drilling the subject well is violated; generating a request for an exemption to the requirement that is violated, the request indicating a severity of the risk of collision between the subject well and an offset well from minor to major risk; assessing the exemption request using a three-dimensional matrix, the dimensions including parameters comprising a center-to-center distance, a separation factor, a surface rule, a mud weight, a hydrostatic pressure, a collision depth, a reservoir pressure, a magnetic scan, a survey program, or a completion type; deriving a cell within the matrix during assessment of the exemption request based on values for the parameters of the matrix dimensions for the subject well included in the exemption request; and generating a visual display of the exemption request assessment results to determine if action is required to manage the likelihood of an event controlling a risk of collision or to reduce or eliminate the potential risk of collision between the subject well and an offset well based on a set of actions in the derived matrix cell.

9708587

14794249

1. A recombinant cytochrome P450-BM3 variant comprising the amino acid sequence of SEQ. ID NO: 16.

9424318

14242849

1. A method of generating data visualization options for a set of data, comprising: at a computing device having one or more processors and memory, wherein the memory stores one or more programs for execution by the one or more processors: receiving user selection of a plurality of data fields from the set of data and receiving user specification of a single view type; generating a plurality of data visualization options according to the user specified single view type, wherein each data visualization option associates each of the user-selected data fields with a respective predefined visual specification feature; for each of the generated data visualization options, computing a score based on a set of ranking criteria, wherein a first ranking criterion of the set of ranking criteria is based on values of one or more of the user-selected data fields in the set of data; and creating a ranked list of the data visualization options, wherein the ranked list is ordered according to the computed scores of the data visualization options.

9082195

13652572

1. A method for evaluating a possible pallet object in a gray scale image including one or more pallets, comprising: generating, by a computer, a first confidence score Score LowerLeftCorner for a stringer lower left corner associated with the possible pallet object; generating, by the computer, a second confidence score Score LowerRightCorner for a stringer lower right corner associated with the possible pallet object; generating, by the computer, a third confidence score Score BaseboardLine for a bottom pallet board line associated with the possible pallet object; generating, by the computer, a fourth confidence score Score hole for a center stringer associated with the possible pallet object; and calculating, by the computer, a composite score Score Object based on the first, second, third and fourth confidence scores, wherein the composite score Score Object represents a likelihood that the possible pallet object corresponds to an actual pallet structure in the gray scale image.

7836046

12017054

1. A method for facilitating verification of an entity against a reference database, wherein the entity comprises a plurality of attributes and the reference database comprises a plurality of entities, the method comprising: obtaining a set of attributes from the plurality of attributes based on a set of predefined parameters; selecting a set of algorithms corresponding to each attribute belonging to the set of attributes; categorizing at least one attribute belonging to the set of attributes in at least one attribute category and at least one algorithm belonging to the set of algorithms in at least one algorithm category, wherein the at least one attribute is categorized based on a first predefined criteria and the at least one algorithm is categorized based on a second predefined criteria; classifying the at least one attribute from an attribute category in at least one attribute group and the at least one algorithm from an algorithm category in at least one algorithm group, wherein the at least one attribute is classified based on a third predefined criteria and the at least one algorithm is classified based on a fourth predefined criteria; associating an attribute category weight to an attribute category, an attribute group weight to an attribute group and an attribute weight to an attribute belonging to the set of attributes based on the set of predefined parameters; assigning an algorithm category weight to an algorithm category, an algorithm group weight to an algorithm group and an algorithm weight to an algorithm based on the set of attributes; and executing at least one algorithm belonging to a set of algorithms corresponding to each attribute.

8255344

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.

7846024

11561374

1. A method performed by one or more computers comprising a processor and memory, the comprising: maintaining a database of scores of players of one or more online games, each score of a player comprising a mean and a variance; receiving a request to match two teams; given a plurality of teams each comprised of some of the players in the database, retrieving from the database the scores of the players in each of the teams, and for each team, computing a team score based on the means and the variances of the players in the respective teams; for a first team from among the teams, computing quality scores of the first team with respect to each of the other teams, respectively, where a quality score between the first team and any second team from among the other teams is computed based at least on the team score of the first team and the team score of the second team, wherein the quality score comprises a distribution function of probabilities of game outcomes if the first team and second team played the one or more online games; determining a match quality threshold; selecting the second team from among the plurality of teams based on a comparison of the quality scores and the match quality threshold; and providing to the first team an indication of the selection of the second team.

20090123915

11719033

1. A high-throughput method for quantitative measurement of global genomic 5-methylcytosine content, comprising: obtaining a test sample comprising genomic DNA; and determining, using a quantitative real-time, bisulfite-based PCR assay, the methylation status of at least one CpG dinucleotide sequence of at least one repetitive genomic sequence selected from the group consisting of Alu, LINE-1, and Chr1 centromeric Sata and juxtacentromeric Sat2 repeat sequences, wherein the at least one repetitive genomic sequence provides a surrogate marker for global genomic 5-methylcytosine content, and wherein a quantitative measurement of global 5-methylcytosine content is thereby provided.

7769843

11525511

1. A server migration tool stored in a memory for predictive analysis of a computer network comprising: a source data center configuration; a source parameter set; a graphical user interface adapted to generate a desired data center configuration; a transform module, in communication with the graphical user interface, programmed to modify the source parameter set into a destination parameter set by reference to the desired data center configuration; and, the destination parameter set providing a basis for submission to a modeling tool for predictive analysis; wherein the transform module is a program module programmed to carry out the further steps of: (a) calculating a throughput for a set of source servers and a set of source devices for a set of source workloads in the source data center configuration; (b) estimating a service demand for the set of source servers, the set of source devices and a source memory in the source data center configuration; (c) computing a server transformation matrix; (d) computing a fraction of a workload reassignment moved between the set of source devices and a set of destination devices; (e) computing an arrival rate for the desired data center configuration; (f) computing a source speed independent service demand parameter for the set of source servers and the set of source devices in the source data center configuration; (g) adjusting a device visit count according to the workload reassignment; (h) computing a weighted average speed independent service demand parameter for a set of destination servers and a set of destination devices in the desired data center configuration; (i) computing a service demand for the set of destination servers and the set of destination devices in the desired data center configuration; (j) computing a memory service demand and a consumption of destination servers in the desired data center configuration; (k) computing a set of destination parameters for a queuing theory solver from the server transformation matrix; and wherein the step (a) is further comprised of the substep of applying the equation TPUT ( k,w )= AB ( w )* OV ( k,w ) for all k where k is an index for a set of devices, and, for all w where w is an index for a set of source workloads.

7672494

11419980

1. A method for detecting anatomical abnormalities in a body part, the body part including (i) an imaged tissue region captured in a medical image by a medical imaging process, and (ii) a non-imaged tissue region not captured in the medical image by the medical imaging process, the non-imaged tissue region of the body part adjacently outlying the imaged tissue region of the body part with respect to the medical imaging process, the method being implemented by a computing device comprising at least one processor and memory, comprising: receiving, by the computing device, the medical image; and processing, by the computing device, the medical image to identify likely anatomical abnormalities centered in the non-imaged tissue region of the body part, wherein said processing the medical image comprises: defining a first image array that includes both (i) the medical image and (ii) an extended region adjacently outlying the medical image, the extended region being spatially representative of the non-imaged tissue region, the extended region being devoid of image information captured in the medical imaging process; and processing the first image array according to a computer-aided detection (CAD) algorithm, including computing at least one neighborhood-based CAD feature for at least one location in said extended region.

20090216598

12390409

1. A method of defining the availability of configurable manufacturing resources, said method comprising the steps of: a) defining the scope comprising said resources; and b) defining the configuration attributes of said resources; where defining includes but is not limited to some combination of identifying, describing, calculating, communicating, and storing information.

20120005137

12828132

1. A method comprising: determining a plurality of sets of variables of an optimization problem, wherein a first set of the plurality of sets comprises a constrained variable constrained by a constraint condition indicated by a constraint description for the optimization problem and wherein a second set of the plurality of sets of variables comprises a non-constrained variable; determining a plurality of constraint compliant values for the constrained variable that comply with the constraint condition; generating a plurality of non-constrained values for the non-constrained variable; randomly combining individual ones of the plurality of constraint compliant values with individual ones of the plurality of non-constrained values into a plurality of value sets that satisfy the constraint description for the optimization problem; and running a computer based simulation that implements a population-based optimization algorithm with the plurality of value sets input as a population for the computer-based simulation.

20120030155

13076700

1. A model generating device comprising: an acquiring unit that observes information flowing through a network to which a plurality of information processing devices are connected that execute a plurality of events in a hierarchical structure, the acquiring unit acquiring event information including a time when execution of an event is started, a time when execution of the event is finished, and a type of the event; an assuming unit that assumes model candidates each showing a relationship between an event and another event triggered by the former event on the basis of the event information acquired by the acquiring unit, and makes a combination of the assumed model candidates; a searching unit that searches the model candidates assumed by the assuming unit for a candidate that matches an existing model; an updating unit that withdraws the model candidate searched for by the searching unit from the combination of the model candidates, and withdraws a candidate that is to be withdrawn from the combination of the model candidates in association with withdrawal of the model candidate found as a result of the search, thereby updating the combination of the model candidates; and a generating unit that generates a new model on the basis of the combination of the model candidates updated by the updating unit.

8645882

13658760

1. A method for designing an integrated circuit comprising: establishing a high level behavioral description to provide specific operations to be performed by the integrated circuit, the high level behavioral description including one or more types of partial operations and one or more types of complete operations, wherein the high level behavioral description includes frame synthesis with an input frame and a corresponding output frame; assigning variables to each of the partial and complete operations, the variables identified and ordered based on a time order in which the variables are used; and by using a computing device, defining hardware components for performing the partial and the complete operations.

20120209879

13025521

1. A method comprising: identifying a user associated with a text expression containing one or more content-indicative words; classifying data of the text expression using one or more classifiers, said classifying comprising using the one or more content-indicative words to identify an intent of a user; on determination of intent of a user based on said identifying and classifying, providing to the user data related to the intent of the user obtained in real-time from a set of information repositories.

10073756

15806976

1. A method for optimizing a virtualized computing environment, the method comprising: a processor of a computer system receiving extrinsic data that describes a set of virtual resources comprised by the cloud-computing environment; the processor selecting a set of candidate resource configurations, where every virtual resource of the set of virtual resources is associated with a plurality of candidate resource configurations of the set of candidate resource configurations; the processor further selecting a set of candidate environment configurations, where each candidate environment configuration of the set of candidate environment configurations comprises at least one candidate resource configuration of the set of candidate resource configurations; the processor provisioning a virtual test environment that simulates the cloud-computing environment, and that comprises a virtual representation of each resource of the set of virtual resources; the processor configuring the virtual test environment by successively loading the virtual test environment with configuration combinations, where each combination of the configuration combinations comprises at least two candidate environment configurations of the set of candidate environment configurations and at least two candidate resource configurations of the set of candidate resource configurations, and where the at least two candidate resource configurations are each associated with a same tested resource of the set of virtual resources; the processor ranking the at least two candidate resource configurations and the at least two candidate environment configurations; the processor revising at least one candidate resource configuration of the set of candidate resource configurations and at least one candidate environment configuration of the set of candidate environment configurations as a function of the ranking; and the processor repeating the configuring, the ranking, and the revising until a resulting virtual test environment is an optimal virtual environment.

9524466

14305009

1. A computerized apparatus having a processor, the processor being adapted to perform the steps of: obtaining a set of solutions to a multi-objective problem, wherein each solution is a non-dominated solution; computing outranking weights for each pair of solutions; selecting a subset of the set of solutions based upon a defensive criteria in with respect to the outranking weights, wherein the defensive criteria relates to a number of solutions that outrank the subset; and outputting the subset of the set of solutions.

8406149

12201483

1. A method of identifying potential internet service customers for a first service provider network, the method comprising: determining first internet traffic data for an internet entity corresponding to a first amount of internet traffic exchanged with the internet entity over the first service provider network based on deep packet inspection, wherein the internet traffic exchanged with the internet entity comprises packets destined to and transmitted from the internet entity; determining total internet traffic data for the internet entity corresponding to a total amount of internet traffic exchanged with the internet entity over a second service provider network that hosts the internet entity based on publically available internet traffic data; determining a volume metric for the internet entity based at least in part on the first internet traffic data and the total internet traffic data, wherein the volume metric represents how much of the total amount of internet traffic exchanged with the internet entity over the second service provider network is associated with the first service provider network; determining whether the volume metric meets a criterion; and displaying an identity of the internet entity if the volume metric meets the criterion.

8594950

13592275

1. A computer-implemented method for enabling the assessment of a coronary artery of a patient, based on a calculated fractional flow reserve value, the method comprising: displaying, on a digital display device, a three-dimensional model of at least a portion of multiple coronary arteries branching from an aorta of the patient, wherein the three-dimensional model is provided by a computer system; displaying, on the display device, a first fractional flow reserve calculated by the computer system for at least one of the coronary arteries in the three-dimensional model; receiving an input to the computer system related to a treatment plan for the at least one of the coronary arteries, wherein the treatment plan includes a widening of a lumen defined by the at least one of the coronary arteries; and calculating and displaying, on the display device, a second fractional flow reserve for the at least one of the coronary arteries, wherein calculation of the second fractional flow reserve is based at least in part on the received input.

20090228434

12398944

1. A method for managing a data stream, comprising: generating an iterator-model subplan from an iterator-model plan; assigning a continuous-query operator to the iterator-model subplan; and assigning an adapter to the iterator-model subplan.

8626679

12869242

1. An apparatus for estimating a state of charge (SOC) in a battery, the apparatus comprising: a detector unit including a current detector for detecting current from a battery cell, a voltage detector for detecting voltage from the battery cell, and a temperature detector for detecting temperature from the battery cell; a soft computing unit for calculating and outputting a battery SOC estimation value by processing the current, the voltage and the temperature detected by the detector unit using a computing algorithm, which is a fuzzy algorithm implemented as a neural network, the soft computing unit storing the battery SOC estimation value in a memory; and a comparator operably coupled to the soft computing unit and a charger-discharger, the charger-discharger being further operably coupled to the battery cell, the comparator comparing the battery SOC estimation value with a predetermined target value that varies with charging or discharging of the battery, the comparator further providing an algorithm update signal to the soft computing unit to update the computing algorithm based on a learning algorithm when a difference between the battery SOC estimation value and the predetermined target value is outside of a critical range, wherein the fuzzy algorithm has a form expressed as F=Φ(P,X)W, where Φ is one of a fuzzy radial function, a radial basis function, and an activation function in the neural network, P is a learning parameter, X is an input, and W is a weight to be updated during learning.

9507683

13112210

1. A computer program product comprising a tangible computer readable recordable storage medium including computer useable program code for enabling monitoring across one or more domains, the computer program product including: computer useable program code for identifying information technology resources across multiple cloud environment domains, wherein said information technology resources correspond to a client service distributed across the multiple cloud environment domains, and wherein each respective one of the multiple cloud environment domains is controlled autonomously by a respective domain owner; computer useable program code for collecting heterogeneous monitoring data from the information technology resources identified across each respective one of the multiple cloud environment domains, wherein said heterogeneous monitoring data comprises at least (i) a count of all replicated information technology resources in a cluster among the identified information technology resources, (ii) an identification of a type of product providing a given functionality among the identified information technology resources, and (iii) dependency information among the identified information technology resources; computer useable program code for aggregating the heterogeneous monitoring data from the information technology resources corresponding to the client service distributed across each respective one of the multiple cloud environment domains according to (i) one or more monitoring requirements of the client, and (ii) multiple data processing rules comprising (a) one or more data aggregation rules, (b) one or more data segregation rules, and (c) one or more data alignment adjustment rules to generate a unified set of monitoring data, wherein said aggregating comprises transforming each respective item of the heterogeneous monitoring data to a predetermined form; and computer useable program code for outputting the unified set of monitoring data to the client via a client delivery portal, wherein said client delivery portal comprises (i) a business dashboard, (ii) an Information Technology dashboard, (iii) a historical reports viewer, (iv) an event viewer, (v) a notification viewer, and (vi) a recommendation viewer.

8739095

12719710

1. A computer implemented method for performing interactive editing of an electronic circuit design, the method implemented with a processor, the method comprising: using at least one processor to perform a process, the process comprising: identifying an object in a layout of the electronic circuit design, wherein the object is to be manufactured with double patterning technology; checking whether the object corresponds to a double patterning violation by associating the object with a layer purpose pair and by using a spatial query around the object when the object is being created in the layout; determining whether a corrective solution is to be implemented to resolve the double patterning violation; and determining whether the corrective solution is to be implemented interactively.

7885849

10862931

1. A method of identifying demand by an online community for a particular item, comprising: compiling, by way of a system network device, a set of N items {X 1 , X 2 ,. .. , X i ,. .. , X N }, wherein for each item X i amongst the set of N items, a plurality of M early adopter members {Y[X i ] 1. .. Y[X i ] M } is determined resulting in N separate sets of M early adopter members, said M early adopter members being determined based on a time of adoption of said item X i ; determining, by way of the system network device, a set K of the early adopter members that occur most frequently in the set {Y[X i ] j } from N separate sets of M early adopter members, where 1≦i≦N and 1≦j≦M, wherein said most frequently occurring early adopter members are classified as trend predictors; introducing the particular item for adoption by the K early adopter members; and measuring, by way of the system network device, an acceptance value for the particular item by the K early adopter members.

20090060396

11847742

1. An image analyzer comprising: an image partitioner configured to find a partition point that divides a received image into four sub-images each having a pre-selected activated pixel count; a recursion processor configured to (i) apply the image partitioner to an input image to generate a first partition point and four sub-images and to (ii) recursively apply the image partitioner to at least one of the four sub-images for at least one recursion iteration to generate at least one additional partition point and additional sub-images; and a formatter configured to generate a features representation of the input image in a selected format, the features representation being based at least in part on the partition points.

8024346

12647490

1. A method of creating a ranked join index for ordered data entries, comprising: mapping a dominating set of the ordered data entries according to rank attributes; determining a separating vector for each set of adjacent mapped data entries of the dominating set of ordered data entries; and ordering the ordered data entries according to a separating point associated with each of the separating vectors, wherein the ordering is performed by a processor.

20100120440

12291281

1. A computerized method for integrated access network business planning for a telecommunications carrier, comprising the steps of: receiving a set of network business planning parameters; executing a plurality of network optimization models, the models including dedicated and radio access networks; and jointly determining network configuration changes for the dedicated and radio access networks based on the set of business planning parameters.

7739082

11423046

1. A method for detecting anomalies in a first plurality of observations, comprising: applying one or more formatting processes to the first plurality of observations to generate formatted data; generating a mathematical model based on said formatted data by iteratively decomposing a fully dependent model, the model indicating conditional independence relationships betweens aspects of the observations; calculating one or more joint probability distributions based on the relationships indicated by said model using said formatted data; generating scored data by applying a second plurality of observations to said model; and analyzing said scored data to detect said one or more anomalies wherein said formatting processes include a discrete decomposition of at least one variable of said first plurality of observations and wherein said discrete decomposition is a method of data representation comprising decomposing a continuous variable into a collection of discrete variables corresponding to a series of intervals, wherein each interval corresponds to a range of values of the continuous variable and a plurality of the intervals at least partially overlap.

20130146055

13313128

1. A method for ventilating a patient with a ventilator, comprising: determining an initial base flow; determining an initial inspiration trigger threshold; delivering the initial base flow during at least a first portion of exhalation while setting the inspiration trigger threshold to the initial inspiration trigger threshold; determining a desired base flow; determining a desired inspiration trigger threshold; increasing base flow from the initial base flow toward the desired base flow during at least a second portion of exhalation; and decreasing the inspiration trigger threshold from the initial inspiration trigger threshold toward the desired inspiration trigger threshold based on a function of the step of increasing the base flow while performing the step of increasing the base flow.

8483972

13172104

1. A method of analyzing dynamic profiles of genotypes of nucleic acids, the method comprising: using a computer, including a processor and a memory, to convert dynamic profiles of known genotypes of a nucleic acid to multi-dimensional data points, wherein the dynamic profiles each comprise measurements of a signal representing a physical change of a nucleic acid containing the known genotype relative to an independent variable; using the computer to reduce the multi-dimensional data points into reduced-dimensional data points; generating a plot of the reduced-dimensional data points for each genotype.

20060282806

11422068

1. A software verification method comprising the steps of: generating a model which defines a set of executions for the software; and analyzing the model to verify the software operation; THE METHOD CHARACTERIZED IN THAT: a range analysis is performed to substantially optimize the size of the model, thereby reducing the search space of the model analyzed such that: all the reachable behaviors of a program represented by the software are preserved; and sizes of data variables are large enough to represent all possible values during any possible execution of the program.

20120151424

13400510

1. An apparatus for converting a description of a circuit into an abstract model of the circuit, the apparatus comprising: a causality engine coupled to at least one database comprising protocol information relating to the circuit, a model description of the circuit, and simulation data associated with the circuit, the causality engine configured to determine deterministic behavior between input and output signals of the simulation data; and a neural network coupled to the causality engine and configured to generate an abstract model of the circuit approximating a behavior of the circuit based on the determination of deterministic repetitive behavior by the causality engine; wherein, to generate an abstract model of the circuit, the neural network is configured to: generate a system of weighted equations representing the behavior of the circuit; apply input patterns to the system of equations to generate actual output values; calculate an error using a difference between the actual output values and desired values; and modify the weightings in the system of equations based on the calculated error.

7689929

11056500

1. A method comprising: displaying a selectable list of multiple different algorithms from which a user can select within a single navigable window of a single application program that provides multiple different functionalities including at least email functionality, web browser functionality, calendar functionality, and word processing functionality, wherein: one or more of the algorithms are configured as filters operable on respective collections of data to generate corresponding sets of quick links to which a user can navigate responsive to user selection of the algorithms, and each of the collections of data represents items associated with one of the multiple different functionalities; at least some of the algorithms are employable with different collections of data associated with the multiple different functionalities; at least one of the algorithms is a recent items list operable to select most recently used items across the multiple different functionalities; at least one of the algorithms is a top favorites algorithm operable to select items across the multiple functionalities based upon frequency of use of the items; and the algorithms are configured to filter dynamically changing information in the respective collections of data to generate the sets of quick links to display by selective inclusion of items from the collections of data in the generated quick links; receiving a user selection of an individual algorithm when the single application program is navigated to enable interaction with a current functionality of the multiple different functionalities; and responsive to receiving the user selection, displaying a set of quick links generated by operation of the selected algorithm on at least one of the collections of data to filter the data in accordance with the selected algorithm and without navigating away from the currently functionality.

20010049782

09252567

1. A system for profiling instructions of a program and for selecting a trace of a portion of the instructions of the program, the system comprising: a hardware portion for detecting which instructions of the program are more frequently executed and for maintaining a history of targets chosen by branch instructions of the program; and a software portion for forming the trace of the most frequently executed instructions and using the history in making branch predictions for branch instructions encountered in forming the trace.

9607265

14044729

1. A method of fast neural network training for library-based critical dimension (CD) metrology for a grating structure, the method comprising: providing a training target for a first neural network; training the first neural network, the training of the first neural network including use of a validation data set, the training comprising starting with a first number of neurons and iteratively increasing the number of neurons until the training target is reached using a second, larger, number of neurons, wherein the training of the first neural network includes stopping iterations for the training of the first neural network upon the occurrence of the following: a value of a computational cost function for the training of the first neural network is less than a predetermined value, the value of the computational cost function is not reduced by a predetermined percentage for a certain number of consecutive iterations, or an error of the validation data increases for a predetermined number of iterations; generating a second neural network based on the training and the second number of neurons; providing a spectral library based on the second neural network, the spectral library including a simulated spectrum for the grating structure; and comparing the simulated spectrum to a sample spectrum for the grating structure.

20090113407

11925680

1. At a computer system, the computer system including a repository storing models that describe intended application behavior, executive services for refining models so that drivers can implement model related commands on applications, driver services for implementing model related commands for applications, a method for managing the lifecycle of a software application, the method comprising: an act of receiving an application model reference along with a software lifecycle command, the application model reference referring to an application model, the software lifecycle command indicating a software lifecycle transition that is to be applied to a distributed application based on the referenced application model; an act of utilizing the application model reference to access the referenced application model, the referenced application model including a lifecycle model reference referring to a lifecycle model and including a lifecycle state attribute configured to store a lifecycle state value indicating the lifecycle state of a distributed application based on the application model; an act of utilizing the lifecycle model reference to access the referenced lifecycle model, the referenced lifecycle model defining possible lifecycle state values for the lifecycle state attribute of the application model and defining transitions that cause lifecycle state values to change, each defined transition referencing a command model that describes how to implement the defined transition; an act of activating software lifecycle activities based on the referenced lifecycle model; an act of accessing the current state value from the lifecycle state attribute, the current state value representing the current lifecycle state of a distributed application based on the application model; and an act of referring to the software lifecycle activities to determine if the distributed application can transition from the current lifecycle state to a new lifecycle state in accordance with the lifecycle transition indicated in the software lifecycle command.

8122012

11035565

1. A method of displaying physical data retrieved from an underlying physical database, comprising: providing a database abstraction model defining: (a) a plurality of logical fields each having an access method that specifies at least a method to access the physical data associated with the logical field; and (b) a plurality of model entities, wherein each model entity identifies (i) a set of logical fields each mapping to logically related physical data; and (ii) an identifier in the database used to identify instances of the model entity; wherein, for each model entity, a first logical field of the corresponding set of logical fields includes a timeline attribute defining a timeline for the model entity and wherein a second logical field of the corresponding set of logical fields includes a timeline attribute defining where the physical data associated with the second logical field occurs on the timeline; receiving a request to display data related to an instance of one of the plurality of model entities; retrieving, from the database, physical data corresponding to the set of logical fields for the instance of the model entity; displaying the timeline for the instance, based on the timeline attribute for the first logical field; and displaying an event on the timeline, based on the timeline attribute for the second logical field, wherein the event corresponds to the physical data associated with the second logical field, wherein the timeline attribute for the second logical field specifies that the event comprises a duration type event, and wherein the duration type event is rendered over a segment of the timeline that indicates, relative to the timeline for the instance of the model entity, a period of time when a condition symbolized by the event occurred.

9349150

14140640

1. A multi-task learning method for predicting travel demand on an associated transportation network, comprising: collecting observation data corresponding to a plurality of observations of the associated transportation network; generating a set of time series corresponding to transportation network data of segments of the associated transportation network; forming a plurality of clusters of time series, each time series in the set thereof in one cluster; for each cluster, applying multi-task learning to generate a prediction model, including: determining a common prediction model for all series in a cluster thereof, and determining a specific prediction model for each series in the cluster thereof, wherein the prediction model generated via the multi-task leaminq application is a sum of the common prediction model and the specific prediction model for each cluster; and predicting travel demand on a selected segment of the associated transportation network corresponding to at least one of the set of time series in accordance with the generated prediction model, wherein at least one of the collecting, generating, forming, and predicting is performed by a computer processor.

20170032569

15303827

1. Method for capturing a scene, using a 3D image capturing device, the method comprising, at a first moment of time: capturing a first image of said scene via the 3D image capturing device, wherein the first image comprises an array of pixels each having color intensity values and each having a depth value; generating, based on the first image, a 3D model comprising multiple segments, such that the 3D model represents the scene at the first moment of time; wherein the method further comprises, at a second moment of time subsequent to said first moment of time: capturing a second image of said scene via the 3D image capturing devices, wherein the second image comprises an array of pixels each having color intensity values and each having a depth value; tracking the multiple model segments by calculating movement vectors for each of the segments; and updating the 3D model based on the second image.

20090204267

12242525

1. An apparatus operable in an industrial automation environment, the apparatus comprising: a processor, configured for: constructing a production facility's energy-supply model based at least in part on variable costs associated with a plurality of energy-generating assets included within the production facility; building the production facility's energy-demand model based at least in part on at least one of a sub-model of production, a user defined time horizon, or a predicted energy demand; and combining the production facility's energy-supply model and the production facility's energy-demand model to create the production facility's energy optimization model; and a memory coupled to the processor for persisting data.

20160171245

14567409

1. A system for validating a repository, the system comprising: at least one memory; at least one processor; and at least one module stored in memory, executable by the at least one processor, and configured for: receiving repository identification information; identifying at least one repository to be validated based on the received repository identification information; receiving one or more validation criteria for validating the at least one repository to be validated; validating the at least one repository to be validated by executing the one or more validation criteria; and generating a validation report of the at least one identified repository based on validation of the at least one identified repository to be validated.

6084595

09028279

1. A method of feature vector indexing, comprising the steps of: providing a plurality of feature vectors, each feature vector indicative of one of a plurality of objects, wherein each feature vector comprises at least one primitive, each primitive being associated with an attribute of the object and identifying a plurality of features, each feature having an associated feature coefficient; using a distance metric to select index values which are indicative of features of the feature vector; providing a target feature vector and a plurality of user weights; generating a constraint based on the target feature vector and the plurality of user weights; and applying the constraint to the index values so as to select a subset of the feature vectors.

10073915

15088873

1. A method performed by one or more server devices, the method comprising: constructing, by one or more processors of the one or more server devices, a probability model, from information regarding computer based search result interactions of a user, to estimate a probability that the user will select a certain type of specialized search result, wherein constructing the probability model from information regarding the computer based search result interactions of the user comprises constructing the probability model based on a quantity of past selections by the user of search results that are members of the certain type of specialized search result; searching, by one or more processors of the one or more server devices, sources of information based on a search query received from the user to determine a set of search results; using, by one or more processors of the one or more server devices, the estimated probability to select, from the set of search results, one or more search results that are of the certain type; and outputting, by one or more processors of the one or more server devices and in response to the search query, the selected one or more search results for presentation to a user via a computing device of the user, wherein outputting the selected one or more search results for presentation to the user comprises: outputting other search results that are of the set of search results but not of the certain type, and outputting the selected one or more search results for display to the user in a visually distinct manner relative to the other search results.

9563857

14170881

1. A multi-objective semiconductor product capacity planning system, comprising: a memory device; and a processor coupled to the memory device, the processor configured to execute a plurality of modules stored in the memory device, and the plurality of modules comprising: a data input module, accepting inputs of machine information, product information and order information, the machine information defining a plurality of production stations and a capacity limit of the plurality of production stations, the product information defining a plurality of product categories and a production cost of the plurality of product categories, the order information defining a demand quantity of order for a plurality of customer orders and a product price; a capacity planning module, receiving input data from the data input module, coordinating the demand quantity of order with the machine information and the product information to plan a satisfied number of order to satisfy the capacity limit, determining the satisfied number of order by a capacity allocation proportion of order to decide a capacity utilization rate of each of the orders and a satisfied priority of order to arrange a production sequence of each of the orders, combining the capacity allocation proportion of order and the satisfied priority of order as a resource allocation and transforming the resource allocation into a gene combination by a chromosome encoding method; and a computing module, receiving the gene combination from the capacity planning module, calculating the gene combination several times to generate a plurality of new candidate solutions by using a multi-objective genetic algorithm, sorting the plurality of new candidate solutions by using a plurality of planning objectives as evaluation criteria to generate a new gene combination, and repeating the calculation to form a candidate solution set until a stop condition is satisfied, transforming the candidate solution set into a plurality of suggestive plans and selecting one of the plurality of suggestive plans to arrange the production stations for manufacturing the product categories; wherein the gene combination comprises two parts of a parent chromosome, which are respectively represented as the capacity allocation proportion of order and the satisfied priority of order, wherein when the parent chromosome generates a child chromosome, a corresponding relationship of a gene code of the parent chromosome is corrected; wherein the plurality of planning objectives are a revenue maximization, a profit maximization and a gross margin maximization.

9411712

12797509

1. A method for generating test data for at least one particular field of a record format describing two or more fields, the method performed by one or more computer systems and including: reading values occurring in a field of multiple records from a first dataset, the records each including multiple fields, the field from which the values are read corresponding to the at least one particular field for which the test data is to be generated, and the records each including the field corresponding to the at least one particular field for which the test data is to be generated; storing profile information for the at least one particular field, the profile information including a list identifying, for two or more of the values read from the field in the multiple records, information about the frequency at which each of the two or more values read from the field in the multiple records occurs in the field in the multiple records; generating a model of a probability distribution for the at least one particular field, based on the list; based on the model of the probability distribution, generating a second dataset including multiple test data values for the at least one particular field such that a frequency at which a given value read from the field in the multiple records occurs in the test data values in the second dataset corresponds to a probability assigned to that given value in the first dataset by the model; and storing the test data including the test data values in a data storage system.

20100082240

12241745

1. A computer-implemented system for displaying analytic geography data in a zero-footprint client environment, comprising: a geographical information system executable on a first server and configured to capture, store, analyze, and manage data and associated attributes that are spatially referenced to a geographical map; a first user interface region for display on a client computer that provides a list of analytic routines for selection by a user; a second user interface region for displaying a geographical map on the client computer for use in specifying geographic data associated with the geographical map; a second server having a plurality of analytic routines corresponding to the list of analytic routines displayed by the user interface display; wherein the plurality of analytic routines are statistical models for generating analytical results; wherein the analytic routine, that is configured to operate on the second server and that corresponds to the analytic routine selected through the first user interface region, is executed on the second server using the geographic data specified through the second user interface in order to generate analytic results; wherein the analytic results are sent to the user interface display for display with respect to a geographical map.

20110035517

12906894

1. A method for storing of multimedia data, the method comprising: providing an input section, wherein the input section is configured to accept broadcast data and output at least video data relating to a single broadcast event to a record buffer; and providing a record application, wherein the record application is configured to record the video data from the record buffer to a storage device without transferring any of the video data into a second buffer before storing the video data on the storage device; wherein the input section and the record application are configured to function asynchronously and the input section and record application are configured to access the record buffer simultaneously.

9928423

14845438

1. A computer implemented method for detecting anomalies, the method comprising executing on a processor: tracking movement of an object through an image field of a camera, wherein the object is detected within a video data input from the camera, wherein the image field is partitioned into a matrix comprising a grid of a plurality of different local units, and wherein the tracking generates a trajectory of the object's motion that passes through a subset of the local units that is less than a totality of the plurality of the different local units; extracting image features from the video data with respect to only each of the subset of the local units of the plurality of local units; generating a plurality of anomaly confidence decision values for the extracted image features as a function of fitting the extracted image features to normal patterns of a plurality of local motion pattern models that are defined by dominant distributions of the extracted image features, and to anomaly patterns of the plurality of local motion pattern models that are defined by rare distributions of the extracted image features; normalizing values of the image features extracted from the image field and associated with each of the plurality of anomaly confidence decision values; clustering the image feature values extracted from the image field and associated with each of the plurality of anomaly confidence decision values; determining spatial locations within the field of view of the clustered extracted image feature values of the anomaly confidence decision values that are correlated to features of interest of a real-world scene represented within the field of view; assigning a first weighting to a first anomaly of the anomaly confidence decision values that is higher than a second weighting assigned to a second anomaly of the anomaly confidence decision values in response to the determined spatial location of the clustered extracted image feature values of said first anomaly confidence decision value being within a portion of the field of view of the input video that is correlated with a cordoned off area of the real-world scene, wherein the determined spatial location of the clustered extracted image feature values of the second anomaly confidence decision value is outside the portion; ranking the plurality of anomaly confidence decision values as a function of their respective assigned weightings; extracting trajectory features from the video data input relative to the trajectory of the tracked object; generating a global anomaly confidence decision value for the object trajectory as a function of fitting the extracted trajectory features to a normal learned motion trajectory model, wherein the global anomaly confidence decision value indicates a likelihood that the object trajectory is normal or anomalous; determining whether anomalies have occurred as a function of combining the generated global anomaly confidence decision value with the anomaly confidence decision values; and prioritizing anomaly determinations as a function of the ranking of the anomaly confidence decision values.

20140052669

13970466

1. A method of summarizing household resources and claims through a future lifetime as of a particular date, thereby enabling a household to balance the claims against the resources over a time horizon, the method including: accessing a collection of data structures in computer readable memory, including a savings object adapted to represent net savings cash flows prior to retirement; a plurality of financial asset objects adapted to represent positions in financial assets and associated cash flows, if any, and a plurality of household expense objects adapted to represent various post-retirement household expenses, the household expense objects including at least expense amounts and expense timing, and a desirability rating for a particular household expense; and evaluating using a processor and summarizing for a particular date present values of resources and claims over a predicted lifetime, the resources and claims including at least the net savings cash flows prior to retirement, the positions in financial assets and the post-retirement household expenses, the summary organized into groups of the resources and the claims, wherein a base level of the household expenses are grouped together as obligations, other of the household expenses are organized by the desirability ratings of the household expenses, thereby representing at least primary and secondary goals among the household expenses, and a residual (or deficit) of the resources exceeding (or failing to satisfy) the claims is reported, thereby reflecting wealth building.

20170230682

15581239

1. A moving picture decoding device that decodes a bitstream obtained by coding a moving picture using a motion vector in units of blocks obtained by partitioning each picture, comprising: a decoding unit that decodes information representing a motion vector predictor index to be selected in a motion vector predictor candidate list; a motion vector predictor candidate constructing unit that derives first and second motion vector predictor candidates from a motion vector of one of decoded blocks neighboring a decoding target block in a same picture as the decoding target block, and derives a third motion vector predictor candidate from a motion vector of one of blocks of a decoded picture different from the decoding target block; a motion vector predictor candidate adding unit that adds the first to third motion vector predictor candidates satisfying a certain condition to a motion vector predictor candidate list; a motion vector predictor candidate limiting unit that repeatedly adds a motion vector predictor candidate having a same value to the motion vector predictor candidate list until the number of motion vector predictor candidates reaches a certain number when the number of the motion vector predictor candidates added to the motion vector predictor candidate list is smaller than the certain number (a natural number larger than or equal to 2); and a motion vector predictor selecting unit that selects a motion vector predictor of the decoding target block from the motion vector predictor candidate list based on the decoded information representing the motion vector predictor index to be selected, wherein the motion vector predictor candidate limiting unit deletes the motion vector predictor candidates exceeding the certain number from the motion vector predictor candidate list generated by the motion vector predictor candidate adding unit.