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.

Bipartite Powers of k-chordal Graphs

Let k be an integer and k >= 3. A graph G is k-chordal if G does not have an induced cycle of length greater than k. From the definition it is clear that 3-chordal graphs are precisely the class of chordal graphs. Duchet proved that, for every positive integer m, if G m is chordal then so is G(m+2). Brandst `` adt et al. in Andreas Brandsadt, Van Bang Le, and Thomas Szymczak. Duchet- type theorems for powers of HHD- free graphs. Discrete Mathematics, 177(1- 3): 9- 16, 1997.] showed that if G m is k - chordal, then so is G(m+2). Powering a bipartite graph does not preserve its bipartitedness. In order to preserve the bipartitedness of a bipartite graph while powering Chandran et al. introduced the notion of bipartite powering. This notion was introduced to aid their study of boxicity of chordal bipartite graphs. The m - th bipartite power G(m]) of a bipartite graph G is the bipartite graph obtained from G by adding edges (u; v) where d G (u; v) is odd and less than or equal to m. Note that G(m]) = G(m+1]) for each odd m. In this paper we show that, given a bipartite graph G, if G is k-chordal then so is G m], where k, m are positive integers with k >= 4

On interference alignment for symmetrically connected interference networks with line of sight channels at finite powers

In this work, interference alignment for a class of Gaussian interference networks with general message demands, having line of sight (LOS) channels, at finite powers is considered. We assume that each transmitter has one independent message to be transmitted and the propagation delays are uniformly distributed between 0 and (L - 1) (L >; 0). If receiver-j, j ∈{1,2,..., J}, requires the message of transmitter-i, i ∈ {1, 2, ..., K}, we say (i, j) belongs to a connection. A class of interference networks called the symmetrically connected interference network is defined as a network where, the number of connections required at each transmitter-i is equal to ct for all i and the number of connections required at each receiver-j is equal to cr for all j, for some fixed positive integers ct and cr. For such networks with a LOS channel between every transmitter and every receiver, we show that an expected sum-spectral efficiency (in bits/sec/Hz) of at least K/(e+c1-1)(ct+1) (ct/ct+1)ct log2 (1+min(i, j)∈c|hi, j|2 P/WN0) can be achieved as the number of transmitters and receivers tend to infinity, i.e., K, J →∞ where, C denotes the set of all connections, hij is the channel gain between transmitter-i and receiver-j, P is the average power constraint at each transmitter, W is the bandwidth and N0 W is the variance of Gaussian noise at each receiver. This means that, for an LOS symmetrically connected interference network, at any finite power, the total spectral efficiency can grow linearly with K as K, J →∞. This is achieved by extending the time domain interference alignment scheme proposed by Grokop et al. for the k-user Gaussian interference channel to interference networks.

Analysis of OSNR Requirements for Higher Modulation Schemes for Various Local Oscillator Powers

To meet the growing demands of data traffic in long haul communication, it is necessary to efficiently use the low-loss region(C-band) of the optical spectrum, by increasing the no. of optical channels and increasing the bit rate on each channel But narrow pulses occupy higher spectral bandwidth. To circumvent this problem, higher order modulation schemes such as QPSK and QAM can be used to modulate the bits, which increases the spectral efficiency without demanding any extra spectral bandwidth. On the receiver side, to meet a satisfy, a given BER, the received optical signal requires to have minimum OSNR. In our study in this paper, we analyses for different modulation schemes, the OSNR required with and without preamplifier. The theoretical limit of OSNR requirement for a modulation scheme is compared for a given link length by varying the local oscillator (LO) power. Our analysis shows that as we increase the local oscillator (LO) power, the OSNR requirement decreases for a given BER. Also a combination of preamplifier and local oscillator (LO) gives the OSNR closest to theoretical limit.

Lower Bounds for Sums of Powers of Low Degree Univariates

We consider the problem of representing a univariate polynomial f(x) as a sum of powers of low degree polynomials. We prove a lower bound of Omega(root d/t) for writing an explicit univariate degree-d polynomial f(x) as a sum of powers of degree-t polynomials.

