doc_id
stringlengths 7
11
| appl_id
stringlengths 8
8
| flag_patent
int64 0
1
| claim_one
stringlengths 13
18.4k
|
|---|---|---|---|
20040260694 | 10600083 | 0 | 1. A process for testing an evaluation data record having attribute fields containing data comprising: providing a reference table having a number of reference records against which a evaluation data record is tested; identifying reference table tokens contained within the reference records of the reference table and determining a count of tokens in the reference table classified according to attribute field; and assigning a similarity score to said evaluation data record in relation to a reference record within the reference table based on a combination of: the number of common tokens of an evaluation field of the input data record and a corresponding field within a reference record from the reference table; the similarity of the tokens that are not the same in the evaluation field of the input data record and the corresponding field of the reference record from the reference table; and a weight of the tokens of the evaluation data record that is based on a count of the tokens from a corresponding field contained within the reference table. |
20140279737 | 13837274 | 0 | 1. A method comprising, running simulations to determine execution paths through a plurality of possible states to compute a value of information (VOI), in which the execution paths are determined by a belief state from a prediction model and any previous belief state, and processing results corresponding to the execution paths to output a final result. |
9987191 | 14444317 | 1 | 1. A device for desynchronizing a patient's neuronal brain activity involving a neuron population firing in a pathologically synchronized manner, the device comprising: a stimulation unit configured to generate an acoustic stimulation signal comprising at least a first tone and a second tone; wherein the first tone comprises a first frequency or first frequency mixture in a first frequency range and is configured to shift the phase of the neuronal brain activity of a first subpopulation of the neuron population relative to the phase of the neuronal brain activity of a second subpopulation of the neuron population when the first tone is acoustically received by the patient; wherein the second tone comprises a second frequency or second frequency mixture in a second frequency range different than the first frequency range and is configured to shift the phase of the neuronal brain activity of the second subpopulation relative to the phase of the neuronal brain activity of the first subpopulation when the second tone is acoustically received by the patient; and wherein the acoustic stimulation signal desynchronizes the neuron population of the patient when the acoustic stimulation signal is acoustically received by the patient. |
20130338983 | 13843096 | 0 | 1. A computer-implemented method for updating simulation models of a subterranean reservoir, the method comprising: (a) providing an ensemble of reservoir models representing a subterranean reservoir having non-Gaussian characteristics; and (b) updating the ensemble of reservoir models using a subspace ensemble Kalman filter. |
20100145598 | 12330565 | 0 | 1. A control system for an exhaust gas recirculation system (EGR) of an internal combustion (IC) engine, said system comprising: a device for controlling the flow of EGR in response to the differential of at least two input signals; a first device for calculating the total flow of gasses consumed by said IC engine and providing a signal proportional to said total gas flow to said flow control device; and a second device for measuring the fresh air flow to said IC engine and providing a signal proportional to said fresh air flow to said flow control device, whereby the difference between said total flow and said fresh air flow is the actual EGR flow. |
8290288 | 11903222 | 1 | 1. In a computer system that implements a video encoder, a method of processing one or more video images in a video sequence, the method comprising: with the computer system that implements the video encoder, encoding macroblock type information for a macroblock, first coded block pattern information for plural luminance blocks of the macroblock, and second coded block pattern information for plural chrominance blocks of the macroblock, wherein the first coded block pattern information indicates whether any of the plural luminance blocks have transform coefficient data in a bitstream, wherein the second coded block pattern information indicates whether any of the plural chrominance blocks have transform coefficient data in the bitstream, wherein the macroblock has a macroblock type indicated at least in part by the macroblock type information, and wherein the encoding comprises: determining an entropy code that reflects joint entropy coding of the macroblock type information together with the first coded block pattern information and the second coded block pattern information, and outputting the entropy code in the bitstream, whereby a decoder that receives the entropy code, based at least in part upon the entropy code, determines the macroblock type and whether any of the plural luminance blocks and the plural chrominance blocks of the macroblock have transform coefficient data in the bitstream. |
9483475 | 13903419 | 1 | 1. A content recommendation method for use in a portable electronic device, comprising: fetching current context information from the portable electronic device; calculating a relevant ranking value of each item within each type of media files stored in the portable electronic device based on the context information; sorting the relevant ranking value of each item within each type of the media files; displaying at least one of items of a first user interface of the portable electronic device according to the sorted ranking values; classifying the media files into multiple events; calculating a relevant event ranking value of each of the events according to the fetched current context information; sorting the relevant event ranking values of the events; determining a top ranked event according to the sorted relevant event ranking values; determining a representative picture and/or video of the top ranked event according to the sorted relevant ranking values of the items of the top ranked event; and displaying the representative picture and/or video of the top ranked event on a second user interface of the portable electronic device, wherein the relevant event ranking value of the top ranked event is decreased when the representative picture and/or video of the top ranked event has been selected and displayed a plurality of times. |
20130235697 | 13723125 | 0 | 1. A method, comprising: receiving an input dataset that corresponds at least in part to a subsurface three-dimensional geologic formation, wherein: the input dataset is a simultaneous-source acquired dataset that includes a plurality of shots, and one or more shots in the plurality of shots includes data corresponding to a plurality of source activations; separating the input dataset into a plurality of separated shots, wherein respective shots in the plurality of separated shots correspond to respective shots in the plurality of shots in the input dataset; for one or more separated shots in the plurality of separated shots: interpolating respective separated shots to form respective interpolated shots, and encoding the respective interpolated shots to form respective simulated simultaneous shots; forming a hybrid simultaneous-source dataset based at least in part on the simulated simultaneous shots and the input dataset; and separating the hybrid simultaneous-source dataset into a second plurality of separated shots, wherein respective shots in the second plurality of separated shots correspond to respective shots in the hybrid simultaneous-source dataset. |
8430360 | 12940091 | 1 | 1. A control unit for controlling the supply of a vehicle having at least one internal combustion engine with multiple fuels, comprising: at least one input means for supplying optimization parameters, fuel parameters, and operational data having data of operational phases of a mission to be performed by the vehicle; at least one storage unit for storing the optimization parameters, the fuel parameters, and the operational data; and at least one computing unit; wherein the at least one control unit is adapted: for being connected to at least one first supply apparatus for supplying a first fuel to the at least one internal combustion engine and to at least one second supply apparatus for supplying a second fuel to the at least one internal combustion engine; for controlling a first mass flow of the supplied first fuel and a second mass flow of the supplied second fuel; and for using the at least one computing unit, establishing a ratio of first mass flow and second mass flow for one or more operational phases of the vehicle to fulfill the optimization parameters in consideration of the fuel parameters, storing the optimization parameters in the storage unit, and implementing the optimization parameters during the performance of the operational phases by controlling the first mass flow and the second mass flow. |
7831537 | 11697132 | 1 | 1. A system for adaptive generation of problem determination decision procedures, comprising: a processor; a monitoring module operable to identify changes to system states, to one or more values of the system states, and one or more actions associated with the system states; a universal representation module operable to store available knowledge associated with the system states, the one or more actions, and probabilities associated with occurrence of the system states; a problem identification to solution mapper module operable to provide a nearly optimal order of interrogating that minimize number of interrogations for said one or more values of the system states before taking an action, and further operable to suggest an associated action; a problem resolution log monitor module operable to monitor logs of the system states and associated actions; and a change to update controller operable to receive monitoring information from the monitoring module and the problem resolution log monitor and determine whether the available knowledge associated with the system states, the one or more actions, and the probabilities associated with the system states stored by the universal representation module needs updating. |
7908571 | 11971171 | 1 | 1. A system for improving manufacturability of an integrated circuit on a semiconductor substrate using an unmodified plurality of cells, the system comprising: an arrangement module to arrange the unmodified plurality of cells; a router to define routes of interconnecting conductive paths between the unmodified plurality of cells based on operation of the integrated circuit; an evaluation module to evaluate the arrangement of the unmodified plurality of cells and the routes of the interconnecting conductive paths between the unmodified plurality of cells for a manufacturing improvement opportunity; and a modification module to modify an element of at least one of the unmodified plurality of cells based on the manufacturing improvement opportunity to create a modified plurality of cells, wherein the modified plurality of cells are to be used to create the integrated circuit on the semiconductor substrate, wherein further the modification module is adapted to increase metal surface area on one or more metal layers to provide improved via contact with one or more of the modified plurality of cells. |
20070271279 | 11457095 | 0 | 1. A computerized method of representing a dataset with an optimal layer of a taxonomy, comprising: obtaining a taxonomy including a hierarchical arrangement of layers, wherein each layer represents a cluster set containing at least one cluster, wherein each cluster represents at least one record within a dataset; identifying a range of taxonomy layers based on a measure of intra-cluster homogeneity of each cluster within the taxonomy; selecting a taxonomy layer within the identified range as an optimal layer of the taxonomy, the selecting being based on a measure of inter-cluster heterogeneity between clusters of a taxonomy layer within the identified range; and labeling clusters within the optimal layer of the taxonomy. |
9335553 | 14836212 | 1 | 1. A method that comprises a pair of spatial light modulators displaying time-multiplexed mask pairs, wherein: (a) the pair of modulators comprises a rear modulator and a front modulator; (b) each mask pair comprises a rear mask and a front mask, such that the rear mask is displayed by the rear modulator while the front mask is displayed by the front modulator; (c) the pair of modulators generate an auotomultiscopic display; (d) light from a backlight passes first through the rear modulator and then through the front modulator; (e) the automultiscopic display has a refresh rate of at least 13 Hz; and (f) during each refresh of the automultiscopic display, the pair of modulators display a set of time-multiplexed mask pairs that produce a pattern of light that would, if integrated by a viewer's eye, comprise an approximation of a target light field, which approximation has a matrix rank higher than one. |
20130101194 | 13279195 | 0 | 1. A method for reconstructing an image, said method comprising: receiving raw image data acquired from an image acquisition system; shaping a filtered backprojection filter to emulate a specified iteration result of an iterative algorithm reconstruction method; filtering said received image data utilizing said shaped filtered backprojection filter; backprojecting said received image data; and generating a reconstructed image using the filtered and backprojected image data. |
20160269744 | 15165164 | 0 | 1. A moving picture coding device that codes a moving picture using a motion vector in units of blocks obtained by partitioning each picture, comprising: a motion vector predictor candidate constructing unit that derives first and second motion vector predictor candidates from the motion vector of one of the coded blocks neighboring the coding target block in the same picture as the coding target block, and derives a third motion vector predictor candidate from a motion vector of one of blocks of a coded picture different from the coding 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 redundant motion vector predictor candidate determining unit that deletes the second motion vector predictor candidate from the motion vector predictor candidate list when the first and second motion vector predictor candidates added to the motion vector predictor candidate list by the motion vector predictor candidate adding unit have the same values; 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); a motion vector predictor selecting unit that decides a motion vector predictor of the coding target block based on the motion vector predictor candidate list; and a coding unit that codes information representing the decided motion vector predictor index in the motion vector predictor candidate list. |
20080015724 | 11776789 | 0 | 1. A method of determining production starts in a manufacturing environment, said method comprising: inputting production starts; grouping said production starts into production lots according to grouping rules; assigning start dates and associated priorities to each of said production lots such that a plurality of start dates is associated with at least one production lot; capacitating said production lots considering said plurality of start dates and associated priorities of said production lots. |
20030190413 | 10116927 | 0 | 1. A method of kinetic spray coating a substrate comprising the steps of: a) providing a mixture of particles comprising a first particle population and a second particle population; b) entraining the mixture of particles into a flow of a gas, the gas at a temperature below a melt temperature of the first particle population and below a melt temperature of the second particle population; c) directing the mixture of particles entrained in the flow of gas through a supersonic nozzle and simultaneously accelerating the first particle population to a velocity sufficient to result in adherence of the first particle population on a substrate positioned opposite the nozzle, while accelerating the second particle population to a velocity insufficient to result in adherence of the second particle population to either the nozzle or the substrate when it impacts the substrate. |
20090012754 | 11647111 | 0 | 1. A computer-implemented method of resolving a potential artificial algebraic loop in a model execution performed in a modeling environment, the method comprising: obtaining, using a computer system, a model of an executable process having a plurality of functions; generating one or more functions of the plurality of functions of the executable process using code generation, in the computer system; identifying whether the model of the process includes a potential artificial algebraic loop; modifying a manner by which the plurality of functions forming the potential artificial algebraic loop execute in the computer system if the potential artificial algebraic loop exists in the model of the executable process, while maintaining an outcome of the potential artificial algebraic loop; and storing the outcome of the potential artificial algebraic loop in a storage device. |
20100135528 | 12325176 | 0 | 1. A method for analyzing one or more sequential events performed by a human actor to analyze behavior of the human actor, comprising the steps of: identifying one or more segments in a video sequence as one or more components of one or more sequential events performed by a human actor; integrating the one or more components into one or more sequential events by incorporating a spatiotemporal model and one or more event detectors; and analyzing the one or more sequential events to analyze behavior of the human actor. |
10107182 | 15702976 | 1 | 1. A method for a boosted engine system, comprising: in response to boost demand, selectively deactivating cylinders by deactivating individual cylinder valve mechanisms to provide a cylinder pattern for selective cylinder deactivation, the cylinder pattern selected to direct exhaust from active cylinders into one of a plurality of engine turbines of turbochargers, the cylinder pattern selected to include a total number of deactivated/active cylinders, the deactivated engine cylinders selected based on their firing order, and selecting the one of the plurality of engine turbines based on turbine temperature. |
20110221754 | 13041818 | 0 | 1. A method for detecting a curve structure in an image, comprising: detecting a plurality of curve segments in the image; generating a graph based on the curve segments, wherein the graph comprises a plurality of nodes corresponding to the plurality of curve segments and a plurality of edges connecting the plurality of nodes; and detecting a curve structure in the image by determining a path from a source node to a destination node in the graph. |
20130198149 | 13599320 | 0 | 1. A method comprising: accepting a service design; assessing corrupting factors within the service design; generating a corruption susceptibility score; and generating an alternative service design responsive to a corruption susceptibility score fulfilling predetermined criteria. |
20070288433 | 11679973 | 0 | 1. A system comprising: a receiver to receive a search query; a first associator to associate a first numerical value with a first keyword that is a part of the search query, the first numerical value being based on usage of the first keyword in a plurality search queries; a tracker to track user activity associated with the first keyword; a second associator to associate a second numerical value with the first keyword based upon the user activity, the second numerical value being based on determinable user activity associated with the first keyword; a calculator to determine a difference value between the first and second numerical values, and to associate the difference value with the first keyword; a sorter to sort a plurality of keywords based upon respective difference values associated with each keyword of the plurality of keywords; and an outputer to output a result of the sort. |
20060212284 | 11437903 | 0 | 1. A method of optimizing a block diagram model comprising: determining if a first portion of a block diagram model can operate with improved performance; and providing a user a first modification for operating the first portion of the block diagram model with improved performance. |
9830643 | 12483506 | 1 | 1. A method comprising: receiving a request, from a user, to perform an action at an online marketplace, the action including at least one of buying, selling, and posting at the online marketplace; retrieving a plurality of risk assessment factors associated with the action, the risk assessment factors including at least one of a phone number of the user, a locale of the user, value of an item associated with the action, category of an item associated with the action, the action type, a description of the item a listing site, and an Internet Protocol address of the user; performing, using a hardware processor, a risk assessment process by feeding the risk assessment factors to a supervised learning algorithm, the risk assessment process identifying a risk mitigation process; requesting that the user perform the risk mitigation process identified by the risk assessment process; allowing the user to perform the action in response to the user completing the identified risk mitigation process; and modifying the risk assessment process by adjusting one or more internal weights used by the supervised learning algorithm and based upon a result of a post-action analysis of the action. |
20090192841 | 12021213 | 0 | 1. A computer method for performing analysis of operational activities with respect to uncertainty data, the method comprising: determining uncertainty data relating to one or more data records, each comprising a contingent performance deliverable (CPD) that specifies a set of rights and obligations for two or more parties to the CPD with respect to operational activities, wherein the rights and obligations are defined over a set of uncertain potential future events (SPFE) of the CPD; producing an evaluation of likely result of the specified rights and obligations of the parties to the CPDs over the SPFEs of the CPDs on the operational activities of at least one organizational entity, wherein the evaluation includes one or more sources of uncertainty related to the operational activities of the at least one organizational entity, or to a party to one or more of the CPDs. |
9953277 | 13407216 | 1 | 1. A Role-aligned Competency and Learning Management System (RCLMS) for generating a set of priority lists of employees of an organization for addressing demand and supply of competencies of the employees for at least one role in the organization, the RCLMS comprising: a processor; and a memory coupled to the processor, the memory comprising: a Business and Competency Managing Module (BCMM), stored in the memory and executable by the processor, to classify a business of the organization into service technology areas and product technology areas in a database, wherein the classifying includes categorizing of the service technology areas and product technology areas into a plurality of hierarchy levels; and determine at least a focus area, a sub-focus area and a community as hierarchy levels for each of the service technology areas and for each of the product technology areas, wherein the employees possess competency relating to at least one of the hierarchy levels of at least one of the service technology areas and the product technology areas, wherein the determination is based on a plurality of weights and maturity levels to be acquired in each of a set of knowledge dimensions; a Role Managing Module (RMM), stored in the memory and executable by the processor, to determine a set of roles in the organization, each role of the set of roles being indicative of a functional job of the employees of the organization and is associated with at least one of the service technology areas and the product technology areas; and an analysis module, stored in the memory and executable by the processor, to obtain a role list comprising: at least one role from the set of roles for which demand and supply of competencies of the employees is to be analyzed; and at least one service competency and at least one product competency demanded for the at least one role; obtain a location and a time at which the at least one role in the role list is required; compute a Best Fitment Index (BFI) for each of the employees for the at least one role in the role list, based on: exact matching of competencies possessed by a respective employee with the at least one service competency and the at least one product competency demanded for the at least one role; fuzzy matching of competencies possessed by the respective employee and the at least one service competency and the at least one product competency demanded for the at least one role in at least one of a peer class of competencies and a conjugate class of competencies under the hierarchy levels, wherein an equivalence is determined by performing a check of at least one of peer class and conjugate class associated with at least one service competency and the at least one product competency; and the location and the time for the at least one role; identify employees for whom the BFI is greater than a predefined minimum percentage fit; generate the set for priority lists of the identified employees based on the BFI, availability at the location, and availability at the time, for addressing the demand and the supply of competencies of the employees for the at least one role in the role list; build a competency management framework by generating employee profiles based upon one or more user inputs to bridge a demand and supply gap; and a lifecycle module, stored in the memory and executable by the processor, to implement a lifecycle process for each competency in each of the hierarchy levels of each of the service technology areas and the product technology areas, wherein the lifecycle process defines how the each competency is created, deployed, supported, and retired in the organization, wherein the BCMM is further configured to calculate an Employee Competency Menu (ECM) for each employee, wherein the ECM comprises: a set of current competencies possessed by the each employee in at least one of the hierarchy levels of at least one of the service technology areas and the product technology areas, a current proficiency level associated with each of the set of current competencies possessed by the employee, and a proficiency weight associated with the each competency of the set of current competencies, and wherein the BCMM is further configured to calculate a Cumulative Proficiency Index (CPI) for the employee based on the ECM, wherein the CPI is indicative of a depth and a breadth of the set of current competencies possessed by the employee, wherein the depth is equal to a summation of the proficiency weight associated with each of the set of current competencies, and wherein the breadth is equal to a total number of competencies in the set of current competencies. |
7729961 | 12081307 | 1 | 1. A computer-implemented method of normalizing public HMDA data received from a federal agency, the method comprising: receiving, by a processor, Home Mortgage Disclosure Act (HMDA) data including at least one of HMDA data reports and loan-level public HMDA data, the HMDA data having loan information that varies as a function of time and that is provided by multiple financial institutions; correcting, by the processor, errors in the HMDA data; normalizing, by the processor, the HMDA data across variations in the information, wherein normalizing comprises: accessing a first database storing data indicative of which HMDA data is provided by each of the multiple financial institutions, accessing a second database storing the names of the multiple financial institutions and associated identifying tags that identify relationships among the multiple financial institutions, reducing, based on the data stored in the first database and the names of the multiple financial institutions and the associated identifying tags stored in the second database, a total number of the names of the multiple financial institutions, and reassigning, based on the reduced total number of the names of the multiple financial institutions, the data stored in the first database; summarizing, by the processor, the normalized HMDA data; and outputting, by the processor, the summarized and normalized HMDA data to an application for analysis. |
8727780 | 13624705 | 1 | 1. A method of creating a mathematical research system, the method comprising: accessing a plurality of documents; analyzing each of the plurality of documents to identify any mathematical concepts expressed in each document, wherein the mathematical concepts are extracted from one or more algorithmic, linguistic, geometric, and graphic mathematical exercise representations; for each document including one or more mathematical concepts, tagging the documents with a corresponding one or more mathematical concept tags; creating two or more concept line items (CLI)s from the one or more mathematical concepts, wherein a CLI is a textual expression of a mathematical concept; defining interrelationships between the two or more CLIs, wherein each defined interrelationship includes one or more of a prerequisite to another CLI, a dependency on another CLI, or a lack of relationship to another CLI; generating, by a computer processor, a mapping of the interrelationships of the two or more CLIs, wherein the mapping is in the form of a directed graph, wherein the directed graph includes one or more prerequisite and dependency interrelationships; storing the two or more CLIs and the generated mapping in one or more databases; creating an index relating each CLI to the corresponding documents; providing a search interface through which a user searches the database to identify documents related to one or more CLIs; and generating an educational curriculum from a search result, wherein the search interface accepts a search term provided by the user, and wherein the search interface accepts all of the following forms of search terms: text-based phrases, mathematical expressions expressed in documents, interrelationships, and concept ranges. |
9612831 | 13301341 | 1 | 1. A method for determining a productivity measure of a code base, the method comprising: executing by at least one processor capable of executing instructions encoded on a computer-readable medium, the steps of: (a) determining a created lines of code measure of a code base; (b) determining a call graph based on the code base; (c) determining a reuse ratio for the code base based on the call graph; and (d) computing a cost avoided, the computation comprising modifying the created lines of code measure by the reuse ratio for the code base, normalizing the created lines of code measure using a measure of function points of the code base, wherein normalizing the created lines of code measure comprises applying at least one function point gearing factor to the created lines of code measure of the code base, and wherein the at least one function point gearing factor is based on historical data for at least one programming language. |
7840484 | 11169769 | 1 | 1. A method of developing a credit score for a consumer, comprising: modeling, by a computer-based system for developing a credit score for a consumer comprising a processor and a tangible, non-transitory memory, consumer spending patterns using individual consumer data and aggregate consumer data for a plurality of consumers, including tradeline data, internal customer data, and consumer panel data; estimating, by the computer-based system, credit-related data of the individual consumer based on tradeline data of the individual consumer, an amount of identified balance transfers of the individual consumer, and the model of consumer spending patterns, wherein the credit-related data comprises a spend amount associated with the individual consumer; offsetting, by the computer-based system, the identified balance transfers from the estimated credit-related data; and determining a credit score for the individual consumer by using the estimated credit-related data. |
9536148 | 14499061 | 1 | 1. A method of assessing building structures with a computing system comprising: a. providing a first reference file containing first image data for an outside portion of a first target building structure; b. providing an electronic structure classifier programmed and trained to process said first image data and perform at least the following operations: i. detect a plurality of different individual building elements in said first target building structure; ii. rate a condition associated with each of said plurality of different individual building elements; iii. assign a first rating to such first target building structure, which rating identifies one of an occupancy prediction, a purchase prospect score, or an overall exterior physical condition of such building structure; wherein said electronic structure classifier generates a preliminary first electronic building structure record that includes an identification of said different individual building elements and an associated rating condition; c. providing an electronic template within an interface adapted to permit a human operator to process and modify said preliminary first electronic building structure record, including: i. a first portion of said interface which displays first image data for said first target building structure including said plurality of different individual building elements; ii. a second portion of said interface which displays a template of building data fields accompanying said first image data, which fields are configured as human operator selectable options for capturing data parameters for said plurality of different individual building elements for said first target building structure, including: 1) an operator specified identification of a building element; 2) an operator specified building element type associated with such building element; 3) an operator specified rating for such building element; wherein said electronic structure classifier is further adapted to perform an operation of generating a final first electronic structure building record based on data captured from a human operator reviewing said first target building structure within said electronic interface; d. performing a verification to determine that a user is an owner of said first target building structure; e. generating a report for said first target building structure on demand and in real-time in response to an owner request based on the results of said verification step. |
20060129397 | 11009630 | 0 | 1. A method of processing acoustic information, comprising: extracting a plurality of sets of acoustic information of interest from a data store; performing speech recognition on the acoustic information to obtain speech recognition results; clustering the sets of acoustic information into clusters based on a semantic analysis of the speech recognition results; and identifying, for each cluster, a set of acoustic information as being representative of a corresponding cluster. |
8826198 | 13892984 | 1 | 1. A method implemented by a computer for placing sub-resolution assist features (“SRAF”) with respect to one or more target patterns in an original mask layout, comprising: generating an initial SRAF guidance map for the original mask layout; generating a first set of one or more SRAFs according to the initial SRAF guidance map; generating a first altered mask layout corresponding to the original mask layout by placing the first set of one or more SRAFs in the original mask layout; determining, by the computer, a lithographic response for the first altered mask layout as a function of one or more process window parameters; and determining whether the lithographic response for the first altered mask layout accommodates a predefined process window size. |
7523118 | 11416973 | 1 | 1. A method for optimizing a federated database management system having a federated database server and a plurality of data source servers comprising the steps of: a) determining schema and metadata configurations of the data source servers; b) enumerating available resources; c) enumerating security and confidentiality requirements; d) calculating an optimal federated database management system design based on the schema and metadata, the enumerated available resources, and the enumerated security and confidentiality requirements, wherein said calculating includes: (i) modeling a cost in terms of available resources consumed by each strategy of a plurality of strategies while executing a query with said federated database management system; (ii) determining whether operations associated with said query should be performed by said federated database server or one of said data source servers; (iii) determining the optimal order of said operations associated with said query; e) designing an optimal federated database management system, wherein said designing includes: (i) selecting the strategy having the lowest cost for executing said query; (ii) in response to determining that said operations associated with said query should be performed by said federated database server, selecting said federated database server to perform said operations according to said optimal order; (ii) in response to determining that said operations associated with said query should be performed by one of said data source servers, selecting said data source server to perform said operations according to said optimal order; and f) providing functionality for user input including user heuristics and data inputs. |
20180158178 | 15887670 | 0 | 1. An inpainting device using segmentation of a reference region, comprising: a region determination unit configured to determine an inpainting target region present within video image content and a reference region composed of pixels present within a preset distance from boundary pixels of the inpainting target region; an inpainting group setting unit configured to set inpainting groups composed of respective pairs of segmented reference regions obtained by segmenting the reference region using pixel values within the reference region and segmented target regions obtained by segmenting the target region so as to correspond to the segmented reference region; an inpainting unit configured to perform segmentation inpainting adapted to perform inpainting on a segmented target region using the segmented reference region on an inpainting group basis, and non-segmentation inpainting adapted to perform inpainting on the target region using the reference region; an information provision unit configured to visually provide a result of the segmentation inpainting, a result of the non-segmentation inpainting, and information about a difference between the results of the segmentation inpainting and the non-segmentation inpainting to the user; and a group set generation unit configured to differently generate group sets based on a number of inpainting groups. |
9495497 | 14960601 | 1 | 1. A computer-implemented method of performing dynamic voltage-frequency scaling of an integrated circuit, the method comprising: performing statistical timing analysis using a canonical form of a clock, the canonical form of the clock being a function of variability in voltage; obtaining, using a processor, a canonical model expressing timing slack at each test location of the integrated circuit as a function of one or more sources of variability, one of the one or more sources of variability being voltage; determining, using the canonical model, a clock period value or a voltage value based, respectively, on selecting a desired voltage or a desired clock period; and controlling a physical implementation of the integrated circuit according to the clock period value and the desired voltage or the voltage value and the desired clock period to perform the dynamic voltage-frequency scaling. |
20120044998 | 13285496 | 0 | 1. A method of estimating motion and occlusion at a current site in a current frame from a video stream having three or more frames, the method comprising: identifying a plurality of motion vector candidates for each of a forward direction and a backward direction, the identification of at least some motion vector candidates performed at a block level, a pixel level, or a combination thereof using the steps of: initializing the motion vector candidate, and updating and refining the motion vector candidate, the updating using a measure of ill-conditioning of a gradient based estimation of the motion vector candidate and the refining using one or more update energies based on interframe difference, spatial motion correlation, and temporal motion correlation; generating a plurality of candidate pairs, each candidate pair in the plurality of candidate pairs having a forward motion vector from the plurality of motion vector candidates for the forward direction and a backward motion vector from the plurality of motion vector candidates for the backward direction and a occlusion state vector having a forward occlusion state and a backward occlusion state; determining an energy for at least some of the plurality of candidate pairs using a processor by jointly evaluating the forward motion vector and the backward motion vector of at least some of the plurality of candidate pairs based on interframe difference, spatial motion correlation, temporal motion correlation, and spatial occlusion correlation; and estimating motion and occlusion for the current site by selecting a candidate vector from the plurality of candidate vectors based on the determined energies. |
8214071 | 12439944 | 1 | 1. A fiber orientation control method characterized by comprising the steps of: expressing changes of velocity components of a paper material at an exit of a slice lip by using a mathematical model, wherein the changes of velocity components are caused by manipulating at least one of an edge flow adjustment means and a side bleed adjustment means of a headbox when supplying the paper material on a wire; setting the mathematical model based on an assumption in which a velocity component orthogonally crossing a flow direction of the paper material is proportionally changed by at least one of changes of an edge flow and a side bleed of a certain response width from the exit of the slice lip; and based on an evaluation function calculated by using a forecasting calculation means which calculates changes of a fiber orientation profile in a cross direction in accordance with the mathematical model, calculating at least one of an operation amount of an edge flow and an optimized operation amount of a side bleed. |
8000946 | 11533590 | 1 | 1. A computer program product comprising: a non-transitory computer readable medium having computer usable program code for simulating a manufacturing process, the computer program medium comprising: a first program module, wherein the first program module creates a discrete event simulation model from process definition data and runs simulations using the discrete event simulation model, wherein the discrete event simulation model includes a current schedule; a second program module, wherein the second program module analyzes task information to generate a schedule; and a third program module, wherein the third program module receives the process definition data for a manufacturing process, sends the process definition data to the first program module to initiate creation of the discrete event simulation model, initiates running of a first simulation using the discrete event simulation model to produce results, determines whether the results meet a threshold, sends information from the results and the discrete event simulation model to the second program module to cause the second module to generate a new schedule in response to a determination that the results meet a threshold, sends the new schedule to the first program module to cause creation of a new discrete event simulation model including the new schedule, determines whether the new schedule meets a desired threshold of reduction in time compared to the current schedule, and initiates running of a second simulation using the first program module to generate new results in response to a determination that the new schedule does not meet the desired threshold of reduction in time of the process compared to the current schedule. |
20170032070 | 15163497 | 0 | 1. A method for designing a multiple tuned filter (MTF) in a high voltage direct current (HVDC) system, the method comprising: setting an input parameter constituting the MTF; setting a resonance frequency of the MTF; extracting at least one LC combination case constituting the MTF on the basis of the input parameter and the resonance frequency; performing optimization for harmonic reduction on the LC combination case; and extracting an LC combination case determined based on a result obtained by performing the optimization. |
20080256007 | 11786006 | 0 | 1. A computer-implemented system for inferring structured variables, comprising: a priority function that utilizes a probable approximate underestimate; and, a classification function which assigns a score to a plurality of hypothetical structured variables, and through inferencing, searches for a best scoring hypothesis where the search is guided by the priority function. |
9672251 | 14499615 | 1 | 1. A method comprising: obtaining a plurality of seed facts, wherein each seed fact identifies a subject entity, an attribute possessed by the subject entity, and an object, and wherein the object is an attribute value of the attribute possessed by the subject entity; generating a plurality of patterns from the seed facts, wherein each of the plurality of patterns is a dependency pattern generated from a dependency parse, wherein a dependency parse of a text portion corresponds to a directed graph of vertices and edges, wherein each vertex represents a token in the text portion and each edge represents a syntactic relationship between tokens represented by vertices connected by the edge, wherein each vertex is associated with the token represented by the vertex and a part of speech tag, and wherein a dependency pattern corresponds to a sub-graph of a dependency parse with one or more of the vertices in the sub-graph having a token associated with the vertex replaced by a variable; applying the patterns to documents in a collection of documents to extract a plurality of candidate additional facts from the collection of documents, wherein applying the patterns to documents in the collection of documents comprises: applying the dependency patterns to documents from the collection of documents to identify matching sentences; generating an extraction from each matching sentence; and aggregating the extractions to generate the candidate additional facts; and selecting one or more additional facts from the plurality of candidate additional facts. |
20080215455 | 12104164 | 0 | 1. A data processing machine comprising: a processor; a memory; a plurality of product identifiers in the memory; a database in the memory, the database comprising a plurality of merchants' prices for each product identifier; and a program operable on the processor to retrieve the merchant prices from the database, match each product identifier with all corresponding merchant prices, and determine the minimum merchant price for each product identifier; whereby a consumer using the data processing machine can compare each merchant's price for a plurality of products. |
20020188499 | 09984349 | 0 | 1. A method for fulfilling an existing order that requests a desired item by a desired time, the method comprising the steps of: creating a supply chain model using data describing various activities in a supply chain; determining the requirements of the order; checking said supply chain model to determine the availability of said desired item by said desired time; if said desired item is unavailable by said desired time, modifying the supply chain as needed to fulfill the order; and modifying the supply chain model to reflect the changes in the supply chain needed to fulfill the order. |
20110058752 | 12873083 | 0 | 1. (canceled) |
20180249665 | 15450163 | 0 | 1. A plant, a plant part, or a seed of soybean variety CL1564482, wherein a representative sample of seed of said soybean variety CL1564482 has been deposited under ATCC Accession Number PTA-123830. |
20160147734 | 14550218 | 0 | 1. (canceled) |
20060271532 | 11282306 | 0 | 1. A computerized method for supervised learning, comprising: receiving a set of training elements; selecting a basis element from the set of training elements; adding the basis element to a basis element set; conducting an optimization test on the basis element set with the selected basis element to produce a selection score; determining whether the selection score indicates an improvement in optimization for the basis element set; and discarding the basis element if the selection score does not indicate an improvement. |
20150213108 | 14656607 | 0 | 1. A multidimensional data process method, comprising: obtaining attribute information in dimension information and hierarchical relationship information of respective attributes in a data service; generating a recursive topology according to the attribute information in the dimension information and the hierarchical relationship information of the respective attributes; and the recursive topology comprising an attribute composition set and recursive paths of respective attribute compositions in the attribute composition set; confirming attribute compositions for querying in the attribute composition set; confirming attribute compositions for fixing in the attribute composition set according to the attribute compositions for querying; fixing the attribute compositions for fixing to form fixed attribute compositions and obtaining index data in accordance with the fixed attribute compositions; recursing index data in accordance with the attribute compositions for querying according to the recursive paths and the index data in accordance with the fixed attribute compositions. |
9164994 | 14501138 | 1 | 1. A device for scoring media items comprising: a communication interface for communicating over a network; at least one processor; memory containing software executable by the at least one processor whereby the device is operative to: define a plurality of criteria; analyze a group of media content items with respect to the plurality of criteria to determine a number of media content items that satisfy each of the plurality of criteria to provide analysis results; programmatically assign weights to the plurality of criteria as a function of the analysis results, wherein the weights are normalized according to the criteria having the greatest number or percentage of media content items; and score at least one media content item as a function of the weights assigned to the plurality of criteria. |
9471871 | 14186740 | 1 | 1. A method of generating irredundant features optimal to a particular dataset and classifier, comprising: a. inputting a dataset of messages; b. inputting a classifier; c. encoding an algebra of computable features capable of describing the dataset through expression trees; and d. applying a genetic algorithm to select a resulting feature which maximizes accuracy of the classifier given a validation set. |
8776252 | 13631843 | 1 | 1. A method, comprising: recording information associated with attempts to access data on a server, wherein the attempts are provided remotely over a network to which the server is coupled; heuristically analyzing the information, which includes comparing a previous attempt to access the data with a latest attempt to access the data in order to identify a pattern associated with data leakage; and securing the data on the server such that access to the data is prevented for a predefined period of time based on the pattern. |
10127568 | 13438936 | 1 | 1. A method of adjusting forecast load predictions on an electric grid using one or more operatively connected computers, the method comprising: obtaining, at the one or more computers from at least one of an energy generation computer system or an energy retailer computer system, electrical grid information comprising: a day-ahead profile of a forecasted load for the electric grid, a day-ahead sparks ratio, wherein the day-ahead sparks ratio is the actual day-ahead electricity prices relative to the prices of fuel used to generate electricity, a day-ahead price profile, and an hourly forecasted load relative to maximum hourly forecasted load for the day, minimum hourly forecasted load for the day, and average forecasted load for the day; accessing, from one or more databases operatively connected to the one or computers, electrical grid historical data; calculating, by the one or more computers, coefficients for an electricity consumption equation by performing a regression analysis using the historical data, the electricity consumption equation being a function of day-ahead sparks ratio, day-ahead price profile, day-ahead profile of forecasted load, hourly forecasted load relative to the forecasted profile, and coefficients of variation and skewness in day-ahead prices and forecasted load; calculating, by the one or more computers, forecast prediction errors by applying data from the obtained electrical grid information to the electricity consumption equation with the calculated coefficients; providing, by the one or more computers to one or more computer systems associated with an electric grid system operator, one or more electronic reports containing forecast errors for the electric grid; calculating, by the one or more computers, one or more residual terms as the differences between i) predicted errors from the historical data using the electricity consumption equation, and ii) actual errors from the historical data; applying, by the one or more computers, the residual terms to an auto-regressive moving average analysis, so as to determine one or more disturbances at one or more times; calculating, by the one or more computers, a new set of coefficients for the electricity consumption equation based on the auto-regressive moving average analysis; and controlling operation of a plurality of electric power generators of the electric grid based on the electricity consumption equation with the new set of coefficients. |
9479479 | 14496666 | 1 | 1. A device, comprising: one or more processors to: receive rule information associated with a firewall policy, the rule information including a set of rules; add a rule, of the set of rules, to a detector tree associated with the firewall policy, the rule being added to the detector tree as a first leaf node based on a source address, associated with the rule, and as a second leaf node based on a destination address associated with the rule; identify one or more other rules to which the rule is to be compared based on adding the rule as the first leaf node and as the second leaf node, the one or more other rules being included in the set of rules; compare the rule and the one or more other rules; detect a rule anomaly based on comparing the rule to the one or more other rules, the rule anomaly being associated with a conflict between the rule and another rule of the one or more other rules; add, to the first leaf node and based on detecting the rule anomaly, information identifying the rule anomaly and information identifying a first node associated with the other rule and included in the detector tree; and add, to the second leaf node and based on detecting the rule anomaly, the information identifying the rule anomaly and information identifying a second node associated with the other rule and included in the detector tree. |
9671502 | 14819823 | 1 | 1. A portable device, comprising: a receiver that receives Global Navigational Satellite System (GNSS) signals; one or more non-transitory computer-readable media, wherein at least one of the one or more non-transitory computer-readable media stores a set of instructions; and one or more processors, wherein at least one of the one or more processors, when executing the set of instructions stored in the at least one of the one or more non-transitory computer-readable media, controls the portable device to perform at least the following steps: when a dead zone is entered, determining whether a dead zone database has a record for the dead zone; if a dead zone database record exists for the dead zone: retrieving polynomial coefficients corresponding to the dead zone from the dead zone database; calculating one or more synthetic position solutions using the polynomial coefficients while in the dead zone; and using at least one of the one or more synthetic position solutions to calculate one or more position solutions when exiting the dead zone, wherein the dead zone comprises an area where either no or insufficient GNSS satellite signals are received by the portable device. |
7974938 | 11859034 | 1 | 1. A method of storing and using a set of observations of real-world events and actions, the method comprising: generating clusters based on the set of observations, each cluster representing correlations between events and actions in a subset of the observations in the set of observations; processing the clusters into a first linked graph based on a set of rules to identify correlations between the events and actions in the set of the observations, the first linked graph tagged to indicate the correlations between the events and the actions based on the set of rules; presupposing that an event is reversible unless an observation contradicting reversibility of the event is obtained; and tagging an edge associated with the irreversible event as having uncertain correlations with actions that are irreversible. |
8666867 | 13571197 | 1 | 1. A method for estimating an expected value of a financial contract, the method comprising: receiving observable market data; calibrating one or more financial models using the market data to obtain estimates for one or more model parameters corresponding to each of the one or more financial models; generating a set of model risk metrics, the set of model risk metrics comprising: for each of the one or more financial models, one or more corresponding financial model partial derivative functions representing a rate of change of the financial model with respect to each of its corresponding model parameters; and for each of the model parameters, one or more corresponding model parameter partial derivative functions representing a rate of change of the model parameter with respect to each of the market data, parsing the contract into a set of contract valuation functions, the set of contract valuation functions depending, at least in part, on a subset of the model parameter estimates and the set of contract valuation functions including an ultimate contract valuation function representative of the value of the contract; generating a set of contract valuation risk functions corresponding to the set of contract valuation functions, each of the set of contract valuation risk functions comprising one or more partial derivatives of a corresponding contract valuation function with respect to all inputs to the corresponding contract valuation function; estimating an expected value for the contract, the expected value for the contract comprising an expected value for the ultimate contract valuation function; and estimating one or more expected values for risk of the contract, each expected value for the risk of the contract comprising an expected value for one of the contract valuation risk functions corresponding to the ultimate contract valuation function. |
20100251223 | 12814882 | 0 | 1. A system that automatically decomposes an existing sequential program into one or more distributed programs that execute on multiple-processing elements of a computing system; decomposition is performed without the knowledge of a user, the system comprising: a computer system comprising a plurality of processing elements; a target program in object code form, the target program written to run on a single processing element computer system; a plurality of strategies, the strategies including one or more of parallelization strategies and distribution strategies; a Veil program having coded therein a means for: (a) encapsulating the target program with a run-time analyzer; (b) selecting one of the strategies from the plurality of strategies; (c) parallelization and distributing the target program according to the selected one strategy; (d) executing the target program by one or more of the processing elements; (e) recording execution results of the target program; and (f) if there are further strategies in the plurality of strategies, changing the selected one strategy to a next strategy from the plurality of strategies and repeat steps a-f; (g) comparing the execution results and selecting a best parallelization strategy having a best performance-oriented result; and (h) parallelizing the target application using the best parallelization strategy with the best performance-oriented result. |
20120330970 | 13517562 | 0 | 1. A computer-implemented method for optimizing web searching and scheduling of service providers, the method comprising the steps of: aggregating service providers and their services; checking, in real time, the availability information for the service providers; using the availability as a criterion for a schedule optimization; proposing one or more optimized series of services (schedule) for which there is availability; scheduling one or more series of events under various constraints; scoring each series of events that can thereby be ranked; and assigning a score to each series of services that can thereby be ranked. |
8954513 | 12470079 | 1 | 1. A method comprising: receiving, at a data analyzer, captured email over a network, the captured email being communicated between a sender and an intended recipient through the network; analyzing the captured email including: scanning the captured email for search terms defining personal or confidential information, and identifying trends based on the personal or confidential information contained in the captured email including, after the scanning, evaluating occurrences in the captured email of the personal or confidential information and determining the nature and amount of personal or confidential information passing through the captured email; and identifying, based on the identified trends, one or more security-related protocols for securing future communications between the sender and the intended recipient wherein the one or more security-related protocols are different than protocols used to send communications between the sender and the recipient that were included in the captured email. |
20080140776 | 11965124 | 0 | 1. A method to facilitate optimal communications, comprising: defining a first subset of policies that relate to communications attempts by contactors and contactees; and defining a second subset of policies that relate to routing sequences associated with a channel of communication and a context of the contactors and contactees. |
20140344199 | 14452006 | 0 | 1. A method for modifying candidate solutions of an optimization problem, the method comprising: selecting at least one candidate solution from a first plurality of candidate solutions, wherein the first plurality of candidate solutions has converged on a suboptimal solution during a computer simulation that tests fitness of the first plurality of candidate solutions for the optimization problem; storing a copy of the at least one candidate solution; performing a cataclysm on the first plurality of candidate solutions; generating a second plurality of candidate solutions; and after one or more additional computer simulations that test the fitness of the second plurality of candidate solutions for the optimization problem, integrating the copy of the at least one candidate solution into the second plurality of candidate solutions. |
7900126 | 11863022 | 1 | 1. A receiver, comprising: a demodulator configured to receive a wireless signal comprising an original data signal and a carrier signal, remove the carrier signal from the wireless signal, and produce a received signal; and a Low Density Parity Check (LDPC) processor coupled with the demodulator, the LDPC processor configured to recover the original data signal from the received signal, the LDPC processor comprising: a plurality of variable node processors configured to generate variable messages based on the received signal, and a check node processor coupled with the plurality of variable node processors, the check node processor configured to implement an approximation of a sum product algorithm (SPA) using base 2 logarithm operations and rounding all operands and results to the nearest integer. |
8744165 | 13553448 | 1 | 1. A computer-implemented method for stain separation comprising: transforming a digital image from a first color domain to an optical domain to form an optical domain image (ODI); identifying a plane containing two or more basis vectors which contain pixels of the ODI; forming a histogram of the digital image represented by the two or more basis vectors; and determining one or more final stain vectors by searching for candidate vectors in the plane that minimize a cost function of the histogram. |
20120023042 | 12839929 | 0 | 1. A method comprising: training a computer implemented Bayesian based diagnostic system; using the diagnostic system to obtain a diagnosis with an accuracy measure; and generating a confidence indicator corresponding to the diagnosis. |
9477809 | 12343408 | 1 | 1. A computer-implemented method for processing workflow data generated by inspection systems, the workflow data comprising training for users of a method, data analysis, performance analysis, data mining, or quality control systems for the workflow data, the inspection systems including a plurality of inspection devices comprising image modalities, each modality generating unscreened data comprising one or more patient medical image files, the method comprising: with a computing system comprising one or more computing devices, the computing devices comprising: a plurality of inspection devices comprising a plurality of image modalities each modality generating unscreened data comprising one or more patient medical image files; an unscreened data coordinator for combining the unscreened data from the image modalities and generating a workflow; a server comprising: a distribution module, and a data evaluation module; the server configured to access the workflow of the unscreened data, the workflow comprising a plurality of sets of the unscreened data, each set comprising the one or more patient medical image files; the distribution module configured to distribute the workflow of the unscreened data to one or more workstations, each workstation, comprising: a display for providing notifications or alerts to a user, and a user input device, the user comprising an interpreter of the unscreened data, the user providing interpretative data to the workstation via the user input device; the data evaluation module comprising a processor configured to execute instructions to carry out the method, comprising: receiving, from an interpreter's workstation, the interpretive data created by the interpreter during review of a set of the one or more patient medical image files that have not been previously reviewed by the interpreter, wherein the interpretive data comprises a textual characterization of structures or findings that the interpreter observed in the set of the one or more patient medical image files; storing in the data evaluation module a plurality of keywords that are commonly literally found in the textual characterization within the interpretive data, the keywords associated with the one or more patient medical image files; associating each keyword with a rank; parsing text in the interpretive data for keywords, wherein the keywords are indicative of a degree of richness of the structures or findings, the degree of richness reflecting a degree of seriousness, abnormality, rarity, criticality, and/or difficulty of characterization; accessing keywords and associated scores or ranks stored in the data evaluation module; comparing the parsed keywords with the accessed keywords; applying a numerical ranking algorithm to the interpretive data based on a comparison of the parsed keywords and the associated score or rank for each keyword, such that an aggregated numerical rank is assigned to the set of the one or more patient medical image files, wherein the algorithm is configured to assign a smaller rank when the characterization indicates normal structures or a lack of findings and an increasingly larger rank to increasingly rich structural variants or findings; generating an aggregate rank for the interpreter for the plurality of sets of the one or more patient medical image files based on the assigned rank; and based on the aggregate rank for all interpreters using the computing system, cause the unscreened data coordinator to adjust the workflow of the inspection systems by halting the inspection or adjusting a rate of inspection from the imaging modalities. |
9123144 | 13295009 | 1 | 1. A method implemented by one or more computing devices, the method comprising: obtaining an input frame of a user's face; fitting two-dimensional feature points to the user's face in the input frame; generating a batch of frames that includes the input frame; constructing an energy function that includes the two-dimensional feature points and other two-dimensional feature points, three-dimensional head shape parameters, three-dimensional head pose parameters, and three-dimensional facial expression parameters for individual frames of the batch of frames; solving the energy function to obtain a three-dimensional head shape parameter update; and determining a three-dimensional shape of the user's face using the three-dimensional head shape parameter update. |
7827109 | 10013507 | 1 | 1. A computing device, comprising: a processor; memory having stored therein instructions executable by the computing device to: perform a first process, wherein performing the first process includes decrypting a set of data; upon the first process being interrupted, perform a second process, wherein performing the second process includes determining whether a non-cryptographic operation performed by the first process on the decrypted set of data constitutes using the decrypted set of data in a manner that is inconsistent with one or more forms of usage authorized for the decrypted set of data; and in response to the second process detecting usage by the first process of the decrypted set of data that is inconsistent with the one or more authorized forms of usage, stop further usage of the decrypted set of data by the first process. |
20110292849 | 12788543 | 0 | 1. A method for Turbo decoding with state metric computations, the method comprising: receiving a set of branch metrics; receiving a set of previously calculated state metrics; comparing a first subset of the received set of state metrics with a second subset of the received set of state metrics; selecting, before the received set of branch metrics is added to the received set of state metrics, the first subset or the second subset responsive to the comparison, the selected subset comprising a first selected subset; and adding one or more subsets of the received set of state metrics to respective subsets of the received set of branch metrics. |
7660736 | 11524153 | 1 | 1. A computer-implemented method of pricing an order for a product based on varying lead times during a specified time period, comprising: calculating, by a computer system, a set of values for a product over a range of available supplies of the product; determining, by the computer system, a size Q of the order; selecting, by the computer system, a set of order points during a time horizon, each order point having a lead time LT to the next order point; for a first order point, calculating, by the computer system, an incremental production quantity as Q/LT, and calculating, by the computer system, revenue displaced by the incremental production quantity using the product values; repeating the preceding act for each other order point; calculating, by the computer system, an average displaced revenue; and calculating, by the computer system, the price for the order, using the results of the preceding act. |
8024211 | 11395831 | 1 | 1. A computer-implemented method for facilitating performance by task performers of tasks from task requesters, the method comprising: issuing qualifications to task performers to indicate abilities of the task performers to perform tasks; facilitating performance of tasks that each have one or more associated qualifications by task performers whose issued qualifications match the associated qualifications of the tasks; automatically tracking the qualifications that are associated with the tasks and the qualifications that are issued to the task performers who perform the tasks, the automatic tracking being performed by one or more programmed computing systems; for each of multiple qualifications, automatically assessing relevance of the qualification related to performing tasks based at least in part on the automatic tracking, the automatic assessing of the relevance of the qualification including measuring an aspect of the qualification with respect to each of one or more predetermined metrics and being performed by the one or more programmed computing systems; and providing information to one or more users regarding the automatically assessed relevance of each of one or more of the qualifications for use by the users related to performance of additional tasks. |
7496879 | 11081823 | 1 | 1. A method of designing an integrated circuit (“IC”) comprising a plurality of configurable circuits including a plurality of configurable interconnect circuits, the method comprising: concurrently assigning each of a plurality of operations in an IC design to an operational cycle and a configurable circuit, wherein concurrently assigning the operations comprises: assigning a first operation to a first operational cycle and a first configurable circuit; and after assigning the first operation to the first operational cycle and the first configurable circuit, assigning a second operation to a second operational cycle and a second configurable circuits, wherein at least one of the concurrently assigned operations is an interconnect operation that is assigned to a configurable interconnect circuit. |
20110137849 | 13027042 | 0 | 1. A computer-implemented experimentation method comprising: selecting a first experiment, wherein the selecting of the first experiment is based, at least in part, on the expected value of information of the experiment; performing the first experiment, wherein the first experiment is executed on a processor-based computing device; inferring automatically a user preference from a plurality of user behaviors that occur after execution of the first experiment; and selecting a second experiment based, at least in part, on the inferred preference. |
20120323929 | 13163589 | 0 | 1. A system comprising: a design manager embodied via executable instructions stored on a computer-readable storage medium, the design manager including: a request receiving engine configured to receive a request for an estimate size of a first compressed index associated with a first database index that is based on a database table; a base index engine configured to obtain a plurality of values indicating sizes of a plurality of second compressed indexes associated with a plurality of respective second database indexes other than the first database index, the second database indexes based on the database table; and a size estimate engine configured to determine the estimate size of the first compressed database index based on one or more of the plurality of values. |
20090076998 | 11901895 | 0 | 1. A method for automatically adding new class definitions to a classification system, comprising: determining a product description and classifying said product description into at least one class utilizing a predefined set of characteristics that are related to a product type in a classification system; comparing said product descriptions with said predefined set of characteristics concerning classifying said product description and extracting a plurality of relevant information from said product description; and coalescing and transforming said plurality of relevant information into a set of new classification rules in order to represent a new product type and automatically classifying said product descriptions that represent said new product utilizing said set of new classification rules. |
20080278334 | 12130814 | 0 | 1. A computer implemented method for inferring a probability of a first inference, wherein the first inference comprises an identification of a dangerous individual, wherein the dangerous individual comprises any individual, individuals, or group of individuals that are disturbed, distressed, or mentally ill and that have a likely predisposition to violent behavior, according to a likely determination of a professional of ordinary skill in the art of mental health, assuming that the professional had possession of at least one fact that would be relevant to the professional in making the determination, wherein likely comprises more probable than not, wherein relevant comprises relevance according to accepted standards of those of ordinary skill in the art of mental health, and wherein the computer implemented method comprises: receiving a query at a database regarding a fact, wherein the first inference is absent from the database, wherein the database comprises a plurality of divergent data, wherein the plurality of divergent data includes a plurality of cohort data, wherein each datum of the database is conformed to the dimensions of the database, wherein each datum of the plurality of data has associated metadata and an associated key, wherein the associated metadata comprises data regarding cohorts associated with the corresponding datum, data regarding hierarchies associated with the corresponding datum, data regarding a corresponding source of the datum, and data regarding probabilities associated with integrity, reliability, and importance of each associated datum; establishing the fact as a frame of reference for the query; applying a first set of rules to the query, wherein the first set of rules are determined for the query according to a second set of rules, wherein the first set of rules determine how the plurality of data are to be compared to the fact, and wherein the first set of rules determine a search space for the query; executing the query to create the probability of the first inference, wherein the probability of the first inference is determined from comparing the plurality of data according to the first set of rules; and storing the probability of the first inference. |
9529857 | 14171689 | 1 | 1. A machine-implemented method for determining a true geometry of a point of interest (POI), the method comprising: identifying, using one or more computing devices, a plurality of geometries associated with one or more points of interest according to one or more relationships; generating, using one or more computing devices, a candidate set of geometries for a first point of interest of the one or more points of interest, the candidate set of geometries including at least two candidate geometries that include geometries being associated with the first point of interest according to the one or more relationships; ranking, using one or more computing devices, the candidate geometries of the candidate set according to a ranking criteria, wherein the ranking sorts the candidate geometries according to the likelihood of the respective candidate geometry to be a true geometry of the first point of interest; selecting, using one or more computing devices, a first candidate geometry of the candidate geometries of the candidate set as the true geometry for the first point of interest according to the ranking; and storing, using one or more computing devices, the first candidate geometry in association with the first point of interest. |
20120227017 | 13040580 | 0 | 1. A method for optical proximity correction (OPC) model accuracy verification for a semiconductor product, the method comprising: generating a multifeature test pattern, the multifeature test pattern comprising a plurality of features selected from the semiconductor product; exposing and printing the multifeature test pattern on a test wafer under a process condition; generating an OPC model of the semiconductor product for the process condition; and comparing the test wafer to the OPC model to verify the accuracy of the OPC model. |
20050267612 | 11201712 | 0 | 1. A mathematical model for a metallurgical plant, comprising: means for modeling a number of units of the metallurgical plant to which to be supplied and discharged media streams are assigned, means for predetermining structure parameters which define at least the number and type of the units as variables for the model, means for fixedly or flexibly linking the media streams to one another within the model on the basis of the structure parameters, in such a manner that each media stream which is to be fed to one of the units is fed to the respective unit either from outside the plant or from another of the units, and each media stream discharged by one of the units is discharged either to outside the plant or to another of the units, means for predetermining starting parameters which describe initial states of the units as variables for the model, means for predetermining input operating parameters, which describe a first part of the media stream profiles, as variables for the model, means for determining and outputting output operating parameters, which describe the remainder of the media stream profiles, by the model, and means for determining and outputting end parameters, which describe end states of the units, by the model. |
8436810 | 12293115 | 1 | 1. An apparatus for displaying time of a type using at least a rotatable pointer on a dial with a circular time axis, and further being adapted for indicating an emotional condition of a user thereof, the apparatus comprising: sensing means for sensing at least one physiological parameter of the user; and display means concurrently displaying (i) time and (ii) a single indicator representative of the emotional condition of the user derived from a stability of the at least one sensed physiological parameter as a function of time, wherein the time and the single indicator use the circular time axis of the rotatable pointer, and wherein displaying the single indicator includes displaying within an outer circle of the dial a current value and a plurality of past values of the single indicator for a predetermined period of time that is selectable between a first mode that uses a twelve hour time scale of the circular time axis and a second mode that uses a one hour time scale of the circular time axis. |
7516431 | 11402526 | 1 | 1. A method, comprising: defining local node sensitivity functions and internode transformation functions in an integrated circuit (IC) design, wherein the node sensitivity functions comprise at least one of a time delay sensitivity function, a signal-to-noise sensitivity function, a noise sensitivity function and a power dissipation sensitivity function; aggregating the local node sensitivity functions at connecting nodes in the IC design to obtain aggregated sensitivity functions at each connecting node; merging the aggregated sensitivity functions at each connecting node to obtain merged sensitivity functions relating local design modifications to estimated global responses; mapping the local design modifications to the estimated global responses via the merged sensitivity functions; and storing the estimated global responses to predict an impact of a local design modification to the IC design. |
8818910 | 14090225 | 1 | 1. A system for prioritizing a list of job candidates for a job opening with a firm, the system comprising: at least one computer system comprising at least one processor and at least one memory unit that is in communication with the at least one processor, wherein the at least one processor is programmed to: use a Random Forest Algorithm to generate a quantity T decision trees, where T is greater than or equal to 2, and the T decision trees are trained based on a training data set of historical candidates classified into hired or unhired classes, wherein each decision tree of the T decision trees is generated by selecting historical candidates in the training dataset randomly with replacement to train the decision tree; and for each of the job candidates, determine a classification of the job candidate for each of the T decision trees; compute a hiring probability for each job candidate based on a ratio of (i) a total of number of times the job candidate was classified as hired to (ii) T; and rank the job candidates by hiring probability to generate a prioritized list of the job candidates. |
7921393 | 11967185 | 1 | 1. A method comprising: creating, by a computing apparatus, an initial state of nodes and nets representative of a circuit netlist of elements of a region of an integrated circuit, wherein the initial state includes first locations of one or more of the nodes, and wherein the nodes are represented by state variables comprising position, velocity, and mass; generating, by the computing apparatus, a system of equations representative of motion of the nodes and nets resulting, at least in part, from one or more forces on the nodes and nets; evolving, by the computing apparatus, the system over time to determine second locations of one or more of the nodes; generating, by the computing apparatus, a placement of the elements of the integrated circuit in accordance with the determined second locations; and reducing, by the computing apparatus, congestion by transiting one or more of the nodes through one or more obstructed areas of the region. |
20120208641 | 13370844 | 0 | 1. A method of distributing toy objects, the method comprising: providing a toy object and a task identifier, the task identifier identifying a task; receiving, at a computer system via a website, task-completion input from a user; associating the user with a profile, the profile being associated with the toy object; updating the profile to indicate that the task had been performed; identifying a reward criteria; determining whether the reward criteria was met by the user completing the task; and upon determining that the reward criteria was met, initializing distribution of a physical reward to the user. |
9892027 | 14327483 | 1 | 1. A method comprising: determining sequence-execution constraints that constrain execution orders of a plurality of events of an event-driven software application; determining sequence-position constraints that constrain positions of the plurality of events in one or more possible event sequences of the plurality of events; determining event-relation constraints that each indicates a relationship between an event input and an event output of each of the plurality of events, each of the event-relation constraints being defined with respect to a respective symbolic input variable “a1” of its respective event input that is in code of the event-driven software application, a respective symbolic output variable “a1′” of its respective event output that is in the code of the event-driven software application, and a respective software function “f1” of the code of the event-driven software application that is associated with the respective event and that includes the respective symbolic input variable and the respective symbolic output variable, the event-relation constraints being defined based on a respective expression “a1→f1→a1′” that indicates that a value of the respective symbolic output variable “a1′” is generated by performing function “f1” with respect to a value of the respective symbolic input variable “a1”; forming a constraint set that enumerates the one or more possible event sequences and that includes the sequence-execution constraints, the sequence-position constraints, and the event-relation constraints; encoding control flow information of the one or more possible event sequences into the constraint set; solving the constraint set to determine one or more event sequences that satisfy the constraint set; and performing test generation operations on the one or more event sequences that satisfy the constraint set. |
20090296985 | 12277278 | 0 | 1. A method to perform multi-human three dimensional (3D) tracking, comprising: a. for each single view, providing two dimensional (2D) human detection candidates to a 2D tracking module; b. independently performing 2D tracking in each 2D tracking module and reporting promising 2D tracking hypotheses to a 3D tracking module; and c. selecting trajectories from the 2D tracking modules to generate 3D tracking hypotheses. |
9465898 | 14608603 | 1 | 1. A method comprising: detecting, by a computing system, a presence of a combinational loop in a word-level netlist representation of a circuit design by identifying a portion of the word-level netlist having at least one characteristic associated with the combinational loop, translating the identified portion of the word-level netlist into a bit-level circuit representation, and utilizing the bit-level circuit representation to determine the identified portion of the word-level netlist includes the combinational loop; and modifying, by the computing system, the word-level netlist corresponding to the detected presence of the combinational loop. |
7912795 | 12756147 | 1 | 1. A method of predicting a future event associated with a business based on historical data associated with a model of past events of the business, comprising: performing, by a processor-based system for predicting the future event, a transformation of a plurality of modeling variables to obtain a linear relationship of each of the plurality of modeling variables in relation to the dependent variable, wherein the plurality of modeling variables are associated with the model, and wherein a dependent variable is associated with the model and is dependent on the plurality of modeling variables, and wherein the historical data is associated with the model; selecting, by the processor-based system, a subset of the plurality of transformed modeling variables, wherein the selecting comprises applying a selecting rule based on a log-likelihood difference that comprises determining a difference between a first model-fit statistic derived by utilizing an intercept model and a second model-fit statistic derived by utilizing an intercept-plus-covariate model; determining, by the processor-based system, a set of prediction variables; and generating, by the processor-based system, a predictive model using the set of prediction variables, wherein the predictive model predicts the future event. |
6122627 | 08853976 | 1 | 1. A software tool comprising program code on a computer usable medium, the software tool comprising: means for receiving view definitions; and means for generating object-oriented class definitions from the view definitions, wherein a view collection v is of the view type V and has an implementation M for V specified as a SELECT statement, and wherein the means for generating produces the class definitions according to the following rules: a) ordering elements in an object language class constructor as an ordering of elements in a FROM clause of M; b) passing, as an argument to an object constructor, a handle on a binding of an ith element, if the ith element in the FROM clause is a view type; and c) passing, as another argument to the object constructor, a row type if the jth element in the FROM clause of M is a relational table and ordering arguments of the row type as an order to columns present in the row type. |
8200466 | 12219398 | 1 | 1. A system for determining cardiovascular information for a patient, the system comprising: at least one computer system configured to: receive patient-specific data regarding a geometry of an anatomical structure of the patient; create, based on the patient-specific data, a three-dimensional model representing at least a portion of the aorta of the patient and at least a portion of a plurality of vessels emanating from the portion of the aorta, the three-dimensional model including portions representing at least one inlet and a plurality of outlets for blood flow; create a three-dimensional mesh based on the three-dimensional model; create at least one boundary condition model having less than three dimensions, the at least one boundary condition model representing blood flow through at least one of the at least one inlet or the plurality of outlets; determine a blood flow characteristic within the anatomical structure of the patient by solving equations governing blood flow using the three-dimensional mesh and the at least one boundary condition model; and automatically tune at least one parameter of the three-dimensional model or the at least one boundary condition model. |
9027134 | 14445203 | 1 | 1. A method comprising: scanning data that is maintained on multiple social networks, wherein scanning comprises identifying, by one or more processors, data that is associated with a social entity; determining one or more characteristics of the identified data; generating, for each of the one or more characteristics, a reference to the identified data that indicates the characteristic; algorithmically comparing one or more generated references to one or more known references, wherein the one or more known references are references to characteristics of identified data that have been assigned a level of risk, and wherein the one or more generated references that are compared to the one or more known references are dynamically selected from a group of generated references; determining, based on the algorithmic comparisons, a risk score for a social entity; and determining, based on a statistical algorithm, a confidence score for the risk score, wherein the confidence score indicates the reliability of the determined risk score. |
7664617 | 12250769 | 1 | 1. A device performance monitor to which a data storage device of a first model is coupled, the data storage device including a plurality of feedback and measurement mechanisms which normalize quantitative values of the data storage device to device-specific standards for the data storage device by scaling the quantitative values to a set of values which are common to the data storage device and adjusted to a form which is consistent across different data storage devices, the device performance monitor comprising: means for receiving a plurality of normalized values from the mechanisms during operation of the data storage device; means for generating one or more qualitative values from one or more received normalized quantitative values; and means for evaluating the one or more qualitative values against corresponding baseline performance values established for the first model. |
20090106080 | 11876331 | 0 | 1. A computer program product comprising a computer useable storage medium to store a computer readable program that, when executed on a computer, causes the computer to perform operations to evaluate feedback for a survey about a community development asset, the operations comprising: receive a plurality of survey responses from survey respondents about the community development asset; select a sample response of the plurality of survey responses, wherein the sample response corresponds to an identified respondent; identify a community with which the identified respondent is associated; and infer a similar response from the community associated with the identified respondent based on the sample response of the identified respondent. |
20120016716 | 12837758 | 0 | 1. A computer-implemented method for joint multi-channel configuration optimization for retail industry, comprising: integrating a plurality of data sources; generating from said integrated data sources, a customer preference model representing preference to different channels in merchandise category for each customer segment; generating a customer satisfaction model representing customer satisfaction metrics; and maximizing, using a processor, retailer's profit and customer satisfaction using an optimization model that utilizes said customer preference model and said customer satisfaction model. |
8175811 | 12099745 | 1 | 1. A scientist-centric interface system for conducting research using a mass spectrometry instrument with an informatics search tool that utilizes a search algorithm to identify biomolecules, the search algorithm having a set of predefined algorithm control parameters used to control how the search algorithm operates, comprising: a user interface that prompts a user to supply scientist-centric information expressed utilizing terminology of a scientific domain selected from the domains of biology, analytical chemistry or any combination thereof; a translation system receptive of said scientist-centric information and operative to generate control parameters selected from said set of predefined algorithm control parameters and said translation system having a search algorithm interface whereby said generated control parameters are supplied to said search algorithm to control how the algorithm operates, wherein the set of predefined algorithm control parameters includes a parameter indicative of a modification and wherein said translation system generates said modification parameter based on supplied scientist-centric information relating to cysteine alkylation reagent name. |
9946749 | 15260136 | 1 | 1. A computer-implemented method comprising: generating, for an original attribute of a relation maintained in a database system, a respective auxiliary attribute for each interval size of a plurality of interval sizes, each interval size corresponding to a different respective power of a particular exponent base; computing, for each data entry of the relation and for each interval size of the plurality of interval sizes, a respective interval number for the interval size to which an original attribute value of the data entry belongs; storing each respective computed interval number for each data entry in the database system as an auxiliary attribute value of a corresponding auxiliary attribute for the data entry; receiving, by a query rewriter of a user device in communication with the database system, an original query having an inequality expression for the original attribute; generating a new query that replaces the inequality expression with multiple equality expressions, wherein each equality expression references a different respective auxiliary attribute, each auxiliary attribute representing a different respective interval size for values of the original attribute; providing, by the user device to the database system, the new query having the multiple equality expressions instead of the original query; and receiving, by the user device from the database system, query results that satisfy the inequality expression for the original attribute. |
20020026627 | 09944228 | 0 | 1. A method for performing OPC on an IC mask layout comprising: determining OPC for the IC mask layout on an area-by-area basis, each area being an aerial subset of the IC mask layout; reusing the determined OPC for a first area on a second area if the second area is considered to be equivalent to the first area for OPC purposes. |
8402449 | 11972117 | 1 | 1. A method for automatically assigning placement for one or more pipeline registers within hardware description language (HDL) code generated from a program specification such that the HDL code for the program specification executes over a plurality of pipeline stages, the method comprising: building at least one intermediate representation (IR) of the program specification, the at least one IR having a plurality of interconnected nodes that define a plurality of paths through the at least one IR, each node having an execution latency; storing the IR in a memory; scheduling an execution order of the nodes of the at least one IR, wherein one or more nodes of the at least one IR are scheduled to execute in a given pipeline stage, the scheduling including repeatedly applying a scheduling algorithm bounded by an input time threshold producing a final scheduled execution order of the nodes of the at least one IR; specifying one or more pipeline registers for insertion along one or more paths of the at least one IR between pipeline stages; providing the final scheduled execution order and the specification of pipeline register insertions; and generating the HDL code based on the final scheduled execution order and the specification of pipeline register insertions, the generated HDL code indicating the inserted pipeline registers. |
10152973 | 14942551 | 1 | 1. A system comprising: a computer-readable memory storing executable instructions; and one or more processors in communication with the computer-readable memory, wherein the one or more processors are programmed by the executable instructions to at least: receive audio data from a client computing device separate from the system, wherein the audio data comprises data regarding an utterance of a user; produce first speech processing results using a base speech processing model and the audio data, wherein the base speech processing model is stored at the system; obtain a specialized speech processing model from a network-accessible data store separate from the system and separate from the client computing device, wherein the obtaining is initiated by the system subsequent to receipt of the audio data and prior to completion of producing the first speech processing results; determine, based at least partly on a time at which the specialized speech processing model is obtained, that the system is to produce second speech processing results using the specialized speech processing model subsequent to initiating production of the first speech processing results; and produce the second speech processing results using the specialized speech processing model and at least one of the audio data or the first speech processing results. |