There is, I think, something ethereal about i —the square root of minus one. I remember first hearing about it at school. It seemed an odd beast at that time—an intruder hovering on the edge of reality.

Usually familiarity dulls this sense of the bizarre, but in the case of i it was the reverse: over the years the sense of its surreal nature intensified. It seemed that it was impossible to write mathematics that described the real world in …

I and i

Three parallel algorithms for classical molecular dynamics are presented. The first assigns each processor a fixed subset of atoms; the second assigns each a fixed subset of inter-atomic forces to compute; the third assigns each a fixed spatial region. The algorithms are suitable for molecular dynamics models which can be difficult to parallelize efficiently—those with short-range forces where the neighbors of each atom change rapidly. They can be implemented on any distributed-memory parallel machine which allows for message-passing of data between independently executing processors. The algorithms are tested on a standard Lennard-Jones benchmark problem for system sizes ranging from 500 to 100,000,000 atoms on several parallel supercomputers--the nCUBE 2, Intel iPSC/860 and Paragon, and Cray T3D. Comparing the results to the fastest reported vectorized Cray Y-MP and C90 algorithm shows that the current generation of parallel machines is competitive with conventional vector supercomputers even for small problems. For large problems, the spatial algorithm achieves parallel efficiencies of 90% and a 1840-node Intel Paragon performs up to 165 faster than a single Cray C9O processor. Trade-offs between the three algorithms and guidelines for adapting them to more complex molecular dynamics simulations are also discussed.

Fast parallel algorithms for short-range molecular dynamics

The term ‘‘Internet-of-Things’’ is used as an umbrella keyword for covering various aspects related to the extension of the Internet and the Web into the physical realm, by means of the widespread deployment of spatially distributed devices with embedded identification, sensing and/or actuation capabilities. Internet-of-Things envisions a future in which digital and physical entities can be linked, by means of appropriate information and communication technologies, to enable a whole new class of applications and services. In this article, we present a survey of technologies, applications and research challenges for Internetof-Things.

/pdf/internet-of-things-vision-applications-and-research-4xfstaiv80.pdf

Internet of things: Vision, applications and research challenges

Molecular self-assembly is the spontaneous association of molecules under equilibrium conditions into stable, structurally well-defined aggregates joined by noncovalent bonds. Molecular self-assembly is ubiquitous in biological systems and underlies the formation of a wide variety of complex biological structures. Understanding self-assembly and the associated noncovalent interactions that connect complementary interacting molecular surfaces in biological aggregates is a central concern in structural biochemistry. Self-assembly is also emerging as a new strategy in chemical synthesis, with the potential of generating nonbiological structures with dimensions of 1 to 10(2) nanometers (with molecular weights of 10(4) to 10(10) daltons). Structures in the upper part of this range of sizes are presently inaccessible through chemical synthesis, and the ability to prepare them would open a route to structures comparable in size (and perhaps complementary in function) to those that can be prepared by microlithography and other techniques of microfabrication.

Molecular self-assembly and nanochemistry: A chemical strategy for the synthesis of nanostructures

https://www.cell.com/trends/plant-science/pdf/S1360-1385(10)00032-4.pdf

WRKY transcription factors.

Node self-localization is a key research topic for wireless sensor networks (WSNs). There are two main algorithms, the triangulation method and the maximum likelihood (ML) estimator, for angle of arrival (AOA) based self-localization. The ML estimator requires a good initialization close to the true location to avoid divergence, while the triangulation method cannot obtain the closed-form solution with high efficiency. In this paper, we develop a set of efficient closed-form AOA based self-localization algorithms using auxiliary variables based methods. First, we formulate the self-localization problem as a linear least squares problem using auxiliary variables. Based on its closed-form solution, a new auxiliary variables based pseudo-linear estimator (AVPLE) is developed. By analyzing its estimation error, we present a bias compensated AVPLE (BCAVPLE) to reduce the estimation error. Then we develop a novel BCAVPLE based weighted instrumental variable (BCAVPLE-WIV) estimator to achieve asymptotically unbiased estimation of locations and orientations of unknown nodes based on prior knowledge of the AOA noise variance. In the case that the AOA noise variance is unknown, a new AVPLE based WIV (AVPLE-WIV) estimator is developed to localize the unknown nodes. Also, we develop an autonomous coordinate rotation (ACR) method to overcome the tangent instability of the proposed algorithms when the orientation of the unknown node is near π/2. We also derive the Cramer-Rao lower bound (CRLB) of the ML estimator. Extensive simulations demonstrate that the new algorithms achieve much higher localization accuracy than the triangulation method and avoid local minima and divergence in iterative ML estimators.

