Temporal variation in arthropod sampling effectiveness: the case for using the beat sheet method in cotton

Predatory insects and spiders are key elements of integrated pest management (IPM) programmes in agricultural crops such as cotton. Management decisions in IPM programmes should to be based on a reliable and efficient method for counting both predators and pests. Knowledge of the temporal constraints that influence sampling is required because arthropod abundance estimates are likely to vary over a growing season and within a day. Few studies have adequately quantified this effect using the beat sheet, a potentially important sampling method. We compared the commonly used methods of suction and visual sampling to the beat sheet, with reference to an absolute cage clamp method for determining the abundance of various arthropod taxa over 5 weeks. There were significantly more entomophagous arthropods recorded using the beat sheet and cage clamp methods than by using suction or visual sampling, and these differences were more pronounced as the plants grew. In a second trial, relative estimates of entomophagous and phytophagous arthropod abundance were made using beat sheet samples collected over a day. Beat sheet estimates of the abundance of only eight of the 43 taxa examined were found to vary significantly over a day. Beat sheet sampling is recommended in further studies of arthropod abundance in cotton, but researchers and pest management advisors should bear in mind the time of season and time of day effects.

Measuring nonlinear functionals of quantum harmonic oscillator states

Using only linear interactions and a local parity measurement we show how entanglement can be detected between two harmonic oscillators. The scheme generalizes to measure both linear and nonlinear functionals of an arbitrary oscillator state. This leads to many applications including purity tests, eigenvalue estimation, entropy, and distance measures-all without the need for nonlinear interactions or complete state reconstruction. Remarkably, experimental realization of the proposed scheme is already within the reach of current technology with linear optics.

Ba0.5Sr0.5Co0.8Fe0.2O3-delta ceramic hollow-fiber membranes for oxygen permeation

Setf-supported asymmetric hollow-fiber membranes of mixed oxygen-ionic and electronic conducting perovskite Ba0.5Sr0.5Co0.8Fe0.2O3-delta (BSCF) were prepared by a combined phase-inversion and sintering technique. The starting inorganic powder was synthesized by combined EDTA-citrate complexing process followed by thermal treatment at 600 degrees C. The powder was dispersed in a polymer solution and then extruded into hollow-fiber precursors through a spinneret. ne fiber precursors were sintered at elevated temperatures to form gastight membranes, which were characterized by SEM and gas permeation tests. Performance of the hollow fibers in air separation was both experimentally and theoretically studied at various conditions. The results reveal that the oxygen permeation process was controlled by the slow oxygen surface exchange kinetics under the investigated conditions. The porous inner surface of the prepared perovskite hollow-fiber membranes considerably favored the oxygen permeation. The maximum oxygen flux measured was 0.031 mol-m(-2).s(-1) at 950 degrees C with the sweep gas flow rate of 0.522 mol(.)m(-2).s(-1). To improve the oxygen flux of BSCF perovskite membranes, future work should be focused on surface modification rather than reduction of the membrane thickness. (c) 2006 American Institute of Chemical Engineers.

An efficient algorithm for partitioning parameterized polygons into rectangles

In this paper, we propose an algorithm for partitioning parameterized orthogonal polygons into rectangles. The algorithm is based on the plane-sweep technique and can be used for partitioning polygons which contain holes. The input to the algorithm consists of the contour of a parameterized polygon to be partitioned and the constraints for those parameters which reside in the contour. The algorithm uses horizontal cuts only and generates a minimum number of rectangles whose union is the original orthogonal polygon. The proposed algorithm can be used as the basis to build corner stitching data structure for parameterized VLSI layouts and has been implemented in Java programming language. Copyright © 2010 ACM, Inc.

The arithmetic of receiver scheduling for electronic support

In Electronic Support, it is well known that periodic search strategies for swept-frequency superheterodyne receivers (SHRs) can cause synchronisation with the radar it seeks to detect. Synchronisation occurs when the periods governing the search strategies of the SHR and radar are commensurate. The result may be that the radar is never detected. This paper considers the synchronisation problem in depth. We find that there are usually a finite number of synchronisation ratios between the radar’s scan period and the SHR’s sweep period. We develop three geometric constructions by which these ratios can be found and we relate them to the Farey series. The ratios may be used to determine the intercept time for any combination of scan and sweep period. This theory can assist the operator of an SHR in selecting a sweep period that minimises the intercept time against a number of radars in a threat emitter list.