Integer Sequence window based Reconfigurable FIR filters

Conventional hardware implementation techniques for FIR filters require the computation of filter coefficients in software and have them stored in memory. This approach is static in the sense that any further fine tuning of the filter requires computation of new coefficients in software. In this paper, we propose an alternate technique for implementing FIR filters in hardware. We store a considerably large number of impulse response coefficients of the ideal filter (having box type frequency response) in memory. We then do the windowing process, on these coefficients, in hardware using integer sequences as window functions. The integer sequences are also generated in hardware. This approach offers the flexibility in fine tuning the filter, like varying the transition bandwidth around a particular cutoff frequency.

Modeling wrap faced reinforced soil retaining walls subjected to dynamic excitation

This paper describes some of the physical and numerical model tests of reinforced soil retaining walls subjected to dynamic excitation through uni-axial shaking tests. Models of retaining walls are constructed in a perspex box with geotextile reinforcement using the wrap around technique with dry sand backfill and instrumented with displacement sensors, accelerometers and soil pressure sensors. Numerical modelling of these shaking table tests is carried using FLAC. Numerical model is validated by comparing physical model results. Responses of wrap faced walls with different number of reinforcement layers are discussed from both the physical and numerical model tests. Results showed that the displacements are decreasing with the increase in number of reinforcement layers while acceleration amplifications are not affected significantly.

Boxicity of line graphs

The boxicity of a graph H, denoted by box(H), is the minimum integer k such that H is an intersection graph of axis-parallel k-dimensional boxes in R(k). In this paper we show that for a line graph G of a multigraph, box(G) <= 2 Delta (G)(inverted right perpendicularlog(2) log(2) Delta(G)inverted left perpendicular + 3) + 1, where Delta(G) denotes the maximum degree of G. Since G is a line graph, Delta(G) <= 2(chi (G) - 1), where chi (G) denotes the chromatic number of G, and therefore, box(G) = 0(chi (G) log(2) log(2) (chi (G))). For the d-dimensional hypercube Q(d), we prove that box(Q(d)) >= 1/2 (inverted right perpendicularlog(2) log(2) dinverted left perpendicular + 1). The question of finding a nontrivial lower bound for box(Q(d)) was left open by Chandran and Sivadasan in [L. Sunil Chandran, Naveen Sivadasan, The cubicity of Hypercube Graphs. Discrete Mathematics 308 (23) (2008) 5795-5800]. The above results are consequences of bounds that we obtain for the boxicity of a fully subdivided graph (a graph that can be obtained by subdividing every edge of a graph exactly once). (C) 2011 Elsevier B.V. All rights reserved.

Boxicity of Circular Arc Graphs

A k-dimensional box is a Cartesian product R(1)x...xR(k) where each R(i) is a closed interval on the real line. The boxicity of a graph G, denoted as box(G), is the minimum integer k such that G can be represented as the intersection graph of a collection of k-dimensional boxes. That is, two vertices are adjacent if and only if their corresponding boxes intersect. A circular arc graph is a graph that can be represented as the intersection graph of arcs on a circle. We show that if G is a circular arc graph which admits a circular arc representation in which no arc has length at least pi(alpha-1/alpha) for some alpha is an element of N(>= 2), then box(G) <= alpha (Here the arcs are considered with respect to a unit circle). From this result we show that if G has maximum degree Delta < [n(alpha-1)/2 alpha] for some alpha is an element of N(>= 2), then box(G) <= alpha. We also demonstrate a graph having box(G) > alpha but with Delta = n (alpha-1)/2 alpha + n/2 alpha(alpha+1) + (alpha+2). For a proper circular arc graph G, we show that if Delta < [n(alpha-1)/alpha] for some alpha is an element of N(>= 2), then box(G) <= alpha. Let r be the cardinality of the minimum overlap set, i.e. the minimum number of arcs passing through any point on the circle, with respect to some circular arc representation of G. We show that for any circular arc graph G, box(G) <= r + 1 and this bound is tight. We show that if G admits a circular arc representation in which no family of k <= 3 arcs covers the circle, then box(G) <= 3 and if G admits a circular arc representation in which no family of k <= 4 arcs covers the circle, then box(G) <= 2. We also show that both these bounds are tight.

