Conecte-se

Bibliografias temáticas / Machine de turing / Teses / dissertações

Siga este link para ver outros tipos de publicações sobre o tema: Machine de turing.

Teses / dissertações sobre o tema "Machine de turing"

Autor: Grafiati

Publicado: 5 de outubro de 2024

Última modificação: 31 de julho de 2025

Crie uma referência precisa em APA, MLA, Chicago, Harvard, e outros estilos

Selecione um tipo de fonte:

Veja os 50 melhores trabalhos (teses / dissertações) para estudos sobre o assunto "Machine de turing".

Ao lado de cada fonte na lista de referências, há um botão "Adicionar à bibliografia". Clique e geraremos automaticamente a citação bibliográfica do trabalho escolhido no estilo de citação de que você precisa: APA, MLA, Harvard, Chicago, Vancouver, etc.

Você também pode baixar o texto completo da publicação científica em formato .pdf e ler o resumo do trabalho online se estiver presente nos metadados.

Veja as teses / dissertações das mais diversas áreas científicas e compile uma bibliografia correta.

1

Chen, Yin Fu. "SIMTM turing machine simulator." CSUSB ScholarWorks, 1995. https://scholarworks.lib.csusb.edu/etd-project/1229.

Texto completo da fonte

Estilos ABNT, Harvard, Vancouver, APA, etc.

2

Toister, Yanai. "Photography from the Turin Shroud to the Turing Machine." Thesis, The University of Sydney, 2015. http://hdl.handle.net/2123/14911.

Texto completo da fonte

Resumo:

Photography has always been a migratory system of representation. Today, it is integrated into numerous systems, in a profusion of specialties, sub-disciplines and disciplines. Within many of these domains, the exponentially growing powers of information processing enable the manufacturing of images that are seemingly photographic, yet partly (or fully) synthetic. How do we define these images? Are traditional disciplinary accounts relevant? Photography’s cultural value is most often measured in terms of its products, the various kinds of pictures that it generates. Instead, photography can b

Estilos ABNT, Harvard, Vancouver, APA, etc.

3

Capuni, Ilir. "A fault-tolerant Turing machine." Thesis, Boston University, 2013. https://hdl.handle.net/2144/13608.

Texto completo da fonte

Resumo:

Thesis (Ph.D.)--Boston University PLEASE NOTE: Boston University Libraries did not receive an Authorization To Manage form for this thesis or dissertation. It is therefore not openly accessible, though it may be available by request. If you are the author or principal advisor of this work and would like to request open access for it, please contact us at open-help@bu.edu. Thank you.<br>The Turing machine is the most studied universal model of computation. This thesis studies the question if there is a Turing machine that can compute reliably even when violations of its transition function occ

Estilos ABNT, Harvard, Vancouver, APA, etc.

4

Masum, Hassan Carleton University Dissertation Mathematics. "An exploration of turing machine based complexity." Ottawa, 1995.

Encontre o texto completo da fonte

Estilos ABNT, Harvard, Vancouver, APA, etc.

5

Müller, Markus. "Quantum Kolmogorov complexity and the quantum turing machine." [S.l.] : [s.n.], 2007. http://opus.kobv.de/tuberlin/volltexte/2007/1655.

Texto completo da fonte

Estilos ABNT, Harvard, Vancouver, APA, etc.

6

Kalyanasundaram, Subrahmanyam. "Turing machine algorithms and studies in quasi-randomness." Diss., Georgia Institute of Technology, 2011. http://hdl.handle.net/1853/42808.

Texto completo da fonte

Resumo:

Randomness is an invaluable resource in theoretical computer science. However, pure random bits are hard to obtain. Quasi-randomness is a tool that has been widely used in eliminating/reducing the randomness from randomized algorithms. In this thesis, we study some aspects of quasi-randomness in graphs. Specifically, we provide an algorithm and a lower bound for two different kinds of regularity lemmas. Our algorithm for FK-regularity is derived using a spectral characterization of quasi-randomness. We also use a similar spectral connection to also answer an open question about quasi-random to

