• Refine Query
  • Source
  • Publication year
  • to
  • Language
  • 158
  • 81
  • 15
  • 12
  • 11
  • 4
  • 3
  • 2
  • 2
  • 2
  • 2
  • 1
  • 1
  • 1
  • 1
  • Tagged with
  • 362
  • 362
  • 53
  • 51
  • 50
  • 46
  • 45
  • 33
  • 32
  • 29
  • 28
  • 26
  • 24
  • 22
  • 22
  • About
  • The Global ETD Search service is a free service for researchers to find electronic theses and dissertations. This service is provided by the Networked Digital Library of Theses and Dissertations.
    Our metadata is collected from universities around the world. If you manage a university/consortium/country archive and want to be added, details can be found on the NDLTD website.
111

Implementation of multi-CLB designs using quantum-dot cellular automata /

Tung, Chia-Ching. January 2010 (has links)
Thesis (M.S.)--Rochester Institute of Technology, 2010. / Typescript. Includes bibliographical references (leaves 52-58).
112

Random precision some applications of fractals and cellular automata in music composition /

Karaca, Igor January 2005 (has links)
Thesis (D. M. A.)--Ohio State University, 2005. / Title from first page of PDF file. Document formatted into pages; contains vii, 133 p.; also includes graphics (some col.). Includes bibliographical references (p. 47-48). Available online via OhioLINK's ETD Center.
113

Estimates of changes time space adjacent to roads in the amazon: case study BR 422 / Estimativas de mudanÃas espaÃo temporais adjacentes à rodovias na AmazÃnia: estudo de caso BR 422

Andrà Luis Fonseca Fontana 21 November 2011 (has links)
Conselho Nacional de Desenvolvimento CientÃfico e TecnolÃgico / This paper presents a method for generating estimates of temporal changes in the surrounding area of a highway located in the Amazon, using the technique Cellular Automata and explanatory variables, only attributes of the land. The proposed model uses vector images (obtained from the National Institute for Space Research in Brazil), which are converted to grid type files â raster image, representing a series of spatial changes in the region of study. With this proposition, it is expected to assist decision makers in order to meet the requests of CONAMA Resolution 01, relating to environmental impacts, more specifically, as regards the construction of models which consider scenarios with and without the project, and that the process of construction / rehabilitation of roads can be made in view of the legal norms in order to minimize potential environmental and social impacts. The model generated from the CAs showed promise in generating future estimates of deforestation and a good quantitative and qualitative indicators to support the decision making process to consider future deforestation being caused by construction and / or paving of road in the Amazon. / Este trabalho apresenta um mÃtodo para a estimativa de mudanÃas espaÃo temporais no entorno de uma rodovia localizada na AmazÃnia, utilizando para tanto a tÃcnica AutÃmatos Celulares adaptada em ambiente SIG, onde as variÃveis explicativas do modelo serÃo somente os atributos do terreno. O modelo proposto usa imagens vetoriais (obtidas junto ao Instituto Nacional de Pesquisas Espaciais) que posteriormente sÃo convertidas para arquivos tipo grid â em formato raster, com a sÃrie histÃrica das mudanÃas espaciais na regiÃo objeto de estudo. Espera-se auxiliar os tomadores de decisÃo no atendimento das solicitaÃÃes da resoluÃÃo CONAMA 01/86 relativas à concepÃÃo de modelos que considerem cenÃrios com e sem o empreendimento, e que os processos de construÃÃo/recuperaÃÃo de rodovias possam ser realizados atendendo Ãs normas legais, visando minimizar os potenciais impactos sÃcio ambientais. O modelo gerado a partir dos ACs mostrou-se promissor na geraÃÃo de estimativas futuras de desmatamento e um bom indicador quantitativo e qualitativo para suporte no processo de tomada de decisÃo que pondere o desmatamento futuro a ser causado pela construÃÃo e/ou pavimentaÃÃo de uma rodovia na AmazÃnia.
114

The local binary pattern approach to texture analysis — extensions and applications