Plane wave analysis of rectangular axial-inlet, axial-outlet and transverse-inlet, transverse-outlet air cleaners

In this work, one-dimensional flow-acoustic analysis of two basic configurations of air cleaners, (i) Rectangular Axial-Inlet, Axial-Outlet (RAIAO) and (ii) Rectangular Transverse-Inlet, Transverse-Outlet (RTITO), has been presented. This 1-D analytical approach has been verified with the help of 3-D FEM based software. Through subtraction of the acoustic performance of the bare plenum (without filter element) from that of the complete air cleaner box, the solitary performance of the filter element has been evaluated. Part of the present analysis illustrates that the analytical formulation remains effective even with offset positioning of the air pipes from the centre of the cross section of the air cleaner. The 1-D analytical tool computes much faster than its 3-D simulation counterpart. The present analysis not only predicts the acoustical impact of mean flow, but it also depicts the scenario with increased resistance of the filter element. Thus, the proposed 1-D analysis would help in the design of acoustically efficient air cleaners for automotive applications. (C) 2011 Institute of Noise Control Engineering.

Geometric representations of graphs in low dimension

We give an efficient randomized algorithm to construct a box representation of any graph G on n vertices in $1.5 (\Delta + 2) \ln n$ dimensions, where $\Delta$ is the maximum degree of G. We also show that $\boxi(G) \le (\Delta + 2) \ln n$ for any graph G. Our bound is tight up to a factor of $\ln n$. We also show that our randomized algorithm can be derandomized to get a polynomial time deterministic algorithm. Though our general upper bound is in terms of maximum degree $\Delta$, we show that for almost all graphs on n vertices, its boxicity is upper bound by $c\cdot(d_{av} + 1) \ln n$ where d_{av} is the average degree and c is a small constant. Also, we show that for any graph G, $\boxi(G) \le \sqrt{8 n d_{av} \ln n}$, which is tight up to a factor of $b \sqrt{\ln n}$ for a constant b.

Collision Cones for Quadric Surfaces

The problem of collision prediction in dynamic environments appears in several diverse fields, which include robotics, air vehicles, underwater vehicles, and computer animation. In this paper, collision prediction of objects that move in 3-D environments is considered. Most work on collision prediction assumes objects to be modeled as spheres. However, there are many instances of object shapes where an ellipsoidal or a hyperboloid-like bounding box would be more appropriate. In this paper, a collision cone approach is used to determine collision between objects whose shapes can be modeled by general quadric surfaces. Exact collision conditions for such quadric surfaces are obtained in the form of analytical expressions in the relative velocity space. For objects of arbitrary shapes, exact representations of planar sections of the 3-D collision cone are obtained.

Boxicity and Poset Dimension

