A new method for generation of quasi-periodic structures withn fold axes: Application to five and seven folds

A new geometrical method for generating aperiodic lattices forn-fold non-crystallographic axes is described. The method is based on the self-similarity principle. It makes use of the principles of gnomons to divide the basic triangle of a regular polygon of 2n sides to appropriate isosceles triangles and to generate a minimum set of rhombi required to fill that polygon. The method is applicable to anyn-fold noncrystallographic axis. It is first shown how these regular polygons can be obtained and how these can be used to generate aperiodic structures. In particular, the application of this method to the cases of five-fold and seven-fold axes is discussed. The present method indicates that the recursion rule used by others earlier is a restricted one and that several aperiodic lattices with five fold symmetry could be generated. It is also shown how a limited array of approximately square cells with large dimensions could be detected in a quasi lattice and these are compared with the unit cell dimensions of MnAl6 suggested by Pauling. In addition, the recursion rule for sub-dividing the three basic rhombi of seven-fold structure was obtained and the aperiodic lattice thus generated is also shown.

Homonuclear NOE in spatially periodic spin systems

The nuclear Overhauser effect equations are solved analytically for a homonuclear group of spins whose sites are periodically arranged, including the special cases where the spins lie at the vertices of a regular polygon and on a one-dimensional lattice. t is shown that, for long correlation times, the equations governing magnetization transfer resemble a diffusion equation. Furthermore the deviation from exact diffusion is quantitatively related to the molecular tumbling correlation time. Equations are derived for the range of magnetization travel subsequent to the perturbation of a single spin in a lattice for both the case of strictly dipolar relaxation and the more general situation where additional T1 mechanisms may be active. The theory given places no restrictions on the delay (or mixing) times, and it includes all the spins in the system. Simulations are presented to confirm the theory.

Fibre diffraction of lithium DNA shows structural variability and deviation from a regular helical structure for the B-form

Recently, reports have appeared which show structural variations in B-DNA and indicate deviations from a uniform helical structure. We report for the first time that these indications are also present in the B-form fibre diffraction patterns for the lithium salt of natural DNA. We have used an improved method of controlling the salt concentration in the fibres. Our results are based on the appearance and disappearance of meridional reflections on different layer lines depending upon the salt.

Multipath Dissemination in Regular Mesh Topologies

Mesh topologies are important for large-scale peer-to-peer systems that use low-power transceivers. The Quality of Service (QoS) in such systems is known to decrease as the scale increases. We present a scalable approach for dissemination that exploits all the shortest paths between a pair of nodes and improves the QoS. Despite th presence of multiple shortest paths in a system, we show that these paths cannot be exploited by spreading the messages over the paths in a simple round-robin manner; nodes along one of these paths will always handle more messages than the nodes along the other paths. We characterize the set of shortest paths between a pair of nodes in regular mesh topologies and derive rules, using this characterization, to effectively spread the messages over all the available paths. These rules ensure that all the nodes that are at the same distance from the source handle roughly the same number of messages. By modeling the multihop propagation in the mesh topology as a multistage queuing network, we present simulation results from a variety of scenarios that include link failures and propagation irregularities to reflect real-world characteristics. Our method achieves improved QoS in all these scenarios.

Parallel polygon scan conversion algorithms: Performance evaluation on a shared bus architecture

In this paper, three parallel polygon scan conversion algorithms have been proposed, and their performance when executed on a shared bus architecture has been compared. It has been shown that the parallel algorithm that does not use edge coherence performs better than those that use edge coherence. Further, a multiprocessing architecture has been proposed to execute the parallel polygon scan conversion algorithms more efficiently than a single shared bus architecture.

Active nucleoprotein filaments of single-stranded binding protein and recA protein on single-stranded DNA have a regular repeating structure