Estilos ABNT, Harvard, Vancouver, APA, etc.

7

Rendell, P. "Turing machine universality of the game of life." Thesis, University of the West of England, Bristol, 2014. http://eprints.uwe.ac.uk/22323/.

Texto completo da fonte

Resumo:

This project proves universal computation in the Game of Life cellular automaton by using a Turing machine construction. Existing proofs of universality in the Game of Life rely on a counter machine. These machines require complex encoding and decoding of the input and output and the proof of universality for these machines by the Church Turing thesis is that they can perform the equivalent of a Turing machine. A proof based directly on a Turing machine is much more accessible. The computational power available today allows powerful algorithms such as HashLife to calculate the evolution of cel

Estilos ABNT, Harvard, Vancouver, APA, etc.

8

Shah, Huma. "Deception-detection and machine intelligence in practical Turing tests." Thesis, University of Reading, 2010. http://centaur.reading.ac.uk/24768/.

Texto completo da fonte

Resumo:

Deception-detection is the crux of Turing’s experiment to examine machine thinking conveyed through a capacity to respond with sustained and satisfactory answers to unrestricted questions put by a human interrogator. However, in 60 years to the month since the publication of Computing Machinery and Intelligence little agreement exists for a canonical format for Turing’s textual game of imitation, deception and machine intelligence. This research raises from the trapped mine of philosophical claims, counter-claims and rebuttals Turing’s own distinct five minutes question-answer imitation game,

Estilos ABNT, Harvard, Vancouver, APA, etc.

9

Tantau, Till. "On structural similarities of finite automata and turing machine enumerability classes." [S.l.] : [s.n.], 2003. http://edocs.tu-berlin.de/diss/2003/tantau_till.pdf.

Texto completo da fonte

Estilos ABNT, Harvard, Vancouver, APA, etc.

10

Girardot, Johan. "Toward higher-order and many-symbol infinite time Turing machines." Electronic Thesis or Diss., Institut polytechnique de Paris, 2024. http://www.theses.fr/2024IPPAX028.

Texto completo da fonte

Resumo:

Ce travail traite des machines de Turing infinies (ITTM) telles que développées par Hamkins et Lewis au début des années 2000. Plus particulièrement il s'intéresse à leur généralisation. Un aspect notable de ces machines infinies est que, en comparaison du modèle classique de Turing, celles-ci sont presque aussi simple. Une ITTM a la même structure qu'une machine de Turing à trois rubans. Elle fait des calculs en temps ordinaux et à n'importe quelle étape, l'instantané de la machine permet de calculer, comme dans le modèle classique, l'instantané à l'étape suivant. Le seule différence est aux

Estilos ABNT, Harvard, Vancouver, APA, etc.

11

Wells, Andrew J. "The External Tape Hypothesis : a Turing machine based approach to cognitive computation." Thesis, London School of Economics and Political Science (University of London), 1994. http://etheses.lse.ac.uk/118/.

Texto completo da fonte

Resumo:

The symbol processing or "classical cognitivist" approach to mental computation suggests that the cognitive architecture operates rather like a digital computer. The components of the architecture are input, output and central systems. The input and output systems communicate with both the internal and external environments of the cognizer and transmit codes to and from the rule governed, central processing system which operates on structured representational expressions in the internal environment. The connectionist approach, by contrast, suggests that the cognitive architecture should be tho

Estilos ABNT, Harvard, Vancouver, APA, etc.

12

Yedidia, Adam. "A relatively small turing machine whose behavior is independent of set theory." Thesis, Massachusetts Institute of Technology, 2015. http://hdl.handle.net/1721.1/100680.

Texto completo da fonte

Resumo:

Thesis: M. Eng., Massachusetts Institute of Technology, Department of Electrical Engineering and Computer Science, 2015.<br>Cataloged from PDF version of thesis.<br>Includes bibliographical references (pages 79-80).<br>Since the definition of the Busy Beaver function by Radó in 1962, an interesting open question has been what the smallest value of n for which BB(n) is independent of ZFC. Is this n approximately 10, or closer to 1,000,000, or is it unfathomably large? In this thesis, I show that it is at most 340,943 by presenting an explicit description of a 340,943-state Turing machine Z with

