Macroscopic model of city traffic using bond graph modelling

Modelling of city traffic involves capturing of all the dynamics that exist in real-time traffic. Probabilistic models and queuing theory have been used for mathematical representation of the traffic system. This paper proposes the concept of modelling the traffic system using bond graphs wherein traffic flow is based on energy conservation. The proposed modelling approach uses switched junctions to model complex traffic networks. This paper presents the modelling, simulation and experimental validation aspects.

Boxicity of Leaf Powers

The boxicity of a graph G, denoted as boxi(G), is defined as the minimum integer t such that G is an intersection graph of axis-parallel t-dimensional boxes. A graph G is a k-leaf power if there exists a tree T such that the leaves of the tree correspond to the vertices of G and two vertices in G are adjacent if and only if their corresponding leaves in T are at a distance of at most k. Leaf powers are used in the construction of phylogenetic trees in evolutionary biology and have been studied in many recent papers. We show that for a k-leaf power G, boxi(G) a parts per thousand currency sign k-1. We also show the tightness of this bound by constructing a k-leaf power with boxicity equal to k-1. This result implies that there exist strongly chordal graphs with arbitrarily high boxicity which is somewhat counterintuitive.

CA/TG sequence at the 5' end of oligo(A)-tracts strongly modulates DNA curvature

An analysis of the base pair doublet geometries in available crystal structures indicates that the often reported intrinsic curvature of DNA containing oligo-(d(A).d(T)) tracts may also depend on the nature of the flanking sequences. The presence of CA/TG doublet in particular at the 5' end of these tracts is expected to enhance their intrinsic bending property. To test this proposition, three oligonucleotides, d(GAAAAACCCCCC), d(CCCCCCAAAAAG), d(GAAAAATTTTTC), and their complementary sequences were synthesized to study the effect of various flanking sequences, at the 5' and 3' ends of the A-tracts, on the curvature of DNA in solution. An analysis of the polyacrylamide gel electrophoretic mobilities of these sequences under different conditions of salts and temperatures (below their melting points) clearly showed that the oligomer with CA/TG sequence in the center was always more retarded than the oligomer with AC/GT sequence, as well as the oligomer with AT/AT sequence. Hydroxyl radical probing of the sequences with AC/GT and CA/TG doublet junctions gives a similar cutting pattern in the A-tracts, which is quite different from that in the C-tracts, indicating that the oligo(A)-tracts have similar structures in the two oligomers. KMnO4 probing shows that the oligomer with a CA/TG doublet junction forms a kink that is responsible for its inherent curvature and unusual electrophoretic mobility. UV melting shows a reduced thermal stability of the duplex with CA/TG doublet junction, and circular dichroism (CD) studies indicate that a premelting transition occurs in the oligomer with CA/TG doublet step before global melting but not in the oligomer with AC/GT doublet step, which may correspond to thermally induced unbending of the oligomer. These observations indicate that the CA/TG doublet junction at the 5' end of the oligo(A)-tract has a crucial role in modulating the overall curvature in DNA.

CA\TG Sequence at the 5'end of Oligo(A)-tracts Strongly Modulates DNA Curvature

An analysis of the base pair doublet geometries in available crystal structures indicates that the often reported intrinsic curvature of DNA containing oligo-(d(A).d(T)) tracts may also depend on the nature of the flanking sequences. The presence of CA/TG doublet in particular at the 5' end of these tracts is expected to enhance their intrinsic bending property. To test this proposition, three oligonucleotides, d(GAAAAACCCCCC), d(CCCCCCAAAAAG), d(GAAAAATTTTTC), and their complementary sequences were synthesized to study the effect of various flanking sequences, at the 5' and 3' ends of the A-tracts, on the curvature of DNA in solution. An analysis of the polyacrylamide gel electrophoretic mobilities of these sequences under different conditions of salts and temperatures (below their melting points) clearly showed that the oligomer with CA/TG sequence in the center was always more retarded than the oligomer with AC/GT sequence, as well as the oligomer with AT/AT sequence. Hydroxyl radical probing of the sequences with AC/GT and CA/TG doublet junctions gives a similar cutting pattern in the A-tracts, which is quite different from that in the C-tracts, indicating that the oligo(A)-tracts have similar structures in the two oligomers. KMnO4 probing shows that the oligomer with a CA/TG doublet junction forms a kink that is responsible for its inherent curvature and unusual electrophoretic mobility. UV melting shows a reduced thermal stability of the duplex with CA/TG doublet junction, and circular dichroism (CD) studies indicate that a premelting transition occurs in the oligomer with CA/TG doublet step before global melting but not in the oligomer with AC/GT doublet step, which may correspond to thermally induced unbending of the oligomer. These observations indicate that the CA/TG doublet junction at the 5' end of the oligo(A)-tract has a crucial role in modulating the overall curvature in DNA.

CAITG sequence at the 5' end of Oligo(A)-tracts strongly modulates DNA curvature

