doc_id
stringlengths 7
11
| appl_id
stringlengths 8
8
| flag_patent
int64 0
1
| claim_one
stringlengths 13
18.4k
|
|---|---|---|---|
4854163 | 07101461 | 1 | 1. A beltless system for conveying and analyzing sections of core comprising: a core trough comprising a receptacle portion for receiving a section of core and a drive engaging portion for engaging and being engaged by at least two spaced apart drivers and for being self-disengaging from a driver when the driver has driven the core trough a distance about equal to length of the drive engaging portion of the core trough; drive means comprising at least two spaced apart drivers each having means for engaging the drive engaging portion of the core trough and for imparting linear motion to the core trough and for driving the core trough along a path adjacent an analysis means for analysis of core supported therein and for being self-disengaging from the core trough after driving the core through a distance about equal to length of the driver engaging portion of the core trough; analysis means adjacent the path for analyzing a section of core supported in the core trough as the drive means drives the core trough along the path. |
7646715 | 10825756 | 1 | 1. A device for processing packets of flows on a network link, the device comprising: scheduling means for scheduling packets of flows in a queue in accordance with a fair queuing with priority algorithm, the scheduling means being configured to schedule as priority packets any packets of flows in the queue that are not identified in a list of active flows and as non-priority packets any packets of flows that are already identified in the list of active flows; means for writing flows in and erasing flows from the list of active flows as a function of the arrival and departure of packets of the flows, said means being configured to erase from the list of active flows a flow which has not had any packets in the queue for a certain time period, and thereby assigning priority to the packets of the flows for which a bit rate is below a dynamic threshold, the dynamic threshold being determined by traffic conditions; and admission control means for controlling admission of said packets into the device in accordance with admission criteria; wherein the scheduling means sends the admission control means admissibility condition data including a fair bit rate value that represents the bit rate achieved by a data flow that always has packets to send, and a priority load value which is a sum of the lengths of priority packets transmitted in a certain time period divided by the duration of that time period. |
20020181768 | 10196143 | 0 | 1. A method for designating a local representative color (LRC) values of a color image, comprising the steps of: (a) dividing a color image into equal blocks; (b) building color histogram for each blocks and designating the maximum color value of a color histogram as a LRC value of a corresponding block if the maximum color value meets a first condition; and (c) repeating steps (a) and (b) until the last block of the image is processed. |
10165720 | 14911379 | 1 | 1. A production optimization device of a component mounting line in which components are mounted on a circuit board using component mounting machines, comprising: a first optimization device to optimize production of the component mounting line under conditions in which a selection range of members to use in the production is restricted to within a range of members present to the component mounting line; a second optimization device to optimize the production of the component mounting line under conditions in which restriction of the selection range of the members to use in the production is removed for at least a subset of the members; and display device for displaying optimization results of the first optimization device and optimization results of the second optimization device. |
8326547 | 12894401 | 1 | 1. A method for optimizing a gene sequence for expression of a protein in a host cell, the method comprising: (a) identifying a plurality of sequence factors that affect the expression of the protein in the host cell; (b) defining a computer-assisted particle swarm optimization algorithm comprising a function for each of the plurality of sequence factors; and (c) analyzing the gene sequence to obtain an optimized gene sequence for expression of the protein in the host cell via the computer-assisted particle swarm optimization algorithm that takes into account the plurality of sequence factors and achieves the maximum value of the swarm optimization algorithm to thereby obtain the optimized gene sequence, wherein the plurality of sequence factors comprises at least one factor that is not codon usage of the host cell. |
8255423 | 12430818 | 1 | 1. A system for building segmented scorecards for a population, the system comprising: a model builder computer for building a model of the population; repository that stores one or more variables used by the model builder to build the model; and a scorecard computer in communication with the model builder computer, the scorecard computer configured to execute an adaptive random tree computer program to generate a scorecard for each segment of the population based on the model, and to enhance the scorecard for each segment using an integer non-linear programming computer program to determine reactions of each segment to the one or more variables used by the model builder to build the model, and to generate an enhanced segmented scorecard for the population; and an output device having a display for displaying data representing the enhanced segmented scorecard, each enhanced segmented scorecard for a respective segment of the population being associated with a corresponding optimized score weight of a plurality of optimized score weights, the plurality of optimized score weights characterizing an optimization of score weights associated with the respective generated scorecard. |
20020165861 | 10114179 | 0 | 1. A method of assigning a confidence level to a term within an electronic document, the method including the steps of: determining a first quantitative indicator based on a number of occurrences of the term within the electronic document; determining a characteristic indicator based on a characteristic of the term; and assigning a second indicator to the term, the second indicator being derived from the first quantitative indicator and the characteristic indicator. |
20160019219 | 14866380 | 0 | 1. A computerized method for optimizing search result rankings obtained from a search result ranker, the method comprising: retrieving a first set of query-document pairs, each query-document pair of the first set having an associated post-impression features vector; generating a weight vector having a number of weights corresponding to a number of post-impression features in each of the post-impression features vector of the first set; generating a target function by using the weight vector and the post-impression features vectors of the first set; using a performance metric associated with the target function, optimizing the weights of the weight vector using the first set of query-document pairs to obtain an optimized target function; optimizing the search result ranker using the optimized target function; and using the optimized search result ranker to rank search results. |
9774887 | 15269734 | 1 | 1. A method for generating optimal segment parameters for a three-dimensional video comprising: receiving head-tracking data that describe one or more positions of one or more people while the one or more people are viewing the three-dimensional video; generating video segments from the three-dimensional video; for each of the video segments: determining a directional encoding format that projects latitudes and longitudes of locations of a surface of a sphere onto locations on a plane; determining a cost function that identifies a region of interest on the plane based on the head-tracking data; and generating optimal segment parameters that minimize a sum-over position for the region of interest; re-encoding the three-dimensional video to include the optimal segment parameters for each of the video segments; and providing a re-encoded video and the optimal segment parameters for each of the video segments to a viewing device, wherein the viewing device uses the optimal segment parameters for each of the video segments to un-distort the re-encoded video and texture the re-encoded video to the sphere to display the re-encoded video with the region of interest for each of the video segments displayed at a higher resolution than other regions in each of the video segments. |
8793204 | 13498396 | 1 | 1. A classification device comprising: a data storage unit configured to store a plurality of pieces of time-of-day information each indicating a different time of day, and a plurality of pieces of location information respectively associated with one of the plurality of pieces of time-of-day information and indicating a location where a subject was at an associated time of day; a sorting unit configured to sort the plurality of pieces of location information in order of time by using the plurality of pieces of time-of-day information; a hidden Markov model storage unit storing therein a left-to-right hidden Markov model that contains a plurality of states and in which a parameter is undetermined; a Markov model output unit configured to determine the parameter by inputting the plurality of pieces of location information sorted in order of time by said sorting unit into the hidden Markov model, and output a defined hidden Markov model containing the determined parameter; and a classification unit configured to classify each of the plurality of pieces of location information into one of the plurality of states in order of time, by inputting the plurality of pieces of location information sorted in order of time by said sorting unit into the defined hidden Markov model. |
9804947 | 14947503 | 1 | 1. A method of generating time based data, the method comprising: defining a time based data generation scenario, the time based data generation scenario comprising: at least one event, the event representing an action at a specific time; a plurality of time segments, each time segment defining a particular temporal phase of the scenario and at least one time segment being embedded with the at least one event; and a time envelope to embed time segments, wherein the time envelope is a top-most outer time envelope that encompasses all time based entities for the scenario; specifying in at least one time based attribute rule a data attribute that is not time based, each of the at least one time based attribute rule linking the time envelope to the embedded time segments and the at least one event; generating at least a portion of a time based data object by executing the time based data generation scenario, the time based data object including data representing at least one of the plurality of time segments, and the embedded at least one event, and the specified at least one time based attribute rule; passing a memory buffer to the outer time envelope using a time based attribute rule, the outer time envelope providing the time based entities with access to the memory buffer; providing the generated time based data object to the memory buffer; interrupting the generating of the time based data object after determining the memory buffer is full; continuing the generating of the time based data object from where it was interrupted; and at least one of verifying and demonstrating functionality of a software application by providing the generated time based data object representing a data generation scenario for consumption by the software application. |
7571183 | 11045926 | 1 | 1. A system for generating clusters of similar media objects, comprising using a computing device for: identifying a set of locally available media objects; querying a remote server computer to retrieve a set of coordinate vectors corresponding to each of the locally available media objects; determining distances between the retrieved coordinate vectors; forming at least one cluster of at least one coordinate vector relative to a first adjustable minimum distance threshold such that any group of one or more of the coordinate vectors whose mutual distances are less than the first adjustable minimum distance threshold are assigned to a common cluster, wherein forming at least one cluster of at least one coordinate vector comprises recursively identifying clusters of similar media objects; initially placing each coordinate vector into a unique cluster; identifying a coordinate vector having a largest number of neighboring coordinate vectors within the first adjustable minimum distance threshold, and forming a new cluster from the identified coordinate vector and the identified neighboring coordinate vectors; removing any coordinate vectors already added to a new cluster from further cluster considerations; and repeating the formation of new clusters and removing of coordinate vectors from further cluster consideration until all coordinate vectors have been assigned to a new cluster of at least one coordinate vector; selecting at least one media object; and generating a media object playlist to automatically populate the playlist with media objects corresponding to coordinate vectors in any cluster including the coordinate vectors of the selected media objects. |
20050222975 | 10813312 | 0 | 1. A full-text search system comprising: a plug-in component that defines a relevant score algorithm; and a search component adapted to receive and utilize the plug-in component to query data and generate results. |
10142652 | 15147053 | 1 | 1. A method for decoding a video bitstream, comprising: determining, for a current block of the video bitstream, a reference motion vector from a number of candidate reference motion vectors, wherein the reference motion vector is associated with a reference block and includes a predicted portion and a residual portion; selecting a probability context model for the current block by evaluating the residual portion of the reference motion vector with one or more thresholds, wherein the selecting comprises: comparing a magnitude of the residual portion of the reference motion vector with the one or more thresholds to determine an indication of likelihood of motion intensity for the current block; and selecting the probability context model from a plurality of probability context models based on the indication of likelihood of motion intensity for the current block; and entropy decoding, for the current block using a processor, a motion vector residual associated with the current block using the probability context model, wherein the motion vector residual is determined as a difference between a motion vector determined for the current block and the reference motion vector. |
9336192 | 14090271 | 1 | 1. A method for analyzing text, comprising: providing a processor on a first computer, wherein the processor runs a content acquisition system to obtain a text document over a computer network, wherein the text document comprises a hashtag immediately preceded by one or more words and immediately followed by one or more words; storing the text document obtained from the content acquisition system on a storage device; providing a processor on the first computer which runs a text analytics engine, wherein the text analytics engine comprises a hashtag detector, a sentiment recognizer, a named entity recognizer, and a sentiment assignor; using the text analytics engine to access the text document and perform an analysis to generate metadata, comprising: having the hashtag detector recognize a hashtag and the one or more words immediately following the hashtag; having the named entity recognizer identify the one or more words immediately following the hashtag; having the sentiment recognizer select words from the one or more words immediately preceding the hashtag which have sentiment; assigning the one or more words having sentiment to the one or more words immediately following the hashtag; providing a processor on the first computer which runs a weighting multiplier; and measuring a repetition of letters in the one or more words having sentiment, comprising: preprocessing a dictionary of terms into a tree such that each letter in a word corresponds to a node in the tree, with subsequent letters corresponding to branchings in the tree, and wherein leaves of the tree point to the term preprocessed; where lookup is accomplished by processing of each letter in a word discovered in a novel text being processed where processing is accomplished by following the branches in the tree corresponding to subsequent letters, except that repeated letters do not follow branches but instead increment a counter recording the number of letters repeated, where the successful arrival at a leaf returns both the term discovered and the letter repetition counter; and the letter repetition counter is used to calculate a weight multiplier greater or equal to 1 for the term; storing the metadata in a database; providing a processor from a second computer that runs an application which accesses the database. |
8923577 | 11558715 | 1 | 1. A method for assigning labels to regions in an image, the method comprising: deriving, by a processor, a plurality of probabilistic models for a plurality of geometrical structures; computing, by a processor, a regional response around a region in the image; computing, by a processor, a region score for each geometrical structure using the plurality of probabilistic models; and labeling, by the processor, the region in the image based on the region score. |
9672464 | 14267394 | 1 | 1. A method for operating an artificial nervous system, comprising: allocating a first memory layout for parameters and state variables of instances of a first neuron model; allocating a second memory layout different from the first memory layout for parameters and state variables of instances of a second neuron model having a different complexity than the first neuron model; and updating the state variables for at least one instance of at least one of the first neuron model or the second neuron model when operating the artificial nervous system, wherein the first memory layout includes different memories for storing each of the parameters and the state variables of the instances of the first neuron model, and the second memory layout includes a common memory for storing both the parameters and the state variables of the instances of the second neuron model. |
8547092 | 12666153 | 1 | 1. A proton precession magnetometer sensor, comprising a coil including two solenoid coils connected perpendicularly or N solenoid coils connected in the form of a polygon, where N is an integer of 3 or more to, to measure the magnetic field in all directions, in which frequency of current induced in the coil by flowing and then breaking current in the coil is measured to calculate strength of an external magnetic field by a calculation unit, the coil put in a nonmagnetic container filed with a hydrocarbon solvent and connected to a measuring device, the measuring device including a counter to measure frequency of current induced in the coil; a current source to supply current to the coil; and a relay to open and close for current supplied to the coil. |
8010320 | 11601213 | 1 | 1. A method for mitigating effects of gas turbine engine gas path measurement variability comprising: comparing gas path measurement data to a reference model and outputting differences between the gas path measurement data and said reference model as percent deltas; performing a gas path analysis using a predictor-corrector function on said outputted percent deltas and a priori estimated performance percent deltas, and outputting estimated performance percent deltas of the gas path measurement data; time delaying said estimated performance percent deltas using a delay register which stores a most recent set of said estimated performance percent deltas; forming said a priori estimated performance percent deltas by filtering said time delayed, estimated performance percent deltas using an exponential average filter; said time delaying and filtering steps reducing a variation in estimated performance percent deltas, said variation comprises noise; inputting the a priori estimated performance percent deltas to a fault estimator along with data input so as to form a new set of estimated performance percent deltas based on the a priori estimated performance percent deltas and the data input; and outputting said new set of estimated performance percent deltas. |
20050138050 | 10993567 | 0 | 1. A method of determining an expansion of storage resulting from a candidate clustering scheme for data, the method comprising: modeling an anticipated space waste to result from the candidate clustering scheme; and defining the expansion of data storage in proportion to the anticipated space waste. |
9959834 | 15151041 | 1 | 1. A computer-implemented method for adaptively changing one or more display parameters of virtual reality content, the method comprising: storing, by a computer system in one or more storage devices, virtual reality image data captured by one or more image capturing devices; retrieving, by the computer system from the one or more storage devices, one or more parameters of one or both of transmission speed of a wireless connection between a server with access to the one or more storage devices storing the virtual reality image data and a virtual reality device of a user requesting the virtual reality image data, and a display of the virtual reality device; generating, by the computer system, one or more two-dimensional renditions from the virtual reality image data in real-time and according to the one or more retrieved parameters, wherein the one or more two-dimensional renditions are generated at least in part by mapping the virtual reality image data to a two-dimensional bijective resolution-defined projection, wherein each of the one or more two-dimensional renditions represents a full sphere of the virtual reality image data; and transmitting, by the computer system to the virtual reality device being configured to inversely project the virtual reality image data to a sphere or other three-dimensional shape for display on the virtual reality device, at least a portion of one of the one or more two-dimensional renditions, wherein the computer system comprises a computer processor and an electronic storage medium. |
10002124 | 15211839 | 1 | 1. A method, in a data processing system comprising at least one processor and at least one memory, the at least one memory comprising instructions that are executed by the at least one processor to specifically configure the at least one processor to implement a question answering system configured with a natural language processing pipeline executing on the at least one processor of the data processing system for class narrowing for answer lookups, the method comprising: receiving, by a question and topic analysis stage of the natural language processing pipeline, an input question; annotating, by the question and topic analysis stage of the natural language processing pipeline, the input question with a verb in the input question and a syntactic relation between the verb and a focus of the question; finding, by a class narrowing component of the natural language processing pipeline, an entry in a verb/type lookup resource corresponding to the verb and the syntactic relation, wherein the entry comprises the verb, the syntactic relation, and a set of classes, wherein each given class in the set of classes has a corresponding frequency value representing a frequency the given class occurs with the syntactic relation to the verb; performing, by the class narrowing component, class-narrowed type-restricted answer lookup from a topology based on the entry in the verb/type lookup resource to generate a set of candidate answers; scoring, by a hypothesis and evidence scoring stage of the natural language processing pipeline, the set of candidate answers to generate for each candidate answer a confidence score; ranking, by an answer ranking stage of the natural language processing pipeline, the set of candidate answers by confidence score to form a ranked set of candidate answers; and outputting, by the natural language processing pipeline, the ranked set of candidate answers. |
8639398 | 13307358 | 1 | 1. An apparatus for automatically generating satellite operation procedure (SOP) parameters, the apparatus comprising: a parameter extraction unit configured to extract one or more SOP parameters corresponding to an SOP; a transformation formula extraction unit configured to extract a transformation formula corresponding to the extracted SOP parameters; and a calculation unit configured to calculate values of the extracted SOP parameters based on property information for performing a satellite task and the extracted transformation formula. |
8301545 | 13104769 | 1 | 1. A method comprising: (a) determining, by at least one computing device and for a financial market instrument, a number of messages of a plurality of messages occurring during a time span and containing a reference to the financial market instrument, the plurality of messages including messages from at least one social networking service; (b) determining, by the at least one computing device and for the financial market instrument, a time span average, the time span average being a ratio of the determined number of messages occurring during the time span and containing the financial market instrument reference over a number of time intervals into which the time span is divided; (c) determining, by the at least one computing device and for the financial market instrument, a message count for a selected time interval of the time intervals, the selected time interval's message count indicating a number of the messages from the plurality of messages occurring during the selected time interval and containing the reference to the financial market instrument; (d) determining, by the at least one computing device and for the financial market instrument, a percentage change using the selected time interval's message count and the time span average; (e) comparing, by the at least one computing device, a plurality of percentage changes corresponding to a plurality of financial market instruments including the financial market instrument, wherein the comparing comprises selecting a set of financial market instruments, each of the selected financial market instruments having a greater percentage change than unselected ones of the plurality of financial market instruments; and (f) making available, by the at least one computing device for presentation to one or more users, the financial market instrument reference of each of the selected financial market instruments. |
20050104864 | 10804311 | 0 | 1. A computer-implemented process for outputting whiteboard content, comprising the following process actions: inputting a sequence of image frames of content written on a whiteboard in real-time; dividing each of said image frames into cells; for each cell in each image frame, determining if there is a change in the cell image compared to a correspondingly located cell the immediately preceding image frame in said sequence of image frames; whenever it is determined that there is a color change, setting a cell age to a prescribed minimum value, and if there is no change increasing cell age by a prescribed increment value; determining if cell age is greater than a specified threshold value; whenever the cell age is not greater than the threshold value, not processing said cell any further; if said cell age is greater than the threshold value, computing the background color of the cell; updating a whiteboard color model; classifying each cell image as a foreground or whiteboard cell using said whiteboard color model; whenever a cell image is classified as a foreground cell not processing that cell any further; and whenever a cell image is classified as a whiteboard cell, outputting the cell image whenever it exhibits strokes not present in the correspondingly located cell in the preceding image frames or is missing strokes found in the preceding image frames in real-time. |
7543272 | 11165808 | 1 | 1. A method for finding terminal classes in a collection of programming language classes, wherein a terminal class is a class that is not extended by any other class, the method comprising: receiving a collection of classes; adding the classes to a map of the collection of classes, wherein keys to each class in the map include each class' superclass and the interfaces each class directly implements; finding all terminal classes in the collection of classes with only a single pass through the collection of classes by: analyzing a given class in the map to determine if the given class extends any other class in the collection of classes; if the given class extends any other class, removing this extended class from the collection of classes; repeating the steps of analyzing classes and removing extended classes until all remaining classes in the collection of classes are terminal classes; and automatically creating a hierarchical representation of the collection of classes. |
7631010 | 10826509 | 1 | 1. A database management system that manages a database including a database data page, the database data page providing sub-page storage space, the database management system further managing a plurality of concurrent database transactions, each of the concurrent database transactions requiring a modification of the database data page and storing a respective copy of the database data page in a separate reserved space, the database management system comprising: a processor; and one or more physical computer readable storage media operatively coupled to the processor, the computer-readable storage media having stored thereon computer executable instructions that, when executed by the processor, implement the database management system, including: a database engine that employs a page aggregator component to facilitate operations of the concurrent database transactions at a sub-page level during modification of the database data page, the database engine comprising: a lock manager that enables sub-page level locking across the concurrent database transactions and that stores lock information, sub-page level locking grants one of the concurrent database transactions an exclusive lock on a first sub-page of the database data page when the one of the concurrent database transactions requests to modify the first sub-page, the exclusive lock permits the one of the concurrent database transactions to modify a copy of the first sub-page in its respective copy of the database data page while restricting others of the concurrent database transactions from modifying corresponding copies of the first sub-page in their respective copies of the database data page, but allows the others of the concurrent database transactions to modify other sub-pages; a page aggregator component that operates across the concurrent database transactions to obtain information on an aggregate size change that occurs on the database data page that results when the concurrent database transactions modify their respective copies of the database data page using sub-page level operations, the page aggregator operates across the concurrent database transactions by using the lock information in the lock manager to track the sub-page level operations performed by the concurrent database transactions; and a heap allocation component that employs the information on the aggregate size change to determine a space consumed on the database data page and a space available on the database data page to ensure that the plurality of concurrent multiple database transactions do not consume all of the storage space on the database data page. |
20060205003 | 11429628 | 0 | 1. A method of defining a library of biological molecules, the method comprising: (a) receiving an original set of data points representing activity and sequence of multiple biological molecules in a training set; (b) constructing a bootstrap set of data points selected, with replacement, from the original set of data points; (c) generating a model from the bootstrap set, which model comprises indicators of the relative importance of individual residues or other units in biological molecules represented by the data points in the bootstrap set; (d) repeating (b) and (c) multiple times to generate multiple values of each indicator from the model generated in (c); (e) for each indicator, determining (i) an average or mean value of the multiple values and (ii) a statistical indication of the distribution of the multiple values; (f) ranking the individual residues or other units on basis of their respective values of (i) and (ii) determined in (e); and (g) toggling particular ones of the individual residues or other units based on rankings produced in (f) to thereby define the library of biological molecules. |
6125370 | 09053246 | 1 | 1. A method of repartitioning data in a database stored on a data storage device connected to a computer, the method comprising the steps of: detecting that a partitioning scheme for the data has been altered when a partitioning index is altered, which specifies one or more partitions and a limit key for each partition, wherein the limit key defines a range of values for a partition; identifying adjacent partitions that would be affected by the altered partitioning scheme; restricting access to each of the identified partitions without restricting access to other partitions; and reorganizing the identified partitions based on the altered partitioning scheme, by moving data between the identified partitions while allowing access to other partitions. |
20080002763 | 11856678 | 0 | 1. An apparatus for use in a wireless communication system wherein the apparatus estimates a transmitted signal, the apparatus comprising: at least one antenna for receiving a wireless signal that comprises a pilot channel and at least one other channel; a receiver in electronic communication with the at least one antenna for receiving a wireless signal; an equalizer for estimating the transmitted signal, wherein the equalizer includes a filter with a plurality of taps that may be adjusted through use of an adaptive algorithm that uses an estimated pilot estimated from the received wireless signal, wherein the pilot channel was transmitted with the at least one other channel; and a component to extract the estimated pilot and to provide the estimated pilot to the adaptive algorithm wherein the equalizer is further configured for adjusting the plurality of taps through use of the adaptive algorithm, the adaptive algorithm performing adaptation when channel conditions have changed such that the equalizer does not match current channel conditions. |
20120109865 | 13342224 | 0 | 1. A method comprising: electronically developing a neural network based supervised classifier; electronically determining a non-binary affinity measure between two data points using said supervised classifier; and electronically providing a visualization of the relationships between data points using said non-binary affinity measure. |
20050234955 | 10921477 | 0 | 1. A method for text classification, the method comprising: clustering text comprising labeled data and unlabeled data in view of the labeled data to generate cluster(s); generating expanded labeled data as a function of the cluster(s), the expanded label data comprising the labeled data and at least a portion of unlabeled data; and training discriminative classifier(s) based on the expanded labeled data and remaining ones of the unlabeled data. |
9495502 | 14288885 | 1 | 1. A computer program product for implementing management of layer promotion in a routing phase of integrated circuit design, the computer program product comprising: a computer readable storage medium having program instructions embodied therewith, the program instructions readable by a processor to cause the processor to perform a method comprising: identifying a set of candidate interconnects for the layer promotion; scoring and sorting the set of candidate interconnects according to a respective score, thereby establishing a respective rank; assessing routing demand and resource availability based on promoting the set of candidate interconnects; and managing, using a processor, the set of candidate interconnects based on the respective rank and the assessing, the assessing and the managing being done iteratively and the managing including, in at least one iteration, generating a second set of candidate interconnects based on reducing the set of candidate interconnects, wherein the scoring the set of candidate interconnects includes determining, for each candidate interconnect of the set of candidate interconnects, an amount of time by which the candidate interconnect exceeds a timing requirement and a degree to which a length of a path including the candidate interconnect exceeds a minimum possible length of the path, and the scoring the set of candidate interconnects includes calculating, for the respective candidate interconnect, a score given by:
score=scaling t *t _metric+scaling p *p _metric, where scaling t and scaling p are scaling factors, t_metric relates to the amount of time by which the candidate interconnect exceeds the timing requirement, and p_metric relates to the degree to which the length of the path including the candidate interconnect exceeds the minimum possible length of the path. |
20020174079 | 09387488 | 0 | 1. A method for enabling a determination of a preferred neural network architecture, the method comprising: enabling an encoding of each chromosome of a plurality of chromosomes, each chromosome being associated with each neural network of a plurality of neural networks, each chromosome including: a first parameter that defines an initial condition of the associated neural network, and a second parameter that defines an architectural feature of the associated neural network, enabling an evaluation of each neural network of the plurality of neural networks based on the initial condition and the architectural feature of each neural network, to provide a measure of effectiveness associated with each chromosome, and enabling a selection of the preferred neural network architecture based on the measure of effectiveness associated with each chromosome. |
20160350480 | 14721637 | 0 | 1. A method for management of a medical imaging workflow, the method implemented by a computing device through an execution of operations on at least one processor and memory of the computing device, with the operations comprising: electronically processing data associated with a medical imaging study, the data associated with the medical imaging study including imaging data from a medical imaging procedure; performing a preparation protocol upon the data associated with the medical imaging study, the preparation protocol establishing preparation data to affect an evaluation of the medical imaging study; performing an electronic assignment of the medical imaging study to a medical evaluator, the electronic assignment being performed based on the data associated with the medical imaging study and the preparation data; and making the medical imaging study available to the medical evaluator for evaluation, the medical imaging study being made available for evaluation in response to a completion of the performing of the preparation protocol; wherein the preparation data is used to affect a display of the imaging data to the medical evaluator within the evaluation of the medical imaging study. |
9058452 | 14193748 | 1 | 1. A system for tracing and fixing unknowns (Xs) in gate-level simulation, the system comprising: an X-tracing simulation processing component that receives a waveform from a first logic simulation, a design netlist and variables with Xs and time and performs an X-tracing analysis by tracing at least one X backward, and outputting zero or one or more X-pessimism fixes as an auxiliary code; a resimulation processing component that implements the zero or one or more X-pessimism fixes and performs a second logic simulation based upon the implemented X-pessimism fixes, wherein the logic simulation indicated at least one of: the X-tracing analysis is complete, and further X-tracing analysis is needed. |
20090099986 | 12062818 | 0 | 1. A method performed by a computing system for learning tradeoffs between discriminative power and invariance of classifiers, comprising: receiving two or more classifiers, each classifier for classifying data and having associated therewith a kernel with corresponding kernel weight, the kernel specifying an attribute for its associated classifier; and employing a learning technique to produce a combined classifier based on the two or more received classifiers by decreasing a function of the kernel weights to learn tradeoffs between discriminative power and invariance. |
20030072226 | 09454627 | 0 | 1. A storage apparatus comprising: a head which moves to an arbitrary track position on a medium; a position signal detecting unit for detecting and outputting a position signal according to a positional deviation amount at a position of said positioned head while using a predetermined position of a track on the medium as a reference; a feedback calculating unit for inputting said position signal and calculating a control signal to move said head so as to suppress said positional deviation amount to zero; a driving unit for driving said head so as to trace said track on the basis of the control signal of said feedback calculating unit; and a learning control unit for obtaining an unknown function for one medium rotation period to set a positional deviation amount for a repetitive disturbance to zero as an approximately presumed approximated function by a learning algorithm and storing said function. |
10127354 | 15628949 | 1 | 1. A method for performing trusted computations on genomic data performed by a distributed computing system comprising a processor and a non-transitory computer-readable storage medium storing instructions that, when executed by the processor, cause the system to perform the method, the method comprising: receiving first policy information from a stakeholder system articulating one or more first requirements associated with computational results generated using a genomic data set; receiving a first request from a user system to perform a computation by the distributed computer system, the first request comprising a first set of one or more pieces of identification information, the computation comprising analyzing a genomic data set to determine a particular genomic feature of the genomic data set; determining, based on the first set of one or more pieces of identification information, that a result of a prior computation using the first set of one or more pieces of identification information is not stored in a persistent storage associated with the distributed computing system; storing information associated with the first set of one or more pieces of identification information in the persistent storage; generating, based on the first set of one or more pieces of identification information, a result of the computation using the genomic data set; associating the result of the computation with the first policy information; storing the result of the computation and the associated first policy information in the persistent storage; sending the result of the computation to the user system: receiving a second request to perform the computation by a computational module of the distributed computing system using the genomic data set, the second request comprising the first set of one or more pieces of identification information; determining, based on the first set of one or more pieces of identification information, that the result of the computation is stored in the persistent storage; accessing the result of the computation from the persistent storage; determining, based on the first policy information associated with the result of the computation, that the first policy information does not permit sending the result of the computation to the system associated with the second request; and preventing the result of the computation from being sent to the system associated with the second request. |
8498945 | 10967084 | 1 | 1. A method for estimating a likely recoverable amount on a claim, the method comprising: determining an undisputed portion of a claim by entering a first set of information into a software application hosted on a computer; determining a disputed portion of the claim by entering a second set of information into the software application; estimating a likelihood of success in recovering the disputed portion of the claim by entering a third set of information into the software application; determining a collectibility score by entering a fourth set of information into the software application; estimating a likely counterclaim amount by entering a fifth set of information into the software application; determining a cost amount by entering a sixth set of information into the software application; and calculating a likely recoverable amount via the software application by using the undisputed portion, the disputed portion, the likelihood of success, the collectibility score, the counterclaim amount, and the cost amount. |
8938485 | 12030178 | 1 | 1. A computer implemented method for performing integer division operations on a central processing unit (CPU), the method comprising: receiving an integer dividend and an integer divisor; computing a floating-point reciprocal based on the divisor; computing a lowered floating-point reciprocal based on the floating-point reciprocal, wherein the lowered floating-point reciprocal is lower than the floating-point reciprocal by up to two least significant bits of the mantissa of the floating-point reciprocal; computing, via an execution unit within the CPU, a lower bound quotient based on a product of the lowered floating-point reciprocal and a floating point variable assigned a value of the integer dividend, wherein the product is designated as an unsigned integer; generating a reduced error quotient based on the lower bound quotient; and correcting the reduced error quotient to generate a final quotient, wherein the CPU does not include any circuitry specifically configured to perform integer division operations. |
8230439 | 12196498 | 1 | 1. A method for selection of networked processing resources for executing a processing task, the method comprising: determining, via a processing unit, resource metric values for performing a processing task for each of a plurality of networked processing resources as a function of a time of day that the processing task is to be performed, an amount of time needed to complete the processing task, an amount of computer cycles required to complete the processing task, respective numbers of other tasks scheduled to run on each of the processing resources concomitantly as the processing task at the time of day of the processing task, respective amounts of heat generated by the processing resources in executing the processing task, and respective numbers of network usage hops that data must traverse with respect to each of the processing resources in executing the processing task; comparing the metric values via the processing unit; and selecting via the processing unit a best at least one of the processing resources and a best time during the time of day that the processing task is to be performed for performing the task as a function of the comparing indicating that they require a least total amount of resources to cool while executing the amount of computer cycles required to complete the processing task over the number of network usage hops that the data must traverse during the amount of time needed in view of the number of other tasks scheduled to run concomitantly when performing the processing task; and causing via the processing unit the selected best at least one of the processing resources to perform the task at the selected best time. |
8588608 | 12444261 | 1 | 1. A method, implemented by a management platform, comprising: managing connections of a plurality of user modules to a plurality of transmission modules of a central office in an optical access network, a user module being able to receive from and send to at least one of said transmission modules, called a first transmission module, wherein the step of managing comprises, in the event of dysfunction of the first transmission module: selecting, among the user modules connected to the first transmission module, at least one of the user modules, called a priority user module or priority user modules, as a function of at least one predetermined criterion of priority associated with the user modules; and connecting said at least one priority user module to at least one second transmission module by rearranging the connection of said at least one priority user module, said rearranging comprising: tuning a sending wavelength and a reception wavelength of said at least one priority user module so that they are equal to a sending wavelength and a reception wavelength, respectively, of the at least one second transmission module selected as a function of at least one predetermined criterion of optimization. |
9307188 | 13993580 | 1 | 1. A method comprising: receiving a formatted video signal; decoding the formatted video signal into one or more watermarked images; populating a frame buffer with one of the one or more watermarked images; providing the one of the one or more watermarked images in the frame buffer, in parallel, to (i) a viewing apparatus and (ii) a watermark decoding module for decoding the one of the one or more watermarked images to retrieve a unique watermarked frame sequence number; performing video quality assessment based, at least in part, upon the unique watermarked frame sequence number; and based on an output of the video quality assessment, adaptively adjusting a size of the frame buffer. |
20100315950 | 12816333 | 0 | 1. A method of managing data traffic flow in a wireless network, the method comprising: inspecting data traffic content at a node configured to determine radio bearer resource information associated with a wireless access portion of the wireless network; inspecting data traffic content at a node configured to determine radio access bearer information associated with a backhaul portion of the wireless network; and controlling data traffic flow in the wireless network as a function of the radio bearer resource information and the radio access bearer information. |
10152059 | 15289882 | 1 | 1. A drone, comprising: a depth sensor configured to provide information for determining a distance between the drone and a moving base; and a processor configured to control a computer vision tracking algorithm by increasing tracking when the distance is within a distance threshold and to control drone movement based on the computer vision tracking algorithm. |
9158850 | 13950132 | 1 | 1. A computer-implemented method for generating personalized trending topics, comprising: using a processor device, performing steps of: for a given user, producing a social timeline by logging content posted on the given user's accounts on social media sites; analyzing the social timeline for recently posted content to derive an interim summary of first trending topics for the given user; receiving an in-stream feed of second trending topics based on the user's recent on-line activity including page views, queries, and clicks; augmenting the social timeline with the second trending topics from the in-stream feed to produce an interim list of third trending topics; ranking the third trending topics by source category using a frequency index; selecting a subset of highest ranked third trending topics from each source category; and presenting a personalized trends module comprising positions allocated to the subset of the highest ranked third trending topics. |
20030032010 | 09495668 | 0 | 1. A method of populating a data structure with a plurality of character strings, said method comprising: i) encoding two or more a biological molecules into character strings to provide a collection of two or more different initial character strings wherein each of said biological molecules comprises at least about 10 subunits; ii) selecting at least two substrings from said character strings; iii) concatenating said substrings to form one or more product strings about the same length as one or more of the initial character strings; iv) adding the product strings to a collection of strings; and v) optionally repeating steps (i) or (ii) through (iv) using one or more of said product strings as an initial string in the collection of initial character strings. |
20150205758 | 14595895 | 0 | 1. An arithmetic device comprising: a plurality of parallel processors; and a processor configured to control the plurality of parallel processors so as to calculate an approximate solution of an equation by using a first algorithm and a second algorithm switchably, each of the first algorithm and the second algorithm being algorithms providing an iterative method, the second algorithm causing a divergence more likely than the first algorithm, the second algorithm being performed more efficiently by the plurality of parallel processors than the first algorithm, the first algorithm and the second algorithm being switched each other between at least one pair of iterative steps of the iterative method. |
7774173 | 10953115 | 1 | 1. A computer-readable storage medium storing a model parameter determination program used to direct a computer to perform a process, the process comprising: receiving, through an input device, input of variable data based on a result of a simulation or an experiment performed based on a model of a system to be analyzed; generating, by a formulation unit, a first constraint expression relating to a parameter of the model based on the received variable data and the model of the system, an error variable corresponding to the received variable data and a variable indicating a range of the error variable, and storing the expression in a storage; obtaining, by a quantifier elimination unit, a possible range of the variable indicating the range of the error variable as an emax by applying a quantifier elimination algorithm to the first constraint expression; generating, by the formulation unit, a second constraint expression by substituting emax for the variable indicating a range of the error variable in the first constraint expression; obtaining, by the quantifier elimination unit, presence/absence of a solution and/or a possible range of a feasible parameter by applying a quantifier elimination algorithm to the second constraint expression; and displaying the presence/absence of a solution and/or the possible range of a feasible parameter on a display. |
20040158497 | 10361165 | 0 | 1. A method for recommending items to consumers in a recommender system, comprising: receiving a stream of rating on items from consumers; updating sequentially a singular value decomposition, one rating at the time, while receiving the ratings; and predicting recommendations of particular items for a particular consumer based on the updated singular value decomposition while receiving the ratings and updating the singular value decomposition. |
10088317 | 13156341 | 1 | 1. A location system, comprising: a processor configured to implement location modules for an agent, wherein the modules comprise: a belief determination module configured to determine a predicted location from a probabilistic belief associated with an extent to which the agent is associated with a location represented on a directed graph, based, at least in part, on a comparison of an input image with a plurality of images associated with the directed graph; and a comparison module configured to analyze a currently collected input image having a highest probability of matching a current location to generate a list of indices representing features in the currently collected input image, and compare each of the indices representing features in the currently collected input image with a dictionary of indices representing locations in a three dimensional (3D) point cloud to obtain a metric-accurate location for the agent. |
20170024466 | 14809001 | 0 | 1. A method for performing natural language processing, comprising: receiving a primary text file; scanning the received primary text file to determine a set of statistics related to a frequency at which various words of the primary text file follow other words of the primary text file; creating a probabilistic word generator, based on the determined set of statistics, that generates synthetic text exhibiting the determined set of statistics; generating synthetic text exhibiting the determined set of statistics using the created probabilistic word generator; performing word vectorization on the synthetic text; and using results of the performed vectorization to perform machine learning tasks. |
8332439 | 12242965 | 1 | 1. A method comprising: accessing a corpus stored in one or more tangible media, the corpus comprising a plurality of terms; performing the following for each term of one or more terms of the plurality of terms to yield a plurality of parent-child relationships: identifying one or more parent terms of the each term according to directional affinity, the plurality of terms comprising the one or more parent terms, the directional affinity being the number of co-occurrence contexts that include two terms, over the number of co-occurrence contexts that include one term; and establishing one or more parent-child relationships from the one or more parent terms and the each term; and automatically generating a hierarchical graph from the plurality of parent-child relationships, wherein the automatically generating the hierarchical graph from the plurality of parent-child relationships comprises reducing the hierarchical graph by: identifying a parent-child relationship and a redundant parent-child relationship of the hierarchical graph; and removing the redundant parent-child relationship from the hierarchical graph. |
8922559 | 12748014 | 1 | 1. A computer-implemented method comprising: obtaining, by a computing device, a participation graph that represents relationships between entities; constructing an auxiliary graph based on the participation graph by at least: forming an undirected bipartite graph corresponding to the participation graph, the undirected bipartite graph connecting entities to relationships of the entities using undirected edges between vertices that represent the entities and vertices that represent the relationships; replacing the undirected edges in the undirected bipartite graph with directed edges to form a directed graph that is configured to facilitate minimization of an objective function defined for the auxiliary graph that measures a total weight of edges removed from the undirected bipartite graph to form the directed graph; assigning directional weights to the directed edges; and connecting vertices representing the entities in the directed graph to an arbitrary sink vertex to form the auxiliary graph; determining clusters by solving the objective function defined for the auxiliary graph; and utilizing the clusters determined for the auxiliary graph to ascertain clusters that solve a related objective function defined for the participation graph. |
20050106431 | 10967696 | 0 | 1. A fuel processing system, comprising: a feed assembly adapted to deliver at least a carbon-containing feedstock to a fuel processor; a fuel processing assembly adapted to receive a feed stream containing at least the carbon-containing feedstock and to produce a product hydrogen stream therefrom; and a fuel cell stack that is adapted to receive an oxygen-containing stream and at least a portion of the product hydrogen stream and to produce an electric current therefrom; and a control system that is adapted to regulate and control the operation of the fuel processing system responsive at least in part to inputs from a sensor assembly that includes at least one sensor adapted to measure an operating parameter of the fuel processing system, wherein the control system is adapted to automatically transition the fuel processing system between selected ones of a plurality of operating states responsive at least in part to inputs from the sensor assembly, and further wherein the plurality of operating states includes a running state in which the product hydrogen stream is produced by the fuel processing assembly and at least a portion of the product hydrogen stream is delivered to the fuel cell stack, and an idle state in which the fuel processing assembly is maintained at an operating temperature and an operating pressure for producing the feed stream, but no more of the product hydrogen stream is delivered to the fuel cell stack than is required to operate the fuel processing system in the idle state. |
20090132468 | 11941696 | 0 | 1. A system for ranking data, comprising: a first calculation component that calculates a qualitative semantic similarity score of at least one data entry from at least one data source; a second calculation component that calculates a general quantitative score of the at least one data entry from at least one data source; a third calculation component that combines the qualitative semantic similarity score and the general quantitative score of the at least one data entry from at least one data source into a vector score for the at least one data entry such that the general qualitative score is never overruled by the semantic score; and a ranking component that ranks the at least one data entry among other data entries using the vector score. |
20020111780 | 09956593 | 0 | 1. A method for selecting a probability model comprising the steps of: a) computing an initial solution for a primal formulation of an optimization problem; b) identifying null vectors in a matrix of the primal formulation; c) obtaining multiple alternative solutions by constructing a linear combination of the initial solution with the null vectors; and d) determining a local optimal model. |
20160153056 | 14650762 | 0 | 1. A SNP molecular marker combination for rice genotyping, wherein it consists of 58,290 SNP sites and the nucleotide sequences thereof are respectively represented by SEQ ID NOs.1-58,290. |
20130018642 | 13581450 | 0 | 1. A method of creating a hierarchy of models of a hydrocarbon management system, comprising: identifying modeling dimensions in which known parameters and uncertainties relevant to the hydrocarbon management system are represented; generating a ground-truth model by estimating a ground-truth level of detail for each modeling dimension; generating a sufficiently-fine model by estimating a sufficiently-fine level of detail for each modeling dimension; estimating a parameter space that expresses outcomes of model instances in the sufficiently-fine model; using a computer, running ground-truth model instances to generate results of the ground-truth model, the ground-truth model instances being selected to represent desired regions of the parameter space; generating a first intermediate model by identifying a first intermediate level of detail for each modeling dimension generally between the ground-truth level of detail and the sufficiently fine level of detail; using a computer, running first intermediate model instances to generate results of the first intermediate model, the first intermediate model instances being selected to represent desired regions of the parameter space; determining whether the first intermediate model is sufficiently calibrated to the ground-truth model by comparing the results of the first intermediate model with the results of the ground-truth model; when the first intermediate model is not sufficiently calibrated to the ground-truth model, generating a second intermediate model by identifying a second intermediate level of detail generally between the ground-truth level of detail for each modeling dimension and the first intermediate level of detail for each modeling dimension, running second intermediate model instances to generate results of the second intermediate model, determining whether the second intermediate model is sufficiently calibrated to the ground-truth model by comparing the results of the second intermediate model with the results of the ground-truth model; when one of the first and second intermediate models is sufficiently calibrated to the ground-truth model, connecting one of the first and second intermediate models to the sufficiently-fine model; and outputting one or more model instances of the sufficiently-fine model, the first intermediate model instances, and the second intermediate model instances. |
20080200749 | 11917732 | 0 | 1. A magnetic stimulation circuit for central nervous system, comprising: a control circuit, a drive power supply circuit and coils that are sequentially connected, characterized in that the drive power supply circuit comprises a drive circuit, a detection circuit and a main circuit, both the drive circuit and the detection circuit are connected to the control circuit and the main circuit respectively, and the coils are connected to the main circuit. |
20150040107 | 13954866 | 0 | 1. A method for using a constraints solver to solve an optimization problem, the method comprising: receiving a set of constraints that is defined over a set of variables, wherein the set of constraints corresponds to an optimization problem, and wherein the set of constraints includes one or more constraints that impose an upper bound on one or more variables that are used in an objective function of the optimization problem; and iteratively performing the following set of operations on a computer: solving the set of constraints using a constraints solver; responsive to the constraints solver returning a solution, decreasing the upper bound; and responsive to the constraints solver indicating that no solutions exist or that the constraints solver timed out, increasing the upper bound. |
20070030529 | 11536985 | 0 | 1. A computer implemented method for analyzing a portion of the content of a digital image, comprising: identifying a digital image stored in a data storage area comprising a plurality of digital images; identifying a set of image processing instructions, wherein the image processing instructions carry out an analysis of the content of the digital image; retrieving a first sub-region of the digital image from the data storage area; executing the set of image processing instructions on the first sub-region; retrieving a second sub-region of the digital image from the data storage area; executing the set of image processing instructions on the second sub-region; analyzing the results of the image processing on the first sub-region and the second sub-region to provide an analysis of a portion of the digital image. |
20040139118 | 10689901 | 0 | 1. A method of lexicographically sorting data, comprising: receiving a set of N cyclic shifts of N characters identifiable by an array of indexes {0, 1, 2,..., N−1}; sorting the set of cyclic shifts based on a comparison of a first character of each cyclic shift; for an nth sorting iteration of the set of cyclic shifts, where n=1, 2, 3,..., up to 2 n >N: sorting at least a subset of the cyclic shifts which are identifiable by a subset array of indexes in the array in accordance with a previous sort of cyclic shifts associated with the subset array of indexes plus 2 (n−1) *modulo(N); and repeating the sorting for a next nth sorting iteration as necessary until the set of cyclic shifts are lexicographically sorted. |
9836449 | 14855517 | 1 | 1. A system which processes a geology report about a subsurface of a well and visualizes information describing a plurality of rock samples collected along a drilled borehole of the well, comprising: a processor; a database that stores phrase database for rock properties including a phrase dictionary, a plurality of labeled phrases, and a wellbore database including wellbore information of a plurality of wellbores; and a memory that stores instructions that cause the processor to execute: a report receiver unit that receives a geology report from a user selection interface including text information of a plurality of phrases for rock properties describing the rock samples, which are collected at depth intervals of the drilled borehole; a phrase extraction unit that, for each type of the rock properties, extracts a plurality of phrases about the rock properties and a corresponding plurality of depth intervals of the drilled borehole from the geology report based on the phrase dictionary in the phrase database; a phrase classification unit that, for each type of the rock properties, classifies the extracted phrases into a plurality of probabilities of the labeled phrases over the plurality of depth intervals; a numerical generation unit that, for each type of the rock properties, transforms the probabilities of the labeled phrases for the extracted phrases over the plurality of depth intervals into a numerical vector or a numerical scalar; and an output unit that receives a selection of one of the rock properties, and displays a bird's eye viewpoint of the numerical vector or numerical scalar of the selected rock property of the drilled borehole in relation with different numerical vectors or numerical scalars of other individual wellbores stored in the wellbore database, wherein the phrase classification unit is trained to classify the extracted phrases in to the plurality of probabilities of labeled phrases using the labeled phrases stored in the database, and wherein the numerical generation unit uses a trained hidden Markov model to transform the probabilities of the labeled phrases into the numerical vector or numerical scalar. |
20110288719 | 13102770 | 0 | 1. A method for detection of a component malfunction along a life of an internal combustion engine, said internal combustion engine comprising a cylinder and controlled by an Electronic Control Unit (ECU), the method comprising: defining a pre-determined component malfunction classifier at the start of engine life; setting said pre-determined component malfunction classifier as an active classifier, defining a validity condition for said active classifier, acquiring in real time a set of relevant signals relating to the operation of a component, feeding said signals to said active classifier in order to determine the occurrence or not of a malfunction of said component and in case the validity condition of an actual classifier is not satisfied; defining a new classifier using the most recent relevant signals recorded by said ECU; and substituting the actual classifier with said new classifier. |
7646894 | 11276112 | 1 | 1. A method implemented at least in part by a computer, the method comprising: calculating a competitive measure for verification of an unspecific person, the competitive measure being from a discriminative classifier based on a Bayesian competitive model, the discriminative classifier being adaptable to unknown new classes; and integrating the Bayesian competitive model with a generative verification in view of confidence measures, of the Bayesian competitive model and the generative verification, compared with a set of confidence criteria to make a decision regarding verification of the unspecific person, wherein: the confidence measures of the Bayesian competitive model and the generative verification are computed in view of an accuracy rate on a validation set to determine reliability of the Bayesian competitive model and the generative verification. |
20120323815 | 13596490 | 0 | 1. A method for providing a service-oriented architecture governance model, comprising: producing computer executable program code; storing the code on a computer readable medium; and providing the program code to be deployed and executed on a computer system, the program code comprising instructions which, when executed on the computer system, cause the computer system to: calibrate and map each of a plurality of governance framework dimensions of a service-oriented architecture to each of a plurality of governance evolution elements; perform a maturity and capability assessment for a selected attribute of a plurality of attributes of one of the service-oriented architecture governance evolution elements as a function of the mapping in response to a capability assessment template input that selects the attribute and one of the mapped governance framework dimensions, wherein the template input comprises: a user selection of the one governance framework dimension from a plurality of presented choices of each of the mapped governance framework dimensions, wherein the user selection categorizes the maturity and capability assessment with respect to the selected one governance framework dimension and the selected governance evolution element attribute; a user selection of a lifecycle stage from a plurality of different presented lifecycle stage choices that are each selectable for assessing capability of the selected governance evolution element attribute; a user assignment of the selected governance evolution element attribute to one or more of a plurality of different presented governance focus components that are each determinative of a different governance enablement approach; and user determination values populated within one each of a current state field and a desired state field of a plurality of different presented governance evolution state choices; and generate a maturity-based and capability-based governance model for the service-oriented architecture as a function of the performed maturity and capability assessment. |
20060253318 | 11120817 | 0 | 1. A computer system comprising a processor and a computer readable memory unit coupled to the processor, said memory unit containing a first list identifying marketing events, a second list of candidates, and a software application that when executed by the processor implements a method for sequencing said marketing events from said first list, said software application comprising an optimization tool and a timing tool, wherein each of said marketing events from said first list comprises a marketing offer and an identified channel means for communicating said marketing offer, said method comprising the computer implemented steps of: optimizing by said optimization tool, said marketing events from said first list for said candidates from said second list; and determining by said timing tool, an optimal sequence for offering each of said optimized marketing events to said candidates. |
9177230 | 14198152 | 1 | 1. A method comprising: obtaining an input vector of facial landmarks, wherein the facial landmarks of the input vector are derived from a given facial image, and wherein the facial landmarks of the input vector are identified based on their ability to represent anthropometric characteristics of the given facial image; performing, by a computing device, a weighted comparison between the input vector and each of a plurality of training vectors, wherein each training vector is mapped to at least one of a plurality of categories, wherein each training vector represents facial landmarks derived from a different respective facial image, wherein each training vector is associated with an age of an individual from whom the different respective facial image was derived, and wherein each category in the plurality of categories comprises a different age range, wherein at least some of the facial landmarks of the input vector represent aging characteristics of the given facial image, wherein the plurality of categories comprises an adult age range, and wherein at least some of the subset of the training vectors that map to the adult age range represent facial features indicative of wrinkling, hyper-pigmentation, or thinning of fat padding; based on a result of the weighted comparison, classifying the given facial image into a category of the plurality of categories; performing a second comparison of the input vector to a subset of the training vectors, wherein at least some of the subset of the training vectors map to the category of the plurality of categories in which the given facial image was classified; and based on a result of the second comparison, estimating an age of an individual from whom the given facial image was derived. |
20120154219 | 13264719 | 0 | 1. A method for locating and/or tracking at least one target with a network of transmitter/receivers, called sensors, of which at least part have a known geographic location, each comprising data processing means implementing at least one algorithm for locating and/or tracking target(s), means for transmitting/receiving a signal that decreases with distance and communication means, the network of sensors covering at least one geographic area, called the region, the method comprises, for each instant (t), an iteration of the following steps: selection of a sensor, called the leader, for each target, using at least one leader selection algorithm, for the implementation of the subsequent steps, exchange of data, called similarity data, between the leader sensor and at least part of the sensors in the network, these data being representative of power measurements of the signal between the sensors and the target and between the sensors themselves, determination of a probability distribution of the position of the target in the region by the leader sensor, using at least one matrix regression algorithm on the basis of the similarity data. |
4843554 | 07082766 | 1 | 1. In an airplane takeoff and landing performance monitoring system including a display for graphically and continuously depicting the position of an airplane on a runway from and during takeoff relative to where particular events are predicted to occur, the improvement comprising: transducer means for continuously sensing ambient conditions and airplane loading and acceleration information and generating information signals representative thereof; computer means responsive to said information signals for generating an acceleration history curve and predicting future airplane performance from and during takeoff and landing based on said acceleration history curve and said information signals; and display means responsive to said computer means for continuously depicting said airplane's position on the runway from and during takeoff and for depicting the predicted location on the runway where said airplane will achieve any particular speed. |
10047358 | 15923543 | 1 | 1. A promoter swap method of genomic engineering to evolve a host cell to acquire a desired phenotype, comprising the steps of: a. providing a plurality of target genes endogenous to a base host cell, and a promoter ladder, wherein said promoter ladder comprises a plurality of promoters exhibiting different expression profiles in the base host cell; b. engineering the genome of the base host cell, to create an initial promoter swap host cell library comprising a plurality of individual host cells with a genetic variation found within each host cell of said plurality of host cells, wherein each genetic variation comprises one or more of the promoters from the promoter ladder operably linked to a target gene endogenous to the host cell; c. screening and selecting individual host cells of the initial promoter swap host cell library for the desired phenotype; d. providing a subsequent plurality of host cells that each comprise a combination of genetic variation, said genetic variation selected from the genetic variation present in at least two individual host cells screened in a preceding step, to thereby create a subsequent host cell library; e. screening and selecting individual host cells of the subsequent host cell library for the desired phenotype; and f. repeating steps d)-e) one or more times, until a resultant host cell has acquired the desired phenotype. |
9984324 | 15353675 | 1 | 1. A method comprising: maintaining, in a memory device, deterministic neural data for an electronic neuron of a neurosynaptic core circuit; receiving an incoming neuronal firing event targeting the neuron; generating, at a logic circuit, stochastic neural data by: obtaining a pseudo-random value; determining whether the deterministic neural data is less than the pseudo-random value; and forwarding a data value selected from multiple data values as the stochastic neural data based on whether the deterministic neural data is less than the pseudo-random value, wherein the selected data value comprises a first data value in response to determining the deterministic neural data is less than the pseudo-random value, and the selected data value comprises a second data value different from the first data value in response to determining the deterministic neural data is greater than or equal to the pseudo-random value; updating a membrane potential variable of the neuron based on the stochastic neural data; and generating an outgoing neuronal firing event in response to the neuron spiking, wherein the stochastic neural data controls frequency of the neuron spiking, such that the neuron spikes at an average firing rate proportional to a relative magnitude of the membrane potential variable. |
9536092 | 15044609 | 1 | 1. A method of remotely attesting to a state of a computer system, comprising: with the computer system: measuring data specific to the computer system; storing the data specific to the computer system in a set of Platform Configuration Registers (PCRs), wherein the data specific to the computer system comprises static data associated with the computer system and dynamic data associated with the computer system that is generated as the computer system is running, wherein the static data comprises public key data used for establishing a communications channel, wherein the dynamic data comprises an event occurring on the computer system; receiving an attestation challenge from a remote computer system; and responding to the attestation challenge using the data specific to the computer system stored in the set of PCRs. |
9652478 | 14291471 | 1 | 1. A method for generating a schema for data asset information, the method comprising: accessing complex type information corresponding to a logical relational data model that defines an organization of the data asset information, the logical relational data model including a parent entity and child entities corresponding to the parent entity; treating the complex type information to produce scrubbed complex type information, said treating of the complex type information including removing at least one foreign key from at least one of the child entities; translating the scrubbed complex type information to produce a hierarchical data model corresponding to the logical relational data model, the hierarchical data model including a plurality of containers respectively corresponding to the child entities of the logical relational data model, the treating and translating being carried out such that the at least one foreign key removed from the at least one child entity is omitted from a first level container in the hierarchical data model and is present in a second level container in the hierarchical data model, the first level container paralleling the child entity from which the foreign key is removed, the second level container being at a higher level in the hierarchical data model than that of the first level container; and generating a schema for the data asset information based upon the hierarchical data model. |
8739099 | 12176379 | 1 | 1. A method for determining clock uncertainties, comprising: identifying clock transfer types between registers from an integrated circuit design; identifying contributors to clock uncertainties for a source clock and a destination clock for each of the clock transfer types; calculating jitter associated with each identified contributor for both set-up time and hold time; incorporating, through a processor, the jitter into a slack calculation to determine whether timing constraints are met for the integrated circuit design; and determining, for each identified contributor, whether the jitter is one of a random jitter or a deterministic jitter, wherein the random jitter is incorporated into the slack calculation through a root sum square and the deterministic jitter is incorporated into the slack calculation through a linear addition. |
9923826 | 13648975 | 1 | 1. A method for managing a plurality of instances of a Wide Area Network (WAN) optimizer executing on an intermediary device, the method comprising: (a) establishing, by a device intermediary to a plurality of clients and a plurality of servers, a plurality of instances of a Wide Area Network (WAN) optimizer on the device to accelerate via compression WAN communications between the plurality of clients and the plurality of servers, the device establishing a configuration of a size of each of the plurality of instances of the WAN optimizer based on data stored from monitoring of previous execution of the plurality of instances of the WAN optimizer; (b) monitoring, by the device, network traffic traversing the device for each of the plurality of instances of the WAN optimizer; and (c) selecting, by a manager executing on the device responsive to the monitoring, a change of a load balancing scheme to load balance the plurality of instances of the WAN optimizer on the device; and (d) automatically changing, by the manager responsive to the monitoring, at least one of the number of instances of the WAN optimizer executing on the device or a size of resource usage of the device used by one or more of the plurality of instances of the WAN optimizer. |
8897146 | 13592217 | 1 | 1. A system for managing wireless devices in a wireless network comprising: a processor; and a memory coupled with the processor, wherein the memory is configured to provide the processor with instructions which when executed cause the processor to: receive a diagnostic request to analyze a problem associated with a wireless device operating in the wireless network; retrieve diagnostic information associated with the wireless device from the wireless network comprising verifying wireless device connectivity with the wireless network by checking a home location register (HLR) for wireless signaling activity including at least one of a GSM authorization request, a mobile switching center (MSC) location update, and a serving GPRS support node (SGSN) location update; retrieve the diagnostic information associated with the wireless device from the wireless device; determine at least one solution for the problem associated with the wireless device based on the retrieved diagnostic information from the wireless network and the wireless device; and transmit at least one customer service number associated with the at least one solution for the problem to the wireless device. |
20120057513 | 12958185 | 0 | 1. A system that facilitates access to one or more sleep mode selection policies, comprising: a semi-Markov decision process (MDP) component configured to access at least one wireless system parameter and determine the one or more sleep mode selection policies based on an MDP model. |
20090112750 | 12262586 | 0 | 1. A method for determining an optimal allocation in a combinatorial auction, the method comprising: (a) receiving a plurality of bids each of which includes a plurality of sub bids, wherein each sub bid is comprised of one of the following: (1) one good and a price associated with the good or (2) a logical operator logically connecting at least two child sub bids and a price associated with the logical operator, wherein, for each sub bid, the price associated with the good or the logical operator is either an explicit price that is included with the sub bid or the price is assigned a value of zero when the sub bid does not include an explicit price; (b) defining an objective for the plurality of bids; (c) defining for each bid a plurality of mathematical relationships without logical operators, wherein said mathematical relationships collectively represent the bid; and (d) causing optimizing software to process the received bids to achieve the objective subject to the mathematical relationships. |
20140282302 | 13831450 | 0 | 1. A non-transitory computer-readable medium holding computer-executable instructions for modeling plasma etches on a 3D structural model of a semiconductor device, the instructions when executed causing the computing device to: receive, for a semiconductor structure to be virtually fabricated, a selection of 2D design data and a process sequence that includes a plurality of processes; receive a set of material-specific behavioral parameters for a plurality of types of etch behavior to be respectively applied to a plurality of etchable materials in at least one etch process in the process sequence, at least one of the types of etch behavior being taper behavior, the taper behavior caused by a combination of directional etching and polymer deposition; perform with the computing device a virtual fabrication run for the structure using the process sequence and 2D design data, the virtual fabrication run building a 3D structural model containing the plurality of etchable materials and an etchable surface including one or more etchable materials, the virtual fabrication run using the material-specific behavioral parameters to simulate the etch process by evolving the etchable surface during the virtual fabrication run. |
9471409 | 14604700 | 1 | 1. A method of detecting PDSE extended sharing violations in which PDSE extended sharing is not limited to a single sysplex, the method comprising: defining in shared DASD an on-DASD sync page within each PDSE dataset, said on-DASD sync page is a fixed-size page comprising a list of the most recent index update records, each record including a time stamp, a name of the updating system, a sysplex ID and an index key of the updated record; upon receipt of a request to open the PDSE dataset from a system connected to the shared DASD, loading the on-DASD sync page to local cache in the connected system as an in-core sync page; for each update made to an index record by a connected system, entering an index update record in the in-core sync page stored in the local cache of that system, said in-core sync pages synchronized among connected systems within a sysplex and written to the shared DASD to update the on-DASD sync page; and upon detection of a PDSE processing error by one of the connected systems, reloading the on-DASD sync page from shared DASD to the local cache of the detecting system; comparing the in-core sync page to the on-DASD sync page; entering an error record into the in-core sync page, surfacing an error message to the detecting system and writing the in-core sync page to shared DASD to update the on-DASD sync page; if the in-core and on-DASD sync pages are different and the on-DASD sync page contains an initial rogue update from a connected system outside the sysplex of the detecting system, identifying the index update records that are different following the initial rogue update and synchronizing the index records in local cache of the detecting system and on shared DASD. |
8112268 | 12254796 | 1 | 1. A computer-readable medium containing instructions for controlling a computer system to rank documents, by a method comprising: providing a sentence classifier to classify sentences into classifications of sentences; training a document rank classifier by representing each document of training data by the classifications of its sentences as determined by the sentence classifier and a rank of each document; representing a document by the classifications of its sentences as determined by the sentence classifier; and applying the trained document rank classifier to the representation of the document to determine the rank of the document. |
20130060305 | 13600855 | 0 | 1. A system for selecting optimal stimulation parameter settings for a current patient, comprising: at least one computer processor configured to: obtain a plurality of electrical parameter maps and corresponding score values; and process the parameter maps and the score values to evaluate, based on a set of score criteria, parameter maps associated with potential stimulation parameter settings. |
7711662 | 10542208 | 1 | 1. A computer medium of sound or image recognition comprising: one or more sensors or receivers responsive to signals; a computer operatively coupled to the one or more sensors, the computer comprising a central processing unit; one or more memories, at least one of the one or more memories storing a software program comprising the steps of: defining a plurality of distributions of known database records onto respective training and testing subsets; training and testing a first generation set of prediction algorithms using the plurality of distributions of the database records, each of said prediction algorithms being associated with a first different distribution of said database records; assigning a fitness score to each of the prediction algorithms; feeding the set of prediction algorithms to an evolutionary algorithm which generates a set of one or more second generation prediction algorithms and assigns a fitness score to each; continuing to feed each generational set of prediction algorithms to the evolutionary algorithm until a termination event occurs, wherein said termination event is at least one of; a prediction algorithm generated with a fitness score equal to or exceeding a defined minimum value, the maximum fitness score of successive generational sets of prediction algorithms converging to a given value, or a certain number of generations having been generated; selecting a prediction algorithm having a best fitness score; and using the distribution of database records associated with said selected prediction algorithm in performing supervised learning, said supervised learning including training and testing of prediction algorithms to obtain a trained prediction algorithm; generating a population of prediction algorithms, wherein each of said prediction algorithms is trained and tested according to a second different distribution of the records of the data set in the complete database onto a training data set and a testing data set, each second different distribution being created as one of a random or pseudorandom distribution, each prediction algorithm of said population being trained according to its own distribution of records of the training set and being validated in a blind way according its own distribution on the testing set, and a score reached by each prediction algorithm being calculated in the testing phase representing its fitness; providing an evolutionary algorithm which combines the different models of distribution of the records of the complete data set in a training and in a testing set, which sets are represented each one by a corresponding prediction algorithm trained and tested on the basis of said training and testing data set according to the fitness score calculated in the previous step for the corresponding prediction algorithm, the fitness score of each prediction algorithm corresponding to one of the different distributions of the complete data set on the training and the testing data sets being the probability of evolution of each prediction algorithm or of each said distribution of the complete data set on the training and testing data sets; repeating the evolution of the prediction algorithm generation for a finite number of generations or till the output of the genetic algorithm converges to a best solution and/or till the fitness value of at least some prediction algorithm related to an associated data records distribution has reached a desired value; and setting the data records distribution for the best solution as the optimized training and testing subsets for training and testing prediction algorithm; and an output system providing an indication of the signals detected by the one or more sensors. |
20170201412 | 15393845 | 0 | 1. A device for detecting radio communication anomalies, the device being capable of communicating with a sensor node via radio waves, the device comprising: a memory; and a processor coupled to the memory and configured to: gather and store different kinds of parameters in a storage unit, the different kinds of parameters indicating a quality of radio communication with the sensor node; classify parameter sets into a plurality of clusters, each of the parameter sets containing specific kinds of parameters gathered during a prescribed time period among the parameters stored in the storage unit; estimate that a rapid radio quality degradation has occurred during the prescribed time period when there is a cluster of which all average values of specified kinds of parameters among the different kinds of parameters degrade more than those of another cluster; perform a trend analysis for a time period during which it is not estimated that the rapid radio quality degradation has occurred to determine whether each of the different kinds of parameters gathered during the time period exhibits a trend of degradation; and estimate that a slow radio quality degradation has occurred based on a result of the trend analysis by the trend analyzer. |
20040049295 | 10465153 | 0 | 1. A method of controlling a process, comprising: running an optimizer that uses an objective function to develop a solution defining a set of target values; determining if the solution is feasible with respect to a set of process variable constraints; if the solution is not feasible; (1) redefining the process variable constraints for at least one process variable to define a new upper and lower process variable constraint limit for the one process variable; (2) developing a new objective function by adding a penalty variable to the objective function for the one process variable, wherein the penalty variable penalizes the objective function based on the amount by which the one process variable differs from one of the new process variable constraint limits for the one process variable; and (3) rerunning the optimizer with the new objective function to develop a new solution defining a new set of target values with the new process variable constraint limits for the one process variable; providing the target values or the new target values to a controller; and running the controller using the target values or the new target values to develop a set of control signals for controlling the process. |
20150261889 | 14216053 | 0 | 1. A method for CAD editing performed by a data processing system, comprising: receiving a CAD model including a plurality of entities; receiving a user input including a selection of at least one entity and a movement of the selected entity; applying any basic condition behaviors that correspond to the user input; applying any optional condition behaviors that correspond to the user input; building a variational system to be solved based on the user input, any applied basic condition behaviors, and any optional condition behaviors; performing a variational solve on the variational system to produce an edited CAD model; and storing the edited CAD model. |
20110191138 | 12697717 | 0 | 1. A method, comprising: receiving, using at least one computer, input corresponding to at least one risk element applicable to at least one process, each of the at least one risk element being associated with at least one risk category, and each of the at least one risk category being associated with at least one risk parameter; determining, using the at least one computer, based on the received input, an exposure score for each of the at least one risk element; determining, using the at least one computer, based on stored impact information, an impact score for each of the at least one risk element; determining, using the at least one computer, based on stored trend information, a likelihood score for each of the at least one risk element; determining, using the at least one computer, based on the corresponding exposure score for each of the at least one risk element, the corresponding impact score for each of the at least one risk element, and the corresponding likelihood score for each of the at least one risk element, an element score for each of the at least one risk element; determining, using the at least one computer, for each of the at least one risk category, a risk category score, based on the at least one element score for the at least one risk element associated with the risk category; determining, using the at least one computer, for each of the at least one risk parameter, a risk parameter score, based on the at least one risk category score for the at least one risk category associated with the risk parameter; and determining, using the at least one computer, based on the at least one risk parameter score, an overall risk score for the at least one process. |
20150039540 | 14314308 | 0 | 1. A method for evaluating a predictive model, comprising: identifying, by one or more computer processors, features of training samples in a set of training samples; selecting, by one or more computer processors, at least one evaluation metric from a set of evaluation metrics as one or more available metrics based on the identified features; applying, by one or more computer processors, a predictive model created based on the set of training samples to a set of test samples so as to calculate values of the one or more available metrics; and evaluating, by one or more computer processors, the predictive model by using the one or more available metrics and the values of the one or more available metrics. |
9465581 | 14280611 | 1 | 1. An automatic method for predicting tidal heights and currents using an automated forecast model comprising: accessing, by a specially programmed computer, processing options; automatically locating, by the specially programmed computer, at least one water cell and at least one river based on the processing options, wherein the at least one water cell and the at least one river are represented as geographic data in a graphical map that is displayed on a display device; automatically determining river discharge data for the at least one water cell, including: determining a domain of a forecast; if one of the at least one river is located within the domain, automatically locating the at least one water cell in the domain coincident with the one of the at least one river, if possible, or automatically locating the at least one water cell in the domain, the at least one water cell having a predetermined water depth and being near the one of the at least one river; and automatically calculating river discharge flow rates for the at least one water cell; automatically providing, by the specially programmed computer, the at least one water cell, the river discharge data, and the processing options, to the forecast model, automatically receiving a forecast from the forecast model based on the at least one water cell, the river discharge data, and the processing options; automatically generating a mapped product based on the forecast, wherein the mapped product comprises spatial data corresponding to a plurality of forecasted parameters in the forecast; and automatically updating the graphical map displayed on the display device to include the mapped product. |
5559718 | 08234410 | 1 | 1. A system for model-based verification of local design rules in a physical integrated circuit design, the system comprising: a processing unit having an input and an output, for performing the model-based local design rule verification of the physical integrated circuit design according to a sequence of program instruction steps; a verification database having an input and an output, for storing a cell reference graph representing the physical integrated circuit design as a set of cells, each cell representing one of a constituent model and a shape model on a physical mask design, each constituent model comprising a reference to one of a shape model and a reference to a second cell at a lower hierarchical level, the output of the verification database coupled to the input of the processing unit, the input of the verification database coupled to the output of the processing unit, said verification database further comprising: a reference graph register having an input and an output, for storing the cell reference graph representation of the physical integrated circuit design, the output of the reference graph register coupled to the input of the processing unit, the input of the reference graph register coupled to the output of the processing unit; a results register having an input and an output, for storing a verification result, the input of the results register coupled to the output of the processing unit, and the output of the results register coupled to the input of the processing unit; said processing unit overriding one of said verification results and said results register storing a new verification result associated with a first cell of said set of cells if a position of one of a second cell of said set of cells and a shape model violates said verification function; and a verification memory having an input and an output, for storing said verification function and one or more models during model-based local design rule verification, the output of the verification memory coupled to the input of the processing unit. |
20110066714 | 12877914 | 0 | 1. In a computing device, a method of generating a subgraph of key entities in a network, comprising: (a) executing at least one computer program on one or more processors to determine at least two types of network centrality metrics for a plurality of entities in a giant component of the network; (b) assigning rank-based scores to each network centrality metric value of each entity; (c) selecting some of the entities to form a tentative subgraph of key entities based on comparisons of the rank-based scores to preset cut-off criteria; (d) calculating the reach of the entities in the tentative subgraph of key entities and comparing that reach to a reach range; (e) if the reach falls within the reach range, assigning the entities in the tentative subgraph of key entities to a subgraph of key entities; and (f) if the reach does not fall within the reach range, iteratively repeating (c)-(e) using alternate rank-based scores cut-off criteria until a subgraph of key entities with a reach within the reach range is formed. |
20060136864 | 11121994 | 0 | 1. An apparatus for a product-line architecture description and verification, comprising: a product-line architecture model conversion tool for classifying related architecture model components according to variant characteristics by analyzing inputted scenarios, generating a dependency relationship model by extracting a dependency relationship between architecture model elements based on a variant element, and generating the product-line architecture from an inputted architecture model based on a dependency relationship model; and a product-line architecture verification tool for receiving a scenario of a system requirement, mapping the scenario to related architecture model components, analyzing an architecture model dependency by analyzing static modeling information and dynamic modeling information of a product architecture, and generating an aspect model of the requirements, the scenario and the related architecture model components. |
20050137866 | 10953712 | 0 | 1. A speech recognition system comprising: a generic speech model used for speech recognition of user speech input; means for identifying a personal speech model in communication with the speech recognition system; means for receiving personal speech model components; means for updating the generic speech model using the received personal speech model components; and means for performing speech recognition on user speech using the updated generic speech model. |
20070033158 | 11497926 | 0 | 1. A method for processing data, the method comprising the steps of: selecting a metric for determining substantially optimal combination of true positives and false positives in a data set; applying an optimization technique; and obtaining, from the results of the optimization technique, a value for at least one optimization parameter, said value for at least one optimization parameter resulting in substantially optimal combination of true positives and false positives; wherein a number of true positives and false positives are a function of at least one optimization parameter. |
9621193 | 14987921 | 1 | 1. A method for data error recovery in a tape storage system, by a processor device, comprising: in a tape storage system using an iterative hardware decoder, dynamically initializing at least one microcode iterative decode cycle on a buffered dataset, each iterative decode cycle providing an error feedback loop; initiating n microcode iterative decode cycles on the buffered dataset while tape is at speed; wherein n comprises a number of microcode iterative decode cycles able to complete without stopping the tape due to buffering; and initiating x microcode iterative decode cycles on the buffered dataset while the tape is stopped; wherein x comprises at least one of a plurality of the microcode iterative decode cycles. |
8918748 | 13593665 | 1 | 1. A method for performing latency optimization on a system design to be implemented on a target device, the method comprising: inserting a variable latency indicator in the system design at a place along a circuit path that includes a plurality of pipeline registers, wherein the variable latency indicator indicates an amount of adjustable latency at its inserted location; and automatically performing latency optimization on the system design during a computer aided design flow performed by an electronic Design Automation (EDA) tool by varying a number of the pipeline registers at the variable latency indicator, and performing re-timing and combinational re-synthesis on the system design with adjusted pipeline registers at the variable latency indicator during physical synthesis of the system design, wherein at least one of the inserting and performing is performed by a processor. |
9532716 | 13959085 | 1 | 1. A system for using telemetry data based on monitoring of an individual, comprising: a monitoring device that includes, a microphone, an RF transmitter and sensors to determine air quality, sound level/quality, light quality and ambient temperature near the individual, the RF transmitter serving as a communication system; a telemetry system with a database coupled to the monitoring device, the telemetry system in operation selecting records of sleep information and sleep behavior information data of one or more individual's, the telemetry system or the monitoring system at least partially analyzing the individual's movement information to calculate or derive sleep onset and wake time, sleep interruptions, and the quality and depth of sleep; one or more analysis tools including at least an accelerometer or a movement device that measures movement of the individual, the accelerator and the monitoring device configured to calculate or derive sleep onset and wake time, sleep interruptions, and the quality and depth of sleep, the microphone configured to record an individual's movement sounds detected by the accelerometer or the movement detection device, the accelerometer or movement detection device configured to cause the microphone to stop recording the individual's movement sounds when the movement sounds are not directed to a sleep related parameter; a feedback control system or subsystem that analyzes a measured sensor signal from at least one of the sensors and can provide an alert to the individual; and wherein the feedback control system or subsystem is at the telemetry system. |