On generating optimal signal probabilities for random tests: A genetic approach

Genetic Algorithms are robust search and optimization techniques. A Genetic Algorithm based approach for determining the optimal input distributions for generating random test vectors is proposed in the paper. A cost function based on the COP testability measure for determining the efficacy of the input distributions is discussed, A brief overview of Genetic Algorithms (GAs) and the specific details of our implementation are described. Experimental results based on ISCAS-85 benchmark circuits are presented. The performance pf our GA-based approach is compared with previous results. While the GA generates more efficient input distributions than the previous methods which are based on gradient descent search, the overheads of the GA in computing the input distributions are larger. To account for the relatively quick convergence of the gradient descent methods, we analyze the landscape of the COP-based cost function. We prove that the cost function is unimodal in the search space. This feature makes the cost function amenable to optimization by gradient-descent techniques as compared to random search methods such as Genetic Algorithms.

Recovery of copper from vanadiferrous magnetite ore of Masanikere area, Shimoga district

Studies have been carried out to recover copper from vanadiferrous magnetite ores by a novel reaction with lime in the presence of water vapour. The ore, mixed with different proportions of lime, has been roasted in the presence of steam. The roasted product is either directly leached with dilute mineral acids or subjected to magnetic separation and then leached. The effect of various parameters such as amount of lime added, temperature and duration of roasting and time of leaching on the recovery of copper has been investigated. The results indicate that over 90% copper could be recovered under optimum conditions of roasting and leaching.

Quantitation of spermatogenesis by DNA flow cytometry: Comparative study among six species of mammals

Suspensions of testicular germ cells from six species of mammals were prepared and stained for the DNA content with a fluorochrome (ethidium bromide) adopting a common technique and subjected to DNA flow cytometry. While uniform staining of the germ cells of the mouse, hamster, rat and monkey could be obtained by treating with 0.5% pepsin for 60 min followed by staining with ethidium bromide for 30 min, that of the guinea pig and rabbit required for optimal staining pepsinization for 90 min and treatment with ethidium bromide for 60 min. The procedure adopted here provided a uniform recovery of over 80% of germ cells with each one of the species tested and the cell population distributed itself according to the DNA content (expressed as C values) into 5 major classes-spermatogonia (2C), cells in S-phase, primary spermatocytes (4C), round spermatids (1C), and elongating/elongated spermatids (HC). Comparison of the DNA distribution pattern of the germ cell populations between species revealed little variation in the relative quantities of cells with 2C (8-11%), S-phase (6-9%), and 4C (6-9%) amount of DNA. Though the spermatid cell populations exhibited variations (1C:31-46%, HCI:7-20% and and HC2:11-25%) they represented the bulk of germ cells (70-80%). The overall conversion of 2C to 1C (1C:2C ratio) and meiotic transformation of 4C cells to IC (1C:4C ratio) kinetics were relatively constant between the species studied. The present study clearly demonstrates that DNA flow cytometry can be adopted with ease and assurance to quantify germ cell transformation and as such spermatogenesis by analysing a large number of samples with consistency both within and across the species barrier. Any variation from the norms in germ cell proportions observed following treatment, for e.g. hormonal stimulation or deprivation can then be ascribed due to a specific effect of the hormone/drug on single/multiple steps in germ cell transformation

Three- and Seven-Point Optimally Weighted Recursive Median Filters for Gas Turbine Diagnostics

Measured health signals incorporate significant details about any malfunction in a gas turbine. The attenuation of noise and removal of outliers from these health signals while preserving important features is an important problem in gas turbine diagnostics. The measured health signals are a time series of sensor measurements such as the low rotor speed, high rotor speed, fuel flow, and exhaust gas temperature in a gas turbine. In this article, a comparative study is done by varying the window length of acausal and unsymmetrical weighted recursive median filters and numerical results for error minimization are obtained. It is found that optimal filters exist, which can be used for engines where data are available slowly (three-point filter) and rapidly (seven-point filter). These smoothing filters are proposed as preprocessors of measurement delta signals before subjecting them to fault detection and isolation algorithms.

Optimal control of arrivals to queues with delayed queue length information

