A simple device for the separation of weak larvae of Macrobrachium rosenbergii (De Man)

Larvae of Macrobrachium rosenbergii (De Man) are photopositive (Ling 1969a.b) and negatively rheotactic. While investigating larval diseases of M, rosenbergii it was observed that weak larvae failed to show both these responses. It was felt that this lack of response could be used to develop a device for separating the weak larvae from the apparently healthy ones. Such a device would be a valuable tool for assessing the health of a batch in terms of the percentage of 'healthy' and 'weak' larvae. What follows is a description and mode of operation of the 'photo-flow' device developed by the authors

A simple regulated power supply for characteristics studies of klystron oscillators

A simple and inexpensive power supply suitable for characteristics studies of a klystron is described. The circuit is a modified form of the high voltage adjustable power supply based on LM 317. This provides the necessary cavity and repeller voltages over a wide range, with good regulation. The system is protected aa- ainst short circuits and is ideallv suitable for laboratorv, ex.Deri ments with reflex klystrons.

Simple approach to determine resonant frequencies of microstrip antennas

A simple approach for accurate determination of the resonant frequencies of microstrip antennas of regular geometries is developed and presented. In this approach, a generalised empirical formula for the computation of effective dielectric permittivity is given which takes into account the ratio of the fringing area to the area of the patch. A correction to the equivalent side length of an equilateral triangular patch, previously published, is modified and a new formula is given. A correction to the effective dimensions of an elliptical microstrip antenna is also carried out. Numerical results obtained for the resonant frequencies of elliptical, circular, rectangular and equilateral-triangular microstrip antennas are in good agreement with the available theoretical and experimental results reported by others. The present approach is more efficient, simpler and more accurate

Comments on Simple and Accurate Formula for the Resonant Frequency of the Equilateral Triangular Microstrip Patch Antenna

Antennas and Propagation, IEEE Transactions on,VOL 48,issue 4,pp 636

Bayesian Analysis of Simple Step-stress Model under Weibull Lifetimes

Department of Statistics, Cochin University of Science & Technology, Part of this work has been supported by grants from DST and CSIR, Government of India. 2Department of Mathematics and Statistics, IIT Kanpur

On the Gap-Complexity of Simple RL-Automata

Analysis by reduction is a method used in linguistics for checking the correctness of sentences of natural languages. This method is modelled by restarting automata. All types of restarting automata considered in the literature up to now accept at least the deterministic context-free languages. Here we introduce and study a new type of restarting automaton, the so-called t-RL-automaton, which is an RL-automaton that is rather restricted in that it has a window of size one only, and that it works under a minimal acceptance condition. On the other hand, it is allowed to perform up to t rewrite (that is, delete) steps per cycle. Here we study the gap-complexity of these automata. The membership problem for a language that is accepted by a t-RL-automaton with a bounded number of gaps can be solved in polynomial time. On the other hand, t-RL-automata with an unbounded number of gaps accept NP-complete languages.

On the Descriptional Complexity of Simple RL-Automata

Analysis by reduction is a method used in linguistics for checking the correctness of sentences of natural languages. This method is modelled by restarting automata. Here we study a new type of restarting automaton, the so-called t-sRL-automaton, which is an RL-automaton that is rather restricted in that it has a window of size 1 only, and that it works under a minimal acceptance condition. On the other hand, it is allowed to perform up to t rewrite (that is, delete) steps per cycle. We focus on the descriptional complexity of these automata, establishing two complexity measures that are both based on the description of t-sRL-automata in terms of so-called meta-instructions. We present some hierarchy results as well as a non-recursive trade-off between deterministic 2-sRL-automata and finite-state acceptors.

A simple retroelement based knock-down system in Dictyostelium

Characteristics of DIRS-1 Mediated Knock-Downs __ We have previously shown that the most abundant Dictyostelium discoideum retroelement DIRS-1 is suppressed by RNAi mechanisms. Here we provide evidence that both inverted terminal repeats have strong promoter activity and that bidirectional expression apparently generates a substrate for Dicer. A cassette containing the inverted terminal repeats and a fragment of a gene of interest was sufficient to activate the RNAi response, resulting in the generation of ~21 nt siRNAs, a reduction of mRNA and protein expression of the respective endogene. Surprisingly, no transitivity was observed on the endogene. This was in contrast to previous observations, where endogenous siRNAs caused spreading on an artificial transgene. Knock-down was successful on seven target genes that we examined. In three cases a phenotypic analysis proved the efficiency of the approach. One of the target genes was apparently essential because no knock-out could be obtained; the RNAi mediated knock-down, however, resulted in a very slow growing culture indicating a still viable reduction of gene expression.

