The evolution of InAs/InAlAs/InGaAlAs quantum dots after rapid thermal annealing

We have studied how the optical properties of InAs self-assembled quantum dots (QDs) grown on GaAs substrate are affected when depositing an InAlAs/InGaAs combination overgrowth layer directly on it by rapid thermal annealing (RTA). The photoluminescence measurement demonstrated that the InAs QDs experiences an abnormal variation during the course of RTA. The model of transformation of InAs-InAlAs-InGaAlAs could be used to well explain the phenomena. (C) 2003 Elsevier Science B.V. All rights reserved.

The effects of rapid thermal annealing on the optical properties of Zn1-xMnxSe epilayer grown by MOCVD on GaAs substrate

Zn1-xMnxSe thin films with different Mn compositions are grown by metal-organic chemical vapor deposition on GaAs substrate. Good crystallinity of sample is evidenced by X-ray diffraction and rocking-curve measurements. Photoluminescence (PL) properties were carefully studied. A dominant PL peak close to the band edge is observed at low temperature for samples with higher Mn concentration. The temperature-dependent PL and time-resolved photoluminescence show that this emission peak is associated with the recombination of exciton bound to Mn-induced impurity bound states. It is found that rapid thermal annealing can induce reorganization of Mn composition in alloys and significantly reduce the density of impurity induced by Mn incorporation and improve the intrinsic interband transition. (C) 2002 Elsevier Science B.V. All rights reserved.

Polycrystalline silicon films prepared by improved pulsed rapid thermal annealing

An improved pulsed rapid thermal annealing (PRTA) has been used for the solid-phase crystallization (SPC) of a-Si films prepared by PECVD. The SPC can be completed with time-temperature budgets such as 10 cycles of 60-s 550 degrees C thermal bias/1-s 850 degrees C thermal pulse. The microstructure and surface morphology of the crystallized films are investigated by X-ray diffraction (XRD). The results indicate that this PRTA is a suitable post-crystallization technique for fabricating large-area poly-Si films on low-cost substrate. (C) 2000 Elsevier Science B.V. All rights reserved.

Effects of rapid thermal annealing on the optical properties of GaNxAs1-x/GaAs single quantum well structure grown by molecular beam epitaxy

The effect of rapid thermal annealing (RTA) on the optical properties of GaNxAs1-x/GaAs strained single quantum well (SQW) was studied by low-temperature photoluminescence (PL). The GaNxAs1-x/GaAs SQW structures were prepared by dc active nitrogen plasma assisted molecular beam epitaxy. PL measurements on a series of samples with different well widths and nitrogen compositions were used to evaluate the effects of RTA. The annealing temperature and time were varied from 650 to 850 degrees C and 30 s to 15 min, respectively. Remarkable improvements of the optical properties of the samples were observed after RTA under optimum conditions. The interdiffusion constants have been calculated by taking into account error function diffusion and solving the Schrodinger equation. The estimated interdiffusion constants D are 10(-17)-10(-16) cm(2)/s for the earlier annealing conditions. Activation energies of 6-7 eV are obtained by fitting the temperature dependence of the interdiffusion constants. (C) 2000 American Institute of Physics. [S0021-8979(00)10401-3].

Solid-phase crystallization and dopant activation of amorphous silicon films by pulsed rapid thermal annealing

An improved pulsed rapid thermal annealing method has been used to crystallize amorphous silicon films prepared by PECVD. The solid-phase crystallization and dopant activation process can be completed with time-temperature budgets such as 10 cycles of 60-s 550 degrees C thermal bias/l-s 850 degrees C thermal pulse. A mean grain size more than 1000 Angstrom and a Hall mobility of 24.9 cm(2)/V s are obtained in the crystallized films. The results indicate that this annealing method possesses the potential for fabricating large-area and good-quality polycrystalline silicon films on low-cost glass substrate. (C) 1998 Elsevier Science B.V. All rights reserved.

Realization of write-once-read-many-times memory devices based on poly(N-vinylcarbazole) by thermally annealing

A nonvolatile write-once-read-many-time (WORM-time) memory device based on poly(N-vinylcarbazole) (PVK) films was realized by thermally annealing. The device can be fabricated using a simple spin coat method. It was found that the control of PVK film surface morphology by thermally annealing plays an important role in achieving the WORM memory properties. The memory device showed an ON/OFF current ratio as high as 10(4) and the retention time was over 2000 s without degradation.

