Rozprawy doktorskie na temat „Abstraction”
Utwórz poprawne odniesienie w stylach APA, MLA, Chicago, Harvard i wielu innych
Sprawdź 50 najlepszych rozpraw doktorskich naukowych na temat „Abstraction”.
Przycisk „Dodaj do bibliografii” jest dostępny obok każdej pracy w bibliografii. Użyj go – a my automatycznie utworzymy odniesienie bibliograficzne do wybranej pracy w stylu cytowania, którego potrzebujesz: APA, MLA, Harvard, Chicago, Vancouver itp.
Możesz również pobrać pełny tekst publikacji naukowej w formacie „.pdf” i przeczytać adnotację do pracy online, jeśli odpowiednie parametry są dostępne w metadanych.
Przeglądaj rozprawy doktorskie z różnych dziedzin i twórz odpowiednie bibliografie.
Huang, Shan Shan. "Structural abstraction". Diss., Atlanta, Ga. : Georgia Institute of Technology, 2009. http://hdl.handle.net/1853/29632.
Pełny tekst źródłaCommittee Chair: Yannis Smaragdakis; Committee Member: Oege de Moor; Committee Member: Richard LeBlanc; Committee Member: Santosh Pande; Committee Member: Spencer Rugaber. Part of the SMARTech Electronic Thesis and Dissertation Collection.
Payne, Jonathan. "Expansionist abstraction". Thesis, University of Sheffield, 2013. http://etheses.whiterose.ac.uk/3326/.
Pełny tekst źródłaStewart, Nicholas. "Abstraction and comedy". Thesis, Goldsmiths College (University of London), 2013. http://research.gold.ac.uk/9922/.
Pełny tekst źródłaRayside, Derek F. "Automating abstraction functions". Thesis, Massachusetts Institute of Technology, 2010. http://hdl.handle.net/1721.1/62439.
Pełny tekst źródłaCataloged from PDF version of thesis.
Includes bibliographical references (p. 109-119).
Data abstraction has been the dominant structuring paradigm for programs for decades. The essence of a data abstraction is the abstraction function, which relates the concrete program representation to its abstract meaning. However, abstraction functions are not generally considered to be a part of the executing program. We propose that making abstraction functions an executable part of the program can enable programmers to write clearer and more concise programs with fewer errors. In particular, we show that the object equality and hashing operations (which programmers are required to write), can often be expressed more clearly and more concisely in terms of the abstract state of the object. Getting these methods right has proven to be difficult for programmers at all skill levels, from novice through expert. In a case study of the standard Java libraries we show that rewriting the code with explicit declarative abstraction functions (and generating equality and hashing methods automatically) removed object-contract compliance faults previously found by Pacheco et al. To make abstraction functions part of the executing program we develop four techniques for the dynamic evaluation of abstraction functions written in a declarative first-order logic with relations and transitive closure. We observe that the abstraction functions programmers write in practice may often be viewed as navigation queries on the heap, and two of our techniques exploit this insight to synthesize executable code from declarative abstraction functions. The performance of our research prototype is within striking distance of hand-written code.
by Derek F. Rayside.
Ph.D.
Koniski, Grant. ""The Unprogrammed Abstraction"". University of Cincinnati / OhioLINK, 2020. http://rave.ohiolink.edu/etdc/view?acc_num=ucin1592135457002889.
Pełny tekst źródłaBarthélemy, Anne. "Abstraction et photographie /". [Rennes] : l'auteur, 1997. http://catalogue.bnf.fr/ark:/12148/cb370661876.
Pełny tekst źródłaGirgin, Sertan. "Abstraction In Reinforcement Learning". Phd thesis, METU, 2007. http://etd.lib.metu.edu.tr/upload/12608257/index.pdf.
Pełny tekst źródłaSmirnov, Sergey. "Business process model abstraction". Phd thesis, Universität Potsdam, 2011. http://opus.kobv.de/ubp/volltexte/2012/6025/.
Pełny tekst źródłaGeschäftsprozessmodelle werden in einer Fülle organisatorischer Initiativen eingesetzt, wobei verschiedene Stakeholder individuelle Ansprüche an die Sicht auf den jeweiligen Prozess haben. Dies führt dazu, dass zu einem Geschäftsprozess eine Vielzahl unterschiedlicher Modelle existiert. In einer sich ständig verändernden Geschäftsumgebung ist es daher schwierig, diese Vielzahl von Modellen konsistent zu halten: Ändert sich sich ein Prozess, müssen alle Modelle, die ihn beschreiben, aktualisiert werden. Aufgrund der schieren Menge an Prozessmodellen und ihrer komplexen Beziehungen zueinander, erhöhen sich Aufwand und Kosten zur Pflege aller Modelle enorm. Vor diesem Hintergrund ermöglicht die Abstraktion von Geschäftsprozessmodellen, die Menge der Modelle zu reduzieren und damit ihre Verwaltung zu vereinfachen. Abstraktion von Geschäftsprozessmodellen bezeichnet eine Transformation eines Prozessmodells, so dass es für einen bestimmten Zweck besonders geeignet ist. Bei der Abstraktion von Geschäftsprozessen bleiben essentielle Eigenschaften eines Modells erhalten, während irrelevante Eigenschaften verworfen werden. Mehrere Studien stellen Prozessmodellabstraktion in den Fokus und konzentrieren sich auf konkrete Anwendungsfälle, für die sie geeignete Transformationen entwickelt haben. Diese Dissertation untersucht das Problem der Prozessmodellabstraktion und systematisiert die Lösung in einem Framework. Aktuelle Anforderungen der Industrie an die Abstraktion von Prozessmodellen wurden recherchiert und in einem Katalog von Anwendungsfällen zusammengefasst, von denen ein besonderer für die weiteren Untersuchungen ausgewählt wurde. In diesem Fall erwartet der Nutzer ein Modell niedrigeren Detailgrades, in welchem die Kontrollflussbeziehungen des Ursprungsmodells erhalten bleiben. Beginnend bei Modelltransformationen, die auf der Analyse der Prozessmodellstruktur aufbauen, entwickeln wir neuartige Abstraktionsoperationen zur Unterstützung dieses Anwendungsfalles. Darüber hinaus untersuchen wir Abstraktionsmethoden, welche die Semantik von Prozessmodellelementen berücksichtigen. Zum einen zeigen wir, wie Aktivitäten ermittelt werden können, die miteinander in semantischer Beziehung stehen - ein Problem, das bisher nur unzureichend betrachtet wurde. Die vorgeschlagenen Methoden werden mithilfe industrieller Prozessmodellsammlungen validiert und deren Umsetzung diskutiert. Zum anderen schlagen wir eine innovative Modelltransformation zur nicht-hierarchischen Abstraktion von Prozessmodellen vor. Dieser liegt die Ermittlung in Beziehung stehender Aktivitäten zugrunde. Demzufolge präsentiert diese Arbeit eine originäre Methode zur Prozessmodellabstraktion, die die Verwaltung von Geschäftsprozessmodellen vereinfacht und den Grundstein für innovative Softwarewerkzeuge legt.
Clark, Allan. "Abstraction-level functional programming". Thesis, University of Edinburgh, 2008. http://hdl.handle.net/1842/24458.
Pełny tekst źródłaJohnson, Mary Vaughan. "Space, embodiment and abstraction". Thesis, Georgia Institute of Technology, 1991. http://hdl.handle.net/1853/24102.
Pełny tekst źródłaWang, Xiaoyu 1968. "Variables abstraction in SDL". Thesis, McGill University, 2001. http://digitool.Library.McGill.CA:80/R/?func=dbin-jump-full&object_id=33856.
Pełny tekst źródłaYallop, Jeremy. "Abstraction for web programming". Thesis, University of Edinburgh, 2010. http://hdl.handle.net/1842/4683.
Pełny tekst źródłaLatham, J. T. "Abstraction in program verification". Thesis, University of Manchester, 1985. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.372026.
Pełny tekst źródłaBezanson, Jeffrey Werner. "Abstraction in technical computing". Thesis, Massachusetts Institute of Technology, 2015. http://hdl.handle.net/1721.1/99811.
Pełny tekst źródłaCataloged from PDF version of thesis.
Includes bibliographical references (pages 133-143).
Array-based programming environments are popular for scientific and technical computing. These systems consist of built-in function libraries paired with high-level languages for interaction. Although the libraries perform well, it is widely believed that scripting in these languages is necessarily slow, and that only heroic feats of engineering can at best partially ameliorate this problem. This thesis argues that what is really needed is a more coherent structure for this functionality. To find one, we must ask what technical computing is really about. This thesis suggests that this kind of programming is characterized by an emphasis on operator complexity and code specialization, and that a language can be designed to better fit these requirements. The key idea is to integrate code selection with code specialization, using generic functions and data-flow type inference. Systems like these can suffer from inefficient compilation, or from uncertainty about what to specialize on. We show that sufficiently powerful type-based dispatch addresses these problems. The resulting language, Julia, achieves a Quine-style "explication by elimination" of many of the productive features technical computing users expect.
by Jeffrey Werner Bezanson.
Ph. D.
Walsh, Toby. "A theory of abstraction". Thesis, University of Edinburgh, 1990. http://hdl.handle.net/1842/20276.
Pełny tekst źródłaDarabi, Kaveh. "User-centred video abstraction". Thesis, Brunel University, 2015. http://bura.brunel.ac.uk/handle/2438/11022.
Pełny tekst źródłaFitzgerald, Shane. "Abstraction, Space and Photography". Thesis, Griffith University, 2020. http://hdl.handle.net/10072/391080.
Pełny tekst źródłaThesis (Masters)
Master of Visual Arts (MVA)
Queensland College of Art
Arts, Education and Law
Full Text
Hussey, Stephen W. "The feasibility of sand-abstraction as a viable method of ground water abstraction". Thesis, Loughborough University, 2003. https://dspace.lboro.ac.uk/2134/14054.
Pełny tekst źródłaChoueiry, Berthe Y. Choueiry Berthe Yazid. "Abstraction methods for resource allocation /". [S.l.] : [s.n.], 1994. http://library.epfl.ch/theses/?nr=1292.
Pełny tekst źródłaMahmood, Farrukh, i Waqas Rasheed. "Quality Requirement Abstraction Model (QRAM)". Thesis, Blekinge Tekniska Högskola, Institutionen för programvaruteknik, 2014. http://urn.kb.se/resolve?urn=urn:nbn:se:bth-3397.
Pełny tekst źródłaZhou, Qingnan. "Abstraction of man-made shapes". Thesis, University of British Columbia, 2009. http://hdl.handle.net/2429/12633.
Pełny tekst źródłaGleeson, Timothy Joseph. "Aspects of abstraction in computing". Thesis, University of Cambridge, 1989. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.334156.
Pełny tekst źródłaGreitschus, Marius [Verfasser], i Andreas [Akademischer Betreuer] Podelski. "New techniques for abstraction refinement". Freiburg : Universität, 2018. http://d-nb.info/1174142472/34.
Pełny tekst źródłaRuhrberg, Peter. "Simultaneous abstraction and semantic theories". Thesis, University of Edinburgh, 1996. http://hdl.handle.net/1842/520.
Pełny tekst źródłaPark, Hyoung-June. "Formalization, data abstraction, and communication". Thesis, Massachusetts Institute of Technology, 1997. http://hdl.handle.net/1721.1/69376.
Pełny tekst źródłaIncludes bibliographical references (leaves 109-111).
Shape Grammar introduces the algorithm that stimulates the development of form and its meaning in the design process. Since Shape Grammar provides a way of representing form and its meaning as sets of mathematical terms, which are shapes and the different algebra, Shape Grammar has been anticipated for developing an architect's design idea with a computer-aided system. However, its application has been limited in the theoretical analysis of the historical precedents in architecture. Thus, a study of the practical application of Shape Grammar is needed in order to make creative design, in the actual design process, using a CAD system, possible. Through the experimentation with "making follY," this thesis introduces a model for the application of Shape Grammar to the architectural design process. It presents theoretical foundations, describes the methods of formalization, data abstraction, and communication with Shape Grammar in making designs, and illustrates the process of making folly as the result of this thesis. The approach is derived from the study of the different definitions of architectural form and the observation that architects explore formal ideas by producing sequences of drawings, which are schema(s). This thesis investigates possible methods of formalization and data-abstraction based upon schema(s) in the architectural design. Also, this thesis proposes the framework for a prototype computer system that efficiently supports the communication between different computational tools. This communication is established by encoding the design process as the result of the data abstraction, which is composed of shapes as mathematical means, and formalizing the architect's design knowledge according to certain compositional rules. Then, an experiment with "Folly"l design is performed, based upon the suggested methods for the application of Shape Grammar. In conclusion, based upon the results of the experimentation, the initial territory, spatial block, and spatial components in the combination between different algebra are proposed as design methods for the application of Shape Grammar in the making of a creative design. Also, existing problems in the making of practical software are introduced.
by Park, Hyoung-June.
M.S.
Raad, Azalea. "Abstraction, refinement and concurrent reasoning". Thesis, Imperial College London, 2016. http://hdl.handle.net/10044/1/49218.
Pełny tekst źródłaGUIGNET, JEAN-BRUCE. "Abstraction fonctionnelle des composants vlsi". Paris 6, 1998. http://www.theses.fr/1998PA066154.
Pełny tekst źródłaParikh, Ankur. "Abstraction Guided Semi-formal Verification". Thesis, Virginia Tech, 2007. http://hdl.handle.net/10919/33596.
Pełny tekst źródłaMaster of Science
Mészáros, Flóra. "Hungarian Artists in Abstraction-Creation". Thesis, Paris 4, 2016. http://www.theses.fr/2016PA040088.
Pełny tekst źródłaThis dissertation focuses on the international artistic group, called Abstraction-Création (1931-1936. Out of the approximately 100 members joining the association a few were Hungarian artists, namely Étienne Béothy, Alfred Reth, Lajos Tihanyi and Ferenc Martyn, whereas László Moholy-Nagy received an external membership. A deeper research into the Parisian non-figurative formations of the 1930s, including Abstraction-Création, only took shape in the 1970s. Since then, Abstraction-Création has been discussed only occasionally, and a deeper discussion concerning the structure, the goals, or the history of the group is still missing. The same applies to the research on individual Hungarian artists; while for each of them the participation in the forum was presented as an important stage of their lives, so far only the participation of Béothy and Martyn has been examined in detail. Beyond the basic goal of the study to concentrate on Hungarian artists in the group, the re-evaluation and a new examination of Abstraction-Création are also placed in the focus. Based on a theoretical and historical analysis, the study compares Abstraction-Création with two non-figurative Parisian groups, clarifying the differences between them and pointing out that Abstraction-Création could not be viewed as a combination of the two of them. Drawing on hitherto unanalyzed documents, the author gives an overview of the organizational structure of the forum, and discusses, from an entirely new perspective, the role of the committee, their debates, their formation and cessation and their platforms, including their meetings, gallery and journal. The dissertation demonstrates the relation between Abstraction-Création and Surrealism by means of a stylistic and theoretical analysis. It claims that through the activities of the Hungarian members, all the facets of the group can be shown, particularly because of the fact that they did not form a special group within the association, but had their different individual roles and routes. The author presents what the original aims behind the admission of the Hungarian members were and how they benefited from the participation. The dissertation depicts the Parisian abstract period of Hungarian artists in the 1930s in an international artistic context and against a broader historical background
Kiefer, Stefan. "Abstraction refinement for pushdown systems". [S.l. : s.n.], 2005. http://www.bsz-bw.de/cgi-bin/xvms.cgi?SWB12103666.
Pełny tekst źródłaLee, Seungjoon. "WISE abstraction framework for wireless networks". College Park, Md. : University of Maryland, 2006. http://hdl.handle.net/1903/3867.
Pełny tekst źródłaThesis 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.
Aarts, Fides. "Inference and Abstraction of Communication Protocols". Thesis, Uppsala University, Department of Information Technology, 2009. http://urn.kb.se/resolve?urn=urn:nbn:se:uu:diva-111249.
Pełny tekst źródłaIn this master thesis we investigate to infer models of standard communication protocols using automata learning techniques. One obstacle is that automata learning has been developed for machines with relatively small alphabets and a moderate number of states, whereas communication protocols usually have huge (practically infinite) sets of messages and sets of states. We propose to overcome this obstacle by defining an abstraction mapping, which reduces the alphabets and sets of states to finite sets of manageable size. We use an existing implementation of the L* algorithm for automata learning to generate abstract finite-state models, which are then reduced in size and converted to concrete models of the tested communication protocol by reversing the abstraction mapping.
We have applied our abstraction technique by connecting the Learn-Lib library for regular inference with the protocol simulator ns-2, which provides implementations of standard protocols. By using additional reductionsteps, we succeeded in generating readable and understandable models of the SIP protocol.
Zhao, Shu Jie. "Line drawings abstraction from 3D models". Thesis, University of Macau, 2009. http://umaclib3.umac.mo/record=b2130124.
Pełny tekst źródłaPolyvyanyy, Artem, Sergey Smirnov i Mathias Weske. "The triconnected abstraction of process models". Universität Potsdam, 2008. http://opus.kobv.de/ubp/volltexte/2009/3284/.
Pełny tekst źródłaKleine, Matthias, Robert Hirschfeld i Gilad Bracha. "An abstraction for version control systems". Universität Potsdam, 2011. http://opus.kobv.de/ubp/volltexte/2012/5562/.
Pełny tekst źródłaVersion Control Systems (VCS) allow developers to manage changes to software artifacts. Developers interact with VCSs through a variety of client programs, such as graphical front-ends or command line tools. It is desirable to use the same version control client program against different VCSs. Unfortunately, no established abstraction over VCS concepts exists. Instead, VCS client programs implement ad-hoc solutions to support interaction with multiple VCSs. This thesis presents Pur, an abstraction over version control concepts that allows building rich client programs that can interact with multiple VCSs. We provide an implementation of this abstraction and validate it by implementing a client application.
Streader, David. "Abstraction and refinement of process actions". Thesis, Queen Mary, University of London, 2000. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.368046.
Pełny tekst źródłaChorfi, Redha. "Abstraction et vérification de programmes informatiques". Thesis, Université Laval, 2008. http://www.theses.ulaval.ca/2008/25710/25710.pdf.
Pełny tekst źródłaParry, Aneurin Stefan. "Limits of abstraction in electroacoustic music". Thesis, City University London, 2000. http://openaccess.city.ac.uk/1129/.
Pełny tekst źródłaLiu, Xiaodong. "Abstraction : a notion for reverse engineering". Thesis, De Montfort University, 1999. http://hdl.handle.net/2086/4214.
Pełny tekst źródłaBoyle, Joseph. "Abstraction and the judgement of taste". Thesis, Queen's University Belfast, 1991. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.334496.
Pełny tekst źródłaIglesias, Pablo Nogueira. "Polytypic functional programming and data abstraction". Thesis, University of Nottingham, 2005. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.430769.
Pełny tekst źródłaKalofonos, Dionysis. "Simplifying graph-based planning through abstraction". Thesis, University of Aberdeen, 2007. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.446082.
Pełny tekst źródłaMenaa, Mohamed Nabih. "On the compositionality of round abstraction". Thesis, University of Birmingham, 2012. http://etheses.bham.ac.uk//id/eprint/3381/.
Pełny tekst źródłaRodrigues, Rodrigo Seromenho Miragaia 1975. "Combining abstraction with Byzantine fault-tolerance". Thesis, Massachusetts Institute of Technology, 2001. http://hdl.handle.net/1721.1/86764.
Pełny tekst źródłaIncludes bibliographical references (p. 83-86).
by Rodrigo Seromenho Miragaia Rodrigues.
S.M.
Cockton, Gilbert. "Architecture and abstraction in interactive systems". Thesis, Heriot-Watt University, 1992. http://hdl.handle.net/10399/1460.
Pełny tekst źródłaFarquharson, Roy G. "Fetal abstraction of placental steroid hormones". Thesis, University of Aberdeen, 1985. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.328653.
Pełny tekst źródłaBaier, Thomas, Jan Mendling i Mathias Weske. "Bridging abstraction layers in process mining". Elsevier, 2014. http://dx.doi.org/10.1016/j.is.2014.04.004.
Pełny tekst źródłaLaurentin, Marc. "Abstraction fonctionnelle des circuits integres cmos". Paris 6, 1994. http://www.theses.fr/1994PA066620.
Pełny tekst źródłaWadoo, Sabiha Amin. "Evacuation Distributed Feedback Control and Abstraction". Diss., Virginia Tech, 2007. http://hdl.handle.net/10919/27439.
Pełny tekst źródłaPh. D.
Khan, Jehandad. "Holistic Abstraction for Distributed Network Debugging". Diss., Virginia Tech, 2018. http://hdl.handle.net/10919/93500.
Pełny tekst źródłaPHD