Mäenpää, T. (Topi) 08 August 2003 (has links)
Abstract This thesis presents extensions to the local binary pattern (LBP) texture analysis operator. The operator is defined as a gray-scale invariant texture measure, derived from a general definition of texture in a local neighborhood. It is made invariant against the rotation of the image domain, and supplemented with a rotation invariant measure of local contrast. The LBP is proposed as a unifying texture model that describes the formation of a texture with micro-textons and their statistical placement rules. The basic LBP is extended to facilitate the analysis of textures with multiple scales by combining neighborhoods with different sizes. The possible instability in sparse sampling is addressed with Gaussian low-pass filtering, which seems to be somewhat helpful. Cellular automata are used as texture features, presumably for the first time ever. With a straightforward inversion algorithm, arbitrarily large binary neighborhoods are encoded with an eight-bit cellular automaton rule, resulting in a very compact multi-scale texture descriptor. The performance of the new operator is shown in an experiment involving textures with multiple spatial scales. An opponent-color version of the LBP is introduced and applied to color textures. Good results are obtained in static illumination conditions. An empirical study with different color and texture measures however shows that color and texture should be treated separately. A number of different applications of the LBP operator are presented, emphasizing real-time issues. A very fast software implementation of the operator is introduced, and different ways of speeding up classification are evaluated. The operator is successfully applied to industrial visual inspection applications and to image retrieval.
115

Akcelerace mikroskopické simulace dopravy za použití OpenCL / Acceleration of Microscopic Urban Traffic Simulation Using OpenCL

Urminský, Andrej January 2011 (has links)
As the number of vehicles on our roads increases, the problems related to this phenomenon emerge more dramatically. These problems include car accidents, congestions and CO2 emissions production, increasing CO2 concentrations in the atmosphere. In order to minimize these impacts and to use the road infrastructure eff ectively, the use of traffic simulators can come in handy. Thanks to these tools, it is possible to evaluate the evolution of a traffic flow with various initial states of the simulation and thus know what to do and how to react in different states of the real-world traffic situations. This thesis deals with acceleration of microscopic urban traffic simulation using OpenCL. Supposing it is necessary to simulate a large network traffic, the need to accelerate the simulation is necessary. For this purpose, it is possible, for example, to use the graphics processing units (GPUs) and the technique of GPGPU for general purpose computations, which is used in this work. The results show that the performance gains of GPUs are significant compared to a parallel implementation on CPU.
116

Information Processing in Two-Dimensional Cellular Automata

Cenek, Martin 01 January 2011 (has links)
Cellular automata (CA) have been widely used as idealized models of spatially-extended dynamical systems and as models of massively parallel distributed computation devices. Despite their wide range of applications and the fact that CA are capable of universal computation (under particular constraints), the full potential of these models is unrealized to-date. This is for two reasons: (1) the absence of a programming paradigm to control these models to solve a given problem and (2) the lack of understanding of how these models compute a given task. This work addresses the notion of computation in two-dimensional cellular automata. Solutions using a decentralized parallel model of computation require information processing on a global level. CA have been used to solve the so-called density (or majority) classification task that requires a system-wide coordination of cells. To better understand and challenge the ability of CA to solve problems, I define, solve, and analyze novel tasks that require solutions with global information processing mechanisms. The ability of CA to perform parallel, collective computation is attributed to the complex pattern-forming system behavior. I further develop the computational mechanics framework to study the mechanism of collective computation in two-dimensional cellular automata. I define several approaches to automatically identify the spatiotemporal structures with information content. Finally, I demonstrate why an accurate model of information processing in two-dimensional cellular automata cannot be constructed from the space-time behavior of these structures.
117

Optimal Design of Variable-Stiffness Fiber-Reinforced Composites Using Cellular Automata

