Localization of testis-variant histones in rat testis chromatin

Nucleosome core particles and oligonucleosomes were isolated by digesting rat testis nuclei with micrococcal nuclease to 20% acid-solubility, followed by fractionation of the digest on a Bio-Gel A-5m column. The core particles thus isolated were characterized on the basis of their DNA length of 151 +/- 5 base-pairs and sedimentation coefficient of 11.4S. Analysis of the acid-soluble proteins of the core particles indicated that histones TH2B and X2 are constituents of the core particles, in addition to the somatic histones H2A, H2B, H3 and H4. The acid-soluble proteins of the oligonucleosomes comprised all the histones, including both the somatic (H1, H2A, H2B, H3, H4 and X2) and the testis-specific ones (TH1 and TH2B). It was also observed that histones TH1 and H1 are absent from the core particles and were readily extracted from the chromatin by 0.6 M-NaCl, which indicated that both of them are bound to the linker DNA.

Mitochondrial localization of functional ferrochelatase from Plasmodium falciparum

In the malarial parasite, enzymes of heme-biosynthetic pathway are distributed in different cellular compartments. The site of localization of ferrochelatase in the malarial parasite is crucial, since it will decide the ultimate site of heme synthesis. Earlier results have differed in terms of localization, being the mitochondrion or apicoplast and the functional enzyme has not been cloned, expressed and characterized. The present study reveals that Plasmodium falciparum ferrochelatase (PfFC) gene encodes multiple transcripts of which the one encoding the full length functional protein (PfFC) has been cloned and the recombinant protein over-expressed and purified from E. coli cells. The enzyme shows maximum activity with iron, while zinc is a poor substrate. Immunofluorescence studies with antibodies to functional ferrochelatase reveal that the native enzyme is localized to the mitochondrion of the parasite indicating that this organelle is the ultimate site of heme synthesis.

Localization of handwritten text in documents using moment invariants and Delaunay triangulation

This paper describes an approach based on Zernike moments and Delaunay triangulation for localization of hand-written text in machine printed text documents. The Zernike moments of the image are first evaluated and we classify the text as hand-written using the nearest neighbor classifier. These features are independent of size, slant, orientation, translation and other variations in handwritten text. We then use Delaunay triangulation to reclassify the misclassified text regions. When imposing Delaunay triangulation on the centroid points of the connected components, we extract features based on the triangles and reclassify the text. We remove the noise components in the document as part of the preprocessing step so this method works well on noisy documents. The success rate of the method is found to be 86%. Also for specific hand-written elements such as signatures or similar text the accuracy is found to be even higher at 93%.

Time and Energy Complexity of Distributed Computation of a Class of Functions in Wireless Sensor Networks

We consider a scenario in which a wireless sensor network is formed by randomly deploying n sensors to measure some spatial function over a field, with the objective of computing a function of the measurements and communicating it to an operator station. We restrict ourselves to the class of type-threshold functions (as defined in the work of Giridhar and Kumar, 2005), of which max, min, and indicator functions are important examples: our discussions are couched in terms of the max function. We view the problem as one of message-passing distributed computation over a geometric random graph. The network is assumed to be synchronous, and the sensors synchronously measure values and then collaborate to compute and deliver the function computed with these values to the operator station. Computation algorithms differ in (1) the communication topology assumed and (2) the messages that the nodes need to exchange in order to carry out the computation. The focus of our paper is to establish (in probability) scaling laws for the time and energy complexity of the distributed function computation over random wireless networks, under the assumption of centralized contention-free scheduling of packet transmissions. First, without any constraint on the computation algorithm, we establish scaling laws for the computation time and energy expenditure for one-time maximum computation. We show that for an optimal algorithm, the computation time and energy expenditure scale, respectively, as Theta(radicn/log n) and Theta(n) asymptotically as the number of sensors n rarr infin. Second, we analyze the performance of three specific computation algorithms that may be used in specific practical situations, namely, the tree algorithm, multihop transmission, and the Ripple algorithm (a type of gossip algorithm), and obtain scaling laws for the computation time and energy expenditure as n rarr infin. In particular, we show that the computation time for these algorithms scales as Theta(radicn/lo- g n), Theta(n), and Theta(radicn log n), respectively, whereas the energy expended scales as , Theta(n), Theta(radicn/log n), and Theta(radicn log n), respectively. Finally, simulation results are provided to show that our analysis indeed captures the correct scaling. The simulations also yield estimates of the constant multipliers in the scaling laws. Our analyses throughout assume a centralized optimal scheduler, and hence, our results can be viewed as providing bounds for the performance with practical distributed schedulers.

