COMPARISON OF MILLISECOND ANNEALING OF B IMPLANTS AND ISOTHERMAL ANNEALING FOR TIMES OF A FEW SECONDS.

The annealing behaviour of B implants in the millisecond time regime using a combination of swept line beam and background heating is compared with isothermal annealing with heating cycles of a few seconds. Carrier concentration profiles show that under annealing conditions which restrict diffusion, millisecond processing gives higher activation of B implants than isothermal heating. Transmission electron microscopy shows that millisecond annealing also results in a lower defect density.

Statistical quality control charts on attributes in fish processing technology

Apart from the use of statistical quality control chart for variables or attributes of food products in a food processing industry, the application of these charts for attributes of fishery products is explained. Statistical quality control chart for fraction defectives is explained by noting defective fish sausages per shift from a sausage industry while control chart for number of defectives is illustrated for number of defective fish cans in each hour of its production of a canning industry. C-chart is another type of control chart which is explained here for number of defects per single fish fillet sampled a1l random for every five minutes in a processing industry. These statistical quality control charts help in the more economic use of resource, time and labour than control charts for variables of products. Also control charts for attributes exhibit the quality history of finished products at different times of production thereby minimizing the risk of consumer rejection.

MODELING OF ELECTRON-TUNNELING TIMES IN ASYMMETRIC DOUBLE QUANTUM-WELLS

A scattering process modeled by an imaginary potential V(I) in the wide well of an asymmetric double quantum well structure (DQWS) is used to model the electron tunneling from the narrow well. Taking V(I) approximately -5 meV, the ground resonant level lifetimes of the narrow well in the DQWS are in quantitative agreement with the experimental resonance and non-resonance tunneling times. The corresponding scattering time 66 fs is much faster than the intersubband scattering time of LO-photon emission.

All-optical signal processing using semiconductor optical amplifiers for next generation optical networks

This thesis details an experimental and simulation investigation of some novel all-optical signal processing techniques for future optical communication networks. These all-optical techniques include modulation format conversion, phase discrimination and clock recovery. The methods detailed in this thesis use the nonlinearities associated with semiconductor optical amplifiers (SOA) to manipulate signals in the optical domain. Chapter 1 provides an introduction into the work detailed in this thesis, discusses the increased demand for capacity in today’s optical fibre networks and finally explains why all-optical signal processing may be of interest for future optical networks. Chapter 2 discusses the relevant background information required to fully understand the all-optical techniques demonstrated in this thesis. Chapter 3 details some pump-probe measurement techniques used to calculate the gain and phase recovery times of a long SOA. A remarkably fast gain recovery is observed and the wavelength dependent nature of this recovery is investigated. Chapter 4 discusses the experimental demonstration of an all-optical modulation conversion technique which can convert on-off- keyed data into either duobinary or alternative mark inversion. In Chapter 5 a novel phase sensitive frequency conversion scheme capable of extracting the two orthogonal components of a quadrature phase modulated signal into two separate frequencies is demonstrated. Chapter 6 investigates a novel all-optical clock recovery technique for phase modulated optical orthogonal frequency division multiplexing superchannels and finally Chapter 7 provides a brief conclusion.

The neural dynamics of stimulus and response conflict processing as a function of response complexity and task demands.

Both stimulus and response conflict can disrupt behavior by slowing response times and decreasing accuracy. Although several neural activations have been associated with conflict processing, it is unclear how specific any of these are to the type of stimulus conflict or the amount of response conflict. Here, we recorded electrical brain activity, while manipulating the type of stimulus conflict in the task (spatial [Flanker] versus semantic [Stroop]) and the amount of response conflict (two versus four response choices). Behaviorally, responses were slower to incongruent versus congruent stimuli across all task and response types, along with overall slowing for higher response-mapping complexity. The earliest incongruency-related neural effect was a short-duration frontally-distributed negativity at ~200 ms that was only present in the Flanker spatial-conflict task. At longer latencies, the classic fronto-central incongruency-related negativity 'N(inc)' was observed for all conditions, but was larger and ~100 ms longer in duration with more response options. Further, the onset of the motor-related lateralized readiness potential (LRP) was earlier for the two vs. four response sets, indicating that smaller response sets enabled faster motor-response preparation. The late positive complex (LPC) was present in all conditions except the two-response Stroop task, suggesting this late conflict-related activity is not specifically related to task type or response-mapping complexity. Importantly, across tasks and conditions, the LRP onset at or before the conflict-related N(inc), indicating that motor preparation is a rapid, automatic process that interacts with the conflict-detection processes after it has begun. Together, these data highlight how different conflict-related processes operate in parallel and depend on both the cognitive demands of the task and the number of response options.

