Development of a Continuous Segmented Flow Tubular Reactor and the “Scale‐out” Concept – In Search of Perfect Powders

The synthesis of powders with controlled shape and narrow particle size distributions is still a major challenge for many industries. A continuous Segmented Flow Tubular Reactor (SFTR) has been developed to overcome homogeneity and scale‐up problems encountered when using batch reactors. Supersaturation is created by mixing the co‐reactants in a micromixer inducing precipitation; the suspension is then segmented into identical micro‐volumes by a non‐miscible fluid and sent through a tube. These micro‐volumes are more homogeneous when compared to large batch reactors leading to narrower size distributions, better particle morphology, polymorph selectivity and stoichiometry. All these features have been demonstrated on single tube SFTR for different chemical systems. To increase productivity for commercial application the SFTR is being “scaled‐out” by multiplying the number of tubes running in parallel instead of scaling‐up by increasing their size. The versatility of the multi‐tube unit will allow changes in type of precipitate with a minimum of new investment as new chemistry can be researched, developed and optimised in a single tube SFTR and then transferred to the multi‐tube unit for powder production.     

Limited-trial Chase decoding

Chase decoders permit flexible use of reliability information in algebraic decoding algorithms for error-correcting block codes of Hamming distance d. The least complex version of the original Chase algorithms uses roughly d/2 trials of a conventional binary decoder, after which the best decoding result is selected as the final output. On certain channels, this approach achieves asymptotically the same performance as maximum-likelihood (ML) decoding. In this correspondence, the performance of Chase-like decoders with even less trials is studied. Most strikingly, it turns out that asymptotically optimal performance can be achieved by a version which uses only about d/4 trials.     

The hot compaction behaviour of woven oriented polypropylene fibres and tapes. I. Mechanical properties

The aim of this work was to establish the important parameters that control the hot compaction behaviour of woven oriented polypropylene. Five commercial woven cloths, based on four different polypropylene polymers, were selected so that the perceived important variables could be studied. These include the mechanical properties of the original oriented tapes or fibres, the geometry of the oriented reinforcement (fibres or tapes), the mechanical properties of the base polymer (which are crucially dependant on the molecular weight and morphology), and the weave style. The five cloths were chosen so as to explore the boundaries of these various parameters, i.e. low and high molecular weight: circular or rectangular reinforcement (fibres or tapes): low or high tape initial orientation: coarse or fine weave.A vital aspect of this study was the realisation that hot compacted polypropylene could be envisaged as a composite, comprising an oriented ‘reinforcement’ bound together by a matrix phase, formed by melting and recrystallisation of the original oriented material. We have established the crucial importance of the properties of the melted and recrystallised matrix phase, especially the level of ductility, in controlling the properties of the hot compacted composite.     

Context-Processing Deficits in Schizotypal Personality Disorder.

Research suggests that schizotypal personality disorder (SPD) is a part of the spectrum of schizophrenia-related illnesses. This article hypothesizes that a deficit in the representation and maintenance of context is a core cognitive disturbance in schizophrenia and that SPD individuals should demonstrate context-processing deficits. To test this hypothesis, the authors administered 3 versions of their AX-CPT task, designed to assess context processing, to 35 healthy controls and 26 individuals with DSM-IV SPD. They also administered working memory and selective attention tasks. SPD individuals displayed context representation deficits similar to those found in schizophrenia but did not show the same additional deficits in context maintenance. Context processing was strongly associated with working memory and selective attention performance in the SPD individuals. (PsycINFO Database Record (c) 2010 APA, all rights reserved)     

Quadrature Mismatch Shaping for Digital-to-Analog Converters

