Rainbow connection number and connected dominating sets

The rainbow connection number of a connected graph is the minimum number of colors needed to color its edges, so that every pair of its vertices is connected by at least one path in which no two edges are colored the same. In this article we show that for every connected graph on n vertices with minimum degree delta, the rainbow connection number is upper bounded by 3n/(delta + 1) + 3. This solves an open problem from Schiermeyer (Combinatorial Algorithms, Springer, Berlin/Hiedelberg, 2009, pp. 432437), improving the previously best known bound of 20n/delta (J Graph Theory 63 (2010), 185191). This bound is tight up to additive factors by a construction mentioned in Caro et al. (Electr J Combin 15(R57) (2008), 1). As an intermediate step we obtain an upper bound of 3n/(delta + 1) - 2 on the size of a connected two-step dominating set in a connected graph of order n and minimum degree d. This bound is tight up to an additive constant of 2. This result may be of independent interest. We also show that for every connected graph G with minimum degree at least 2, the rainbow connection number, rc(G), is upper bounded by Gc(G) + 2, where Gc(G) is the connected domination number of G. Bounds of the form diameter(G)?rc(G)?diameter(G) + c, 1?c?4, for many special graph classes follow as easy corollaries from this result. This includes interval graphs, asteroidal triple-free graphs, circular arc graphs, threshold graphs, and chain graphs all with minimum degree delta at least 2 and connected. We also show that every bridge-less chordal graph G has rc(G)?3.radius(G). In most of these cases, we also demonstrate the tightness of the bounds.

Path-integral formulation for Levy flights: Evaluation of the propagator for free, linear, and harmonic potentials in the over- and underdamped limits

Levy flights can be described using a Fokker-Planck equation, which involves a fractional derivative operator in the position coordinate. Such an operator has its natural expression in the Fourier domain. Starting with this, we show that the solution of the equation can be written as a Hamiltonian path integral. Though this has been realized in the literature, the method has not found applications as the path integral appears difficult to evaluate. We show that a method in which one integrates over the position coordinates first, after which integration is performed over the momentum coordinates, can be used to evaluate several path integrals that are of interest. Using this, we evaluate the propagators for (a) free particle, (b) particle subjected to a linear potential, and (c) harmonic potential. In all the three cases, we have obtained results for both overdamped and underdamped cases. DOI: 10.1103/PhysRevE.86.061105

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).

Dual band(WLAN & WiMAX) suppressed harmonic microstrip filter with perturbed ground

Design of a dual band pass filter employing microstrip line with defected ground is presented in this paper. A dual band filter at 2.45GHz and 3.5GHz (covering WLAN and WiMAX) with 6% bandwidth has been designed at each frequency. Apertures in ground plane were used to improve the stop band rejection characteristics and coupling levels in the filter. Measured results of the experimental filter were compared against the simulation results for the purpose of validation.

A post processing technique for improved harmonic/percussion separation in polyphonic speech

In this paper we propose a postprocessing technique for a spectrogram diffusion based harmonic/percussion decom- position algorithm. The proposed technique removes har- monic instrument leakages in the percussion enhanced out- puts of the baseline algorithm. The technique uses median filtering and an adaptive detection of percussive segments in subbands followed by piecewise signal reconstruction using envelope properties to ensure that percussion is enhanced while harmonic leakages are suppressed. A new binary mask is created for the percussion signal which upon applying on the original signal improves harmonic versus percussion separation. We compare our algorithm with two recent techniques and show that on a database of polyphonic Indian music, the postprocessing algorithm improves the harmonic versus percussion decomposition significantly.

Coulomb-hole summations and energies for GW calculations with limited number of empty orbitals: a modified static remainder approach

Ab initio GW calculations are a standard method for computing the spectroscopic properties of many materials. The most computationally expensive part in conventional implementations of the method is the generation and summation over the large number of empty orbitals required to converge the electron self-energy. We propose a scheme to reduce the summation over empty states by the use of a modified static remainder approximation, which is simple to implement and yields accurate self-energies for both bulk and molecular systems requiring a small fraction of the typical number of empty orbitals.

Optimal design of timer-based, distributed selection with unknown number of nodes

