1,347,264 research outputs found
Recommended from our members
A golden block based self-refining scheme for repetitive patterned wafer inspections
This paper presents a novel technique for detecting possible defects in two-dimensional wafer images with repetitive patterns using prior knowledge. It has a learning ability that is able to create a golden block database from the wafer image itself, modify and refine its content when used in further inspections. The extracted building block is stored as a golden block for the detected pattern. When new wafer images with the same periodical pattern arrives, we do not have to re-calculate its periods and building block. A new building block can be derived directly from the existing golden block after eliminating alignment differences. If the newly derived building block has better quality than the stored golden block, then the golden block is replaced with the new building block. With the proposed algorithm, our implementation shows that a significant amount of processing time is saved. And the storage overhead of golden templates is also reduced significantly by storing golden blocks only
Modeling Building Block Interdependency
The Building-Block Hypothesis appeals to the notion of problem decomposition and the assembly of solutions from sub-solutions. Accordingly, there have been many varieties of GA test problems with a structure based on building-blocks. Many of these problems use deceptive fitness functions to model interdependency between the bits within a block. However, very few have any model of interdependency between building-blocks; those that do are not consistent in the type of interaction used intra-block and inter-block. This paper discusses the inadequacies of the various test problems in the literature and clarifies the concept of building-block interdependency. We formulate a principled model of hierarchical interdependency that can be applied through many levels in a consistent manner and introduce Hierarchical If-and-only-if (H-IFF) as a canonical example. We present some empirical results of GAs on H-IFF showing that if population diversity is maintained and linkage is tight then the GA is able to identify and manipulate building-blocks over many levels of assembly, as the Building-Block Hypothesis suggests
“Unmatter,” as a new form of matter, and its related “un-particle,” “un-atom,” “un-molecule”
Unmatter is formed by matter and antimatter that bind together. The building blocks (most elementary particles known today) are 6 quarks and 6 leptons; their 12 antiparticles also exist. Then unmatter will be formed by at least a building block and at least an antibuilding block which can bind together
Digital Alchemy for Materials Design: Colloids and Beyond
Starting with the early alchemists, a holy grail of science has been to make
desired materials by modifying the attributes of basic building blocks.
Building blocks that show promise for assembling new complex materials can be
synthesized at the nanoscale with attributes that would astonish the ancient
alchemists in their versatility. However, this versatility means that making
direct connection between building block attributes and bulk behavior is both
necessary for rationally engineering materials, and difficult because building
block attributes can be altered in many ways. Here we show how to exploit the
malleability of the valence of colloidal nanoparticle "elements" to directly
and quantitatively link building block attributes to bulk behavior through a
statistical thermodynamic framework we term "digital alchemy". We use this
framework to optimize building blocks for a given target structure, and to
determine which building block attributes are most important to control for
self assembly, through a set of novel thermodynamic response functions, moduli
and susceptibilities. We thereby establish direct links between the attributes
of colloidal building blocks and the bulk structures they form. Moreover, our
results give concrete solutions to the more general conceptual challenge of
optimizing emergent behaviors in nature, and can be applied to other types of
matter. As examples, we apply digital alchemy to systems of truncated
tetrahedra, rhombic dodecahedra, and isotropically interacting spheres that
self assemble diamond, FCC, and icosahedral quasicrystal structures,
respectively.Comment: 17 REVTeX pages, title fixed to match journal versio
Fault-tolerant computer study
A set of building block circuits is described which can be used with commercially available microprocessors and memories to implement fault tolerant distributed computer systems. Each building block circuit is intended for VLSI implementation as a single chip. Several building blocks and associated processor and memory chips form a self checking computer module with self contained input output and interfaces to redundant communications buses. Fault tolerance is achieved by connecting self checking computer modules into a redundant network in which backup buses and computer modules are provided to circumvent failures. The requirements and design methodology which led to the definition of the building block circuits are discussed
Optimization as a design strategy. Considerations based on building simulation-assisted experiments about problem decomposition
In this article the most fundamental decomposition-based optimization method
- block coordinate search, based on the sequential decomposition of problems in
subproblems - and building performance simulation programs are used to reason
about a building design process at micro-urban scale and strategies are defined
to make the search more efficient. Cyclic overlapping block coordinate search
is here considered in its double nature of optimization method and surrogate
model (and metaphore) of a sequential design process. Heuristic indicators apt
to support the design of search structures suited to that method are developed
from building-simulation-assisted computational experiments, aimed to choose
the form and position of a small building in a plot. Those indicators link the
sharing of structure between subspaces ("commonality") to recursive
recombination, measured as freshness of the search wake and novelty of the
search moves. The aim of these indicators is to measure the relative
effectiveness of decomposition-based design moves and create efficient block
searches. Implications of a possible use of these indicators in genetic
algorithms are also highlighted.Comment: 48 pages. 12 figures, 3 table
The New Building on the Block
Members of the Building Committee relied on the expertise and input from faculty and staff to use the building\u27s design and architecture to enhance the School of Law\u27s sense of community
EbbRT: Elastic Building Block Runtime - overview
EbbRT provides a lightweight runtime that enables the construction of reusable, low-level system software which can integrate with existing, general purpose systems. It achieves this by providing a library that can be linked into a process on an existing OS, and as a small library OS that can be booted directly on an IaaS node
Building Blocks for Control System Software
Software implementation of control laws for industrial systems seem straightforward, but is not. The computer code stemming from the control laws is mostly not more than 10 to 30% of the total. A building-block approach for embedded control system development is advocated to enable a fast and efficient software design process.\ud
We have developed the CTJ library, Communicating Threads for Java¿,\ud
resulting in fundamental elements for creating building blocks to implement communication using channels. Due to the simulate-ability, our building block method is suitable for a concurrent engineering design approach. Furthermore, via a stepwise refinement process, using verification by simulation, the implementation trajectory can be done efficiently
- …