Optimal eradication: when to stop looking for an invasive plant

The notion of being sure that you have completely eradicated an invasive species is fanciful because of imperfect detection and persistent seed banks. Eradication is commonly declared either on an ad hoc basis, on notions of seed bank longevity, or on setting arbitrary thresholds of 1% or 5% confidence that the species is not present. Rather than declaring eradication at some arbitrary level of confidence, we take an economic approach in which we stop looking when the expected costs outweigh the expected benefits. We develop theory that determines the number of years of absent surveys required to minimize the net expected cost. Given detection of a species is imperfect, the optimal stopping time is a trade-off between the cost of continued surveying and the cost of escape and damage if eradication is declared too soon. A simple rule of thumb compares well to the exact optimal solution using stochastic dynamic programming. Application of the approach to the eradication programme of Helenium amarum reveals that the actual stopping time was a precautionary one given the ranges for each parameter.

Effects of seasonal variability on FT-NIR prediction of dry matter content for whole Hass avocado fruit

Fourier Transform (FT)-near infra-red spectroscopy (NIRS) was investigated as a non-invasive technique for estimating percentage (%) dry matter of whole intact 'Hass' avocado fruit. Partial least squares (PLS) calibration models were developed from the diffuse reflectance spectra to predict % dry matter, taking into account effects of seasonal variation. It is found that seasonal variability has a significant effect on model predictive performance for dry matter in avocados. The robustness of the calibration model, which in general limits the application for the technique, was found to increase across years (seasons) when more seasonal variability was included in the calibration set. The R-v(2) and RMSEP for the single season prediction models predicting on an independent season ranged from 0.09 to 0.61 and 2.63 to 5.00, respectively, while for the two season models predicting on the third independent season, they ranged from 0.34 to 0.79 and 2.18 to 2.50, respectively. The bias for single season models predicting an independent season was as high as 4.429 but <= 1.417 for the two season combined models. The calibration model encompassing fruit from three consecutive years yielded predictive statistics of R-v(2) = 0.89, RMSEP = 1.43% dry matter with a bias of -0.021 in the range 16.1-39.7% dry matter for the validation population encompassing independent fruit from the three consecutive years. Relevant spectral information for all calibration models was obtained primarily from oil, carbohydrate and water absorbance bands clustered in the 890-980, 1005-1050, 1330-1380 and 1700-1790 nm regions. These results indicate the potential of FT-NIRS, in diffuse reflectance mode, to non-invasively predict the % dry matter of whole 'Hass' avocado fruit and the importance of the development of a calibration model that incorporates seasonal variation. Crown Copyright (c) 2012 Published by Elsevier B.V. All rights reserved.

Genetic and environmental influences on human responses to odors

Olfaction, the sense of smell, has many important functions in humans. Human responses to odors show substantial individual variation. Olfactory receptor genes have been identified and other genes may also influence olfaction. However, the proportion of phenotypic variation in odor response due to genetic variation remains largely unknown. Little is also known about which genes modify specific responses to odors. This study aimed to elucidate genetic and environmental influences on human responses to odors. Individuals from Finnish families (n=146) and Australian (n=413), British (n=163), Danish (n=336), and Finnish (n=399) twins rated intensity and pleasantness of a set of 12 (families) or 6 (twins) odors and tried to identify the odors. In addition, the participants rated their own sense of smell and annoyance experienced with different environmental odors. The odor stimuli of a commercial smell test (The Brief Smell Identification Test; banana, chocolate, cinnamon, gasoline, lemon, onion, paint thinner, pineapple, rose, smoke, soap, and turpentine) were presented in the family study. Based on the results of the family study and a literature survey, a new set of odor stimuli (androstenone, chocolate, cinnamon, isovaleric acid, lemon, and turpentine) was designed for the twin studies. In the family sample, heritabilities of the traits were estimated and underlying genomic regions were searched using a genome-wide linkage scan. In the pooled twin sample, variation in the measured traits was decomposed into genetic and environmental components using quantitative genetic modeling. In addition, associations between nongenetic factors (e.g., sex, age, and smoking) and olfactory-related traits were explored. Suggestive evidence for a genetic linkage for pleasantness of cinnamon at a locus on chromosome 4q32.3 emerged from the family sample. High heritability for the pleasantness of cinnamon was found in the family but not the twin study. Heritability of perceived intensity of androstenone odor was determined to be ~30% in the twin sample. A strong genetic correlation between perceived intensity and pleasantness of androstenone, in the absence of any environmental correlation, indicated that only the genetic correlation explained the phenotypic correlation between the traits (r=-0.27) and that the traits were influenced by an overlapping set of genes. Self-rated olfactory function appeared to reflect the odor annoyance experienced rather than actual olfactory acuity or genetic involvement. Results from nongenetic analyses supported the speculated superiority of females' olfactory abilities, the age-related diminishing of olfactory acuity, and the influences of experience-dependent factors on odor responses. This was the first study to estimate heritabilities and perform linkage screens for individual odors. A genetic effect was detected for only a few responses to specific odors, suggesting the predominance of environmental effects in odor perceptions.

