Modelling the Geometry of the Repeat Unit Cell of Three-Dimensional Weave Architectures,

The three-dimensional (3D) weaving process offers the ability to tailor the mechanical properties via design of the weave architecture. One repeat of the 3D woven fabric is represented by the unit cell. The model accepts basic weaver and material manufacturer data as inputs in order to calculate the geometric characteristics of the 3D woven unit cell. The specific weave architecture manufactured and subsequently modelled had an angle interlock type binding configuration. The modelled result was shown to have a close approximation compared to the experimentally measured values and highlighted the importance of the representation of the binder tow path.

A Ring Rearrangement Approach to the Synthesis of Benzo[b]quinolizine and Benzoindolizine Architectures

An efficient ring rearrangement metathesis (RRM) approach to the synthesis of benzo[b]quinolizine and benzoindolizine systems from N-propargyl-phenanthridine derivatives is reported. A Hovel use of flash vacuum pyrolysis (FVP) for the Boc-deprotection of acid-sensitive substrates is also disclosed.

Remote, subsurface detection of the algal toxin domoic acid onboard the Environmental Sample Processor: Assay development and field trials

The ability to detect harmful algal bloom (HAB) species and their toxins in real- or near real-time is a critical need for researchers studying HAB/toxin dynamics, as well as for coastal resource managers charged with monitoring bloom populations in order to mitigate their wide ranging impacts. The Environmental Sample Processor (ESP), a robotic electromechanical/fluidic system, was developed for the autonomous, subsurface application of molecular diagnostic tests and has successfully detected several HAB species using DNA probe arrays during field deployments. Since toxin production and thus the potential for public health and ecosystem effects varies considerably in natural phytoplankton populations, the concurrent detection of HAB species and their toxins onboard the ESP is essential. We describe herein the development of methods for extracting the algal toxin domoic acid (DA) from Pseudonitzschia cells (extraction efficiency >90%) and testing of samples using a competitive ELISA onboard the ESP. The assay detection limit is in the low ng/mL range (in extract), which corresponds to low ng/L levels of DA in seawater for a 0.5 L sample volume acquired by the ESP. We also report the first in situ detection of both a HAB organism (i.e., Pseudo-nitzschia) and its toxin, domoic acid, via the sequential (within 2-3 h) conduct of species- and toxin-specific assays during ESP deployments in Monterey Bay, CA, USA. Efforts are now underway to further refine the assay and conduct additional calibration exercises with the aim of obtaining more reliable, accurate estimates of bloom toxicity and thus their potential impacts. Published by Elsevier B.V.

FPGA montgomery modular multiplication architectures suitable for ECCs over GF(p)

New FPGA architectures for the ordinary Montgomery multiplication algorithm and the FIOS modular multiplication algorithm are presented. The embedded 18×18-bit multipliers and fast carry look-ahead logic located on the Xilinx Virtex2 Pro family of FPGAs are used to perform the ordinary multiplications and additions/subtractions required by these two algorithms. The architectures are developed for use in Elliptic Curve Cryptosystems over GF(p), which require modular field multiplication to perform elliptic curve point addition and doubling. Field sizes of 128-bits and 256-bits are chosen but other field sizes can easily be accommodated, by rapidly reprogramming the FPGA. Overall, the larger the word size of the multiplier, the more efficiently it performs in terms of area/time product. Also, the FIOS algorithm is flexible in that one can tailor the multiplier architecture is to be area efficient, time efficient or a mixture of both by choosing a particular word size. It is estimated that the computation of a 256-bit scalar point multiplication over GF(p) would take about 4.8 ms.