Efficient Closed-Form Algorithms for AOA Based Self-Localization of Sensor Nodes Using Auxiliary Variables

The vision of pervasive computing is based on the idea that future computers will merge with their environment. Radio Frequency Identification (RFID) and Wireless Sensor Network (WSN) are two important components of pervasive computing, since both technologies can be used for coupling the physical and the virtual world. However, RFID and WSN almost are under development in parallel method, few integration schemes and related opportunities are investigated in detail. Through deep analysis of RFID and WSN, three forms of new system architecture that combines the two technologies are proposed and its feasibility, technical challenges are discussed thoroughly.

https://www2.computer.org/portal/web/csdl/doi/10.1109/GCCW.2006.58

Integration of RFID into Wireless Sensor Networks: Architectures, Opportunities and Challenging Problems

Accumulation of compatible osmolytes, such as soluble sugars, in plants is an important osmoprotective mechanism. Sugars play a role in osmotic adjustment and are associated with stabilization of proteins and cell structures, reactive oxygen species scavenging, signaling functions or induction of adaptive pathways. Galactinol is the galactosyl donor for the synthesis of raffinose family oligosaccharides (RFOs) and its synthesis by galactinol synthase (GolS) is the first committed step of the RFOs biosynthetic pathway. GolS genes are induced by a variety of stresses in both stress-sensitive and tolerant-plant species; however, the mechanism of transcriptional regulation is not fully established. In this paper, we characterized a GolS gene (BhGolS1) that was dehydration and ABA-inducible in the resurrection plant Boea hygrometrica and conferred dehydration tolerance in a transgenic tobacco system. Four W-box cis-elements were identified in the BhGolS1 promoter and shown to be bound by an early dehydration and ABA-inducible WRKY gene (BhWRKY1). These data suggest a mechanism where BhWRKY1 is likely to function in an ABA-dependent signal pathway to regulate BhGolS1 expression, which leads to the accumulation of RFOs in desiccation-tolerant B. hygrometrica leaves.

A WRKY transcription factor participates in dehydration tolerance in Boea hygrometrica by binding to the W-box elements of the galactinol synthase (BhGolS1) promoter

https://hal.inria.fr/inria-00188265/document

Real-time QoS support in wireless sensor networks: a survey

A two-hop neighborhood information-based routing protocol is proposed for real-time wireless sensor networks. The approach of mapping packet deadline to a velocity is adopted as that in SPEED; however, our routing decision is made based on the novel two-hop velocity integrated with energy balancing mechanism. Initiative drop control is embedded to enhance energy utilization efficiency, while reducing packet deadline miss ratio. Simulation and comparison show that the new protocol has led to lower packet deadline miss ratio and higher energy efficiency than two existing popular schemes. The result has also indicated a promising direction in supporting real-time quality-of-service for wireless sensor networks.

/pdf/enhancing-real-time-delivery-in-wireless-sensor-networks-4jghehuh22.pdf

Zhi Wang

Papers

Efficient Closed-Form Algorithms for AOA Based Self-Localization of Sensor Nodes Using Auxiliary Variables

Integration of RFID into Wireless Sensor Networks: Architectures, Opportunities and Challenging Problems

A WRKY transcription factor participates in dehydration tolerance in Boea hygrometrica by binding to the W-box elements of the galactinol synthase (BhGolS1) promoter

Real-time QoS support in wireless sensor networks: a survey

Enhancing Real-Time Delivery in Wireless Sensor Networks With Two-Hop Information