Dissertations / Theses: 'Computer programming. Coding theory'

1

Yan, Yun. "Turbo codes." Ohio : Ohio University, 1999. http://www.ohiolink.edu/etd/view.cgi?ohiou1175200238.

APA, Harvard, Vancouver, ISO, and other styles

2

Li, Xiaolong. "Real-time speaker-independent large vocabulary continuous speech recoginition." Diss., Columbia, Mo. : University of Missouri-Columbia, 2005. http://hdl.handle.net/10355/4119.

Full text

Abstract:

Thesis (Ph. D.)--University of Missouri-Columbia, 2005.
The entire dissertation/thesis text is included in the research.pdf file; the official abstract appears in the short.pdf file (which also appears in the research.pdf); a non-technical general description, or public abstract, appears in the public.pdf file. Title from title screen of research.pdf file viewed on (November 13, 2006) Vita. Includes bibliographical references.

APA, Harvard, Vancouver, ISO, and other styles

3

Dunscombe, Elizabeth Jane. "Some applications of mathematics to coding theory." Thesis, Royal Holloway, University of London, 1988. http://repository.royalholloway.ac.uk/items/a101f1a7-d892-4307-85c4-311c422cdb01/1/.

Full text

Abstract:

This thesis deals with the transmission of data over a channel that is subject to noise, or interference. There are many different methods of trying to achieve reliable communication of data in the presence of noise. This thesis considers some of these methods, in particular, those aspects involving the use of error-correcting codes. A number of specific applications are considered, as well as some more general theory. One general class of codes is that of cyclic codes (where every cyclic shift of a codeword is also a codeword). Chapter 2 of this thesis reviews a decoding scheme for cyclic codes proposed by Professor P.M. Cohn. The scheme is a modification of standard array syndrome decoding. It is shown that Cohn's scheme does not perform as well as the original version of syndrome decoding. Chapter 3 considers Cyclotomically Shortened Reed Solomon codes (a class of codes introduced by J.L. Dornstetter) and their relationship with the Chinese Remainder Theorem codes of J.J. Stone. The blocklength and dimension of these codes is established, together with the best possible lower bound on the minimum distance. The notion of cyclotomic shortening is then extended to Alternant codes. Chapter 4 deals with the subject of interleaving for channels that are subject to bursts of errors. An optimal solution is given to a problem posed by Inmarsat when interleaving is used with a convolutional code. It is shown how to improve the method of interleaving which feeds data column-wise into an array and then transmits row-wise, by careful selection of the order in which the rows are transmitted. The final chapter discusses the concept of an error-correcting code with two different codeword lengths. Some general results about such codes are presented. A method of forming these codes is given for the case when one word length is twice the other. A specific example of this type of code is considered. Both theoretical and simulated performance results are presented for the example.

APA, Harvard, Vancouver, ISO, and other styles

4

Passuello, Alberto. "Semidefinite programming in combinatorial optimization with applications to coding theory and geometry." Phd thesis, Université Sciences et Technologies - Bordeaux I, 2013. http://tel.archives-ouvertes.fr/tel-00948055.

Full text

Abstract:

We apply the semidefinite programming method to obtain a new upper bound on the cardinality of codes made of subspaces of a linear vector space over a finite field. Such codes are of interest in network coding.Next, with the same method, we prove an upper bound on the cardinality of sets avoiding one distance in the Johnson space, which is essentially Schrijver semidefinite program. This bound is used to improve existing results on the measurable chromatic number of the Euclidean space.We build a new hierarchy of semidefinite programs whose optimal values give upper bounds on the independence number of a graph. This hierarchy is based on matrices arising from simplicial complexes. We show some properties that our hierarchy shares with other classical ones. As an example, we show its application to the problem of determining the independence number of Paley graphs.

APA, Harvard, Vancouver, ISO, and other styles

5

Taha, Walid. "Multi-Stage Programming : Its Theory and Applications." Doctoral thesis, Oregon Graduate Institute of Science and Technology, 1999. http://urn.kb.se/resolve?urn=urn:nbn:se:hh:diva-15052.

Full text

Abstract:

MetaML is a statically typed functional programming language with special support for programgeneration. In addition to providing the standard features of contemporary programminglanguages such as Standard ML, MetaML provides three staging annotations. These staging annotationsallow the construction, combination, and execution of object-programs.Our thesis is that MetaML's three staging annotations provide a useful, theoretically soundbasis for building program generators. This dissertation reports on our study of MetaML's stagingconstructs, their use, their implementation, and their formal semantics. Our results include anextended example of where MetaML allows us to produce ecient programs, an explanation ofwhy implementing these constructs in traditional ways can be challenging, two formulations ofMetaML's semantics, a type system for MetaML, and a proposal for extending MetaML with atype construct for closedness.The dissertation consolidates a number of previous publications by the author, includingMetaML's type systems and big-step semantics. The presentation is new. The proposed solutionto an implementation problem and the reduction semantics for MetaML's three staging constructsare also new.