Approximation algorithms for two-machine flow shop scheduling with batch setup times

In many practical situations, batching of similar jobs to avoid setups is performed while constructing a schedule. This paper addresses the problem of non-preemptively scheduling independent jobs in a two-machine flow shop with the objective of minimizing the makespan. Jobs are grouped into batches. A sequence independent batch setup time on each machine is required before the first job is processed, and when a machine switches from processing a job in some batch to a job of another batch. Besides its practical interest, this problem is a direct generalization of the classical two-machine flow shop problem with no grouping of jobs, which can be solved optimally by Johnson's well-known algorithm. The problem under investigation is known to be NP-hard. We propose two O(n logn) time heuristic algorithms. The first heuristic, which creates a schedule with minimum total setup time by forcing all jobs in the same batch to be sequenced in adjacent positions, has a worst-case performance ratio of 3/2. By allowing each batch to be split into at most two sub-batches, a second heuristic is developed which has an improved worst-case performance ratio of 4/3. © 1998 The Mathematical Programming Society, Inc. Published by Elsevier Science B.V.

Group technology approach to the open shop scheduling problem with batch setup times

This paper studies the problem of scheduling jobs in a two-machine open shop to minimize the makespan. Jobs are grouped into batches and are processed without preemption. A batch setup time on each machine is required before the first job is processed, and when a machine switches from processing a job in some batch to a job of another batch. For this NP-hard problem, we propose a linear-time heuristic algorithm that creates a group technology schedule, in which no batch is split into sub-batches. We demonstrate that our heuristic is a -approximation algorithm. Moreover, we show that no group technology algorithm can guarantee a worst-case performance ratio less than 5/4.

Three-machine shop scheduling with partially ordered processing routes

This paper considers the problem of sequencing n jobs in a three-machine shop with the objective of minimising the maximum completion time. The shop consists of three machines, M1,M2 and M_{3}. A job is first processed on M1 and then is assigned either the route (M2,M_{3}) or the route (M_{3},M2). Thus, for our model the processing route is given by a partial order of machines, as opposed to the linear order of machines for a job shop, or to an arbitrary sequence of machines for an open shop. The main result is on O(nlog n) time heuristic, which generates a schedule with the makespan that is at most 5/3 times the optimum value.

On-line algorithms for single machine scheduling with family setup times

The paper considers an on-line single machine scheduling problem where the goal is to minimize the makespan. The jobs are partitioned into families and a setup is performed every time the machine starts processing a batch of jobs of the same family. The scheduler is aware of the number of families and knows the setup time of each family, although information about a job only becomes available when that job is released. We give a lower bound on the competitive ratio of any on-line algorithm. Moreover, for the case of two families, we provide an algorithm with a competitive ratio that achieves this lower bound. As the number of families increases, the lower bound approaches 2, and we give a simple algorithm with a competitive ratio of 2.

An improved approximation algorithm for the two-machine open shop scheduling problem with family setup times

We consider the problem of scheduling families of jobs in a two-machine open shop so as to minimize the makespan. The jobs of each family can be partitioned into batches and a family setup time on each machine is required before the first job is processed, and when a machine switches from processing a job of some family to a job of another family. For this NP-hard problem the literature contains (5/4)-approximation algorithms that cannot be improved on using the class of group technology algorithms in which each family is kept as a single batch. We demonstrate that there is no advantage in splitting a family more than once. We present an algorithm that splits one family at most once on a machine and delivers a worst-case performance ratio of 6/5.

Modelling the effect of water immersion thermal processing on polyacetylene levels and instrumental colour of carrot disks

C₁₇ polyacetylenes are a group of bioactive compounds present in carrots which have recently gained scientific attention due to their cytotoxicity against cancer cells. In common with many bioactive compounds, their levels may be influenced by thermal processes, such as boiling or water immersion. This study investigated the effect of a number of water immersion time/temperature combinations on concentrations of these compounds and attempted to model the changes. Carrot samples were thermally treated by heating in water at temperatures from 50–100 °C and holding times of 2–60 min. Following heating, levels of falcarinol (FaOH), falcarindiol (FaDOH), falcarindiol-3-acetate (FaDOAc) and Hunter colour parameters (L^*, a^*, b^*) were determined. FaOH, FaDOH, FaDOAc levels were significantly reduced at lower temperatures (50–60 °C). In contrast, samples heated at temperatures from 70–100 °C exhibited higher levels of polyacetylenes (p < 0.05) than did raw unprocessed samples. Regression modelling was used to model the effects of temperature and holding time on the levels of the variables measured. Temperature treatment and holding time were found to significantly affect the polyacetylene content of carrot disks. Predicted models were found to be significant (p < 0.05) with high coefficients of determination (R²).

