Multi-Wavelength Optical Packet Routing Technologies Based on Superstructured Fiber Bragg Gratings

A WDM compatible Edge-to-Edge Self-Routed optical packet switched network that simplifies the optical processing is proposed. The system employs all-optical packet label generation and recognition using coded superstructured Fiber Bragg gratings.     

Conditional Data Mapping Flip-Flops for Low-Power and High-Performance Systems

This paper introduces a new family of low-power and high-performance flip-flops, namely conditional data mapping flip-flops (CDMFFs), which reduce their dynamic power by mapping their inputs to a configuration that eliminates redundant internal transitions. We present two CDMFFs, having differential and single-ended structures, respectively, and compare them to the state-of-the-art flip-flops. The results indicate that both CDMFFs have the best power-delay product in their groups, respectively. In the aspect of power dissipation, the single-ended and differential CDMFFs consume the least power at data activity less than 50%, and are 31% and 26% less power than the conditional capture flip-flops at 25% data activity, respectively. In the aspect of performance, CDMFFs achieve small data-to-output delays, comparable to those of the transmission-gate pulsed latch and the modified-sense-amplifier flip-flop. In the aspect of timing reliability, CDMFFs have the best internal race immunity among pulse-triggered flip-flops. A post-layout case study is demonstrated with comparison to a transmission-gate flip-flop. The results indicate the single-ended CDMFF has 34% less in data-to-output delay and 28% less in power at 25% data activity, in spite of the 34% increase in size     

An experiment to discover mathematical talent in a primary school in Kampong Air

It is often said that many pupils have hidden talent in mathematics. This hidden ability is rarely seen in a normal classroom teaching and learning situation if the focus of the teacher is on drilling with routine exercises. To allow pupils to display their mathematical talent and to break from mental set and fixation in mathematics, they must be given opportunity to think by themselves with mininum cue or guidance. The pupils could be left entirely on their own to show their mathematical creativity even on mathematical topics which have not been exposed to them. With this approach, five non-routine questions were administered one at a time to a standard 5 class. One out of the 25 pupils in the class consistently exhibited mathematical creativity and talent is answering the questions. Her responses were shown and discussed in this paper.     

Studies on the thermotropic liquid crystalline polymer. XII. Synthesis and properties of crosslinkable thermotropic liquid crystalline homo- and copoly(ether-ester)s

A series of crosslinkable thermotropic liquid crystalline poly(ether-ester)s and copoly(ether-ester)s was prepared. All of the polymers were crosslinked by thermal treatment or photo-irradiation upon heating. The thermal stability and thermal crosslinking reaction of these polymers were investigated. These polymers also could be crosslinked by copolymerization with vinyl monomers, such as styrene or methyl methacrylate. The crosslinked polymers exhibited thermotropic liquid crystalline behavior after softening by heating. The phase behavior of linear polymers and crosslinked polymers was studied by differential scanning calorimetry (DSC) and an optical polarizing microscope equipped with a heating stage. © 1995 John Wiley & Sons, Inc.     

Wireless link prediction and triggering using modified Ornstein–Uhlenbeck jump diffusion process

Through time domain observation, typical wireless signal strength values seems to exhibit some forms of mean-reverting and discontinuous “jumps” behaviour. Motivated by this fact, we propose a wireless link prediction and triggering (LPT) technique using a modified mean-reverting Ornstein–Uhlenbeck (OU) jump diffusion process. The proposed technique which we refer as OU-LPT is an integral component of wireless mesh network monitoring system developed by ICT FP7 CARrier grade wireless MEsh Network project. In particular, we demonstrate how this technique can be applied in the context of wireless mesh networks to support link switching or handover in the event of predicted link degradation or failure. The proposed technique has also been implemented and evaluated in a real-time experimental testbed. The results show that OU-LPT technique can significantly enhance the reliability of wireless links by reducing the rate of false triggers compared to a conventional linear prediction technique and therefore offers a new direction on how wireless link prediction, triggering and switching process can be conducted in the future.     

Electrospun Porous NiCo2O4 Nanotubes as Advanced Electrodes for Electrochemical Capacitors

Novel, porous NiCo₂O₄ nanotubes (NCO‐NTs) are prepared by a single‐spinneret electrospinning technique followed by calcination in air. The obtained NCO‐NTs display a one‐dimensional architecture with a porous structure and hollow interiors. The effect of precursor concentration on the morphologies of the products is investigated. Due to their unique structure, the prepared NCO‐NT electrode exhibits a high specific capacitance (1647 F g^?1 at 1 A g^?1), excellent rate capability (77.3 % capacity retention at 25 A g^?1), and outstanding cycling stability (6.4 % loss after 3000 cycles), which indicates it has great potential for high‐performance electrochemical capacitors. The desirable enhanced capacitive performance of NCO‐NTs can be attributed to the relatively large specific surface area of these porous and hollow one‐dimensional nanostructures.     

Coordinated pair chain folding model for solution-grown polyethylene single crystal

A new regular chain folding model, namely the “coordinated pair chain folding model” (CPCFM) is proposed to revive the consideration that a polymer chain should fold regularly rather than randomly in solution-grown polyethylene single crystals.     

H-extension of graphs

We consider the problem of constructing a graphG* from a collection of isomorphic copies of a graphG in such a way that for every two copies ofG, either no vertices or a section graph isomorphic to a graphH is identified. It is shown that ifG can be partitioned into vertex-disjoint copies ofH, thenG* can be made to have at most |H| orbits. A condition onG so thatG* can be vertextransitive is also included.