An electrochemical DNA sensor based on electrodepositing aluminum ion films on stearic acid-modified carbon paste electrode and its application for the detection of specific sequences related to bar gene and CP4 Epsps gene

An electrochemical DNA biosensor was fabricated by immobilizing DNA probe on aluminum ion films that were electrodeposited on the surface of the stearic acid-modified carbon paste electrode (CPE). DNA immobilization and hybridization were characterized with cyclic voltammetry (CV) by using methylene blue (MB) as indicator. MB has a couple of well-defined voltammetric redox peaks at the CPE. The currents of redox peaks of MB decreased after depositing aluminum ion films on the CPE (Al(III)/CPE) and increased dramatically after immobilizing DNA probe (ssDNA/Al(III)/CPE). Hybridization of DNA probe led to a marked decrease of the peak currents of MB, which can be used to detect the target single-stranded DNA. The conditions for the preparation of Al(III)/CPE, and DNA immobilization and hybridization were optimized. The specific sequences related to bar transgene in the transgenic corn and the PCR amplification of CP4 epsps gene from the sample of transgenic roundup ready soybean were detected by differential pulse voltammetry (DPV) with this new electrochemical DNA biosensor. The difference between the peak currents of MB at ssDNA/Al(III)/CPE and that at hybridization DNA modified electrode (dsDNA/Al(III)/CPE) was applied to determine the Specific sequence related to the target bar gene with the dynamic range comprised between 1.0 X 10(-7) mol/L to 1.0 x 10(-4) mol/L. A detection limit of 2.25 x.10(-8) mol/L. of oligonucleotides can be estimated.

Effective elastic properties of piezoelectric composites with radially polarized cylinders

Effective elastic properties of piezoelectric composites containing an infinitely long, radially polarized cylinder embedded in an isotropic non-piezoelectric matrix are theoretically investigated under an external strain field. Analytical solutions of elastic displacement and electric potentials are exactly derived, and the effective elastic responses are formulated in the dilute limit. Meanwhile, a vanishing piezoelectric response mechanism is revealed in the piezoelectric composite containing radially polarized cylinders. Furthermore, it is shown that the effective elastic properties can be enhanced (or reduced) due to the increase of the piezoelectric (or dielectric) constants of the cylinders. (C) 2009 Elsevier B.V. All rights reserved.

Effective properties of spherically anisotropic piezoelectric composites

Piezoelectric composites consisting of spherically anisotropic piezoelectric inclusions (i.e., piezoceramic material) in an infinite nonpiezoelectric matrix under a uniform electric field are theoretically investigated. Analytical solutions for the elastic displacements and the electric potentials are derived exactly. Taking account of the coupling effects of elasticity, permittivity, and piezoelectricity, formulas are derived for the effective dielectric and piezoelectric responses in the dilute limit. A piezoelectric response mechanism is revealed, in which the effective piezoelectric response vanishes irrespective of how much spherically anisotropic piezoelectric inclusions are inside. Moreover, the effective coupled responses of the piezoelectric composites show that the effective dielectric responses decrease (increase) as the inclusion elastic (piezoelectric) constants increase.

Dielectric response of spherically anisotropic graded piezoelectric composites

A graded piezoelectric composite consisting of a spherically anisotropic graded piezoelectric inclusion imbedded in an infinite nonpiezoelectric matrix, with the physical properties of the graded spherical inclusion having a power-law profile with respect to the radial variable r, is studied theoretically. Under an external uniform electric field, the electric displacement field and the elastic stress tensor field of this spherically anisotropic graded piezoelectric composite are derived exactly by means of displacement separation technique, based on the governing equations in the dilute limit. A piezoelectric response mechanism, in which the effective piezoelectric response vanishes along the z direction (or x,y directions), is revealed in this kind of graded piezoelectric composites. Furthermore, it is found that the effective dielectric constant decreases (or increases) with the volume fraction p of the inclusions if the exponent parameter k of the grading profile is larger (or smaller) than a critical value. (C) 2007 American Institute of Physics.

Assessing the potential of VEGETATION sensor data for mapping snow and ice cover: a Normalized Difference Snow and Ice Index

