d-Regular Graphs of Acyclic Chromatic Index at Least d+2

An acyclic edge coloring of a graph is a proper edge coloring such that there are no bichromatic cycles. The acyclic chromatic index of a graph is the minimum number k such that there is an acyclic edge coloring using k colors and is denoted by a'(G). It was conjectured by Alon, Suclakov and Zaks (and earlier by Fiamcik) that a'(G) <= Delta+2, where Delta = Delta(G) denotes the maximum degree of the graph. Alon et al. also raised the question whether the complete graphs of even order are the only regular graphs which require Delta+2 colors to be acyclically edge colored. In this article, using a simple counting argument we observe not only that this is not true, but in fact all d-regular graphs with 2n vertices and d>n, requires at least d+2 colors. We also show that a'(K-n,K-n) >= n+2, when n is odd using a more non-trivial argument. (Here K-n,K-n denotes the complete bipartite graph with n vertices on each side.) This lower bound for Kn,n can be shown to be tight for some families of complete bipartite graphs and for small values of n. We also infer that for every d, n such that d >= 5, n >= 2d+3 and dn even, there exist d-regular graphs which require at least d+2-colors to be acyclically edge colored. (C) 2009 Wiley Periodicals, Inc. J Graph Theory 63: 226-230, 2010.

On the duality between rate and power optimizations

Sequence design problems are considered in this paper. The problem of sum power minimization in a spread spectrum system can be reduced to the problem of sum capacity maximization, and vice versa. A solution to one of the problems yields a solution to the other. Subsequently, conceptually simple sequence design algorithms known to hold for the white-noise case are extended to the colored noise case. The algorithms yield an upper bound of 2N - L on the number of sequences where N is the processing gain and L the number of non-interfering subsets of users. If some users (at most N - 1) are allowed to signal along a limited number of multiple dimensions, then N orthogonal sequences suffice.

New colorimetric method for the estimation of aldehyde derivatives of vitamin A

A new colorimetric method for the estimation of aldehyde derivatives of vitamin A is described. The assay depends upon the formation of colored derivatives of the vitamin A aldehydes by reaction with p-aminobenzoic acid or p-aminosalicylic acid in the presence of 2.0 N hydrochloric acid.

A colorimetric method for the estimation of phloroglucinol

1. 1. A simple method has been devised for the estimation of phloroglucinol based on the formation of an intense colored compound with a modified Ehrlich reagent in the presence of trichloroacetic acid. Some factors affecting the formation of color have been studied. 2. 2. Careful regulation of trichloroacetic acid content in the system permits its estimation in 1–15 μg in the micro range and in 10–50 μg in the macro range. Phloroglucinol lends itself to ready separation by paper chromatography and estimation after clution from paper.

A Wavelet based Teager Energy Operator for Spike Detection in Microelectrode Array Recordings

