Log in

Relevant bibliographies by topics / Parallel Automata / Dissertations / Theses

To see the other types of publications on this topic, follow the link: Parallel Automata.

Dissertations / Theses on the topic 'Parallel Automata'

Author: Grafiati

Published: 4 June 2021

Last updated: 1 February 2022

Create a spot-on reference in APA, MLA, Chicago, Harvard, and other styles

Select a source type:

Consult the top 50 dissertations / theses for your research on the topic 'Parallel Automata.'

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

Vollweiler, Marcel [Verfasser]. "Systems of Parallel Communicating Restarting Automata / Marcel Vollweiler." Kassel : Universitätsbibliothek Kassel, 2013. http://d-nb.info/1043824987/34.

Full text

APA, Harvard, Vancouver, ISO, and other styles

2

Slotta, Douglas J. "Structural Design Using Cellular Automata." Thesis, Virginia Tech, 2001. http://hdl.handle.net/10919/33368.

Full text

Abstract:

Traditional parallel methods for structural design do not scale well. This thesis discusses the application of massively scalable cellular automata (CA) techniques to structural design. There are two sets of CA rules, one used to propagate stresses and strains, and one to perform design analysis. These rules can be applied serially, periodically, or concurrently, and Jacobi or Gauss-Seidel style updating can be done. These options are compared with respect to convergence, speed, and stability.<br>Master of Science

APA, Harvard, Vancouver, ISO, and other styles

3

Xu, Hao, and 許浩. "On the computational ability of cellular automata." Thesis, The University of Hong Kong (Pokfulam, Hong Kong), 2002. http://hub.hku.hk/bib/B31226942.

Full text

APA, Harvard, Vancouver, ISO, and other styles

4

Xu, Hao. "On the computational ability of cellular automata /." Hong Kong : University of Hong Kong, 2002. http://sunzi.lib.hku.hk/hkuto/record.jsp?B25155088.

Full text

APA, Harvard, Vancouver, ISO, and other styles

5

Torbey, Sami. "Towards a framework for intuitive programming of cellular automata." Thesis, Kingston, Ont. : [s.n.], 2007. http://hdl.handle.net/1974/929.

Full text

APA, Harvard, Vancouver, ISO, and other styles

6

Wang, Zhengping. "A parallel implementation of a cellular automata based earthquake model." Thesis, National Library of Canada = Bibliothèque nationale du Canada, 1997. http://www.collectionscanada.ca/obj/s4/f2/dsk2/ftp04/mq22145.pdf.

Full text

APA, Harvard, Vancouver, ISO, and other styles

7

Šoustar, Jakub. "Syntaktická analýza založená na systémech hlubokých zásobníkových automatů." Master's thesis, Vysoké učení technické v Brně. Fakulta informačních technologií, 2017. http://www.nusl.cz/ntk/nusl-363793.

Full text

Abstract:

This thesis investigates deep pushdown automata and introduces their modification called controlled deep pushdown automata. Distributed deep pushdown automata systems and parallel communicating deep pushdown automata systems are described. Their accepting power and properties are investigated and several variants are introduced. This thesis proves that the accepting power of one such variant of parallel communicating deep pushdown automata systems is equal to the accepting power of Turing machines. A method for syntactical analysis based on the previously introduced automata systems is describ

APA, Harvard, Vancouver, ISO, and other styles

8

Castro, Antonio Paulo. "Dynamic water quality modeling using cellular automata." Diss., This resource online, 1996. http://scholar.lib.vt.edu/theses/available/etd-06062008-151210/.

Full text

APA, Harvard, Vancouver, ISO, and other styles

9

Krčmář, Radim. "Regulované systémy automatů." Master's thesis, Vysoké učení technické v Brně. Fakulta informačních technologií, 2016. http://www.nusl.cz/ntk/nusl-255359.

Full text

Abstract:

This thesis defines and studies two new types of automata, cooperating distributed pushdown automata systems (CDPDAS) and parallel communicating pushdown automata systems (PCPDAS). CDPDAS and PCPDAS adapt the main concept of cooperating distributed grammar systems (CDGS) and parallel communicating automata systems (PCPDAS), respectively. CDPDAS are proven to have the same power as PDA and this thesis further explores the reason why CDPDAS do not increase power while CDGS do and introduces an automata system inspired by CDPDAS that does increase the power. PCGS have similar power as CDGS, bu

APA, Harvard, Vancouver, ISO, and other styles

10

Kučera, Jiří. "A Combination of Automata and Grammars." Master's thesis, Vysoké učení technické v Brně. Fakulta informačních technologií, 2013. http://www.nusl.cz/ntk/nusl-236222.

Full text

Abstract:

V této práci byly zavedeny a studovány nové systémy formálních modelů, zvané stavově synchronizované automatové systémy stupně n . Výpočet je v těchto prezentovaných systémech řízen pomocí slov patřících do konečného řídícího jazyka, kde každé slovo z tohoto jazyka je složeno ze stavů komponent systému. Dále byla v této práci studována výpočetní síla zavedených systémů. Praktické použití zavedených systémů bylo demonstrováno na příkladu z oblasti překladu přirozených jazyků a dále na příkladu z oblasti paralelního překladu.

APA, Harvard, Vancouver, ISO, and other styles

11

Louis, Pierre-Yves. "Coupling, space and time Mixing for parallel stochastic dynamics." Universität Potsdam, 2004. http://opus.kobv.de/ubp/volltexte/2011/5156/.

Full text

Abstract:

We first introduce some coupling of a finite number of Probabilistic Cellular Automata dynamics (PCA), preserving the stochastic ordering. Using this tool, for a general attractive probabilistic cellular automata on SZd, where S is finite, we prove that a condition (A) is equivalent to the (time-) convergence towards equilibrium of this Markovian parallel dynamics, in the uniform norm, exponentially fast. This condition (A) means the exponential decay of the influence from the boundary for the invariant measures of the system restricted to finite ‘box’-volume. For a class of reversible PCA dyn

APA, Harvard, Vancouver, ISO, and other styles

12

Bujtor, Ferenc Péter [Verfasser], and Walter [Akademischer Betreuer] Vogler. "Modal Interface Automata: A Theory for Heterogeneous Specification of Parallel Systems / Ferenc Péter Bujtor ; Betreuer: Walter Vogler." Augsburg : Universität Augsburg, 2018. http://d-nb.info/1172634912/34.

Full text

APA, Harvard, Vancouver, ISO, and other styles

13

Yu, Di. "An Application Developed for Simulation of Electrical Excitation and Conduction in a 3D Human Heart." Scholar Commons, 2013. http://scholarcommons.usf.edu/etd/4620.

Full text

Abstract:

This thesis first reviews the history of General Purpose computing Graphic Processing Unit (GPGPU) and then introduces the fundamental problems that are suitable for GPGPU algorithm. The architecture of GPGPU is compared against modern CPU architecture, and the fundamental difference is outlined. The programming challenges faced by GPGPU and the techniques utilized to overcome these issues are evaluated and discussed. The second part of the thesis presents an application developed with GPGPU technology to simulate the electrical excitation and conduction in a 3D human heart model based on ce

APA, Harvard, Vancouver, ISO, and other styles

14

Korkmaz, Ozan. "Inverse Dynamics Control Of Flexible Joint Parallel Manipulators." Master's thesis, METU, 2006. http://etd.lib.metu.edu.tr/upload/3/12608084/index.pdf.

Full text

Abstract:

The purpose of this thesis is to develop a position control method for parallel manipulators so that the end effector can follow a desired trajectory specified in the task space where joint flexibility that occurs at the actuated joints is also taken into consideration. At the beginning of the study, a flexible joint is modeled, and the equations of motion of the parallel manipulators are derived for both actuator variables and joint variables by using the Lagrange formulation under three assumptions regarding dynamic coupling between the links and the actuators. These equations of motion ar

APA, Harvard, Vancouver, ISO, and other styles

15