Study on the Single Crystals of Poly(3-octylthiophene) Induced by Solvent-Vapor Annealing

Needle-like single crystals of poly(3-octylthiophene) (P3OT) have been prepared by tetrahydrofuran-vapor annealing. The morphology and structure of the crystals were characterized with optical microscopy, scanning electron microscopy, atomic force microscopy, transmission electron microscopy, and wide-angle X-ray diffraction. It is observed that the P3OT molecules are packed with the backbones parallel to the length axis of the crystal and the alkyl side chains perpendicular to the substrate. The field effect transistor based on the P3OT single crystal exhibited a charge carrier mobility of 1.54 x 10(-4) cm(2)/(Vs) and on/off current ratio of 37, and the molecular orientation of the crystal is ascribed to account for the device performance. The time-dependent morphological evolution demonstrated that the crystals underwent Ostwald ripening when annealed.

Effect of annealing on the viscoelastic and viscoplastic responses of low-density polyethylene

Two series of tensile tests with constant crosshead speeds (ranging from 5 to 200 mm/min) and tensile relaxation tests (at strains from 0.03 to 0.09) were performed on low-density polyethylene in the subyield region of deformations at room temperature. Mechanical tests were carried out on nonannealed specimens and on samples annealed for 24 h at the temperatures T = 50, 60, 70, 80, and 100 degreesC. Constitutive equations were derived for the time-dependent response of semicrystalline polymers at isothermal deformations with small strains. A polymer is treated as an equivalent heterogeneous network of chains bridged by temporary junctions (entanglements, physical crosslinks, and lamellar blocks). The network is thought of as an ensemble of mesoregions linked with each other. The viscoelastic behavior of a polymer is modeled as a thermally induced rearrangement of strands (separation of active strands from temporary junctions and merging of dangling strands with the network). The viscoplastic response reflects sliding of junctions in the network with respect to their reference positions driven by macrostrains. Stress-strain relations involve five material constants that were found by fitting the observations.

Phase transition in polyamide-66/montmorillonite nanocomposites on annealing

The crystalline-phase transition in polyamide-66/montmorillonite nanocomposites before melting was investigated by in situ X-ray diffraction and is reported for the first time in this work. The phase-transition temperature in the nanocomposites was 170 degreesC, 20 degreesC lower than that in polyamide-66. The lower phase-transition temperature of the nanocomposites could be attributed to the gamma-phase-favorable environment caused by silicate layers. Meanwhile, the addition of silicate layers changed the crystal structure of the polyamide-66 matrix and influenced the phase-transition behavior.

On the Performance of Polynomial-time CLIQUE Approximation Algorithms on Very Large Graphs

The performance of a randomized version of the subgraph-exclusion algorithm (called Ramsey) for CLIQUE by Boppana and Halldorsson is studied on very large graphs. We compare the performance of this algorithm with the performance of two common heuristic algorithms, the greedy heuristic and a version of simulated annealing. These algorithms are tested on graphs with up to 10,000 vertices on a workstation and graphs as large as 70,000 vertices on a Connection Machine. Our implementations establish the ability to run clique approximation algorithms on very large graphs. We test our implementations on a variety of different graphs. Our conclusions indicate that on randomly generated graphs minor changes to the distribution can cause dramatic changes in the performance of the heuristic algorithms. The Ramsey algorithm, while not as good as the others for the most common distributions, seems more robust and provides a more even overall performance. In general, and especially on deterministically generated graphs, a combination of simulated annealing with either the Ramsey algorithm or the greedy heuristic seems to perform best. This combined algorithm works particularly well on large Keller and Hamming graphs and has a competitive overall performance on the DIMACS benchmark graphs.

A New Heuristic Providing an Effective Initial Solution for a Simulated Annealing approach to Energy Resource Scheduling in Smart Grids