N1, P2 and T-complex of the auditory brain event-related potentials to tones with varying rise times in adults with and without dyslexia

Dyslexia is a learning difficulty affecting the acquisition of fluent reading and spelling skills due to poor phonological processing. Underlying deficits in processing sound rise time have also been found in children and adults with dyslexia. However, the neural basis for these deficits is unknown. In the present study event-related potentials were used to index neural processing and examine the effect of rise time manipulation on the obligatory N1. T-complex and P2 responses in English speaking adults with and without dyslexia. The Tb wave of the T-complex showed differences between groups, with the amplitudes for Tb becoming less negative with increased rise time for the participants with dyslexia only. Frontocentral N1 and P2 did not show group effects. Enhanced Tb amplitude that is modulated by rise time could indicate altered neural networks at the lateral surface of the superior temporal gyrus in adults with dyslexia. (C) 2011 Elsevier B.V. All rights reserved.

Validation study to compare effects of processing protocols on measured Nε_(carboxymethyl)lysine and Nε_(carboxyethyl)lysine in blood.

Epidemiological studies show that elevated plasma levels of advanced glycation end products (AGEs) are associated with diabetes, kidney disease, and heart disease. Thus AGEs have been used as disease progression markers. However, the effects of variations in biological sample processing procedures on the level of AGEs in plasma/serum samples have not been investigated. The objective of this investigation was to assess the effect of variations in blood sample collection on measured Ne_(carboxy-methyl)lysine (CML), the best characterised AGE, and its homolog, Ne_(carboxyethyl)lysine (CEL). The investigation examined the effect on CML and CEL of different blood collection tubes, inclusion of a stabilising cocktail, effect of freeze thaw cycles, different storage times and temperatures, and effects of delaying centrifugation on a pooled sample from healthy volunteers. CML and CEL were measured in extracted samples by ultra_performance liquid chromatography-tandem mass spectrometry. Median CML and CEL ranged from 0.132 to 0.140 mM/M lys and from 0.053 to 0.060 mM/M lys, respectively. No significant difference was shown CML or CEL in plasma/serum samples. Therefore samples collected as part of epidemiological studies that do not undergo specific sample treatment at collection are suitable for measuring CML and CEL.

IPPro: FPGA based Image Processing Processor

The paper presents IPPro which is a high performance, scalable soft-core processor targeted for image processing applications. It has been based on the Xilinx DSP48E1 architecture using the ZYNQ Field Programmable Gate Array and is a scalar 16-bit RISC processor that operates at 526MHz, giving 526MIPS of performance. Each IPPro core uses 1 DSP48, 1 Block RAM and 330 Kintex-7 slice-registers, thus making the processor as compact as possible whilst maintaining flexibility and programmability. A key aspect of the approach is in reducing the application design time and implementation effort by using multiple IPPro processors in a SIMD mode. For different applications, this allows us to exploit different levels of parallelism and mapping for the specified processing architecture with the supported instruction set. In this context, a Traffic Sign Recognition (TSR) algorithm has been prototyped on a Zedboard with the colour and morphology operations accelerated using multiple IPPros. Simulation and experimental results demonstrate that the processing platform is able to achieve a speedup of 15 to 33 times for colour filtering and morphology operations respectively, with a reduced design effort and time.

Validation study to compare effects of processing protocols on measured N (ε)-(carboxymethyl)lysine and N (ε)-(carboxyethyl)lysine in blood

Epidemiological studies show that elevated plasma levels of advanced glycation end products (AGEs) are associated with diabetes, kidney disease, and heart disease. Thus AGEs have been used as disease progression markers. However, the effects of variations in biological sample processing procedures on the level of AGEs in plasma/serum samples have not been investigated. The objective of this investigation was to assess the effect of variations in blood sample collection on measured N (ε)-(carboxymethyl)lysine (CML), the best characterised AGE, and its homolog, N (ε)-(carboxyethyl)lysine (CEL). The investigation examined the effect on CML and CEL of different blood collection tubes, inclusion of a stabilising cocktail, effect of freeze thaw cycles, different storage times and temperatures, and effects of delaying centrifugation on a pooled sample from healthy volunteers. CML and CEL were measured in extracted samples by ultra-performance liquid chromatography-tandem mass spectrometry. Median CML and CEL ranged from 0.132 to 0.140 mM/M lys and from 0.053 to 0.060 mM/M lys, respectively. No significant difference was shown CML or CEL in plasma/serum samples. Therefore samples collected as part of epidemiological studies that do not undergo specific sample treatment at collection are suitable for measuring CML and CEL.