On the SIG-dimension of trees under the L (a)-metric

Let where be a set of points in d-dimensional space with a given metric rho. For a point let r (p) be the distance of p with respect to rho from its nearest neighbor in Let B(p,r (p) ) be the open ball with respect to rho centered at p and having the radius r (p) . We define the sphere-of-influence graph (SIG) of as the intersection graph of the family of sets Given a graph G, a set of points in d-dimensional space with the metric rho is called a d-dimensional SIG-representation of G, if G is isomorphic to the SIG of It is known that the absence of isolated vertices is a necessary and sufficient condition for a graph to have a SIG-representation under the L (a)-metric in some space of finite dimension. The SIG-dimension under the L (a)-metric of a graph G without isolated vertices is defined to be the minimum positive integer d such that G has a d-dimensional SIG-representation under the L (a)-metric. It is denoted by SIG (a)(G). We study the SIG-dimension of trees under the L (a)-metric and almost completely answer an open problem posed by Michael and Quint (Discrete Appl Math 127:447-460, 2003). Let T be a tree with at least two vertices. For each let leaf-degree(v) denote the number of neighbors of v that are leaves. We define the maximum leaf-degree as leaf-degree(x). Let leaf-degree{(v) = alpha}. If |S| = 1, we define beta(T) = alpha(T) - 1. Otherwise define beta(T) = alpha(T). We show that for a tree where beta = beta (T), provided beta is not of the form 2 (k) - 1, for some positive integer k a parts per thousand yen 1. If beta = 2 (k) - 1, then We show that both values are possible.

Simulations and experiments in punching spring-steel devices with sub-millimeter features

This work demonstrates the feasibility of mesoscale (100 μm to mm) punching of multiple holes of intricate shapes in metals. Analytical modeling, finite element (FE)simulation, and experimentations are used in this work. Two dimensional FE simulations in ABAQUS were done with an assumed material modeling and plane-strain condition. A known analytical model was used and compared with the ABAQUS simulation results to understand the effects of clearance between the punch and the die. FE simulation in ABAQUS was done for different clearances and corner radii at punch, die, and holder. A set of punches and dies were used to punch out a miniature spring-steel gripper. Comparison of compliant grippers manufactured by wire-cut electro discharge machining(EDM) and punching shows that realizing sharp interior and re-entrant corners by punching is not easy to achieve. Punching of circular holes with 5 mm and 2.5 mm diameter is achieved. The possibility of realizing meso-scale parts with complicated shapes through punching is demonstrated in this work; and some strategies are suggested for improvement.

Local Structural and Environmental Factors Define the Efficiency of an RNA Pseudoknot Involved in Programmed Ribosomal Frameshift Process

In programmed -1 ribosomal frameshift, an RNA pseudoknot stalls the ribosome at specific sequence and restarts translation in a new reading frame. A precise understanding of structural characteristics of these pseudoknots and their PRF inducing ability has not been clear to date. To investigate this phenomenon, we have studied various structural aspects of a -1 PRF inducing RNA pseudoknot from BWYV using extensive molecular dynamics simulations. A set of functional and poorly functional forms, for which previous mutational data were available, were chosen for analysis. These structures differ from each other by either single base substitutions or base-pair replacements from the native structure. We have rationalized how certain mutations in RNA pseudoknot affect its function; e.g., a specific base substitution in loop 2 stabilizes the junction geometry by forming multiple noncanonical hydrogen bonds, leading to a highly rigid structure that could effectively resist ribosome-induced unfolding, thereby increasing efficiency. While, a CG to AU pair substitution in stem 1 leads to loss of noncanonical hydrogen bonds between stems and loop, resulting in a less stable structure and reduced PRF inducing ability, inversion of a pair in stem 2 alters specific base-pair geometry that might be required in ribosomal recognition of nucleobase groups, negatively affecting pseudoknot functioning. These observations illustrate that the ability of an RNA pseudoknot to induce -1 PRF with an optimal rate depends on several independent factors that contribute to either the local conformational variability or geometry