APA, Harvard, Vancouver, ISO, and other styles

6

Gong, Yun. "On semidefinite programming and vector quantization with application to image coding." Diss., Georgia Institute of Technology, 2000. http://hdl.handle.net/1853/14876.

Full text

APA, Harvard, Vancouver, ISO, and other styles

7

Shi, Feng Gang. "Automatic coding from ZedCharts to SPARK Ada for safety-critical systems." Thesis, University of York, 1995. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.297155.

Full text

APA, Harvard, Vancouver, ISO, and other styles

8

Qiwen, Xu. "A theory of state-based parallel programming." Thesis, University of Oxford, 1992. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.306838.

Full text

APA, Harvard, Vancouver, ISO, and other styles

9

Potard, Guillaume. "3D-audio object oriented coding." Access electronically, 2006. http://www.library.uow.edu.au/adt-NWU/public/adt-NWU20061109.111639/index.html.

Full text

APA, Harvard, Vancouver, ISO, and other styles

10

Dabis, Homam Sabih. "The computer enhancement of speech signals." Thesis, University of the West of Scotland, 1991. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.304636.

Full text

APA, Harvard, Vancouver, ISO, and other styles

11

Ma, Kin-Keung. "Infinite prefix codes for geometric distributions /." View abstract or full-text, 2004. http://library.ust.hk/cgi/db/thesis.pl?COMP%202004%20MA.

Full text

Abstract:

Thesis (M. Phil.)--Hong Kong University of Science and Technology, 2004.
Includes bibliographical references (leaves 74-76). Also available in electronic version. Access restricted to campus users.

APA, Harvard, Vancouver, ISO, and other styles

12

Kirby, Graham N. C. "Reflection and hyper-programming in persistent programming systems." Thesis, University of St Andrews, 1992. http://hdl.handle.net/10023/1673.

Full text

Abstract:

In an orthogonally persistent programming system, data is treated in a manner independent of its persistence. This gives simpler semantics, allows the programmer to ignore details of long-term data storage and enables type checking protection mechanisms to operate over the entire lifetime of the data. The ultimate goal of persistent programming language research is to reduce the costs of producing software. The work presented in this thesis seeks to improve programmer productivity in the following ways: • by reducing the amount of code that has to be written to construct an application; • by increasing the reliability of the code written; and • by improving the programmer’s understanding of the persistent environment in which applications are constructed. Two programming techniques that may be used to pursue these goals in a persistent environment are type-safe linguistic reflection and hyper-programming. The first provides a mechanism by which the programmer can write generators that, when executed, produce new program representations. This allows the specification of programs that are highly generic yet depend in non-trivial ways on the types of the data on which they operate. Genericity promotes software reuse which in turn reduces the amount of new code that has to be written. Hyper-programming allows a source program to contain links to data items in the persistent store. This improves program reliability by allowing certain program checking to be performed earlier than is otherwise possible. It also reduces the amount of code written by permitting direct links to data in the place of textual descriptions. Both techniques contribute to the understanding of the persistent environment through supporting the implementation of store browsing tools and allowing source representations to be associated with all executable programs in the persistent store. This thesis describes in detail the structure of type-safe linguistic reflection and hyper-programming, their benefits in the persistent context, and a suite of programming tools that support reflective programming and hyper-programming. These tools may be used in conjunction to allow reflection over hyper-program representations. The implementation of the tools is described.

APA, Harvard, Vancouver, ISO, and other styles

13

Mickel, Timothy R. "Kids, coding, and connections : extending the ScratchJr programming environment to support wireless physical devices." Thesis, Massachusetts Institute of Technology, 2015. http://hdl.handle.net/1721.1/106001.

Full text

Abstract:

Thesis: M. Eng., Massachusetts Institute of Technology, Department of Electrical Engineering and Computer Science, 2015.
This electronic version was submitted by the student author. The certified thesis is available in the Institute Archives and Special Collections.
Cataloged from student-submitted PDF version of thesis.
Includes bibliographical references (pages 69-70).
This thesis presents a system and design for the connection of the ScratchJr programming environment to wireless physical devices. Using ScratchJr, young kids can create interactive stories, animations, and games on mobile tablet devices. With the extension system developed in this thesis, young kids can program wireless lights, motors, sensors, toy robots, and other Bluetooth Smart products and devices. Developers can use the framework to connect ScratchJr to more devices, and a streamlined programming interface is provided for this purpose. The thesis discusses the implementation of several example extensions, and it compares the design and functionality to similar mobile programming environments.
by Timothy R. Mickel.
M. Eng.