The VEGETATION (VGT) sensor in SPOT 4 has four spectral bands that are equivalent to Landsat Thematic Mapper (TM) bands (blue, red, near-infrared and mid-infrared spectral bands) and provides daily images of the global land surface at a 1-km spatial resolution. We propose a new index for identifying and mapping of snow ice cover, namely the Normalized Difference Snow/Ice Index (NDSII), which uses reflectance values of red and mid-infrared spectral bands of Landsat TM and VGT. For Landsat TM data, NDSII is calculated as NDSIITM =(TM3 -TM5)/(TM3 +TM5); for VGT data, NDSII is calculated as NDSIIVGT =(B2- MIR)/(B2 + MIR). As a case study we used a Landsat TM image that covers the eastern part of the Qilian mountain range in the Qinghai-Xizang (Tibetan) plateau of China. NDSIITM gave similar estimates of the area and spatial distribution of snow/ice cover to the Normalized Difference Snow Index (NDSI=(TM2-TM5)/(TM2+TM5)) which has been proposed by Hall et al. The results indicated that the VGT sensor might have the potential for operational monitoring and mapping of snow/ice cover from regional to global scales, when using NDSIIVGT.

Affine Matching with Bounded Sensor Error: A Study of Geometric Hashing and Alignment

Affine transformations are often used in recognition systems, to approximate the effects of perspective projection. The underlying mathematics is for exact feature data, with no positional uncertainty. In practice, heuristics are added to handle uncertainty. We provide a precise analysis of affine point matching, obtaining an expression for the range of affine-invariant values consistent with bounded uncertainty. This analysis reveals that the range of affine-invariant values depends on the actual $x$-$y$-positions of the features, i.e. with uncertainty, affine representations are not invariant with respect to the Cartesian coordinate system. We analyze the effect of this on geometric hashing and alignment recognition methods.

Calibração e validação de sensor dielétrico para estimativa de teor de água em solos do Cerrado.

2008

Declarative sensor knowledge in a robot monitoring system

Hardy, N. W., Barnes, D. P., Lee, M. (1987). Declarative sensor knowledge in a robot monitoring system. In: Languages for Sensor-Based Control in Robotics, Ulrich Rembold and Klaus H?rmann (eds), Springer-Verlag, p. 169-188.

A control and monitoring system for multiple-sensor industrial robots

Barnes, D. P., Lee, M. H., Hardy, N. W. (1983). A control and monitoring system for multiple-sensor industrial robots. In Proc. 3rd. Int. Conf. Robot Vision and Sensory Controls, Cambridge, MA. USA., 471-479.

Tactile Sensing for Mechatronics: A State of the Art Survey

Lee M.H. and Nicholls H.R., Tactile Sensing for Mechatronics: A State of the Art Survey, Mechatronics, 9, Jan 1999, pp1-31.

SEP: A Stable Election Protocol for clustered heterogeneous wireless sensor networks

We study the impact of heterogeneity of nodes, in terms of their energy, in wireless sensor networks that are hierarchically clustered. In these networks some of the nodes become cluster heads, aggregate the data of their cluster members and transmit it to the sink. We assume that a percentage of the population of sensor nodes is equipped with additional energy resources-this is a source of heterogeneity which may result from the initial setting or as the operation of the network evolves. We also assume that the sensors are randomly (uniformly) distributed and are not mobile, the coordinates of the sink and the dimensions of the sensor field are known. We show that the behavior of such sensor networks becomes very unstable once the first node dies, especially in the presence of node heterogeneity. Classical clustering protocols assume that all the nodes are equipped with the same amount of energy and as a result, they can not take full advantage of the presence of node heterogeneity. We propose SEP, a heterogeneous-aware protocol to prolong the time interval before the death of the first node (we refer to as stability period), which is crucial for many applications where the feedback from the sensor network must be reliable. SEP is based on weighted election probabilities of each node to become cluster head according to the remaining energy in each node. We show by simulation that SEP always prolongs the stability period compared to (and that the average throughput is greater than) the one obtained using current clustering protocols. We conclude by studying the sensitivity of our SEP protocol to heterogeneity parameters capturing energy imbalance in the network. We found that SEP yields longer stability region for higher values of extra energy brought by more powerful nodes.

DIP: Density Inference Protocol for wireless sensor networks and its application to density-unbiased statistics