We consider discrete-time versions of two classical problems in the optimal control of admission to a queueing system: i) optimal routing of arrivals to two parallel queues and ii) optimal acceptance/rejection of arrivals to a single queue. We extend the formulation of these problems to permit a k step delay in the observation of the queue lengths by the controller. For geometric inter-arrival times and geometric service times the problems are formulated as controlled Markov chains with expected total discounted cost as the minimization objective. For problem i) we show that when k = 1, the optimal policy is to allocate an arrival to the queue with the smaller expected queue length (JSEQ: Join the Shortest Expected Queue). We also show that for this problem, for k greater than or equal to 2, JSEQ is not optimal. For problem ii) we show that when k = 1, the optimal policy is a threshold policy. There are, however, two thresholds m(0) greater than or equal to m(1) > 0, such that mo is used when the previous action was to reject, and mi is used when the previous action was to accept.

Secretion of endocrine signals by the primate embryo during the peri-implantation period

Development of preimplantation embryos and blastocyst implantation are critical early events in the establishment of pregnancy. In primates, embryonic signals, secreted during the peri-implantation period, are believed to play a major role in the regulation of embryonic differentiation and implantation. However, only limited progress has been made in the molecular and functional characterization of embryonic signals, partly due to severe paucity of primate embryos and the lack of optimal culture conditions to obtain viable embryo development. Two embryonic (endocrine) secretions, i.e. chorionic gonadotrophin (CG) and gonadotrophin releasing hormone (GnRH) are being studied. This article reviews the current status of knowledge on the recovery and culture of embryos, their secretion of CG, GnRH and other potential endocrine signals and their regulation and physiological role(s) during the peri-implantation period in primates, including humans.

Recovery of tropical rainforest avifauna in relation to vegetation succession following shifting cultivation in Mizoram, north-east India

1. Recovery of rainforest bird community structure and composition, in relation to forest succession after slash-and-burn shifting cultivation or jhum was studied in Mizoram, north-east India. Replicate fallow sites abandoned after shifting cultivation 1, 5, 10, 25 and approximate to 100 years ago, were compared with primary evergreen and semi-evergreen forest using transect and quadrat sampling. 2. Vegetation variables such as woody plant species richness, tree density and vertical stratification increased with fallow age in a rapid. nun-linear, asymptotic manner. Principal components analysis of vegetation variables summarized 92.8% of the variation into two axes: PC1 reflecting forest development and woody plant succession (variables such as tree density, woody plant species richness), and PC2 depicting bamboo density, which increased from 1 to 25 years and declined thereafter. 3. Bird species richness, abundance and diversity, increased rapidly and asymptotically during succession paralleling vegetation recovery as shown by positive correlations with fallow age and PC1 scores of sites. Bamboo density reflected by PC2 had a negative effect on bird species richness and abundance. 4. The bird community similarity (Morisita index) of sites with primary forest also increased asymptotically with fallow age indicating sequential species turnover during succession. Bird community similarity of sites with primary forest (or between sites) was positively correlated with both physiognomic and floristic similarities with primary forest (or between sites). 5. The number of bird species in guilds associated with forest development and woody plants (canopy insectivores, frugivores: bark feeders) was correlated with PCI scores of the sites. Species in other guilds (e. g. granivores, understorey insectivores) appeared to dominate during early and mid-succession. 6. The non-linear relationships imply that fallow periods less than a threshold of 25 years for birds, and about 50-75 years for woody plants, are likely to cause substantial community alteration. 7. As 5-10-year rotation periods or jhum cycles prevail in many parts of north-east India. there is a need to protect and conserve tracts of late-successional and primary forest.

Mean first passage time approach to the problem of optimal barrier subdivision for Kramer's escape rate

We consider the effect of subdividing the potential barrier along the reaction coordinate on Kramer's escape rate for a model potential, Using the known supersymmetric potential approach, we show the existence of an optimal number of subdivisions that maximizes the rate, We cast the problem as a mean first passage time problem of a biased random walker and obtain equivalent results, We briefly summarize the results of our investigation on the increase in the escape rate by placing a blow-torch in the unstable part of one of the potential wells. (C) 1999 Elsevier Science B.V. All rights reserved.

Optimal control of a stochastic hybrid system with discounted cost

We address the optimal control problem of a very general stochastic hybrid system with both autonomous and impulsive jumps. The planning horizon is infinite and we use the discounted-cost criterion for performance evaluation. Under certain assumptions, we show the existence of an optimal control. We then derive the quasivariational inequalities satisfied by the value function and establish well-posedness. Finally, we prove the usual verification theorem of dynamic programming.

