subject:(Lisp)

1. Phung, Chi Dung. Enriching the internet control-plane for improved traffic engineering : Amélioration du plan de contrôle d'internet avec de nouvelles solutions d'ingénierie de trafic.

Degree: Docteur es, Informatique, 2018, Sorbonne université

URL: http://www.theses.fr/2018SORUS017

► L'un des défis majeurs de l'évolution de l'architecture Internet est la définition d'une architecture protocolaire permettant d'améliorer le routage, et en particulier (i) conserver un… (more)

▼ L'un des défis majeurs de l'évolution de l'architecture Internet est la définition d'une architecture protocolaire permettant d'améliorer le routage, et en particulier (i) conserver un système de routage gérable avec les technologies actuelles et futures c'est-à-dire, avec quelques millions d'états, (ii) offrir une architecture apte à faciliter la programmabilité du plan de transfert, (iii) proposer un système de routage évolutif pouvant être régulièrement optimisé avec uniquement les informations sur les flux actifs, (iv) fournir une séparation entre localisateurs et identificateurs pour la mobilité IP avancée, (v) faciliter un déploiement incrémental, (vi) mieux servir les services applicatifs "over-the-top". Le protocole LISP (it{Locator/Identifier Separation Protocol}) a été identifié comme l'un des protocoles émergents à cet égard. Dans son état actuel, il répond très bien aux besoins susmentionnés. Cependant, il subit des limitations lorsqu'il s'agit de prendre en compte la résilience et la capacité à réagir rapidement aux mises à jour de l'état du réseau. Ces inconvénients peuvent être compensés en améliorant l'architecture du plan de contrôle et ses algorithmes de routage. Dans cette thèse, nous proposons une nouvelle architecture réseau-système et expérimentons de nouvelles primitives de plan de contrôle, ainsi que d'algorithmes de diffusion des états, en testant son passage à l'échelle avec différentes conditions de réseau. Nous concevons et construisons d'abord un nœud de plan de données et de plan de contrôle LISP open source. Nous le comparons avec d'autres implémentations en montrant que notre implémentation atteint des performances adaptées aux vrais déploiements. Nous montrons comment notre implémentation a permis la mise en oeuvre d'une plateforme d'expérimentation à grande échelle, la plate-forme LISP-Lab, en opération aussi bien les fonctions de plan de transfert que les fonctions de plan de contrôle. En suite, nous proposons une nouvelle solution pour les migrations à chaud de machines virtuelles à travers des centres de données géographiquement répartis sur des réseaux IP étendus. Des tests dans un testbed réel connecté nativement à Internet montrent qu'avec notre approche, nous pouvons facilement atteindre des temps d'arrêt inférieurs à la seconde lors de la migration sur une grande échelle, même pour des clients très distants. En outre, nous avons étudié des protocoles d'optimisation de réseau multicouche, en particulier en relation avec le protocole MPTCP (Multipath Transport Control Protocol), auquel LISP peut offrir une diversité de chemins pour l’agrégation de bande passante, ainsi qu’une plus grande confidentialité et fiabilité des connexions. Bien que nous ne puissions bénéficier que de quelques nœuds de réseau superposés, nous avons pu évaluer expérimentalement nos propositions en montrant l'impact positif de notre solution, l'impact négatif des longs temps d'aller-rétour sur certains sous-flux MPTCP, et la forte corrélation entre le temps d'aller-retour différentiel et le débit.… Advisors/Committee Members: Secci, Stefano (thesis director).

Subjects/Keywords: LISP; LISP-lab; Migration de VM; MPTCP; Gestion du trafic; Architecture réseau; LISP; MPTCP; Traffic engineering; 004.62

Record Details Similar Records Cite « Share

❌

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6^th Edition):

Phung, C. D. (2018). Enriching the internet control-plane for improved traffic engineering : Amélioration du plan de contrôle d'internet avec de nouvelles solutions d'ingénierie de trafic. (Doctoral Dissertation). Sorbonne université. Retrieved from http://www.theses.fr/2018SORUS017

Chicago Manual of Style (16^th Edition):

Phung, Chi Dung. “Enriching the internet control-plane for improved traffic engineering : Amélioration du plan de contrôle d'internet avec de nouvelles solutions d'ingénierie de trafic.” 2018. Doctoral Dissertation, Sorbonne université. Accessed February 28, 2021. http://www.theses.fr/2018SORUS017.

MLA Handbook (7^th Edition):

Phung, Chi Dung. “Enriching the internet control-plane for improved traffic engineering : Amélioration du plan de contrôle d'internet avec de nouvelles solutions d'ingénierie de trafic.” 2018. Web. 28 Feb 2021.

Vancouver:

Phung CD. Enriching the internet control-plane for improved traffic engineering : Amélioration du plan de contrôle d'internet avec de nouvelles solutions d'ingénierie de trafic. [Internet] [Doctoral dissertation]. Sorbonne université; 2018. [cited 2021 Feb 28]. Available from: http://www.theses.fr/2018SORUS017.

Council of Science Editors:

Phung CD. Enriching the internet control-plane for improved traffic engineering : Amélioration du plan de contrôle d'internet avec de nouvelles solutions d'ingénierie de trafic. [Doctoral Dissertation]. Sorbonne université; 2018. Available from: http://www.theses.fr/2018SORUS017

University of Debrecen

2. Juhász, Béla. A 2004-es ICFP programozási verseny megvalósítása Clojure funkcionális nyelven .

Degree: DE – TEK – Informatikai Kar, 2011, University of Debrecen

URL: http://hdl.handle.net/2437/119752

A dolgozat a 2004-es ICFP programozási verseny egyik részfeladatának a megoldását tartalmazza: egy fordítóprogramot készítettem a Clojure funkcionális programozási nyelven. A dolgozat a program implementációjának bemutatása mellett rövid áttekintést tartalmaz a funkcionális nyelvekről, külön kitérve a Lisp és Clojure nyelvekre. Advisors/Committee Members: Papp, Zoltán (advisor).

Subjects/Keywords: Lisp; Clojure; funkcionális programozás; funkcionális nyelvek

Record Details Similar Records Cite « Share

❌

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6^th Edition):

Juhász, B. (2011). A 2004-es ICFP programozási verseny megvalósítása Clojure funkcionális nyelven . (Thesis). University of Debrecen. Retrieved from http://hdl.handle.net/2437/119752

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16^th Edition):

Juhász, Béla. “A 2004-es ICFP programozási verseny megvalósítása Clojure funkcionális nyelven .” 2011. Thesis, University of Debrecen. Accessed February 28, 2021. http://hdl.handle.net/2437/119752.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7^th Edition):

Juhász, Béla. “A 2004-es ICFP programozási verseny megvalósítása Clojure funkcionális nyelven .” 2011. Web. 28 Feb 2021.

Vancouver:

Juhász B. A 2004-es ICFP programozási verseny megvalósítása Clojure funkcionális nyelven . [Internet] [Thesis]. University of Debrecen; 2011. [cited 2021 Feb 28]. Available from: http://hdl.handle.net/2437/119752.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Juhász B. A 2004-es ICFP programozási verseny megvalósítása Clojure funkcionális nyelven . [Thesis]. University of Debrecen; 2011. Available from: http://hdl.handle.net/2437/119752

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Université Catholique de Louvain

3. Saucez, Damien. Mechanisms for interdomain traffic engineering with LISP.

Degree: 2011, Université Catholique de Louvain

URL: http://hdl.handle.net/2078.1/92231

►

Internet is composed of the inter-connection of tens of thousands of independent networks called Autonomous Systems (ASes). ASes that only provide connectivity to the other… (more)

▼

Internet is composed of the inter-connection of tens of thousands of independent networks called Autonomous Systems (ASes). ASes that only provide connectivity to the other ASes are called Internet Service Providers (ISPs). The vast majority of ASes in the Internet are multi-homed with several ISPs to reduce their costs and improve their capacity and robustness. Multi-homing increases the path diversity and thus might enable ASes to choose better quality paths. Unfortunately, the current Internet design does not allow to optimize routing for performance. Indeed, the routes are propagated gradually from AS to AS. If an AS has several routes for a given destination, it can only advertise and use its best one. In addition, the current Internet routing suffers from scalability issues. As a consequence, ASes lack of control on the traffic entering their network. In this thesis, we propose new techniques to enable performance based interdomain incoming traffic engineering. These techniques allow any AS to control its incoming traffic to follow paths that optimize the efficiency (e.g., minimize the delay or maximize the bandwidth). For that purpose, we first introduce a system that allows an AS to control its incoming traffic in a scalable way. This system relies on the Locator/ID Separation Protocol (LISP). We improve the scalability and the robustness of the LISP control-plane with LISP-Tree. Afterward, we present a system that is able to rank the paths in order to determine the best path according to any arbitrary performance criterion. We call this system IDIPS (for ISP-Driven Informed Path Selection). Finally, we show how to combine LISP, LISP-Tree, and IDIPS to achieve performance based interdomain incoming traffic engineering.

(FSA 3) – UCL, 2011