APA, Harvard, Vancouver, ISO, and other styles

14

Kunze, Richard J. "Redundant visual coding of state information /." free to MU campus, to others for purchase, 1997. http://wwwlib.umi.com/cr/mo/fullcit?p9841208.

Full text

APA, Harvard, Vancouver, ISO, and other styles

15

O'Halloran, Colin. "Category theory and information flow applied to computer security." Thesis, University of Oxford, 1993. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.358710.

Full text

APA, Harvard, Vancouver, ISO, and other styles

16

de, Queiroz Ruy Jose Guerra Barretto. "Proof theory and computer programming : the logical foundations of computing." Thesis, Imperial College London, 1990. http://hdl.handle.net/10044/1/46514.

Full text

APA, Harvard, Vancouver, ISO, and other styles

17

Pirestani, Shervin. "Source-controlled block turbo coding." Access to citation, abstract and download form provided by ProQuest Information and Learning Company; downloadable PDF file, 69 p, 2008. http://proquest.umi.com/pqdlink?did=994238721&sid=2&Fmt=2&clientId=8331&RQT=309&VName=PQD.

Full text

APA, Harvard, Vancouver, ISO, and other styles

18

Stergiou, Ilias. "Novel computer-network traffic modelling techniques for analysis and simulation." Thesis, University of Sheffield, 1999. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.323059.

Full text

APA, Harvard, Vancouver, ISO, and other styles

19

Turnbull, James. "A new computer-based speech therapy tutor for vowel production." Thesis, Abertay University, 1991. https://rke.abertay.ac.uk/en/studentTheses/0245f6d1-368d-41b1-b112-b5a1ffe6ce0b.

Full text

Abstract:

Our primary mode of communication is via speech. Therefore, any person who has difficulty in producing understandable speech, for whatever reason, is at a great disadvantage. It is the role of the speech therapist to help such people to improve their speech production wherever possible. The aim of this work was to develop a computer-based speech therapy tutor for vowel production. The Tutor would be able to analyse monosyllabic utterances in real-time, extract the vowel portion and match this to a pre-determined template, and display the result with no appreciable delay. A fully-working prototype has been developed which employs general principles of aircraft tracking in a novel way, to track the coefficients of the quadratic factors of the all-pole linear-prediction model for speech production. It is shown how tracking these parameters can be used to extract extended vowels from a monosyllabic utterance. It is also shown how the algorithm which is used to determine the optimum frame-to-frame tracks can be used to perform template matching. The real plane on which the parameters are tracked, the rs-plane, suffers from non-linear scaling of frequency measures. This leads to poor spectral resolution of the perceptually-important low frequency parameters. To overcome this problem, the rs-plane can be warped in order that distance measures taken between points on the plane are more meaningful perceptually. The Tutor is based on a personal computer (PC). In order that real-time operation can be achieved, the processing power of the PC is enhanced by the addition of a digital signal processor (TMS32020) board and a transputer (T800) board. The prototype Tutor was developed with help and advice from Dundee Speech Therapy Service, Tayside Health Board, who also conducted a short pilot study of the Tutor.

APA, Harvard, Vancouver, ISO, and other styles

20

Armitano, Robert M. "Efficient motion-estimation algorithms for video coding." Diss., Georgia Institute of Technology, 1996. http://hdl.handle.net/1853/15397.

Full text

APA, Harvard, Vancouver, ISO, and other styles

21

Levine, Jonathan. "Computer based dialogs : theory and design /." Online version of thesis, 1990. http://hdl.handle.net/1850/10590.

Full text

APA, Harvard, Vancouver, ISO, and other styles

22

Masri, Paul. "Computer modelling of sound for transformation and synthesis of musical signals." Thesis, University of Bristol, 1996. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.246275.

Full text

APA, Harvard, Vancouver, ISO, and other styles

23

Rich, Nelson G. "An introduction to the theory of schemata /." Online version of thesis, 1987. http://hdl.handle.net/1850/10292.

Full text

APA, Harvard, Vancouver, ISO, and other styles

24

Mambrini, Andrea. "Theory grounded design of genetic programming and parallel evolutionary algorithms." Thesis, University of Birmingham, 2015. http://etheses.bham.ac.uk//id/eprint/5928/.

Full text

Abstract:

Evolutionary algorithms (EAs) have been successfully applied to many problems and applications. Their success comes from being general purpose, which means that the same EA can be used to solve different problems. Despite that, many factors can affect the behaviour and the performance of an EA and it has been proven that there isn't a particular EA which can solve efficiently any problem. This opens to the issue of understanding how different design choices can affect the performance of an EA and how to efficiently design and tune one. This thesis has two main objectives. On the one hand we will advance the theoretical understanding of evolutionary algorithms, particularly focusing on Genetic Programming and Parallel Evolutionary algorithms. We will do that trying to understand how different design choices affect the performance of the algorithms and providing rigorously proven bounds of the running time for different designs. This novel knowledge, built upon previous work on the theoretical foundation of EAs, will then help for the second objective of the thesis, which is to provide theory grounded design for Parallel Evolutionary Algorithms and Genetic Programming. This will consist in being inspired by the analysis of the algorithms to produce provably good algorithm designs.

APA, Harvard, Vancouver, ISO, and other styles

25

Anim-Appiah, Kofi Dankwa. "Interleaved concalenated coding for input-constrained channels." Diss., Georgia Institute of Technology, 2000. http://hdl.handle.net/1853/15363.

Full text

APA, Harvard, Vancouver, ISO, and other styles

26

Cahill, S. J. "A characterisation and some pedagogic aspects of the high-level language C in coding for multicontroller-based embedded targets." Thesis, University of Ulster, 1996. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.339339.

Full text

APA, Harvard, Vancouver, ISO, and other styles

27

Yeung, Siu Yin. "Combinatorial property of prefix-free trees with some regular constraints /." View abstract or full-text, 2004. http://library.ust.hk/cgi/db/thesis.pl?COMP%202004%20YEUNG.

Full text

Abstract:

Thesis (M. Phil.)--Hong Kong University of Science and Technology, 2004.
Includes bibliographical references (leaves 67-68). Also available in electronic version. Access restricted to campus users.

APA, Harvard, Vancouver, ISO, and other styles

28

Swain, P. "A computer based method for analysing the phase response of a digital magnetic recording system." Thesis, Cranfield University, 1988. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.234497.

Full text

APA, Harvard, Vancouver, ISO, and other styles

29

Myles, Ashish. "Linear programming approach to fitting splines through 3D channels." [Gainesville, Fla.] : University of Florida, 2004. http://purl.fcla.edu/fcla/etd/UFE0006260.

Full text

APA, Harvard, Vancouver, ISO, and other styles

30

Miguel, Agnieszka C. "Image compression using overcomplete wavelet representations for multiple description coding /." Thesis, Connect to this title online; UW restricted, 2001. http://hdl.handle.net/1773/5920.

Full text

APA, Harvard, Vancouver, ISO, and other styles

31

Anderson, Jon K. "Genetic algorithms applied to graph theory." Virtual Press, 1999. http://liblink.bsu.edu/uhtbin/catkey/1136714.

Full text

Abstract:

This thesis proposes two new variations on the genetic algorithm. The first attempts to improve clustering problems by optimizing the structure of a genetic string dynamically during the run of the algorithm. This is done by using a permutation on the allele which is inherited by the next generation. The second is a multiple pool technique which ensures continuing convergence by maintaining unique lineages and merging pools of similar age. These variations will be tested against two well-known graph theory problems, the Traveling Salesman Problem and the Maximum Clique Problem. The results will be analyzed with respect to string rates, child improvement, pool rating resolution, and average string age.
Department of Computer Science

APA, Harvard, Vancouver, ISO, and other styles

32

Su, Li. "Modelling human cognition using concurrency theory." Thesis, University of Kent, 2009. https://kar.kent.ac.uk/24069/.

Full text

APA, Harvard, Vancouver, ISO, and other styles

33

Khamiss, A.-A. M. "Program construction in Martin-Lof's theory of types." Thesis, University of Essex, 1986. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.373210.

Full text

APA, Harvard, Vancouver, ISO, and other styles

34

Portman, Martin. "Imprecision in real-time systems : theory and practice." Thesis, University of York, 1994. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.282288.

Full text

APA, Harvard, Vancouver, ISO, and other styles

35

Chekwube, Zikora Azubuike. "Building a timer controller circuit, with password access." Thesis, Blekinge Tekniska Högskola, Sektionen för ingenjörsvetenskap, 2013. http://urn.kb.se/resolve?urn=urn:nbn:se:bth-5793.

Full text

Abstract:

The microcontroller and the coding is the heart of making a timer. The strategic release planning is gotten from the concept of how a door machine with password access functions. In this thesis project, all that has been studied in school such as circuit theory, electronics, digital design and microprocessors basic and programming course are combined to the success of this project. Therefore the objective is producing a practical knowledge of what has been studied which is the timer with password access. The method used was an inspiration gotten after reviewing many materials in some respective topic related to designing a timer. The particular method comes from creating an SPI Interface from the Programmer to the Microcontroller to Make Transferring More Convenient. The performance of the MCU, LCD and keypad was just as was expected in the software code and hardware also. The password is inputted, timer is set appropriately and timer runs till port is opened. To conclude, the result can be achieved in different method but this method was for an easy method for beginners.
0764353558

APA, Harvard, Vancouver, ISO, and other styles

36

Yun, Hee Cheol. "Compression of computer animation frames." Diss., Georgia Institute of Technology, 1996. http://hdl.handle.net/1853/13070.

Full text

APA, Harvard, Vancouver, ISO, and other styles

37

Crook, Nigel T. "The theory of explanation applied to medical expert systems." Thesis, Oxford Brookes University, 1991. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.303194.

Full text

APA, Harvard, Vancouver, ISO, and other styles

38

Jervis, Clive Andrew. "A theory of program correctness with three valued logic." Thesis, University of Leeds, 1988. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.277297.

Full text

APA, Harvard, Vancouver, ISO, and other styles

39

Gebser, Martin. "Proof theory and algorithms for answer set programming." Phd thesis, Universität Potsdam, 2011. http://opus.kobv.de/ubp/volltexte/2011/5542/.

Full text

Abstract:

Answer Set Programming (ASP) is an emerging paradigm for declarative programming, in which a computational problem is specified by a logic program such that particular models, called answer sets, match solutions. ASP faces a growing range of applications, demanding for high-performance tools able to solve complex problems. ASP integrates ideas from a variety of neighboring fields. In particular, automated techniques to search for answer sets are inspired by Boolean Satisfiability (SAT) solving approaches. While the latter have firm proof-theoretic foundations, ASP lacks formal frameworks for characterizing and comparing solving methods. Furthermore, sophisticated search patterns of modern SAT solvers, successfully applied in areas like, e.g., model checking and verification, are not yet established in ASP solving. We address these deficiencies by, for one, providing proof-theoretic frameworks that allow for characterizing, comparing, and analyzing approaches to answer set computation. For another, we devise modern ASP solving algorithms that integrate and extend state-of-the-art techniques for Boolean constraint solving. We thus contribute to the understanding of existing ASP solving approaches and their interconnections as well as to their enhancement by incorporating sophisticated search patterns. The central idea of our approach is to identify atomic as well as composite constituents of a propositional logic program with Boolean variables. This enables us to describe fundamental inference steps, and to selectively combine them in proof-theoretic characterizations of various ASP solving methods. In particular, we show that different concepts of case analyses applied by existing ASP solvers implicate mutual exponential separations regarding their best-case complexities. We also develop a generic proof-theoretic framework amenable to language extensions, and we point out that exponential separations can likewise be obtained due to case analyses on them. We further exploit fundamental inference steps to derive Boolean constraints characterizing answer sets. They enable the conception of ASP solving algorithms including search patterns of modern SAT solvers, while also allowing for direct technology transfers between the areas of ASP and SAT solving. Beyond the search for one answer set of a logic program, we address the enumeration of answer sets and their projections to a subvocabulary, respectively. The algorithms we develop enable repetition-free enumeration in polynomial space without being intrusive, i.e., they do not necessitate any modifications of computations before an answer set is found. Our approach to ASP solving is implemented in clasp, a state-of-the-art Boolean constraint solver that has successfully participated in recent solver competitions. Although we do here not address the implementation techniques of clasp or all of its features, we present the principles of its success in the context of ASP solving.
Antwortmengenprogrammierung (engl. Answer Set Programming; ASP) ist ein Paradigma zum deklarativen Problemlösen, wobei Problemstellungen durch logische Programme beschrieben werden, sodass bestimmte Modelle, Antwortmengen genannt, zu Lösungen korrespondieren. Die zunehmenden praktischen Anwendungen von ASP verlangen nach performanten Werkzeugen zum Lösen komplexer Problemstellungen. ASP integriert diverse Konzepte aus verwandten Bereichen. Insbesondere sind automatisierte Techniken für die Suche nach Antwortmengen durch Verfahren zum Lösen des aussagenlogischen Erfüllbarkeitsproblems (engl. Boolean Satisfiability; SAT) inspiriert. Letztere beruhen auf soliden beweistheoretischen Grundlagen, wohingegen es für ASP kaum formale Systeme gibt, um Lösungsmethoden einheitlich zu beschreiben und miteinander zu vergleichen. Weiterhin basiert der Erfolg moderner Verfahren zum Lösen von SAT entscheidend auf fortgeschrittenen Suchtechniken, die in gängigen Methoden zur Antwortmengenberechnung nicht etabliert sind. Diese Arbeit entwickelt beweistheoretische Grundlagen und fortgeschrittene Suchtechniken im Kontext der Antwortmengenberechnung. Unsere formalen Beweissysteme ermöglichen die Charakterisierung, den Vergleich und die Analyse vorhandener Lösungsmethoden für ASP. Außerdem entwerfen wir moderne Verfahren zum Lösen von ASP, die fortgeschrittene Suchtechniken aus dem SAT-Bereich integrieren und erweitern. Damit trägt diese Arbeit sowohl zum tieferen Verständnis von Lösungsmethoden für ASP und ihrer Beziehungen untereinander als auch zu ihrer Verbesserung durch die Erschließung fortgeschrittener Suchtechniken bei. Die zentrale Idee unseres Ansatzes besteht darin, Atome und komposite Konstrukte innerhalb von logischen Programmen gleichermaßen mit aussagenlogischen Variablen zu assoziieren. Dies ermöglicht die Isolierung fundamentaler Inferenzschritte, die wir in formalen Charakterisierungen von Lösungsmethoden für ASP selektiv miteinander kombinieren können. Darauf aufbauend zeigen wir, dass unterschiedliche Einschränkungen von Fallunterscheidungen zwangsläufig zu exponentiellen Effizienzunterschieden zwischen den charakterisierten Methoden führen. Wir generalisieren unseren beweistheoretischen Ansatz auf logische Programme mit erweiterten Sprachkonstrukten und weisen analytisch nach, dass das Treffen bzw. Unterlassen von Fallunterscheidungen auf solchen Konstrukten ebenfalls exponentielle Effizienzunterschiede bedingen kann. Die zuvor beschriebenen fundamentalen Inferenzschritte nutzen wir zur Extraktion inhärenter Bedingungen, denen Antwortmengen genügen müssen. Damit schaffen wir eine Grundlage für den Entwurf moderner Lösungsmethoden für ASP, die fortgeschrittene, ursprünglich für SAT konzipierte, Suchtechniken mit einschließen und darüber hinaus einen transparenten Technologietransfer zwischen Verfahren zum Lösen von ASP und SAT erlauben. Neben der Suche nach einer Antwortmenge behandeln wir ihre Aufzählung, sowohl für gesamte Antwortmengen als auch für Projektionen auf ein Subvokabular. Hierfür entwickeln wir neuartige Methoden, die wiederholungsfreies Aufzählen in polynomiellem Platz ermöglichen, ohne die Suche zu beeinflussen und ggf. zu behindern, bevor Antwortmengen berechnet wurden.