Safe Distributed Coordination of Heterogeneous Robots through Dynamic Simple Temporal Networks

Research on autonomous intelligent systems has focused on how robots can robustly carry out missions in uncertain and harsh environments with very little or no human intervention. Robotic execution languages such as RAPs, ESL, and TDL improve robustness by managing functionally redundant procedures for achieving goals. The model-based programming approach extends this by guaranteeing correctness of execution through pre-planning of non-deterministic timed threads of activities. Executing model-based programs effectively on distributed autonomous platforms requires distributing this pre-planning process. This thesis presents a distributed planner for modelbased programs whose planning and execution is distributed among agents with widely varying levels of processor power and memory resources. We make two key contributions. First, we reformulate a model-based program, which describes cooperative activities, into a hierarchical dynamic simple temporal network. This enables efficient distributed coordination of robots and supports deployment on heterogeneous robots. Second, we introduce a distributed temporal planner, called DTP, which solves hierarchical dynamic simple temporal networks with the assistance of the distributed Bellman-Ford shortest path algorithm. The implementation of DTP has been demonstrated successfully on a wide range of randomly generated examples and on a pursuer-evader challenge problem in simulation.

Information Dissemination and Aggregation in Asset Markets with Simple Intelligent Traders

Various studies of asset markets have shown that traders are capable of learning and transmitting information through prices in many situations. In this paper we replace human traders with intelligent software agents in a series of simulated markets. Using these simple learning agents, we are able to replicate several features of the experiments with human subjects, regarding (1) dissemination of information from informed to uninformed traders, and (2) aggregation of information spread over different traders.

Face processing in humans is compatible with a simple shape-based model of vision

Understanding how the human visual system recognizes objects is one of the key challenges in neuroscience. Inspired by a large body of physiological evidence (Felleman and Van Essen, 1991; Hubel and Wiesel, 1962; Livingstone and Hubel, 1988; Tso et al., 2001; Zeki, 1993), a general class of recognition models has emerged which is based on a hierarchical organization of visual processing, with succeeding stages being sensitive to image features of increasing complexity (Hummel and Biederman, 1992; Riesenhuber and Poggio, 1999; Selfridge, 1959). However, these models appear to be incompatible with some well-known psychophysical results. Prominent among these are experiments investigating recognition impairments caused by vertical inversion of images, especially those of faces. It has been reported that faces that differ "featurally" are much easier to distinguish when inverted than those that differ "configurally" (Freire et al., 2000; Le Grand et al., 2001; Mondloch et al., 2002) ??finding that is difficult to reconcile with the aforementioned models. Here we show that after controlling for subjects' expectations, there is no difference between "featurally" and "configurally" transformed faces in terms of inversion effect. This result reinforces the plausibility of simple hierarchical models of object representation and recognition in cortex.

Moderating effects of management control systems and innovation on performance. Simple methods for correcting the effects of measurement error for interaction effects in small samples

In the accounting literature, interaction or moderating effects are usually assessed by means of OLS regression and summated rating scales are constructed to reduce measurement error bias. Structural equation models and two-stage least squares regression could be used to completely eliminate this bias, but large samples are needed. Partial Least Squares are appropriate for small samples but do not correct measurement error bias. In this article, disattenuated regression is discussed as a small sample alternative and is illustrated on data of Bisbe and Otley (in press) that examine the interaction effect of innovation and style of use of budgets on performance. Sizeable differences emerge between OLS and disattenuated regression

Kriging coordinates: what does that mean?

Kriging is an interpolation technique whose optimality criteria are based on normality assumptions either for observed or for transformed data. This is the case of normal, lognormal and multigaussian kriging. When kriging is applied to transformed scores, optimality of obtained estimators becomes a cumbersome concept: back-transformed optimal interpolations in transformed scores are not optimal in the original sample space, and vice-versa. This lack of compatible criteria of optimality induces a variety of problems in both point and block estimates. For instance, lognormal kriging, widely used to interpolate positive variables, has no straightforward way to build consistent and optimal confidence intervals for estimates. These problems are ultimately linked to the assumed space structure of the data support: for instance, positive values, when modelled with lognormal distributions, are assumed to be embedded in the whole real space, with the usual real space structure and Lebesgue measure

La pàgina web del centre : més enllà d'una simple pàgina web. 'La página web del centro : más allá de una simple página web'.

Resumen tomado de la publicación. Contiene imágenes de la página web capturadas de la pantalla del ordenador