Advisors/Committee Members: UCL - SST/ICTM/INGI - Pôle en ingénierie informatique, Bonaventure, Olivier, Dupont, Pierre, Van Roy, Peter, Lobelle, Marc, Owesarski, Philippe, Rougier, Jean-Louis, Mathy, Laurent.

Subjects/Keywords: IDIPS; ISP-Driven Infromed Path Selection; LISP; Locator/ID Separation Protocol; Traffic engineering; LISP-Tree; Performance; Interdomain

Record Details Similar Records Cite « Share

❌

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6^th Edition):

Saucez, D. (2011). Mechanisms for interdomain traffic engineering with LISP. (Thesis). Université Catholique de Louvain. Retrieved from http://hdl.handle.net/2078.1/92231

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16^th Edition):

Saucez, Damien. “Mechanisms for interdomain traffic engineering with LISP.” 2011. Thesis, Université Catholique de Louvain. Accessed February 28, 2021. http://hdl.handle.net/2078.1/92231.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7^th Edition):

Saucez, Damien. “Mechanisms for interdomain traffic engineering with LISP.” 2011. Web. 28 Feb 2021.

Vancouver:

Saucez D. Mechanisms for interdomain traffic engineering with LISP. [Internet] [Thesis]. Université Catholique de Louvain; 2011. [cited 2021 Feb 28]. Available from: http://hdl.handle.net/2078.1/92231.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Saucez D. Mechanisms for interdomain traffic engineering with LISP. [Thesis]. Université Catholique de Louvain; 2011. Available from: http://hdl.handle.net/2078.1/92231

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Oregon State University

4. Harney, Donald William. An implementation of a parallel processing package in LISP.

Degree: MS, Computer Science, 1976, Oregon State University

URL: http://hdl.handle.net/1957/43371

► The concept of a process is often used in connection with operations of parts of a computer system. This thesis discusses processes in terms of… (more)

Subjects/Keywords: LISP (Computer program language)

Record Details Similar Records Cite « Share

❌

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6^th Edition):

Harney, D. W. (1976). An implementation of a parallel processing package in LISP. (Masters Thesis). Oregon State University. Retrieved from http://hdl.handle.net/1957/43371

Chicago Manual of Style (16^th Edition):

Harney, Donald William. “An implementation of a parallel processing package in LISP.” 1976. Masters Thesis, Oregon State University. Accessed February 28, 2021. http://hdl.handle.net/1957/43371.

MLA Handbook (7^th Edition):

Harney, Donald William. “An implementation of a parallel processing package in LISP.” 1976. Web. 28 Feb 2021.

Vancouver:

Harney DW. An implementation of a parallel processing package in LISP. [Internet] [Masters thesis]. Oregon State University; 1976. [cited 2021 Feb 28]. Available from: http://hdl.handle.net/1957/43371.

Council of Science Editors:

Harney DW. An implementation of a parallel processing package in LISP. [Masters Thesis]. Oregon State University; 1976. Available from: http://hdl.handle.net/1957/43371

Oregon State University

5. Mirashrafi, Mojtaba. LIL : a LISP implementation language.

Degree: MS, Computer Science, 1988, Oregon State University

URL: http://hdl.handle.net/1957/39889

► High-level languages provide a convenient environment for program development as well as ease of source code portability. Unfortunately the degree of portability of the programs… (more)

Subjects/Keywords: LISP (Computer program language)

Record Details Similar Records Cite « Share

❌

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6^th Edition):

Mirashrafi, M. (1988). LIL : a LISP implementation language. (Masters Thesis). Oregon State University. Retrieved from http://hdl.handle.net/1957/39889

Chicago Manual of Style (16^th Edition):

Mirashrafi, Mojtaba. “LIL : a LISP implementation language.” 1988. Masters Thesis, Oregon State University. Accessed February 28, 2021. http://hdl.handle.net/1957/39889.

MLA Handbook (7^th Edition):

Mirashrafi, Mojtaba. “LIL : a LISP implementation language.” 1988. Web. 28 Feb 2021.

Vancouver:

Mirashrafi M. LIL : a LISP implementation language. [Internet] [Masters thesis]. Oregon State University; 1988. [cited 2021 Feb 28]. Available from: http://hdl.handle.net/1957/39889.

Council of Science Editors:

Mirashrafi M. LIL : a LISP implementation language. [Masters Thesis]. Oregon State University; 1988. Available from: http://hdl.handle.net/1957/39889

Universitat Politècnica de Catalunya

6. Jakab, Loránd. Use of locator/identifier separation to improve the future internet routing system.

Degree: Departament d'Arquitectura de Computadors, 2011, Universitat Politècnica de Catalunya

URL: http://hdl.handle.net/10803/80946

► The Internet evolved from its early days of being a small research network to become a critical infrastructure many organizations and individuals rely on. One… (more)

▼ The Internet evolved from its early days of being a small research network to become a critical infrastructure many organizations and individuals rely on. One dimension of this evolution is the continuous growth of the number of participants in the network, far beyond what the initial designers had in mind. While it does work today, it is widely believed that the current design of the global routing system cannot scale to accommodate future challenges. In 2006 an Internet Architecture Board (IAB) workshop was held to develop a shared understanding of the Internet routing system scalability issues faced by the large backbone operators. The participants documented in RFC 4984 their belief that "routing scalability is the most important problem facing the Internet today and must be solved." A potential solution to the routing scalability problem is ending the semantic overloading of Internet addresses, by separating node location from identity. Several proposals exist to apply this idea to current Internet addressing, among which the Locator/Identifier Separation Protocol (LISP) is the only one already being shipped in production routers. Separating locators from identifiers results in another level of indirection, and introduces a new problem: how to determine location, when the identity is known. The first part of our work analyzes existing proposals for systems that map identifiers to locators and proposes an alternative system, within the LISP ecosystem. We created a large-scale Internet topology simulator and used it to compare the performance of three mapping systems: LISP-DHT, LISP+ALT and the proposed LISP-TREE. We analyzed and contrasted their architectural properties as well. The monitoring projects that supplied Internet routing table growth data over a large timespan inspired us to create LISPmon, a monitoring platform aimed at collecting, storing and presenting data gathered from the LISP pilot network, early in the deployment of the LISP protocol. The project web site and collected data is publicly available and will assist researchers in studying the evolution of the LISP mapping system. We also document how the newly introduced LISP network elements fit into the current Internet, advantages and disadvantages of different deployment options, and how the proposed transition mechanism scenarios could affect the evolution of the global routing system. This work is currently available as an active Internet Engineering Task Force (IETF) Internet Draft. The second part looks at the problem of efficient one-to-many communications, assuming a routing system that implements the above mentioned locator/identifier split paradigm. We propose a network layer protocol for efficient live streaming. It is incrementally deployable, with changes required only in the same border routers that should be upgraded to support locator/identifier separation. Our proof-of-concept Linux kernel implementation shows the feasibility of the protocol, and our comparison to popular peer-to-peer live streaming systems… Advisors/Committee Members: [email protected] (authoremail), false (authoremailshow), Cabellos Aparicio, Alberto (director), Domingo Pascual, Jordi (codirector), true (authorsendemail).

Subjects/Keywords: Internet; Routing; Locator; Identifier split; Corecast; Coresim; Lispmon; LISP-TREE; 621.3

Record Details Similar Records Cite « Share

❌

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6^th Edition):

Jakab, L. (2011). Use of locator/identifier separation to improve the future internet routing system. (Thesis). Universitat Politècnica de Catalunya. Retrieved from http://hdl.handle.net/10803/80946

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16^th Edition):

Jakab, Loránd. “Use of locator/identifier separation to improve the future internet routing system.” 2011. Thesis, Universitat Politècnica de Catalunya. Accessed February 28, 2021. http://hdl.handle.net/10803/80946.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7^th Edition):

Jakab, Loránd. “Use of locator/identifier separation to improve the future internet routing system.” 2011. Web. 28 Feb 2021.

Vancouver:

Jakab L. Use of locator/identifier separation to improve the future internet routing system. [Internet] [Thesis]. Universitat Politècnica de Catalunya; 2011. [cited 2021 Feb 28]. Available from: http://hdl.handle.net/10803/80946.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Jakab L. Use of locator/identifier separation to improve the future internet routing system. [Thesis]. Universitat Politècnica de Catalunya; 2011. Available from: http://hdl.handle.net/10803/80946

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

University of British Columbia

7. Hall, Wayne F. A lisp interactive programming environment.

Degree: MS- MSc, Computer Science, 1974, University of British Columbia

URL: http://hdl.handle.net/2429/18709

► An implementation of a Lisp Library is described. This Library provides a simple and uniform scheme for programmer access to a number of Lisp support… (more)

Subjects/Keywords: LISP (Computer program language)

Record Details Similar Records Cite « Share

❌

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6^th Edition):

Hall, W. F. (1974). A lisp interactive programming environment. (Masters Thesis). University of British Columbia. Retrieved from http://hdl.handle.net/2429/18709

Chicago Manual of Style (16^th Edition):

Hall, Wayne F. “A lisp interactive programming environment.” 1974. Masters Thesis, University of British Columbia. Accessed February 28, 2021. http://hdl.handle.net/2429/18709.

MLA Handbook (7^th Edition):