When E. coli single-stranded DNA binding protein (SSB) coats single-stranded DNA (ssDNA) in the presence of 1 mM MgCl2 it inhibits the subsequent binding of recA protein, whereas SSB binding to ssDNA in 12 mM MgCl2 promotes the binding of recA protein. These two conditions correspond respectively to those which produce 'smooth' and 'beaded' forms of ssDNA-SSB filaments. By gel filtration and immunoprecipitation we observed active nucleoprotein filaments of recA protein and SSB on ssDNA that contained on average 1 monomer of recA protein per 4 nucleotides and 1 monomer of SSB per 20-22 nucleotides. Filaments in such a mixture, when digested with micrococcal nuclease produced a regular repeating pattern, approximately every 70-80 nucleotides, that differed from the pattern observed when only recA protein was bound to the ssDNA. We conclude that the beaded ssDNA-SSB nucleoprotein filament readily binds recA protein and forms an intermediate that is active in the formation of joint molecules and can retain substantially all of the SSB that was originally bound.

d-Regular Graphs of Acyclic Chromatic Index at Least d+2

An acyclic edge coloring of a graph is a proper edge coloring such that there are no bichromatic cycles. The acyclic chromatic index of a graph is the minimum number k such that there is an acyclic edge coloring using k colors and is denoted by a'(G). It was conjectured by Alon, Suclakov and Zaks (and earlier by Fiamcik) that a'(G) <= Delta+2, where Delta = Delta(G) denotes the maximum degree of the graph. Alon et al. also raised the question whether the complete graphs of even order are the only regular graphs which require Delta+2 colors to be acyclically edge colored. In this article, using a simple counting argument we observe not only that this is not true, but in fact all d-regular graphs with 2n vertices and d>n, requires at least d+2 colors. We also show that a'(K-n,K-n) >= n+2, when n is odd using a more non-trivial argument. (Here K-n,K-n denotes the complete bipartite graph with n vertices on each side.) This lower bound for Kn,n can be shown to be tight for some families of complete bipartite graphs and for small values of n. We also infer that for every d, n such that d >= 5, n >= 2d+3 and dn even, there exist d-regular graphs which require at least d+2-colors to be acyclically edge colored. (C) 2009 Wiley Periodicals, Inc. J Graph Theory 63: 226-230, 2010.

An approximate algorithm for the minimal vertex nested polygon problem

Given two simple polygons, the Minimal Vertex Nested Polygon Problem is one of finding a polygon nested between the given polygons having the minimum number of vertices. In this paper, we suggest efficient approximate algorithms for interesting special cases of the above using the shortest-path finding graph algorithms.

Optimal polygon placement by translation

Let M be an m-sided simple polygon and N be an n-sided polygon with holes. In this paper we consider the problem of computing the feasible region, i.e., the set of all placements by translation of M so that M lies inside N without intersecting any hole. First we propose an O (mn(2)) time algorithm for computing the feasible region for the case when M is a monotone polygon. Then we consider the general case when M is a simple polygon and propose an O(m(2)n(2)) time algorithm for computing the feasible region. Both algorithms are optimal upto a constant factor.

Regular versus alternating (FeS4)(n) chains: Magnetism in KFeS2 and CsFeS2

We report crystal magnetic susceptibility results of two S = 1/2 one-dimensional Heisenberg antiferromagnets, KFeS2 and CsFeS2. Both compounds consist of (FeS4)(n) chains with an average Fe-Fe distance of 2.7 Angstrom. In KFeS2, all intrachain Fe-Fe distances are identical. Its magnetic susceptibility is typical of a regular antiferromagnetic chain with spin-spin exchange parameter J = -440.7 K. In CsFeS2, however, the Fe-Fe distances alternate between 2.61 and 2.82 Angstrom. This is reflected in its magnetic susceptibility, which could be fitted with J = -640 K, and the degree of alternation, alpha = 0.3. These compounds form a unique pair, and allow for a convenient experimental comparison of the magnetic properties of regular versus alternating Heisenberg chains.

Minimizing buffer requirements under rate-optimal schedule in regular dataflow networks