Ozdemir, Mustafa. "Inverse Dynamics Control Of Parallel Manipulators Around Singular Configurations." Master's thesis, METU, 2008. http://etd.lib.metu.edu.tr/upload/3/12609212/index.pdf.

Full text

Abstract:

In this thesis, a technique for the motion of parallel manipulators through drive singularities is investigated. To remedy the problem of unbounded inverse dynamics solution in the neighborhood of drive singularities, an inverse dynamics controller which uses a conventional inverse dynamics control law outside the neighborhood of singularities and switches to the mode based on the formerly derived modified equations inside the neighborhood of singularities is proposed. As a result, good tracking performance is obtained while the actuator forces remain within the saturation limits of the actuat

APA, Harvard, Vancouver, ISO, and other styles

16

Martinek, Dominik. "Simulace fyzikálních jevů s využitím celulárních automatů." Master's thesis, Vysoké učení technické v Brně. Fakulta informačních technologií, 2010. http://www.nusl.cz/ntk/nusl-237104.

Full text

Abstract:

This master's thesis deals with modelling and simulation of physical phenomena by cellular automata. The basic methods which model physical phenomena is enumerated and descibed in this thesis. One of the important part of this thesis is a set of demonstration models. Each model is focused on one selected area of physical phenomena. All models are described by transtition rules and the procedure of derivation of these rules is also presented here. There rules were used in implemented models. Another part of this thesis contains of a simulation application for these models. The real application

APA, Harvard, Vancouver, ISO, and other styles

17

Bartůněk, Petr. "Knihovna operací nad konečnými automaty." Master's thesis, Vysoké učení technické v Brně. Fakulta informačních technologií, 2010. http://www.nusl.cz/ntk/nusl-237128.

Full text

Abstract:

This work deals with two basic operations over finite automata. Determination of nondeterministic finite automata and minimization of deterministic finite automata. For these two operations I proposed sequential algorithms that are parallelizable. I deal mainly with finding the speedup of SSE instructions, or use the OpenMP library. The trend today is mainly in increasing the number of processors, so I propose parallel algorithms for multiple processors. When searching for the optimal solution, I will be to examine other ways to achieve speedup, for example efficient saving of the data structu

APA, Harvard, Vancouver, ISO, and other styles

18

Truong, Tuyen Phong. "Simulation and compiler support for communication and mobility for environment sensing." Thesis, Brest, 2018. http://www.theses.fr/2018BRES0048/document.

Full text

Abstract:

Les transmissions radio à longue portée et basse énergie ouvrent de nouveaux champs d'application pour les capteurs, en particulier pour la surveillance de l'environnement. Le protocole radio LoRa permet, par exemple, de connecter des capteurs à une distance pouvant aller jusqu'à dix kilomètres en ligne de visée. Cependant, la grande surface couverte amène plusieurs difficultés, telles que le placement spatial en regard de la topologie géographique, ou la variabilité de la latence des communications. Le positionnement dans I'environnement comporte également des contraintes liées à I'intérêt de

APA, Harvard, Vancouver, ISO, and other styles

19

Kucuk, Ali. "The Multi - Objective Path Placement Optimization Of Parallel Kinematic Machines." Master's thesis, METU, 2013. http://etd.lib.metu.edu.tr/upload/12615533/index.pdf.

Full text

Abstract:

The aim of this study is to obtain optimal position and orientation of a trajectory frame with respect to the fixed frame of the manipulator. The work path which is given in the trajectory frame is also constrained in the workspace of the 3 &ndash<br>PRS parallel kinematic machine. In the analysis, forward and inverse kinematics solutions are derived as well as the inverse dynamics model using Lagrange&rsquo<br>s Method. Several algorithms governing the motion of the manipulator are developed. Moreover, optimization goals are defined and evaluated with the genetic algorithm.

APA, Harvard, Vancouver, ISO, and other styles

20

Teitelbaum, Aryeh Roberto, and a_hay@jct ac il. "Arts'Codes: A New Methodology for the Development of Real-Time Embedded Applications for Control Systems." RMIT University. Accounting and Law, 2007. http://adt.lib.rmit.edu.au/adt/public/adt-VIT20071219.094115.