APA, Harvard, Vancouver, ISO, and other styles

40

Mishra-Linger, Richard Nathan. "Irrelevance, Polymorphism, and Erasure in Type Theory." PDXScholar, 2008. https://pdxscholar.library.pdx.edu/open_access_etds/2674.

Full text

Abstract:

Dependent type theory is a proven technology for verified functional programming in which programs and their correctness proofs may be developed using the same rules in a single formal system. In practice, large portions of programs developed in this way have no computational relevance to the ultimate result of the program and should therefore be removed prior to program execution. In previous work on identifying and removing irrelevant portions of programs, computational irrelevance is usually treated as an intrinsic property of program expressions. We find that such an approach forces programmers to maintain two copies of commonly used datatypes: a computationally relevant one and a computationally irrelevant one. We instead develop an extrinsic notion of computational irrelevance and find that it yields several benefits including (1) avoidance of the above mentioned code duplication problem; (2) an identification of computational irrelevance with a highly general form of parametric polymorphism; and (3) an elective (i.e., user-directed) notion of proof irrelevance. We also develop a program analysis for identifying irrelevant expressions and show how previously studied types embodying computational irrelevance (including subset types and squash types) are expressible in the extension of type theory developed herein.

APA, Harvard, Vancouver, ISO, and other styles

41

De, Oliveira Clarissa C. "Designing educational programming tools for the blind: mitigating the inequality of coding in schools." Thesis, Malmö högskola, Fakulteten för kultur och samhälle (KS), 2017. http://urn.kb.se/resolve?urn=urn:nbn:se:mau:diva-22653.

Full text

Abstract:

This design-based research provides design considerations for developing educational tools for teaching programming to blind primary schoolers, as an effort towards more inclusive classrooms, given that the tools available today are not accessible to these students. Existing tools were analyzed and tested, and co-design practices were applied in exploring ‘instructions’ as a main logic operation for computer programming, through experimenting with diverse types of interfaces, having visually impaired participants at the center of the process. Physical and mental patterns, relevant for improving the accessibility of such tools, are unveiled and further discussed in this study.

APA, Harvard, Vancouver, ISO, and other styles

42

Lee, Mark. "Belief, rationality and inference : a general theory of computational pragmatics." Thesis, University of Sheffield, 1998. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.287357.

Full text

APA, Harvard, Vancouver, ISO, and other styles

43

Telford, Alastair J. "Static analysis of Martin-Löf's intuitionistic type theory." Thesis, University of Kent, 1995. https://kar.kent.ac.uk/21246/.

Full text

Abstract:

Martin-Lof's intuitionistic type theory has been under investigation in recent years as a potential source for future functional programming languages. This is due to its properties which greatly aid the derivation of provably correct programs. These include the Curry-Howard correspondence (whereby logical formulas may be seen as specifications and proofs of logical formulas as programs) and strong normalisation (i.e. evaluation of every proof/program must terminate). Unfortunately, a corollary of these properties is that the programs may contain computationally irrelevant proof objects: proofs which are not to be printed as part of the result of a program. We show how a series of static analyses may be used to improve the efficiency of type theory as a lazy functional programming language. In particular we show how variants of abstract interpretation may be used to eliminate unnecessary computations in the object code that results from a type theoretic program. After an informal treatment of the application of abstract interpretation to type theory (where we discuss the features of type theory which make it particularly amenable to such an approach), we give formal proofs of correctness of our abstract interpretation techniques, with regard to the semantics of type theory. We subsequently describe how we have implemented abstract interpretation techniques within the Ferdinand functional language compiler. Ferdinand was developed as a lazy functional programming system by Andrew Douglas at the University of Kent at Canterbury. Finally, we show how other static analysis techniques may be applied to type theory. Some of these techniques use the abstract interpretation mechanisms previously discussed. abstract

APA, Harvard, Vancouver, ISO, and other styles

44

Zhou, Jiantao. "Multimedia lightweight encryption via randomized entropy coding /." View abstract or full-text, 2009. http://library.ust.hk/cgi/db/thesis.pl?ECED%202009%20ZHOU.

Full text

APA, Harvard, Vancouver, ISO, and other styles

45

Tan, Chin-Yong. "DB-Prolog : a database programming environment for computer aided control systems design." Thesis, University of Cambridge, 1990. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.385521.

Full text

APA, Harvard, Vancouver, ISO, and other styles

46

Russ, Samuel H. "An information-theoretic approach to analysis of computer architectures and compression of instruction memory usage." Diss., Georgia Institute of Technology, 1991. http://hdl.handle.net/1853/13357.

Full text

APA, Harvard, Vancouver, ISO, and other styles

47

Seaman, Iris Rubi. "Probabilistic Programming for Theory of Mind for Autonomous Decision Making." BYU ScholarsArchive, 2018. https://scholarsarchive.byu.edu/etd/6826.

Full text

Abstract:

As autonomous agents (such as unmanned aerial vehicles, or UAVs) become more ubiquitous, they are being used for increasingly complex tasks. Eventually, they will have to reason about the mental state of other agents, including those agents' beliefs, desires and goals – so-called Theory of Mind – and make decisions based on that reasoning. We describe increasingly complex theory of mind models of a UAV pursuing an intruder, and show that (1) there is a natural Bayesian formulation to reasoning about the uncertainty inherent in our estimate of another agent's mental state, and that (2) probabilistic programming is a natural way to describe models that involve one agent reasoning about another agent, where the target agent uses complex primitives such as path planners and saliency maps to make decisions. We propose a nested self-normalized importance sampling inference algorithm for probabilistic programs, and show that it can be used with planning-as-inference to simultaneously reason about other agents' plans and craft counter plans. We demonstrate that more complex models lead to improved performance, and that nested modeling manifests a wide variety of rational agent behavior.

APA, Harvard, Vancouver, ISO, and other styles

48

Wood, A. R. "Acoustic-phonetic reasoning in computer understanding of speech using frame-based expert knowledge to interpret the 'Speech Sketch' a representation of the acoustic parametric behaviou." Thesis, Staffordshire University, 1985. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.356461.

Full text

APA, Harvard, Vancouver, ISO, and other styles

49