Rainbow Connection Number of Graph Power and Graph Products

Rainbow connection number, rc(G), of a connected graph G is the minimum number of colors needed to color its edges so that every pair of vertices is connected by at least one path in which no two edges are colored the same (note that the coloring need not be proper). In this paper we study the rainbow connection number with respect to three important graph product operations (namely the Cartesian product, the lexicographic product and the strong product) and the operation of taking the power of a graph. In this direction, we show that if G is a graph obtained by applying any of the operations mentioned above on non-trivial graphs, then rc(G) a parts per thousand currency sign 2r(G) + c, where r(G) denotes the radius of G and . In general the rainbow connection number of a bridgeless graph can be as high as the square of its radius 1]. This is an attempt to identify some graph classes which have rainbow connection number very close to the obvious lower bound of diameter (and thus the radius). The bounds reported are tight up to additive constants. The proofs are constructive and hence yield polynomial time -factor approximation algorithms.

A nodal domain theorem for integrable billiards in two dimensions

Eigenfunctions of integrable planar billiards are studied - in particular, the number of nodal domains, nu of the eigenfunctions with Dirichlet boundary conditions are considered. The billiards for which the time-independent Schrodinger equation (Helmholtz equation) is separable admit trivial expressions for the number of domains. Here, we discover that for all separable and nonseparable integrable billiards, nu satisfies certain difference equations. This has been possible because the eigenfunctions can be classified in families labelled by the same value of m mod kn, given a particular k, for a set of quantum numbers, m, n. Further, we observe that the patterns in a family are similar and the algebraic representation of the geometrical nodal patterns is found. Instances of this representation are explained in detail to understand the beauty of the patterns. This paper therefore presents a mathematical connection between integrable systems and difference equations. (C) 2014 Elsevier Inc. All rights reserved.

How mutualisms between plants and insects are stabilized

While the idea of cooperation between individuals of a species has received considerable attention, how mutualistic interactions between species can be protected from cheating by partners in the interaction has only recently been examined from theoretical and empirical perspectives. This paper is a selective review of the recent literature on host sanctions, partner-fidelity feedback and the concept of punishment in such mutualisms. It describes new ideas, borrowed from microeconomics, such as screening theory with and without competition between potential partners for a host. It explores mutualism-stabilizing mechanisms using examples from interactions between figs and fig wasps, and those between ants and plants. It suggests new avenues for research.

Minimum-Error-Probability CFO Estimation for Multiuser MIMO-OFDM Systems

We consider carrier frequency offset (CFO) estimation in the context of multiple-input multiple-output (MIMO) orthogonal frequency-division multiplexing (OFDM) systems over noisy frequency-selective wireless channels with both single- and multiuser scenarios. We conceived a new approach for parameter estimation by discretizing the continuous-valued CFO parameter into a discrete set of bins and then invoked detection theory, analogous to the minimum-bit-error-ratio optimization framework for detecting the finite-alphabet received signal. Using this radical approach, we propose a novel CFO estimation method and study its performance using both analytical results and Monte Carlo simulations. We obtain expressions for the variance of the CFO estimation error and the resultant BER degradation with the single- user scenario. Our simulations demonstrate that the overall BER performance of a MIMO-OFDM system using the proposed method is substantially improved for all the modulation schemes considered, albeit this is achieved at increased complexity.

On Locally Gabriel Geometric Graphs

Let be a set of points in the plane. A geometric graph on is said to be locally Gabriel if for every edge in , the Euclidean disk with the segment joining and as diameter does not contain any points of that are neighbors of or in . A locally Gabriel graph(LGG) is a generalization of Gabriel graph and is motivated by applications in wireless networks. Unlike a Gabriel graph, there is no unique LGG on a given point set since no edge in a LGG is necessarily included or excluded. Thus the edge set of the graph can be customized to optimize certain network parameters depending on the application. The unit distance graph(UDG), introduced by Erdos, is also a LGG. In this paper, we show the following combinatorial bounds on edge complexity and independent sets of LGG: (i) For any , there exists LGG with edges. This improves upon the previous best bound of . (ii) For various subclasses of convex point sets, we show tight linear bounds on the maximum edge complexity of LGG. (iii) For any LGG on any point set, there exists an independent set of size .