Hall, Wayne F. “A lisp interactive programming environment.” 1974. Web. 28 Feb 2021.

Vancouver:

Hall WF. A lisp interactive programming environment. [Internet] [Masters thesis]. University of British Columbia; 1974. [cited 2021 Feb 28]. Available from: http://hdl.handle.net/2429/18709.

Council of Science Editors:

Hall WF. A lisp interactive programming environment. [Masters Thesis]. University of British Columbia; 1974. Available from: http://hdl.handle.net/2429/18709

Pontifical Catholic University of Rio de Janeiro

8. ROSIMILDO PEREIRA DA SILVA. [en] LISP: LANGUAGE WITH OBJECT ORIENTED EXTENSIONS.

Degree: 2007, Pontifical Catholic University of Rio de Janeiro

URL: http://www.maxwell.vrac.puc-rio.br/Busca_etds.php?strSecao=resultado&nrSeq=10079

►

[pt] Esta dissertação tem por objetivo descrever a semântica e a implementação de uma nova linguagem que permite a programação em dois estilos - Funcional… (more)

Subjects/Keywords: [pt] LINGUAGEM FUNCIONAL; [en] FUNCTIONAL LANGUAGE; [pt] LISP; [en] LISP

Record Details Similar Records Cite « Share

❌

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6^th Edition):

SILVA, R. P. D. (2007). [en] LISP: LANGUAGE WITH OBJECT ORIENTED EXTENSIONS. (Thesis). Pontifical Catholic University of Rio de Janeiro. Retrieved from http://www.maxwell.vrac.puc-rio.br/Busca_etds.php?strSecao=resultado&nrSeq=10079

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16^th Edition):

SILVA, ROSIMILDO PEREIRA DA. “[en] LISP: LANGUAGE WITH OBJECT ORIENTED EXTENSIONS.” 2007. Thesis, Pontifical Catholic University of Rio de Janeiro. Accessed February 28, 2021. http://www.maxwell.vrac.puc-rio.br/Busca_etds.php?strSecao=resultado&nrSeq=10079.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7^th Edition):

SILVA, ROSIMILDO PEREIRA DA. “[en] LISP: LANGUAGE WITH OBJECT ORIENTED EXTENSIONS.” 2007. Web. 28 Feb 2021.

Vancouver:

SILVA RPD. [en] LISP: LANGUAGE WITH OBJECT ORIENTED EXTENSIONS. [Internet] [Thesis]. Pontifical Catholic University of Rio de Janeiro; 2007. [cited 2021 Feb 28]. Available from: http://www.maxwell.vrac.puc-rio.br/Busca_etds.php?strSecao=resultado&nrSeq=10079.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

SILVA RPD. [en] LISP: LANGUAGE WITH OBJECT ORIENTED EXTENSIONS. [Thesis]. Pontifical Catholic University of Rio de Janeiro; 2007. Available from: http://www.maxwell.vrac.puc-rio.br/Busca_etds.php?strSecao=resultado&nrSeq=10079

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

9. Newton, Jim. Representing and computing with types in dynamically typed languages : Représentation et calcul avec des types dans des langages à typage dynamique.

Degree: Docteur es, Informatique, 2018, Sorbonne université

URL: http://www.theses.fr/2018SORUS440

►

Cette thèse présente des techniques de génération de code liées à la vérification dynamique de types de séquences hétérogènes mais régulières. Nous généralisons les expressions… (more)

▼

Cette thèse présente des techniques de génération de code liées à la vérification dynamique de types de séquences hétérogènes mais régulières. Nous généralisons les expressions rationnelles classiques aux expressions rationnelles de type, en adaptant leur surface syntaxique, représentation interne, calcul, optimisation, et sérialisation (génération de code). Nous comparons la forme native basée sur des S-Expressions avec une représentation par Diagrammes de Décision Binaire, enrichis pour représenter les opérations booléennes dans un treillis de types prenant en charge le sous-typage. Nous introduisons alors la notion de Décomposition Maximale en Types Disjoints, nous prouvons l'existence et l'unicité d'une telle décomposition, et nous explorons plusieurs solutions algorithmiques pour calculer celle-ci. La Décomposition Maximale en Types Disjoints est utilisée pour générer un automate fini et déterministe représentant une expression rationnelle de type. Cet automate est utilisé à la compilation pour générer à son tour du code de vérification dynamique de type. Le code ainsi généré ne tient a priori pas compte d'éventuelles redondances dans les vérifications de type. Nous étudions donc ces problèmes plus en détail et utilisons à nouveau la théorie des Diagrammes de Décision Binaire afin d'éliminer les calculs redondants et de produire ainsi du code optimisé. Le travail présenté dans cette thèse s'attache à traiter des problèmes de représentations et de calcul sur des types dans les langages dynamiques.

This thesis presents code generation techniques related to run-time type checking of heterogeneous but regular sequences. We generalize traditional regular expressions to accommodate surface syntax, internal representation, computation, optimization, and serialization (code generation) of rational type expressions. We explore traditional s-expression based representation contrasted with Binary Decision Diagrams which have been enhanced to represent Boolean operations in a type lattice supporting subtyping. We introduce the Maximal Disjoint Type Decomposition, prove the existence and uniqueness of a solution, and further explore several alternative algorithms for calculating it. The Maximal Disjoint Type Decomposition is used to generate a deterministic finite automaton representing a rational type expression, after which compile-time code is generated which will perform run-time type membership checks. Such code generation risks dealing with redundant type checks. We further investigate these potential problems and again use the theory of Binary Decision Diagrams to eliminate these redundant checks to produce optimized type checking code. The techniques and algorithms introduced and discussed in this thesis explore representations and computations dealing with type based computations in dynamic programming languages.

Advisors/Committee Members: Géraud, Thierry (thesis director).

Subjects/Keywords: Langages à typage dynamique; Diagrammes de décision binaire; Automates finis; Common lisp; Langages rationnels; Algorithmes; Dynamic typing languages; Binary Decision Diagrams; Finite automata; Common lisp; Rational languages; Algorithms; 006.3

Record Details Similar Records Cite « Share

❌

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6^th Edition):

Newton, J. (2018). Representing and computing with types in dynamically typed languages : Représentation et calcul avec des types dans des langages à typage dynamique. (Doctoral Dissertation). Sorbonne université. Retrieved from http://www.theses.fr/2018SORUS440

Chicago Manual of Style (16^th Edition):

Newton, Jim. “Representing and computing with types in dynamically typed languages : Représentation et calcul avec des types dans des langages à typage dynamique.” 2018. Doctoral Dissertation, Sorbonne université. Accessed February 28, 2021. http://www.theses.fr/2018SORUS440.

MLA Handbook (7^th Edition):

Newton, Jim. “Representing and computing with types in dynamically typed languages : Représentation et calcul avec des types dans des langages à typage dynamique.” 2018. Web. 28 Feb 2021.

Vancouver:

Newton J. Representing and computing with types in dynamically typed languages : Représentation et calcul avec des types dans des langages à typage dynamique. [Internet] [Doctoral dissertation]. Sorbonne université; 2018. [cited 2021 Feb 28]. Available from: http://www.theses.fr/2018SORUS440.

Council of Science Editors:

Newton J. Representing and computing with types in dynamically typed languages : Représentation et calcul avec des types dans des langages à typage dynamique. [Doctoral Dissertation]. Sorbonne université; 2018. Available from: http://www.theses.fr/2018SORUS440

University of Missouri – Kansas City

10. Sridhar, Raghunandan. Traffic Engineering for LISP-Enabled Networks.

Degree: 2013, University of Missouri – Kansas City

URL: http://hdl.handle.net/10355/49783

► Inter-Domain Traffic engineering in the Internet faces serious limitations because of the current IP routing and addressing architecture. This coupled with Border Gateway Protocol’s (BGP’s)… (more)

Subjects/Keywords: LISP (Computer program language); Computer networks; Thesis – University of Missouri – Kansas City – Computer science

Record Details Similar Records Cite « Share

❌

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6^th Edition):

Sridhar, R. (2013). Traffic Engineering for LISP-Enabled Networks. (Thesis). University of Missouri – Kansas City. Retrieved from http://hdl.handle.net/10355/49783

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16^th Edition):

Sridhar, Raghunandan. “Traffic Engineering for LISP-Enabled Networks.” 2013. Thesis, University of Missouri – Kansas City. Accessed February 28, 2021. http://hdl.handle.net/10355/49783.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7^th Edition):

Sridhar, Raghunandan. “Traffic Engineering for LISP-Enabled Networks.” 2013. Web. 28 Feb 2021.

Vancouver:

Sridhar R. Traffic Engineering for LISP-Enabled Networks. [Internet] [Thesis]. University of Missouri – Kansas City; 2013. [cited 2021 Feb 28]. Available from: http://hdl.handle.net/10355/49783.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Sridhar R. Traffic Engineering for LISP-Enabled Networks. [Thesis]. University of Missouri – Kansas City; 2013. Available from: http://hdl.handle.net/10355/49783

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

11. Nguyen, Ho Dac Duy. Strategic path diversity management across internet layers : Gestion stratégique de la diversité de chemins à travers les couches Internet.