Large-grain synchronous dataflow graphs or multi-rate graphs have the distinct feature that the nodes of the dataflow graph fire at different rates. Such multi-rate large-grain dataflow graphs have been widely regarded as a powerful programming model for DSP applications. In this paper we propose a method to minimize buffer storage requirement in constructing rate-optimal compile-time (MBRO) schedules for multi-rate dataflow graphs. We demonstrate that the constraints to minimize buffer storage while executing at the optimal computation rate (i.e. the maximum possible computation rate without storage constraints) can be formulated as a unified linear programming problem in our framework. A novel feature of our method is that in constructing the rate-optimal schedule, it directly minimizes the memory requirement by choosing the schedule time of nodes appropriately. Lastly, a new circular-arc interval graph coloring algorithm has been proposed to further reduce the memory requirement by allowing buffer sharing among the arcs of the multi-rate dataflow graph. We have constructed an experimental testbed which implements our MBRO scheduling algorithm as well as (i) the widely used periodic admissible parallel schedules (also known as block schedules) proposed by Lee and Messerschmitt (IEEE Transactions on Computers, vol. 36, no. 1, 1987, pp. 24-35), (ii) the optimal scheduling buffer allocation (OSBA) algorithm of Ning and Gao (Conference Record of the Twentieth Annual ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, Charleston, SC, Jan. 10-13, 1993, pp. 29-42), and (iii) the multi-rate software pipelining (MRSP) algorithm (Govindarajan and Gao, in Proceedings of the 1993 International Conference on Application Specific Array Processors, Venice, Italy, Oct. 25-27, 1993, pp. 77-88). Schedules generated for a number of random dataflow graphs and for a set of DSP application programs using the different scheduling methods are compared. The experimental results have demonstrated a significant improvement (10-20%) in buffer requirements for the MBRO schedules compared to the schedules generated by the other three methods, without sacrificing the computation rate. The MBRO method also gives a 20% average improvement in computation rate compared to Lee's Block scheduling method.

On limiting cases in the flexure of simply supported regular polygonal plates

Limiting solutions are derived for the flexure of simply supported many-sided regular polygons, as the number of sides is increased indefinitely. It is shown that these solutions are different from those for simply supported circular plates. For axisymmetric loading, circular plate solutions overestimate the deflexions and the moments by significant factors.

Dynamically Reconfigurable Regular Expression Matching Architecture

Regular Expressions are generic representations for a string or a collection of strings. This paper focuses on implementation of a regular expression matching architecture on reconfigurable fabric like FPGA. We present a Nondeterministic Finite Automata based implementation with extended regular expression syntax set compared to previous approaches. We also describe a dynamically reconfigurable generic block that implements the supported regular expression syntax. This enables formation of the regular expression hardware by a simple cascade of generic blocks as well as a possibility for reconfiguring the generic blocks to change the regular expression being matched. Further,we have developed an HDL code generator to obtain the VHDL description of the hardware for any regular expression set. Our optimized regular expression engine achieves a throughput of 2.45 Gbps. Our dynamically reconfigurable regular expression engine achieves a throughput of 0.8 Gbps using 12 FPGA slices per generic block on Xilinx Virtex2Pro FPGA.

A Combinatorial Family of Near Regular LDPC Codes

An elementary combinatorial Tanner graph construction for a family of near-regular low density parity check (LDPC) codes achieving high girth is presented. These codes are near regular in the sense that the degree of a left/right vertex is allowed to differ by at most one from the average. The construction yields in quadratic time complexity an asymptotic code family with provable lower bounds on the rate and the girth for a given choice of block length and average degree. The construction gives flexibility in the choice of design parameters of the code like rate, girth and average degree. Performance simulations of iterative decoding algorithm for the AWGN channel on codes designed using the method demonstrate that these codes perform better than regular PEG codes and MacKay codes of similar length for all values of Signal to noise ratio.