Binarization and localization of text images captured on a mobile phone camera

This paper proposes and compares four methods of binarzing text images captured using a camera mounted on a cell phone. The advantages and disadvantages(image clarity and computational complexity) of each method over the others are demonstrated through binarized results. The images are of VGA or lower resolution.

Distributed Transmission of Functions of Correlated Sources over a Fading Multiple Access Channel

In this paper we address the problem of distributed transmission of functions of correlated sources over a fast fading multiple access channel (MAC). This is a basic building block in a hierarchical sensor network used in estimating a random field where the cluster head is interested only in estimating a function of the observations. The observations are transmitted to the cluster head through a fast fading MAC. We provide sufficient conditions for lossy transmission when the encoders and decoders are provided with partial information about the channel state. Furthermore signal side information maybe available at the encoders and the decoder. Various previous studies are shown as special cases. Efficient joint-source channel coding schemes are discussed for transmission of discrete and continuous alphabet sources to recover function values.

Rapid localization of damage using a circular sensor array and Lamb wave based triangulation

A damage detection and imaging methodology based on symmetry of neighborhood sensor path and similarity of signal patterns with respect to radial paths in a circular array of sensors has been developed It uses information regarding Limb wave propagation along with a triangulation scheme to rapidly locate and quantify the severity of damage without using all of the sensor data. In a plate like structure, such a scheme can be effectively employed besides full field imaging of wave scattering pattern from the damage, if present in the plate. This new scheme is validated experimentally. Hole and corrosion type damages have been detected and quantified using the proposed scheme successfully. A wavelet based cumulative damage index has been studied which shows monotonic sensitivity against the severity of the damage. which is most desired in a Structural Health Monitoring system. (C) 2010 Elsevier Ltd. All rights reserved.

Signal subspace approach in localization of sound source in shallow water

A new algorithm based on signal subspace approach is proposed for localizing a sound source in shallow water. In the first instance we assumed an ideal channel with plane parallel boundaries and known reflection properties. The sound source is assumed to emit a broadband stationary stochastic signal. The algorithm takes into account the spatial distribution of all images and reflection characteristics of the sea bottom. It is shown that both range and depth of a source can be measured accurately with the help of a vertical array of sensors. For good results the number of sensors should be greater than the number of significant images; however, localization is possible even with a smaller array but at the cost of higher side lobes. Next, we allowed the channel to be stochastically perturbed; this resulted in random phase errors in the reflection coefficients. The most singular effect of the phase errors is to introduce into the spectral matrix an extra term which may be looked upon as a signal generated coloured noise. It is shown through computer simulations that the signal peak height is reduced considerably as a consequence of random phase errors.

On a Ratio of Functions of Exponential Random Variables and Some Applications

Consider L independent and identically distributed exponential random variables (r.vs) X-1, X-2 ,..., X-L and positive scalars b(1), b(2) ,..., b(L). In this letter, we present the probability density function (pdf), cumulative distribution function and the Laplace transform of the pdf of the composite r.v Z = (Sigma(L)(j=1) X-j)(2) / (Sigma(L)(j=1) b(j)X(j)). We show that the r.v Z appears in various communication systems such as i) maximal ratio combining of signals received over multiple channels with mismatched noise variances, ii)M-ary phase-shift keying with spatial diversity and imperfect channel estimation, and iii) coded multi-carrier code-division multiple access reception affected by an unknown narrow-band interference, and the statistics of the r.v Z derived here enable us to carry out the performance analysis of such systems in closed-form.

Localization of light in coherently amplifying random media

We derive and analyze the statistics of reflection coefficient of light backscattered coherently from an amplifying and disordered optical medium modeled by a spatially random refractive index having a uniform imaginary part in one dimension. We find enhancement of reflected intensity owing to a synergy between wave confinement by Anderson localization and coherent amplification by the active medium. This is not the same as that due to enhanced optical path lengths expected from photon diffusion in the random active medium. Our study is relevant to the physical realizability of a mirrorless laser by photon confinement due to Anderson localization.