Isolation of an 800 kb contiguous DNA fragment encompassing a 3.5-cM region of chromosome 1 in Arabidopsis using YAC clones

The apetalal mutation of Arabidopsis affects floral meristem identity and the development of sepal and petal primordia of the flower. We mapped the available RFLP markers on chromosome 1 that are in the general vicinity of apetalal on a fine structure map and then chose the closest RFLP as a starting point for contiguous DNA (contig) generation. We report here a contig of about 800 kilobases (kb) that spans a 3.5 cM region of chromosome 1. We used genomic libraries of Arabidopsis prepared in yeast artificial chromosome (YAC) vectors and the detailed characterization of 19 YACs is reported. RFLPs displayed by the end fragments from the walk were mapped to align and correlate the genetic and physical maps for this region of chromosome 1. In this segment of the genome, 1 cM corresponds to a little over 200 kb of physical distance.

On an exact populationary model of genetic algorithms

Genetic algorithms (GAs) are search methods that are being employed in a multitude of applications with extremely large search spaces. Recently, there has been considerable interest among GA researchers in understanding and formalizing the working of GAs. In an earlier paper, we have introduced the notion of binomially distributed populations as the central idea behind an exact ''populationary'' model of the large-population dynamics of the GA operators for objective functions called ''functions of unitation.'' In this paper, we extend this populationary model of GA dynamics to a more general class of objective functions called functions of unitation variables. We generalize the notion of a binomially distributed population to a generalized binomially distributed population (GBDP). We show that the effects of selection, crossover, and mutation can be exactly modelled after decomposing the population into GBDPs. Based on this generalized model, we have implemented a GA simulator for functions of two unitation variables-GASIM 2, and the distributions predicted by GASIM 2 match with those obtained from actual GA runs. The generalized populationary model of GA dynamics not only presents a novel and natural way of interpreting the workings of GAs with large populations, but it also provides for an efficient implementation of the model as a GA simulator. (C) Elsevier Science Inc. 1997.

Some algorithms for discrete time queues with finite capacity

We consider a discrete time queue with finite capacity and i.i.d. and Markov modulated arrivals, Efficient algorithms are developed to calculate the moments and the distributions of the first time to overflow and the regeneration length, Results are extended to the multiserver queue. Some illustrative numerical examples are provided.

Unsteady compressible boundary layer flow in the stagnation region of a sphere with a magnetic field

Abstract: An analysis is performed to study the unsteady compressible laminar boundary layer flow in the forward stagnation-point region of a sphere with a magnetic field applied normal, to the surface. We have considered the case where there is an initial steady state that is perturbed by the step change in the total enthalpy at the wall. The nonlinear coupled parabolic partial differential equations governing the flow and heat transfer have been solved numerically using a finite-difference scheme. The numerical results are presented, which show the temporal development of the boundary layer. The magnetic field in the presence of variable electrical conductivity causes an overshoot in the velocity profile. Also, when the total enthalpy at the wall is suddenly increased, there is a change in the direction of transfer of heat in a small interval of time.

Synthesis of ASIPs for DSP algorithms

ASICs offer the best realization of DSP algorithms in terms of performance, but the cost is prohibitive, especially when the volumes involved are low. However, if the architecture synthesis trajectory for such algorithms is such that the target architecture can be identified as an interconnection of elementary parameterized computational structures, then it is possible to attain a close match, both in terms of performance and power with respect to an ASIC, for any algorithmic parameters of the given algorithm. Such an architecture is weakly programmable (configurable) and can be viewed as an application specific integrated processor (ASIP). In this work, we present a methodology to synthesize ASIPs for DSP algorithms. (C) 1999 Elsevier Science B.V. All rights reserved.

Localized data gathering paradigms for small and marginal farm lands in Semi-Arid region – Issues and Concerns

In this work we explore the application of wireless sensor technologies for the benefit of small and marginal farmers in semi-arid regions. The focus in this paper is to discuss the merits and demerits of data gathering & relay paradigms that collect localized data over a wide area. The data gathered includes soil moisture, temperature, pressure, rain data and humidity. The challenge to technology intervention comes mainly due to two reasons: (a) Farmers in general are interested in crop yield specific to their piece of land. This is because soil texture can vary rapidly over small regions. (b) Due to a high run-off, the soil moisture retention can vary from region to region depending on the topology of the farm. Both these reasons alter the needs drastically. Additionally, small and marginal farms can be sandwiched between rich farm lands. The village has very little access to grid power. Power cuts can extend up to 12 hours in a day and upto 3 or 4 days during some months in the year. In this paper, we discuss 3 technology paradigms for data relaying. These include Wi-Fi (Wireless Fidelity), GPRS (General Packet Radio Service) and DTN (Delay and Disruption Tolerant Network) technologies. We detail the merits and demerits of each of these solutions and provide our final recommendations. The project site is a village called Chennakesavapura in the state of Karnataka, India.

