To see the other types of publications on this topic, follow the link: Recursive programming.
Dissertations / Theses on the topic 'Recursive programming'
Create a spot-on reference in APA, MLA, Chicago, Harvard, and other styles
Consult the top 46 dissertations / theses for your research on the topic 'Recursive programming.'
Next to every source in the list of references, there is an 'Add to bibliography' button. Press on it, and we will generate automatically the bibliographic reference to the chosen work in the citation style you need: APA, MLA, Harvard, Chicago, Vancouver, etc.
You can also download the full text of the academic publication as pdf and read online its abstract whenever available in the metadata.
Browse dissertations / theses on a wide variety of disciplines and organise your bibliography correctly.
1
Diehl, Larry. "Fully Generic Programming Over Closed Universes of Inductive-Recursive Types." PDXScholar, 2017. https://pdxscholar.library.pdx.edu/open_access_etds/3647.
Full textAbstract:
Dependently typed programming languages allow the type system to express arbitrary propositions of intuitionistic logic, thanks to the Curry-Howard isomorphism. Taking full advantage of this type system requires defining more types than usual, in order to encode logical correctness criteria into the definitions of datatypes. While an abundance of specialized types helps ensure correctness, it comes at the cost of needing to redefine common functions for each specialized type. This dissertation makes an effort to attack the problem of code reuse in dependently typed languages. Our solution is to write generic functions, which can be applied to any datatype.
Such a generic function can be applied to datatypes that are defined at the time the generic function was written, but they can also be applied to any datatype that is defined in the future. Our solution builds upon previous work on generic programming within dependently typed programming.
Type theory supports generic programming using a construction known as a universe. A universe can be considered the model of a programming language, such that writing functions over it models writing generic programs in the programming language. Historically, there has been a trade-off between the expressive power of the modeled programming language, and the kinds of generic functions that can be written in it. Our dissertation shows that no such trade-off is necessary, and that we can write future-proof generic functions in a model of a dependently typed programming language with a rich collection of types.
2
Lin, Chungping. "The RMT (Recursive multi-threaded) tool: A computer aided software engineeering tool for monitoring and predicting software development progress." CSUSB ScholarWorks, 1998. https://scholarworks.lib.csusb.edu/etd-project/1787.
Full text
3
Simon, Scott James. "The recursive multi-threaded software life-cycle." CSUSB ScholarWorks, 1997. https://scholarworks.lib.csusb.edu/etd-project/1306.
Full text
4
ABDALLA, TALAL ALMUTAZ ALMANSI. "Recursive Algorithms for Set-Membership Estimation." Doctoral thesis, Politecnico di Torino, 2022. https://hdl.handle.net/11583/2972788.
Full text
5
Xia, Shujiang. "An improved software process management tool: ReMoTe (recursively estimating multi-threaded observation tool enterprise)." CSUSB ScholarWorks, 2005. https://scholarworks.lib.csusb.edu/etd-project/2871.
Full textAbstract:
The principal purpose of the project is to enable ReMoTe support for multi-databases. ReMoTe stands for the Recursively Estimating Multi-Threaded Observation Technology Enterprise, which is a web-based computer aided software engineering tool for monitoring software development process. Development of ReMoTe is based on the RMT (Recursive Multi-Threaded) software life cycle developed by Scott Simon, a CSUSB alum, in his master's thesis in 1997. ReMoTe enables the monitoring of projects that use different databases in various locations. Central management can view the progress information of each project using a web browser no matter where the database or project team is located. In this project, three database software were supported, namely MySQL, Oracle, and Microsoft Access, and employed contemporary technologies such as JavaScript, PHP, and Open Database Connectivity (ODBC). Source codes are included.
6
Kantipudi, Kalyana R. "Minimizing N-detect tests for combinational circuits." Auburn, Ala., 2007. http://repo.lib.auburn.edu/2007%20Spring%20Theses/KANTIPUDI_KALYANA_27.pdf.
Full text
7
Wallace, Michael T. "Motivational factors in farm family decision making : a multiple goal, recursive strategic programming analysis." Thesis, Queen's University Belfast, 1998. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.263578.
Full text
8
Saito, Chieri. "A design and theory of strongly typed object-oriented programming languages for extensible recursive classes." 京都大学 (Kyoto University), 2010. http://hdl.handle.net/2433/120371.
Full text
9
Kuo, Yi-Chiun. "Multi-database support in the recursive multi-threaded software process management tool." CSUSB ScholarWorks, 2002. https://scholarworks.lib.csusb.edu/etd-project/2266.
Full textAbstract:
The Recursive Multi-Threaded (RMT) software process management tool gives software developers the following capabilities: break a large project into a sequence of prototypes (or threads) track these threads individually, and estimate the progress and completion date of the project from these individual threads. The goal of this project is to provide the RMT Tool with an ability to support multi-database for collaborative software development. As a demonstration, actual data is used from several previous algorithma projects.
10
DeMelo, Darrion Todd. "ReMoTe: A complete tool to support software process management." CSUSB ScholarWorks, 2006. https://scholarworks.lib.csusb.edu/etd-project/3104.
Full textAbstract:
The purpose of the project is to provide the Department of Computer Science at California State University, San Bernardino with a software project management tool that will help companies in their software development. ReMoTe (Recursively Estimating Multi-Threaded Observation Technology Enterprise) will assist software engineering teams with defining their scheduled delivery dates, life-cycle definitions, team hierarchy, and communication. Using the object-oriented approach, ReMoTe can support any software life cycle model. ReMoTe can help manage and control the software process over the Web. It also allows people to manage software artifacts using database systems such as mySQL, Microsoft Access, or Oracle.
11
Hong, Jeongtaek. "Revision of ReMoTe (Recursively Estimating Multi-Threaded Observation Tool Enterprise) for commercialization." CSUSB ScholarWorks, 2011. https://scholarworks.lib.csusb.edu/etd-project/3327.
Full textAbstract:
The purpose of this study is to have ReMoTe be commercialized or released as open source at some future date to the general public. ReMoTe will provide an enhanced user interface that will allow users easy to use functions and setup their projects and define their thread and phases. ReMoTe will have the ability to handle muliple projects, and specify any number of phases for any thread.
12
Garlapati, Shravan Kumar Reddy. "Enabling Communication and Networking Technologies for Smart Grid." Diss., Virginia Tech, 2014. http://hdl.handle.net/10919/56629.
Full textAbstract:
Transforming the aging electric grid to a smart grid is an active area of research in industry and the government. One of the main objectives of the smart grid is to improve the efficiency of power generation, transmission and distribution and also to improve the stability and the reliability of the grid. In order to achieve this, various processes involved in power generation, transmission, and distribution should be armed with advanced sensor technologies, computing, communication and networking capabilities to an unprecedented level. These high speed data transfer and computational abilities aid power system engineers to obtain wide area measurements, achieve better control of power system operations and improve the reliability of power supply and the efficiency of different power grid operations.
In the process of making the grid smarter, problems existing in traditional grid applications can be identified and solutions have to be developed to fix the identified issues. In this dissertation, two problems that aid power system engineers to meet the above mentioned smart grid's objective are researched. One problem is related to the distribution-side smart grid and the other one is a part of the transmission-side smart grid. Advanced Metering Infrastructure (AMI) is one of the important distribution-side smart grid applications. AMI is a technology where smart meters are installed at customer site which gives the utilities the ability to monitor and collect information related to the amount of electricity, water, and gas consumed by the user.
Many recent research studies suggested the use of 3G cellular CDMA2000 for AMI network as it provides an advanced and cost effective solution for smart grid communications. Taking into account both technical and non-technical factors such as extended lifetime, security, availability and control of the solution, Alliander, an electric utility in Netherlands deployed a private 3G CDMA2000 network for smart metering. Although 3G CDMA2000 satisfies the requirements of smart grid applications, an analysis on the use of the current state of the art 3G CDMA2000 for smart grid applications indicates that its usage results in high percentage of control overhead, high latency and high power consumption for data transfer. As a part of this dissertation, we proposed FLEX-MAC - a new Medium Access Control (MAC) protocol that reduces the latency and overhead in smart meter data collection when compared to 3G CDMA2000 MAC.
As mentioned above the second problem studied in this dissertation is related to the transmission-side grid. Power grid transmission and sub-transmission lines are generally protected by distance relays. After a thorough analysis of U.S. historical blackouts, North American Electric Reliability Council (NERC) has concluded that the hidden failure induced tripping of distance relays is responsible for 70% of the U.S. blackouts. As a part of this dissertation, agent based distance relaying protection scheme is proposed to improve the robustness of distance relays to hidden failures and thus reduce the probability of blackouts.
This dissertation has two major contributions. First, a hierarchically distributed non-intrusive Agent Aided Distance Relaying Protection Scheme (AADRPS) is proposed to improve the robustness of distance relays to hidden failures. The problem of adapting the proposed AADRPS to a larger power system network consisting of thousands of buses is modeled as an integer linear programming multiple facility location optimization problem. Distance relaying protection scheme is a real time system and has stringent timing requirements. Therefore, in order to verify if the proposed AADRPS meets the timing requirements or not and also to check for deadlocks, verification models based on UPPAAL real time model checker are provided in this dissertation. So, the entire framework consisting of AADRPS that aids in increasing the robustness of distance relays and reducing the possibility of blackouts, the multiple facility location optimization models and the UPPAAL real time model checker verification models form one of the major contributions of this dissertation.
The second contribution is related to the MAC layer of AMI networks. In this dissertation, FLEX-MAC - a novel and flexible MAC protocol is proposed to reduce the overhead and latency in smart meter data collection. The novelty of the FLEX-MAC lies in its ability to change the mode of operation based on the type of the data being collected in a smart meter network. FLEX-MAC employs Frame and Channel Reserved (FCR) MAC or Frame Reserved and Random Channel (FRRC) MAC for scheduled data collection. Power outage data in an AMI network is considered as a random data . In a densely populated area, during an outage, a large number of smart meters attempt to report the outage, which significantly increases the Random Access CHannel (RACH) load. In order to reduce the RACH traffic during an outage, this dissertation proposes a Time Hierarchical Scheme (THS). Also, in order to minimize the total time to collect the power outage data, a Backward Recursive Dynamic Programming (BRDP) approach is proposed to adapt the transmission rate of smart meters reporting an outage. Both the Optimal Transmission Rate Adaption and Time Hierarchical Scheme form the basis of OTRA-THS MAC which is employed by FLEX-MAC for random data collection. Additionally, in this work, Markov chain models are presented for evaluating the performance of FCR and FRRC MACs in terms of average throughput and delay. Also, another Markov model is presented to find the mean time to absorption or mean time to collect power outage data of OTRA-TH MAC during an outage.Ph. D.
13
Ferreira, Ernesto Franklin Marçal. "Melhorias de estabilidade numérica e custo computacional de aproximadores de funções valor de estado baseados em estimadores RLS para projeto online de sistemas de controle HDP-DLQR." Universidade Federal do Maranhão, 2016. http://tedebc.ufma.br:8080/jspui/handle/tede/1687.
Full textAbstract:
Submitted by Rosivalda Pereira (mrs.pereira@ufma.br) on 2017-06-23T20:34:27Z
No. of bitstreams: 1
ErnestoFerreira.pdf: 1744167 bytes, checksum: c125c90e5eb2aab2618350567f88cb31 (MD5)Made available in DSpace on 2017-06-23T20:34:27Z (GMT). No. of bitstreams: 1 ErnestoFerreira.pdf: 1744167 bytes, checksum: c125c90e5eb2aab2618350567f88cb31 (MD5) Previous issue date: 2016-03-08
The development and the numerical stability analysis of a new adaptive critic algorithm to approximate the state-value function for online discrete linear quadratic regulator (DLQR) optimal control system design based on heuristic dynamic programming (HDP) are presented in this work. The proposed algorithm makes use of unitary transformations and QR decomposition methods to improve the online learning e-ciency in the critic network through the recursive least-squares (RLS) approach. The developed learning strategy provides computational performance improvements in terms of numerical stability and computational cost which aim at making possible the implementations in real time of optimal control design methodology based upon actor-critic reinforcement learning paradigms. The convergence behavior and numerical stability of the proposed online algorithm, called RLSµ-QR-HDP-DLQR, are evaluated by computational simulations in three Multiple-Input and Multiple-Output (MIMO) models, that represent the automatic pilot of an F-16 aircraft of third order, a fourth order RLC circuit with two input voltages and two controllable voltage levels, and a doubly-fed induction generator with six inputs and six outputs for wind energy conversion systems.
Neste trabalho, apresenta-se o desenvolvimento e a análise da estabilidade numérica de um novo algoritmo crítico adaptativo para aproximar a função valor de estado para o projeto do sistema de controle ótimo online, utilizando o regulador linear quadrático discreto (DLQR), com base em programação dinâmica heurística (HDP). O algoritmo proposto faz uso de transformações unitárias e métodos de decomposição QR para melhorar a e-ciência da aprendizagem online na rede crítica por meio da abordagem dos mínimos quadrados recursivos (RLS). A estratégia de aprendizagem desenvolvida fornece melhorias no desempenho computacional em termos de estabilidade numérica e custo computacional, que visam tornar possíveis as implementações em tempo real da metodologia do projeto de controle ótimo com base em paradigmas de aprendizado por reforço ator-crítico. O comportamento de convergência e estabilidade numérica do algoritmo online proposto, denominado RLSµ-QR-HDP-DLQR, são avaliados por meio de simulações computacionais em três modelos Múltiplas-Entradas e Múltiplas-Saídas (MIMO), que representam o piloto automático de uma aeronave F-16 de terceira ordem, um circuito de quarta ordem RLC com duas tensões de entrada e dois níveis de tensão controláveis, e um gerador de indução duplamente alimentados com seis entradas e seis saídas para sistemas de conversão de energia eólica.
14
RÊGO, Patrícia Helena Moraes. "Aprendizagem por Reforço e Programação Dinâmica Aproximada para Controle Ótimo: Uma Abordagem para o Projeto Online do Regulador Linear Quadrático Discreto com Programação Dinâmica Heurística Dependente de Estado e Ação." Universidade Federal do Maranhão, 2014. http://tedebc.ufma.br:8080/jspui/handle/tede/1879.
Full textAbstract:
Submitted by Maria Aparecida (cidazen@gmail.com) on 2017-08-30T15:33:12Z
No. of bitstreams: 1
Patricia Helena.pdf: 11110405 bytes, checksum: ca1f067231658f897d84b86181dbf1b9 (MD5)Made available in DSpace on 2017-08-30T15:33:12Z (GMT). No. of bitstreams: 1 Patricia Helena.pdf: 11110405 bytes, checksum: ca1f067231658f897d84b86181dbf1b9 (MD5) Previous issue date: 2014-07-24
In this thesis a proposal of an uni ed approach of dynamic programming, reinforcement learning and function approximation theories aiming at the development of methods and algorithms for design of optimal control systems is presented. This approach is presented in the approximate dynamic programming context that allows approximating the optimal feedback solution as to reduce the computational complexity associated to the conventional dynamic programming methods for optimal control of multivariable systems. Speci cally, in the state and action dependent heuristic dynamic programming framework, this proposal is oriented for the development of online approximated solutions, numerically stable, of the Riccati-type Hamilton-Jacobi-Bellman equation associated to the discrete linear quadratic regulator problem which is based on a formulation that combines value function estimates by means of a RLS (Recursive Least-Squares) structure, temporal di erences and policy improvements. The development of the proposed methodologies, in this work, is focused mainly on the UDU T factorization that is inserted in this framework to improve the RLS estimation process of optimal decision policies of the discrete linear quadratic regulator, by circumventing convergence and numerical stability problems related to the covariance matrix ill-conditioning of the RLS approach.
Apresenta-se nesta tese uma proposta de uma abordagem uni cada de teorias de programação dinâmica, aprendizagem por reforço e aproximação de função que tem por objetivo o desenvolvimento de métodos e algoritmos para projeto online de sistemas de controle ótimo. Esta abordagem é apresentada no contexto de programação dinâmica aproximada que permite aproximar a solução de realimentação ótima de modo a reduzir a complexidade computacional associada com métodos convencionais de programação dinâmica para controle ótimo de sistemas multivariáveis. Especi camente, no quadro de programação dinâmica heurística e programação dinâmica heurística dependente de ação, esta proposta é orientada para o desenvolvimento de soluções aproximadas online, numericamente estáveis, da equação de Hamilton-Jacobi-Bellman do tipo Riccati associada ao problema do regulador linear quadrático discreto que tem por base uma formulação que combina estimativas da função valor por meio de uma estrutura RLS (do inglês Recursive Least-Squares), diferenças temporais e melhorias de política. O desenvolvimento das metodologias propostas, neste trabalho, tem seu foco principal voltado para a fatoração UDU T que é inserida neste quadro para melhorar o processo de estimação RLS de políticas de decisão ótimas do regulador linear quadrá- tico discreto, contornando-se problemas de convergência e estabilidade numérica relacionados com o mal condicionamento da matriz de covariância da abordagem RLS.
15
Erkök, Levent. "Value recursion in monadic computations /." Full text open access at:, 2002. http://content.ohsu.edu/u?/etd,270.
Full text
16
Maciel, Allan James Ferreira. "CONVERGÊNCIA DO ESTIMADOR RLS PARA ALGORITMOS DE PROGRAMAÇÃO DINÂMICA HEURÍSTICA." Universidade Federal do Maranhão, 2012. http://tedebc.ufma.br:8080/jspui/handle/tede/494.
Full textAbstract:
Made available in DSpace on 2016-08-17T14:53:22Z (GMT). No. of bitstreams: 1
Dissertacao Allan James.pdf: 3170694 bytes, checksum: 054a9e74e81a7c2099800246d0b6c530 (MD5)
Previous issue date: 2012-09-28Coordenação de Aperfeiçoamento de Pessoal de Nível Superior
The union of methodologies for optimal control and dynamics programming has stimulated the development of algorithms for realization of discrete control systems of the type linear quadratic regulator (DLQR). The methodology is based on reinforcement learning methods based on temporal differences and approximate dynamic programming. The proposed method combines the approach of the value function by method RLS (recursive least squares) and approximate policy iteration schemes heuristic dynamic programming (HDP). The approach is directed to the assessment of convergence of the solution DLQR and the heuristic weighting matrices and of the utility function associated with DLQR. The investigation of convergence properties related to consistency, persistent excitation and polarization of the RLS estimator is performed. The methodology involved in a project achievements online DLQR controllers and is evaluated in a fourth order multivariable dynamic system.
A união das metodologias de controle ótimo e de programação dinâmica tem impulsionado o desenvolvimento de algoritmos para realizações de sistemas de controle discreto do tipo regulador linear quadrático (DLQR). A metodologia utilizada neste trabalho é fundamentada sobre métodos de aprendizagem por reforço baseados em diferenças temporais e programação dinâmica aproximada. O método proposto combina a aproximação da função valor através do método RLS (mínimos quadrados recursivos) e iteração de política aproximada em esquemas de programação dinâmica heurística (HDP). A abordagem é orientada para a avaliação da convergência da solução DLQR e para a sintonia heurística das matrizes de ponderação e da função de utilidade associada ao DLQR. É realizada a investigação das propriedades de convergência relacionadas à consistência, excitação persistente e polarização do estimador RLS. A metodologia contempla realizações de projetos de forma online de controladores DLQR e é avaliada em um sistema dinâmico multivariável de quarta ordem.
17
Borie, Richard Bryan. "Recursively constructed graph families : membership and linear algorithms." Diss., Georgia Institute of Technology, 1988. http://hdl.handle.net/1853/8140.
Full text
18
Kavvos, Georgios Alexandros. "On the semantics of intensionality and intensional recursion." Thesis, University of Oxford, 2017. https://ora.ox.ac.uk/objects/uuid:f89b46d8-b514-42fd-9321-e2803452681f.
Full textAbstract:
Intensionality is a phenomenon that occurs in logic and computation. In the most general sense, a function is intensional if it operates at a level finer than (extensional) equality. This is a familiar setting for computer scientists, who often study different programs or processes that are interchangeable, i.e. extensionally equal, even though they are not implemented in the same way, so intensionally distinct. Concomitant with intensionality is the phenomenon of intensional recursion, which refers to the ability of a program to have access to its own code. In computability theory, intensional recursion is enabled by Kleene's Second Recursion Theorem. This thesis is concerned with the crafting of a logical toolkit through which these phenomena can be studied. Our main contribution is a framework in which mathematical and computational constructions can be considered either extensionally, i.e. as abstract values, or intensionally, i.e. as fine-grained descriptions of their construction. Once this is achieved, it may be used to analyse intensional recursion. To begin, we turn to type theory. We construct a modal λ-calculus, called Intensional PCF, which supports non-functional operations at modal types. Moreover, by adding Löb's rule from provability logic to the calculus, we obtain a type-theoretic interpretation of intensional recursion. The combination of these two features is shown to be consistent through a confluence argument. Following that, we begin searching for a semantics for Intensional PCF. We argue that 1-category theory is not sufficient, and propose the use of P-categories instead. On top of this setting we introduce exposures, which are P-categorical structures that function as abstractions of well-behaved intensional devices. We produce three examples of these structures, based on Gödel numberings on Peano arithmetic, realizability theory, and homological algebra. The language of exposures leads us to a P-categorical analysis of intensional recursion, through the notion of intensional fixed points. This, in turn, leads to abstract analogues of classic intensional results in logic and computability, such as Gödel's Incompleteness Theorem, Tarski's Undefinability Theorem, and Rice's Theorem. We are thus led to the conclusion that exposures are a useful framework, which we propose as a solid basis for a theory of intensionality. In the final chapters of the thesis we employ exposures to endow Intensional PCF with an appropriate semantics. It transpires that, when interpreted in the P-category of assemblies on the PCA K1, the Löb rule can be interpreted as the type of Kleene's Second Recursion Theorem.
19
George, Carlisle Eldwidge. "Investigating the effectiveness of a software-reinforced approach to understanding recursion." Thesis, Goldsmiths College (University of London), 1996. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.338736.
Full text
20
Saint-James, Emmanuel. "De la meta-recursivite comme outil d'implementation." Paris 6, 1987. http://www.theses.fr/1987PA066612.
Full textAbstract:
Il est montre comment il est possible et pourquoi il est souhaitable d'implementer un langage de programmation exclusivement par autointerpretation. En effet, il est montre qu'un sous ensemble d'un langage de programmation peut etre considere comme sa propre machine virtuelle, et que l'acces interactif au code source du systeme donne au langage une clarte et une puissance d'expression inegalees. Cette technique, nommee metarecursivite, a ete utilisee pour mettre en oeuvre le systeme meta lisp, operationnel sur plusieurs machines
21
Axehill, Daniel. "Applications of Integer Quadratic Programming in Control and Communication." Licentiate thesis, Linköping : Dept. of Electrical Engineering, Linköping University, 2005. http://urn.kb.se/resolve?urn=urn:nbn:se:liu:diva-5263.
Full text
22
Ahn, Ki Yung. "The Nax Language: Unifying Functional Programming and Logical Reasoning in a Language based on Mendler-style Recursion Schemes and Term-indexed Types." PDXScholar, 2014. https://pdxscholar.library.pdx.edu/open_access_etds/2088.
Full textAbstract:
Two major applications of lambda calculi in computer science are functional programming languages and mechanized reasoning systems (or, proof assistants). According to the Curry--Howard correspondence, it is possible, in principle, to design a unified language based on a typed lambda calculus for both logical reasoning and programming. However, the different requirements of programming languages and reasoning systems make it difficult to design such a unified language that provides both. Programming languages usually extend lambda calculi with programming-friendly features (e.g., recursive datatypes, general recursion) for supporting the flexibility to model various computations, while sacrificing logical consistency. Logical reasoning systems usually extend lambda calculi with logic-friendly features (e.g., induction principles, dependent types) for paradox-free inference over fine-grained properties, while being more restrictive in modeling computations.
In this dissertation, we design and implement a language called Nax that embraces benefits of both. Nax accepts all recursive datatypes, thus, allowing the same flexibility of defining recursive datatypes as in functional languages. Nax supports a number of Mendler-style recursion schemes that can express various kinds of recursive computations and also guarantee termination. Nax supports term-indexed types to support specifications of fine-grained properties. In addition, Nax supports a conservative extension of Hindley--Milner type inference.
The theoretical contributions of this dissertation include theories for Mendler-style recursion schemes and term-indexed types, which we developed to establish strong normalization and logical consistency of Nax.
23
Glimming, Johan. "Primitive Direcursion and Difunctorial Semantics of Typed Object Calculus." Doctoral thesis, Stockholm : Numerisk analys och datalogi (KTH CSC), Stockholms universitet, 2007. http://urn.kb.se/resolve?urn=urn:nbn:se:su:diva-7208.
Full text
24
Lemonnier, Louis. "The Semantics of Effects : Centrality, Quantum Control and Reversible Recursion." Electronic Thesis or Diss., université Paris-Saclay, 2024. http://www.theses.fr/2024UPASG030.
Full textAbstract:
Le sujet de cette thèse est axé sur la théorie des langages de programmation. Dans un langage de programmation suffisamment bien défini, le comportement des programmes peut être étudié à l'aide d'outils empruntés à la logique et aux mathématiques, énonçant des résultats sans exécuter le code. Ce domaine de l'informatique est appelé "sémantique". La sémantique d'un langage peut se présenter sous plusieurs formes : dans notre cas, des sémantiques opérationnelles, des théories équationnelles et des sémantiques dénotationnelles. Les premières donnent un sens opérationnel aux programmes, au sein de la syntaxe du langage. Elles simulent les opérations qu'un ordinateur est censé effectuer s'il exécute le programme. Une théorie équationnelle fonctionne également de manière syntaxique : elle indique si deux programmes effectuent la même opération sans informer sur la procédure. Enfin, la sémantique dénotationnelle est l'étude mathématique des programmes, généralement à l'aide de la théorie des catégories. Elle permet par exemple de prouver qu'un programme se termine ou non. Cette thèse se concentre sur la sémantique des effets dans les langages de programmation - une fonctionnalité ajoutée à un langage, gérant des données secondaires ou des résultats probabilistes. Eugenio Moggi, en 1991, a publié un travail fondateur sur l'étude de la sémantique des effets, soulignant la relation avec les monades en théorie des catégories. La première contribution de cette thèse suit directement le travail de Moggi, en étudiant la commutativité des effets dans un langage de programmation à travers le prisme des monades. Les monades sont la généralisation de structures algébriques telles que les monoïdes, qui ont une notion de centre : le centre d'un monoïde est une collection d'éléments qui commutent avec tous les autres dans le monoïde. Nous fournissons les conditions nécessaires et suffisantes pour qu'une monade ait un centre. Nous détaillons également la sémantique d'un langage de programmation avec des effets qui portent des informations sur les effets qui sont centraux. De plus, nous fournissons un lien fort - un résultat de langage interne - entre ses théories équationnelles et sa sémantique dénotationnelle. Le deuxième axe de la thèse est l'informatique quantique, perçue comme un effet réversible. Le quantique est un domaine émergent de l'informatique qui utilise la puissance de la mécanique quantique pour calculer. Au niveau des langages de programmation, de nouveaux paradigmes doivent être développés pour être fidèles aux opérations quantiques. Les opérations quantiques physiquement permises sont toutes réversibles, à l'exception de la mesure ; cependant, la mesure peut être reportée à la fin du calcul, ce qui nous permet de nous concentrer d'abord sur la partie réversible et d'appliquer ensuite la mesure pour obtenir des résultats. Dans le chapitre correspondant, nous définissons un langage de programmation réversible, avec types simples, qui effectue des opérations quantiques "unitaires". Une sémantique dénotationnelle et une théorie équationnelle adaptées au langage sont présentées, et nous prouvons que cette dernière est complète. Ce travail vise à fournir des bases solides pour l'étude du contrôle quantique d'ordre supérieur. En outre, nous étudions la récursion réversible, en fournissant une sémantique opérationnelle et dénotationnelle adéquate à un langage de programmation fonctionnel, réversible et Turing-complet. La sémantique dénotationnelle utilise l'enrichissement dcpo des catégories inverses. Ce modèle mathématique sur l'informatique réversible ne se généralise pas directement à sa version quantique. Dans la conclusion, nous détaillons les limites et l'avenir possible du contrôle quantique d'ordre supérieurThe topic of this thesis revolves around the theory of programming languages. In a sufficiently well-defined programming language, the behaviour of programs can be studied with tools borrowed from logic and mathematics, allowing us to state results without executing the code. This area of computer science is called “semantics”. The semantics of a programming language can take several forms: in this thesis, we work with operational semantics, equational theories, and denotational semantics. The former gives an operational meaning to programs but within the language's syntax. It simulates the operations a computer is supposed to perform if it were running the program. An equational theory also works syntactically: it indicates whether two programs perform the same operation without giving any information on the procedure. Lastly, denotational semantics is the mathematical study of programs, usually done with the help of category theory. For example, it allows us to prove whether a program terminates. This thesis focuses on the semantics of effects in programming languages - namely, a feature added to a language, e.g. handling side data or probabilistic outputs. Eugenio Moggi, in 1991, published foundational work on the study of the semantics of effects, highlighting the relationship with monads in category theory. The first contribution of this thesis directly follows Moggi's work, studying the commutativity of effects in a programming language through the prism of monads. Monads are the generalisation of algebraic structures such as monoids, which have a notion of centre: the centre of a monoid is a collection of elements which commute with all others in the monoid. We provide the necessary and sufficient conditions for a monad to have a centre. We also detail the semantics of a programming language with effects that carry information on which effects are central. Moreover, we provide a strong link - an internal language result - between its equational theories and its denotational semantics. The second focus of the thesis is quantum computing, which is seen as a reversible effect. Quantum computing is an emergent field in computer science that uses the power of quantum mechanics to compute. At the level of programming languages, new paradigms need to be developed to be faithful to quantum operations. Physically permissible quantum operations are all reversible, except measurement; however, measurement can be deferred at the end of the computation, allowing us to focus on the reversible part first and then apply measurement to obtain results. In the corresponding chapter, we define a simply-typed reversible programming language performing quantum operations called “unitaries”. A denotational semantics and an equational theory adapted to the language are presented, and we prove that the latter is complete. The aim of this work is to provide a solid foundation for the study of higher-order quantum control. Furthermore, we study recursion in reversible programming, providing adequate operational and denotational semantics to a Turing-complete, reversible, functional programming language. The denotational semantics uses the dcpo enrichment of rig join inverse categories. This mathematical account of higher-order reasoning on reversible computing does not directly generalise to its quantum counterpart. In the conclusion, we detail the limitations and possible future for higher-order quantum control
25
Kouchnarenko, Olga. "Sémantique des programmes récursifs-parallèles et méthodes pour leur analyse." Phd thesis, Université Joseph Fourier (Grenoble), 1997. http://tel.archives-ouvertes.fr/tel-00004949.
Full textAbstract:
Cette thèse s'inscrit dans le cadre des travaux consacrés au développement des modèles sémantiques destinés aux langages de programmation concurrents. Une particularité de notre étude réside dans la considération explicite d'une récursivité au niveau des programmes parallèles. Pour ces programmes nous proposons une sémantique originale, dont nous étudions en détail les propriétés. Bien que le modèle proposé ne soit pas d'états finis, il est possible de le munir d'une structure de systèmes de transitions bien structurés au sens de Finkel ce qui établit la décidabilité de nombreux problèmes de vérification. Cette sémantique à la Plotkin permet de mieux comprendre le comportement des programmes récursifs-parallèles, d'analyser formellement certaines de leurs propriétés, de décrire la stratégie d'implémentation et d'énoncer en quel sens elle est correcte.
26
Nielsen, Isak. "Structure-Exploiting Numerical Algorithms for Optimal Control." Doctoral thesis, Linköpings universitet, Reglerteknik, 2017. http://urn.kb.se/resolve?urn=urn:nbn:se:liu:diva-136559.
Full textAbstract:
Numerical algorithms for efficiently solving optimal control problems are important for commonly used advanced control strategies, such as model predictive control (MPC), but can also be useful for advanced estimation techniques, such as moving horizon estimation (MHE). In MPC, the control input is computed by solving a constrained finite-time optimal control (CFTOC) problem on-line, and in MHE the estimated states are obtained by solving an optimization problem that often can be formulated as a CFTOC problem. Common types of optimization methods for solving CFTOC problems are interior-point (IP) methods, sequential quadratic programming (SQP) methods and active-set (AS) methods. In these types of methods, the main computational effort is often the computation of the second-order search directions. This boils down to solving a sequence of systems of equations that correspond to unconstrained finite-time optimal control (UFTOC) problems. Hence, high-performing second-order methods for CFTOC problems rely on efficient numerical algorithms for solving UFTOC problems. Developing such algorithms is one of the main focuses in this thesis. When the solution to a CFTOC problem is computed using an AS type method, the aforementioned system of equations is only changed by a low-rank modification between two AS iterations. In this thesis, it is shown how to exploit these structured modifications while still exploiting structure in the UFTOC problem using the Riccati recursion. Furthermore, direct (non-iterative) parallel algorithms for computing the search directions in IP, SQP and AS methods are proposed in the thesis. These algorithms exploit, and retain, the sparse structure of the UFTOC problem such that no dense system of equations needs to be solved serially as in many other algorithms. The proposed algorithms can be applied recursively to obtain logarithmic computational complexity growth in the prediction horizon length. For the case with linear MPC problems, an alternative approach to solving the CFTOC problem on-line is to use multiparametric quadratic programming (mp-QP), where the corresponding CFTOC problem can be solved explicitly off-line. This is referred to as explicit MPC. One of the main limitations with mp-QP is the amount of memory that is required to store the parametric solution. In this thesis, an algorithm for decreasing the required amount of memory is proposed. The aim is to make mp-QP and explicit MPC more useful in practical applications, such as embedded systems with limited memory resources. The proposed algorithm exploits the structure from the QP problem in the parametric solution in order to reduce the memory footprint of general mp-QP solutions, and in particular, of explicit MPC solutions. The algorithm can be used directly in mp-QP solvers, or as a post-processing step to an existing solution.Numeriska algoritmer för att effektivt lösa optimala styrningsproblem är en viktig komponent i avancerade regler- och estimeringsstrategier som exempelvis modellprediktiv reglering (eng. model predictive control (MPC)) och glidande horisont estimering (eng. moving horizon estimation (MHE)). MPC är en reglerstrategi som kan användas för att styra system med flera styrsignaler och/eller utsignaler samt ta hänsyn till exempelvis begränsningar i styrdon. Den grundläggande principen för MPC och MHE är att styrsignalen och de estimerade variablerna kan beräknas genom att lösa ett optimalt styrningsproblem. Detta optimeringsproblem måste lösas inom en kort tidsram varje gång som en styrsignal ska beräknas eller som variabler ska estimeras, och således är det viktigt att det finns effektiva algoritmer för att lösa denna typ av problem. Två vanliga sådana är inrepunkts-metoder (eng. interior-point (IP)) och aktivmängd-metoder (eng. active-set (AS)), där optimeringsproblemet löses genom att lösa ett antal enklare delproblem. Ett av huvudfokusen i denna avhandling är att beräkna lösningen till dessa delproblem på ett tidseffektivt sätt genom att utnyttja strukturen i delproblemen. Lösningen till ett delproblem beräknas genom att lösa ett linjärt ekvationssystem. Detta ekvationssystem kan man exempelvis lösa med generella metoder eller med så kallade Riccatirekursioner som utnyttjar strukturen i problemet. När man använder en AS-metod för att lösa MPC-problemet så görs endast små strukturerade ändringar av ekvationssystemet mellan varje delproblem, vilket inte har utnyttjats tidigare tillsammans med Riccatirekursionen. I denna avhandling presenteras ett sätt att utnyttja detta genom att bara göra små förändringar av Riccatirekursionen för att minska beräkningstiden för att lösa delproblemet. Idag har behovet av parallella algoritmer för att lösa MPC och MHE problem ökat. Att algoritmerna är parallella innebär att beräkningar kan ske på olika delar av problemet samtidigt med syftet att minska den totala verkliga beräkningstiden för att lösa optimeringsproblemet. I denna avhandling presenteras parallella algoritmer som kan användas i både IP- och AS-metoder. Algoritmerna beräknar lösningen till delproblemen parallellt med ett förutbestämt antal steg, till skillnad från många andra parallella algoritmer där ett okänt (ofta stort) antal steg krävs. De parallella algoritmerna utnyttjar problemstrukturen för att lösa delproblemen effektivt, och en av dem har utvärderats på parallell hårdvara. Linjära MPC problem kan också lösas genom att utnyttja teori från multiparametrisk kvadratisk programmering (eng. multiparametric quadratic programming (mp-QP)) där den optimala lösningen beräknas i förhand och lagras i en tabell, vilket benämns explicit MPC. I detta fall behöver inte MPC problemet lösas varje gång en styrsignal beräknas, utan istället kan den förberäknade optimala styrsignalen slås upp. En nackdel med mp-QP är att det krävs mycket plats i minnet för att spara lösningen. I denna avhandling presenteras en strukturutnyttjande algoritm som kan minska behovet av minne för att spara lösningen, vilket kan öka det praktiska användningsområdet för mp-QP och explicit MPC.
27
Cai, Jiatu. "Méthodes asymptotiques en contrôle stochastique et applications à la finance." Sorbonne Paris Cité, 2016. http://www.theses.fr/2016USPCC338.
Full textAbstract:
Dans cette thèse, nous étudions plusieurs problèmes de mathématiques financières liés à la présence d’imperfections sur les marchés. Notre approche principale pour leur résolution est l’utilisation d’un cadre asymptotique pertinent dans lequel nous parvenons à obtenir des solutions approchées explicites pour les problèmes de contrôle associés. Dans la première partie de cette thèse, nous nous intéressons à l’évaluation et la couverture des options européennes. Nous considérons tout d’abord la problématique de l’optimisation des dates de rebalancement d’une couverture à temps discret en présence d’une tendance dans la dynamique du sous-jacent. Nous montrons que dans cette situation, il est possible de générer un rendement positif tout en couvrant l’option et nous décrivons une stratégie de rebalancement asymptotiquement optimale pour un critère de type moyenne-variance. Ensuite, nous proposons un cadre asymptotique pour la gestion des options européennes en présence de coûts de transaction proportionnels. En s’inspirant des travaux de Leland, nous développons une méthode alternative de construction de portefeuilles de réplication permettant de minimiser les erreurs de couverture. La seconde partie de ce manuscrit est dédiée à la question du suivi d’une cible stochastique. L’objectif de l’agent est de rester proche de cette cible tout en minimisant le coût de suivi. Dans une asymptotique de coûts petits, nous démontrons l’existence d’une borne inférieure pour la fonction valeur associée à ce problème d’optimisation. Cette borne est interprétée en terme du contrôle ergodique du mouvement brownien. Nous fournissons également de nombreux exemples pour lesquels la borne inférieure est explicite et atteinte par une stratégie que nous décrivons. Dans la dernière partie de cette thèse, nous considérons le problème de consommation et investissement en présence de taxes sur le rendement des capitaux. Nous obtenons tout d’abord un développement asymptotique de la fonction valeur associée que nous interprétons de manière probabiliste. Puis, dans le cas d’un marché avec changements de régime et pour un investisseur dont l’utilité est du type Epstein-Zin, nous résolvons explicitement le problème en décrivant une stratégie de consommation-investissement optimale. Enfin, nous étudions l’impact joint de coûts de transaction et de taxes sur le rendement des capitaux. Nous établissons dans ce cadre un système d’équations avec termes correcteurs permettant d’unifier les résultats de [ST13] et[CD13]In this thesis, we study several mathematical finance problems related to the presence of market imperfections. Our main approach for solving them is to establish a relevant asymptotic framework in which explicit approximate solutions can be obtained for the associated control problems. In the first part of this thesis, we are interested in the pricing and hedging of European options. We first consider the question of determining the optimal rebalancing dates for a replicating portfolio in the presence of a drift in the underlying dynamics. We show that in this situation, it is possible to generate positive returns while hedging the option and describe a rebalancing strategy which is asymptotically optimal for a mean-variance type criterion. Then we propose an asymptotic framework for options risk management under proportional transaction costs. Inspired by Leland’s approach, we develop an alternative way to build hedging portfolios enabling us to minimize hedging errors. The second part of this manuscript is devoted to the issue of tracking a stochastic target. The agent aims at staying close to the target while minimizing tracking efforts. In a small costs asymptotics, we establish a lower bound for the value function associated to this optimization problem. This bound is interpreted in term of ergodic control of Brownian motion. We also provide numerous examples for which the lower bound is explicit and attained by a strategy that we describe. In the last part of this thesis, we focus on the problem of consumption-investment with capital gains taxes. We first obtain an asymptotic expansion for the associated value function that we interpret in a probabilistic way. Then, in the case of a market with regime-switching and for an investor with recursive utility of Epstein-Zin type, we solve the problem explicitly by providing a closed-form consumption-investment strategy. Finally, we study the joint impact of transaction costs and capital gains taxes. We provide a system of corrector equations which enables us to unify the results in [ST13] and [CD13]
28
Jaber, Ghaleb. "Le langage pascal/relationnel : un langage de programmation de bases de donnees." Toulouse 3, 1987. http://www.theses.fr/1987TOU30222.
Full textAbstract:
Presentation du langage pascal/relationnel construit a partir de pascal par adjonction de constructions venant du domaine des bases de donnees ainsi que la conception et l'implantation du traducteur du langage. Les instructions relationnelles sont inspirees du calcul des predicats et permettent les operations classiques offertes par les systemes de gestion de bases de donnees relationnelles
29
Harrison, William. "Malleability, obliviousness and aspects for broadcast service attachment." Universität Potsdam, 2010. http://opus.kobv.de/ubp/volltexte/2010/4138/.
Full textAbstract:
An important characteristic of Service-Oriented Architectures is that clients do not depend on the service implementation's internal assignment of methods to objects. It is perhaps the most important technical characteristic that differentiates them from more common object-oriented solutions. This characteristic makes clients and services malleable, allowing them to be rearranged at run-time as circumstances change. That improvement in malleability is impaired by requiring clients to direct service requests to particular services. Ideally, the clients are totally oblivious to the service structure, as they are to aspect structure in aspect-oriented software. Removing knowledge of a method implementation's location, whether in object or service, requires re-defining the boundary line between programming language and middleware, making clearer specification of dependence on protocols, and bringing the transaction-like concept of failure scopes into language semantics as well. This paper explores consequences and advantages of a transition from object-request brokering to service-request brokering, including the potential to improve our ability to write more parallel software.
30
Fan, Yang, Hidehiko Masuhara, Tomoyuki Aotani, Flemming Nielson, and Hanne Riis Nielson. "AspectKE*: Security aspects with program analysis for distributed systems." Universität Potsdam, 2010. http://opus.kobv.de/ubp/volltexte/2010/4136/.
Full textAbstract:
Enforcing security policies to distributed systems is difficult, in particular, when a system contains untrusted components. We designed AspectKE*, a distributed AOP language based on a tuple space, to tackle this issue. In AspectKE*, aspects can enforce access control policies that depend on future behavior of running processes. One of the key language features is the predicates and functions that extract results of static program analysis, which are useful for defining security aspects that have to know about future behavior of a program. AspectKE* also provides a novel variable binding mechanism for pointcuts, so that pointcuts can uniformly specify join points based on both static and dynamic information about the program. Our implementation strategy performs fundamental static analysis at load-time, so as to retain runtime overheads minimal. We implemented a compiler for AspectKE*, and demonstrate usefulness of AspectKE* through a security aspect for a distributed chat system.
31
Palix, Nicolas, Julia L. Lawall, Gaël Thomas, and Gilles Muller. "How Often do Experts Make Mistakes?" Universität Potsdam, 2010. http://opus.kobv.de/ubp/volltexte/2010/4132/.
Full textAbstract:
Large open-source software projects involve developers with a wide variety of backgrounds and expertise. Such software projects furthermore include many internal APIs that developers must understand and use properly. According to the intended purpose of these APIs, they are more or less frequently used, and used by developers with more or less expertise. In this paper, we study the impact of usage patterns and developer expertise on the rate of defects occurring in the use of internal APIs. For this preliminary study, we focus on memory management APIs in the Linux kernel, as the use of these has been shown to be highly error prone in previous work. We study defect rates and developer expertise, to consider e.g., whether widely used APIs are more defect prone because they are used by less experienced developers, or whether defects in widely used APIs are more likely to be fixed.
32
Ren, Guanlong. "Dynamic programming with recursive preferences." Phd thesis, 2019. http://hdl.handle.net/1885/164125.
Full textAbstract:
There is now a considerable amount of research on the deficiencies of additively separable preferences for effective modelling of economically meaningful behaviour. Through analysis of observational data and the design of suitable experiments, economists have constructed progressively more realistic representations of agents and their choices. For intertemporal decisions, this typically involves a departure from the additively separable benchmark. A familiar example is the recursive preference framework of Epstein and Zin (1989), which has become central to the quantitative asset pricing literature, while also finding widespread use in applications range from optimal taxation to fiscal policy and business cycles.
This thesis presents three essays which examine mathematical research questions within the context of recursive preferences and dynamic programming. The focus is particularly on showing existence and uniqueness of recursive utility processes under stationary and non-stationary consumption growth specifications, and on solving the closely related problem of optimality of dynamic programs with recursive preferences.
On one hand, the thesis has been motivated by the availability of new and unexploited techniques for studying the aforementioned questions. The techniques in question primarily build upon an alternative version of the theory of monotone concave operators proposed by Du (1989, 1990). They are typically well suited to analysis of dynamic optimality with a variety of recursive preference specifications.
On the other hand, motivation also comes from the demand side: while many useful results for dynamic programming within the context of recursive preferences have been obtained by existing literature, suitable results are still lacking for some of the most popular specifications for applied work, such as common parameterizations of the Epstein-Zin specification, or preference specifications that incorporate loss aversion and narrow framing into the Epstein-Zin framework, or the ambiguity sensitive preference specifications. In this connection, the thesis has sought to provide a new approach to dynamic optimality suitable for recursive preference specifications commonly used in modern economic analysis.
The approach to examining the problems of dynamic programming exploits the theory of monotone convex operators, which, while less familiar than that of monotone concave operators, turns out to be well suited to dynamic maximization. The intuition is that convexity is preserved under maximization, while concavity is not. Meanwhile, concavity pairs well with minimization problems, since minimization preserves concavity. By applying this idea, a parallel theory for these two cases is established and it provides sufficient conditions that are easy to verify in applications.
33
Kau, Ta-Li, and 高大立. "Recursive Programming Learning System - Using Completion Strategy." Thesis, 1996. http://ndltd.ncl.edu.tw/handle/68266504120318788420.
Full textAbstract:
碩士國立臺灣師範大學
資訊教育學系
84
Recursion is a fundamental concept in computer science. Computer science educators have found that recursion is a very difficult concept for students tolearn and students generally avoid using recursion. Since the recursive conceptis usually completely novel for novice student and there are very few analogs that exists, students like to find the analogies come from programming itself. In many cases, however, they were not experienced enough to deeply understand all dissimilarities of different tasks. They often simplified the analog mappingprocess and generated an erroneous solution, even tended spontaneously to develop an inappropriate mental model of recursion influencing the further studying. To help novice students to learn recursion and to construct an adequate mental model of recursion, we develop a recursive programming learning systemusing completion strategy. Let students can generate and think the recursive idea systematically. The so called Completion Strategy is to use the well-designed program (a program designed by export) to allow students to makecompletion, modification and extension. The system has been evaluated as effective by a practical educationalexperiment. The results show that this system is of great help for the peoplewho want to learn the recursive programming skill.
34
Chen, Ying-li, and 陳穎立. "Multiple Alignment Analysis: Using Recursive Dynamic Programming." Thesis, 2005. http://ndltd.ncl.edu.tw/handle/88573776921218031318.
Full textAbstract:
碩士義守大學
資訊管理學系碩士班
93
Sequence alignment analysis is the most important work for gene and protein research. Dynamic programming is one of the most used algorithms to study pairwise sequence alignments. However, when the number of sequences (k) is greater than 2, two obstacles hinder the application of this method: (1)The computing time and storage space requirements increase proportionally to O(2k．nk) and O(nk), respectively, n being the length of the sequence. (2)The difficulty in the coding to deal with dynamic k. This study presents a modified algorithm, the recursive dynamic programming, to resolve the second obstacle.
35
Chen, Shih-Wei, and 陳世偉. "Recursive Quadratic Programming with Positive Definite Hessian Matrix." Thesis, 2000. http://ndltd.ncl.edu.tw/handle/38428797611905601994.
Full textAbstract:
碩士逢甲大學
機械工程學系
88
Since the feature of least number of function and gradient evaluations, VF02AD is the best parameter optimization method in solving optimal control problems or trajectory optimization problems. By using the positive definite Hessian matrix instead of the identity matrix in the minimization process at the first iteration, code VF02AD should be more efficient. The Hessian matrix is computed by the combined numerical method at first. Then a positive definite Hessian matrix is established by the eigen system method. Several typical problems are used to test the modified code. The results are satisfied.
36
Fan, Min-Hsuan, and 范敏玄. "A Programming Methodology for Designing Block Recursive Algorithms." Thesis, 2008. http://ndltd.ncl.edu.tw/handle/02350289937419320947.
Full textAbstract:
博士逢甲大學
資訊工程所
96
Programming methodology is the use of a formal method in specification and construction of algorithms, programs and large software systems. The research of programming methodology is related to distributed systems programming, hardware design, multiprocessor systems, parallel programming. In this thesis, we use tensor product theory to construct a programming methodology for block recursive algorithm. The thesis contains three parts. In the first part, we propose a programming methodology for various block recursive algorithms. Some important computation problems are known as block recursive algorithms. For examples, parallel prefix algorithms, fast Fourier transform algorithms, and matrix transpose algorithms are all block recursive algorithms. We illustrate the parallel prefix and fast Fourier transform computation problems as examples to explain the methodology in details. We show how the tensor product theory can be applied on the research of programming methodology. In the second part, we propose a programming methodology to design a block recursive algorithm on various computer interconnection networks. Tensor product notation has been used to describe some direct and indirect interconnection networks. It allows us generate parallel programs for a specified interconnection network to be possible. We use parallel prefix computation problem as example to illustrate the methodology. We obtain a tensor product formula that represents an algorithm for the parallel prefix problem on the specified network. The networks include hypercube network, omega network, and baseline network. In the third part, we apply the result of parallel prefix algorithm on baseline network to design a parallel prefix adder. We find a circular multistage design for a prefix adder. The design is derived from parallel prefix on baseline network and topological equivalence between baseline network and omega network. Since the special property of omega network, we obtain a circular multistage prefix adder design with area complexity O(N).
37
Chou, Chen-Fong, and 周辰峰. "Multiple Alignment Analysis:Improving Memory Requirement of Recursive Dynamic Programming." Thesis, 2007. http://ndltd.ncl.edu.tw/handle/58118319098191666492.
Full textAbstract:
碩士義守大學
資訊管理學系碩士班
95
Bioinformatics is the study of biology and computer technology. The advancement on sequencing technology has made a lot of protein and DNA sequence information available. Sequence alignment has become one of the key techniques in sequence analysis. Dynamic programming is one of the major methods used in pairwise sequence alignment. When extended to multiple sequence alignment, this method requires complexity in time and memory of O(2k nk) and O(nk), respectively, where k is the number of sequences and n the length of a sequence. This raises problems of needing too much resource and cannot be used efficiently. Our study uses recursive dynamic programming to receive multiple sequences as input and do the analysis. In addition, we work on the improvement on memory allocation to ease the resource loading, as well as bring up the notion of “fixed range” to analyze sequence similarity with or without space being added.
38
陳樹中. "The Development and Application of Recursive Programming Learning System for Novice." Thesis, 2013. http://ndltd.ncl.edu.tw/handle/61866808213065556781.
Full textAbstract:
碩士臺北市立教育大學
資訊科學系碩士班
101
Taiwan has been known for its information technology research and development, and the computer programming is supposed to be key competence of students who graduate from computer science departments. Recursion is not only one of the important concepts of programming, but it is also utilized as a skill of programming and as a means of problem solving. However, students are not generally seen to work effectively when learning the recursive concepts because most of them cannot finish writing a well-designed program of recursion, the essence of which has frequently confused the novices in particular so much that they have difficulties developing proper mental models. Programming novices, as a result, lose their interests and confidence in designing recursive programs. In this research, a recursive programming learning system is developed, and a learning experiment is carried out to investigate the effect of novices’ recursion learning achievement, learning attitudes, and self-efficacy. The study adopts single-group quasi-experiment design to conduct an experiment of recursive program learning. The experimental group consisted of 47 students who take the course of data structure offered by the Department of Computer Science of a university in Taipei City. After two-time system operating training, the students are asked to work on their own self-directed learning out of the school time. The experiment lasts for 1.5 months. The instruments including recursion achievement test, recursion learning attitude, recursion self-efficacy, evaluation of recursion learning system are used for measuring the programming effects. In addition, this study analyzes the correlation between the learners’ habits, time, frequency to login the system, and the learners’ progressive improvement of recursion after using the recursion learning system. The major findings are shown as follows: 1. This study adopted the web technology to develop a recursion learning system (ARLS for short) with tutor agent mechanism, dynamic assessment and multimedia materials. Over 60% students showed positive attitudes toward the learning effect of recursion after one and half month testing ARLS. Most of experts considered the system will be useful for assisting undergraduate students to learn recursive concepts. 2. There are significant improvements on recursion achievement test for low and medium recursion achievement students. There is significant difference between novices’ mental model on base case and passive flow. There is an apparently positive relation among the learners’ progressive improvement of recursion, the frequency to login the system¸ and use of recursion learning media. 3. The difference among the learners’ recursion learning attitudes on the dimension of interest, confidence, and usefulness is significant. 4. There is significant difference among the learners’ recursion self-efficacy on the dimension of hard-working, facing challenging, and the influence of environment. Further, in order to promote the learners’ interest and increase the learners’ recursion self-efficacy, game-based learning strategy and incentive mechanism is useful for teaching recursion concepts in the future study.
39
(7043171), Nikhil Hegde. "Distributed Execution of Recursive Irregular Applications." Thesis, 2019.
Find full textAbstract:
Massive computing power and applications running on this power, primarily confined to expensive supercomputers a decade ago, have now become mainstream through the availability of clusters with commodity computers and high-speed interconnects running big-data era applications. The challenges associated with programming such systems, for effectively utilizing the computing power, have led to the creation of intuitive abstractions and implementations targeting average users, domain experts, and savvy (parallel) programmers. There is often a trade-off between the ease of programming and performance when using these abstractions. This thesis develops tools to bridge the gap between ease of programming and performance of irregular programs—programs that involve one or more of irregular- data structures, control structures, and communication patterns—on distributed-memory systems. Irregular programs are focused heavily in domains ranging from data mining to bioinformatics to scientific computing. In contrast to regular applications such as stencil codes and dense matrix-matrix multiplications, which have a predictable pattern of data access and control flow, typical irregular applications operate over graphs, trees, and sparse matrices and involve input-dependent data access pattern and control flow. This makes it difficult to apply optimizations such as those targeting locality and parallelism to programs implementing irregular applications. Moreover, irregular programs are often used with large data sets that prohibit single-node execution due to memory limitations on the node. Hence, distributed solutions are necessary in order to process all the data.
In this thesis, we introduce SPIRIT, a framework consisting of an abstraction and a space-adaptive runtime system for simplifying the creation of distributed implementations of recursive irregular programs based on spatial acceleration structures. SPIRIT addresses the insufficiency of traditional data-parallel approaches and existing systems in effectively parallelizing computations involving repeated tree traversals. SPIRIT employs locality optimizations applied in a shared-memory context, introduces a novel pipeline-parallel approach to execute distributed traversals, and trades-off performance with memory usage to create a space-adaptive system that achieves a scalable performance, and outperforms implementations done in contemporary distributed graph processing frameworks.
In this thesis, we introduce SPIRIT, a framework consisting of an abstraction and a space-adaptive runtime system for simplifying the creation of distributed implementations of recursive irregular programs based on spatial acceleration structures. SPIRIT addresses the insufficiency of traditional data-parallel approaches and existing systems in effectively parallelizing computations involving repeated tree traversals. SPIRIT employs locality optimizations applied in a shared-memory context, introduces a novel pipeline-parallel approach to execute distributed traversals, and trades-off performance with memory usage to create a space-adaptive system that achieves a scalable performance, and outperforms implementations done in contemporary distributed graph processing frameworks.
We next introduce Treelogy to understand the connection between optimizations and tree-algorithms. Treelogy provides an ontology and a benchmark suite of a broader class of tree algorithms to help answer: (i) is there any existing optimization that is applicable or effective for a new tree algorithm? (ii) can a new optimization developed for a tree algorithm be applied to existing tree algorithms from other domains? We show that a categorization (ontology) based on structural properties of tree- algorithms is useful for both developers of new optimizations and new tree algorithm creators. With the help of a suite of tree traversal kernels spanning the ontology, we show that GPU, shared-, and distributed-memory implementations are scalable and the two-point correlation algorithm with vptree performs better than the standard kdtree implementation.
In the final part of the thesis, we explore the possibility of automatically generating efficient distributed-memory implementations of irregular programs. As manually creating distributed-memory implementations is challenging due to the explicit need for managing tasks, parallelism, communication, and load-balancing, we introduce a framework, D2P, to automatically generate efficient distributed implementations of recursive divide-conquer algorithms. D2P automatically generates a distributed implementation of a recursive divide-conquer algorithm from its specification, which is a high-level outline of a recursive formulation. We evaluate D2P with recursive Dynamic programming (DP) algorithms. The computation in DP algorithms is not irregular per se. However, when distributed, the computation in efficient recursive formulations of DP algorithms requires irregular communication. User-configurable knobs in D2P allow for tuning the amount of available parallelism. Results show that D2P programs scale well, are significantly better than those produced using a state-of-the-art framework for parallelizing iterative DP algorithms, and outperform even hand-written distributed-memory implementations in most cases.
40
(9805715), Zhigang Huang. "A recursive algorithm for reliability assessment in water distribution networks with applications of parallel programming techniques." Thesis, 1994. https://figshare.com/articles/thesis/A_recursive_algorithm_for_reliability_assessment_in_water_distribution_networks_with_applications_of_parallel_programming_techniques/13425371.
Full textAbstract:
Project models the reliability of an urban water distribution network.. Reliability is one of the fundamental considerations in the design of urban water distribution networks. The reliability of a network can be modelled by the probability of the connectedness of a stochastic graph. The enumeration of a set of cuts of the graph, and the calculation of the disjoint probability products of the cuts, are two fundamental steps in the network reliability assessment. An improved algorithm for the enumeration of all the minimal cutsets of a graph is presented. Based on this, a recursive algorithm for the enumeration of all Buzacott cuts (a particular set of ordered cuts) of a graph has been developed. The final algorithm presented in this thesis incorporates the enumeration of Buzacott cuts and the calculation of the disjoint probability products of the cuts to obtain the network reliability. As a result, it is tightly coupled, and very efficient. Experimental results show that this algorithm has a higher efficiency than other reported methods. The parallelism existing in the reliability assessment is investigated. The final algorithm has been implemented in a concurrent computer program. The effectiveness of parallel programming techniques in reducing the computing time required by the reliability assessment has also been discussed.
41
He, Yuxiong, and Junqing Wang. "On-the-fly Race Detection for Programs with Recursive Spawn-Sync Parallelism." 2003. http://hdl.handle.net/1721.1/3868.
Full textAbstract:
Detecting data race is very important for debugging shared-memory parallel programs, because data races result in unintended nondeterministic execution of the program. We propose a dynamic on-the-fly race detection mechanism called Parallel Nondeterminator to check for determinacy races during the parallel execution of a program with recursive spawn-sync parallelism. A modified version of Nested Region Labeling scheme is developed for the concurrency relationship test in the spawn-sync parallel structure. Through the identification of Least Common Ancestor in the spawn tree, the Parallel Nondeterminator only needs to keep two read access records and one write access record for each shared location. The work and critical path in the instrumented codes are analyzed as well as time complexity and space requirements. Let N denote the maximum depth of the recursion in the parallel program. The worst case time increased for each spawn and sync operation is O(N) and the time required to monitor any shared memory location is O(lgN). Moreover, Parallel Nondeterminator is able to execute the race detection code without loss of parallelism of the original program. In summary, the Parallel Non-determinator represents a provably efficient strategy for detecting data races for shared-memory parallel programs.Singapore-MIT Alliance (SMA)
42
"Nontermination debugging of Prolog programs." Chinese University of Hong Kong, 1992. http://library.cuhk.edu.hk/record=b5887742.
Full textAbstract:
by Lam, Hin-ki Isaac.Thesis (M.Phil.)--Chinese University of Hong Kong, 1992.
Includes bibliographical references (leaves 219-220).
Chapter Chapter 1 --- Introduction --- p.1
Chapter 1.1 --- The Problem --- p.1
Chapter 1.2 --- Related Works --- p.3
Chapter 1.3 --- Contribution of the Present Study --- p.8
Chapter 1.4 --- Outline of the Thesis --- p.8
Chapter Chapter 2 --- Nontermination and Recursive Definition --- p.11
Chapter 2.1 --- Prolog Execution Model --- p.11
Chapter 2.2 --- Nontermination --- p.15
Chapter 2.3 --- Exit Condition --- p.21
Chapter 2.4 --- Exit-Reaching Process --- p.29
Chapter 2.5 --- Parameter Based Detection --- p.35
Chapter Chapter 3 --- Parameter Analysis --- p.38
Chapter 3.1 --- Parameter Links --- p.39
Chapter 3.1.1 --- Parameter Links and Parameter Modifying Process --- p.39
Chapter 3.1.2 --- Parameter Links of Multi-Parameters --- p.43
Chapter 3.1.3 --- Parameter Links in Indirect Recursive Definition --- p.44
Chapter 3.1.4 --- Parameter Links with Special Parameters --- p.46
Chapter 3.1.5 --- Parameter Links of the Same Name Parameters --- p.47
Chapter 3.1.6 --- The Significance of Parameter Links --- p.49
Chapter 3.2 --- Cyclic Parameter Links --- p.51
Chapter 3.3 --- Parameter Link Detection --- p.58
Chapter 3.3.1 --- Graph Technique --- p.58
Chapter 3.3.1.1 --- Preliminaries --- p.58
Chapter 3.3.1.2 --- on Parameter Links --- p.59
Chapter 3.3.2 --- Algorithms --- p.62
Chapter Chapter 4 --- Data Analysis --- p.70
Chapter 4.1 --- Data Links --- p.72
Chapter 4.1.1 --- The Direct Recursive Definition Case --- p.76
Chapter 4.1.1.1 --- Subgoal Procedures with Facts Alone --- p.76
Chapter 4.1.1.2 --- Procedures with Rules --- p.79
Chapter 4.1.2 --- The Indirect Recursive Definition Case --- p.84
Chapter 4.2 --- on the Difference between Pure and General Prolog --- p.86
Chapter 4.3 --- Data Link Significance --- p.89
Chapter 4.4 --- Connected Data-link Lists --- p.92
Chapter 4.4.1 --- Data Links and Connected Data-link Lists --- p.92
Chapter 4.4.1.1 --- Connected Data-link Lists and Data Transfer Sequence --- p.95
Chapter 4.4.1.2 --- Connected Data-link Lists and Backtracking --- p.97
Chapter 4.4.1.3 --- Connected Data-link Lists and the Recursion Result --- p.99
Chapter 4.4.2 --- Cyclic and Non-Cyclic Connected Data-link Lists --- p.100
Chapter 4.4.2.1 --- Non-Cyclic Connected Data-link Lists and Exit Conditions --- p.102
Chapter 4.4.2.2 --- Cyclic Connected Data-link Lists and Nontermination --- p.104
Chapter 4.4.3 --- Multi-Connected Data-link Lists --- p.107
Chapter 4.4.3.1 --- in One Cyclic Parameter Link --- p.107
Chapter 4.4.3.2 --- in Multi-Cyclic Parameter Links --- p.115
Chapter 4.4.3.3 --- The Case of Multiple Recursive Subgoals in the Same Rule --- p.120
Chapter 4.5. --- Special Parameters and Data Links --- p.125
Chapter 4.5.1. --- Data Links with Special Parameters Only --- p.126
Chapter 4.5.2 --- Data Links with Both Special Parameters and Subgoals --- p.136
Chapter 4.6 --- Data Links and Infinite Data Transfer Sequence Detection --- p.142
Chapter CHAPTER 5 --- Special Cases --- p.150
Chapter 5.1 --- Interdependent Cyclic Parameter Links --- p.150
Chapter 5.1.1 --- Interdependent Cyclic Parameter Links through Common Parameters --- p.151
Chapter 5.1.1.1 --- Interdependency between Cyclic and Non-cyclic Parameter Links and Interdependency between Cyclic Parameter Link and Subgoals --- p.158
Chapter 5.1.1.2 --- Interdependency between Cyclic Parameter Links --- p.165
Chapter 5.1.1.2.1 --- Lengths of Cyclic Connected- data Links in Different Ratios --- p.171
Chapter 5.1.1.2.2 --- Cyclic Parameter Links with Lengths in Different Ratios --- p.182
Chapter 5.1.2 --- Interdependent Cyclic Parameter Links through Common Subgoals --- p.196
Chapter 5.1.3 --- Interdependent Cyclic Parameter Links with Special Parameters --- p.202
Chapter 5.2 --- A Special Case of Cyclic Parameter Links established through Special Parameters --- p.208
Chapter CHAPTER 6 --- Discussion and Conclusion --- p.213
Chapter 6.1 --- The Results and Implications --- p.213
Chapter 6.2 --- Limitations and Future Research --- p.215
Chapter 6.3 --- Conclusion --- p.217
Reference --- p.219
43
Guindon, David Leo. "Design of nearly linear-phase recursive digital filters by constrained optimization." Thesis, 2007. http://hdl.handle.net/1828/296.
Full textAbstract:
The design of nearly linear-phase recursive digital filters using constrained optimization is investigated. The design technique proposed is expected to be useful in applications where both magnitude and phase response specifications need to be satisfied. The overall constrained optimization method is formulated as a quadratic programming problem based on Newton’s method. The objective function, its gradient vector and Hessian matrix as well as a set of linear constraints are derived. In this analysis, the independent variables are assumed to be the transfer function coefficients. The filter stability issue and convergence efficiency, as well as a ‘real axis attraction’ problem are solved by integrating the corresponding bounds into the linear constraints of the optimization method. Also, two initialization techniques for providing efficient starting points for the optimization are investigated and the relation between the zero and pole positions and the group delay are examined. Based on these ideas, a new objective function is formulated in terms of the zeros and poles of the transfer function expressed in polar form and integrated into the optimization process. The coefficient-based and polar-based objective functions are tested and compared and it is shown that designs using the polar-based objective function produce improved results. Finally, several other modern methods for the design of nearly linear-phase recursive filters are compared with the proposed method. These include an elliptic design combined with an optimal equalization technique that uses a prescribed group delay, an optimal design method with robust stability using conic-quadratic-programming updates, and an unconstrained optimization technique that uses parameterization to guarantee filter stability. It was found that the proposed method generates similar or improved results in all comparative examples suggesting that the new method is an attractive alternative for linear-phase recursive filters of orders up to about 30.
44
Cao, Son. "Methods for evaluating queries to Horn knowledge bases in first-order logic." Doctoral thesis, 2015.
Find full textAbstract:
Horn knowledge bases are extensions of Datalog deductive databases without the range-restrictedness and function-free conditions. A Horn knowledge base consists of a positive logic program for defining intensional predicates and an instance of extensional predicates. This dissertation concentrates on developing efficient methods for evaluating queries to Horn knowledge bases. In addition, a method for evaluating queries to stratified knowledge bases is also investigated. This topic has not been well studied as query processing for Datalog-like deductive databases or the theory and techniques of logic programming.We begin with formulating query-subquery nets and use them to create the first framework for developing algorithms for evaluating queries to Horn knowledge bases with the following good properties: the approach is goal-directed; each subquery is processed only once; each supplement tuple, if desired, is transferred only once; operations are done set-at-a-time; and any control strategy can be used. Our intention is to increase efficiency of query processing by eliminating redundant computation, increasing adjustability (i.e., easiness in adopting advanced control strategies) and reducing the number of accesses to the secondary storage. The framework forms a generic evaluation method called QSQN. It is sound and complete, and has polynomial time data complexity when the term-depth bound is fixed. Next, we incorporate tail-recursion elimination into query-subquery nets in order to formulate the QSQN-TRE evaluation method for Horn knowledge bases. The aim is to reduce materializing the intermediate results during the processing of a query with tail-recursion. We prove the soundness and completeness of the proposed method and show that, when the term-depth bound is fixed, the method has polynomial time data complexity. We then extend QSQN-TRE to obtain another evaluation method called QSQN-rTRE, which can eliminate not only tail-recursive predicates but also intensional predicates that appear rightmost in the bodies of the program clauses.We also incorporate stratified negation into query-subquery nets to obtain a method called QSQN-STR for evaluating queries to stratified knowledge bases.We propose the control strategies DAR, DFS, IDFS and implement the methods QSQN, QSQN-TRE, QSQN-rTRE together with these strategies. Then, we carry out experiments to obtain a comparison between these methods (using the IDFS control strategy) and the other well-known evaluation methods such as Magic-Sets and QSQR. We also report experimental results of QSQN-STR using a control strategy called IDFS2, which is a modified version of IDFS. The experimental results confirm the efficiency and usefulness of the proposed evaluation methods.Bazy wiedzy typu Horna są uogólnieniem dedukcyjnych baz danych Datalogu bez ograniczeń o zakresie zmiennych i z możliwością korzystania z symboli funkcyjnych. Baza wiedzy typu Horn składa się z pozytywnego programu w logice definiującego predykaty intensjonalne i instancji ekstensjonalnych predykatów. Niniejsza rozprawa dotyczy efektywnych metod obliczania zapytań do baz wiedzy typu Horna. Omówiona jest również metoda obliczania zapytań do stratyfikowanych baz wiedzy. Problematyka ta nie była do tej pory tak dobrze zbadana, jak przetwarzanie zapytań dla dedukcyjnych baz danych czy teoria i techniki programowania w logice. W pierwszej części rozprawy formułujemy sieci zapytań-podzapytań i omawiamy konstrukcję bazującej na takich sieciach metody obliczania zapytań do baz wiedzy typu Horna, o następujących dobrych własnościach: zastosowane podejście jest zorientowane na cel; każde podzapytanie jest przetwarzane tylko raz; każda krotka uzupełniająca jest przesyłana tylko raz, o ile jest to pożądane; operacje są wykonywane zbiorowo; każda strategia sterowania może być używana. Intencją tej metody jest zwiększenie efektywności przetwarzania zapytań poprzez wyeliminowanie zbędnych obliczeń, ułatwienie stosowania zaawansowanych strategii sterowania oraz zredukowanie liczby odczytów i zapisów dyskowych. Ogólna taka metoda jest nazwana QSQN. Jest ona poprawna i pełna oraz ma złożoność wielomianową względem danych ekstensjonalnych, o ile głębokość zagnieżdżenia termów jest ograniczona. W dalszej części rozprawy przedstawiona jest technika włączania eliminacji rekurencji ogonowej do sieci zapytań-podzapytań i uzyskana w ten sposób metoda obliczania zapytań QSQN-TRE dla baz wiedzy typu Horna. Celem takiej eliminacji jest redukcja zachowywania wyników pośrednich podczas przetwarzania zapytań z rekurencją ogonową. Udowodniono, że metoda QSQN-TRE jest poprawna i pełna oraz ma złożoność wielomianową względem danych ekstensjonalnych, o ile głębokość zagnieżdżenia termów jest ograniczona. Jako rozszerzenie metody QSQN-TRE została opracowana również inna metoda obliczania zapytań o nazwie QSQN-rTRE, która pozwala wyeliminować nie tylko predykaty ogonowo rekurencyjne, ale również predykaty intensjonalne, występujące na końcu ciała pewnej klauzuli programu.Opracowane zostały również sieci zapytań-podzapytań i odpowiednia metoda o nazwie QSQN-STR do obliczania zapytań do stratyfikowanych baz wiedzy. Takie bazy wiedzy umożliwiają użycie bezpiecznych literałów negatywnych w ciałach klauzul programu. Metody QSQN, QSQN-TRE i QSQN-rTRE zostały zaimplementowane z trzema zaproponowanymi strategiami sterowania DAR, DFS i IDFS. Przeprowadzone zostały eksperymenty mające na celu porównanie tych metod (używających strategii sterowania IDFS) z innymi znanymi metodami obliczania zapytań, takimi jak Magic-Sets i QSQR. Omówione zostały również wyniki eksperymentów działania metody QSQN-STR ze strategią sterowania IDFS2 będącą zmodyfikowaną wersją IDFS. Wyniki przeprowadzonych eksperymentów potwierdzają skuteczność i przydatność opracowanych metod obliczania zapytań.
45
Tsung-Chun, Hsu, and 徐宗醇. "Cognitive Diagnosis of Learning Path in C++ Programming Language based on Rule Space Model：A Study of Recursion and Pointer Implementation." Thesis, 2012. http://ndltd.ncl.edu.tw/handle/61873362236495999966.
Full textAbstract:
碩士中華大學
資訊管理學系碩士班
100
Programming is very easy to teaching difficulties, because the students just beginning to learn, often because of the previous section cannot understand and then influence the next chapter to learn, so prone to frustration resulting in learning better. How to allow students to enhance program capacity, and often have always been teachers in the most difficult problems. In the present study will be "Recursion" and "Pointer", for example .This study the definition of knowledge attributes to derive the best learning path to enable teachers to strengthen the weaker part of the concept of students' knowledge, so that students improve their learning outcomes into. Rule Space Model (RSM) analysis used in this study, The cognitive diagnostic measurement which test students to identify students' difficulties in learning, After the analyzing, this method provides the learning path. Rule Space Model strengthen the teaching, Teachers select the remediation content for students. The experimental results showed that students have better learning performance in the posttest than in pretest.
46
Zimmermann, Maëlle. "Route choice and traffic equilibrium modeling in multi-modal and activity-based networks." Thèse, 2019. http://hdl.handle.net/1866/22664.
Full text