Quadrature sigma-delta analog-to-digital converters require a feedback path for both the I and the Q parts of the complex feedback signal. If two separate multibit feedback digital-to-analog converters (DACs) are used, mismatch among the unit DAC elements leads to additional mismatch noise in the output spectrum as well as an I/Q imbalance. This paper proposes new quadrature bandpass (QBP) mismatch shaping techniques. In our approach, the I and Q DACs are merged into one complex DAC, which leads to near-perfect I/Q balance. To select the unit DAC elements of the complex multibit DAC, the well-known butterfly shuffler and tree structure are generalized towards a complex structure, and necessary constraints for their correct functioning are derived. Next, a very efficient first-order QBP shaper implementation is proposed. Finally, the newly presented complex structures are simulated to prove their effectiveness and are compared with each other with respect to performance     

Discrete Chaos-I: Theory

We propose a definition of the discrete Lyapunov exponent for an arbitrary permutation of a finite lattice. For discrete-time dynamical systems, it measures the local (between neighboring points) average spreading of the system. We justify our definition by proving that, for large classes of chaotic maps, the corresponding discrete Lyapunov exponent approaches the largest Lyapunov exponent of a chaotic map when M/spl rarr//spl infin/, where M is the cardinality of the discrete phase space. In analogy with continuous systems, we say the system has discrete chaos if its discrete Lyapunov exponent tends to a positive number, when M/spl rarr//spl infin/. We present several examples to illustrate the concepts being introduced.     

Estimating and reducing the memory requirements of signal processing codes for embedded systems

Most embedded systems have limited amount of memory. In contrast, the memory requirements of the digital signal processing (DSP) and video processing codes (in nested loops, in particular) running on embedded systems is significant. This paper addresses the problem of estimating and reducing the amount of memory needed for transfers of data in embedded systems. First, the problem of estimating the region associated with a statement or the set of elements referenced by a statement during the execution of nested loops is analyzed. For a fixed execution ordering, a quantitative analysis of the number of elements referenced is presented; exact expressions for uniformly generated references and a close upper and lower bound for nonuniformly generated references are derived. Second, in addition to presenting an algorithm that computes the total memory required, this paper also discusses the effect of transformations (that change the execution ordering) on the lifetimes of array variables, i.e., the time between the first and last accesses to a given array location. The term maximum window size is introduced, and quantitative expressions are derived to compute the maximum window size. A detailed analysis of the effect of unimodular transformations on data locality, including the calculation of the maximum window size, is presented.     

Bandpass filters with reconfigurable transmission zeros using varactor-tuned tapped stubs

In this letter, bandpass filters with one or two tunable transmission zeros are proposed. The reconfigurable transmission zeros are implemented through varactors in combination with tapped quarter-wavelength stubs. Based on mixed mode simulations including EM simulation and circuit simulation, the proposed filters were designed and fabricated on low-cost FR4 board. The measurement results verified the design concepts.     

Nash equilibria of packet forwarding strategies in wireless ad hoc networks

In self-organizing ad hoc networks, all the networking functions rely on the contribution of the participants. As a basic example, nodes have to forward packets for each other in order to enable multihop communication. In recent years, incentive mechanisms have been proposed to give nodes incentive to cooperate, especially in packet forwarding. However, the need for these mechanisms was not formally justified. In this paper, we address the problem of whether cooperation can exist without incentive mechanisms. We propose a model,based on game theory and graph theory to investigate equilibrium conditions of packet forwarding strategies. We prove theorems about the equilibrium conditions for both cooperative and noncooperative strategies. We perform simulations to estimate the probability that the conditions for a cooperative equilibrium hold in randomly generated network scenarios.. As the problem is involved, we deliberately restrict ourselves to a static configuration. We conclude that in static ad hoc networks where the relationships between the nodes are likely to be stab le-cooperation needs to be encouraged.     

Computation of Running Averages

This brief presents and compares several recursive and nonrecursive techniques for the efficient computation of the running average of discrete signals. First of all, the standard recursive algorithm is considered and its long-term accuracy is assessed when the floating-point arithmetic is employed. A cheap refreshing strategy is proposed as a means of keeping the computed value close enough to the exact one. Then, two alternative nonrecursive algorithms, requiring only log₂N additions, are developed, which are as reliable and accurate as the direct implementation