Dissertations / Theses on the topic 'Annealing'
To see the other types of publications on this topic, follow the link: Annealing.
Create a spot-on reference in APA, MLA, Chicago, Harvard, and other styles
Consult the top 50 dissertations / theses for your research on the topic 'Annealing.'
Next to every source in the list of references, there is an 'Add to bibliography' button. Press on it, and we will generate automatically the bibliographic reference to the chosen work in the citation style you need: APA, MLA, Harvard, Chicago, Vancouver, etc.
You can also download the full text of the academic publication as pdf and read online its abstract whenever available in the metadata.
Browse dissertations / theses on a wide variety of disciplines and organise your bibliography correctly.
1
Araujo, Haroldo Alexandre de. "Algoritmo Simulated Annealing." Florianópolis, SC, 2001. http://repositorio.ufsc.br/xmlui/handle/123456789/80386.
Full textAbstract:
Dissertação (mestrado) - Universidade Federal de Santa Catarina, Centro Tecnológico. Programa de Pós-Graduação em Ciência da Computação.Made available in DSpace on 2012-10-18T13:35:55Z (GMT). No. of bitstreams: 1 225675.pdf: 796704 bytes, checksum: 892abc8468e4e7c6715b6c3f2de50e51 (MD5)
A busca por soluções de problemas por meio do computador é o tema central da ciência da computação, relevante para grande parte da ciência e de suas aplicações tecnológicas. Essa busca, certamente, vai na direção de algoritmos eficientes e exatos mas que nem sempre boas soluções podem ser encontradas para muitos problemas de ordem prática, principalmente, no que diz respeito a tempo de execução. Existem problemas, dentre estes, os de otimização combinatorial que apresentam uma peculiaridade com relação aos outros, que é a grande dificuldade de se obter soluções exatas num tempo computacional aceitável. Atualmente, as novas técnicas, especialmente as metaheurísticas, tais como: Tabu Search, Simulated Annealing, Algoritmos Genéticos e Redes Neurais, vêm conseguindo sucesso na solução de problemas de otimização combinatorial, que mesmo não apresentando soluções exatas têm mostrado bastante eficiência com suas soluções aproximadas. Este trabalho propõe um novo método baseado no algoritmo Simulated Annealing (SA) através de mudanças bruscas nos valores da temperatura que são retiradas de múltiplas faixas, ao contrário do SA básico, onde esses valores são obtidos de uma faixa única, ou seja, num SA básico, os valores assumidos pela temperatura saem de um intervalo, partindo de um valor inicial, e vão diminuindo até um valor final. Tais mudanças bruscas acontecem exatamente no momento da mudança de faixa, pois o valor da temperatura que no final de uma faixa é pequeno, assume um valor correspondente a temperatura inicial da faixa seguinte, normalmente, bem maior. Posto a prova, com instâncias euclidianas do Problema Caixeiro Viajante, que é um problema de otimização combinatorial de difícil solução, o método apresenta resultados bastante satisfatórios quando comparado com o SA básico.
2
Sakhavat, Tamim, Haithem Grissa, and Ziyad Abdalrahman. "Simulated Annealing : Simulated Annealing for Large Scale Optimization in Wireless Communications." Thesis, Linnéuniversitetet, Institutionen för datavetenskap, fysik och matematik, DFM, 2012. http://urn.kb.se/resolve?urn=urn:nbn:se:lnu:diva-24606.
Full textAbstract:
In this thesis a simulated annealing algorithm is employed as an optimization tool for a large scale optimization problem in wireless communication. In this application, we have 100 places for transition antennas and 100 places for receivers, and also a channel between each position in both areas. Our aim is to nd, say the best 3 positions there, in a way that the channel capacity is maximized. The number of possible combinations is huge. Hence, nding the best channel will take a very long time using an exhaustive search. To solve this problem, we use a simulated annealing algorithm and estimate the best answer. The simulated annealing algorithm chooses a random element, and then from the local search algorithm, compares the selected element with its neighbourhood. If the selected element is the maximum among its neighbours, it is a local maximum. The strength of the simulated annealing algorithm is its ability to escape from local maximum by using a random mechanism that mimics the Boltzmann statistic.
3
Kift, Rebecca Louise. "Intermetallic compounds by reductive annealing." Thesis, University of Hull, 2010. http://hydra.hull.ac.uk/resources/hull:4452.
Full textAbstract:
The majority of the work described in this thesis focuses on the development of a new synthetic route to binary and ternary intermetallic compounds, which avoids the need for reaction at very high temperatures, multi-step reactions, reaction under vacuum and/or the synthesis of precursors. The route was adapted from a synthetic route reported for the synthesis of ternary and quaternary nitrides adopting the ε-carbide and filled β-manganese structures, where mixed metal oxides were reduced under an atmosphere of 10% hydrogen in nitrogen. In this work, binary intermetallic compounds including metal antimonides, germanides and bismuthides were prepared by reducing mixed metal oxides under 10% hydrogen in argon. A variety of high purity antimonides were synthesised, including NiSb, CoSb, CoSb3, Cu2Sb and SnSb. Tailoring of some of the properties of these antimonides was attempted by introducing other atoms into the crystal structures, thereby forming ternary compounds. The most notable ternary antimonides prepared include the solid solution of NiSb in CoSb, and the solid solution of RhSb3 in CoSb3. The Sb-Sb bond lengths in the solid solution of NiSb in CoSb display an unexpected trend, passing through a minimum. Reasons for this based on electronic grounds are suggested. Notably the Te-Te bond length within the solid solution of NiTe in CoTe does not display this variation. The solid solution of RhSb3 in CoSb3 is potentially very useful as the introduction of rhodium into the structure may alter the thermoelectric behaviour of the material. However, thermoelectric measurements on the compounds are yet to be carried out. Other work described in this thesis focuses on attempts to synthesise transition metal nitrides, firstly by extending a synthetic route reported for the synthesis of ε-carbide and filled β-manganese nitrides by introducing germanium into Fe3Mo3N, Co3Mo3N and the hypothetical compound "Ni3Mo3N", and secondly by the thermal treatment of potential precursors to binary transition metal nitrides. The synthesis and magnetic properties of Fe2GeMo3N, Co2GeMo3N and Ni2GeMo3N are discussed, and the synthesis of solid solutions of Fe2GeMo3N and Ni2GeMo3N in Co2GeMo3N are described. In addition, experiments to determine whether a small interstitial (in this case nitrogen) is needed to stabilise certain compounds adopting the ε-carbide and filled β-manganese structures are described. The preparation, crystal structures and thermal treatment of metal urea complexes as potential precursors to binary nitrides are also discussed. Two of the metal urea complexes synthesised, ([Cr(urea)4(H2O)2][NO3]3 and [Fe(urea)6][NO3]), are particularly interesting: [Cr(urea)4(H2O)2][NO3]3 crystallises in a primitive, but close to C-centred unit cell, and [Fe(urea)6][NO3]3 crystallises in a C-centred cell which is related by a five-fold expansion to a smaller pseudo C-centred cell previously reported for the same structure.
4
Thompson, J. M. "Examination scheduling using simulated annealing." Thesis, Swansea University, 1995. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.639229.
Full textAbstract:
Recent increases, both in student numbers and choice of subjects, have made the problem of producing university examination timetables increasingly difficult. Additionally, there is pressure to give students free periods between exams to aid their revision. Many other constraints may also be imposed on the timetable. The aim of this research is to investigate the usefulness of simulated annealing, as a basis of an efficient solution method, for this problem. The examination timetabling problem is shown to be equivalent to the graph colouring problem, with side constraints. This model allows several of the constraints to be included directly, thereby simplifying the problem. The colouring problem is solved in two phases, with the first obtaining a feasible colouring and the second optimising further objectives while maintaining feasibility. Simulated annealing is used to solve each phase and computational experience demonstrates that this results in high quality solutions. In phase two, only feasible solutions, that is those which satisfy the binding constraints, are considered. This may result in the solution space being disconnected or sparsely connected, possibly reducing solution quality. To overcome this problem, three means of reconnecting the solution space have been developed. The first widens the neighbourhood to include more diverse solutions. The second attempts to search disjoint components of the solution space individually, using a diversification function to guide the search. The final method reintroduces solutions that break the binding constraints to the solution space while penalising them in the cost function. Extending the neighbourhood using a graph theoretic entity called a Kempe chain significantly increases solution quality. Several explanations have been investigated. This research shows that a combination of a phased approach and Kempe chains forms the basis of an effective and flexible simulated annealing based examination timetabling system, which has been implemented successfully at a U.K. university.
5
Neil, John Paul. "Simulated annealing based datapath synthesis." Thesis, University of Edinburgh, 1994. http://hdl.handle.net/1842/12715.
Full textAbstract:
The behavioural synthesis procedure aims to produce optimised register-transfer level datapath descriptions from an algorithmic problem definition, normally expressed in a high-level programming language. The procedure can be partitioned into a number of subtasks linked by a serial synthesis flow. Graph theoretic algorithms can be used to provide solutions to these subtasks. Many of these techniques, however, belong to a class of algorithm for which there is no exact solution computable in polynomial time. To overcome this problem, heuristics are used to constrain the solution space. The introduction of heuristics can cause the algorithm to terminate in a local cost minimum. This thesis supports a global formulation of the behavioural synthesis problem. An algorithm which can avoid local minima, simulated annealing forms the basis of the synthesis system reported. A modular software system is presented in support of this approach. A novel data structure enables multiple degrees of optimisation freedom within the datapath solution space. Synthesis primitives, tightly coupled to a solution costing mechanism directed towards the prevalent datapath implementation technologies, form the core of the system. The software is exercised over small and large-scale synthesis benchmarks. The synthesis paradigm is extended by the provision of optimisation routines capable of supporting the generation of functional pipelines.
6
Arvidsson, Elisabeth. "Optimization algorithms for Quantum Annealing." Thesis, KTH, Fysik, 2020. http://urn.kb.se/resolve?urn=urn:nbn:se:kth:diva-279447.
Full text
7
Cevikbas, Safak Burak. "Visibility Based Prefetching With Simulated Annealing." Master's thesis, METU, 2008. http://etd.lib.metu.edu.tr/upload/12609324/index.pdf.
Full textAbstract:
Complex urban scene rendering is not feasible without culling invisible geometry before the rendering actually takes place. Visibility culling can be performed on predefined regions of scene where for each region a potential visible set of scene geometry is computed. Rendering cost is reduced since instead of a bigger set only a single PVS which is associated with the region of the viewer is rendered. However, when the viewer leaves a region and enters one of its neighbors, disposing currently loaded PVS and loading the new PVS causes stalls. Prefetching policies are utilized to overcome stalls by loading PVS of a region before the viewer enters it. This study presents a prefetching method for interactive urban walkthroughs. Regions and transitions among them are represented as a graph where the regions are the nodes and transitions are the edges. Groups of nodes are formed according to statistical data of transitions and used as the prefetching policy. Some heuristics for constructing groups of nodes are developed and Simulated Annealing is utilized for constructing optimized groups based on developed heuristics. The proposed method and underlying application of Simulated Annealing are customized for minimizing average transition cost.
8
Färm, Petra. "Integrated Logic Synthesis Using Simulated Annealing." Doctoral thesis, KTH, Mikroelektronik och Informationsteknik, IMIT, 2007. http://urn.kb.se/resolve?urn=urn:nbn:se:kth:diva-4257.
Full textAbstract:
A conventional logic synthesis flow is composed of three separate phases: technologyindependent optimization, technology mapping, and technology dependentoptimization. A fundamental problem with such a three-phased approach is thatthe global logic structure is decided during the first phase without any knowledge ofthe actual technology parameters considered during later phases. Although technologydependent optimization algorithms perform some limited logic restructuring,they cannot recover from fundamental mistakes made during the first phase, whichoften results in non-satisfiable solutions.We present a global optimization approach combining technology independentoptimization steps with technology dependent objectives in an annealing-basedframework. We prove that, for the presented move set and selection distribution, detailedbalance is satisfied and thus the annealing process asymptotically convergesto an optimal solution. Furthermore, we show that the presented approach cansmoothly trade-off complex, multiple-dimensional objective functions and achievecompetitive results. The combination of technology independent and technologydependent objectives is handled through dynamic weighting. Dynamic weightingreflects the sensitivity of the local graph structures with respect to the actual technologyparameters such as gate sizes, delays, and power levels. The results showthat, on average, the presented advanced annealing approach can improve the areaand delay of circuits optimized using the Boolean optimization technique providedby SIS with 11.2% and 32.5% respectively.Furthermore, we demonstrate how the developed logic synthesis framework canbe applied to two emerging technologies, chemically assembled nanotechnology andmolecule cascades. New technologies are emerging because a number of physicaland economic factors threaten the continued scaling of CMOS devices. Alternativesto silicon VLSI have been proposed, including techniques based on molecularelectronics, quantum mechanics, and biological processes. We are hoping that ourresearch in how to apply our developed logic synthesis framework to two of theemerging technologies might provide useful information for other designers movingin this direction.QC 20100709
9
Depree, Nicholas Brian. "Mathematical modelling of an annealing furnace." Thesis, University of Auckland, 2010. http://hdl.handle.net/2292/5855.
Full textAbstract:
The metal coating line at New Zealand Steel relies on a large electric radiant furnace to heat steel strip before hot-dip galvanising in a continuous process. The temperature evolution of the strip inside the furnace is vital in ensuring the speci ed mechanical properties are achieved for a range of steel products. Ductile products require high temperatures su cient to cause recrystallisation of the steel microstructure, while stronger products must be heated without causing recrystallisation. Strip dimensions and desired properties are changed often and irregularly during operation, and these changes and associated furnace control actions cause changes in furnace and strip temperatures and rate of heat transfer over several di erent time scales. Accurate control of temperature is di cult because temperature measurement devices are strongly a ected by re ected radiation in the furnace cavity. The furnace is often operating during transient temperature conditions, as control actions take e ect very slowly compared to the the rate of change of operational targets. Understanding of the transient behaviour of this system of interrelated, nonlinear variables can be improved using modelling to calculate furnace and strip temperatures as a result of control actions in real time, which cannot otherwise be measured or predicted. It is shown that a three-dimensional model is capable of accurately calculating furnace temperatures changing over both time and location, requiring minimal simpli cation of the physical system, but is computationally expensive. Radiative heat exchange in the furnace cavity causes signi cantly increased temperature along the edges of the steel strip, which can cause reject product due to localised softening. It was found that furnace thermocouples are strongly a ected by re ected radiation, so that furnace wall temperatures be may signi cantly hotter than measured. A simpli ed, coupled temperature-metallurgical model was shown to accurately calcui late both furnace and strip temperatures and metallurgical changes, while the 3D model provides understanding of e ects not explicitly modelled in the simpli ed model. The simpli ed model is used for optimisation of furnace operational parameters, to improve plant throughput and energy e ciency while maintaining desired metallurgical properties, which is demonstrated by application to common products at NZ Steel.
10
Allred, Kory J. "Horizontal alignment optimization using simulated annealing /." Available to subscribers only, 2006. http://proquest.umi.com/pqdweb?did=1240703751&sid=3&Fmt=2&clientId=1509&RQT=309&VName=PQD.
Full text
11
Faassen, Johannes [Verfasser]. "Voll datenparalleles Simulated Annealing / Johannes Faassen." Aachen : Shaker, 2003. http://d-nb.info/1179034473/34.
Full text
12
李榮彬 and Wing-bun Lee. "Annealing studies in cold-rolled -brass." Thesis, The University of Hong Kong (Pokfulam, Hong Kong), 1986. http://hub.hku.hk/bib/B31230659.
Full text
13
Wade, A. S. C. "Developments of the simulated annealing algorithm." Thesis, University of East Anglia, 1998. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.300076.
Full text
14
Zhou, Guobiao. "Finite time performance of simulated annealing." Thesis, Glasgow Caledonian University, 1993. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.358284.
Full text
15
MENDONCA, JORGE MAGALHAES DE. "1D SEISMIC INVERSION USING SIMULATED ANNEALING." PONTIFÍCIA UNIVERSIDADE CATÓLICA DO RIO DE JANEIRO, 1997. http://www.maxwell.vrac.puc-rio.br/Busca_etds.php?strSecao=resultado&nrSeq=7536@1.
Full textAbstract:
O problema de Inversão Sísmica envolve a determinação
das
propriedades físicas da superfície a partir de dados
amostrados na superfície. A construção de um modelo
matemático da resposta da subsuperfície à excitação de
uma
fonte sísmica, tendo como parâmetros as propriedades
físicas da subsuperfície, fornece um modelo sintético
desta resposta para determinados valores dos parâmetros.
Isto permite comparar dados amostrados e modelos
sintético. A perturbação do modelo pela variação dos
seus
parâmetros pode aproximar dados amostrados e sintéticos
e
colocar o problema da Inversão como um problema de
minimização de uma função de erro que os ajuste de forma
adequada. Usualmente, os métodos que tentam minimizar a
medida a medida de erro supõem um comportamento linear
entre a perturbação do modelo e esta medida. Na maioria
dos problemas geofísicos, esta medida apresenta um alto
grau de não linearidade e uma grande quantidade de
mínimos
locais. Isto torna estes métodos baseados em
aproximações
lineares muito sensíveis à escolha de uma boa solução
inicial, o que nem sempre está disponível.
Como resolver este problema sem uma boa solução
inicial? A teoria da Inferência Bayesiana oferece uma
solução pelo uso de informação a priori sob o espaço dos
parâmetros. O problema de Inversão volta então a ser um
problema de otimização onde se precisa maximizar a
probabilidade a posteriori dos parâmetros assumirem um
certo valor dado que se obteve o resultado da amostragem
dos dados. Este problema é resolvido pelo método do
Simulated Annealing (SA), método de otimização global
que
faz uma busca aleatória direcionada no espaço de
solução.
Este método foi proposto por uma analogia entre o
recozimento física de sólidos e problemas de otimização.
O SA, na sua variante Very Fast Simulated
Annealing (VFSA), é aplicado na solução de problemas de
Inversão Sísmica 1 D para modelos acústico e elásticos
gerados sinteticamente. A avaliação do desempenho do SA
usando medidas de erro com diferentes normas é realizada
para um modelo elástico adicionado de ruído aleatório.The seismic inverse problem involves determining the subsurface physical properties from data sampled at Earth`s surface. A mathematical model of the response of the subsurface excited by a seismic source, having physical properties as parameters, provides a synthetic model for this response. This makes possible to compare sampled and synthetic data. The perturbation in the model due to the variation of its parameters can approximate these data and states the inversion problem as the minimization of an error function that fits them adequately. Usually, the methods which attempt to minimize this error assume that a perturbation in the model is linearly relates with a perturbation in the measured response. Most geophysical inverse problems are highly nonlinear and are rife with local minima. Therefore these methods are very sensitive to the choice of the initial model and good starting solutions may not be available. What should be done, if there is no basis for an initial guess? The theory of Bayesian inference provides an answer to this question taking into account the prior information about the parameter space. The inverse problem can then be stated as an optimization problem whose goal is to maximize the posterior probability that the set of parameters has a certain value once given the result of the sample. This problem is solved by the Simulated Annealing method, a global optimization method that executes a oriented random search in the solution space. This method comes from an analogy between the physical annealing of solids and optimization problems. The Very Fast Simulated Annealing (VFSA), a variant of SA, is applied to the solution of 1 D seismic inverse problems generated synthetically by acoustic and alastic done by a elastic model with additive noise.
16
Gelfand, Saul B. (Saul Brian). "Analysis of simulated annealing type algorithms." Thesis, Massachusetts Institute of Technology, 1987. http://hdl.handle.net/1721.1/14935.
Full textAbstract:
Thesis (Ph. D.)--Massachusetts Institute of Technology, Dept. of Electrical Engineering and Computer Science, 1987.MICROFICHE COPY AVAILABLE IN ARCHIVES AND ENGINEERING
Bibliography: leaves 101-103.
by Saul B. Gelfand.
Ph.D.
17
McAleese, Colin. "Electrochemically induced annealing of alloy surfaces." Thesis, University of Cambridge, 2008. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.612032.
Full text
18
Nunes, Luís. "Monitoring networks optimization with simulated annealing." Doctoral thesis, Instituto Superior Técnico - Universidade Técnica de Lisboa, 2003. http://hdl.handle.net/10400.1/1160.
Full textAbstract:
Tese dout., Ciências de Engenharia, Instituto Superior Técnico, Universidade Técnica de Lisboa, 2003In this work some methods to optimize environmental monitoring networks are proposed. These methods share simulated annealing as the approximation algorithm. Only monitoring networks reduction is treated here. Monitoring network optimization is a very actual problem given the large number of existing networks in many countries operating large numbers of stations, some of which may be redundant, with very high exploitation costs. Difficulties appear when exploitation costs pushes the dimension of a network towards a minimum, and the statistical reliability pushes in the opposite direction. Finding the optimal dimension may be a very difficult optimization problem due to the large number of combinations, even for small network dimensions. Further complications appear when the available data is too incomplete or come from different homogeneous areas. Some practical answers to these problems were sought in this work. Results showed that optimizing a monitoring network dimension and location of stations, without compromising the quality of the collected data, could attain large reductions in exploitation costs. Simulated annealing showed to be a very flexible and efficient algorithm.
19
CHEN, TAO. "Multi-FPGA Partitioning Using Simulated Annealing." University of Cincinnati / OhioLINK, 2004. http://rave.ohiolink.edu/etdc/view?acc_num=ucin1077766831.
Full text
20
Bizhani, Maryam. "Thermal Annealing Effects on 2D Materials." Ohio University / OhioLINK, 2019. http://rave.ohiolink.edu/etdc/view?acc_num=ohiou1575627966654889.
Full text
21
Shakoor, Arif. "Crop rotation planning using simulated annealing." Master's thesis, This resource online, 1995. http://scholar.lib.vt.edu/theses/available/etd-02232010-020018/.
Full text
22
Lee, Wing-bun. "Annealing studies in cold-rolled -brass /." [Hong Kong : University of Hong Kong], 1986. http://sunzi.lib.hku.hk/hkuto/record.jsp?B12322799.
Full text
23
Chen, Tung-Sheng. "Simulated annealing in sonar track detection." Thesis, Monterey, California : Naval Postgraduate School, 1990. http://handle.dtic.mil/100.2/ADA241785.
Full textAbstract:
Thesis (M.S. in Electrical Engineering)--Naval Postgraduate School, December 1990.Thesis Advisor(s): Lee, Chin-Hwa. Second Reader: Therrien, Charles W. "December 1990." Description based on title screen as viewed on April 02, 2010. DTIC Descriptor(s): Simulation, optimization, detection, sonar, edges, theses, sensitivity, noise, annealing, detectors DTIC Identifier(s): Sonar tracking, edge detectors, signal to noise ratio, combinatorial optimization, simulation. Author(s) subject terms: Simulated annealing, sonar track detection, combinatorial optimization Includes bibliographical references (p. 59). Also available in print.
24
Seacat, Russell Holland III. "Parallelization of the simulated annealing algorithm." Diss., The University of Arizona, 1993. http://hdl.handle.net/10150/186551.
Full textAbstract:
Nuclear medicine imaging involves the introduction of a radiopharmaceutical into the body and the subsequent detection of the radiation emanating from the organ at which the procedure was directed. The data set resulting from such a procedure is generally very underdetermined, due to the dimensions of the imaging apparatus, and underconstrained due to the noise in the imaging process. A means by which more information can be obtained is through a form of imaging utilizing code-apertures. Although increasing the amount of information collected, coded-aperture imaging results in a multiplexing of the data. Demultiplexing the data requires a reconstruction process not required in conventional nuclear medicine imaging. The reconstruction process requires the optimization of an estimate to the object to be reconstructed. This optimization is done through the minimization of an energy functional. The minimization of such energy functionals requires the optimization of several parameters. Solution of this type problem is difficult because there are far too many degrees of freedom to permit an exhaustive search for an optimum, and in many cases no algorithms are known which will determine the exact optimum with significantly less work than exhaustive search. Instead, heuristic algorithms, such as the simulated annealing algorithm, have been employed and have proven effective in minimizing such energy functionals. Unfortunately, the simulated annealing algorithm, as characteristic of Monte Carlo algorithms, is very computer intensive; in fact, it is so intensive that insufficient computational power is often the chief hindrance to investigation of the algorithm. The simulated annealing algorithm, however, is amenable to parallel processing. The goal of the research in this dissertation is to investigate the parameters involved in implementing the simulated annealing algorithm in parallel; however, the form of the simulated annealing algorithm implemented here requires no annealing because the energy functionals investigated are quadratic in form. The parameters related to the parallelization of the simulated annealing algorithm include the decomposition of the reconstruction space among the processors, the formulation of the problem at the estimate level with the smallest task being a single perturbation trial evaluated on a local basis, and the communications required to keep all the processors as current as possible with changes made simultaneously to the estimate. Three objects, varying in size, shape and detail, are reconstructed utilizing the TRIMM parallel processor.
25
Stella, Lorenzo. "Studies of Classical and Quantum Annealing." Doctoral thesis, SISSA, 2005. http://hdl.handle.net/20.500.11767/4079.
Full textAbstract:
A summary of the results of recent applications of PIMC-QA on different optimization problems is given in Chapter 1.
In order to gain understanding on these problems, we have moved one step back, and concentrated attention on the simplest textbook problems where the energy landscape is well under control: essentially, one-dimensional potentials, starting from a double-well potential, the simplest form of barrier. On these well controlled landscapes we have carried out a detailed and exhaustive comparison between quantum adiabatic Schrödinger evolution, both in real and in imaginary time, and its classical deterministic counterpart, i.e., Fokker-Planck evolution [17]. This work will be
illustrated in Chapter 2. On the same double well-potential, we have also studied the performance of different
stochastic annealing approaches, both classical Monte Carlo annealing and PIMCQA. The CA work is illustrated in Chapter 3, where we analyze the different annealing behaviors of three possible types of Monte Carlo moves (with Box, Gaussian, and Lorentzian distributions) in a numerical and analytical way. The PIMC-QA work is illustrated in Chapter 4, were we show the difficulties that a state-of-the-art PIMCQA algorithm can encounter in describing tunneling even in a simple landscape, and we also investigate the role of the kinetic energy choice, by comparing the standard
non-relativistic dispersion, Hkin = Tau(t)p^2, with a relativistic one, Hkin = Tau(t)|p|, which turns out to be definitely more effective. In view of the difficulties encountered by PIMC-QA even in a simple double-well potential, we finally explored the capabilities of another well established QMC technique, the Green's Function Monte Carlo (GFMC), as a base for a QA algorithm. This time, we concentrated our attention on a very studied and challenging optimization problem, the random Ising model ground state search, for which both CA and PIMC-QA data are available [10, 11]. A more detailed summary of the results and achievements described in this Thesis, and a discussion of open issues, is contained in the final section `Conclusions and Perspectives'. Finally, in order to keep this Thesis as self-contained as possible, we include in the appendices a large amount of supplemental material.
26
Wang, Xuege. "Pulsed laser annealing and rapid thermal annealing of copper-indium-gallium-diselenide-based thin-film solar cells." [Gainesville, Fla.] : University of Florida, 2005. http://purl.fcla.edu/fcla/etd/UFE0011372.
Full text
27
Norgren, Eric, and Johan Jonasson. "Investigating a Genetic Algorithm-Simulated Annealing Hybrid Applied to University Course Timetabling Problem : A Comparative Study Between Simulated Annealing Initialized with Genetic Algorithm, Genetic Algorithm and Simulated Annealing." Thesis, KTH, Skolan för datavetenskap och kommunikation (CSC), 2016. http://urn.kb.se/resolve?urn=urn:nbn:se:kth:diva-186364.
Full textAbstract:
Every semester universities around the world have to create new schedules. This task can be very complex considering that a number of constraints has to be taken into account, e.g. there should not exist any timetable clashes for students and a room cannot be double-booked. This can be very hard and time-consuming for a human to do by hand, which is why methods to automate this problem, the University Course Timetabling Problem, has been researched for many years. This report investigates the performance of a hybrid consisting of Genetic Algorithm and Simulated Annealing when solving the University Course Timetabling Problem. An implementation by Yamazaki & Pertoft (2014) was used for the Genetic Algorithm. Simulated Annealing used the Genetic Algorithm as base for its implementation. The hybrid runs the Genetic Algorithm until some breakpoint, takes the best timetable and uses it as an initial solution for the Simulated Annealing. Our results show that our implementation of Simulated Annealing performs better than the hybrid and magnitudes better than the Genetic Algorithm. We believe one reason for this is that the dataset used was too simple, the Genetic Algorithm might scale better as the complexity of the dataset increases.
28
David, Philip John. "Deterministic annealing for correspondence, pose, and recognition." College Park, Md. : University of Maryland, 2006. http://hdl.handle.net/1903/3528.
Full textAbstract:
Thesis (Ph. D.) -- University of Maryland, College Park, 2006.Thesis research directed by: Computer Science. Title from t.p. of PDF. Includes bibliographical references. Published by UMI Dissertation Services, Ann Arbor, Mich. Also available in paper.
29
Jonsson, Per-Axel. "Simulated Annealing : implementering mot integrerade analoga kretsar." Thesis, Linköping University, Department of Electrical Engineering, 2004. http://urn.kb.se/resolve?urn=urn:nbn:se:liu:diva-2531.
Full textAbstract:
Today electronics becomes more and more complex and to keep low costs and power consumption, both digital and analog parts are implemented on the same chip. The degree of automization for the digital parts have increased fast and is high, but for the analog parts this has not come through. This have created a big gap between the degrees of automization for the two parts and makes the analog parts the bottleneck in electronics develop.
Research is ongoing at Electronics systems group at Linköping University target the increase of design automization for analog circuits. An optimizationbased approach for device sizing is developed and for this a good optimization method is needed which can find good solutions and meet the specification parameters.
This report contains an evaluation of the optimization method Simulated Annealing. Many test runs have been made to find out good control parameters, both for Adaptiv Simulated Annealing (ASA) and a standard Simulated Annealing method. The result is discussed and all the data is in the enclosures. A popular science and mathematical description is given for Simulated Annealing as well.
30
Bhatnagar, Nayantara. "Annealing and Tempering for Sampling and Counting." Diss., Georgia Institute of Technology, 2007. http://hdl.handle.net/1853/16323.
Full textAbstract:
The Markov Chain Monte Carlo (MCMC) method has been widely used in practice since the 1950's in areas such as biology, statistics, and physics. However, it is only in the last few decades that powerful techniques for obtaining rigorous performance guarantees with respect to the running time have been developed. Today, with only a few notable exceptions, most known algorithms for approximately uniform sampling and approximate counting rely on the MCMC method. This thesis focuses on algorithms that use MCMC combined with an algorithm from optimization called simulated annealing, for sampling and counting problems.
Annealing is a heuristic for finding the global optimum of a function over a large search space. It has recently emerged as a powerful technique used in conjunction with the MCMC method for sampling problems, for example in the estimation of the permanent and in algorithms for computing the volume of a convex body. We examine other applications of annealing to sampling problems as well as scenarios when it fails to converge in polynomial time.
We consider the problem of randomly generating 0-1 contingency tables. This is a well-studied problem in statistics, as well as the theory of random graphs, since it is also equivalent to generating a random bipartite graph with a prescribed degree sequence. Previously, the only algorithm known for all degree sequences was by reduction to approximating the permanent of a 0-1 matrix. We give a direct and more efficient combinatorial algorithm which relies on simulated annealing.
Simulated tempering is a variant of annealing used for sampling in which a temperature parameter is randomly raised or lowered during the simulation. The idea is that by extending the state space of the Markov chain to a polynomial number of progressively smoother distributions, parameterized by temperature, the chain could cross bottlenecks in the original space which cause slow mixing. We show that simulated tempering mixes torpidly for the 3-state ferromagnetic Potts model on the complete graph. Moreover, we disprove the conventional belief that tempering can slow fixed temperature algorithms by at most a polynomial in the number of temperatures and show that it can converge at a rate that is slower by at least an exponential factor.
31
Luetkenhaus, Deana M. "Annealing fear : designing costumes for "The Crucible" /." Available to subscribers only, 2007. http://proquest.umi.com/pqdweb?did=1328054851&sid=6&Fmt=2&clientId=1509&RQT=309&VName=PQD.
Full text
32
Porter, Mark A. "Evolving inferential fermentation models using symbolic annealing." Thesis, University of Newcastle Upon Tyne, 2003. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.275517.
Full text
33
Bollinger, S. Wayne. "Processor and link assignment using simulated annealing." Thesis, Virginia Tech, 1988. http://hdl.handle.net/10919/43836.
Full textAbstract:
Advances in VLSI technology have made possible a new generation of multicomputer systems that contain hundreds or thousands of processors and offer a combined processing power far beyond that possible in a single processor machine. Multicomputers can be used to solve a variety of computationally intensive applications, but they introduce the problem of handling communication between concurrent processes. In the design of multicomputer systems, the scheduling and mapping of a parallel algorithm onto a host architecture has a critical impact on overall system performance.
The problem of how to best assign the resources of a host multicomputer system to the cooperating tasks of a parallel application program is known as the mapping problem. In this research we develop a graph-based solution to both aspects of the mapping problem using the simulated annealing optimization heuristic. A two phase mapping strategy is formulated: I) process annealing assigns parallel processes to processing nodes, and 2) connection annealing schedules traffic connections on network data links so that interprocess communication conflicts are minimized.
To evaluate the quality of generated mappings, cost functions suitable for simulated annealing are derived that accurately quantify communication overhead. Communication efficiency is formulated to measure the quality of assignments when the optimal mapping is unknown. Application examples are presented using the hypercube as a host architecture, with host graphs containing up to 512 nodes. The influence of various parameters on the annealing algorithms is investigated, and results for several image graphs are presented.Master of Science
34
Vikstål, Pontus. "Continuous-variable quantum annealing with superconducting circuits." Thesis, Linköpings universitet, Institutionen för fysik, kemi och biologi, 2018. http://urn.kb.se/resolve?urn=urn:nbn:se:liu:diva-151889.
Full textAbstract:
Quantum annealing is expected to be a powerful generic algorithm for solving hard combinatorial optimization problems faster than classical computers. Finding the solution to a combinatorial optimization problem is equivalent to finding the ground state of an Ising Hamiltonian. In today's quantum annealers the spins of the Ising Hamiltonian are mapped to superconducting qubits. On the other hand, dissipation processes degrade the success probability of finding the solution. In this thesis we set out to explore a newly proposed architecture for a noise-resilient quantum annealer that instead maps the Ising spins to continuous variable quantum states of light encoded in the field quadratures of a two-photon pumped Kerr- nonlinear resonator based on the proposal by Puri et al. (2017). In this thesis we study the Wigner negativity for this newly proposed architecture and evaluate its performance based on the negativity of the Wigner function. We do this by determining an experimental value to when the presence of losses become too detrimental, such that the Wigner function of the quantum state during the evolution within the anneal becomes positive for all times. Furthermore, we also demonstrate the capabilities of this continuous variable quantum annealer by simulating and finding the best solution of a small instance of the NP-complete subset sum problem and of the number partitioning problem.
35
Maziero, Edélcio Augusto. "Algoritmos Simulated Annealing em paralelo + Genético Grossover." Florianópolis, SC, 2003. http://repositorio.ufsc.br/xmlui/handle/123456789/85178.
Full textAbstract:
Dissertação (mestrado) - Universidade Federal de Santa Catarina, Centro Tecnológico. Programa de Pós-Graduação em Ciência da Computação.Made available in DSpace on 2012-10-20T16:05:26Z (GMT). No. of bitstreams: 1 195928.pdf: 2356678 bytes, checksum: 164754abb834f5498d839239ae33e9d7 (MD5)
Problemas combinatorias são utilizados em muitas áreas de pesquisa, devido a sua simplicidade de compreensão e a sua aplicabilidade prática em vários domínios. Porém são intratáveis devido ao elevado tempo de processamento e de armazenamento de dados, sendo assim conhecidos e classificados como problemas NP-completos. Visando resolver estes problemas, diversos algoritmos têm sido propostos ao longo de vários anos de estudo, entre eles os Algoritmos Genéticos (AG) e o Algoritmo Simulated Annealing (SA). Estes algoritmos dão um tratamento polinomial aos problemas de otimização, buscando uma boa solução próxima a ótima em um tempo de processamento aceitável. Este trabalho concentra-se no estudo do AG e do SA aplicados ao clássico "Problema do Caixeiro Viajante". Propõe-se uma abordagem híbrida baseada no desenvolvimento do algoritmo SA em ambiente distribuído acrescido do operador "crossover" dos AG. A utilização em conjunto destas abordagens busca aumentar a potencialidade de obtenção de melhores resultados quando aplicados a problemas de otimização, sendo avaliado através de testes computacionais com instâncias públicas disponíveis via internet e instâncias construídas, também com suas soluções, conhecidas a priori.
36
Nakasuga, Wagner Massayuki. "Estudo do annealing de traços de fissão em epídoto /." Rio Claro : [s.n.], 2010. http://hdl.handle.net/11449/92899.
Full textAbstract:
Orientador: Peter Christian HackspacherCoorientador: Eduardo Augusto Campos Curvo
Banca: Julio Cesar Hadler Neto
Banca: Sandro Guedes de Oliveira
Resumo: No presente trabalho foram efetuados estudos sobre o annealing dos traços de fissão em epídoto. Os experimentos foram feitos aquecendo-se o mineral por tempos de 1, 10 e 100 horas, variando a temperatura de 350 a 950°C. Os resultados obtidos foram curvas de annealing tanto para comprimento como para densidade dos traços. Os dados de comprimento dos traços de fissão foram utilizados para obter os parâmetros do modelo de cinética de annealing para o epídoto. O modelo utilizado foi o proposto pelo grupo de Cronologia da UNICAMP. Cálculos baseados nesses ajustes conduziram a uma previsão de zona de annealing parcial (ZAP) entre 218 a 588°C (para 1 Ma). Quando unidos com os dados de annealing para epídoto de Curvo (2005) a zona de annealing parcial prevista varia de 218 a 487°C (para 1 Ma). Esses valores situam a ZAP para tracos de fissão armazenados no epídoto acima da ZAP para a apatita e sobreposta a ZAP do zircão (possuindo, contudo o limite superior da ZAP acima da do zircão). Uma nova curva de ataque químico foi confeccionada com intenção de se utilizar uma menor temperatura do reagente (15°C, 40% HF). Nove pontos de ataque químico foram realizados, em tempos que variam de 30 a 110 minutos. O tempo estabelecido como ótimo foi 80 minutos. Realizou-se também, uma tentativa de datação de uma amostra de fratura localizada nas redondezas do município de Curitiba. A idade aparente encontra da foi de 240±209 Ma
Abstract: This paper presents studies conducted on the annealing of fission tracks in the epidote. The experiments were done by heating the mineral in time periods of 1, 10 and 100 hours, varying the temperature between 350 and 950°C.The results obtained were annealing curves both for length and for density of the fission tracks. The length data of the fission tracks were used to obtain the parameters for the annealing kinetics model of the epidote. The kinetic model for fission track used was the one proposed by the UNICAMP Chronology group. The mathematical calculations based on these adjustments led to a prediction of a partial annealing zone (PAZ) between 218 and 588°C (for 1 Ma).When united with the data for epidote annealing from Curvo (2005) the partial annealing zone varies from 218 to 487°C (for 1 Ma).These values situate the epidote PAZ above the apatite PAZ and having an intersection with the zircon one (presenting however an upper limit superior to the zircon PAZ).A new etching curve was measured aiming at a lower reagent temperature (15°C, 40% HF). Nine etching points were carried out in time periods ranging from 30 to 110 minutes. The optimal etching time was 80 minutes. An attempt to date an epidote fracture sample located near the city of Curitiba was also conducted. The dating provided the apparent age of 240±209 Ma
Mestre
37
Moins, Stephane. "Implementation of a Simulated Annealing algorithm for Matlab." Thesis, Linköping University, Department of Electrical Engineering, 2002. http://urn.kb.se/resolve?urn=urn:nbn:se:liu:diva-1344.
Full textAbstract:
In this report we describe an adaptive simulated annealing method for sizing the devices in analog circuits. The motivation for use an adaptive simulated annealing method for analog circuit design are to increase the efficiency of the design circuit. To demonstrate the functionality and the performance of the approach, an operational transconductance amplifier is simulated. The circuit is modeled with symbolic equations that are derived automatically by a simulator.
38
Babaghorbani, Payman. "Annealing behaviour of cold deformed AA3003 aluminum alloys." Thesis, University of British Columbia, 2015. http://hdl.handle.net/2429/54656.
Full textAbstract:
AA3xxx series aluminum alloys which are used in automotive heat exchangers usually experience a complicated thermomechanical history with a number of processing steps including homogenization, extrusion, cold deformation and then annealing. The cold deformation can involve a wide range of strains, for example, a few percent strain for micro-multiport tubing and large strains for tube drawing. Often the parts are annealed either as a separate processing step or in conjunction with the brazing operation. Results from industry suggest that a wide range of microstructures can be observed after brazing, ranging from coarse multi-crystals to fine grained polycrystalline microstructures. As such, annealing behaviour of cold deformed AA3003 based alloys after extrusion was investigated in this work. Experimental work was conducted on two alloys homogenized prior to extrusion: 3003 (0.54 wt% Fe) and low Fe 3003 (0.09 wt% Fe). A variety of homogenization heat treatments were examined in order to produce the starting materials. Microstructure, yield stress, work hardening and recrystallization behavior of these alloys with different initial microstructures were investigated. A wide range of pre-strain (1-80%) was applied at room temperature using tensile test and rolling. Although most of the annealing treatments were done at 600 °C, samples with pre-strains larger than 0.1 were also annealed at 350-600 °C to study the effect of temperature on microstructure evolution. The minimum strain required to initiate recrystallization was experimentally measured for each condition using tapered samples. As expected, it was found that dispersoids significantly inhibit recrystallization process and can change the critical strain for recrystallization as high as 18%. In addition, contribution from different strengthening mechanisms on the yield stress and work hardening behaviour was calculated and then a model was developed to describe the stress-strain response. The model represents experimental data within ±10% for both yield stress and UTS over a wide range of conditions. Consequently, a physically based model was developed for the critical strain required to initiate recrystallization. This is the first attempt, to the author’s best knowledge, to model critical strain in a system with distribution of fine and relatively large precipitates.Applied Science, Faculty of
Materials Engineering, Department of
Graduate
39
Parks, Kevin Preston. "Geosystem modeling with Markov chains and simulated annealing." Thesis, National Library of Canada = Bibliothèque nationale du Canada, 1998. http://www.collectionscanada.ca/obj/s4/f2/dsk2/tape17/PQDD_0004/NQ31063.pdf.
Full text
40
Velis, Danilo Rubén. "Application of simulated annealing to some seismic problems." Thesis, National Library of Canada = Bibliothèque nationale du Canada, 1998. http://www.collectionscanada.ca/obj/s4/f2/dsk2/tape17/PQDD_0024/NQ34639.pdf.
Full text
41
Kumar, Vivek. "IMPLANT ANNEALING OF SiC IN A SILANE AMBIENT." MSSTATE, 2001. http://sun.library.msstate.edu/ETD-db/theses/available/etd-04102001-151957/.
Full textAbstract:
The goal of this research project was to develop a new implant annealing process using silane overpressure to maintain crystal integrity. After ion implantation the surface of the SiC wafer is damaged due to high energy of the implant ions. In addition the doping activation is very low. To overcome these problems a new implant annealing process was developed to rectify the surface damage and increase the dopant activation. SiC implant annealing was performed in the silicon carbide (SiC) chemical vapor deposition (CVD) reactor in the Emerging Materials Research Laboratory (EMRL) at Mississippi State University. A process was developed to eliminate surface step bunching, which is evident in argon annealed crystals. The process gas used in the new technique was silane (3 % SiH4 in 97% UHP Ar). The anneal run time was 30 minutes with argon flow rate at 6 slm and silane flow rate at 6 sccm. SiC material (n and p type epitaxial layers) and devices (JBS Diodes and LDMOSFET?s) were annealed using the silane over pressure developed during this research. The process results were characterized using tools such as optical micrograph, capacitance-voltage (C-V), Atomic force microscopy (AFM) and X-ray photoelectron spectroscopy (XPS). These characterization tools were mainly used to determine the surface roughness of the SiC crystal and the dopant activation after annealing. As compared to an Ar anneal, the SiC material and devices annealed in the silane ambient had a better surface. An empirical process chemistry model was developed to support the experimental results. The model developed showed that the partial pressure of Si is greater than the vapor pressure of SiC in the substrate. Thus it is believed that the partial pressure of Si suppressed any Si out-diffusion from the SiC substrate, thereby maintaining the crystal surface integrity. The model also provided silane flow rates for higher temperature anneals which may be necessary to fully activate other ion species.
42
Persson, Per. "Annealing Based Optimization Methods for Signal Processing Applications." Doctoral thesis, Ronneby : Department of Telecommunications and Signal Processing, Blekinge Institute of Technology, 2003. http://www.bth.se/fou/forskinfo.nsf/01f1d3898cbbd490c12568160037fb62/da44274e9f86a54ec1256d260044e0dd!OpenDocument.
Full text
43
Sakai, Akira, Shinsuke Sakashita, Mitsuo Sakashita, Yukio Yasuda, Shigeaki Zaima, and Seiichi Miyazaki. "Praseodymium silicate formed by postdeposition high-temperature annealing." American Institute of Physics, 2004. http://hdl.handle.net/2237/7010.
Full text
44
Lee, Jinkyu. "The tenacity increase with annealing thermotropic copolyester fibers." Thesis, Georgia Institute of Technology, 1993. http://hdl.handle.net/1853/8590.
Full text
45
Park, Jong-Tae 1962. "Development of annealing texture in nonoriented electrical steels." Thesis, McGill University, 2002. http://digitool.Library.McGill.CA:80/R/?func=dbin-jump-full&object_id=83087.
Full textAbstract:
Nonoriented electrical steels are mainly used as the core materials in motors and generators. The magnetic properties required for these materials are low core loss, high magnetic induction and high magnetic permeability. These magnetic properties of nonoriented electrical steels are mainly influenced by grain size and crystallographic texture. All research to improve the magnetic properties so far has focused on grain growth through the control of chemical compositions and various processing parameters. However, in the manufacturing techniques of nonoriented electrical steels, the control of grain size is approaching its limit. Since there is still enough room to improve the magnetic properties through the control of texture, future research in nonoriented electrical steels should be concentrated on the optimization of crystallographic texture.Recrystallization texture itself has long been a subject of research because the origin of recrystallization texture provides a high level of scientific interest. Despite much research on recrystallization texture, the mechanism of the formation of recrystallization texture is still disputed. This dispute is associated with the complexity of microstructural inhomogeneity formed in the deformed state, different nucleation rates for different orientations of deformed grains and different growth rates of nuclei into the neighboring deformed matrix. However, the advent of Orientation Imaging Microscopy (OIM) has contributed to a remarkable progress in the area of recrystallization texture, and stimulated research on the annealing texture in low carbon and interstitial free steels. Conversely, no systematic research on the evolution of the annealing texture in nonoriented electrical steels has yet been done.
The mechanism of texture evolution during recrystallization in the nonoriented electrical steels containing 1% and 2% Si respectively, a main objective of this thesis, is investigated from electron backscatter diffraction (EBSD) measurements on the materials with different recrystallization fractions. Based on obtained results, the mechanism for the formation of the recrystallization texture is proposed. The behavior of deformed grains of specific orientations is also discussed in terms of image quality value introduced by EBSD techniques. In addition, the origin of nuclei of specific orientations is suggested from observed EBSD results.
The texture development during grain growth, another main objective of this thesis, is investigated. Furthermore, a mechanism of texture development during grain growth is proposed based on the misorientation angle distribution with adjacent grains and the average size of grains of specific orientations.
Some useful means to optimize the magnetic properties through texture control in nonoriented electrical steels are studied. The effect of initial grain size prior to cold rolling on texture evolution during both the recrystallization stage and the grain growth stage is clarified. In addition, the effects of temper rolling reduction and annealing time on texture development during final annealing are examined. A mechanism of texture transformation by strain induced boundary migration (SIBM) is suggested by means of the introduction of image quality value in EBSD techniques. Finally, the effect of heating rate on texture development during final annealing is investigated, and the reason for texture change due to different heating rates is discussed.
46
Dahlqvist, v. "Increase the capacityof continuous annealing furnaces at Ovako." Thesis, KTH, Materialvetenskap, 2012. http://urn.kb.se/resolve?urn=urn:nbn:se:kth:diva-161909.
Full textAbstract:
The capacity of soft annealing of low alloyed tubes at Ovako’s continuous annealing furnaces have been evaluated by comparing how it is done today with information from published and internal articles on the subject. It was found that it is possible to reduce the cycle time by 30 % for one furnace, 55 % for one furnace and 72 % for two furnaces. Two separate fullscale tests were made to assess whether the faster soft annealing procedure was feasible. The tests were performed without any reconstruction of the furnace and were made by continuously vary the speed of the batch inside thefurnace. The temperature in the batch was measured and compared with results from computer simulations of the heating/cooling sequences. The computer simulations were performed in COMSOL. The soft annealing was evaluated according to the SEP-520 standard ,which means evaluating the microstructure and hardness. The results show that the faster heat treatment could yield lower grades than today but still meet it’s requirements. In order to achieve this increase a reconstruction of the furnaces is needed and the reconstruction is briefly treated in the report. Ideas to further increase the speed of the soft annealing procedure are also presented.
47
Lu, Shihsheng, and 呂詩聖. "Bright Annealing Research of the Annealing Furnace Energy-Saveing System." Thesis, 2013. http://ndltd.ncl.edu.tw/handle/wsxvc3.
Full textAbstract:
碩士義守大學
機械與自動化工程學系碩士在職專班
101
Since the industrial revolution﹐as the economy has grown﹐human beings continually invent different new materials﹒Steel has porven to be an excellent materials that is difficult to replace in industry﹒It has four main characteristice﹐strength﹐density (compared with water)﹐formability and application﹐but is heavier than other materials﹒Howerver﹐the steel industry is a high consumption industry﹒According to the data﹐the ratio of the energy consumption and the emission of carbon dioxide (CO2) is the greatest of the whole nations industry﹒Thus﹐the revolution of steel industry is playing an important role domestic energy saving and environmental protection﹒Under the condition of the rising price of the enery and the factor of environmental protection﹐it has become a great challenge for the steel industry﹒During the process of iron-making and steel-making﹐both need to be heated and burnt; this is not only results in huge consumption of energy but also causes air pollution﹒Thus﹐it has became an important topic for the steel industry to be able to find a cost effective way to protect the environment and save energy while maintaining production and quality control﹒
48
Campaigne, Wesley. "Frozen-State Hierarchical Annealing." Thesis, 2012. http://hdl.handle.net/10012/6810.
Full textAbstract:
There is significant interest in the synthesis of discrete-state random fields, particularly those possessing structure over a wide range of scales. However, given a model on some finest, pixellated scale, it is computationally very difficult to synthesize both large and small-scale structures, motivating research into hierarchical methods.
This thesis proposes a frozen-state approach to hierarchical modelling, in which simulated annealing is performed on each scale, constrained by the state estimates at the parent scale. The approach leads significant advantages in both modelling flexibility and computational complexity. In particular, a complex structure can be realized with very simple, local, scale-dependent models, and by constraining the domain to be annealed at finer scales to only the uncertain portions of coarser scales, the approach leads to huge improvements in computational complexity. Results are shown for synthesis problems in porous media.
49
Chang, Yu-Lan, and 張幼蘭. "Dynamic Parallel Simulated Annealing." Thesis, 2002. http://ndltd.ncl.edu.tw/handle/82911533329644669579.
Full textAbstract:
碩士國立清華大學
工業工程與工程管理學系
90
Tabu search, simulated annealing and genetic algorithms are commonly used heuristic search methods. People attempt to improve these methods to reduce computation time. Therefore, multiple processors computation platform using parallel searching algorithms have been used and studied in recent decades. One of the parallel simulated annealing algorithms is the clustering algorithm. The main idea of this method is to make each processor generate its own adjacent solution from the same current solution and compute the acceptance probability for each adjacent solution. Then, it decides which adjacent solution should replace the current solution according to pre-specified rules. The purpose of using clustering parallel simulated annealing is to find an acceptable adjacent solution quickly. However, we may find too many acceptable adjacent solutions, especially when temperature is high. It is wasteful to compute discarded acceptable adjacent solutions except the solution that is chosen to replace the current solution. Furthermore, simulated annealing somewhat lacks of diversified searching. We attempt to tackle this problem by using multiple processors to perform several simultaneously independent searching sequences at the same time, and later make them to turn to clustering mode at the time when computation process meet a certain criteria. Because the method we discuss allocates computing resource dynamically, we call it Dynamic Parallel Simulated Annealing Algorithms (DPSA).
50
Lin, Yi-Kuang, and 林益廣. "Orthogonal Simulated Annealing for Floorplanning." Thesis, 2002. http://ndltd.ncl.edu.tw/handle/ngwedr.
Full textAbstract:
碩士逢甲大學
資訊工程所
90
Abstract Floorplanning is an essential step in physical design of VLSI. The floorplanning is how to place a set of circuit modules on a chip such that the resulting area is minimized. The best solutions are obtained using simulated annealing based on sequence pair representing the planning of modules. The used simulated annealing conducts a random perturbation operation on the current to generate a candidate solution for each iteration. This paper proposes an orthogonal simulated annealing algorithm which systematically generate a set of candidates containing a number of perturbation operations and consequently reason a good solution bases on orthogonal experimental design. Between experimental factors have lower interaction in an orthogonal experimental design, that have higher perform to consequently reason. So we analyze perturbation operations and design the appropriate perturbation operation for using an orthogonal simulated annealing algorithm. Results of experiments in the MCNC and GSRC benchmark show that our method can effective improve efficacy of current methods, especially in the lager floorplaning.