Let G be a simple, undirected, finite graph with vertex set V (G) and edge set E(G). A k-dimensional box is a Cartesian product of closed intervals [a(1), b(1)] x [a(2), b(2)] x ... x [a(k), b(k)]. The boxicity of G, box(G), is the minimum integer k such that G can be represented as the intersection graph of k-dimensional boxes; i.e., each vertex is mapped to a k-dimensional box and two vertices are adjacent in G if and only if their corresponding boxes intersect. Let P = (S, P) be a poset, where S is the ground set and P is a reflexive, antisymmetric and transitive binary relation on S. The dimension of P, dim(P), is the minimum integer t such that P can be expressed as the intersection of t total orders. Let G(P) be the underlying comparability graph of P; i.e., S is the vertex set and two vertices are adjacent if and only if they are comparable in P. It is a well-known fact that posets with the same underlying comparability graph have the same dimension. The first result of this paper links the dimension of a poset to the boxicity of its underlying comparability graph. In particular, we show that for any poset P, box(G(P))/(chi(G(P)) - 1) <= dim(P) <= 2box(G(P)), where chi(G(P)) is the chromatic number of G(P) and chi(G(P)) not equal 1. It immediately follows that if P is a height-2 poset, then box(G(P)) <= dim(P) <= 2box(G(P)) since the underlying comparability graph of a height-2 poset is a bipartite graph. The second result of the paper relates the boxicity of a graph G with a natural partial order associated with the extended double cover of G, denoted as G(c): Note that G(c) is a bipartite graph with partite sets A and B which are copies of V (G) such that, corresponding to every u is an element of V (G), there are two vertices u(A) is an element of A and u(B) is an element of B and {u(A), v(B)} is an edge in G(c) if and only if either u = v or u is adjacent to v in G. Let P(c) be the natural height-2 poset associated with G(c) by making A the set of minimal elements and B the set of maximal elements. We show that box(G)/2 <= dim(P(c)) <= 2box(G) + 4. These results have some immediate and significant consequences. The upper bound dim(P) <= 2box(G(P)) allows us to derive hitherto unknown upper bounds for poset dimension such as dim(P) = 2 tree width (G(P)) + 4, since boxicity of any graph is known to be at most its tree width + 2. In the other direction, using the already known bounds for partial order dimension we get the following: (1) The boxicity of any graph with maximum degree Delta is O(Delta log(2) Delta), which is an improvement over the best-known upper bound of Delta(2) + 2. (2) There exist graphs with boxicity Omega(Delta log Delta). This disproves a conjecture that the boxicity of a graph is O(Delta). (3) There exists no polynomial-time algorithm to approximate the boxicity of a bipartite graph on n vertices with a factor of O(n(0.5-is an element of)) for any is an element of > 0 unless NP = ZPP.

Insights into differential modulation of receptor function by hinge region using novel agonistic lutropin receptor and inverse agonistic thyrotropin receptor antibodies

We report two antibodies, scFv 13B1 and MAb PD1.37, against the hinge regions of LHR and TSHR, respectively, which have similar epitopes but different effects on receptor function. While neither of them affected hormone binding, with marginal effects on hormone response, scFv 13B1 stimulated LHR in a dose-dependent manner, whereas MAb PD1.37 acted as an inverse agonist of TSHR. Moreover, PD1.37 could decrease the basal activity of hinge region CAMs, but had varied effects on those present in ECLs, whereas 13B1 was refractory to any CAMs in LHR. Using truncation mutants and peptide phage display, we compared the differential roles of the hinge region cysteine box-2/3 as well as the exoloops in the activation of these two homologus receptors. (C) 2012 Federation of European Biochemical Societies. Published by Elsevier B.V. All rights reserved.

Generalization of the collision cone approach for motion safety in 3-D environments

Avoidance of collision between moving objects in a 3-D environment is fundamental to the problem of planning safe trajectories in dynamic environments. This problem appears in several diverse fields including robotics, air vehicles, underwater vehicles and computer animation. Most of the existing literature on collision prediction assumes objects to be modelled as spheres. While the conservative spherical bounding box is valid in many cases, in many other cases, where objects operate in close proximity, a less conservative approach, that allows objects to be modelled using analytic surfaces that closely mimic the shape of the object, is more desirable. In this paper, a collision cone approach (previously developed only for objects moving on a plane) is used to determine collision between objects, moving in 3-D space, whose shapes can be modelled by general quadric surfaces. Exact collision conditions for such quadric surfaces are obtained and used to derive dynamic inversion based avoidance strategies.

Ultrasound Assisted Optical Tomography: Estimation of phase Shift experienced by photon on transit through US insonified region for detection of breast tumor