Defect-selective photothermal imaging: a sensitive tool for damage mapping in optical coatings

A defect-selective photothermal imaging system for the diagnostics of optical coatings is demonstrated. The instrument has been optimized for pump and probe parameters, detector performance, and signal processing algorithm. The imager is capable of mapping purely optical or thermal defects efficiently in coatings of low damage threshold and low absorbance. Detailed mapping of minor inhomogeneities at low pump power has been achieved through the simultaneous action of a low-noise fiber optic photothermal beam defection sensor and a common-mode-rejection demodulation (CMRD) technique. The linearity and sensitivity of the sensor have been examined theoretically and experimentally, and the signal to noise ratio improvement factor is found to be about 110 compared to a conventional bicell photodiode. The scanner is so designed that mapping of static or shock sensitive samples is possible. In the case of a sample with absolute absorptance of 3.8 x 10(-4), a change in absorptance of about 0.005 x 10(-4) has been detected without ambiguity, ensuring a contrast parameter of 760. This is about 1085% improvement over the conventional approach containing a bicell photodiode, at the same pump power. The merits of the system have been demonstrated by mapping two intentionally created damage sites in a MgF2 coating on fused silica at different excitation powers. Amplitude and phase maps were recorded for thermally thin and thick cases, and the results are compared to demonstrate a case which, in conventional imaging, would lead to a deceptive conclusion regarding the type and location of the damage. Also, a residual damage profile created by long term irradiation with high pump power density has been depicted.

Fast Multiple Access Selection through variable power transmissions

Many wireless applications demand a fast mechanism to detect the packet from a node with the highest priority ("best node") only, while packets from nodes with lower priority are irrelevant. In this paper, we introduce an extremely fast contention-based multiple access algorithm that selects the best node and requires only local information of the priorities of the nodes. The algorithm, which we call Variable Power Multiple Access Selection (VP-MAS), uses the local channel state information from the accessing nodes to the receiver, and maps the priorities onto the receive power. It is based on a key result that shows that mapping onto a set of discrete receive power levels is optimal, when the power levels are chosen to exploit packet capture that inherently occurs in a wireless physical layer. The VP-MAS algorithm adjusts the expected number of users that contend in each step and their respective transmission powers, depending on whether previous transmission attempts resulted in capture, idle channel, or collision. We also show how reliable information regarding the total received power at the receiver can be used to improve the algorithm by enhancing the feedback mechanism. The algorithm detects the packet from the best node in 1.5 to 2.1 slots, which is considerably lower than the 2.43 slot average achieved by the best algorithm known to date.

Motion of a viscous fluid with suspended particles in a curved tube

In this paper we have discussed the motion of a viscous fluid with suspended particles through a curved tube of small curvature ratio. The system is treated as two separate interacting continua. Solutions for axial and secondary velocities are obtained in the form of asymptotic expansions in powers of Dean Number. The streamline pattern for the particulate phase reveals many interesting features. The influence of the particulate continium on the fluid is described by the parameter τ which depends on the density ratio of the two continua. The concentration distribution of the particles in a given cross section is determined. It is noticed that the particles move closer to the wall for certain values of the concentration and the density ratio.

Power Minimization for CDMA under Colored Noise

Rate-constrained power minimization (PMIN) over a code division multiple-access (CDMA) channel with correlated noise is studied. PMIN is. shown to be an instance of a separable convex optimization problem subject to linear ascending constraints. PMIN is further reduced to a dual problem of sum-rate maximization (RMAX). The results highlight the underlying unity between PMIN, RMAX, and a problem closely related to PMIN but with linear receiver constraints. Subsequently, conceptually simple sequence design algorithms are proposed to explicitly identify an assignment of sequences and powers that solve PMIN. The algorithms yield an upper bound of 2N - 1 on the number of distinct sequences where N is the processing gain. The sequences generated using the proposed algorithms are in general real-valued. If a rate-splitting and multi-dimensional CDMA approach is allowed, the upper bound reduces to N distinct sequences, in which case the sequences can form an orthogonal set and be binary +/- 1-valued.