Degree: Docteur es, Informatique, 2018, Sorbonne université

URL: http://www.theses.fr/2018SORUS104

►

Nous présentons dans cette thèse de nouveaux protocoles de routage capables de prendre en compte des aspects stratégiques lorsqu’il s’agit de choisir le chemin à… (more)

▼

Nous présentons dans cette thèse de nouveaux protocoles de routage capables de prendre en compte des aspects stratégiques lorsqu’il s’agit de choisir le chemin à emprunter et ce à l’échelle du réseau de communication Internet. Le point de vue adopté dans cette étude est que les nouvelles architectures de routage donnent aux réseaux et aux applications une plus grande diversité de chemins, ce qui leur permet de choisir plus rationnellement leur stratégie lorsqu'ils décident le chemin à suivre pour transférer leur trafic, en tenant compte des coûts opérationnels ainsi que des objectifs de performance. Nous présentons des comportements améliorés au noyau décisionnel de trois protocoles de routage, le protocole BGP (Border Gateway Protocol), le protocole LISP (Locator / Identifier Separation Protocol) et, dans une moindre mesure, le protocole MPTCP (Multipath TCP). Pour chaque cadre protocolaire, nous présentons comment les stratégies de routage peuvent être déterminées, sélectionnées et réellement exploitées par des systèmes réels, en appliquant également les concepts de la théorie des jeux non coopératifs, en évaluant l’impact des solutions de routage en termes de coûts opérationnels et de performances réseau. La thèse adopte une méthodologie expérimentale permettant de tester et d'évaluer les propositions via des simulations réalistes et la mise en œuvre et l'observation réelles de systèmes réels. La plupart des résultats sont reproductibles grâce à la publication du code source.

We present in this thesis novel routing protocols able to take into consideration strategic aspects when deciding which path among many to take, and that at the Internet communication network scale. The standpoint adopted in this study is that novel routing architectures are exposing a higher path diversity to networks and applications so that networks and applications can be made capable to more intelligently select their strategy when selecting toward which path to forward their traffic, taking into consideration operational costs as well as performance goals. We present enhanced behaviors to the decision-making core of three routing protocols, the Border Gateway Protocol (BGP), the Locator/Identifier Separation Protocol (LISP) and, at a minor extent, the Multipath TCP (MPTCP) protocol. For each protocol framework we present how routing strategies can be computed, selected and actually operated by real systems, also applying concepts from non-cooperative game theory, evaluating the impact of the routing solutions in terms of operational costs and network performance. The thesis adopts an experimental methodology willing to experiment and evaluate proposals via realistic simulations or actual implementation and observation of real systems. Most of the results are made reproducible by open sourcing the corresponding code.

Advisors/Committee Members: Secci, Stefano (thesis director).

Subjects/Keywords: Théorie des jeux; Routage; Trajet multiples; LISP; BGP; MPTCP; Game theory; Strategic routing; Multipath; 004.665

Record Details Similar Records Cite « Share

❌

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6^th Edition):

Nguyen, H. D. D. (2018). Strategic path diversity management across internet layers : Gestion stratégique de la diversité de chemins à travers les couches Internet. (Doctoral Dissertation). Sorbonne université. Retrieved from http://www.theses.fr/2018SORUS104

Chicago Manual of Style (16^th Edition):

Nguyen, Ho Dac Duy. “Strategic path diversity management across internet layers : Gestion stratégique de la diversité de chemins à travers les couches Internet.” 2018. Doctoral Dissertation, Sorbonne université. Accessed February 28, 2021. http://www.theses.fr/2018SORUS104.

MLA Handbook (7^th Edition):

Nguyen, Ho Dac Duy. “Strategic path diversity management across internet layers : Gestion stratégique de la diversité de chemins à travers les couches Internet.” 2018. Web. 28 Feb 2021.

Vancouver:

Nguyen HDD. Strategic path diversity management across internet layers : Gestion stratégique de la diversité de chemins à travers les couches Internet. [Internet] [Doctoral dissertation]. Sorbonne université; 2018. [cited 2021 Feb 28]. Available from: http://www.theses.fr/2018SORUS104.

Council of Science Editors:

Nguyen HDD. Strategic path diversity management across internet layers : Gestion stratégique de la diversité de chemins à travers les couches Internet. [Doctoral Dissertation]. Sorbonne université; 2018. Available from: http://www.theses.fr/2018SORUS104

12. Červenka Adam. Virtuální stroj pro Lisp v jazyku Scala .

Degree: Czech University of Technology

URL: http://hdl.handle.net/10467/62769

► Práce se zabývá implementací virtuálního stroje napsaného v jazyce Scala, který interpretuje kód jazyka Scheme. Dále pojednává obecně o virtuálních strojích a čtenáři přiblíží jazyk… (more)

Subjects/Keywords: Scheme; Lisp; Scala; virtuální stroj; interpret

Record Details Similar Records Cite « Share

❌

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6^th Edition):

Adam, �. (n.d.). Virtuální stroj pro Lisp v jazyku Scala . (Thesis). Czech University of Technology. Retrieved from http://hdl.handle.net/10467/62769

Note: this citation may be lacking information needed for this citation format:
No year of publication.
Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16^th Edition):

Adam, Červenka. “Virtuální stroj pro Lisp v jazyku Scala .” Thesis, Czech University of Technology. Accessed February 28, 2021. http://hdl.handle.net/10467/62769.

Note: this citation may be lacking information needed for this citation format:
No year of publication.
Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7^th Edition):

Adam, Červenka. “Virtuální stroj pro Lisp v jazyku Scala .” Web. 28 Feb 2021.

Note: this citation may be lacking information needed for this citation format:
No year of publication.

Vancouver:

Adam �. Virtuální stroj pro Lisp v jazyku Scala . [Internet] [Thesis]. Czech University of Technology; [cited 2021 Feb 28]. Available from: http://hdl.handle.net/10467/62769.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation
No year of publication.

Council of Science Editors:

Adam �. Virtuální stroj pro Lisp v jazyku Scala . [Thesis]. Czech University of Technology; Available from: http://hdl.handle.net/10467/62769

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation
No year of publication.

13. Coudron, Matthieu. Nouvelles approches pour les communications multichemins : Novel approaches for multipath communications.

Degree: Docteur es, Informatique, 2016, Université Pierre et Marie Curie – Paris VI

URL: http://www.theses.fr/2016PA066514

►

La dépendance des différentes infrastructures vis-à-vis du réseau Internet va croissant. D’abord la convergence des médias mais bientôt l’Internet des objets ou les véhicules autonomes… (more)

▼

La dépendance des différentes infrastructures vis-à-vis du réseau Internet va croissant. D’abord la convergence des médias mais bientôt l’Internet des objets ou les véhicules autonomes peut-être vont contribuer à augmenter la criticité d’Internet. Il est donc important de résoudre les problèmes liés à l’infrastructure actuelle, en terme de passage à l’échelle, de confidentialité ou bien de fiabilité. Les communications multichemins font partie des possibilités pour attaquer ce défi. Pour autant la transition vers ces technologies n’est pas sans difficulté. En effet certains équipements bloquent les protocoles inconnus, empêchant ainsi l’émergence de nouvelles technologies. C’est un phénomène en partie responsable de l’ossification d’internet. D’autres considérations techniques limitent l’intérêt de recourir à des technologies multichemins dans certains cas, puisque celles-ci peuvent alors présenter des performances moindres que les technologies monochemins. Dans le cadre de cette thèse, nous proposons des réponses à certains de ces cas afin de maximiser le spectre d’application des technologies multichemins, en particulier du protocole Multipath TCP (MPTCP). Plus précisémement, après une revue détaillée du domaine des communications multichemins, nous proposons une réponse au problème de découverte des chemins. De plus, motivés par l’intuition que les ordonnanceurs peuvent s’appuyer sur les latences unidirectionelles, afin de lutter contre l’arrivé de paquets dans le désordre, nous proposons une technique qui ne modifie que l’envoyeur de données pour estimer cette métrique. En outre, nous proposons un outil qui maximise le débit tout en prenant en compte des politiques utilisateur par exemple pour forcer l’envoi d’une partie du trafic sur un chemin peu performant mais qui va coûter moins cher à l’utilisateur. Finalement, nous développons et évaluons un modèle de MPTCP.

The criticity of the Internet keeps increasing with a very high number of services depending on its infrastructure. The Internet is expected to support services with an increasing tangible impact on the physical world such as the Internet of Things (IoT) or autonomous vehicles. It is thus important to address the current infrastructure shortcomings in terms of scalability, confidentiality and reliability. Multipath communications are one possible solution to address this challenge. The transition towards multipath technologies is not obvious, there are several challenges ahead. Some network devices block unknown protocols, thus preventing the emergence of new technologies, which plays a part in what is often referred to as the ossification of the Internet. Moreover, due to technical reasons, there are cases for which multipath technologies perform worse than their single path counterpart. In this thesis, we are interested in addressing some of these cases and limit their impact, so that multipath communications perform better than single path communications as often as possible. More specifically, we propose enhancements to Multipath TCP (MPTCP).…

Advisors/Committee Members: Secci, Stefano (thesis director).