Remnestål, Albin, and Matteus Hast. "To what extent are first year Computer Science students improving their Java Programming skills, in relation to Java coding conventions." Thesis, KTH, Skolan för datavetenskap och kommunikation (CSC), 2017. http://urn.kb.se/resolve?urn=urn:nbn:se:kth:diva-208536.

Full text

Abstract:

The aim of the paper is to study the development of code quality in ﬁrst year students at the Royal Institute of Technology’s (KTH) Computer Science programme to investigate how they improve their Java programming skills, in relation to ofﬁcial Java coding conventions. The material was collected from two separate course rounds through KTH’s GitHub Enterprise where the students submit their weekly assignments. The Introductory course to Computer Science at KTH does not explicitly choose any code convention to teach their students, and the code quality of the students’ Java source code has never been formally analysed. The result was compiled into graphs showing the progress of code quality, where each graph represent a test taken from ofﬁcial Java coding conventions. The graphs shows no trend of neither increase nor decrease in students skill in relation to code quality. The result shows the problems of analysing code quality when students are given code shells and some students only taking a subset of the assignments. The data shows some minor differences between the course round, but mostly that the data has proven to be inconsistent and ambiguous. This has proven that quantitative analysis on this sort of material to be very difﬁcult. Therefore, a reliable answer can not be given to the investigation on to what extent students are improving their Java programming skills during their ﬁrst year.
Målet med den här rapporten är att studera kodkvalitén på förstaårsstudenter på Kungliga Tekniska Högskolans (KTH) Datateknikprogram och om de förbättrar deras Java programmeringskompetens, med syfte på officiella Java kodstilar. Materialet är hämtat från två skilda kursomgångar genom KTHs GitHub Enterprise där studenterna har lämnat in sina inlämningar veckovis. Introduktion till datatekniks-kursen påvisar ingen specifik kodstil på studenterna som tar kursen och kodkvalitén på Java källkod har aldrig blivit analyserad formellt. Resultatet är sammanställt i grafer som visar utvecklingen av kodkvalitén, där varje graf representerar ett test taget från officiella Java kodstilar. Graferna visar varken en ökning eller en minskning i studenternas skicklighet i hänsyn till kodkvalité. Resultatet visar problemet med att analysera kodkvalité när studenter givna kodskelett och vissa studenter endast gör en delmängd av alla inlämningar. Datan visar på att det finns några mindre olikheter mellan de två kursomgångarna, men mestadels det att datan har bevisats att vara inkonsekvent och tvetydlig. Detta har bevisat att en kvantitav analys av den här sorten är väldigt svår att utföra på den här typen av material. Därför kan inte ett pålitligt svar ges till undersökning på till vilken grad studenter, under sitt första år, förbättrar sina Java programmeringsfärdigheter.

APA, Harvard, Vancouver, ISO, and other styles

50

Beirami, Ahmad. "Characterizing the redundancy of universal source coding for finite-length sequences." Thesis, Georgia Institute of Technology, 2011. http://hdl.handle.net/1853/45750.

Full text

Abstract:

In this thesis, we first study what is the average redundancy resulting from the universal compression of a single finite-length sequence from an unknown source. In the universal compression of a source with d unknown parameters, Rissanen demonstrated that the expected redundancy for regular codes is asymptotically d/2 log n + o(log n) for almost all sources, where n is the sequence length. Clarke and Barron also derived the asymptotic average minimax redundancy for memoryless sources. The average minimax redundancy is concerned with the redundancy of the worst parameter vector for the best code. Thus, it does not provide much information about the effect of the different source parameter values. Our treatment in this thesis is probabilistic. In particular, we derive a lower bound on the probability measure of the event that a sequence of length n from an FSMX source chosen using Jeffreys' prior is compressed with a redundancy larger than a certain fraction of d/2 log n. Further, our results show that the average minimax redundancy provides good estimate for the average redundancy of most sources for large enough n and d. On the other hand, when the source parameter d is small the average minimax redundancy overestimates the average redundancy for small to moderate length sequences. Additionally, we precisely characterize the average minimax redundancy of universal coding when the coding scheme is restricted to be from the family of two--stage codes, where we show that the two--stage assumption incurs a negligible redundancy for small and moderate length n unless the number of source parameters is small. %We show that redundancy is significant in the compression of small sequences. Our results, collectively, help to characterize the non-negligible redundancy resulting from the compression of small and moderate length sequences. Next, we apply these results to the compression of a small to moderate length sequence provided that the context present in a sequence of length M from the same source is memorized. We quantify the achievable performance improvement in the universal compression of the small to moderate length sequence using context memorization.

APA, Harvard, Vancouver, ISO, and other styles

Dissertations / Theses on the topic 'Computer programming. Coding theory'

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