Full text

Abstract:

Embedded real-time applications have to allow interaction between the control computer and the controlled environment. Controlling the environment requires in particular to take into account its time constraints and critical logical conditions. One of the main programmer efforts in real-time application's development is to trace the incoming events, and to perform reactions based on the current system status, according to the application requirements. All this have to be handled, although external events may come in the middle of a critical reaction, which may disturb it. This problem inv

APA, Harvard, Vancouver, ISO, and other styles

21

Kumar, Anand. "Efficient and Private Processing of Analytical Queries in Scientific Datasets." Scholar Commons, 2013. http://scholarcommons.usf.edu/etd/4822.

Full text

Abstract:

Large amount of data is generated by applications used in basic-science research and development applications. The size of data introduces great challenges in storage, analysis and preserving privacy. This dissertation proposes novel techniques to efficiently analyze the data and reduce storage space requirements through a data compression technique while preserving privacy and providing data security. We present an efficient technique to compute an analytical query called spatial distance histogram (SDH) using spatiotemporal properties of the data. Special spatiotemporal properties present in

APA, Harvard, Vancouver, ISO, and other styles

22

Benítez, César Manuel Vargas. "Contributions to the study of the protein folding problem using bioinspired computation and molecular dynamics." Universidade Tecnológica Federal do Paraná, 2015. http://repositorio.utfpr.edu.br/jspui/handle/1/1211.

Full text

Abstract:

O Problema de Dobramento de Proteínas (PDP) é considerado um dos desafios abertos mais importantes da Biologia e Bioinformática. Nesta tese, uma nova abordagem para simular os pathways de dobramento de proteínas é proposta onde, ao invés de utilizar a estrutura tridimensional da proteína, os estados de dobramento são representados por Mapas de Contatos (MC). Autômatos Celulares bidimensionais (2D-CA) são utilizados para simular o processo de dobramento, onde cada configuração representa um estado de dobramento e é obtida em relação ao seu estado predecessor e uma regra de transição. Determinar

APA, Harvard, Vancouver, ISO, and other styles

23

Ziadi, Djelloul. "Algorithmique parallèle et séquentielle des automates." Rouen, 1996. http://www.theses.fr/1996ROUES003.

Full text

Abstract:

Cette thèse constitue un point de départ pour une programmation parallèle des automates. Elle combine une approche séquentielle et une approche parallèle (sur le modèle PRAM) de l'analyse de ces algorithmes. On y trouve un nouvel algorithme séquentiel optimal de conversion d'une expression rationnelle en un automate ainsi que sa parallélisation (également optimale) un test d'appartenance d'un mot à un langage rationnel est développé, fournissant un algorithme parallèle efficace. Un algorithme séquentiel optimal, original de minimisation d'automate déterministe est décrit. De nouvelles techniqu

APA, Harvard, Vancouver, ISO, and other styles

24

Tachon, Thibaut. "Génération automatique de code parallèle isochrone." Thesis, Orléans, 2019. http://www.theses.fr/2019ORLE3098.

Full text

Abstract:

Depuis la stagnation de la fréquence d’horloge des processeurs, l’accroissement de la puissance de calcul a dépendu entièrement de l’accroissement du nombre d’unités de calcul. Plus que la difficulté algorithmique impliquée par l’écriture de tout programme séquentiel, la programmation parallèle demande au programmeur de gérer de nombreuses unités de calcul, incluant leurs tâches et leurs interactions. Pour alléger le fardeau du programmeur, cette thèse propose deux approches différentes de génération automatique de code parallèle. Le modèle parallèle isochrone BSP possède des propriétés intére

APA, Harvard, Vancouver, ISO, and other styles

25

Klüppelholz, Sascha. "Verification of Branching-Time and Alternating-Time Properties for Exogenous Coordination Models." Doctoral thesis, Saechsische Landesbibliothek- Staats- und Universitaetsbibliothek Dresden, 2012. http://nbn-resolving.de/urn:nbn:de:bsz:14-qucosa-86211.

