Patent application number | Description | Published |
20090077506 | Simultaneous Multi-Layer Fill Generation - Techniques are disclosed for optimizing the pattern density in the circuit layout design of a circuit layer. A layer in circuit design is analyzed to define empty regions that can be filled with fill polygons (referred to hereafter as “fill” regions). Next, a pattern of fill polygons is generated. After the fill polygons have been defined, the layout design for the layer is divided into separate areas or “windows,” and a target density for each window is determined. Once this target density for the window has been determined, the fill polygons required to most closely approach this target density are generated and added to the circuit layout design. This process may be repeated with progressively different (e.g., smaller) fill polygons, until each window meets or exceeds both the specified minimum density and complies with the specified maximum density gradient. Additionally, some implementations may allow a user to simultaneously optimize the density of multiple layers of a circuit by adding fill polygons to multiple layers of a circuit design simultaneously. Representations of sections of a multilayer fill structure will then be added to corresponding layers the circuit design until a specified target density is met. | 03-19-2009 |
20110289471 | Simultaneous Multi-Layer Fill Generation - Techniques are disclosed for optimizing the pattern density in the circuit layout design of a circuit layer. A layer in circuit design is analyzed to define empty regions that can be filled with fill polygons (referred to hereafter as “fill” regions). Next, a pattern of fill polygons is generated. After the fill polygons have been defined, the layout design for the layer is divided into separate areas or “windows,” and a target density for each window is determined. Once this target density for the window has been determined, the fill polygons required to most closely approach this target density are generated and added to the circuit layout design. This process may be repeated with progressively different (e.g., smaller) fill polygons, until each window meets or exceeds both the specified minimum density and complies with the specified maximum density gradient. Additionally, some implementations may allow a user to simultaneously optimize the density of multiple layers of a circuit by adding fill polygons to multiple layers of a circuit design simultaneously. Representations of sections of a multilayer fill structure will then be added to corresponding layers the circuit design until a specified target density is met. | 11-24-2011 |
Patent application number | Description | Published |
20100127008 | METHOD AND DEVICE FOR PRESSURIZING CONTAINERS - A container, such as a bottle or jar, that includes a closed compartment and an active insert device for pressurizing the closed compartment. The active insert device comprises an elastic liner and an active insert that are affixed to a closure or cap or the container. The active insert includes at least one reactant that is triggered to a reaction by an external energy source. The reaction produces a gas, which is delivered to the closed compartment via the liner. The gas causes the liner to expand and open a passage to deliver the gas to the closed compartment. | 05-27-2010 |
20130118123 | METHOD AND DEVICE FOR PRESSURIZING CONTAINERS - A container, such as a bottle or jar, that includes a closed compartment and an active insert device for pressurizing the closed compartment. The active insert device comprises an elastic liner and an active insert that are affixed to a closure or cap or the container. The active insert includes at least one reactant that is triggered to a reaction by an external energy source. The reaction produces a gas, which is delivered to the closed compartment via the liner. The gas causes the liner to expand and open a passage to deliver the gas to the closed compartment. | 05-16-2013 |
20130119009 | METHOD AND DEVICE FOR PRESSURIZING CONTAINERS - A container, such as a bottle or jar that includes a closed compartment and an active insert device for pressurizing the closed compartment. The active insert device comprises an elastic liner and an active insert that are affixed to a closure or cap or the container. The active insert includes at least one reactant that is triggered to a reaction by an external energy source. The reaction produces a gas, which is delivered to the closed compartment via the liner. The gas causes the liner to expand and open a passage to deliver the gas to the closed compartment. | 05-16-2013 |
Patent application number | Description | Published |
20120124306 | SYSTEM AND METHOD FOR PERFORMING BACKUP OR RESTORE OPERATIONS UTILIZING DIFFERENCE INFORMATION AND TIMELINE STATE INFORMATION - Systems and methods for backing-up data from a first storage pool to a second storage pool using difference information between time states are disclosed. The system has a data management engine for performing data management functions, including at least a back-up function to create a back-up copy of data. By executing a sequence of snapshot operations to create point-in-time images of application data on a first storage pool, each successive point-in-time image corresponding to a specific, successive time-state of the application data, a series of snapshots is created. The snapshots are then used to create difference information indicating which application data has changed and the content of the changed application data for the corresponding time state. This difference information is then sent to a second storage pool to create a back-up copy of data for the current time-state. | 05-17-2012 |
20130036091 | INCREMENTAL COPY PERFORMANCE BETWEEN DATA STORES - Systems and methods are disclosed for copying a data object to a target storage pool using a hybrid of storage pools, in which at least one of the storage pools is particularly efficient at identifying data that should be used for copying the data object to the target storage pool, and at least one of the storage pools is particularly efficient at retrieving the data that should be sent to the target storage pool. The system comprises a performance storage pool for storing data and having relatively high performance for retrieving stored data; a deduplicating storage pool for storing deduplicated data and storing metadata about data objects in the system and which has relatively high performance for identifying and specifying differences in a data object over time; and a controller for causing the performance storage pool to retrieve differences and provide the data to the target storage pool. | 02-07-2013 |
20130036097 | DATA FINGERPRINTING FOR COPY ACCURACY ASSURANCE - Systems and methods are disclosed for efficiently creating a data fingerprint to identify or characterize contents of a data object by using a selection function to select a plurality of non-contiguous regions from the data object, the selected regions each having a small number of bytes relative to the number of bytes in the data object and being distributed throughout the data object so that the selected regions comprise a sparse subset of the data of the data object yet provide a significant probability of including bytes that change if the data object were modified; and performing a hash operation on the data to produce a fingerprint based on the sparse subset of the data object. The data fingerprint thereby efficiently provides an indication of the contents of the data object, so that comparing data fingerprints can determine if the data objects are different if the corresponding fingerprints are different. | 02-07-2013 |
20130036098 | SUCCESSIVE DATA FINGERPRINTING FOR COPY ACCURACY ASSURANCE - Systems and methods are disclosed for checking the data integrity of a data object copied between storage pools by comparing data fingerprints of data objects, comprising scheduling a series of successive copy operations over time for copying a data object from a source data store to a target data store; generating a partial fingerprint of the data object at the source data store that creates a fingerprint from a subset of the data object; sending the partial fingerprint of the data object to the target data store; sending any new data contents to the target data store; and creating a partial fingerprint of the data object at the target data store and comparing it to the received partial fingerprint to determine if they differ, thereby allowing incremental verification that the copy of the data object at the target data store is the same as at the source data store. | 02-07-2013 |
20130042083 | Data Replication System - Systems and methods are provided for an asynchronous data replication system in which the remote replication reduces bandwidth requirements by copying deduplicated differences in business data from a local storage site to a remote, backup storage site, the system comprising: a local performance storage pool for storing data; a local deduplicating storage pool for storing deduplicated data, said local deduplicating storage pool further storing metadata about data objects in the system and which has metadata analysis logic for identifying and specifying differences in a data object over time; a remote performance storage pool for storing a copy of said data, available for immediate use as a backup copy of said data to provide business continuity to said data; a remote deduplicating storage pool for storing deduplicated data; and a controller for synchronizing the remote performance storage pool to have the second version of the data object using deduplicated data. | 02-14-2013 |
20140344216 | Garbage collection predictions - Described herein are systems and methods for garbage collection prediction. A temporal graph is received, the temporal graph including nodes, the nodes including hash references to objects. An accumulated difference count is updated when a node is added to the temporal graph, the accumulated difference count including a number of hash differences between a parent node and its children nodes in the temporal graph. A divested difference count is updated when a node is removed from the temporal graph, the divested difference count including a number of hash differences referenced by the removed node but not by either a parent node of the removed node or any child nodes of the removed node. The outcome of the garbage collection is predicted based on at least one of the accumulated difference count and the divested difference count. | 11-20-2014 |
20140351214 | Efficient data replication - Described herein are systems and methods for efficient data replication. A set of hashes for a source object to be replicated is sent from the source local deduplication store to the remote server. The remote server generates a set of object hashes representative of data in the source object that is already present on the remote server, and data indicative of source object hashes that are not present on the remote server. The remote server transmits the generated data to the source local deduplication store. The source local deduplication store identifies portions of the source object that are not already present on the remote server based on the received data. The source local deduplication store transmits the identified portions of the source object to the remote server to replicate the source object on the remote server. | 11-27-2014 |
Patent application number | Description | Published |
20090125273 | Method and system for reducing errors in vehicle weighing systems - A method and system ( | 05-14-2009 |
20090281864 | SYSTEM AND METHOD FOR IMPLEMENTING AND MONITORING A CYBERSPACE SECURITY ECONOMETRICS SYSTEM AND OTHER COMPLEX SYSTEMS - A device of implementing an econometrics-based control system. The device includes a processor, a memory in communication with the processor and configured to store processor implementable instructions. The processor implementable instructions are programmed to correlate a plurality of system requirements with each of a plurality of system stakeholders, identify a stake relating to each of the plurality of system stakeholders and the correlated plurality of system requirements such that the stake is identified by each of the plurality of system stakeholders, determining a mean failure cost as a function of the identified stake and a failure probability, and analyzing the mean failure cost to determine a control strategy. The device may further comprise a communication component in communication with the processor and the memory, the communication component configured to communicate the control strategy to a component operable within the control system such that the component implements the control strategy. | 11-12-2009 |
20110054840 | FAILURE PREDICTION OF COMPLEX STRUCTURES UNDER ARBITRARY TIME-SERIAL LOADING CONDITION - A method and apparatus for the nonlinear detection of imminent failure in a complex structural element is disclosed. The method and apparatus include sensing stress and strain displacement-related data for said structural element, analyzing the sensed stress and strain displacement-related data as a function of one or more principle components, generating a crack-growth rate function relating said data for each principle component over a load/unload cycle, determining a total crack-growth rate function based on at least one crack-growth rate function, deriving from said total crack-growth rate function at least one indicator function, monitoring trends in said at least one indicator function, and providing an indication when said monitoring detects an end-stage trend in said at least one indicator function. | 03-03-2011 |
20120146802 | Methods for Forewarning of Critical Condition Changes in Monitoring Civil Structures - Sensor modules ( | 06-14-2012 |
20120232679 | CYBERSPACE SECURITY SYSTEM - A system evaluates reliability, performance and/or safety by automatically assessing the targeted system's requirements. A cost metric quantifies the impact of failures as a function of failure cost per unit of time. The metrics or measurements may render real-time (or near real-time) outcomes by initiating active response against one or more high ranked threats. The system may support or may be executed in many domains including physical domains, cyber security domains, cyber-physical domains, infrastructure domains, etc. or any other domains that are subject to a threat or a loss. | 09-13-2012 |
20140006332 | Scientometric Methods for Identifying Emerging Technologies | 01-02-2014 |
20140157415 | INFORMATION SECURITY ANALYSIS USING GAME THEORY AND SIMULATION - Vulnerability in security of an information system is quantitatively predicted. The information system may receive malicious actions against its security and may receive corrective actions for restoring the security. A game oriented agent based model is constructed in a simulator application. The game ABM model represents security activity in the information system. The game ABM model has two opposing participants including an attacker and a defender, probabilistic game rules and allowable game states. A specified number of simulations are run and a probabilistic number of the plurality of allowable game states are reached in each simulation run. The probability of reaching a specified game state is unknown prior to running each simulation. Data generated during the game states is collected to determine a probability of one or more aspects of security in the information system. | 06-05-2014 |