Location of concentrators in a computer communication network: a stochastic automation search method

The following problem is considered. Given the locations of the Central Processing Unit (ar;the terminals which have to communicate with it, to determine the number and locations of the concentrators and to assign the terminals to the concentrators in such a way that the total cost is minimized. There is alao a fixed cost associated with each concentrator. There is ail upper limit to the number of terminals which can be connected to a concentrator. The terminals can be connected directly to the CPU also In this paper it is assumed that the concentrators can bo located anywhere in the area A containing the CPU and the terminals. Then this becomes a multimodal optimization problem. In the proposed algorithm a stochastic automaton is used as a search device to locate the minimum of the multimodal cost function . The proposed algorithm involves the following. The area A containing the CPU and the terminals is divided into an arbitrary number of regions (say K). An approximate value for the number of concentrators is assumed (say m). The optimum number is determined by iteration later The m concentrators can be assigned to the K regions in (mk) ways (m > K) or (km) ways (K>m).(All possible assignments are feasible, i.e. a region can contain 0,1,…, to concentrators). Each possible assignment is assumed to represent a state of the stochastic variable structure automaton. To start with, all the states are assigned equal probabilities. At each stage of the search the automaton visits a state according to the current probability distribution. At each visit the automaton selects a 'point' inside that state with uniform probability. The cost associated with that point is calculated and the average cost of that state is updated. Then the probabilities of all the states are updated. The probabilities are taken to bo inversely proportional to the average cost of the states After a certain number of searches the search probabilities become stationary and the automaton visits a particular state again and again. Then the automaton is said to have converged to that state Then by conducting a local gradient search within that state the exact locations of the concentrators are determined This algorithm was applied to a set of test problems and the results were compared with those given by Cooper's (1964, 1967) EAC algorithm and on the average it was found that the proposed algorithm performs better.

Statistical analysis of spectral data: A methodology for designing an intelligent monitoring system for the diabetic foot

Early detection of (pre-)signs of ulceration on a diabetic foot is valuable for clinical practice. Hyperspectral imaging is a promising technique for detection and classification of such (pre-)signs. However, the number of the spectral bands should be limited to avoid overfitting, which is critical for pixel classification with hyperspectral image data. The goal was to design a detector/classifier based on spectral imaging (SI) with a small number of optical bandpass filters. The performance and stability of the design were also investigated. The selection of the bandpass filters boils down to a feature selection problem. A dataset was built, containing reflectance spectra of 227 skin spots from 64 patients, measured with a spectrometer. Each skin spot was annotated manually by clinicians as "healthy" or a specific (pre-)sign of ulceration. Statistical analysis on the data set showed the number of required filters is between 3 and 7, depending on additional constraints on the filter set. The stability analysis revealed that shot noise was the most critical factor affecting the classification performance. It indicated that this impact could be avoided in future SI systems with a camera sensor whose saturation level is higher than 106, or by postimage processing.

Studies on the variants of the protein toxins ricin and abrin

his study elucidates some structural and biological features of galactose-binding variants of the cytotoxic proteins ricin and abrin. An isolation procedure is reported for ricin variants from Ricinus communis seeds by using lactamyl-Sepharose affinity matrix, similar to that reported previously for variants of abrin from Abrus precatorius seeds [Hegde, R., Maiti, T. K. & Podder, S. K. (1991) Anal. Biochem. 194, 101–109]. Ricin variants, subfractionated on carboxymethyl-Sepharose CL-6B ion-exchange chromatography, were characterized further by SDS/PAGE, IEF and a binding assay. Based on the immunological cross-reactivity of antibody raised against a single variant of each of ricin and abrin, it was established that all the variants of the corresponding type are immunologically indistinguishable. Analysis of protein titration curves on an immobilized pH gradient indicated that variants of abrin I differ from other abrin variants, mainly in their acidic groups and that variance in ricin is a cause of charge substitution. Detection of subunit variants of proteins by two-dimensional gel electrophoresis showed that there are twice as many subunit variants as there are variants of holoproteins, suggesting that each variant has a set of subunit variants, which, although homologous, are not identical to the subunits of any other variant with respect to pI. Seeds obtained from polymorphic species of R. communis showed no difference in the profile of toxin variants, as analyzed by isoelectric focussing. Toxin variants obtained from red and white varieties of A. precatorius, however, showed some difference in the number of variants as well as in their relative intensities. Furthermore, variants analyzed from several single seeds of A. precatorius red type revealed a controlled distribution of lectin variants in three specific groups, indicating an involvement of at least three genes in the production of Abrus lectins. The complete absence or presence of variants in each group suggested a post-translational differential proteolytic processing, a secondary event in the production of abrin variants.

Acoustic emission source location and damage detection in a metallic structure using a graph-theory-based geodesic pproach

A geodesic-based approach using Lamb waves is proposed to locate the acoustic emission (AE) source and damage in an isotropic metallic structure. In the case of the AE (passive) technique, the elastic waves take the shortest path from the source to the sensor array distributed in the structure. The geodesics are computed on the meshed surface of the structure using graph theory based on Dijkstra's algorithm. By propagating the waves in reverse virtually from these sensors along the geodesic path and by locating the first intersection point of these waves, one can get the AE source location. The same approach is extended for detection of damage in a structure. The wave response matrix of the given sensor configuration for the healthy and the damaged structure is obtained experimentally. The healthy and damage response matrix is compared and their difference gives the information about the reflection of waves from the damage. These waves are backpropagated from the sensors and the above method is used to locate the damage by finding the point where intersection of geodesics occurs. In this work, the geodesic approach is shown to be suitable to obtain a practicable source location solution in a more general set-up on any arbitrary surface containing finite discontinuities. Experiments were conducted on aluminum specimens of simple and complex geometry to validate this new method.

A geometric approach for determining inner and exterior boundaries of workspaces of planar manipulators

In this paper a method to determine the internal and external boundaries of planar workspaces, represented with an ordered set of points, is presented. The sequence of points are grouped and can be interpreted to form a sequence of curves. Three successive curves are used for determining the instantaneous center of rotation for the second one of them. The two extremal points on the curve with respect to the instantaneous center are recognized as singular points. The chronological ordering of these singular points is used to generate the two envelope curves, which are potentially intersecting. Methods have been presented in the paper for the determination of the workspace boundary from the envelope curves. Strategies to deal with the manipulators with joint limits and various degenerate situations have also been discussed. The computational steps being completely geometric, the method does not require the knowledge about the manipulator's kinematics. Hence, it can be used for the workspace of arbitrary planar manipulators. A number of illustrative examples demonstrate the efficacy of the proposed method.

An efficient algorithm for scheduling in bluetooth piconets and scatternets

Bluetooth is a short-range radio technology operating in the unlicensed industrial-scientific-medical (ISM) band at 2.45 GHz. A piconet is basically a collection of slaves controlled by a master. A scatternet, on the other hand, is established by linking several piconets together in an ad hoc fashion to yield a global wireless ad hoc network. This paper proposes a scheduling policy that aims to achieve increased system throughput and reduced packet delays while providing reasonably good fairness among all traffic flows in bluetooth piconets and scatternets. We propose a novel algorithm for scheduling slots to slaves for both piconets and scatternets using multi-layered parameterized policies. Our scheduling scheme works with real data and obtains an optimal feedback policy within prescribed parameterized classes of these by using an efficient two-timescale simultaneous perturbation stochastic approximation (SPSA) algorithm. We show the convergence of our algorithm to an optimal multi-layered policy. We also propose novel polling schemes for intra- and inter-piconet scheduling that are seen to perform well. We present an extensive set of simulation results and performance comparisons with existing scheduling algorithms. Our results indicate that our proposed scheduling algorithm performs better overall on a wide range of experiments over the existing algorithms for both piconets (Das et al. in INFOCOM, pp. 591–600, 2001; Lapeyrie and Turletti in INFOCOM conference proceedings, San Francisco, US, 2003; Shreedhar and Varghese in SIGCOMM, pp. 231–242, 1995) and scatternets (Har-Shai et al. in OPNETWORK, 2002; Saha and Matsumot in AICT/ICIW, 2006; Tan and Guttag in The 27th annual IEEE conference on local computer networks(LCN). Tampa, 2002). Our studies also confirm that our proposed scheme achieves a high throughput and low packet delays with reasonable fairness among all the connections.

An efficient and optimized bluetooth scheduling algorithm for piconets

Bluetooth is an emerging standard in short range, low cost and low power wireless networks. MAC is a generic polling based protocol, where a central Bluetooth unit (master) determines channel access to all other nodes (slaves) in the network (piconet). An important problem in Bluetooth is the design of efficient scheduling protocols. This paper proposes a polling policy that aims to achieve increased system throughput and reduced packet delays while providing reasonably good fairness among all traffic flows in a Bluetooth Piconet. We present an extensive set of simulation results and performance comparisons with two important existing algorithms. Our results indicate that our proposed scheduling algorithm outperforms the Round Robin scheduling algorithm by more than 40% in all cases tried. Our study also confirms that our proposed policy achieves higher throughput and lower packet delays with reasonable fairness among all the connections.

Book review: "Kozak, M., & Kozak, N. (Eds). 2008. Destination Marketing: An International Perspective. Wallingford, Oxon: Routledge"

This edited volume contains 18 chapters by 40 contributors from many parts the world, and is divided into four thematic sections. The focus of Part 1 is Destination image, and contains five chapters. This has arguably been the most popular topic in the destination marketing literature, underpinned by the knowledge that the image an individual holds of a destination is as important as any tangible features. Yin Chew and Siti Johari attempt to model the relationship between destination image and country image using structural equation modelling. While this does address an important gap in the literature, the measures used to operationalise the constructs are not reported and little of the data analysis is discussed to support the finding that country image is a predictor of destination image. Ana Rodriquez, Antonia Correia and Metin Kozak report the findings of an exploratory study about lakedestination image. They used a neural network content analysis of 40 lake descriptions featuring on an online directory for lake enthusiasts to derive a set of cognitive attribute themes. Yang Zhang and Yi-Wei Xiao explore the relations between literary works and tourism through the Asian voice. Whereas most literary tourism studies have been around Western culture, this is a rare perspective from Chinese culture...

Relation between part position and kinematic freedom: An expository survey

This paper makes explicit the relation between relative part position and kinematic freedom of the parts which is implicitly available in the literature. An extensive set of representative papers in the areas of assembly and kinematic modelling is reviewed to specifically identify how the ideas in the two areas are related and influencing the development of each other. The papers are categorised by the approaches followed in the specification, representation, and solution of the part relations. It is observed that the extent of the part geometry is not respected in modelling schemes and as a result, the causal flow of events (proximity–contact–mobility) during the assembling process is not realised in the existing modelling paradigms, which are focusing on either the relative positioning problem or the relative motion problem. Though an assembly is a static description of part configuration, achievement of this configuration requires availability of relative motion for bringing parts together during the assembly process. On the other hand, the kinematic freedom of a part depends on the nature of contacting regions with other parts in its static configuration. These two problems are thus related through the contact geometry. The chronology of the approaches that significantly contributed to the development of the subject is also included in the paper.

A unified model for auxiliary switch commutated DC-DC converters

A novel ZVS auxiliary switch commutated variation for all DGDC converter topologies has been proposed in 2006. With proper designation of the circuit variables (throw current I and the pole voltage V), all these converters are seen to be governed by an identical set of equations. With idealized switches, the steady-state performance is obtainable in an analytical form. The conversion ratio of the converter topologies is obtained. A generalized equivalent circuit emerges for all these converters from the steady-state conversion ratio. It also provides a dynamic model as well. With these generalized steady-state equivalent circuits, small signal analysis of these converters may be carried out readily. It enables one to use the familiar state space averaged results of the standard PWM DGDC converters for the resonant counterparts. Th dc and ac models reveals that dc and low frequency behaviour of the proposed family of converters is similiar to that of its PWM parent

An SIMD machine for low-level vision

This paper presents an SIMD machine which has been tuned to execute low-level vision algorithms employing the relaxation labeling paradigm. Novel features of the design include: 1. (1) a communication scheme capable of window accessing under a single instruction. 2. (2) flexible I/O instructions to load overlapped data segments; and 3. (3) data-conditional instructions which can be nested to an arbitrary degree. A time analysis of the stereo correspondence problem, as implemented on a simulated version of the machine using the probabilistic relaxation technique, shows a speed up of almost N2 for an N × N array of PEs.

Support theorems on R-n and non-compact symmetric spaces

We consider convolution equations of the type f * T = g, where f, g is an element of L-P (R-n) and T is a compactly supported distribution. Under natural assumptions on the zero set of the Fourier transform of T, we show that f is compactly supported, provided g is. Similar results are proved for non-compact symmetric spaces as well. (C) 2010 Elsevier Inc. All rights reserved.