Full text

Abstract:

Information and communication systems enter an increasing number of areas of daily lives. Our reliance and dependence on the functioning of such systems is rapidly growing together with the costs and the impact of system failures. At the same time the complexity of hardware and software systems extends to new limits as modern hardware architectures become more and more parallel, dynamic and heterogenous. These trends demand for a closer integration of formal methods and system engineering to show the correctness of complex systems within the design phase of large projects. The goal of this th

APA, Harvard, Vancouver, ISO, and other styles

26

Aronsson, Peter. "Automatic Parallelization of Equation-Based Simulation Programs." Doctoral thesis, Linköping : Department of Computer and Information Science, Linköping University, 2006. http://www.bibl.liu.se/liupubl/disp/disp2006/tek1022s.pdf.

Full text

APA, Harvard, Vancouver, ISO, and other styles

27

Dai, Jiehua. "Automatic Parallel Memory Address Generation for Parallel DSP Computing." Thesis, Linköping University, Department of Electrical Engineering, 2008. http://urn.kb.se/resolve?urn=urn:nbn:se:liu:diva-11110.

Full text

Abstract:

<p>The concept of Parallel Vector (scratch pad) Memories (PVM) was introduced as one solution for Parallel Computing in DSP, which can provides parallel memory addressing efficiently with minimum latency. The parallel programming more efficient by using the parallel addressing generator for parallel vector memory (PVM) proposed in this thesis. However, without hiding complexities by cache, the cost of programming is high. To minimize the programming cost, automatic parallel memory address generation is needed to hide the complexities of memory access.</p><p>This thesis investigates methods for

APA, Harvard, Vancouver, ISO, and other styles

28

Amrane, Amazigh. "Posets série-parallèles transfinis : automates, logiques et théories équationnelles." Thesis, Normandie, 2020. http://www.theses.fr/2020NORMR102.

Full text

Abstract:

Nous étudions dans cette thèse des structures généralisant la notion classique de mot. Elles sont construites à partir d’un ensemble partiellement ordonné (partially ordered set ou poset) vérifiant les propriétés suivantes : — elles ne contiennent pas 4 éléments distincts x, y, z, t dont l’ordre relatif est exactement x < y, z < y, z < t (posets dits sans N) ; — les chaînes sont des ordres linéaires dénombrables et dispersés ; — les antichaînes sont finies ; et chaque élément est étiqueté par une lettre d’un alphabet fini. De manière équivalente, la classe des posets que nous considér

APA, Harvard, Vancouver, ISO, and other styles

29

Johnson, Robert David. "Parallel analytic tableaux systems." Thesis, Queen Mary, University of London, 1996. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.362777.

Full text

APA, Harvard, Vancouver, ISO, and other styles

30

Katiker, Rushikesh. "Automatic generation of dynamic parallel architectures." Click here for download, 2007. http://proquest.umi.com/pqdweb?did=1475182071&sid=1&Fmt=2&clientId=3260&RQT=309&VName=PQD.

Full text

APA, Harvard, Vancouver, ISO, and other styles

31

Carr, David A. "Towards automatic parallel game engine architectures." abstract and full text PDF (UNR users only), 2009. http://0-gateway.proquest.com.innopac.library.unr.edu/openurl?url_ver=Z39.88-2004&rft_val_fmt=info:ofi/fmt:kev:mtx:dissertation&res_dat=xri:pqdiss&rft_dat=xri:pqdiss:1464428.

Full text

APA, Harvard, Vancouver, ISO, and other styles

32

Henriksson, Lovisa, and Victor Lundell. "Self Parking Robot : Automated Parallel Parking." Thesis, KTH, Maskinkonstruktion (Inst.), 2017. http://urn.kb.se/resolve?urn=urn:nbn:se:kth:diva-226666.

Full text

Abstract:

The purpose of this report is to examine how a self parallelparking robot performs using a pre defined parkingpath, compared to recommendations manual parking. Toexamine this a robot capable of parallel parking have beenconstructed.The project is divided into two parts; construction ofthe vehicle and the software which controls it. The design ofthe vehicle is based on a rear wheel driven car with Ackermannsteering. Localisation of a parking spot, parking andautomatic stopping at an unexpected obstacle is handledwith the help of three distance sensors.The robot was successful in 85% of the test

APA, Harvard, Vancouver, ISO, and other styles

33

Dorman, Andrei. "Concurrency in Interaction Nets and Graph Rewriting." Phd thesis, Université Paris-Nord - Paris XIII, 2013. http://tel.archives-ouvertes.fr/tel-00937224.

Full text

Abstract:

Ce travail est une étude approfondie de la concurrence dans les extensions non-déterministes des réseaux d'interaction de Lafont (langage graphique qui représente, lui, le calcul fonctionnel). Ces extensions sont de trois sortes : les réseaux multirègles, multiports et multifils, et leurs combinaisons donnent ainsi sept types de réseaux. Un premier travail consiste à déterminer une bonne sémantique pour pouvoir comparer ces extensions. On cherche à définir un sémantique opérationnelle structurelle sur les réseaux en se basant sur des technique connues de réécriture des graphes, plus particuliè

APA, Harvard, Vancouver, ISO, and other styles

34

Williams, Kenneth Peter. "Evolutionary algorithms for automatic parallelization." Thesis, University of Reading, 1998. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.265665.

Full text

APA, Harvard, Vancouver, ISO, and other styles

35

Diarra, Rokiatou. "Automatic Parallelization for Heterogeneous Embedded Systems." Thesis, Université Paris-Saclay (ComUE), 2019. http://www.theses.fr/2019SACLS485.

Full text

Abstract:

L'utilisation d'architectures hétérogènes, combinant des processeurs multicoeurs avec des accélérateurs tels que les GPU, FPGA et Intel Xeon Phi, a augmenté ces dernières années. Les GPUs peuvent atteindre des performances significatives pour certaines catégories d'applications. Néanmoins, pour atteindre ces performances avec des API de bas niveau comme CUDA et OpenCL, il est nécessaire de réécrire le code séquentiel, de bien connaître l’architecture des GPUs et d’appliquer des optimisations complexes, parfois non portables. D'autre part, les modèles de programmation basés sur des directives (

APA, Harvard, Vancouver, ISO, and other styles

36

García, Almiñana Jordi. "Automatic data distribution for massively parallel processors." Doctoral thesis, Universitat Politècnica de Catalunya, 1997. http://hdl.handle.net/10803/5981.

Full text

Abstract:

Massively Parallel Processor systems provide the required computational power to solve most large scale High Performance Computing applications. Machines with physically distributed memory allow a cost-effective way to achieve this performance, however, these systems are very diffcult to program and tune. In a distributed-memory organization each processor has direct access to its local memory, and indirect access to the remote memories of other processors. But the cost of accessing a local memory location can be more than one order of magnitude faster than accessing a remote memory location.

APA, Harvard, Vancouver, ISO, and other styles

37

Tregidgo, R. W. S. "Parallel processing and automatic postal address recognition." Thesis, University of Essex, 1992. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.304946.

Full text

APA, Harvard, Vancouver, ISO, and other styles

38

Prager, Richard William. "Parallel processing networks for automatic speech recognition." Thesis, University of Cambridge, 1987. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.238443.

Full text

APA, Harvard, Vancouver, ISO, and other styles

39

Noual, Mathilde. "Mises à jour de réseaux d'automates." Phd thesis, Ecole normale supérieure de lyon - ENS LYON, 2012. http://tel.archives-ouvertes.fr/tel-00726560.

Full text

Abstract:

Cette thèse s'intéresse aux évènements et aux ordonnancements d'évènements se produisant au sein de réseaux d'éléments conceptuels prédéterminés. Dans ces réseaux, les éléments, appelés plutôt "automates", s'incitent les uns les autres à changer d'état en accord avec des règles prédéfinies qui, précisément, définissent le (fonctionnement du) réseau. Lorsqu'un automate se conforme effectivement aux influences qu'il reçoit de la part des autres, on dit que son état est mis à jour. Les évènements élémentaires considérés sont les changements d'états des automates. Définir un mode de mise à jour po

APA, Harvard, Vancouver, ISO, and other styles

40

Grente, Theo. "Caractérisation et programmation en théorie des langages et en logique des classes de complexité efficace des automates cellulaires." Thesis, Normandie, 2020. http://www.theses.fr/2020NORMC214.

Full text

Abstract:

Les automates cellulaires constituent le modèle de calcul parallèle et local par excellence.Comme pour tout modèle du parallélisme, leur programmation est réputée difficile. La puissance de calcul des automates cellulaires, modèle le plus simple du parallélisme, est attestée par le fait que nombre de problèmes significatifs sont calculés en temps minimal, appelé temps-réel, surautomate cellulaire.Principal résultat de cette thèse, on démontre des liens exacts (des équivalences) entre d’un côté la complexité descriptive, essentiellement la définissabilité en logique du second ordre existentiel

APA, Harvard, Vancouver, ISO, and other styles

41

Chen, Xian. "Automatic parallelisation for a class of URE problems." Thesis, University of Newcastle Upon Tyne, 1995. http://hdl.handle.net/10443/1974.

Full text

Abstract:

This thesis deals with the methodology and software of automatic parallelisation for numerical supercomputing and supercomputers. Basically, we focus on the problem of Uniform Recurrence Equations (URE) which exists widely in numerical computations. vVepropose a complete methodology of automatic generation of parallel programs for regular array designs. The methodology starts with an introduction of a set of canonical dependencies which generates a general modelling of the various URE problems. Based on these canonical dependencies, partitioning and mapping methods are developed which gives th

APA, Harvard, Vancouver, ISO, and other styles

42

Fleurisson, Romain. "Modélisation multi-échelle parallélisée pour la prédiction de structures de grains dendritiques couplant les éléments finis, un automate cellulaire et un réseau de paraboles." Thesis, Paris Sciences et Lettres (ComUE), 2019. http://www.theses.fr/2019PSLEM028/document.

Full text

Abstract:

La modélisation multi-échelle des procédés de solidification présente un grand intérêt pour les industries. Toutefois, il est difficile de coupler les phénomènes prenant place à de multiples échelles pour obtenir des simulations quantitatives à grande échelle. Ceci est réalisé en combinant trois méthodes : les éléments finis (FE), un automate cellulaire (CA) et la méthode Parabolic Thick Needle(PTN). La méthode FE permet une résolution des équations de conservation écrites pour des quantités moyennées, ce qui est adapté aux calculs de grands domaines. Elle permet la description macroscopique d

APA, Harvard, Vancouver, ISO, and other styles

43

Li, Li. "Model-based automatic performance diagnosis of parallel computations /." view abstract or download file of text, 2007. http://proquest.umi.com/pqdweb?did=1335366371&sid=1&Fmt=2&clientId=11238&RQT=309&VName=PQD.

Full text

Abstract:

Thesis (Ph. D.)--University of Oregon, 2007.<br>Typescript. Includes vita and abstract. Includes bibliographical references (leaves 119-123). Also available for download via the World Wide Web; free to University of Oregon users.

APA, Harvard, Vancouver, ISO, and other styles

44

Ikei, Mitsuru. "Automatic program restructuring for distributed memory multicomputers." Full text open access at:, 1992. http://content.ohsu.edu/u?/etd,191.

Full text

APA, Harvard, Vancouver, ISO, and other styles

45

Barbosa, Jorge Luis Victoria. "Granlog : um modelo para analise automatica de granulosidade na programacao em logica." reponame:Biblioteca Digital de Teses e Dissertações da UFRGS, 1996. http://hdl.handle.net/10183/21343.

Full text

Abstract:

A exploração do paralelismo na programação em lógica e considerada uma alternativa para simplificação da programação de maquinas paralelas e para aumento do desempenho de programas em lógica. Desta forma, a integração da programação em lógica e sistemas paralelos tornou-se nos últimos anos um centro de atenções da comunidade ciêntifica. Dentre os problemas que devem ser solucionados para exploração adequada do paralelismo, encontra-se a analise de granulosidade. A análise de granulosidade determina o tamanho dos grãos, ou seja, a complexidade dos módulos que devendo ser executados seqüencialme

APA, Harvard, Vancouver, ISO, and other styles

46

Törnfeldt, Tobias. "Graph Similarity, Parallel Texts, and Automatic Bilingual Lexicon Acquisition." Thesis, Linköping University, Department of Mathematics, 2008. http://urn.kb.se/resolve?urn=urn:nbn:se:liu:diva-11550.

Full text

Abstract:

<p>In this masters’ thesis report we present a graph theoretical method used for automatic bilingual lexicon acquisition with parallel texts. We analyze the concept of graph similarity and give an interpretation, of the parallel texts, connected to the vector space model. We represent the parallel texts by a directed, tripartite graph and from here use the corresponding adjacency matrix, A, to compute the similarity of the graph. By solving the eigenvalue problem ρS = ASAT + ATSA we obtain the self-similarity matrix S and the Perron root ρ. A rank k approximation of the self-similarity matrix

APA, Harvard, Vancouver, ISO, and other styles

47

Chong, Michael Wai Hing. "Subword units and parallel processing for automatic speech recognition." Thesis, University of Cambridge, 1990. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.335663.

Full text

APA, Harvard, Vancouver, ISO, and other styles

48

Silveira, Jaime Kirch da. "Parallel SAT solvers and their application in automatic parallelization." reponame:Biblioteca Digital de Teses e Dissertações da UFRGS, 2014. http://hdl.handle.net/10183/95373.

Full text

Abstract:

Desde a diminuição da tendência de aumento na frequência de processadores, uma nova tendência surgiu para permitir que softwares tirem proveito de harwares mais rápidos: a paralelização. Contudo, diferente de aumentar a frequência de processadores, utilizar parallelização requer um tipo diferente de programação, a programação paralela, que é geralmente mais difícil que a programação sequencial comum. Neste contexto, a paralelização automática apareceu, permitindo que o software tire proveito do paralelismo sem a necessidade de programação paralela. Nós apresentamos aqui duas propostas: SAT-PaD

APA, Harvard, Vancouver, ISO, and other styles

49

SEYD, DARWISH IYAD. "Etude et realisation d'un automate cellulaire opto-electronique parallele." Paris 11, 1991. http://www.theses.fr/1991PA112331.

Full text

Abstract:

Les automates cellulaires, composes d'un grand nombre de processeurs elementaires, permettent un traitement rapide et efficace de certaines algorithmes. Le present travail etudie la possibilite d'une implantation parallele d'un tel automate sur un circuit integre avec des entrees optiques en utilisant des photodiodes integrees et un illuminateur de tableaux et des sorties opto-electroniques avec des modulateurs a puits quantiques multiples. Differents composants ont ete etudies et realises dans ce but: illuminateur de tableaux realise sur un hologramme en utilisant l'effet d'imagerie de talbot

APA, Harvard, Vancouver, ISO, and other styles

50

Zhao, Jie. "Une approche combinée langage-polyédrique pour la programmation parallèle hétérogène." Thesis, Paris Sciences et Lettres (ComUE), 2018. http://www.theses.fr/2018PSLEE062.

Full text

Abstract:

De nos jours, l'optimisation des compilateurs est de plus en plus mise à l'épreuve par la diversité des langages de programmation et l'hétérogénéité des architectures. Le modèle polyédrique est un puissant cadre mathématique permettant aux programmes d’exploiter la parallélisation automatique et l’optimisation de la localité, jouant un rôle important dans le domaine de l’optimisation des compilateurs. Une limite de longue date du modèle réside dans sa restriction aux programmes affines à contrôle statique, ce qui a entraîné une demande émergente de prise en charge d'extensions non affines. Cel

APA, Harvard, Vancouver, ISO, and other styles

We offer discounts on all premium plans for authors whose works are included in thematic literature selections. Contact us to get a unique promo code!