Efficient tile sets for self assembling rectilinear shapes is of critical importance in algorithmic self assembly. A lower bound on the tile complexity of any deterministic self assembly system for an n x n square is ...
详细信息
Efficient tile sets for self assembling rectilinear shapes is of critical importance in algorithmic self assembly. A lower bound on the tile complexity of any deterministic self assembly system for an n x n square is (inferred from the Kolmogrov complexity). Deterministic self assembly systems with an optimal tile complexity have been designed for squares and related shapes in the past. However designing unique tiles specific to a shape is still an intensive task in the laboratory. On the other hand copies of a tile can be made rapidly using PCR (polymerase chain reaction) experiments. This led to the study of self assembly on tile concentration programming models. We present two major results in this paper on the concentration programming model. First we show how to self assemble rectangles with a fixed aspect ratio (alpha:beta), with high probability, using tiles. This result is much stronger than the existing results by Kao et al. (Randomized self-assembly for approximate shapes, LNCS, vol 5125. Springer, Heidelberg, 2008) and Doty (Randomized self-assembly for exact shapes. In: proceedings of the 50th annual IEEE symposium on foundations of computer science (FOCS), IEEE, Atlanta. pp 85-94, 2009)-which can only self assembly squares and rely on tiles which perform binary arithmetic. On the other hand, our result is based on a technique called staircase sampling. This technique eliminates the need for sub-tiles which perform binary arithmetic, reduces the constant in the asymptotic bound, and eliminates the need for approximate frames (Kao et al. Randomized self-assembly for approximate shapes, LNCS, vol 5125. Springer, Heidelberg, 2008) . Our second result applies staircase sampling on the equimolar concentration programming model (The tile complexity of linear assemblies. In: proceedings of the 36th international colloquium automata, languages and programming: Part I on ICALP '09, Springer-Verlag, pp 235-253, 2009), to self assemble rectangles (of fixed aspect r
The application of various transient techniques in heterogeneous catalysis (TAP, step-response experiments, SSITKA, TEOM), with the aim to determine reaction kinetics for design purposes, is presented for several case...
详细信息
The application of various transient techniques in heterogeneous catalysis (TAP, step-response experiments, SSITKA, TEOM), with the aim to determine reaction kinetics for design purposes, is presented for several cases. These cases, comprising catalytic cracking, diffusion in zeolites, simultaneous NO, and SO, removal, syngas production from methane by chemical looping and selective catalytic reduction of NOx, show that transient techniques can be well used for the purpose of rapid determination of the reaction kinetics without the laborious classical approach of steady-state kinetic measurements and without the need of high levels of sophistication to interpret and process the experimental data. In this respect transient kinetics deserve, next to fundamental catalysis studies, more frequent application in design Studies for industrially relevant reaction systems. Topics and challenges for further developments in transient studies are indicated. (c) 2008 Elsevier B.V. All rights reserved.
An attempt to grow CuI single crystal with decomplexation method modified by concentration programming in silica gel was performed. The results show that decreasing the concentration of feeding solution gradually can ...
详细信息
An attempt to grow CuI single crystal with decomplexation method modified by concentration programming in silica gel was performed. The results show that decreasing the concentration of feeding solution gradually can yield pure regular single crystals with larger size compared with those of increasing concentration. Replenishing feeding solution every 24 It produces crystals with higher quality than those of every 48 h.
暂无评论