An adiabatic model for a two-stage double-inlet pulse tube refrigerator

A numerical modelling technique for predicting the detailed performance of a double-inlet type two-stage pulse tube refrigerator has been developed. The pressure variations in the compressor, pulse tube, and reservoir were derived, assuming the stroke volume variation of the compressor to be sinusoidal. The relationships of mass flowrates, volume flowrates, and temperature as a function of time and position were developed. The predicted refrigeration powers are calculated by considering the effect of void volumes and the phase shift between pressure and mass flowrate. These results are compared with the experimental results of a specific pulse tube refrigerator configuration and an existing theoretical model. The analysis shows that the theoretical predictions are in good agreement with each other.

Experimental studies on a two stage pulse tube cryocooler reaching 2.5K

A two stage Pulse Tube Cryocooler (PTC) is designed and fabricated which reaches a no-load temperature of 2.5K in the second stage and similar to 60 K in the first stage respectively. The system provides a cooling power of similar to 250 mW at 5K in the second stage. Stainless steel meshes (size 200) and lead (Pb) granules are used as the first stage regenerator materials and combination of Pb with Er3Ni / HoCu2 are used as the second stage regenerator materials. The system operates at 1.6 Hz using a 6 kW water cooled helium compressor. Studies conducted by varying the dimensions of Pulse Tubes and regenerators show that the dimensions of the Pulse Tubes are more critical to the performance of the Cryocooler than those of the regenerators. Experimental studies show that the optimum volume ratios of Er3Ni to Pb and HoCu2 to Pb in the second stage regenerator should be 3:2 and 2:3 respectively for the best performance. Further, systems with HoCu2 performed better than those with Er3Ni. The theoretical analysis of the system has been carried out using a simple isothermal model. The experimentally measured cooling powers are in good agreement with the theoretical predictions.

Scale-up criteria of square tank surface aerator

Oxygen transfer rate and the corresponding power requirement to operate the rotor are vital for design and scale-up of surface aerators. Present study develops simulation or scale-up criterion correlating the oxygen transsimulation fer coefficient and power number along with a parameter governing theoretical power per unit volume (X, which is defined as equal to (FR1/3)-R-4/3, where F and R are impellers' Fronde and Reynolds number, respectively). Based on such scale-up criteria, design considerations are developed to save energy requirements while designing square tank surface aerators. It has been demonstrated that energy can be saved substantially if the aeration tanks are run at relatively higher input powers. It is also demonstrated that smaller sized tanks are more energy conservative and economical when compared to big sized tanks, while aerating the same volume of water, and at the same time by maintaining a constant input power in all the tanks irrespective of their size. An example illustrating how energy can be reduced while designing different sized aerators is given. The results presented have a wide application in biotechnology and bioengineering areas with a particular emphasis on the design of appropriate surface aeration systems.

Scale-up criteria of square tank surface aerator

Oxygen transfer rate and the corresponding power requirement to operate the rotor are vital for design and scale-up of surface aerators. Present study develops simulation or scale-up criterion correlating the oxygen transsimulation fer coefficient and power number along with a parameter governing theoretical power per unit volume (X, which is defined as equal to (FR1/3)-R-4/3, where F and R are impellers' Fronde and Reynolds number, respectively). Based on such scale-up criteria, design considerations are developed to save energy requirements while designing square tank surface aerators. It has been demonstrated that energy can be saved substantially if the aeration tanks are run at relatively higher input powers. It is also demonstrated that smaller sized tanks are more energy conservative and economical when compared to big sized tanks, while aerating the same volume of water, and at the same time by maintaining a constant input power in all the tanks irrespective of their size. An example illustrating how energy can be reduced while designing different sized aerators is given. The results presented have a wide application in biotechnology and bioengineering areas with a particular emphasis on the design of appropriate surface aeration systems.