The timer-based selection scheme is a popular, simple, and distributed scheme that is used to select the best node from a set of available nodes. In it, each node sets a timer as a function of a local preference number called a metric, and transmits a packet when its timer expires. The scheme ensures that the timer of the best node, which has the highest metric, expires first. However, it fails to select the best node if another node transmits a packet within Delta s of the transmission by the best node. We derive the optimal timer mapping that maximizes the average success probability for the practical scenario in which the number of nodes in the system is unknown but only its probability distribution is known. We show that it has a special discrete structure, and present a recursive characterization to determine it. We benchmark its performance with ad hoc approaches proposed in the literature, and show that it delivers significant gains. New insights about the optimality of some ad hoc approaches are also developed.

On the Chern number of I-admissible filtrations of ideals

Let I be an m-primary ideal of a Noetherian local ring (R, m) of positive dimension. The coefficient e(1)(I) of the Hilbert polynomial of an I-admissible filtration I is called the Chern number of I. A formula for the Chern number has been derived involving the Euler characteristic of subcomplexes of a Koszul complex. Specific formulas for the Chern number have been given in local rings of dimension at most two. These have been used to provide new and unified proofs of several results about e(1)(I).

A multifold reduction in the transition Reynolds number, and ultra-fast mixing, in a micro-channel due to a dynamical instability induced by a soft wall

A dynamical instability is observed in experimental studies on micro-channels of rectangular cross-section with smallest dimension 100 and 160 mu m in which one of the walls is made of soft gel. There is a spontaneous transition from an ordered, laminar flow to a chaotic and highly mixed flow state when the Reynolds number increases beyond a critical value. The critical Reynolds number, which decreases as the elasticity modulus of the soft wall is reduced, is as low as 200 for the softest wall used here (in contrast to 1200 for a rigid-walled channel) The instability onset is observed by the breakup of a dye-stream introduced in the centre of the micro-channel, as well as the onset of wall oscillations due to laser scattering from fluorescent beads embedded in the wall of the channel. The mixing time across a channel of width 1.5 mm, measured by dye-stream and outlet conductance experiments, is smaller by a factor of 10(5) than that for a laminar flow. The increased mixing rate comes at very little cost, because the pressure drop (energy requirement to drive the flow) increases continuously and modestly at transition. The deformed shape is reconstructed numerically, and computational fluid dynamics (CFD) simulations are carried out to obtain the pressure gradient and the velocity fields for different flow rates. The pressure difference across the channel predicted by simulations is in agreement with the experiments (within experimental errors) for flow rates where the dye stream is laminar, but the experimental pressure difference is higher than the simulation prediction after dye-stream breakup. A linear stability analysis is carried out using the parallel-flow approximation, in which the wall is modelled as a neo-Hookean elastic solid, and the simulation results for the mean velocity and pressure gradient from the CFD simulations are used as inputs. The stability analysis accurately predicts the Reynolds number (based on flow rate) at which an instability is observed in the dye stream, and it also predicts that the instability first takes place at the downstream converging section of the channel, and not at the upstream diverging section. The stability analysis also indicates that the destabilization is due to the modification of the flow and the local pressure gradient due to the wall deformation; if we assume a parabolic velocity profile with the pressure gradient given by the plane Poiseuille law, the flow is always found to be stable.

Effect of steady rotation on low Reynolds number vortex shedding behind a circular cylinder

In this paper control of oblique vortex shedding in the wake behind a straight circular cylinder is explored experimentally and computationally. Towards this, steady rotation of the cylinder about its axis is used as a control device. Some limited studies are also performed with a stepped circular cylinder, where at the step the flow is inevitably three-dimensional irrespective of the rotation rate. When there is no rotation, the vortex shedding pattern is three dimensional as described in many previous studies. With a non-zero rotation rate, it is demonstrated experimentally as well as numerically that the shedding pattern becomes more and more two-dimensional. At sufficiently high rotation rates, the vortex shedding is completely suppressed.

Effect of myonuclear number and mitochondrial fusion on Drosophila indirect flight muscle organization and size