Setoodeh, Shahriar 21 October 2005 (has links)
The growing number of applications of composite materials in aerospace and naval structures along with advancements in manufacturing technologies demand continuous innovations in the design of composite structures. In the traditional design of composite laminates, fiber orientation angles are constant for each layer and are usually limited to 0, 90, and ±45 degrees. To fully benefit from the directional properties of composite laminates, such limitations have to be removed. The concept of variable-stiffness laminates allows the stiffness properties to vary spatially over the laminate. Through tailoring of fiber orientations and laminate thickness spatially in an optimal fashion, mechanical properties of a part can be improved. In this thesis, the optimal design of variable-stiffness fiber-reinforced composite laminates is studied using an emerging numerical engineering optimization scheme based on the cellular automata paradigm. A cellular automaton (CA) based design scheme uses local update rules for both field variables (displacements) and design variables (lay-up configuration and laminate density measure) in an iterative fashion to convergence to an optimal design. In the present work, the displacements are updated based on the principle of local equilibrium and the design variables are updated according to the optimality criteria for minimum compliance design. A closed form displacement update rule for constant thickness isotropic continua is derived, while for the general anisotropic continua with variable thickness a numeric update rule is used. Combined lay-up and topology design of variable-stiffness flat laminates is performed under the action of in-plane loads and bending loads. An optimality criteria based formulation is used to obtain local design rules for minimum compliance design subject to a volume constraint. It is shown that the design rule splits into a two step application. In the first step an optimal lay-up configuration is computed and in the second step the density measure is obtained. The spatial lay-up design problem is formulated using both fiber angles and lamination parameters as design variables. A weighted average formulation is used to handle multiple load case designs. Numerical studies investigate the performance of the proposed design methodology. The optimal lay-up configuration is independent of the lattice density with more details emerging as the density is increased. Moreover, combined topology and lay-up designs are free of checkerboard patterns. The lay-up design problem is also solved using lamination parameters instead of the fiber orientation angles. The use of lamination parameters has two key features: first, the convexity of the minimization problem guarantees a global minimum; second, for both in-plane and bending problems it limits the number of design variables to four regardless of the actual number of layers, thereby simplifying the optimization task. Moreover, it improves the convergence rate of the iterative design scheme as compared to using fiber angles as design variables. Design parametrization using lamination parameters provides a theoretically better design, however, manufacturability of the designs is not certain. The cases of general, balanced symmetric, and balanced symmetric with equal thickness layers are studied separately. The feasible domain for laminates with equal thickness layers is presented for an increasing number of layers. A restricted problem is proposed that maintains the convexity of the design space for laminates with equal thickness layers. A recursive formulation for computing fiber angles for this case is also presented. On the computational side of the effort, a parallel version of the present CA formulation is implemented on message passing multiprocessor clusters. A standard parallel implementation does not converge for an increased number of processors. Detailed analysis revealed that the convergence problem is due to a Jacobi type iteration scheme, and a pure Gauss-Seidel type iteration through a pipeline implementation completely resolved the convergence problem. Timing results giving the speedup for the pipeline implementation were obtained for up to 260 processors. This work was supported by Grant NAG-1-01105 from NASA Langley Research Center. Special thanks to our project monitor Dr. Damodar R. Ambur for his technical guidance. / Ph. D.
118

Chemical Applications in Techniques of Emerging Significance: Nanoparticle Transformation in Mitochondria and Relative Tautomer Populations in Cellular Automata

Bowers, Gregory Arland January 2017 (has links)
No description available.
119

The recognition of straight line patterns by bus automatons using parallel processing /

Mellby, John Rolf January 1980 (has links)
No description available.
120

An I/O algorithm and a test algorithm for a reconfigurable cellular array

Connell, Kathleen L. January 1985 (has links)
Recent advances in VLSI technology have stimulated research efforts in the area of highly reliable fault tolerant, general purpose computing systems, notably, parallel systems. An automatically reconfigurable, fault-tolerant, parallel architecture is suited to VLSI technology. The architecture, a uniformly interconnected array of identical cells, is capable of functional reconfiguration as well as fault reconfiguration. Microprocessor cells are suggested as the "fabric" for implementation of the array. This thesis also introduces an I/O algorithm as an extension to the reconfiguration process, and outlines the steps by which the array cells construct paths from the active-array to the cellular array I/O ports. Path reconfiguration is presented as the method by which fault-free paths replace faulty paths. A testing algorithm is described for use in the self-testing operation of the array. The types of tests that are conducted on cells are outlined, and the basis by which a cell determines the faulty or fault-free status of a cell is described. / M.S.

Page generated in 0.0701 seconds