Subjects/Keywords: Multichemins; MPTCP; Gestion de tampon; Noyau; LISP; Multipath; Transport layer; Network; 004.6

Record Details Similar Records Cite « Share

❌

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6^th Edition):

Coudron, M. (2016). Nouvelles approches pour les communications multichemins : Novel approaches for multipath communications. (Doctoral Dissertation). Université Pierre et Marie Curie – Paris VI. Retrieved from http://www.theses.fr/2016PA066514

Chicago Manual of Style (16^th Edition):

Coudron, Matthieu. “Nouvelles approches pour les communications multichemins : Novel approaches for multipath communications.” 2016. Doctoral Dissertation, Université Pierre et Marie Curie – Paris VI. Accessed February 28, 2021. http://www.theses.fr/2016PA066514.

MLA Handbook (7^th Edition):

Coudron, Matthieu. “Nouvelles approches pour les communications multichemins : Novel approaches for multipath communications.” 2016. Web. 28 Feb 2021.

Vancouver:

Coudron M. Nouvelles approches pour les communications multichemins : Novel approaches for multipath communications. [Internet] [Doctoral dissertation]. Université Pierre et Marie Curie – Paris VI; 2016. [cited 2021 Feb 28]. Available from: http://www.theses.fr/2016PA066514.

Council of Science Editors:

Coudron M. Nouvelles approches pour les communications multichemins : Novel approaches for multipath communications. [Doctoral Dissertation]. Université Pierre et Marie Curie – Paris VI; 2016. Available from: http://www.theses.fr/2016PA066514

University of North Texas

14. Myjak, Michael D. (Michael David). Computer Graphics Primitives and the Scan-Line Algorithm.

Degree: 1988, University of North Texas

URL: https://digital.library.unt.edu/ark:/67531/metadc500544/

► This paper presents the scan-line algorithm which has been implemented on the Lisp Machine. The scan-line algorithm resides beneath a library of primitive software routines… (more)

Subjects/Keywords: scan-line algorithm; computer graphics; lisp machine; Computer graphics.; Algorithms.; Lisp Machine (Computer) – Programming.; Lisp Machine (Computer)

Record Details Similar Records Cite « Share

❌

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6^th Edition):

Myjak, M. D. (. D. (1988). Computer Graphics Primitives and the Scan-Line Algorithm. (Thesis). University of North Texas. Retrieved from https://digital.library.unt.edu/ark:/67531/metadc500544/

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16^th Edition):

Myjak, Michael D (Michael David). “Computer Graphics Primitives and the Scan-Line Algorithm.” 1988. Thesis, University of North Texas. Accessed February 28, 2021. https://digital.library.unt.edu/ark:/67531/metadc500544/.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7^th Edition):

Myjak, Michael D (Michael David). “Computer Graphics Primitives and the Scan-Line Algorithm.” 1988. Web. 28 Feb 2021.

Vancouver:

Myjak MD(D. Computer Graphics Primitives and the Scan-Line Algorithm. [Internet] [Thesis]. University of North Texas; 1988. [cited 2021 Feb 28]. Available from: https://digital.library.unt.edu/ark:/67531/metadc500544/.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Myjak MD(D. Computer Graphics Primitives and the Scan-Line Algorithm. [Thesis]. University of North Texas; 1988. Available from: https://digital.library.unt.edu/ark:/67531/metadc500544/

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Universidade do Rio Grande do Sul

15. Loureiro, Cesar Augusto Hass. Estudo e classificação de propostas e protocolos para provimento de mobilidade sobre IPv6.

Degree: 2012, Universidade do Rio Grande do Sul

URL: http://hdl.handle.net/10183/39122

►

A iminente implantação do IPv6, pode ser uma solução para o crescente uso de dispositivos móveis, para ensejar a mobilidade e para solucionar problemas derivados… (more)

Subjects/Keywords: FMIPv6; Redes : Computadores; IPv6; Protocolos : Redes : Computadores; Protocolos : Comunicacao : Dados; HIP; HMIPv6; LISP; MIPv6; Mobility; PMIPv6; SHIM6

Record Details Similar Records Cite « Share

❌

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6^th Edition):

Loureiro, C. A. H. (2012). Estudo e classificação de propostas e protocolos para provimento de mobilidade sobre IPv6. (Thesis). Universidade do Rio Grande do Sul. Retrieved from http://hdl.handle.net/10183/39122

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16^th Edition):

Loureiro, Cesar Augusto Hass. “Estudo e classificação de propostas e protocolos para provimento de mobilidade sobre IPv6.” 2012. Thesis, Universidade do Rio Grande do Sul. Accessed February 28, 2021. http://hdl.handle.net/10183/39122.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7^th Edition):

Loureiro, Cesar Augusto Hass. “Estudo e classificação de propostas e protocolos para provimento de mobilidade sobre IPv6.” 2012. Web. 28 Feb 2021.

Vancouver:

Loureiro CAH. Estudo e classificação de propostas e protocolos para provimento de mobilidade sobre IPv6. [Internet] [Thesis]. Universidade do Rio Grande do Sul; 2012. [cited 2021 Feb 28]. Available from: http://hdl.handle.net/10183/39122.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Loureiro CAH. Estudo e classificação de propostas e protocolos para provimento de mobilidade sobre IPv6. [Thesis]. Universidade do Rio Grande do Sul; 2012. Available from: http://hdl.handle.net/10183/39122

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

University of Edinburgh

16. Gordon, Michael J. C. Evaluation and denotation of pure LISP programs : a worked example in semantics.

Degree: PhD, 1974, University of Edinburgh

URL: http://hdl.handle.net/1842/6654

► A Scott/Strachey style denotational semantics intended to describe pure LISP is examined. I present evidence that it is an accurate rendering of the language described… (more)

Subjects/Keywords: 005; Computer program language : LISP : Programming languages

Record Details Similar Records Cite « Share

❌

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6^th Edition):

Gordon, M. J. C. (1974). Evaluation and denotation of pure LISP programs : a worked example in semantics. (Doctoral Dissertation). University of Edinburgh. Retrieved from http://hdl.handle.net/1842/6654

Chicago Manual of Style (16^th Edition):

Gordon, Michael J C. “Evaluation and denotation of pure LISP programs : a worked example in semantics.” 1974. Doctoral Dissertation, University of Edinburgh. Accessed February 28, 2021. http://hdl.handle.net/1842/6654.

MLA Handbook (7^th Edition):

Gordon, Michael J C. “Evaluation and denotation of pure LISP programs : a worked example in semantics.” 1974. Web. 28 Feb 2021.

Vancouver:

Gordon MJC. Evaluation and denotation of pure LISP programs : a worked example in semantics. [Internet] [Doctoral dissertation]. University of Edinburgh; 1974. [cited 2021 Feb 28]. Available from: http://hdl.handle.net/1842/6654.

Council of Science Editors:

Gordon MJC. Evaluation and denotation of pure LISP programs : a worked example in semantics. [Doctoral Dissertation]. University of Edinburgh; 1974. Available from: http://hdl.handle.net/1842/6654

Mid Sweden University

17. Gu, Tianyu. Shelang : An Implementation of Probabilistic Programming Language and its Applications.

Degree: Information and Communication systems, 2015, Mid Sweden University

URL: http://urn.kb.se/resolve?urn=urn:nbn:se:miun:diva-26016

► Nowadays, probabilistic models are playing a significant role in various areas in- cluding machine learning, artificial intelligence and cognitive science, etc. How- ever, as… (more)

Subjects/Keywords: Probabilistic Models; Programming Language Theory; Lisp; Machine Learning; Artificial Intelligence; Electrical Engineering, Electronic Engineering, Information Engineering; Elektroteknik och elektronik

Record Details Similar Records Cite « Share

❌

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6^th Edition):

Gu, T. (2015). Shelang : An Implementation of Probabilistic Programming Language and its Applications. (Thesis). Mid Sweden University. Retrieved from http://urn.kb.se/resolve?urn=urn:nbn:se:miun:diva-26016

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16^th Edition):

Gu, Tianyu. “Shelang : An Implementation of Probabilistic Programming Language and its Applications.” 2015. Thesis, Mid Sweden University. Accessed February 28, 2021. http://urn.kb.se/resolve?urn=urn:nbn:se:miun:diva-26016.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7^th Edition):

Gu, Tianyu. “Shelang : An Implementation of Probabilistic Programming Language and its Applications.” 2015. Web. 28 Feb 2021.

Vancouver:

Gu T. Shelang : An Implementation of Probabilistic Programming Language and its Applications. [Internet] [Thesis]. Mid Sweden University; 2015. [cited 2021 Feb 28]. Available from: http://urn.kb.se/resolve?urn=urn:nbn:se:miun:diva-26016.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Gu T. Shelang : An Implementation of Probabilistic Programming Language and its Applications. [Thesis]. Mid Sweden University; 2015. Available from: http://urn.kb.se/resolve?urn=urn:nbn:se:miun:diva-26016

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Georgia Tech

18. Vo-Dinh, Nhieu. EPSCADD : energy performance simulation using CADD.

Degree: MS, Architecture, 1987, Georgia Tech