A fault-tolerant distributed deadlock detection algorithm

In this paper, we propose a new fault-tolerant distributed deadlock detection algorithm which can handle loss of any resource release message. It is based on a token-based distributed mutual exclusion algorithm. We have evaluated and compared the performance of the proposed algorithm with two other algorithms which belong to two different classes, using simulation studies. The proposed algorithm is found to be efficient in terms of average number of messages per wait and average deadlock duration compared to the other two algorithms in all situations, and has comparable or better performance in terms of other parameters.

Jointly Optimal MMSE design for non-redundant FIR precoding and equalization

We provide a filterbank precoding framework (FBP) for frequency selective channels using the minimum mean squared error (MMSE) criterion. The design obviates the need for introducing a guard interval between successive blocks, and hence can achieve the maximum possible bandwidth efficiency. This is especially useful in cases where the channel is of a high order. We treat both the presence and the absence of channel knowledge at the transmitter. In the former case, we obtain the jointly optimal precoder-equalizer pair of the specified order. In the latter case, we use a zero padding precoder, and obtain the MMSE equalizer. No restriction on the dimension or nature of the channel matrix is imposed. Simulation results indicate that the filterbank approach outperforms block based methods like OFDM and eigenmode precoding.

Delay constrained optimal relay placement for planned wireless sensor networks

In this paper, we study the problem of wireless sensor network design by deploying a minimum number of additional relay nodes (to minimize network design cost) at a subset of given potential relay locationsin order to convey the data from already existing sensor nodes (hereafter called source nodes) to a Base Station within a certain specified mean delay bound. We formulate this problem in two different ways, and show that the problem is NP-Hard. For a problem in which the number of existing sensor nodes and potential relay locations is n, we propose an O(n) approximation algorithm of polynomial time complexity. Results show that the algorithm performs efficiently (in over 90% of the tested scenarios, it gave solutions that were either optimal or exceeding optimal just by one relay) in various randomly generated network scenarios.

A Complete Characterization of an Optimal Timer Based Selection Scheme

Timer-based mechanisms are often used in several wireless systems to help a given (sink) node select the best helper node among many available nodes. Specifically, a node transmits a packet when its timer expires, and the timer value is a function of its local suitability metric. In practice, the best node gets selected successfully only if no other node's timer expires within a `vulnerability' window after its timer expiry. In this paper, we provide a complete closed-form characterization of the optimal metric-to-timer mapping that maximizes the probability of success for any probability distribution function of the metric. The optimal scheme is scalable, distributed, and much better than the popular inverse metric timer mapping. We also develop an asymptotic characterization of the optimal scheme that is elegant and insightful, and accurate even for a small number of nodes.

Delay and energy optimal two-hop relaying in delay tolerant networks

We study the trade-off between delivery delay and energy consumption in delay tolerant mobile wireless networks that use two-hop relaying. The source may not have perfect knowledge of the delivery status at every instant. We formulate the problem as a stochastic control problem with partial information, and study structural properties of the optimal policy. We also propose a simple suboptimal policy. We then compare the performance of the suboptimal policy against that of the optimal control with perfect information. These are bounds on the performance of the proposed policy with partial information. Several other related open loop policies are also compared with these bounds.

Damped Belief Propagation Based Near-Optimal Equalization of Severely Delay-Spread UWB MIMO-ISI Channels

In this paper, we present a belief propagation (BP) based equalizer for ultrawideband (UWB) multiple-input multiple-output (MIMO) inter-symbol interference (ISI) channels characterized by severe delay spreads. We employ a Markov random field (MRF) graphical model of the system on which we carry out message passing. The proposed BP equalizer is shown to perform increasingly closer to optimal performance for increasing number of multipath components (MPC) at a much lesser complexity than that of the optimum equalizer. The proposed equalizer performs close to within 0.25 dB of SISO AWGN performance at 10-3 bit error rate on a severely delay-spread MIMO-ISI channel with 20 equal-energy MPCs. We point out that, although MIMO/UWB systems are characterized by fully/densely connected graphical models, the following two proposed features are instrumental in achieving near-optimal performance for large number of MPCs at low complexities: i) use of pairwise compatibility functions in densely connected MRFs, and ii) use of damping of messages.