Mechanisms involved in establishing the organization and numbers of fibres in a muscle are not completely understood. During Drosophila indirect flight muscle (IFM) formation, muscle growth is achieved by both incorporating hundreds of nuclei, and hypertrophy. As a result, IFMs provide a good model with which to understand the mechanisms that govern overall muscle organization and growth. We present a detailed analysis of the organization of dorsal longitudinal muscles (DLMs), a subset of the IFMs. We show that each DLM is similar to a vertebrate fascicle and consists of multiple muscle fibres. However, increased fascicle size does not necessarily change the number of constituent fibres, but does increase the number of myofibrils packed within the fibres. We also find that altering the number of myoblasts available for fusion changes DLM fascicle size and fibres are loosely packed with myofibrils. Additionally, we show that knock down of genes required for mitochondrial fusion causes a severe reduction in the size of DLM fascicles and fibres. Our results establish the organization levels of DLMs and highlight the importance of the appropriate number of nuclei and mitochondrial fusion in determining the overall organization, growth and size of DLMs. (C) 2013 Elsevier Inc. All rights reserved.

Floquet generation of Majorana end modes and topological invariants

We show how Majorana end modes can be generated in a one-dimensional system by varying some of the parameters in the Hamiltonian periodically in time. The specific model we consider is a chain containing spinless electrons with a nearest-neighbor hopping amplitude, a p-wave superconducting term, and a chemical potential; this is equivalent to a spin-1/2 chain with anisotropic XY couplings between nearest neighbors and a magnetic field applied in the (z) over cap direction. We show that varying the chemical potential (or magnetic field) periodically in time can produce Majorana modes at the ends of a long chain. We discuss two kinds of periodic driving, periodic delta-function kicks, and a simple harmonic variation with time. We discuss some distinctive features of the end modes such as the inverse participation ratio of their wave functions and their Floquet eigenvalues which are always equal to +/- 1 for time-reversal-symmetric systems. For the case of periodic delta-function kicks, we use the effective Hamiltonian of a system with periodic boundary conditions to define two topological invariants. The first invariant is a well-known winding number, while the second invariant has not appeared in the literature before. The second invariant is more powerful in that it always correctly predicts the numbers of end modes with Floquet eigenvalues equal to + 1 and -1, while the first invariant does not. We find that the number of end modes can become very large as the driving frequency decreases. We show that periodic delta-function kicks in the hopping and superconducting terms can also produce end modes. Finally, we study the effect of electron-phonon interactions (which are relevant at finite temperatures) and a random noise in the chemical potential on the Majorana modes.

Harmonic Analysis of DC-Link Capacitor Current in Sinusoidally Modulated Neutral-Point-Clamped Inverter

The voltage ripple and power loss in the DC-capacitor of a voltage source inverter depend on the harmonic currents flowing through the capacitor. This paper presents double Fourier series based harmonic analysis of DC capacitor current in a three-level neutral point clamped inverter, modulated with sine-triangle PWM. The analytical results are validated experimentally on a 5-kVA three-level inverter prototype. The results of the analysis are used for predicting the power loss in the DC capacitor.

EFFICIENT QUANTUM RANDOM NUMBER GENERATION USING QUANTUM INDISTINGUISHABILITY

In this paper, we propose a quantum method for generation of random numbers based on bosonic stimulation. Randomness arises through the path-dependent indeterministic amplification of two competing bosonic modes. We show that the process provides an efficient method for macroscopic extraction of microscopic randomness.

Optimal Timer-Based Best Node Selection for Wireless Systems with Unknown Number of Nodes

The distributed, low-feedback, timer scheme is used in several wireless systems to select the best node from the available nodes. In it, each node sets a timer as a function of a local preference number called a metric, and transmits a packet when its timer expires. The scheme ensures that the timer of the best node, which has the highest metric, expires first. However, it fails to select the best node if another node transmits a packet within Delta s of the transmission by the best node. We derive the optimal metric-to-timer mappings for the practical scenario where the number of nodes is unknown. We consider two cases in which the probability distribution of the number of nodes is either known a priori or is unknown. In the first case, the optimal mapping maximizes the success probability averaged over the probability distribution. In the second case, a robust mapping maximizes the worst case average success probability over all possible probability distributions on the number of nodes. Results reveal that the proposed mappings deliver significant gains compared to the mappings considered in the literature.