Dissertations / Theses on the topic 'Synthesis of Probabilistic Programs'
Create a spot-on reference in APA, MLA, Chicago, Harvard, and other styles
Consult the top 50 dissertations / theses for your research on the topic 'Synthesis of Probabilistic Programs.'
Next to every source in the list of references, there is an 'Add to bibliography' button. Press on it, and we will generate automatically the bibliographic reference to the chosen work in the citation style you need: APA, MLA, Harvard, Chicago, Vancouver, etc.
You can also download the full text of the academic publication as pdf and read online its abstract whenever available in the metadata.
Browse dissertations / theses on a wide variety of disciplines and organise your bibliography correctly.
Escalante, Marco Antonio. "Probabilistic timing verification and timing analysis for synthesis of digital interface controllers." Thesis, National Library of Canada = Bibliothèque nationale du Canada, 1998. http://www.collectionscanada.ca/obj/s4/f2/dsk2/tape17/PQDD_0023/NQ36637.pdf.
Full textGretz, Friedrich Verfasser], Joost-Pieter [Akademischer Betreuer] [Katoen, and Sriram [Akademischer Betreuer] Sankaranarayanan. "Semantics and loop invariant synthesis for probabilistic programs / Friedrich Gretz ; Joost-Pieter Katoen, Sriram Sankaranarayanan." Aachen : Universitätsbibliothek der RWTH Aachen, 2016. http://d-nb.info/1126278491/34.
Full textGretz, Friedrich [Verfasser], Joost-Pieter [Akademischer Betreuer] Katoen, and Sriram [Akademischer Betreuer] Sankaranarayanan. "Semantics and loop invariant synthesis for probabilistic programs / Friedrich Gretz ; Joost-Pieter Katoen, Sriram Sankaranarayanan." Aachen : Universitätsbibliothek der RWTH Aachen, 2016. http://d-nb.info/1126278491/34.
Full textSchoner, Bernd 1969. "Probabilistic characterization and synthesis of complex driven systems." Thesis, Massachusetts Institute of Technology, 2000. http://hdl.handle.net/1721.1/62352.
Full textIncludes bibliographical references (leaves 194-204).
Real-world systems that have characteristic input-output patterns but don't provide access to their internal states are as numerous as they are difficult to model. This dissertation introduces a modeling language for estimating and emulating the behavior of such systems given time series data. As a benchmark test, a digital violin is designed from observing the performance of an instrument. Cluster-weighted modeling (CWM), a mixture density estimator around local models, is presented as a framework for function approximation and for the prediction and characterization of nonlinear time series. The general model architecture and estimation algorithm are presented and extended to system characterization tools such as estimator uncertainty, predictor uncertainty and the correlation dimension of the data set. Furthermore a real-time implementation, a Hidden-Markov architecture, and function approximation under constraints are derived within the framework. CWM is then applied in the context of different problems and data sets, leading to architectures such as cluster-weighted classification, cluster-weighted estimation, and cluster-weighted sampling. Each application relies on a specific data representation, specific pre and post-processing algorithms, and a specific hybrid of CWM. The third part of this thesis introduces data-driven modeling of acoustic instruments, a novel technique for audio synthesis. CWM is applied along with new sensor technology and various audio representations to estimate models of violin-family instruments. The approach is demonstrated by synthesizing highly accurate violin sounds given off-line input data as well as cello sounds given real-time input data from a cello player.
by Bernd Schoner.
Ph.D.
Stupinský, Šimon. "Pokročilé metody pro syntézu pravděpodobnostních programů." Master's thesis, Vysoké učení technické v Brně. Fakulta informačních technologií, 2021. http://www.nusl.cz/ntk/nusl-445587.
Full textMarcin, Vladimír. "GPU-akcelerovná syntéza pravděpodobnostních programů." Master's thesis, Vysoké učení technické v Brně. Fakulta informačních technologií, 2021. http://www.nusl.cz/ntk/nusl-445566.
Full textAngelopoulos, Nicos. "Probabilistic finite domains." Thesis, City University London, 2001. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.342823.
Full textFaria, Francisco Henrique Otte Vieira de. "Learning acyclic probabilistic logic programs from data." Universidade de São Paulo, 2017. http://www.teses.usp.br/teses/disponiveis/3/3141/tde-27022018-090821/.
Full textO aprendizado de um programa lógico probabilístico consiste em encontrar um conjunto de regras lógico-probabilísticas que melhor se adequem aos dados, a fim de explicar de que forma estão relacionados os atributos observados e predizer a ocorrência de novas instanciações destes atributos. Neste trabalho focamos em programas acíclicos, cujo significado é bastante claro e fácil de interpretar. Propõe-se que o processo de aprendizado de programas lógicos probabilísticos acíclicos deve ser guiado por funções de avaliação importadas da literatura de aprendizado de redes Bayesianas. Neste trabalho s~ao sugeridas novas técnicas para aprendizado de parâmetros que contribuem para uma melhora significativa na eficiência computacional do estado da arte representado pelo pacote ProbLog. Além disto, apresentamos novas técnicas para aprendizado da estrutura de programas lógicos probabilísticos acíclicos.
Paige, Timothy Brooks. "Automatic inference for higher-order probabilistic programs." Thesis, University of Oxford, 2016. https://ora.ox.ac.uk/objects/uuid:d912c4de-4b08-4729-aa19-766413735e2a.
Full textCrubillé, Raphaëlle. "Behavioural distances for probabilistic higher-order programs." Thesis, Sorbonne Paris Cité, 2019. http://www.theses.fr/2019USPCC084.
Full textThe present thesis is devoted to the study of behavioral equivalences and distances for higher-order probabilistic programs. The manuscript is divided into three parts. In the first one, higher-order probabilistic languages are presented, as well as how to compare such programs with context equivalence and context distance.The second part follows an operational approach in the aim of building equivalences and metrics easier to handle as their contextual counterparts. We take as starting point here the two behavioral equivalences introduced by Dal Lago, Sangiorgi and Alberti for the probabilistic lambda-calculus equipped with a call-by-name evaluation strategy: the trace equivalence and the bisimulation equivalence. These authors showed that for their language, trace equivalence completely characterizes context equivalence—i.e. is fully abstract, while probabilistic bisimulation is a sound approximation of context equivalence, but is not fully abstract. In the operational part of the present thesis, we show that probabilistic bisimulation becomes fully abstract when we replace the call-by-name paradigm by the call-by-value one. The remainder of this part is devoted to a quantitative generalization of trace equivalence, i.e. a trace distance on programs. We introduce first e trace distance for an affine probabilistic lambda-calculus—i.e. where a function can use its argument at most once, and then for a more general probabilistic lambda-calculus where functions have the ability to duplicate their arguments. In these two cases, we show that these trace distances are fully abstract.In the third part, two denotational models of higher-order probabilistic languages are considered: the Danos and Ehrhard's model based on probabilistic coherence spaces that interprets the language PCF enriched with discrete probabilities, and the Ehrhard, Pagani and Tasson's one based on measurable cones and measurable stable functions that interpret PCF equipped with continuous probabilities. The present thesis establishes two results on these models structure. We first show that the exponential comonad of the category of probabilistic coherent spaces can be expressed using the free commutative comonoid: it consists in a genericity result for this category seen as a model of Linear Logic. The second result clarify the connection between these two models: we show that the category of measurable cones and measurable stable functions is a conservative extension of the co-Kleisli category of probabilistic coherent spaces. It means that the recently introduced model of Ehrhard, Pagani and Tasson can be seen as the generalization to the continuous case of the model for PCF with discrete probabilities in probabilistic coherent spaces
Kwan, Victor. "A predicative model for probabilistic specifications and programs." Thesis, National Library of Canada = Bibliothèque nationale du Canada, 1998. http://www.collectionscanada.ca/obj/s4/f2/dsk1/tape10/PQDD_0027/MQ40745.pdf.
Full textStuhlmüller, Andreas. "Modeling cognition with probabilistic programs : representations and algorithms." Thesis, Massachusetts Institute of Technology, 2015. http://hdl.handle.net/1721.1/100860.
Full textThis 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 167-176).
This thesis develops probabilistic programming as a productive metaphor for understanding cognition, both with respect to mental representations and the manipulation of such representations. In the first half of the thesis, I demonstrate the representational power of probabilistic programs in the domains of concept learning and social reasoning. I provide examples of richly structured concepts, defined in terms of systems of relations, subparts, and recursive embeddings, that are naturally expressed as programs and show initial experimental evidence that they match human generalization patterns. I then proceed to models of reasoning about reasoning, a domain where the expressive power of probabilistic programs is necessary to formalize our intuitive domain understanding due to the fact that, unlike previous formalisms, probabilistic programs allow conditioning to be represented in a model, not just applied to a model. I illustrate this insight with programs that model nested reasoning in game theory, artificial intelligence, and linguistics. In the second half, I develop three inference algorithms with the dual intent of showing how to efficiently compute the marginal distributions defined by probabilistic programs, and providing building blocks for process-level accounts of human cognition. First, I describe a Dynamic Programming algorithm for computing the marginal distribution of discrete probabilistic programs by compiling to systems of equations and show that it can make inference in models of "reasoning about reasoning" tractable by merging and reusing subcomputations. Second, I introduce the setting of amortized inference and show how learning inverse models lets us leverage samples generated by other inference algorithms to compile probabilistic models into fast recognition functions. Third, I develop a generic approach to coarse-to-fine inference in probabilistic programs and provide evidence that it can speed up inference in models with large state spaces that have appropriate hierarchical structure. Finally, I substantiate the claim that probabilistic programming is a productive metaphor by outlining new research questions that have been opened up by this line of investigation.
by Andreas Stuhlmüller.
Ph. D.
Bone, Nicholas. "Models of programs and machine learning." Thesis, University of Oxford, 1998. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.244565.
Full textAndriushchenko, Roman. "Computer-Aided Synthesis of Probabilistic Models." Master's thesis, Vysoké učení technické v Brně. Fakulta informačních technologií, 2020. http://www.nusl.cz/ntk/nusl-417269.
Full textBORGES, Mateus Araújo. "Techniques to facilitate probabilistic software analysis in real-world programs." Universidade Federal de Pernambuco, 2015. https://repositorio.ufpe.br/handle/123456789/14932.
Full textMade available in DSpace on 2016-01-19T17:42:17Z (GMT). No. of bitstreams: 2 license_rdf: 1232 bytes, checksum: 66e71c371cc565284e70f40736c94386 (MD5) dissertation.pdf: 864300 bytes, checksum: 624346f890c947cf26d691a5fc74d707 (MD5) Previous issue date: 2015-04-24
FACEPE
Probabilistic software analysis aims at quantifying how likely a target event is to occur, given a probabilistic characterization of the behavior of a program or of its execution environment. Examples of target events may include an uncaught exception, the invocation of a certain method, or the access to confidential information. The technique collects constraints on the inputs that lead to the target events and analyzes them to quantify how likely it is for an input to satisfy the constraints. Current techniques either handle only linear constraints or only support continuous distributions using a “discretization” of the input domain, leading to imprecise and costly results. This work proposes an iterative distribution-aware sampling approach to support probabilistic symbolic execution for arbitrarily complex mathematical constraints and continuous input distributions. We follow a compositional approach, where the symbolic constraints are decomposed into sub-problems whose solution can be solved independently. At each iteration the convergence rate of the computation is increased by automatically refocusing the analysis on estimating the sub-problems that mostly affect the accuracy of the results, as guided by three different ranking strategies. Experiments on publicly available benchmarks show that the proposed technique improves on previous approaches in terms of scalability and accuracy of the results.
Análise Probabilística de Software (PSA) visa a quantificar a probabilidade de que um evento de interesse seja alcançado durante a execução de um programa, dada uma caracterização probabilística do comportamento do programa ou do seu ambiente de execução. O evento de interesse pode ser, por exemplo, uma exceção não capturada, a invocação de um método específico, ou o acesso à informação confidencial. A técnica coleta restrições sobre as entradas que levam para os eventos de interesse e as analisa para quantificar o quão provável que uma entrada satisfaça essas restrições. Técnicas atuais ou suportam apenas restrições lineares, ou suportam distribuições contínuas utilizando uma "discretização" do domínio de entrada, levando a resultados imprecisos e caros. Este trabalho apresenta uma abordagem iterativa, composicional e sensível às distribuições para suportar o uso de PSA em restrições com operações matemáticas arbitrariamente complexas e distribuições contínuas de entrada. Nossa abordagem composicional permite que as restrições sejam decompostas em subproblemas que podem ser resolvidos independentemente. Em cada iteração a análise é reorientada automaticamente para a estimação dos subproblemas que mais afetam a precisão dos resultados, assim aumentando a taxa de convergência da computação. Esta reorientação é guiada por três diferentes estratégias de ranqueamento. Experimentos em programas publicamente disponíveis mostram que a técnica proposta é melhor do que abordagens existentes em termos de escalabilidade e precisão.
Shannon, Sean Matthew. "Probabilistic acoustic modelling for parametric speech synthesis." Thesis, University of Cambridge, 2014. https://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.708415.
Full textSakai, Shinsuke. "A Probabilistic Approach to Concatenative Speech Synthesis." 京都大学 (Kyoto University), 2012. http://hdl.handle.net/2433/152508.
Full textJaniuk, Ludvig, and Johan Sjölén. "Probabilistic Least-violating Control Strategy Synthesis with Safety Rules." Thesis, KTH, Skolan för elektroteknik och datavetenskap (EECS), 2018. http://urn.kb.se/resolve?urn=urn:nbn:se:kth:diva-229867.
Full textVi undersöker automatisk kontrollstrategisyntes (automatic control strategy synthesis) av diskreta robotsystem där målet för roboten är att färdas från en region till en annan medan den följer en mängd säkerhetsregler i en miljö med probabilistiskt osäkra egenskaper. Detta är en uppföljning av arbete gjort av Jana Tumová et al. Vi utvidgar deras arbete genom att modifiera strategisyntesalgoritmen så att den kan hantera probabilistiska situationer. Vårt första bidrag är ett sätt att modellera probabilistiska situationer i en karta genom en så kallad "markov decision process" med en specifik struktur som vi kallar för "Ghost States" (spöktillstånd). Vi bidrar även med ett sätt att konstruera en produktautomat som är analog till originalarbetets produktautomat. På vår produktautomat kan en probabilistisk variant av Dijkstras algoritm köras för att framställa en plan som är "least-violating" (bryter mot säkerhetsreglerna minst). Resultatet är en syntesalgorithm som fungerar som originalet men som även kan hantera stokastiska osäkerheter. Syntesalgoritmen skulle till exempel kunna användas i de fall där ovissa väderlekar eller beteendet av externa aktörer kan modelleras som stokastiska variabler.
Ujma, Mateusz. "On verification and controller synthesis for probabilistic systems at runtime." Thesis, University of Oxford, 2015. https://ora.ox.ac.uk/objects/uuid:9433e3ed-ad05-4f4e-8dbb-507a09283a02.
Full textMatthews, Brett Alexander. "Probabilistic modeling of neural data for analysis and synthesis of speech." Diss., Georgia Institute of Technology, 2012. http://hdl.handle.net/1853/50116.
Full textSchroeder, Deborah. "Development of computer programs to aid synthesis planning." Thesis, University of Leeds, 1989. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.329976.
Full textZiyuan, Jiang. "Synthesis of GPU Programs from High-Level Models." Thesis, KTH, Skolan för elektroteknik och datavetenskap (EECS), 2018. http://urn.kb.se/resolve?urn=urn:nbn:se:kth:diva-230163.
Full textModerna grafikbehandlingsenheter (GPU) tillhandahåller högpresterande generella syftes-beräkningsförmågor. De har massiva parallella arkitekturer som är lämpliga för att utföra parallella algoritmer och operationer. De är också streaminriktade enheter som är optimerade för att uppnå hög streaming för streamingbehandling. Att utforma effektiva GPU-program är en notoriskt svårt uppgift. ForSyDe-metoden är lämplig för att underlätta svårigheterna med GPU-programmering. Metodiken uppmuntrar mjukvaruutveckling från en hög nivå av abstraktion för att sedan omvandla den abstrakta modellen till en implementering genom en rad formella metoder. De befintliga ForSyDe-modellerna stöder synkron dataflöde (SDF) modell av beräkning (MoC) som är lämplig för modellering av streaming-beräkningar och är bra för att syntetisera effektiv streaming-bearbetningsprogram. Det finns också högkvalitativa designmodeller som kallas parallella mönster vilka är lämpliga för att representera parallella algoritmer och operationer. Avhandlingen analyserar metoden för modellering av parallella algoritmer med parallella mönster, och utforskar sättet att syntetisera effektiv OpenCL-implementering för GPU för parallella mönster. Avhandlingen försöker även att möjliggöra integration av parallella mönster i ForSyDe SDF-modellen för att modellera streaming parallella operationer. Ett automationsbibliotek som hjälper till att designa stream-program för parallella algoritmer som riktar sig mot GPU:er är avsedda för avhandlingsprojektet. Flera experiment utförs för att utvärdera effektiviteten hos det föreslagna biblioteket avseende implementering av högnivåmodellen.
Kaminski, Benjamin Lucien [Verfasser], Joost-Pieter [Akademischer Betreuer] Katoen, and Annabelle [Akademischer Betreuer] McIver. "Advanced weakest precondition calculi for probabilistic programs / Benjamin Lucien Kaminski ; Joost-Pieter Katoen, Annabelle McIver." Aachen : Universitätsbibliothek der RWTH Aachen, 2019. http://d-nb.info/1191375323/34.
Full textDeena, Salil Prashant. "Visual speech synthesis by learning joint probabilistic models of audio and video." Thesis, University of Manchester, 2012. https://www.research.manchester.ac.uk/portal/en/theses/visual-speech-synthesis-by-learning-joint-probabilistic-models-of-audio-and-video(bdd1a78b-4957-469e-8be4-34e83e676c79).html.
Full textDIAS, DOUGLAS MOTA. "AUTOMATIC SYNTHESIS OF DIGITAL MICROCONTROLLER PROGRAMS BY GENETIC PROGRAMMING." PONTIFÍCIA UNIVERSIDADE CATÓLICA DO RIO DE JANEIRO, 2005. http://www.maxwell.vrac.puc-rio.br/Busca_etds.php?strSecao=resultado&nrSeq=6666@1.
Full textEsta dissertação investiga o uso de programação genética linear na síntese automática de programas em linguagem de montagem para microcontroladores, que implementem estratégias de controle de tempo ótimo ou sub-ótimo, do sistema a ser controlado, a partir da modelagem matemática por equações dinâmicas. Uma das dificuldades encontradas no projeto convencional de um sistema de controle ótimo é que soluções para este tipo de problema normalmente implicam em uma função altamente não-linear das variáveis de estado do sistema. Como resultado, várias vezes não é possível encontrar uma solução matemática exata. Já na implementação, surge a dificuldade de se ter que programar manualmente o microcontrolador para executar o controle desejado. O objetivo deste trabalho foi, portanto, contornar tais dificuldades através de uma metodologia que, a partir da modelagem matemática de uma planta, fornece como resultado um programa em linguagem de montagem. O trabalho consistiu no estudo sobre os possíveis tipos de representações para a manipulação genética de programas em linguagem de montagem, tendo sido concluído que a linear é a mais adequada, e na implementação de uma ferramenta para realizar os três estudos de caso: water bath, cart centering e pêndulo invertido. O desempenho de controle dos programas sintetizados foi comparado com o dos sistemas obtidos por outros métodos (redes neurais, lógica fuzzy, sistemas neurofuzzy e programação genética). Os programas sintetizados demonstraram, no mínimo, o mesmo desempenho, mas com a vantagem adicional de fornecerem a solução já no formato final da plataforma de implementação escolhida: um microcontrolador.
This dissertation investigates the use of genetic programming in automatic synthesis of assembly language programs for microcontrollers, which implement time-optimal or sub-optimal control strategies of the system to be controlled, from the mathematical modeling by dynamic equations. One of the issues faced in conventional design of an optimal control system is that solutions for this kind of problem commonly involve a highly nonlinear function of the state variables of the system. As a result, frequently it is not possible to find an exact mathematical solution. On the implementation side, the difficulty comes when one has to manually program the microcontroller to run the desired control. Thus, the objective of this work was to overcome these difficulties applying a methodology that, starting from the mathematical modeling of a plant, provides as result an assembly language microcontroller program. The work included a study of the possible types of genetic representation for the manipulation of assembly language programs. In this regard, it has been concluded that the linear is the most suitable representation. The work also included the implementation of a tool to accomplish three study cases: water bath, cart centering and inverted pendulum. The performance of control of the synthesized programs was compared with the one obtained by other methods (neural networks, fuzzy logic, neurofuzzy systems and genetic programming). The synthesized programs achieved at least the same performance of the other systems, with the additional advantage of already providing the solution in the final format of the chosen implementation platform: a microcontroller.
Gao, Xitong. "Structural optimization of numerical programs for high-level synthesis." Thesis, Imperial College London, 2016. http://hdl.handle.net/10044/1/42498.
Full textISHII, Katsuya, Hiroaki TAKADA, Shinya HONDA, Hiroyuki TOMIYAMA, and Yuko HARA. "Function-Level Partitioning of Sequential Programs for Efficient Behavioral Synthesis." Institute of Electronics, Information and Communication Engineers, 2007. http://hdl.handle.net/2237/15031.
Full textLewis, Matt. "Precise verification of C programs." Thesis, University of Oxford, 2014. http://ora.ox.ac.uk/objects/uuid:34b5ed5a-160b-4e2c-8dac-eab62a24f78c.
Full textBrown, Andrew Michael. "Development of a probabilistic dynamic synthesis method for the analysis of non-deterministic structures." Diss., Georgia Institute of Technology, 1998. http://hdl.handle.net/1853/19065.
Full textPaçacı, Görkem. "Representation of Compositional Relational Programs." Doctoral thesis, Uppsala universitet, Informationssystem, 2017. http://urn.kb.se/resolve?urn=urn:nbn:se:uu:diva-317084.
Full textBathon, Leander Anton. "Probabilistic Determination of Failure Load Capacity Variations for Lattice Type Structures Based on Yield Strength Variations including Nonlinear Post-Buckling Member Performance." PDXScholar, 1992. https://pdxscholar.library.pdx.edu/open_access_etds/1225.
Full textTremamunno, Luca. "A framework for distributed synthesis of programs from input-output examples." Master's thesis, Alma Mater Studiorum - Università di Bologna, 2021.
Find full textMilligan, Peter. "The synthesis of parallel programs : with specific application to text processing." Thesis, Queen's University Belfast, 1986. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.317085.
Full textHark, Marcel [Verfasser], Jürgen [Akademischer Betreuer] Giesl, and Laura [Akademischer Betreuer] Kovács. "Towards complete methods for automatic complexity and termination analysis of (probabilistic) programs / Marcel Tobias Hark ; Jürgen Giesl, Laura Kovács." Aachen : Universitätsbibliothek der RWTH Aachen, 2021. http://d-nb.info/1239181108/34.
Full textBaudisch, Daniel [Verfasser], and Klaus [Akademischer Betreuer] Schneider. "Synthesis of Synchronous Programs to Parallel Software Architectures / Daniel Baudisch. Betreuer: Klaus Schneider." Kaiserslautern : Technische Universität Kaiserslautern, 2014. http://d-nb.info/1053959281/34.
Full textAbid, Mariem. "System-Level Hardwa Synthesis of Dataflow Programs with HEVC as Study Use Case." Thesis, Rennes, INSA, 2016. http://www.theses.fr/2016ISAR0002/document.
Full textImage and video processing applications are characterized by the processing of a huge amount of data. The design of such complex applications with traditional design methodologies at lowlevel of abstraction causes increasing development costs. In order to resolve the above mentioned challenges, Electronic System Level (ESL) synthesis or High-Level Synthesis (HLS) tools were proposed. The basic premise is to model the behavior of the entire system using high level specifications, and to enable the automatic synthesis to low-level specifications for efficient implementation in Field-Programmable Gate array (FPGA). However, the main downside of the HLS tools is the lack of the entire system consideration, i.e. the establishment of the communications between these components to achieve the system-level is not yet considered. The purpose of this thesis is to raise the level of abstraction in the design of embedded systems to the system-level. A novel design flow was proposed that enables an efficient hardware implementation of video processing applications described using a Domain Specific Language (DSL) for dataflow programming. The design flow combines a dataflow compiler for generating C-based HLS descriptions from a dataflow description and a C-to-gate synthesizer for generating Register-Transfer Level (RTL) descriptions. The challenge of implementing the communication channels of dataflow programs relying on Model of Computation (MoC) in FPGA is the minimization of the communication overhead. In this issue, we introduced a new interface synthesis approach that maps the large amounts of data that multimedia and image processing applications process, to shared memories on the FPGA. This leads to a tremendous decrease in the latency and an increase in the throughput. These results were demonstrated upon the hardware synthesis of the emerging High-Efficiency Video Coding (HEVC) standard
Henter, Gustav Eje. "Probabilistic Sequence Models with Speech and Language Applications." Doctoral thesis, KTH, Kommunikationsteori, 2013. http://urn.kb.se/resolve?urn=urn:nbn:se:kth:diva-134693.
Full textQC 20131128
ACORNS: Acquisition of Communication and Recognition Skills
LISTA – The Listening Talker
Chen, Dong [Verfasser], Martin [Akademischer Betreuer] Buss, Tamim [Gutachter] Asfour, and Martin [Gutachter] Buss. "Probabilistic Grasping for Mobile Manipulation Systems: Skills, Synthesis and Control / Dong Chen ; Gutachter: Tamim Asfour, Martin Buss ; Betreuer: Martin Buss." München : Universitätsbibliothek der TU München, 2020. http://d-nb.info/1220831212/34.
Full textDemetriou, Christodoulos S. "A PC implemented kinematic synthesis system for planar linkages." Thesis, Virginia Polytechnic Institute and State University, 1987. http://hdl.handle.net/10919/101343.
Full textM.S.
Cartwright, Lauren Ashley. "The Influence of Conservation Programs on Residential Water Demand: Synthesis and Analysis for Shared Vision Planning in the Rappahannock River Basin." Thesis, Virginia Tech, 2002. http://hdl.handle.net/10919/30824.
Full textMaster of Science
DeMeo, Stephen. "Investigating chemical change in the laboratory : a curriculum resource for introductory chemistry teachers based on the synthesis, decomposition and analysis of zinc iodide /." Access Digital Full Text version, 1994. http://pocketknowledge.tc.columbia.edu/home.php/bybib/11624553.
Full textIncludes tables. Typescript; issued also on microfilm. Sponsor: Jean Lythcott. Dissertation Committee: Roger O. Anderson. Includes bibliographical references (leaves 174-186).
Najahi, Mohamed amine. "Synthesis of certified programs in fixed-point arithmetic, and its application to linear algebra basic blocks : and its application to linear algebra basic blocks." Thesis, Perpignan, 2014. http://www.theses.fr/2014PERP1212.
Full textTo be cost effective, embedded systems are shipped with low-end micro-processors. These processors are dedicated to one or few tasks that are highly demanding on computational resources. Examples of widely deployed tasks include the fast Fourier transform, convolutions, and digital filters. For these tasks to run efficiently, embedded systems programmers favor fixed-point arithmetic over the standardized and costly floating-point arithmetic. However, they are faced with two difficulties: First, writing fixed-point codes is tedious and requires that the programmer must be in charge of every arithmetical detail. Second, because of the low dynamic range of fixed-point numbers compared to floating-point numbers, there is a persistent belief that fixed-point computations are inherently inaccurate. The first part of this thesis addresses these two limitations as follows: It shows how to design and implement tools to automatically synthesize fixed-point programs. Next, to strengthen the user's confidence in the synthesized codes, analytic methods are suggested to generate certificates. These certificates can be checked using a formal verification tool, and assert that the rounding errors of the generated codes are indeed below a given threshold. The second part of the thesis is a study of the trade-offs involved when generating fixed-point code for linear algebra basic blocks. It gives experimental data on fixed-point synthesis for matrix multiplication and matrix inversion through Cholesky decomposition
Cernetic, Linda K. "A Best Evidence Analysis and Synthesis of Research on Teacher Mentoring Programs for the Entry Year Teacher in the Public Elementary and Secondary Schools." Cedarville University / OhioLINK, 2003. http://rave.ohiolink.edu/etdc/view?acc_num=cedar1065447034.
Full textPoernomo, Iman Hafiz 1976. "Variations on a theme of Curry and Howard : the Curry-Howard isomorphism and the proofs-as-programs paradigm adapted to imperative and structured program synthesis." Monash University, School of Computer Science and Software Engineering, 2003. http://arrow.monash.edu.au/hdl/1959.1/9405.
Full textAugaitis, Darius. "Programų sintezė lygiagrečiuoju programavimo metodu." Master's thesis, Lithuanian Academic Libraries Network (LABT), 2008. http://vddb.library.lt/obj/LT-eLABa-0001:E.02~2008~D_20080929_141449-26019.
Full textGoals of this work are: to analyze, make project of visual scenario language, which will provide ability for user easily create complicated programs for Grid system with drawing method, to analyze and make project of graphical user interface for the Grid system with ability to write program source, to analyze the Grid systems limitations and suggest alternative solution.
Zhang, Jie, Michael R. Mayton, and John J. Wheeler. "Effectiveness of Gluten-Free and Casein-Free Diets for Individuals with Autism Spectrum Disorders: An Evidence-Based Research Synthesis." Digital Commons @ East Tennessee State University, 2013. https://dc.etsu.edu/etsu-works/317.
Full textDannenberg, Frits Gerrit Willem. "Modelling and verification for DNA nanotechnology." Thesis, University of Oxford, 2016. https://ora.ox.ac.uk/objects/uuid:a0b5343b-dcee-44ff-964b-bdf5a6f8a819.
Full textCordier, Nicolas. "Approches multi-atlas fondées sur l'appariement de blocs de voxels pour la segmentation et la synthèse d'images par résonance magnétique de tumeurs cérébrales." Thesis, Nice, 2015. http://www.theses.fr/2015NICE4111/document.
Full textThis thesis focuses on the development of automatic methods for the segmentation and synthesis of brain tumor Magnetic Resonance images. The main clinical perspective of glioma segmentation is growth velocity monitoring for patient therapy management. To this end, the thesis builds on the formalization of multi-atlas patch-based segmentation with probabilistic graphical models. A probabilistic model first extends classical multi-atlas approaches used for the segmentation of healthy brains structures to the automatic segmentation of pathological cerebral regions. An approximation of the marginalization step replaces the concept of local search windows with a stratification with respect to both atlases and labels. A glioma detection model based on a spatially-varying prior and patch pre-selection criteria are introduced to obtain competitive running times despite patch matching being non local. This work is validated and compared to state-of-the-art algorithms on publicly available datasets. A second probabilistic model mirrors the segmentation model in order to synthesize realistic MRI of pathological cases, based on a single label map. A heuristic method allows to solve for the maximum a posteriori and to estimate uncertainty of the image synthesis model. Iterating patch matching reinforces the spatial coherence of synthetic images. The realism of our synthetic images is assessed against real MRI, and against outputs of the state-of-the-art method. The junction of a tumor growth model to the proposed synthesis approach allows to generate databases of annotated synthetic cases
Dickert, Jörg. "Synthese von Zeitreihen elektrischer Lasten basierend auf technischen und sozialen Kennzahlen." Doctoral thesis, Saechsische Landesbibliothek- Staats- und Universitaetsbibliothek Dresden, 2016. http://nbn-resolving.de/urn:nbn:de:bsz:14-qucosa-204629.
Full textDistributed generation and novel loads such as electric vehicles and heat pumps require the development towards active distribution networks. Load curves are needed for the appropriate design process. This thesis presents a feasible and expandable synthesis of load curves, which is performed exemplary on residential customers with a period under review of 1 year and time steps of as little as 30 s. The data is collected for up-to-date appliances and current statics examining the way of life. The main focus lies on the input data for the synthesis and distinguishes between technical and social factors. Some thirty home appliances have been analyzed and are classified into five appliance classes by incorporating switching operations and power consumptions. The active power is the key figure for the technical perspective and the data is derived from manufacturer information. For the social perspective six different customer types are defined. They differ in sizes of household and housekeeping. The social key figures are appliance penetration rate and depending on the appliance class the turn-on time, turn-off time, operating duration or cycle duration. The elaborated two-stage synthesis is efficiently implemented in Matlab®. First, artificial load curves are created for each appliance of the households under consideration of the appliance class. In the second step, the individual load curves of the appliances are combined to load curves per line conductor. The algorithms have been validated in the implementation process by retracing the input data in the load curves. Also, the feasibility of the results is shown by comparing the key figures maximum load and power consumption to data in literature. The generated load curves allow for unsymmetrical calculations of distribution systems and can be used for probabilistic investigations of the charging of electric vehicles, the sizing of thermal storage combined with heat pumps or the integration of battery storage systems. A main advantage is the possibility to estimate the likelihood of operating conditions. The enhancement to further appliances and the changeability of the input data allows for versatile further possible investigations
Slezák, Josef. "Evoluční syntéza analogových elektronických obvodů s využitím algoritmů EDA." Doctoral thesis, Vysoké učení technické v Brně. Fakulta elektrotechniky a komunikačních technologií, 2014. http://www.nusl.cz/ntk/nusl-233666.
Full text