An analysis of the base pair doublet geometries in available crystal structures indicates that the often reported intrinsic curvature of DNA containing oligo-(d(A).d(T)) tracts may also depend on the nature of the flanking sequences. The presence of CA/TG doublet in particular at the 5' end of these tracts is expected to enhance their intrinsic bending property. To test this proposition, three oligonucleotides, d(GAAAAACCCCCC), d(CCCCCCAAAAAG), d(GAAAAATTTTTC), and their complementary sequences were synthesized to study the effect of various flanking sequences, at the 5' and 3' ends of the A-tracts, on the curvature of DNA in solution. An analysis of the polyacrylamide gel electrophoretic mobilities of these sequences under different conditions of salts and temperatures (below their melting points) clearly showed that the oligomer with CA/TG sequence in the center was always more retarded than the oligomer with AC/GT sequence, as well as the oligomer with AT/AT sequence. Hydroxyl radical probing of the sequences with AC/GT and CA/TG doublet junctions gives a similar cutting pattern in the A-tracts, which is quite different from that in the C-tracts, indicating that the oligo(A)-tracts have similar structures in the two oligomers. KMnO4 probing shows that the oligomer with a CA/TG doublet junction forms a kink that is responsible for its inherent curvature and unusual electrophoretic mobility. UV melting shows a reduced thermal stability of the duplex with CA/TG doublet junction, and circular dichroism (CD) studies indicate that a premelting transition occurs in the oligomer with CA/TG doublet step before global melting but not in the oligomer with AC/GT doublet step, which may correspond to thermally induced unbending of the oligomer. These observations indicate that the CA/TG doublet junction at the 5' end of the oligo(A)-tract has a crucial role in modulating the overall curvature in DNA.

Monte-Carlo estimation of time-dependent statistical characteristics of random dynamical systems

The problem of estimating the time-dependent statistical characteristics of a random dynamical system is studied under two different settings. In the first, the system dynamics is governed by a differential equation parameterized by a random parameter, while in the second, this is governed by a differential equation with an underlying parameter sequence characterized by a continuous time Markov chain. We propose, for the first time in the literature, stochastic approximation algorithms for estimating various time-dependent process characteristics of the system. In particular, we provide efficient estimators for quantities such as the mean, variance and distribution of the process at any given time as well as the joint distribution and the autocorrelation coefficient at different times. A novel aspect of our approach is that we assume that information on the parameter model (i.e., its distribution in the first case and transition probabilities of the Markov chain in the second) is not available in either case. This is unlike most other work in the literature that assumes availability of such information. Also, most of the prior work in the literature is geared towards analyzing the steady-state system behavior of the random dynamical system while our focus is on analyzing the time-dependent statistical characteristics which are in general difficult to obtain. We prove the almost sure convergence of our stochastic approximation scheme in each case to the true value of the quantity being estimated. We provide a general class of strongly consistent estimators for the aforementioned statistical quantities with regular sample average estimators being a specific instance of these. We also present an application of the proposed scheme on a widely used model in population biology. Numerical experiments in this framework show that the time-dependent process characteristics as obtained using our algorithm in each case exhibit excellent agreement with exact results. (C) 2010 Elsevier Inc. All rights reserved.

A polynomial bound on the number of light cycles in an undirected graph

Let G be an undirected graph with a positive real weight on each edge. It is shown that the number of minimum-weight cycles of G is bounded above by a polynomial in the number of edges of G. A similar bound holds if we wish to count the number of cycles with weight at most a constant multiple of the minimum weight of a cycle of G.

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.

Analysing Message Sequence Graph Specifications

We give a detailed construction of a finite-state transition system for a com-connected Message Sequence Graph. Though this result is well-known in the literature and forms the basis for the solution to several analysis and verification problems concerning MSG specifications, the constructions given in the literature are either not amenable to implementation, or imprecise, or simply incorrect. In contrast we give a detailed construction along with a proof of its correctness. Our transition system is amenable to implementation, and can also be used for a bounded analysis of general (not necessarily com-connected) MSG specifications.

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.

Performance Evaluation of Distance-Hop Proportionality on Geometric Graph Models of Dense Sensor Networks

Wireless sensor networks can often be viewed in terms of a uniform deployment of a large number of nodes on a region in Euclidean space, e.g., the unit square. After deployment, the nodes self-organise into a mesh topology. In a dense, homogeneous deployment, a frequently used approximation is to take the hop distance between nodes to be proportional to the Euclidean distance between them. In this paper, we analyse the performance of this approximation. We show that nodes with a certain hop distance from a fixed anchor node lie within a certain annulus with probability approach- ing unity as the number of nodes n → ∞. We take a uniform, i.i.d. deployment of n nodes on a unit square, and consider the geometric graph on these nodes with radius r(n) = c q ln n n . We show that, for a given hop distance h of a node from a fixed anchor on the unit square,the Euclidean distance lies within [(1−ǫ)(h−1)r(n), hr(n)],for ǫ > 0, with probability approaching unity as n → ∞.This result shows that it is more likely to expect a node, with hop distance h from the anchor, to lie within this an- nulus centred at the anchor location, and of width roughly r(n), rather than close to a circle whose radius is exactly proportional to h. We show that if the radius r of the ge- ometric graph is fixed, the convergence of the probability is exponentially fast. Similar results hold for a randomised lattice deployment. We provide simulation results that il- lustrate the theory, and serve to show how large n needs to be for the asymptotics to be useful.

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.