A fixed-grid finite element based enthalpy formulation for generalized phase change problems: role of superficial mushy region

The enthalpy method is primarily developed for studying phase change in a multicomponent material, characterized by a continuous liquid volume fraction (phi(1)) vs temperature (T) relationship. Using the Galerkin finite element method we obtain solutions to the enthalpy formulation for phase change in 1D slabs of pure material, by assuming a superficial phase change region (linear (phi(1) vs T) around the discontinuity at the melting point. Errors between the computed and analytical solutions are evaluated for the fluxes at, and positions of, the freezing front, for different widths of the superficial phase change region and spatial discretizations with linear and quadratic basis functions. For Stefan number (St) varying between 0.1 and 10 the method is relatively insensitive to spatial discretization and widths of the superficial phase change region. Greater sensitivity is observed at St = 0.01, where the variation in the enthalpy is large. In general the width of the superficial phase change region should span at least 2-3 Gauss quadrature points for the enthalpy to be computed accurately. The method is applied to study conventional melting of slabs of frozen brine and ice. Regardless of the forms for the phi(1) vs T relationships, the thawing times were found to scale as the square of the slab thickness. The ability of the method to efficiently capture multiple thawing fronts which may originate at any spatial location within the sample, is illustrated with the microwave thawing of slabs and 2D cylinders. (C) 2002 Elsevier Science Ltd. All rights reserved.

Cyclic Prefix Based Cooperative Sequential Spectrum Sensing Algorithms for OFDM

This paper considers the problem of spectrum sensing in cognitive radio networks when the primary user is using Orthogonal Frequency Division Multiplexing (OFDM). For this we develop cooperative sequential detection algorithms that use the autocorrelation property of cyclic prefix (CP) used in OFDM systems. We study the effect of timing and frequency offset, IQ-imbalance and uncertainty in noise and transmit power. We also modify the detector to mitigate the effects of these impairments. The performance of the proposed algorithms is studied via simulations. We show that sequential detection can significantly improve the performance over a fixed sample size detector.

Automatic decomposition of unstructured meshes employing genetic algorithms for parallel FEM computations

Parallel execution of computational mechanics codes requires efficient mesh-partitioning techniques. These mesh-partitioning techniques divide the mesh into specified number of submeshes of approximately the same size and at the same time, minimise the interface nodes of the submeshes. This paper describes a new mesh partitioning technique, employing Genetic Algorithms. The proposed algorithm operates on the deduced graph (dual or nodal graph) of the given finite element mesh rather than directly on the mesh itself. The algorithm works by first constructing a coarse graph approximation using an automatic graph coarsening method. The coarse graph is partitioned and the results are interpolated onto the original graph to initialise an optimisation of the graph partition problem. In practice, hierarchy of (usually more than two) graphs are used to obtain the final graph partition. The proposed partitioning algorithm is applied to graphs derived from unstructured finite element meshes describing practical engineering problems and also several example graphs related to finite element meshes given in the literature. The test results indicate that the proposed GA based graph partitioning algorithm generates high quality partitions and are superior to spectral and multilevel graph partitioning algorithms.

Efficient algorithms for learning kernels from multiple similarity matrices with general convex loss functions

In this paper we consider the problem of learning an n × n kernel matrix from m(1) similarity matrices under general convex loss. Past research have extensively studied the m = 1 case and have derived several algorithms which require sophisticated techniques like ACCP, SOCP, etc. The existing algorithms do not apply if one uses arbitrary losses and often can not handle m > 1 case. We present several provably convergent iterative algorithms, where each iteration requires either an SVM or a Multiple Kernel Learning (MKL) solver for m > 1 case. One of the major contributions of the paper is to extend the well knownMirror Descent(MD) framework to handle Cartesian product of psd matrices. This novel extension leads to an algorithm, called EMKL, which solves the problem in O(m2 log n 2) iterations; in each iteration one solves an MKL involving m kernels and m eigen-decomposition of n × n matrices. By suitably defining a restriction on the objective function, a faster version of EMKL is proposed, called REKL,which avoids the eigen-decomposition. An alternative to both EMKL and REKL is also suggested which requires only an SVMsolver. Experimental results on real world protein data set involving several similarity matrices illustrate the efficacy of the proposed algorithms.

Improved preprocessing methods for modulo scheduling algorithms

Instruction scheduling with an automaton-based resource conflict model is well-established for normal scheduling. Such models have been generalized to software pipelining in the modulo-scheduling framework. One weakness with existing methods is that a distinct automaton must be constructed for each combination of a reservation table and initiation interval. In this work, we present a different approach to model conflicts. We construct one automaton for each reservation table which acts as a compact encoding of all the conflict automata for this table, which can be recovered for use in modulo-scheduling. The basic premise of the construction is to move away from the Proebsting-Fraser model of conflict automaton to the Muller model of automaton modelling issue sequences. The latter turns out to be useful and efficient in this situation. Having constructed this automaton, we show how to improve the estimate of resource constrained initiation interval. Such a bound is always better than the average-use estimate. We show that our bound is safe: it is always lower than the true initiation interval. This use of the automaton is orthogonal to its use in modulo-scheduling. Once we generate the required information during pre-processing, we can compute the lower bound for a program without any further reference to the automaton.

Phenobarbitone-mediated translocation of the cytosolic proteins interacting with the 5 '-proximal region of rat liver CYP2B1/B2 gene into the nucleus

The positive element (PE) (-69 to -98 bp) within the 5'-proximal region of the CYP2B1B2 gene (+1 to -179 bp) of rat liver is essential for phenobarbitone (PB) response and gives a single major complex with the rat liver cytosol in gel shift analysis. This complex corresponds to complex I (top) of the three complexes given by the nuclear extracts. PB treatment of rats leads to a decrease in complex I formation with the cytosol and PE and an increase in the same with the nuclear extract in gel shift analysis. Both the changes are counteracted by simultaneous okadaic acid administration. The nuclear protein giving rise to complex I has been isolated and has an M-r of 26 kDa. The cytosolic counterpart consists of two species, 26 and 28 kDa, as revealed by Southwestern blot analysis using labeled PE. It is concluded that PB treatment leads to the translocation accompanied by processing of the cytosolic protein species into the nucleus that requires protein dephosphorylation. It is suggested that PB may exert a global regulation on the transcription of many genes by modulating the phosphorylation status of different protein factors involved in transcriptional regulation. (C) 2002 Elsevier Science (USA).

Unsymmetrical aryl disulfides with excellent transparency in the visible region for second order nonlinear optics

Several unsymmetrically substituted aromatic donor acceptor disulfides have been synthesized and analysed for their second order nonlinear optical properties. These molecules exhibit moderately high first hyperpolarizability (beta) with excellent transparency in the visible region. Most of the unsymmetrical disulfides have a cut-off wavelength below 420 nm. Calculations show that the molecules have an asymmetric charge distribution around the disulfide bond which is responsible for their high beta values. These results provide motivation for the design and synthesis of nonlinear optical chromophores with multiple disulfide bonds for large second order nonlinearity and excellent visible transparency.

The central region of meso-3,4-diphenylhexane-2,5-dione

As with 1,2-diphenylethane (dpe), X-ray crystallographic methods measure the central bond in meso-3,4-diphenylhexane-2,5-done (dphd) as significantly shorter than normal for an sp(3)-sp(3) bond. The same methods measure the benzylic (ethane C-Ph) bonds in dphd as unusually long for sp(3)-sp(2) liaisons. Torsional motions of the phenyl rings about the C-Ph bonds have been proposed as the artifacts behind the result of a 'short' central bond in dpe. While a similar explanation can, presumably, hold for the even 'shorter' central bond in dphd, it cannot account for the 'long' C-Ph bonds. The phenyl groups, departing much from regular hexagonal shape, adopt highly skewed conformations with respect to the plane constituted by the four central atoms. It is thought that-the thermal motions of the phenyl rings, conditioned by the potential wells in which they are ensconced in the unit cell, are largely libratory around their normal axes. In what appears to be a straightforward explanation under the 'rigid-body' concept, it appears that these libratory motions of the phenyl rings, that account, at the same time, for the 'short' central bond, are the artifacts behind the 'long' measurement of the C-Ph bonds. These motions could be superimposed on torsional motions analogous to those proposed in the case of dpe. An inspection of the ORTEP diagram from the 298 K data on dphd clearly suggests these possibilities. Supportive evidence for these qualitative explanations from an analysis of the differences between the mean square displacements of C(1) and C(7)/C(1a) and C(7a) based on the 'rigid-body model' is discussed. (C) 2002 Elsevier Science B.V. All rights reserved.