Patent application number | Description | Published |
20090254503 | METHOD AND SYSTEM FOR AUTOMATED EXPERTISE EXTRACTION - A method and system for expertise extraction for an expert system, is provided. One implementation involves modeling active learning for interrogating an expert for knowledge as attributes of an n-dimensional hyper-cube where each attribute represents a possible output and every dimension represents a feature in a feature space; dividing the n-dimensional hyper-cube into m different attributes, each attribute representing a union of at most p cubes, wherein the n dimensions represent n boolean inputs and the m attributes represent m possible outputs; and discovering all possible outputs by querying a portion of the feature space for generating queries to an expert for all possible outputs, including obtaining at least one representative input for each of the m possible outputs, while using a limited number of queries to the hyper-cube. | 10-08-2009 |
20090259703 | Handling Mask and Range Constraints - Handling mask and range constraints. For example, a method of handling range and mask constraints, may include determining whether or not to utilize a mask constraint and a range constraint by determining whether or not the range and mask constraints are satisfiable. Other embodiments are described and claimed. | 10-15-2009 |
20090259704 | Generating a Number based on Mask and Range Constraints - Generating a number based on mask and range constraints. For example, a method of generating a pseudo random number satisfying a range constraint and a mask constraint may include determining a number of possible solutions satisfying the range constraint and the mask constraint; selecting an index representing a solution of the possible solutions; and generating the pseudo random number based on the index. Other embodiments are described and claimed. | 10-15-2009 |
20100052954 | Converting a Mask Constraint into a Bitset Constraint - Converting a mask constraint into a bitset constraint. For example, a method of converting a mask constraint into a bitset constraint may include determining an intermediate bitset based on a variable-bit component of the mask constraint; and generating the bitset constraint based on the intermediate bitset and on a fixed-bit component of the mask constraint. Other embodiments are described and claimed. | 03-04-2010 |
20100082719 | Generating a Number based on a Bitset Constraint - Generating a number based on a bitset constraints. For example, a method of generating a pseudo random number satisfying a bitset constraint may include determining a number of possible solutions satisfying the bitset constraint; selecting an index representing a solution of the possible solutions; and generating the pseudo-random number based on the index. Other embodiments are described and claimed. | 04-01-2010 |
20100249976 | METHOD AND SYSTEM FOR EVALUATING A MACHINE TOOL OPERATING CHARACTERISTICS - A method and system for evaluating a performance of a semiconductor manufacturing tool while manufacturing microelectronic devices are disclosed. At least one report is generated based on executions of at least one statistical test. The report includes at least one heat map having rows that correspond to sensors, columns that correspond to trace data obtained during recipe steps, and cells at the intersection of the rows and the columns. At least one sensor in the tool obtains trace data of a recipe step while manufacturing at least one microelectronic device. A computing device analyzes the obtained trace data to determine a level of operational significance found in the data and assigns a score to the trace data that indicates a level of operational significance. Then, the computing device places the score in a corresponding cell of the heat map. A user uses the cell for evaluating the tool performance. | 09-30-2010 |
20120185522 | Generating a Number based on Mask and Range Constraints - Generating a number based on mask and range constraints. For example, a method of generating a pseudo random number satisfying a range constraint and a mask constraint may include determining a number of possible solutions satisfying the range constraint and the mask constraint; selecting an index representing a solution of the possible solutions; and generating the pseudo random number based on the index. Other embodiments are described and claimed. | 07-19-2012 |
20130006406 | METHOD AND SYSTEM FOR EVALUATING A MACHINE TOOL OPERATING CHARACTERISTICS - A method, a system and a computer program product suitable for use in a manufacturing environment comprising a multiplicity of nominally identical independent tools. A computing device generates a multi dimensional array of process trace data derived from at least one of the independent tools, wherein, the array includes data representing a first dimension comprising a list of steps in a manufacturing recipe and data representing a second dimension comprising a list of a set of sensors generating measurements from at least one of the independent tools. The computing device conducts an analysis on at least one preselected subset of the multi dimensional array for the purpose of evaluating at least one operating characteristic of at least one of the independent tools. The computing device presents results of the analysis via a set of hierarchically linked and browseable graphics. | 01-03-2013 |
20140052699 | ESTIMATION OF DATA REDUCTION RATE IN A DATA STORAGE SYSTEM - Systems and methods for estimating data reduction ratio for a data set is provided. The method comprises selecting a plurality of m elements from a data set comprising a plurality of N elements; associating an identifier h | 02-20-2014 |
20140195498 | REAL-TIME REDUCTION OF CPU OVERHEAD FOR DATA COMPRESSION - Real-time reduction of CPU overhead for data compression is performed by a processor device in a computing environment. Non-compressing heuristics are applied on a randomly selected data sample from data sequences for determining whether to compress the data sequences. A compression potential is calculated based on the non-compressing heuristics. The compression potential is compared to a threshold value. The data sequences are either compressed if the compress threshold is matched, compressed using Huffman coding if Huffman coding threshold is matched, or stored without compression. | 07-10-2014 |
20140195499 | REAL-TIME CLASSIFICATION OF DATA INTO DATA COMPRESSION DOMAINS - For real-time classification of data into data compression domains, a decision is made for which of the data compression domains write operations should be forwarded by reading randomly selected data of the write operations for computing a set of classifying heuristics thereby creating a fingerprint for each of the write operations. The write operations having a similar fingerprint are compressed together in a similar compression stream. | 07-10-2014 |
20150070392 | AERIAL VIDEO ANNOTATION - A method comprising using at least one hardware processor for: receiving an aerially-captured video and metadata associated with the video; receiving deviation data indicative of an amount of inaccuracy in the metadata; and overlaying, on the video, a geographic annotation descriptive of an object of interest having known geographic coordinates, wherein the geographic annotation is of a size and a shape representative of the amount of inaccuracy. | 03-12-2015 |
20150074651 | DIRECTING VERIFICATION TOWARDS BUG-PRONE PORTIONS - A method, system and product for directing verification towards bug-prone portions. The method comprising syntactically analyzing a computer program to identify portions of the computer program that correspond to one or more bug patterns; and performing verification of the computer program, wherein the verification comprises traversing a control flow graph of the computer program and tracking symbolic values of variables of the computer program, wherein said performing comprises directing the traversal of the control flow graph to nodes of the control flow graph that correspond to the identified portions, whereby bug-prone portions of the computer program are prioritized to be verified before non-bug-prone portions of the computer program. | 03-12-2015 |