An intensive use of dispersed energy resources is expected for future power systems, including distributed generation, especially based on renewable sources, and electric vehicles. The system operation methods and tool must be adapted to the increased complexity, especially the optimal resource scheduling problem. Therefore, the use of metaheuristics is required to obtain good solutions in a reasonable amount of time. This paper proposes two new heuristics, called naive electric vehicles charge and discharge allocation and generation tournament based on cost, developed to obtain an initial solution to be used in the energy resource scheduling methodology based on simulated annealing previously developed by the authors. The case study considers two scenarios with 1000 and 2000 electric vehicles connected in a distribution network. The proposed heuristics are compared with a deterministic approach and presenting a very small error concerning the objective function with a low execution time for the scenario with 2000 vehicles.

Fast Object Recognition in Noisy Images Using Simulated Annealing

A fast simulated annealing algorithm is developed for automatic object recognition. The normalized correlation coefficient is used as a measure of the match between a hypothesized object and an image. Templates are generated on-line during the search by transforming model images. Simulated annealing reduces the search time by orders of magnitude with respect to an exhaustive search. The algorithm is applied to the problem of how landmarks, for example, traffic signs, can be recognized by an autonomous vehicle or a navigating robot. The algorithm works well in noisy, real-world images of complicated scenes for model images with high information content.

The effect of annealing on the local structure of glassy polycarbonate

Annealing of polycarbonate glasses at temperatures belowTg leads to an increase in yield stress and a drop in the impact strength. Although such behaviour may be related to the corresponding reduction in free volume upon annealing, variations in the wide-angle X-ray scattering curves indicate some modification to the local structure. The area of an intrachain peak at s ∼ 0.7 Å−1 is monitored with respect to annealing temperature and time. It is proposed that the variations may be described by an increasing level of interlocking or (nesting) between neighbouring chain segments, a process which is a natural consequence of the molecular shape of polycarbonate.

Solving the Vehicle Routing Problem with Genetic ALgorithm and Simulated Annealing

This Thesis Work will concentrate on a very interesting problem, the Vehicle Routing Problem (VRP). In this problem, customers or cities have to be visited and packages have to be transported to each of them, starting from a basis point on the map. The goal is to solve the transportation problem, to be able to deliver the packages-on time for the customers,-enough package for each Customer,-using the available resources- and – of course - to be so effective as it is possible.Although this problem seems to be very easy to solve with a small number of cities or customers, it is not. In this problem the algorithm have to face with several constraints, for example opening hours, package delivery times, truck capacities, etc. This makes this problem a so called Multi Constraint Optimization Problem (MCOP). What’s more, this problem is intractable with current amount of computational power which is available for most of us. As the number of customers grow, the calculations to be done grows exponential fast, because all constraints have to be solved for each customers and it should not be forgotten that the goal is to find a solution, what is best enough, before the time for the calculation is up. This problem is introduced in the first chapter: form its basics, the Traveling Salesman Problem, using some theoretical and mathematical background it is shown, why is it so hard to optimize this problem, and although it is so hard, and there is no best algorithm known for huge number of customers, why is it a worth to deal with it. Just think about a huge transportation company with ten thousands of trucks, millions of customers: how much money could be saved if we would know the optimal path for all our packages.Although there is no best algorithm is known for this kind of optimization problems, we are trying to give an acceptable solution for it in the second and third chapter, where two algorithms are described: the Genetic Algorithm and the Simulated Annealing. Both of them are based on obtaining the processes of nature and material science. These algorithms will hardly ever be able to find the best solution for the problem, but they are able to give a very good solution in special cases within acceptable calculation time.In these chapters (2nd and 3rd) the Genetic Algorithm and Simulated Annealing is described in details, from their basis in the “real world” through their terminology and finally the basic implementation of them. The work will put a stress on the limits of these algorithms, their advantages and disadvantages, and also the comparison of them to each other.Finally, after all of these theories are shown, a simulation will be executed on an artificial environment of the VRP, with both Simulated Annealing and Genetic Algorithm. They will both solve the same problem in the same environment and are going to be compared to each other. The environment and the implementation are also described here, so as the test results obtained.Finally the possible improvements of these algorithms are discussed, and the work will try to answer the “big” question, “Which algorithm is better?”, if this question even exists.

Simulation optimization for process scheduling through simulated annealing

This paper presents a simulation optimization of a real scheduling problem in industry, simulated annealing is introduced for this purpose.  Investigation is performed into the practicality of using simulated annealing to produce high quality schedules.  Results on the solution quality and computational effort show the inherent properties of the simulated annealing.  It is shown that when using this method, high quality schedules can be produced within reasonable time contraints.