Renormalization group invariants and sum rules in the deflected mirage mediation supersymmetry breaking

We examine the deflected mirage mediation supersymmetry breaking (DMMSB) scenario, which combines three supersymmetry breaking scenarios, namely anomaly mediation, gravity mediation and gauge mediation using the one-loop renormalization group invariants (RGIs). We examine the effects on the RGIs at the threshold where the gauge messengers emerge, and derive the supersymmetry breaking parameters in terms of the RGIs. We further discuss whether the supersymmetry breaking mediation mechanism can be determined using a limited set of invariants, and derive sum rules valid for DMMSB below the gauge messenger scale. In addition we examine the implications of the measured Higgs mass for the DMMSB spectrum.

Unique Covering Problems with Geometric Sets

The Exact Cover problem takes a universe U of n elements, a family F of m subsets of U and a positive integer k, and decides whether there exists a subfamily(set cover) F' of size at most k such that each element is covered by exactly one set. The Unique Cover problem also takes the same input and decides whether there is a subfamily F' subset of F such that at least k of the elements F' covers are covered uniquely(by exactly one set). Both these problems are known to be NP-complete. In the parameterized setting, when parameterized by k, Exact Cover is W1]-hard. While Unique Cover is FPT under the same parameter, it is known to not admit a polynomial kernel under standard complexity-theoretic assumptions. In this paper, we investigate these two problems under the assumption that every set satisfies a given geometric property Pi. Specifically, we consider the universe to be a set of n points in a real space R-d, d being a positive integer. When d = 2 we consider the problem when. requires all sets to be unit squares or lines. When d > 2, we consider the problem where. requires all sets to be hyperplanes in R-d. These special versions of the problems are also known to be NP-complete. When parameterizing by k, the Unique Cover problem has a polynomial size kernel for all the above geometric versions. The Exact Cover problem turns out to be W1]-hard for squares, but FPT for lines and hyperplanes. Further, we also consider the Unique Set Cover problem, which takes the same input and decides whether there is a set cover which covers at least k elements uniquely. To the best of our knowledge, this is a new problem, and we show that it is NP-complete (even for the case of lines). In fact, the problem turns out to be W1]-hard in the abstract setting, when parameterized by k. However, when we restrict ourselves to the lines and hyperplanes versions, we obtain FPT algorithms.

In-plane elastic responses of circular cell honeycombs and bundled circular tubes in a diamond array structure

Assemblages of circular tubes and circular honeycombs in close packed arrangement are presently both competing and complementing regular honeycomb structures (HCS). The intrinsic isotropy of bundled tubes/rings in hexagonal arrays restricts their use to applications with isotopic need. With the aim of extending the utility of tubes/rings assemblages to anisotropic needs, this paper explores the prospects of bundled tubes and circular honeycombs in a general diamond array structure (DAS) to cater these needs. To this end, effective transverse Young's moduli and Poisson's ratio for thick/thin DAS are obtained theoretically. Analysis frameworks including thin ring theory (TRT), curved beam theory (CBT) and elasticity formulations are tested and corroborated by FEA employing contact elements. Results indicate that TRT and CBT are reasonable for thin tubes and honeycombs. Nevertheless, TRT yields compact formulae to study the anisotropy ratio, moduli spectrum and sensitivity of the assemblage as a function of thicknesses and array structure. These formulae supplement designers as a guide to tailor the structures. On the other hand, elasticity formulation can estimate over a larger range including very thick tubes/rings. In addition, this formulation offers to estimate refined transverse strengths of assemblages. (C) 2015 Elsevier Ltd. All rights reserved.