Estilos ABNT, Harvard, Vancouver, APA, etc.

13

Ахматов, Владислав Вікторович. "The evolution of artificial intelligence: from the Turing machine to Google DeepMind." Thesis, Київський національний університет технологій та дизайну, 2020. https://er.knutd.edu.ua/handle/123456789/15259.

Texto completo da fonte

Estilos ABNT, Harvard, Vancouver, APA, etc.

14

PINNA, SIMONE. "Extended cognition, dynamics, and algorithms. A turing machine based approach to the study of arithmetical skills." Doctoral thesis, Università degli Studi di Cagliari, 2014. http://hdl.handle.net/11584/266521.

Texto completo da fonte

Resumo:

The fields of philosophy of mind and cognitive science have been characterized, in the last few decades, by a growing interest for explanations of mind's activity in terms of interaction between brains, bodies and the world. Embodiment, embeddedness, situatededness are key words that most often can be found in contemporary cognitive studies. However, some cognitive activities seem recalcitrant to this kind of treatment. Mathematical thinking is one of them. Explanations of human computational competencies, indeed, focus typically on representational issues, while giving less importance t

Estilos ABNT, Harvard, Vancouver, APA, etc.

15

De, La Cruz Anthony, Jaime Cardenas, and Leonardo Vinces. "Development of a Machine to Control the Level of Washing in Panca Chili Seeds." Universidad Peruana de Ciencias Aplicadas (UPC), 2021. http://hdl.handle.net/10757/653774.

Texto completo da fonte

Resumo:

El texto completo de este trabajo no está disponible en el Repositorio Académico UPC por restricciones de la casa editorial donde ha sido publicado.<br>The washing of Panca chili seeds requires innovative solutions that allow controlling this process. It is necessary to handle variables (conductivity, pH, colorimetry) in the face of the challenge of working with small seeds. At present, there are no machines that are dedicated to the washing of this type of seeds, since in many companies this work is done manually, which is not the one indicated because this technique cannot guarantee homogene

Estilos ABNT, Harvard, Vancouver, APA, etc.

16

Lima, Welton Dias de. "Computadores e mentes: uma analogia filosófica." Universidade do Vale do Rio dos Sinos, 2017. http://www.repositorio.jesuita.org.br/handle/UNISINOS/6692.

Texto completo da fonte

Resumo:

Submitted by JOSIANE SANTOS DE OLIVEIRA (josianeso) on 2017-10-13T14:50:03Z No. of bitstreams: 1 Welton Dias de Lima_.pdf: 1124831 bytes, checksum: 41ffb9304231eacf64174b11566c5ad8 (MD5)<br>Made available in DSpace on 2017-10-13T14:50:03Z (GMT). No. of bitstreams: 1 Welton Dias de Lima_.pdf: 1124831 bytes, checksum: 41ffb9304231eacf64174b11566c5ad8 (MD5) Previous issue date: 2017-07-12<br>Nenhuma<br>O presente estudo teve o propósito de desenvolver uma revisão bibliográfica em um dos artigos mais importantes e polêmicos no campo da Ciência da Computação, “Computadores e Inteligência” (no

Estilos ABNT, Harvard, Vancouver, APA, etc.

17

Siska, Josef. "Simulátor Turingových strojů popsaných pomocí kompozitních diagramů." Master's thesis, Vysoké učení technické v Brně. Fakulta informačních technologií, 2014. http://www.nusl.cz/ntk/nusl-236100.

Texto completo da fonte

Resumo:

In this thesis, the theory related to Turing machines and means of their description (with focus on composite diagrams) is presented. The aim of this work is to create an application that allows editing Turing machines described by means of composite diagrams and simulating their computation on specified input configuration (including non-deterministic and multi-tape machines). Furthermore, within the application it will be possible to run the termination analysis of Turing machine in order to determine whether this machine or any of its parts always halt. The resulting application is implemen

Estilos ABNT, Harvard, Vancouver, APA, etc.

18

Al-Shihi, Hamda D. A. "A transdisciplinary study of embodiment in HCI, AI and New Media." Thesis, University of Bradford, 2012. http://hdl.handle.net/10454/6330.

Texto completo da fonte

Resumo:

The aim of this thesis is to report on a transdisciplinary approach, regarding the complexity of thinking about human embodiment in relation to machine embodiment. A practical dimension of this thesis is to elicit some principles for the design and evaluation of virtual embodiment. The transdisciplinary approach suggests, firstly, that a single discipline or reality is, on its own, not sufficient to explain the complexity and dynamism of the embodied interaction between the human and machine. Secondly, the thesis argues for thinking of transdisciplinary research as a process of individuation,

Estilos ABNT, Harvard, Vancouver, APA, etc.

19

Al-Shihi, Hamda Darwish Ali. "A transdisciplinary study of embodiment in HCI, AI and New Media." Thesis, University of Bradford, 2012. http://hdl.handle.net/10454/6330.

Texto completo da fonte

Resumo:

The aim of this thesis is to report on a transdisciplinary approach, regarding the complexity of thinking about human embodiment in relation to machine embodiment. A practical dimension of this thesis is to elicit some principles for the design and evaluation of virtual embodiment. The transdisciplinary approach suggests, firstly, that a single discipline or reality is, on its own, not sufficient to explain the complexity and dynamism of the embodied interaction between the human and machine. Secondly, the thesis argues for thinking of transdisciplinary research as a process of individuation,

Estilos ABNT, Harvard, Vancouver, APA, etc.

20

Kajan, Dušan. "Výpočetní historie Turingových strojů a jejich generování gramatikami s rozptýleným kontextem." Master's thesis, Vysoké učení technické v Brně. Fakulta informačních technologií, 2015. http://www.nusl.cz/ntk/nusl-264935.

Texto completo da fonte

Resumo:

The purpose of this thesis is to show a method, that would transform given Turing machine into propagating scattered context grammar, which language contains all valid computational histories of that particular Turing machine. Afterwards this thesis deals with questions arising from existence of such algorithm, especially in regards to the current knowledge about power of propagating scattered context grammars. Practical examples and implementation of proposed algorithm is also part of this thesis.

Estilos ABNT, Harvard, Vancouver, APA, etc.

21

Krebs, Peter R. History &amp Philosophy of Science UNSW. "Turing machines, computers and artificial intelligence." Awarded by:University of New South Wales. History & Philosophy of Science, 2002. http://handle.unsw.edu.au/1959.4/19053.

Texto completo da fonte

Resumo:

This work investigates some of the issues and consequences for the field of artificial intelligence and cognitive science, which are related to the perceived limits of computation with current digital equipment. The Church -Turing thesis and the specific properties of Turing machines are examined and some of the philosophical 'in principle' objections, such as the application of G??del's incompleteness theorem, are discussed. It is argued that the misinterpretation of the Church-Turing thesis has led to unfounded assumptions about the limitations of computing machines in general. Modern digita

Estilos ABNT, Harvard, Vancouver, APA, etc.

22

Davidsdottir, Agnes. "Algorithms, Turing machines and algorithmic undecidability." Thesis, Uppsala universitet, Algebra och geometri, 2021. http://urn.kb.se/resolve?urn=urn:nbn:se:uu:diva-441282.

Texto completo da fonte

Estilos ABNT, Harvard, Vancouver, APA, etc.

23

Lin, Jack Chen-Hung. "Structural properties of one-tape Turing machines." Thesis, University of Ottawa (Canada), 2002. http://hdl.handle.net/10393/6125.

Texto completo da fonte

Resumo:

The model of Turing machines has been studied since its birth in 1936. Researchers have continuously proposed variants of such a model. Upon imposing different constraints, the power of each model varies or even remains the same, accordingly. Some well-known result (for example, the equivalence of finite state automata and one-tape linear-time deterministic Turing machines) has proven that the abilities of overwriting the tape content and scanning the tape content more than once cannot gain any advantage under certain restrictions. In this thesis, we study the behaviors and the fundamental pro

Estilos ABNT, Harvard, Vancouver, APA, etc.

24

Liron, Romain. "Approche écologique dans la conception d’outils cognitifs dans le domaine administratif : application à l’artisanat du bâtiment." Thesis, Lorient, 2016. http://www.theses.fr/2016LORIL391/document.

Texto completo da fonte

Resumo:

Ce travail adopte le cadre de l’ingénierie cognitive en vue de la conception et de l’évaluation d’outils cognitifs dans le domaine de l’administration d’entreprises artisanales. Ce cadre relève d’une approche dite écologique des systèmes de travail. L’objectif général de ce travail est double. D’une part, il s’agit de montrer la pertinence de cette approche écologique eu égard au domaine étudié et d’autre part, de proposer une interface utilisateur pour un système d’aide à la gestion administrative sur support numérique mobile. Plus précisément, nous proposons une modélisation du domaine de tr

Estilos ABNT, Harvard, Vancouver, APA, etc.

25

Hladík, Zdeněk. "Multidimensionální automaty a jejich jazyky." Master's thesis, Vysoké učení technické v Brně. Fakulta informačních technologií, 2017. http://www.nusl.cz/ntk/nusl-363808.

Texto completo da fonte

Resumo:

This work includes brief overview of the theory behind two-dimentional languages which was the main theme examined in previous work. Based upon this theory there are next chapters introducing a new concept of three-dimentional and multi-dimentional languages. For each type of language there is a definition of corresponding type of strings and string operations. Finally, for each type of language there are definitions of developed formal gramatics and automata. Along with theory, in work there is an demonstration of developed program, which provides simulation of introduced multidimensional aut

Estilos ABNT, Harvard, Vancouver, APA, etc.

26

Dubovský, Dávid. "Analýza rizik nástrojářské dílny." Master's thesis, Vysoké učení technické v Brně. Fakulta strojního inženýrství, 2015. http://www.nusl.cz/ntk/nusl-232113.

Texto completo da fonte

Resumo:

This master`s thesis deals with a hazard analysis of selected machinery according to an actual legislative documents in Slovakia, which were taken over from Europien Union directives. The thesis is focused on exploring legislation related to the safety of toolroom workshop in the Czech Republic and Germany. Because of that was done the recherché of harmonized standards in these countries. Subsequently is made the identification of hazards under recherched standards and assessment of control system based on the performance level of the system. In the end are all obtained data evaluated and the

Estilos ABNT, Harvard, Vancouver, APA, etc.

27

Michel, Pascal. "Etude de machines de turing et complexite algorithmique." Paris 7, 1992. http://www.theses.fr/1992PA077129.

Texto completo da fonte

Resumo:

La these est constituee de trois parties independantes. Premiere partie: comportement de quelques castors affaires et probleme ouvert en theorie des nombres. Un castor affaire est une machine de turing qui prend beaucoup de temps pour s'arreter quand elle part de la bande vide. Un lien est etabli entre le probleme de l'arret pour plusieurs castors affaires et le probleme de l'evolution des iterees d'une fonction definie par cas selon des congruences. Deuxieme partie: complexite de theories logiques contenant la relation de coprimalite. Des majorants sont donnes pour la complexite algorithmique

Estilos ABNT, Harvard, Vancouver, APA, etc.

28

Renuka, Shivaswaroop R. "Development of models of CNC machines - EMCO VMC100 and EMCO TURN120P in virtual NC." Ohio : Ohio University, 1996. http://www.ohiolink.edu/etd/view.cgi?ohiou1178046654.

Texto completo da fonte

Estilos ABNT, Harvard, Vancouver, APA, etc.

29

Goutefangea, Patrick. "Alan Turing : La "pensée" des machines et l'idée de pratique." Nantes, 1999. http://www.theses.fr/1999NANT3003.

Texto completo da fonte

Resumo:

La plausibilite de l'equivalence enoncee par la + these de church-turing ; entre procedure effective de calcul et procede mecanique repose sur la possibilite, pour une + machine universelle ;, de simuler les conditions intuitives du calcul chez un individu humain. En ce sens, la machine universelle renvoie a l'homme, non seulement en tant qu'il calcule, mais en tant qu'il est son createur : la machine doit pouvoir simuler les conditions de sa propre construction. Le + jeu de l'imitation ; imagine par turing a pour fonction d'etablir cette possibilite. Selon turing, l'adversaire humain de la ma

Estilos ABNT, Harvard, Vancouver, APA, etc.

30

Atger, Dominique. "A Turing machines simulator using a Microsoft Windows' interface." Virtual Press, 1993. http://liblink.bsu.edu/uhtbin/catkey/865965.

Texto completo da fonte

Resumo:

The purpose of this thesis is to develop a software system simulating Turing machines using a Microsoft Windows' Interface.Developed in the 1930's by Alan Turing and Emil Post, Turing machines are defined as "abstract computers" . These machines seem able to solve all problems a modern computer can solve, however complex the problems may be. A Turing machine is a basic computational model for algorithms.The software provides a practical tool to students with a relative notion of Turing machines. The software contains introduction and general information on Turing machines that gives the beginn

Estilos ABNT, Harvard, Vancouver, APA, etc.

31

Wang, Zhanchen. "Chatter analysis of machine tool systems in turning processes." Thesis, National Library of Canada = Bibliothèque nationale du Canada, 2001. http://www.collectionscanada.ca/obj/s4/f2/dsk3/ftp05/NQ63715.pdf.

Texto completo da fonte

Estilos ABNT, Harvard, Vancouver, APA, etc.

32

Dalle, Vedove Nosaki Gregorio. "Chaos and Turing Machines on Bidimensional Models at Zero Temperature." Thesis, Bordeaux, 2020. http://www.theses.fr/2020BORD0309.

Texto completo da fonte

Resumo:

En mécanique statistique d'équilibre ou formalisme thermodynamique un des objectifs est de décrire le comportement des familles de mesures d'équilibre pour un potentiel paramétré par la température inverse. Nous considérons ici une mesure d'équilibre comme une mesure shift invariant qui maximise la pression. Il existe d'autres constructions qui prouvent le comportement chaotique de ces mesures lorsque le système se fige, c'est-à-dire lorsque la température tend vers zéro. Un des exemples les plus importants a été donné par Chazottes et Hochman où ils prouvent la non-convergence des mesures d'é

Estilos ABNT, Harvard, Vancouver, APA, etc.

33

Van, den Berg Gideon. "Hidden Markov models for tool wear monitoring in turning operations." Diss., Pretoria : [s.n.], 2004. http://upetd.up.ac.za/thesis/available/etd-05302005-114238/.

Texto completo da fonte

Estilos ABNT, Harvard, Vancouver, APA, etc.

34

Song, Sukhan. "Intelligent machining control for turning process /." Digital version accessible at:, 1998. http://wwwlib.umi.com/cr/utexas/main.

Texto completo da fonte

Estilos ABNT, Harvard, Vancouver, APA, etc.

35

Ulmer, Bernard C. Jr. "Fabrication and calibration of an open architecture diamond turning machine." Thesis, Georgia Institute of Technology, 1997. http://hdl.handle.net/1853/17120.

Texto completo da fonte

Estilos ABNT, Harvard, Vancouver, APA, etc.

36

Longo, Eugenio. "AI e IoT: contesto e stato dell’arte." Bachelor's thesis, Alma Mater Studiorum - Università di Bologna, 2022.

Encontre o texto completo da fonte

Resumo:

L’intelligenza artificiale costituisce un ramo dell’informatica che permette di programmare e progettare sistemi in grado di dotare le macchine di caratteristiche considerate tipicamente umane. L’internet delle cose rappresenta una rete di oggetti fisici in grado di connettersi e scambiare dati con altri dispositivi tramite internet. Nonostante L’internet delle cose e l’intelligenza artificiale rappresentino due concetti diversi, riescono ad integrarsi per creare nuove soluzioni con un elevato potenziale. L’utilizzo combinato di queste due tecnologie permette di aumentare il valore di entrambe

Estilos ABNT, Harvard, Vancouver, APA, etc.

37

Atmadi, Alexander. "Cutting fluid aerosol from splash in turning : analysis for environmentally conscious machining." Thesis, Georgia Institute of Technology, 2000. http://hdl.handle.net/1853/19603.

Texto completo da fonte

Estilos ABNT, Harvard, Vancouver, APA, etc.

38

Chiou, Yunshun. "Acoustic emission dynamics in turning with tool wear and chatter." Diss., Georgia Institute of Technology, 1995. http://hdl.handle.net/1853/17990.

Texto completo da fonte

Estilos ABNT, Harvard, Vancouver, APA, etc.

39

Knuefermann, Markus M. W. "Machining surfaces of optical quality by hard turning." Thesis, Cranfield University, 2003. http://dspace.lib.cranfield.ac.uk/handle/1826/131.

Texto completo da fonte

Resumo:

The main aim of this work was the machining by hard turning of surfaces with optical surface quality. A numerical target had been set as a surface roughness Ra = 10nm. It has been shown that achieving roughness of that magnitude by hard turning is possible. Individual work pieces exhibited the desired surface properties for short lengths at a time, but it proved to be very difficult to achieve these surfaces consistently and over longer cuts. The factors influencing the surface roughness were identified as tool defects and machine vibration in addition to the standard cutting parameters and ch

Estilos ABNT, Harvard, Vancouver, APA, etc.

40

Medaska, Michael Kenneth. "The measurement of temperatures and forces in a turning operation with cutting fluid." Thesis, Georgia Institute of Technology, 1998. http://hdl.handle.net/1853/15983.

Texto completo da fonte

Estilos ABNT, Harvard, Vancouver, APA, etc.

41

Cheng, Hsiang-Nan, and Hsiang-Nan Cheng. "Diamond Turning Properties of Plastic Optical Materials." Thesis, The University of Arizona, 2017. http://hdl.handle.net/10150/625700.

Texto completo da fonte

Resumo:

With sub-micrometric form accuracy and nanometer scale surface roughness, the diamond turning process provides a great solution of fast prototyping optical systems with aspheric or freeform surfaces. On the other hand, with relatively lower cost and lighter weight, optical plastics are now widely used in consumer products. To study and optimize the cutting parameters of the diamond turning process on optical plastics, a series of tests with different cutting parameters settings are conducted on seven different optical plastic materials: E48R, OKP1, OKP4, OKP4HT, PC, PMMA, and Rexolite 1422. Th

Estilos ABNT, Harvard, Vancouver, APA, etc.

42

Thathachar, Jayram S. "Time-space tradeoffs and functional representations via branching programs and their generalizations /." Thesis, Connect to this title online; UW restricted, 1998. http://hdl.handle.net/1773/6951.

Texto completo da fonte

Estilos ABNT, Harvard, Vancouver, APA, etc.

43

Sims, Pauline. "Turing's P-type machine and neural network hybrid systems." Thesis, University of Ulster, 1994. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.240712.

Texto completo da fonte

Estilos ABNT, Harvard, Vancouver, APA, etc.

44

Dawson, Ty Grant. "Effects of cutting parameters and tool wear in hard turning." Thesis, Georgia Institute of Technology, 1999. http://hdl.handle.net/1853/17816.

Texto completo da fonte

Estilos ABNT, Harvard, Vancouver, APA, etc.

45

Campbell, Robert David James. "Information processing in microtubules." Thesis, Queensland University of Technology, 2002.

Encontre o texto completo da fonte

Estilos ABNT, Harvard, Vancouver, APA, etc.

46

Ma, David Chih-Yan. "Design and implementation of a rotary fast tool servo for a turning machine." Thesis, Massachusetts Institute of Technology, 1998. http://hdl.handle.net/1721.1/9594.

Texto completo da fonte

Resumo:

Thesis (S.M.)--Massachusetts Institute of Technology, Dept. of Mechanical Engineering, 1998.<br>Includes bibliographical references (p. 149-151).<br>In this thesis we describe the design and implementation of a rotary fast tool servo (RFTS) in a machine tool for turning ophthalmic lenses. To machine nonrotationally symmetric lenses, the cutting tool on the RFTS must move synchronously with the spindle rotation. Therefore, to cut a lens at high spindle speeds, the cutting tool must be capable of extremely high accelerations. In our design we mount the cutting tool at the end of a rotary arm. Th

Estilos ABNT, Harvard, Vancouver, APA, etc.

47

Durand, Bruno. "Automates cellulaires : réversibilité et complexité." Lyon 1, 1994. http://www.theses.fr/1994LYO10030.

Texto completo da fonte

Resumo:

Nous etudions les automates cellulaires depuis plusieurs points de vue. Nous commencons par les envisager comme des systemes dynamiques et presentons une nouvelle preuve d'un resultat celebre du a richardson: les automates cellulaires sont exactement les fonctions continues qui commutent avec les translations. Cette preuve nous permet d'etudier la minimisation de la representation des automates cellulaires. Ensuite, nous presentons une classification des automates cellulaires en fonction de leur comportement limite, classification que nous prouvons etre partiellement decidable en dimension 1.

Estilos ABNT, Harvard, Vancouver, APA, etc.

48

Bhatt, Dhruv. "Economic Dispatch of the Combined Cycle Power Plant Using Machine Learning." Thesis, KTH, Skolan för elektroteknik och datavetenskap (EECS), 2019. http://urn.kb.se/resolve?urn=urn:nbn:se:kth:diva-266110.

Texto completo da fonte

Resumo:

Combined Cycle Power Plant (CCPP)s play a key role in modern powersystem due to their lesser investment cost, lower project executiontime, and higher operational flexibility compared to other conventionalgenerating assets. The nature of generation system is changing withever increasing penetration of the renewable energy resources. Whatwas once a clearly defined generation, transmission, and distributionflow is shifting towards fluctuating distribution generation. Because ofvariation in energy production from the renewable energy resources,CCPP are increasingly required to vary their load leve

Estilos ABNT, Harvard, Vancouver, APA, etc.

49

Purarjomandlangrudi, Afrooz. "Application of machine learning technique in wind turbine fault diagnosis." Thesis, Queensland University of Technology, 2014. https://eprints.qut.edu.au/70624/2/Afrooz_Purarjomandlangrudi_Thesis.pdf.

Texto completo da fonte

Resumo:

In this study, a machine learning technique called anomaly detection is employed for wind turbine bearing fault detection. Basically, the anomaly detection algorithm is used to recognize the presence of unusual and potentially faulty data in a dataset, which contains two phases: a training phase and a testing phase. Two bearing datasets were used to validate the proposed technique, fault-seeded bearing from a test rig located at Case Western Reserve University to validate the accuracy of the anomaly detection method, and a test to failure data of bearings from the NSF I/UCR Center for Intellig

Estilos ABNT, Harvard, Vancouver, APA, etc.

50

Araújo, Anderson. "Uma abordagem modelo-teórica da computabilidade de Turing clássica." [s.n.], 2011. http://repositorio.unicamp.br/jspui/handle/REPOSIP/281062.

Texto completo da fonte

Resumo:

Orientador: Walter Alexandre Carnielli<br>Tese (doutorado) - Universidade Estadual de Campinas, Instituto de Filosofia e Ciências Humanas<br>Made available in DSpace on 2018-08-17T17:02:46Z (GMT). No. of bitstreams: 1 Araujo_Anderson_D.pdf: 1286485 bytes, checksum: 1e51db7a5721f4affeaf8f512d23269e (MD5) Previous issue date: 2011<br>Resumo: Esta tese propõe uma nova abordagem da computabilidade de Turing clássica, denominada abordagem modelo-teórica. De acordo com essa abordagem, estruturas e teorias são associadas às máquinas de Turing a fim de investigar as características de suas computaçõ

Estilos ABNT, Harvard, Vancouver, APA, etc.

Oferecemos descontos em todos os planos premium para autores cujas obras estão incluídas em seleções literárias temáticas. Contate-nos para obter um código promocional único!