A Monte Carlo model of ultrasound modulation of multiply scattered coherent light in a highly scattering media has been carried out for estimating the phase shift experienced by a photon beam on its transit through US insonified region. The phase shift is related to the tissue stiffness, thereby opening an avenue for possible breast tumor detection. When the scattering centers in the tissue medium is exposed to a deterministic forcing with the help of a focused ultrasound (US) beam, due to the fact that US-induced oscillation is almost along particular direction, the direction defined by the transducer axis, the scattering events increase, thereby increasing the phase shift experienced by light that traverses through the medium. The phase shift is found to increase with increase in anisotropy g of the medium. However, as the size of the focused region which is the region of interest (ROI) increases, a large number of scattering events take place within the ROI, the ensemble average of the phase shift (Delta phi) becomes very close to zero. The phase of the individual photon is randomly distributed over 2 pi when the scattered photon path crosses a large number of ultrasound wavelengths in the focused region. This is true at high ultrasound frequency (1 MHz) when mean free path length of photon l(s) is comparable to wavelength of US beam. However, at much lower US frequencies (100 Hz), the wavelength of sound is orders of magnitude larger than l(s), and with a high value of g (g 0.9), there is a distinct measurable phase difference for the photon that traverses through the insonified region. Experiments are carried out for validation of simulation results.

Genetic analysis of an Indian family with members affected with Waardenburg syndrome and Duchenne muscular dystrophy

Purpose: Waardenburg syndrome (WS) is characterized by sensorineural hearing loss and pigmentation defects of the eye, skin, and hair. It is caused by mutations in one of the following genes: PAX3 (paired box 3), MITF (microphthalmia-associated transcription factor), EDNRB (endothelin receptor type B), EDN3 (endothelin 3), SNAI2 (snail homolog 2, Drosophila) and SOX10 (SRY-box containing gene 10). Duchenne muscular dystrophy (DMD) is an X-linked recessive disorder caused by mutations in the DMD gene. The purpose of this study was to identify the genetic causes of WS and DMD in an Indian family with two patients: one affected with WS and DMD, and another one affected with only WS. Methods: Blood samples were collected from individuals for genomic DNA isolation. To determine the linkage of this family to the eight known WS loci, microsatellite markers were selected from the candidate regions and used to genotype the family. Exon-specific intronic primers for EDN3 were used to amplify and sequence DNA samples from affected individuals to detect mutations. A mutation in DMD was identified by multiplex PCR and multiplex ligation-dependent probe amplification method using exon-specific probes. Results: Pedigree analysis suggested segregation of WS as an autosomal recessive trait in the family. Haplotype analysis suggested linkage of the family to the WS4B (EDN3) locus. DNA sequencing identified a novel missense mutation p.T98M in EDN3. A deletion mutation was identified in DMD. Conclusions: This study reports a novel missense mutation in EDN3 and a deletion mutation in DMD in the same Indian family. The present study will be helpful in genetic diagnosis of this family and increases the mutation spectrum of EDN3.

Plasmodium falciparum Prp16 homologue and its role in splicing

Large numbers of Plasmodium genes have been predicted to have introns. However, little information exists on the splicing mechanisms in this organism. Here, we describe the DExD/DExH-box containing Pre-mRNA processing proteins (Prps), PfPrp2p, PfPrp5p, PfPrp16p, PfPrp22p, PfPrp28p, PfPrp43p and PfBrr2p, present in the Plasmodium falciparum genome and characterized the role of one of these factors, PfPrp16p. It is a member of DEAH-box protein family with nine collinear sequence motifs, a characteristic of helicase proteins. Experiments with the recombinantly expressed and purified PfPrp16 helicase domain revealed binding to RNA, hydrolysis of ATP as well as catalytic helicase activities. Expression of helicase domain with the C-terminal helicase-associated domain (HA2) reduced these activities considerably, indicating that the helicase-associated domain may regulate the PfPrp16 function. Localization studies with the PfPrp16 GFP transgenic lines suggested a role of its N-terminal domain (1-80 amino acids) in nuclear targeting. Immunodepletion of PfPrp16p, from nuclear extracts of parasite cultures, blocked the second catalytic step of an in vitro constituted splicing reaction suggesting a role for PfPrp16p in splicing catalysis. Further we show by complementation assay in yeast that a chimeric yeast-Plasmodium Prp16 protein, not the full length PfPrp16, can rescue the yeast prp16 temperature-sensitive mutant. These results suggest that although the role of Prp16p in catalytic step II is highly conserved among Plasmodium, human and yeast, subtle differences exist with regards to its associated factors or its assembly with spliceosomes. (C) 2012 Elsevier B.V. All rights reserved.