Wireless sensor networks have recently emerged as enablers of important applications such as environmental, chemical and nuclear sensing systems. Such applications have sophisticated spatial-temporal semantics that set them aside from traditional wireless networks. For example, the computation of temperature averaged over the sensor field must take into account local densities. This is crucial since otherwise the estimated average temperature can be biased by over-sampling areas where a lot more sensors exist. Thus, we envision that a fundamental service that a wireless sensor network should provide is that of estimating local densities. In this paper, we propose a lightweight probabilistic density inference protocol, we call DIP, which allows each sensor node to implicitly estimate its neighborhood size without the explicit exchange of node identifiers as in existing density discovery schemes. The theoretical basis of DIP is a probabilistic analysis which gives the relationship between the number of sensor nodes contending in the neighborhood of a node and the level of contention measured by that node. Extensive simulations confirm the premise of DIP: it can provide statistically reliable and accurate estimates of local density at a very low energy cost and constant running time. We demonstrate how applications could be built on top of our DIP-based service by computing density-unbiased statistics from estimated local densities.

On the Interaction between Data Aggregation and Topology Control in Wireless Sensor Networks

Wireless sensor networks are characterized by limited energy resources. To conserve energy, application-specific aggregation (fusion) of data reports from multiple sensors can be beneficial in reducing the amount of data flowing over the network. Furthermore, controlling the topology by scheduling the activity of nodes between active and sleep modes has often been used to uniformly distribute the energy consumption among all nodes by de-synchronizing their activities. We present an integrated analytical model to study the joint performance of in-network aggregation and topology control. We define performance metrics that capture the tradeoffs among delay, energy, and fidelity of the aggregation. Our results indicate that to achieve high fidelity levels under medium to high event reporting load, shorter and fatter aggregation/routing trees (toward the sink) offer the best delay-energy tradeoff as long as topology control is well coordinated with routing.

M^2RC: Multiplicative-increase/additive-decrease Multipath Routing Control for Wireless Sensor Networks

Routing protocols in wireless sensor networks (WSN) face two main challenges: first, the challenging environments in which WSNs are deployed negatively affect the quality of the routing process. Therefore, routing protocols for WSNs should recognize and react to node failures and packet losses. Second, sensor nodes are battery-powered, which makes power a scarce resource. Routing protocols should optimize power consumption to prolong the lifetime of the WSN. In this paper, we present a new adaptive routing protocol for WSNs, we call it M^2RC. M^2RC has two phases: mesh establishment phase and data forwarding phase. In the first phase, M^2RC establishes the routing state to enable multipath data forwarding. In the second phase, M^2RC forwards data packets from the source to the sink. Targeting hop-by-hop reliability, an M^2RC forwarding node waits for an acknowledgement (ACK) that its packets were correctly received at the next neighbor. Based on this feedback, an M^2RC node applies multiplicative-increase/additive-decrease (MIAD) to control the number of neighbors targeted by its packet broadcast. We simulated M^2RC in the ns-2 simulator and compared it to GRAB, Max-power, and Min-power routing schemes. Our simulations show that M^2RC achieves the highest throughput with at least 10-30% less consumed power per delivered report in scenarios where a certain number of nodes unexpectedly fail.

Approximately Uniform Random Sampling in Sensor Networks

Recent work in sensor databases has focused extensively on distributed query problems, notably distributed computation of aggregates. Existing methods for computing aggregates broadcast queries to all sensors and use in-network aggregation of responses to minimize messaging costs. In this work, we focus on uniform random sampling across nodes, which can serve both as an alternative building block for aggregation and as an integral component of many other useful randomized algorithms. Prior to our work, the best existing proposals for uniform random sampling of sensors involve contacting all nodes in the network. We propose a practical method which is only approximately uniform, but contacts a number of sensors proportional to the diameter of the network instead of its size. The approximation achieved is tunably close to exact uniform sampling, and only relies on well-known existing primitives, namely geographic routing, distributed computation of Voronoi regions and von Neumann's rejection method. Ultimately, our sampling algorithm has the same worst-case asymptotic cost as routing a point-to-point message, and thus it is asymptotically optimal among request/reply-based sampling methods. We provide experimental results demonstrating the effectiveness of our algorithm on both synthetic and real sensor topologies.