Spike detection in neural recordings is the initial step in the creation of brain machine interfaces. The Teager energy operator (TEO) treats a spike as an increase in the `local' energy and detects this increase. The performance of TEO in detecting action potential spikes suffers due to its sensitivity to the frequency of spikes in the presence of noise which is present in microelectrode array (MEA) recordings. The multiresolution TEO (mTEO) method overcomes this shortcoming of the TEO by tuning the parameter k to an optimal value m so as to match to frequency of the spike. In this paper, we present an algorithm for the mTEO using the multiresolution structure of wavelets along with inbuilt lowpass filtering of the subband signals. The algorithm is efficient and can be implemented for real-time processing of neural signals for spike detection. The performance of the algorithm is tested on a simulated neural signal with 10 spike templates obtained from [14]. The background noise is modeled as a colored Gaussian random process. Using the noise standard deviation and autocorrelation functions obtained from recorded data, background noise was simulated by an autoregressive (AR(5)) filter. The simulations show a spike detection accuracy of 90%and above with less than 5% false positives at an SNR of 2.35 dB as compared to 80% accuracy and 10% false positives reported [6] on simulated neural signals.

Transient signal detection using wigner-ville distribution and wavelet denoising

The problem of detecting an unknown transient signal in noise is considered. The SNR of the observed data is first enhanced using wavelet domain filter The output of the wavelet domain filter is then transformed using a Wigner-Ville transform,which separates the spectrum of the observed signal into narrow frequency bands. Each subband signal at the output of the Wigner-ville block is subjected kto wavelet based level dependent denoising (WBLDD)to supress colored noise A weighted sum of the absolute value of outputs of WBLDD is passed through an energy detector, whose output is used as test statistic to take the final decision. By assigning weights proportional to the energy of the corresponding subband signals, the proposed detector approximates a frequency domain matched filter Simulation results are presented to show that the performance of the proposed detector is better than that of the wavelet packet transform based detector.

A study of the spectrum of an acoustic field in shallow water due to noise sources at the surface

An expression for the spectrum and cross spectrum of an acoustic field measured at two vertically separated sensors in shallow water has been obtained for any correlated noise sources distributed over the surface. Numerical results are presented for the case where the noise sources, white noise and wind-induced colored noise, are contained within a circular disk centered over the sensors. The acoustic field is generally inhomogeneous except when the channel is deep. The coherence function becomes real for a large disk, for a radius greater than 25 times the depth of the channel, decreases with further increase of the size of the disk, and finally tapers off after certain limiting size, approximately given by 1/alpha, where alpha is the attenuation coefficient.

Novel approach to estimate fringe order in Moire profilometry

A novel approach to estimate fringe order in Moire topography is proposed. Along with the light source used to create shadow of the grating on the object (as in conventional moire), proposed method uses a second light source which illuminates the object with color bands from the side. Width of each colored band is set to match that height which leads to a 2 pi phase shift in moire fringes. This facilitates one to rule the object with colored bands, which can be used to estimate fringe order using a color camera with relatively low spatial resolution with out any compromise in height sensitivity. Current proposal facilitates one to extract 3D profile of objects with surface discontinuities. It also deals with the possible usage of moire topography (when combined with the proposed method) in extracting 3D surface profile of many objects with height discontinuities using a single 2D image. Present article deals with theory and simulations of this novel side illumination based approach.

Synthesis of Novel Oxide Pyrochlores, A2BB?O7 (A = La, Nd; BB? = Pb, Sn, Bi), by Alkali Melt Route

Oxide pyrochlores of the formula A2BB? O7 (A = La, Nd; BB? = Pb, Sn, Bi) have been synthesized by a low-temperature ambient-pressure route employing KOH melts. All the compositions, including La2Bi2O7 and its strontium-substituted derivatives, La2-xSrxBi2O7-?, are deeply colored insulators, confirming that a metallic ground state is not achieved for Pb(IV) and Bi(IV/V) oxides with the pyrochlore structure.

S-nets: A Petri net based model for performance evaluation of real-time scheduling algorithms

A new class of nets, called S-nets, is introduced for the performance analysis of scheduling algorithms used in real-time systems Deterministic timed Petri nets do not adequately model the scheduling of resources encountered in real-time systems, and need to be augmented with resource places and signal places, and a scheduler block, to facilitate the modeling of scheduling algorithms. The tokens are colored, and the transition firing rules are suitably modified. Further, the concept of transition folding is used, to get intuitively simple models of multiframe real-time systems. Two generic performance measures, called �load index� and �balance index,� which characterize the resource utilization and the uniformity of workload distribution, respectively, are defined. The utility of S-nets for evaluating heuristic-based scheduling schemes is illustrated by considering three heuristics for real-time scheduling. S-nets are useful in tuning the hardware configuration and the underlying scheduling policy, so that the system utilization is maximized, and the workload distribution among the computing resources is balanced.

Direction of arrival estimation in the presence of distributed noise sources: Cumulant based approach

In the past few years there have been attempts to develop subspace methods for DoA (direction of arrival) estimation using a fourth?order cumulant which is known to de?emphasize Gaussian background noise. To gauge the relative performance of the cumulant MUSIC (MUltiple SIgnal Classification) (c?MUSIC) and the standard MUSIC, based on the covariance function, an extensive numerical study has been carried out, where a narrow?band signal source has been considered and Gaussian noise sources, which produce a spatially correlated background noise, have been distributed. These simulations indicate that, even though the cumulant approach is capable of de?emphasizing the Gaussian noise, both bias and variance of the DoA estimates are higher than those for MUSIC. To achieve comparable results the cumulant approach requires much larger data, three to ten times that for MUSIC, depending upon the number of sources and how close they are. This is attributed to the fact that in the estimation of the cumulant, an average of a product of four random variables is needed to make an evaluation. Therefore, compared to those in the evaluation of the covariance function, there are more cross terms which do not go to zero unless the data length is very large. It is felt that these cross terms contribute to the large bias and variance observed in c?MUSIC. However, the ability to de?emphasize Gaussian noise, white or colored, is of great significance since the standard MUSIC fails when there is colored background noise. Through simulation it is shown that c?MUSIC does yield good results, but only at the cost of more data.

Rainbow Connection Number and Connectivity

The 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. Our main result is that rc(G) <= inverted right perpendicularn/2inverted left perpendicular for any 2-connected graph with at least three vertices. We conjecture that rc(G) <= n/kappa + C for a kappa-connected graph G of order n, where C is a constant, and prove the conjecture for certain classes of graphs. We also prove that rc(G) < (2 + epsilon)n/kappa + 23/epsilon(2) for any epsilon > 0.

DMT of Multihop Networks: End Points and Computational Tools

In this paper, the diversity-multiplexing gain tradeoff (DMT) of single-source, single-sink (ss-ss), multihop relay networks having slow-fading links is studied. In particular, the two end-points of the DMT of ss-ss full-duplex networks are determined, by showing that the maximum achievable diversity gain is equal to the min-cut and that the maximum multiplexing gain is equal to the min-cut rank, the latter by using an operational connection to a deterministic network. Also included in the paper, are several results that aid in the computation of the DMT of networks operating under amplify-and-forward (AF) protocols. In particular, it is shown that the colored noise encountered in amplify-and-forward protocols can be treated as white for the purpose of DMT computation, lower bounds on the DMT of lower-triangular channel matrices are derived and the DMT of parallel MIMO channels is computed. All protocols appearing in the paper are explicit and rely only upon AF relaying. Half-duplex networks and explicit coding schemes are studied in a companion paper.

Synthesis, Structure, and Magnetic Properties of a New Eight-Connected Metal-Organic Framework (MOF) based on Co-4 Clusters

A hydrothermal reaction of cobalt nitrate, 4,4'-oxybis(benzoic acid) (OBA), 1,2,4-triazole, and NaOH gave rise to a deep purple colored compound Co-4(triazolate)(2)(OBA)(3)], I, possessing Co-4 clusters. The Co-4 clusters are connected together through the tirazolate moieties forming a two-dimensional layer that closely resembles the TiS2 layer. The layers are pillared by the OBA units forming the three-dimensional structure. To the best of our knowledge, this is the first observation of a pillared TiS2 layer in a metal-organic framework compound. Magnetic studies in the temperature range 1.8-300 K indicate strong antiferromagetic interactions for Co-4 clusters. The structure as well as the magnetic behavior of the present compound has been compared with the previously reported related compound Co-2(mu 3-OH)(mu(2)-H2O)(pyrazine)(OBA)(OBAH)] prepared using pyrazine as the linker between the Co-4 clusters.

The force distribution function of an oscillator model of polymer stretching at constant velocity

Recent simulations of the stretching of tethered biopolymers at a constant speed v (Ponmurugan and Vemparala, 2011 Phys. Rev. E 84 060101(R)) have suggested that for any time t, the distribution of the fluctuating forces f responsible for chain deformation is governed by a relation of the form P(+ f)/ P(- f) = expgamma f], gamma being a coefficient that is solely a function of v and the temperature T. This result, which is reminiscent of the fluctuation theorems applicable to stochastic trajectories involving thermodynamic variables, is derived in this paper from an analytical calculation based on a generalization of Mazonka and Jarzynski's classic model of dragged particle dynamics Mazonka and Jarzynski, 1999 arXiv:cond-\textbackslashmat/9912121v1]. However, the analytical calculations suggest that the result holds only if t >> 1 and the force fluctuations are driven by white rather than colored noise; they further suggest that the coefficient gamma in the purported theorem varies not as v(0.15)T-(0.7), as indicated by the simulations, but as vT(-1).