A constant factor approximation algorithm for boxicity of circular arc graphs

Boxicity of a graph G(V, E) is the minimum integer k such that G can be represented as the intersection graph of k-dimensional axis parallel boxes in Rk. Equivalently, it is the minimum number of interval graphs on the vertex set V such that the intersection of their edge sets is E. It is known that boxicity cannot be approximated even for graph classes like bipartite, co-bipartite and split graphs below O(n0.5-ε)-factor, for any ε > 0 in polynomial time unless NP = ZPP. Till date, there is no well known graph class of unbounded boxicity for which even an nε-factor approximation algorithm for computing boxicity is known, for any ε < 1. In this paper, we study the boxicity problem on Circular Arc graphs - intersection graphs of arcs of a circle. We give a (2+ 1/k)-factor polynomial time approximation algorithm for computing the boxicity of any circular arc graph along with a corresponding box representation, where k ≥ 1 is its boxicity. For Normal Circular Arc(NCA) graphs, with an NCA model given, this can be improved to an additive 2-factor approximation algorithm. The time complexity of the algorithms to approximately compute the boxicity is O(mn+n2) in both these cases and in O(mn+kn2) which is at most O(n3) time we also get their corresponding box representations, where n is the number of vertices of the graph and m is its number of edges. The additive 2-factor algorithm directly works for any Proper Circular Arc graph, since computing an NCA model for it can be done in polynomial time.

Cubicity, degeneracy, and crossing number

A $k$-box $B=(R_1,...,R_k)$, where each $R_i$ is a closed interval on the real line, is defined to be the Cartesian product $R_1\times R_2\times ...\times R_k$. If each $R_i$ is a unit length interval, we call $B$ a $k$-cube. Boxicity of a graph $G$, denoted as $\boxi(G)$, is the minimum integer $k$ such that $G$ is an intersection graph of $k$-boxes. Similarly, the cubicity of $G$, denoted as $\cubi(G)$, is the minimum integer $k$ such that $G$ is an intersection graph of $k$-cubes. It was shown in [L. Sunil Chandran, Mathew C. Francis, and Naveen Sivadasan: Representing graphs as the intersection of axis-parallel cubes. MCDES-2008, IISc Centenary Conference, available at CoRR, abs/cs/ 0607092, 2006.] that, for a graph $G$ with maximum degree $\Delta$, $\cubi(G)\leq \lceil 4(\Delta +1)\log n\rceil$. In this paper, we show that, for a $k$-degenerate graph $G$, $\cubi(G) \leq (k+2) \lceil 2e \log n \rceil$. Since $k$ is at most $\Delta$ and can be much lower, this clearly is a stronger result. This bound is tight. We also give an efficient deterministic algorithm that runs in $O(n^2k)$ time to output a $8k(\lceil 2.42 \log n\rceil + 1)$ dimensional cube representation for $G$. An important consequence of the above result is that if the crossing number of a graph $G$ is $t$, then $\boxi(G)$ is $O(t^{1/4}{\lceil\log t\rceil}^{3/4})$ . This bound is tight up to a factor of $O((\log t)^{1/4})$. We also show that, if $G$ has $n$ vertices, then $\cubi(G)$ is $O(\log n + t^{1/4}\log t)$. Using our bound for the cubicity of $k$-degenerate graphs we show that cubicity of almost all graphs in $\mathcal{G}(n,m)$ model is $O(d_{av}\log n)$, where $d_{av}$ denotes the average degree of the graph under consideration. model is O(davlogn).