URL: http://hdl.handle.net/1853/33634

Subjects/Keywords: Architecture Data processing; LISP (Computer program language); Computer graphics

Record Details Similar Records Cite « Share

❌

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6^th Edition):

Vo-Dinh, N. (1987). EPSCADD : energy performance simulation using CADD. (Masters Thesis). Georgia Tech. Retrieved from http://hdl.handle.net/1853/33634

Chicago Manual of Style (16^th Edition):

Vo-Dinh, Nhieu. “EPSCADD : energy performance simulation using CADD.” 1987. Masters Thesis, Georgia Tech. Accessed February 28, 2021. http://hdl.handle.net/1853/33634.

MLA Handbook (7^th Edition):

Vo-Dinh, Nhieu. “EPSCADD : energy performance simulation using CADD.” 1987. Web. 28 Feb 2021.

Vancouver:

Vo-Dinh N. EPSCADD : energy performance simulation using CADD. [Internet] [Masters thesis]. Georgia Tech; 1987. [cited 2021 Feb 28]. Available from: http://hdl.handle.net/1853/33634.

Council of Science Editors:

Vo-Dinh N. EPSCADD : energy performance simulation using CADD. [Masters Thesis]. Georgia Tech; 1987. Available from: http://hdl.handle.net/1853/33634

Kansas State University

19. Whitley, Lee Roy. The design and implementation of memory management and initialization modules for a LISP interpreter.

Degree: 1977, Kansas State University

URL: http://hdl.handle.net/2097/9056

Subjects/Keywords: Interpreters (Computer programs); LISP (Computer program language); Computer programming

Record Details Similar Records Cite « Share

❌

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6^th Edition):

Whitley, L. R. (1977). The design and implementation of memory management and initialization modules for a LISP interpreter. (Thesis). Kansas State University. Retrieved from http://hdl.handle.net/2097/9056

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16^th Edition):

Whitley, Lee Roy. “The design and implementation of memory management and initialization modules for a LISP interpreter.” 1977. Thesis, Kansas State University. Accessed February 28, 2021. http://hdl.handle.net/2097/9056.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7^th Edition):

Whitley, Lee Roy. “The design and implementation of memory management and initialization modules for a LISP interpreter.” 1977. Web. 28 Feb 2021.

Vancouver:

Whitley LR. The design and implementation of memory management and initialization modules for a LISP interpreter. [Internet] [Thesis]. Kansas State University; 1977. [cited 2021 Feb 28]. Available from: http://hdl.handle.net/2097/9056.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Whitley LR. The design and implementation of memory management and initialization modules for a LISP interpreter. [Thesis]. Kansas State University; 1977. Available from: http://hdl.handle.net/2097/9056

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

University of British Columbia

20. Fine, Gary. Design of an intelligent lisp cai tutor.

Degree: MS- MSc, Computer Science, 1979, University of British Columbia

URL: http://hdl.handle.net/2429/21357

► Recent developments in interactive Computer-Aided -Instruction and in Artificial Intelligence have enabled teaching machines and programs to deal reasonably effectively with the subject matter to… (more)

Subjects/Keywords: LISP (Computer program language); Computer-assisted instruction

Record Details Similar Records Cite « Share

❌

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6^th Edition):

Fine, G. (1979). Design of an intelligent lisp cai tutor. (Masters Thesis). University of British Columbia. Retrieved from http://hdl.handle.net/2429/21357

Chicago Manual of Style (16^th Edition):

Fine, Gary. “Design of an intelligent lisp cai tutor.” 1979. Masters Thesis, University of British Columbia. Accessed February 28, 2021. http://hdl.handle.net/2429/21357.

MLA Handbook (7^th Edition):

Fine, Gary. “Design of an intelligent lisp cai tutor.” 1979. Web. 28 Feb 2021.

Vancouver:

Fine G. Design of an intelligent lisp cai tutor. [Internet] [Masters thesis]. University of British Columbia; 1979. [cited 2021 Feb 28]. Available from: http://hdl.handle.net/2429/21357.

Council of Science Editors:

Fine G. Design of an intelligent lisp cai tutor. [Masters Thesis]. University of British Columbia; 1979. Available from: http://hdl.handle.net/2429/21357

Linköping University

21. Ståhlberg, Simon. Implementation och utökning av en typhärledningsalgoritm för Common Lisp.

Degree: Computer and Information Science, 2010, Linköping University

URL: http://urn.kb.se/resolve?urn=urn:nbn:se:liu:diva-57819

► Programmeringsspråk har oftast ett typsystem och kan välja att använda olika statiska verktyg att analysera koden. Statiska språk utför typkontroller innan körtillfället och kan… (more)

▼ Programmeringsspråk har oftast ett typsystem och kan välja att använda olika statiska verktyg att analysera koden. Statiska språk utför typkontroller innan körtillfället och kan då ge garantier att typfel inte kan förekomma, dynamiska språk gör däremot dessa kontroller under körtillfället och om ett dåligt beteende upptäcks avbryts programmet. Eftersom kontrollerna görs under körtillfället skrivs inte typsignaturer ut i dynamiska språk. Ett dynamiskt språk kan vara mer flexibelt än ett statiskt språk eftersom inga garantier ges. Eftersom inga typsignaturer skrivs ut går det att skriva program på ett mer koncist sätt. I statiska språk tvingas oftast användaren att skriva ut typerna explicit för variabler och funktioner. Typhärledning är processen att härleda typer för uttryck. En typhärledningalgoritm kommer att undersökas, hur kraftfull algoritmen är samt hur algoritmen kan utökas för att klara av flera konstruktioner och ett kraftfullare språk. Typhärledningsalgoritmen kommer att implementeras för Common Lisp. Common Lisp ger inga typgarantier och inga typsignaturer skrivs ut. Alla typer kommer att härledas vilket innebär att vi gör om en delmängd av Common Lisp till ett statiskt språk. Algoritmen kommer att utökas för att klara av polymorfism, closures, listor och par. Rapporten undersöker vilka ändringar som behöver göras för att stödja konstruktionerna, hur vi kan göra ändringarna hur de kan implementeras. Fördelar med att ha typhärledning är att användaren slipper skriva ut typsignaturer och kan få ökad produktivitet. Den mest generella typsignaturen kommer alltid att härledas och funktioner som är polymorfa kommer att upptäckas automatiskt. Typhärledningsalgoritmen kommer att även typkontrollera programmet, och kan ge garantier att inga problem kommer att uppstå. Verktyget kommer även att skapa ett nytt program med typsignaturer utskrivna som kompilatorn kan använda för att generera effektivare kod.

Subjects/Keywords: typhärledning; algoritm; typhärledningsalgoritm; typsystem; implementation; lisp; common lisp; examensarbete; kandidatexamensarbete; Computer Sciences; Datavetenskap (datalogi)

Record Details Similar Records Cite « Share

❌

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6^th Edition):

Ståhlberg, S. (2010). Implementation och utökning av en typhärledningsalgoritm för Common Lisp. (Thesis). Linköping University. Retrieved from http://urn.kb.se/resolve?urn=urn:nbn:se:liu:diva-57819

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16^th Edition):

Ståhlberg, Simon. “Implementation och utökning av en typhärledningsalgoritm för Common Lisp.” 2010. Thesis, Linköping University. Accessed February 28, 2021. http://urn.kb.se/resolve?urn=urn:nbn:se:liu:diva-57819.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7^th Edition):

Ståhlberg, Simon. “Implementation och utökning av en typhärledningsalgoritm för Common Lisp.” 2010. Web. 28 Feb 2021.

Vancouver:

Ståhlberg S. Implementation och utökning av en typhärledningsalgoritm för Common Lisp. [Internet] [Thesis]. Linköping University; 2010. [cited 2021 Feb 28]. Available from: http://urn.kb.se/resolve?urn=urn:nbn:se:liu:diva-57819.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Ståhlberg S. Implementation och utökning av en typhärledningsalgoritm för Common Lisp. [Thesis]. Linköping University; 2010. Available from: http://urn.kb.se/resolve?urn=urn:nbn:se:liu:diva-57819

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Brno University of Technology

22. Veselý, Vladimír. NOVÝ ÚSVIT POJMENOVÁVÁNÍ, ADRESOVÁNÍ A SMĚROVÁNÍ NA INTERNETU: A NEW DAWN OF NAMING, ADDRESSING AND ROUTING ON THE INTERNET.

Degree: 2019, Brno University of Technology

URL: http://hdl.handle.net/11012/63237

► nternet of the year 2015 struggles with problems that are just implications of flawed naming and addressing the concept of TCP/IP, which have an impact… (more)

Subjects/Keywords: Internetová architektura; pojmenovávání a adresování; směrování; oddělení lokátorů a identifikátorů; LISP; rekurzivní mezisíťová architektura; RINA; OMNeT++; Internet architecture; naming and addressing; routing; locator/id split; LISP; Recursive InterNetwork Architecture; RINA; OMNeT++

Record Details Similar Records Cite « Share

❌

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6^th Edition):

Veselý, V. (2019). NOVÝ ÚSVIT POJMENOVÁVÁNÍ, ADRESOVÁNÍ A SMĚROVÁNÍ NA INTERNETU: A NEW DAWN OF NAMING, ADDRESSING AND ROUTING ON THE INTERNET. (Thesis). Brno University of Technology. Retrieved from http://hdl.handle.net/11012/63237

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16^th Edition):

Veselý, Vladimír. “NOVÝ ÚSVIT POJMENOVÁVÁNÍ, ADRESOVÁNÍ A SMĚROVÁNÍ NA INTERNETU: A NEW DAWN OF NAMING, ADDRESSING AND ROUTING ON THE INTERNET.” 2019. Thesis, Brno University of Technology. Accessed February 28, 2021. http://hdl.handle.net/11012/63237.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7^th Edition):

Veselý, Vladimír. “NOVÝ ÚSVIT POJMENOVÁVÁNÍ, ADRESOVÁNÍ A SMĚROVÁNÍ NA INTERNETU: A NEW DAWN OF NAMING, ADDRESSING AND ROUTING ON THE INTERNET.” 2019. Web. 28 Feb 2021.

Vancouver:

Veselý V. NOVÝ ÚSVIT POJMENOVÁVÁNÍ, ADRESOVÁNÍ A SMĚROVÁNÍ NA INTERNETU: A NEW DAWN OF NAMING, ADDRESSING AND ROUTING ON THE INTERNET. [Internet] [Thesis]. Brno University of Technology; 2019. [cited 2021 Feb 28]. Available from: http://hdl.handle.net/11012/63237.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Veselý V. NOVÝ ÚSVIT POJMENOVÁVÁNÍ, ADRESOVÁNÍ A SMĚROVÁNÍ NA INTERNETU: A NEW DAWN OF NAMING, ADDRESSING AND ROUTING ON THE INTERNET. [Thesis]. Brno University of Technology; 2019. Available from: http://hdl.handle.net/11012/63237

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Rochester Institute of Technology

23. Recard, Steven J. IPL: Interfaced Prolog/Lisp.

Degree: MS, Computer Science (GCCIS), 1987, Rochester Institute of Technology

URL: https://scholarworks.rit.edu/theses/6645

► This thesis report describes the design and implementation of an interface between the two most common artificial intelligence languages, Lisp and Prolog. The interface… (more)

Subjects/Keywords: Language interfaces; Lisp; Logic programming; Programming environments; Programming paradigms; Prolog

Record Details Similar Records Cite « Share

❌

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6^th Edition):

Recard, S. J. (1987). IPL: Interfaced Prolog/Lisp. (Masters Thesis). Rochester Institute of Technology. Retrieved from https://scholarworks.rit.edu/theses/6645

Chicago Manual of Style (16^th Edition):

Recard, Steven J. “IPL: Interfaced Prolog/Lisp.” 1987. Masters Thesis, Rochester Institute of Technology. Accessed February 28, 2021. https://scholarworks.rit.edu/theses/6645.

MLA Handbook (7^th Edition):

Recard, Steven J. “IPL: Interfaced Prolog/Lisp.” 1987. Web. 28 Feb 2021.

Vancouver:

Recard SJ. IPL: Interfaced Prolog/Lisp. [Internet] [Masters thesis]. Rochester Institute of Technology; 1987. [cited 2021 Feb 28]. Available from: https://scholarworks.rit.edu/theses/6645.

Council of Science Editors:

Recard SJ. IPL: Interfaced Prolog/Lisp. [Masters Thesis]. Rochester Institute of Technology; 1987. Available from: https://scholarworks.rit.edu/theses/6645

University of Michigan

24. Park, Taejoon. LiSP: Lightweight security protocols for wireless sensor networks.

Degree: PhD, Electrical engineering, 2005, University of Michigan

URL: http://hdl.handle.net/2027.42/125470

► Sensor networks, usually built with a large number of small, low-cost sensor devices, are characterized by their large-scale and unattended deployment that invites many critical… (more)

▼ Sensor networks, usually built with a large number of small, low-cost sensor devices, are characterized by their large-scale and unattended deployment that invites many critical attacks, thereby necessitating high-level security support for their intended applications and services. However, making sensor networks secure is challenging due mainly to the fact that sensors are battery-powered and it is often very difficult to change or recharge their batteries. To address this challenge, we design, develop and evaluate <bolditalic> Li</bolditalic>ghtweight <bolditalic>S</bolditalic> ecurity <bolditalic>P</bolditalic>rotocols (LiSP) that cooperatively build a unified, energy-efficient security framework for sensor networks. We present two (group-based and distributed) key management/sharing schemes that are tailored to local and remote transactions, respectively. While the group-based scheme achieves efficient and robust re-keying via key broadcasting/authentication/recovery, distributed key sharing enables the development of attack-tolerant routing protocols capable of gracefully resisting device compromises as well as replacing resource-expensive, public-key-cipher-based protocols with a purely symmetric-cipher-based alternative. The problem of attack-tolerance is further investigated for the development of a secure localization protocol. The proposed protocol uses mutual collaboration among sensors to achieve high-level attack-tolerance in terms of detecting/identifying/rejecting sources of attacks, if present. Accordingly, it plays the role of an anomaly-based intrusion detection system tailored to localization that safeguards the network from localization-targeted attacks. As a countermeasure against physically tampering with sensors, we develop a novel soft tamper-proofing technique that verifies integrity of the program residing in each sensor device whenever it joins the network, or is suspected to have been compromised. Unlike other techniques unsuitable for low-cost, resource-limited sensors, our technique augments such sensors to be usable for applications that require high-level security. Finally, the benefits of our protocols are demonstrated via analysis and evaluation of their capability to defeat known security attacks, and their performance in terms of processing, communication and memory overheads. Advisors/Committee Members: Shin, Kang G. (advisor).

Subjects/Keywords: Distributed Key Sharing; Lightweight Security Protocols; Lisp; Wireless Sensor Networks

Record Details Similar Records Cite « Share

❌

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6^th Edition):

Park, T. (2005). LiSP: Lightweight security protocols for wireless sensor networks. (Doctoral Dissertation). University of Michigan. Retrieved from http://hdl.handle.net/2027.42/125470

Chicago Manual of Style (16^th Edition):

Park, Taejoon. “LiSP: Lightweight security protocols for wireless sensor networks.” 2005. Doctoral Dissertation, University of Michigan. Accessed February 28, 2021. http://hdl.handle.net/2027.42/125470.

MLA Handbook (7^th Edition):

Park, Taejoon. “LiSP: Lightweight security protocols for wireless sensor networks.” 2005. Web. 28 Feb 2021.

Vancouver:

Park T. LiSP: Lightweight security protocols for wireless sensor networks. [Internet] [Doctoral dissertation]. University of Michigan; 2005. [cited 2021 Feb 28]. Available from: http://hdl.handle.net/2027.42/125470.

Council of Science Editors:

Park T. LiSP: Lightweight security protocols for wireless sensor networks. [Doctoral Dissertation]. University of Michigan; 2005. Available from: http://hdl.handle.net/2027.42/125470

25. Costa, Nuno André Pinheiro Trocado da. Interacção humano-máquina no processo composicional.

Degree: 2017, Instituto Politécnico do Porto

URL: https://www.rcaap.pt/detail.jsp?id=oai:recipp.ipp.pt:10400.22/10661

►

Com a problemática da interacção humano-máquina no processo composicional como pano de fundo, a presente dissertação prossegue três vectores simultâneos: (a) um portfolio de alguma… (more)

Subjects/Keywords: Composição algorítmica assistida por computador; Common lisp; Openmusic; Pwgl; Excentricidade e uniformidade rítmica e tonal; Cadeias de Markov; Computer-assisted algorithmic composition; Rhythmic oddity; Evenness; Markov chains

Record Details Similar Records Cite « Share

❌

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6^th Edition):

Costa, N. A. P. T. d. (2017). Interacção humano-máquina no processo composicional. (Thesis). Instituto Politécnico do Porto. Retrieved from https://www.rcaap.pt/detail.jsp?id=oai:recipp.ipp.pt:10400.22/10661

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16^th Edition):

Costa, Nuno André Pinheiro Trocado da. “Interacção humano-máquina no processo composicional.” 2017. Thesis, Instituto Politécnico do Porto. Accessed February 28, 2021. https://www.rcaap.pt/detail.jsp?id=oai:recipp.ipp.pt:10400.22/10661.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7^th Edition):

Costa, Nuno André Pinheiro Trocado da. “Interacção humano-máquina no processo composicional.” 2017. Web. 28 Feb 2021.

Vancouver:

Costa NAPTd. Interacção humano-máquina no processo composicional. [Internet] [Thesis]. Instituto Politécnico do Porto; 2017. [cited 2021 Feb 28]. Available from: https://www.rcaap.pt/detail.jsp?id=oai:recipp.ipp.pt:10400.22/10661.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Costa NAPTd. Interacção humano-máquina no processo composicional. [Thesis]. Instituto Politécnico do Porto; 2017. Available from: https://www.rcaap.pt/detail.jsp?id=oai:recipp.ipp.pt:10400.22/10661

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

26. Hussain, Ishfaq. Scalable Device Mobility – Mobile DCXP.

Degree: Information and Communication systems, 2014, Mid Sweden University

URL: http://urn.kb.se/resolve?urn=urn:nbn:se:miun:diva-23324

► The continuously increasing Internet coverage and its availability has give rise to an issue that was once considered not important to take into consideration.… (more)

▼ The continuously increasing Internet coverage and its availability has give rise to an issue that was once considered not important to take into consideration. Today a number of applications use the Internet to de-liver time critical messages. The usage of wireless Access Points involves a considerable percentage to connect mobile devices to the Internet pro-vider. However, these relatively cheaper Internet Access Points have their own disadvantages as compared to the GSM and ADSL. The access points cover a very limited area and thus in order to cover a wider area multiple access points must needs to be installed. In other words, as the user moves he/she is supposed to switch between access points. Never-theless, the basic problem in such cases is involves packet loss during handover. In today’s technological advancements these issues, though very small, are no more insignificant but are required to be handled prop-erly. So protocols such as MobileIP, LISP, HOST have been proposed and are currently being used for such a purpose. Furthermore, in this thesis a mechanism to reduce such packet losses has been studied and proposed in relation to the SensibleThings Internet-of-things platform. A workaround solution known as Mobile DCXP has been proposed and implemented and comparisons with the existing system have been carried out. In addition, a generic solution has been discussed in detail and compared with the Mobile DCXP. However, the implementation of the generic solution has been deferred to the future. The concept of Mobile DCXP has been illustrated with proof-of-concept apps and an implementation of a simple Android Application known as IChat has been conduct. The IChat is a simple chat app that is used in the experi-ment to determine out the packet lost during handover and to carry out a comparison. Finally, based on the data collected from IChat, an evaluation of Mobile DCXP has been presented and a performance comparison with Mobile Proxy DCXP has been illustrated with charts. Furthermore, in the conclusion Mobile DCXP could minimize packet loss as compared to the existing system.

Subjects/Keywords: DCXP; LISP; MobileIP; HOST; MediaSense; SensibleThings; Computer Engineering; Datorteknik

…carrying out a smooth handover. Protocols for example HIP, LISP, Mobile IPv6 propose their own… …the case of packet loss [6]. 2.2.2 LISP LISP (Locator Identifier Separation… …7]. LISP has been proposed based on observations made from a different angle. The… …Moreover, due to the fact that LISP is map-and-encap protocol, there is no need to change the… …LISP [10] Routing Scalability issue has been solved by assigning two types of…

11 more images…

Record Details Similar Records Cite « Share

❌

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6^th Edition):

Hussain, I. (2014). Scalable Device Mobility – Mobile DCXP. (Thesis). Mid Sweden University. Retrieved from http://urn.kb.se/resolve?urn=urn:nbn:se:miun:diva-23324

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16^th Edition):

Hussain, Ishfaq. “Scalable Device Mobility – Mobile DCXP.” 2014. Thesis, Mid Sweden University. Accessed February 28, 2021. http://urn.kb.se/resolve?urn=urn:nbn:se:miun:diva-23324.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7^th Edition):

Hussain, Ishfaq. “Scalable Device Mobility – Mobile DCXP.” 2014. Web. 28 Feb 2021.

Vancouver:

Hussain I. Scalable Device Mobility – Mobile DCXP. [Internet] [Thesis]. Mid Sweden University; 2014. [cited 2021 Feb 28]. Available from: http://urn.kb.se/resolve?urn=urn:nbn:se:miun:diva-23324.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Hussain I. Scalable Device Mobility – Mobile DCXP. [Thesis]. Mid Sweden University; 2014. Available from: http://urn.kb.se/resolve?urn=urn:nbn:se:miun:diva-23324

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Kansas State University

27. Lazaro, Jose Ma. U. J. Natural language analysis via augmented transition networks (ATN).

Degree: 1982, Kansas State University

URL: http://hdl.handle.net/2097/9595

Subjects/Keywords: Compiling (Electronic computers); LISP (Computer program language); ATN (Computer program)

Record Details Similar Records Cite « Share

❌

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6^th Edition):

Lazaro, J. M. U. J. (1982). Natural language analysis via augmented transition networks (ATN). (Thesis). Kansas State University. Retrieved from http://hdl.handle.net/2097/9595

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16^th Edition):

Lazaro, Jose Ma U J. “Natural language analysis via augmented transition networks (ATN).” 1982. Thesis, Kansas State University. Accessed February 28, 2021. http://hdl.handle.net/2097/9595.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7^th Edition):

Lazaro, Jose Ma U J. “Natural language analysis via augmented transition networks (ATN).” 1982. Web. 28 Feb 2021.

Vancouver:

Lazaro JMUJ. Natural language analysis via augmented transition networks (ATN). [Internet] [Thesis]. Kansas State University; 1982. [cited 2021 Feb 28]. Available from: http://hdl.handle.net/2097/9595.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Lazaro JMUJ. Natural language analysis via augmented transition networks (ATN). [Thesis]. Kansas State University; 1982. Available from: http://hdl.handle.net/2097/9595

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Kansas State University

28. Goodman, Jana Taylor. The design, implementation, and use of LEDIT : a real-time editor for LISP.

Degree: 1982, Kansas State University

URL: http://hdl.handle.net/2097/12111

Subjects/Keywords: LISP (Computer program language); LEDIT (Computer program language); Computer programming – Management

Record Details Similar Records Cite « Share

❌

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6^th Edition):

Goodman, J. T. (1982). The design, implementation, and use of LEDIT : a real-time editor for LISP. (Thesis). Kansas State University. Retrieved from http://hdl.handle.net/2097/12111

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16^th Edition):

Goodman, Jana Taylor. “The design, implementation, and use of LEDIT : a real-time editor for LISP.” 1982. Thesis, Kansas State University. Accessed February 28, 2021. http://hdl.handle.net/2097/12111.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7^th Edition):

Goodman, Jana Taylor. “The design, implementation, and use of LEDIT : a real-time editor for LISP.” 1982. Web. 28 Feb 2021.

Vancouver:

Goodman JT. The design, implementation, and use of LEDIT : a real-time editor for LISP. [Internet] [Thesis]. Kansas State University; 1982. [cited 2021 Feb 28]. Available from: http://hdl.handle.net/2097/12111.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Goodman JT. The design, implementation, and use of LEDIT : a real-time editor for LISP. [Thesis]. Kansas State University; 1982. Available from: http://hdl.handle.net/2097/12111

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Kansas State University

29. Bosserman, David Clarence. A LISP interpreter : scanner and parser.

Degree: 1977, Kansas State University

URL: http://hdl.handle.net/2097/8985

Subjects/Keywords: Interpreters (Computer programs); Programming languages (Electronic computers) – Mathematics; LISP (Computer program language)

Record Details Similar Records Cite « Share

❌

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6^th Edition):

Bosserman, D. C. (1977). A LISP interpreter : scanner and parser. (Thesis). Kansas State University. Retrieved from http://hdl.handle.net/2097/8985

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16^th Edition):

Bosserman, David Clarence. “A LISP interpreter : scanner and parser.” 1977. Thesis, Kansas State University. Accessed February 28, 2021. http://hdl.handle.net/2097/8985.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7^th Edition):

Bosserman, David Clarence. “A LISP interpreter : scanner and parser.” 1977. Web. 28 Feb 2021.

Vancouver:

Bosserman DC. A LISP interpreter : scanner and parser. [Internet] [Thesis]. Kansas State University; 1977. [cited 2021 Feb 28]. Available from: http://hdl.handle.net/2097/8985.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Bosserman DC. A LISP interpreter : scanner and parser. [Thesis]. Kansas State University; 1977. Available from: http://hdl.handle.net/2097/8985

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Kansas State University

30. Trachsel, Anne Roberta. L-EQUEL : an embedded query language for Franz LISP.

Degree: 1985, Kansas State University

URL: http://hdl.handle.net/2097/9884

Subjects/Keywords: L-EQUEL (Computer program language); LISP (Computer program language); Ingres (Computer file)

Record Details Similar Records Cite « Share

❌

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6^th Edition):

Trachsel, A. R. (1985). L-EQUEL : an embedded query language for Franz LISP. (Thesis). Kansas State University. Retrieved from http://hdl.handle.net/2097/9884

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16^th Edition):

Trachsel, Anne Roberta. “L-EQUEL : an embedded query language for Franz LISP.” 1985. Thesis, Kansas State University. Accessed February 28, 2021. http://hdl.handle.net/2097/9884.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7^th Edition):

Trachsel, Anne Roberta. “L-EQUEL : an embedded query language for Franz LISP.” 1985. Web. 28 Feb 2021.

Vancouver:

Trachsel AR. L-EQUEL : an embedded query language for Franz LISP. [Internet] [Thesis]. Kansas State University; 1985. [cited 2021 Feb 28]. Available from: http://hdl.handle.net/2097/9884.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Trachsel AR. L-EQUEL : an embedded query language for Franz LISP. [Thesis]. Kansas State University; 1985. Available from: http://hdl.handle.net/2097/9884

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

		in
And / Or
		in
And / Or
		in
And / Or
		in

Open Access Theses and Dissertations