Дисертації з теми "Graphical languages"
Щоб переглянути інші типи публікацій з цієї теми, перейдіть за посиланням: Graphical languages.
Оформте джерело за APA, MLA, Chicago, Harvard та іншими стилями
Ознайомтеся з топ-50 дисертацій для дослідження на тему "Graphical languages".
Біля кожної праці в переліку літератури доступна кнопка «Додати до бібліографії». Скористайтеся нею – і ми автоматично оформимо бібліографічне посилання на обрану працю в потрібному вам стилі цитування: APA, MLA, «Гарвард», «Чикаго», «Ванкувер» тощо.
Також ви можете завантажити повний текст наукової публікації у форматі «.pdf» та прочитати онлайн анотацію до роботи, якщо відповідні параметри наявні в метаданих.
Переглядайте дисертації для різних дисциплін та оформлюйте правильно вашу бібліографію.
1
Parsons, M. S. "Applicative languages and graphical data structures." Thesis, University of Kent, 1987. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.379988.
2
Schweimeier, Ralf. "Categorical and graphical models of programming languages." Thesis, University of Sussex, 2001. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.366059.
3
Godwin, William Henry. "Formalizing graphical notations." n.p, 1998. http://ethos.bl.uk/.
4
Marsden, Gary. "Designing graphical interface programming languages for the end user." Thesis, University of Stirling, 1998. http://hdl.handle.net/1893/1920.
Анотація:
This thesis sets out to answer three simple questions: What tools are available for novice programmers to program GUIs? Are those tools fulfilling their role? Can anything be done to make better tools? Despite being simple questions, the answers are not so easily constructed. In answering the first question, it was necessary to examine the range of tools available and decide upon criteria which could be used to identify tools aimed specifically at the novice programmer (there being no currently agreed criteria for their identification). Having identified these tools, it was then necessary to construct a framework within which they could be sensibly compared. The answering of the second question required an investigation of what were the successful features of current tools and which features were less successful. Success or failure of given features was determined by research in both programming language design and studies of programmer satisfaction. Having discovered what should be retained and discarded from current systems, the answering of the third question required the construction of new systems through blending elements from visual languages, program editors and fourth generation languages. These final prototypes illustrate a new way of thinking about and constructing the next generation of GUI programming languages for the novice.
5
Carpenter, Steven M. "Visual meta-programming language graphical user interface for generative programming." Monterey, Calif. : Springfield, Va. : Naval Postgraduate School ; Available from National Technical Information Service, 2002. http://library.nps.navy.mil/uhtbin/hyperion-image/02sep%5FCarpenter.pdf.
Анотація:
Thesis (M.S. in Computer Science)--Naval Postgraduate School, September 2002.Thesis advisor(s): Mikhail Auguston, Richard Riehle. Includes bibliographical references (p. 89). Also available online.
6
Terwilliger, James Felger. "Graphical User Interfaces as Updatable Views." PDXScholar, 2009. https://pdxscholar.library.pdx.edu/open_access_etds/2671.
Анотація:
In contrast to a traditional setting where users express queries against the database schema, we assert that the semantics of data can often be understood by viewing the data in the context of the user interface (UI) of the software tool used to enter the data. That is, we believe that users will understand the data in a database by seeing the labels, dropdown menus, tool tips, help text, control contents, and juxtaposition or arrangement of controls that are built in to the user interface. Our goal is to allow domain experts with little technical skill to understand and query data.
In this dissertation, we present our GUi As View (Guava) framework and describe how we use forms-based UIs to generate a conceptual model that represents the information in the user interface. We then describe how we generate a query interface from the conceptual model. We characterize the resulting query language using a subset of relational algebra.
Since most application developers want to craft a physical database to meet desired performance needs independent of the schema used by the user interface, we subsequently present a general-purpose schema mapping tool called a channel that can be configured by instantiating a sequence of discrete transformations. Each transformation is an encapsulation of a physical design decision or business logic process. The channel, once configured, automatically transforms queries from our query interface into queries that address the underlying physical database, similar to a view. The channel also transforms data updates, schema updates, and constraint definitions posed against the channel’s input schema into equivalent forms against the physical schema. We present formal definitions of each transformation and properties that must be true of transformations, and prove that our definitions respect the properties.
7
Pierson, Graham C. "Code maintenance and design for a visual programming language graphical user interface." Thesis, Monterey, Calif. : Springfield, Va. : Naval Postgraduate School ; Available from National Technical Information Service, 2004. http://library.nps.navy.mil/uhtbin/hyperion/04Sep%5FPierson.pdf.
8
Armstrong, Kris A. "The Separation Principle – A Principle for Programming Language Design." University of Toledo / OhioLINK, 2013. http://rave.ohiolink.edu/etdc/view?acc_num=toledo1373382351.
9
Sun, Hanqiu. "A high-level graphics language based on the Graphical Kernel System." Thesis, University of British Columbia, 1986. http://hdl.handle.net/2429/26330.
Анотація:
Being an application area of programming languages, graphics languages should keep pace with the development of today's programming languages. Data types, structural operations and free layout of statements provide a more effective means of picture generation, i.e., modelling, rendering and viewing. The Graphical Kernel System (GKS), an international standard graphics language since 1984, is specified on a subroutine basis, therefore suffering from the lack of such high-level language features. This thesis investigates and implements the FORTRAN language binding of GKS into a high-level programming language (HL/GKS) by a generated precompiler. The weaknesses and restrictions of GKS and its FORTRAN binding are discussed. The advanced features and functions of HL/GKS are addressed. The graphical syntax and semantics rules of the extended portion of HL/GKS are introduced. It is expected that HL/GKS will have more attractive features and effective productivity for GKS applications compared to the procedure-level GKS system. The input statements of HL/GKS have the capability of picture communication by interactive devices and hence enable the implementation of sophisticated graphical application programs.Applied Science, Faculty of
Electrical and Computer Engineering, Department of
Graduate
10
Nie, Chunsheng. "A visual language for part21 file based on express data model." Ohio University / OhioLINK, 2000. http://rave.ohiolink.edu/etdc/view?acc_num=ohiou1172603859.
11
Clark, Gard J. "DFQL : a graphical dataflow query language." Thesis, Monterey, California. Naval Postgraduate School, 1991. http://hdl.handle.net/10945/28125.
12
Goff, Roger Allen. "Complexity measurement of a graphical programming language and comparison of a graphical and a textual design language." Thesis, Virginia Tech, 1987. http://hdl.handle.net/10919/45686.
Анотація:
For many years the software engineering community has been attacking the software reliability problem on two fronts. First via design methodologies, languages and tools as a precheck on quality and second by measuring the quality of produced software as a postcheck. This research attempts to unify the approach to creating reliable software by providing the ability to measure the quality of a design prior to its implementation. Also presented is a comparison of a graphical and a textual design language in an effort to support cognitive science research findings that the human brain works more effectively in images than in text.
Master of Science
13
Godwin, William. "Formalizing graphical notations." Thesis, Open University, 1998. http://oro.open.ac.uk/57865/.
Анотація:
The thesis describes research into graphical notations for software engineering, with a principal interest in ways of formalizing them. The research seeks to provide a theoretical basis that will help in designing both notations and the software tools that process them. The work starts from a survey of literature on notation, followed by a review of techniques for formal description and for computational handling of notations. The survey concentrates on collecting views of the benefits and the problems attending notation use in software development; the review covers picture description languages, grammars and tools such as generic editors and visual programming environments. The main problem of notation is found to be a lack of any coherent, rigorous description methods. The current approaches to this problem are analysed as lacking in consensus on syntax specification and also lacking a clear focus on a defined concept of notated expression. To address these deficiencies, the thesis embarks upon an exploration of serniotic, linguistic and logical theory; this culminates in a proposed formalization of serniosis in notations, using categorial model theory as a mathematical foundation. An argument about the structure of sign systems leads to an analysis of notation into a layered system of tractable theories, spanning the gap between expressive pictorial medium and subject domain. This notion of 'tectonic' theory aims to treat both diagrams and formulae together. The research gives details of how syntactic structure can be sketched in a mathematical sense, with examples applying to software development diagrams, offering a new solution to the problem of notation specification. Based on these methods, the thesis discusses directions for resolving the harder problems of supporting notation design, processing and computer-aided generic editing. A number of future research areas are thereby opened up. For practical trial of the ideas, the work proceeds to the development and partial implementation of a system to aid the design of notations and editors. Finally the thesis is evaluated as a contribution to theory in an area which has not attracted a standard approach.
14
Naguleswaran, M. "A graphical relational query language on Apple Macintosh." Thesis, University of Canterbury. Computer Science, 1988. http://hdl.handle.net/10092/9381.
Анотація:
Graphical presentation has been used effectively to reduce complexity long before computers were invented. The Macintosh's user interface is the motivation for this project to design a graphical relational query language to facilitate easy querying. A graphical methodology for expressing queries has been developed and implemented. This thesis explores the pros and cons of alternative approaches for graphical expression of queries and explains the basis for the design of GQL and gives a description of the GQL system itself.
In addition to the Macintosh's user interface as an easy to use interaction medium, the GQL system that has been implemented provides further user aids to query formulation. This is achieved by maintaining a local dictionary in which the access path information and predefined subqueries can be permanently stored and used in the formulation of new queries. Another notable feature of GQL is the modular definition of a query, where the module detail can be viewed or hidden using graphical techniques. The design of GQL permits it to be interfaced with any relational DBMS with minimum effort.
15
Peters, Nancy Lynn. "A graphical query language supporting flexible database access." Thesis, Massachusetts Institute of Technology, 1988. http://hdl.handle.net/1721.1/76414.
Анотація:
Thesis (M.S.)--Massachusetts Institute of Technology, Dept. of Architecture, 1988.Includes bibliographical references.
GRAF-ASQ (GRaphical And Fully Accessible Structure-based Queries) is a graphical query language designed to provide flexible, wide access to data via the use of n-tuples and Prolog concepts. It is also designed to provide the ability to view the database schema graphically and to store queries which can be retrieved and from which more complex queries can be built. The system is built to interface with MacDRAW so that it can store and retrieve information connected to graphical objects. The system is independent of MacDRAW, however. It accepts data in a general format that other programs can give it. Implemented so far is the ability to view the schema with different central foci and to make atomic attributes invisible. Also implemented is the ability to get data about graphical objects from MacDRAW, including type and simple attribute information, and to query and search for data via menues. If the data found relates to MacDRAW objects, those objects can be highlighted within MacDRAW. The graphical query language itself has not been implemented.
Funded, in part, by Apple Computer, Inc., Educational Marketing Division.
by Nancy Lynn Peters.
M.S.
16
Déguernel, Ken. "Apprentissage de structures musicales en contexte d'improvisation." Thesis, Université de Lorraine, 2018. http://www.theses.fr/2018LORR0011/document.
Анотація:
Les systèmes actuels d’improvisation musicales sont capables de générer des séquences musicales unidimensionnelles par recombinaison du matériel musical. Cependant, la prise en compte de plusieurs dimensions (mélodie, harmonie...) et la modélisation de plusieurs niveaux temporels sont des problèmes difficiles. Dans cette thèse, nous proposons de combiner des approches probabilistes et des méthodes issues de la théorie des langages formels afin de mieux apprécier la complexité du discours musical à la fois d’un point de vue multidimensionnel et multi-niveaux dans le cadre de l’improvisation où la quantité de données est limitée. Dans un premier temps, nous présentons un système capable de suivre la logique contextuelle d’une improvisation représentée par un oracle des facteurs tout en enrichissant son discours musical à l’aide de connaissances multidimensionnelles représentées par des modèles probabilistes interpolés. Ensuite, ces travaux sont étendus pour modéliser l’interaction entre plusieurs musiciens ou entre plusieurs dimensions par un algorithme de propagation de croyance afin de générer des improvisations multidimensionnelles. Enfin, nous proposons un système capable d’improviser sur un scénario temporel avec des informations multi-niveaux représenté par une grammaire hiérarchique. Nous proposons également une méthode d’apprentissage pour l’analyse automatique de structures temporelles hiérarchiques. Tous les systèmes sont évalués par des musiciens et improvisateurs experts lors de sessions d’écouteCurrent musical improvisation systems are able to generate unidimensional musical sequences by recombining their musical contents. However, considering several dimensions (melody, harmony...) and several temporal levels are difficult issues. In this thesis, we propose to combine probabilistic approaches with formal language theory in order to better assess the complexity of a musical discourse, both from a multidimensional and multi-level point of view in the context of improvisation where the amount of data is limited. First, we present a system able to follow the contextual logic of an improvisation modelled by a factor oracle whilst enriching its musical discourse with multidimensional knowledge represented by interpolated probabilistic models. Then, this work is extended to create another system using a belief propagation algorithm representing the interaction between several musicians, or between several dimensions, in order to generate multidimensional improvisations. Finally, we propose a system able to improvise on a temporal scenario with multi-level information modelled with a hierarchical grammar. We also propose a learning method for the automatic analysis of hierarchical temporal structures. Every system is evaluated by professional musicians and improvisers during listening sessions
17
Li, Kaiyan. "Unified modeling language class diagram translator for the online design pattern library system." CSUSB ScholarWorks, 2003. https://scholarworks.lib.csusb.edu/etd-project/2194.
Анотація:
The Unified Modeling Language (UML) is the successor to the wave of object-oriented analysis and design (OOA&D) methods that appeared in the late '80s and early '90s. The class diagram is one of the most useful diagrams in UML. The class diagram technique has become truly central within object-oriented methods.
18
Finnie, Sigbjorn O. "Composing graphical user interfaces in a purely functional language." Thesis, University of Glasgow, 1998. http://theses.gla.ac.uk/1597/.
Анотація:
This thesis is about building interactive graphical user interfaces in a compositional manner. Graphical user interface application hold out the promise of providing users with an interactive, graphical medium by which they can carry out tasks more effectively and conveniently. The application aids the user to solve some task. Conceptually, the user is in charge of the graphical medium, controlling the order and the rate at which individual actions are performed. This user-centred nature of graphical user interfaces has considerable ramifications for how software is structured. Since the application now services the user rather than the other way around, it has to be capable of responding to the user's actions when and in whatever order they might occur. This transfer of overall control towards the user places heavy burden on programming systems, a burden that many systems don't support too well. Why? Because the application now has to be structured so that it is responsive to whatever action the user may perform at any time. The main contribution of this thesis is to present a compositional approach to constructing graphical user interface applications in a purely functional programming language The thesis is concerned with the software techniques used to program graphical user interface applications, and not directly with their design. A starting point for the work presented here was to examine whether an approach based on functional programming could improve how graphical user interfaces are built. Functional programming languages, and Haskell in particular, contain a number of distinctive features such as higher-order functions, polymorphic type systems, lazy evaluation, and systematic overloading, that together pack quite a punch, at least according to proponents of these languages. A secondary contribution of this thesis is to present a compositional user interface framework called Haggis, which makes good use of current functional programming techniques. The thesis evaluates the properties of this framework by comparing it to existing systems.
19
Wakelin, Andrew. "A database query language for operations on graphical objects." Thesis, Abertay University, 1988. https://rke.abertay.ac.uk/en/studentTheses/826893af-0377-4ec6-a09a-6a5bd246df28.
Анотація:
The motivation for this work arose from the recognised inability of relational databases to store and manipulate data that is outside normal commercial applications (e.g. graphical data). The published work in this area is described with respect to the major problems of representation and manipulation of complex data. A general purpose data model, called GDB, that sucessfully tackles these major problems is developed from a formal specification in ML and is implemented using the PRECI/C database system. This model uses three basic graphical primitives (line segments, plane surfaces - facets, and volume elements tetrons) to construct graphical objects and it is shown how user designed primitives can be included. It is argued that graphical database query languages should be designed to be application specific and the user should be protected from the relational algebra which is the basis of the database operations. Such a base language (an extended version of DEAL) is presented which is capable of performing the necessary graphical manipulation by the use of recursive functions and views. The need for object hierarchies is established and the power of the DEAL language is shown to be necessary to handle such complex structures. The importance of integrity constraints is discussed and some ideas for the provision of user defined constraints are put forward.
20
Wessman, Richard R. "Ada and the graphical kernel system /." Online version of thesis, 1988. http://hdl.handle.net/1850/10624.
21
Martin, Walter E. "Cview, a graphical program generator for the C programming language /." Online version of thesis, 1988. http://hdl.handle.net/1850/10224.
22
Keramopoulos, Euclid. "GOQL, a graphical query language for object-oriented database systems." Thesis, University of Westminster, 2004. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.433847.
23
Brännström, Andreas. "Knowledge Elicitation of Human Activities Using a Graphical Modeling Language." Thesis, Umeå universitet, Institutionen för psykologi, 2018. http://urn.kb.se/resolve?urn=urn:nbn:se:umu:diva-148985.
Анотація:
Recent, and ongoing, research has been addressing the general problem of representing complex human activities for the purpose to provide intelligent software agents with a way to identify, reason, and evaluate human activities. Reliable evaluation of complex human activities requires the intelligent agent to obtain a representation that comprises distinguishing features of an activity. This is a challenging task, since a person´s activity is driven by goals, motives, and norms that may be conflicting in a situation. In order to provide knowledge about human activities to an intelligent software agent, we require tools that can allow us modeling human activities enabling knowledge elicitation. This study has evaluated a software prototype of a graphical modeling language with the overall research question to find the minimum language elements required to elicit the knowledge of activities from a domain expert. Eight participants tested the prototype through think aloud usability sessions were their understanding of the structure of the language was tested. Qualitative data analysis was conducted using a Grounded theory approach, which validity has been discussed. The findings indicated that characteristics of the hierarchical structure of Activity Theory are a supportive theoretical framework for the graphical language that resembles the way occupational therapists reason when analyzing human activities. The study proposes a set of minimum elements for the graphical language. A focus a for future study is to target the intelligent software system to further expand and tune the language by the systems requirements.Pågående forskning har tagit upp det generella problemet med att representera komplexa mänskliga aktiviteter för att tillhandahålla intelligenta mjukvaruagenter med ett sätt att identifiera, resonera och utvärdera mänskliga aktiviteter. Tillförlitlig utvärdering av komplexa mänskliga aktiviteter kräver att den intelligenta agenten erhåller en representation med definierande särdrag hos aktiviteten. Det är en svår uppgift då en persons aktiviteter drivs av mål, motiv och normer som kan vara motstridiga i en situation. För att kunna ge kunskap om mänskliga aktiviteter till en intelligent mjukvaruagent behöver vi verktyg som kan tillåta oss att modellera mänskliga aktiviteter. Denna studie har utvärderat en prototyp av ett grafiskt modelleringsspråk där den övergripande forskningsfrågan var att hitta minsta antalet modelleringskomponenter som krävs för att representera kunskapen om aktiviteter från en domänexpert. Åtta deltagare testade prototypen genom användbarhetstester med tänka högt metodik där deras förståelse av språkets struktur testades. Grundad teori avändes för att analysera den kvalitativa datan. Validitet har diskuterats. Resultaten visade att den hierarkiska strukturen hos Activity theory är en stödjande teoretisk grund för det grafiska språket som liknar hur arbetsterapeuterna resonerar när de analyserar mänskliga aktiviteter. Studien föreslår minsta antalet modelleringskomponenter som krävs för det grafiska språket. Ett fokus för framtida studier är att rikta in sig på det intelligenta mjukvarusystemet för att ytterligare expandera och justera språket efter agentens krav och hitta en komplexitetsnivå i språket som båda parter kan förstå.
24
Pfisterer, Christoph. "A semantic description language for platform independent graphical user interfaces." [S.l. : s.n.], 2002. http://www.bsz-bw.de/cgi-bin/xvms.cgi?SWB10361117.
25
Echegaray, Daniel. "Making a common graphical language for the validation of linked data." Thesis, KTH, Skolan för datavetenskap och kommunikation (CSC), 2017. http://urn.kb.se/resolve?urn=urn:nbn:se:kth:diva-211100.
Анотація:
A variety of embedded systems is used within the design and the construction of trucks within Scania. Because of their heterogeneity and complexity, such systems require the use of many software tools to support embedded systems development. These tools need to form a well-integrated and effective development environment, in order to ensure that product data is consistent and correct across the developing organisation. A prototype is under development which adapts a linked data approach for data integration, more specifically this prototype adapt the Open Services for Lifecycle Collaboration(OSLC) specification for data-integration. The prototype allows users, to design OSLC-interfaces between product management tools and OSLC-links between their data. The user is further allowed to apply constraints on the data conforming to the OSLC validation language Resource Shapes(ReSh). The problem lies in the prototype conforming only to the language of Resource Shapes whose constraints are often too coarse-grained for Scania’s needs, and that there exists no standardised language for the validation of linked data. Thus, for framing this study two research questions was formulated (1) How can a common graphical language be created for supporting all validation technologies of RDF-data? and (2) How can this graphical language support the automatic generation of RDF-graphs? A case study is conducted where the specific case consists of a software tool named SESAMM-tool at Scania. The case study included a constraint language comparison and a prototype extension. Furthermore, a design science research strategy is followed, where an effective artefact was searched for answering the stated research questions. Design science promotes an iterative process including implementation and evaluation. Data has been empirically collected in an iterative development process and evaluated using the methods of informed argument and controlled experiment, respectively, for the constraint language comparison and the extension of the prototype. Two constraint languages were investigated Shapes Constraint Language (SHACL) and Shapes Expression (ShEx). The result of the constraint language comparison concluded SHACL as the constraint language with a larger domain of constraints having finer-grained constraints also with the possibility of defining new constraints. This was based on that SHACL constraints was measured to cover 89.5% of ShEx constraints and 67.8% for the converse. The SHACL and ShEx coverage on ReSh property constraints was measured to 75% and 50%. SHACL was recommended and chosen for extending the prototype. On extending the prototype abstract super classes was introduced into the underlying data model. Constraint language classes were stated as subclasses. SHACL was additionally stated as such a subclass. This design offered an increased code reuse within the prototype but gave rise to issues relating to the plug-in technologies that the prototype is based upon. The current solution still has the issue that properties of one constraint language may be added to classes of another constraint language.En mängd olika inbyggda system används inom design och konstruktion av lastbilar inom Scania. På grund av deras heterogenitet och komplexitet kräver sådana system användningen av många mjukvaruverktyg för att stödja inbyggd systemutveckling. Dessa verktyg måste bilda en välintegrerad och effektiv utvecklingsmiljö för att säkerställa att produktdata är konsekventa och korrekta över utvecklingsorganisationen.En prototyp håller på att utvecklas som anpassar en länkad datainriktning för dataintegration, mer specifikt anpassar denna prototyp en dataintegration specifikation utvecklad av Open Services for Lifecycle Collaboration(OSLC). Prototypen tillåter användare att utforma OSLC-gränssnitt mellan produkthanteringsverktyg och OSLC-länkar mellan deras data. Användaren får vidare tillämpa begränsningar på de data som överensstämmer med OSLC-valideringsspråket Resource Shapes. Problemet ligger i prototypen som endast överensstämmer med Resource Shapes, vars begränsningar ofta är för grova för Scanias behov och att det inte finns något standardiserat språk för validering av länkad data. Således, för att utforma denna studie formulerades två forskningsfrågor (1) Hur kan ett gemensamt grafiskt språk skapas för att stödja alla valideringsteknologier av RDF-data? och (2) Hur kan detta grafiska språk stödja Automatisk generering av RDF-grafer? En fallstudie genomförs där det specifika fallet består av ett mjukvaruverktyg som heter SESAMM-tool hos Scania. Fallstudien innehöll en jämförelse av valideringsspråk och vidareutveckling av prototypen. Vidare följs Design Science som forskningsstrategi där en effektiv artefakt sökts för att svara på de angivna forskningsfrågorna. Design Science främjar en iterativ process inklusive genomförande och utvärdering. Data har empiriskt samlats på ett iterativt sätt och utvärderats med hjälp av utvärderingsmetoderna informerat argument och kontrollerat experiment, för valideringsspråkjämförelsen och vidareutvecklingen av prototypen. Två valideringsspråk undersöktes Shapes Constraint Language (SHACL) och Shapes Expression (ShEx).Resultatet av valideringsspråksjämförelsen konkluderade SHACL som valideringsspråket med en större domän av begränsningar, mer finkorniga begränsningar och med möjligheten att definiera nya begränsningar. Detta var baserat på att SHACL-begränsningarna uppmättes täcka 89,5 % av ShEx-begränsningarna och 67,8 % för det omvända. SHACL- och ShEx-täckningen för Resource Shapes-egenskapsbegränsningar mättes till 75 % respektive 50 %. SHACL rekommenderades och valdes för att vidareutveckla prototypen.Vid vidareutveckling av prototypen infördes abstrakta superklasser i den underliggande datamodellen. Superklasserna tog i huvudsak rollen som tidigare klasser för valideringsspråk, som istället utgjordes som underklasser. SHACL anges som en sådan underklass. Denna design erbjöd hög kodåteranvändning inom prototypen men gav också upphov till problem som relaterade till plugin-teknologier som prototypen bygger på. Den nuvarande lösningen har fortfarande problemet att egenskaper hos ett valideringsspråk kan läggas till klasser av ett annat valideringsspråk.
26
Ekin, Tufan. "Graphical user interface tool kit for path-based network policy language." Thesis, Monterey, California. Naval Postgraduate School, 2002. http://hdl.handle.net/10945/6067.
Анотація:
Approved for public release, distribution is unlimitedThe Path-based Policy Language (PPL) is a formal network policy language for constructing models of Internet service and access control. Seven changes have been made to the LEXER and YACC code of PPL. Five of the changes are related to the syntax of policy rules in PPL. Two of the changes are related to the semantics of the language. A graphical user interface tool kit for creating, validating, archiving and compiling policies represented in PPL has been developed. The tool kit has a field-by-field interface that allows a policy maker to input and update PPL compliant policy rules, while hiding the subtle details of the PPL syntax from the user. Prior to the work reported here, policy files were created separately and the PPL compiler had to be invoked manually from a command line interface. The GUI combines the processes of forming a policy file and compiling. These processes are performed automatically from the menu items of the tool kit. The GUI itself is password protected, permitting only authorized users access to the system. Protection of the policy rules is also provided via the tool kit.
27
Mirsad, Ćosović. "Distributed State Estimation in Power Systems using Probabilistic Graphical Models." Phd thesis, Univerzitet u Novom Sadu, Fakultet tehničkih nauka u Novom Sadu, 2019. https://www.cris.uns.ac.rs/record.jsf?recordId=108459&source=NDLTD&language=en.
Анотація:
We present a detailed study on application of factorgraphs and the belief propagation (BP) algorithm to thepower system state estimation (SE) problem. We startfrom the BP solution for the linear DC model, for whichwe provide a detailed convergence analysis. Using BPbasedDC model we propose a fast real-time stateestimator for the power system SE. The proposedestimator is easy to distribute and parallelize, thusalleviating computational limitations and allowing forprocessing measurements in real time. The presentedalgorithm may run as a continuous process, with eachnew measurement being seamlessly processed by thedistributed state estimator. In contrast to the matrixbasedSE methods, the BP approach is robust to illconditionedscenarios caused by significant differencesbetween measurement variances, thus resulting in asolution that eliminates observability analysis. Using theDC model, we numerically demonstrate the performanceof the state estimator in a realistic real-time systemmodel with asynchronous measurements. We note thatthe extension to the non-linear SE is possible within thesame framework.Using insights from the DC model, we use two differentapproaches to derive the BP algorithm for the non-linearmodel. The first method directly applies BP methodology,however, providing only approximate BP solution for thenon-linear model. In the second approach, we make a keyfurther step by providing the solution in which the BP isapplied sequentially over the non-linear model, akin towhat is done by the Gauss-Newton method. The resultingiterative Gauss-Newton belief propagation (GN-BP)algorithm can be interpreted as a distributed Gauss-Newton method with the same accuracy as thecentralized SE, however, introducing a number ofadvantages of the BP framework. The thesis providesextensive numerical study of the GN-BP algorithm,provides details on its convergence behavior, and gives anumber of useful insights for its implementation.Finally, we define the bad data test based on the BPalgorithm for the non-linear model. The presented modelestablishes local criteria to detect and identify bad datameasurements. We numerically demonstrate that theBP-based bad data test significantly improves the baddata detection over the largest normalized residual test.Glavni rezultati ove teze su dizajn i analiza novihalgoritama za rešavanje problema estimacije stanjabaziranih na faktor grafovima i „Belief Propagation“ (BP)algoritmu koji se mogu primeniti kao centralizovani ilidistribuirani estimatori stanja u elektroenergetskimsistemima. Na samom početku, definisan je postupak zarešavanje linearnog (DC) problema korišćenjem BPalgoritma. Pored samog algoritma data je analizakonvergencije i predloženo je rešenje za unapređenjekonvergencije. Algoritam se može jednostavnodistribuirati i paralelizovati, te je pogodan za estimacijustanja u realnom vremenu, pri čemu se informacije moguprikupljati na asinhroni način, zaobilazeći neke odpostojećih rutina, kao npr. provera observabilnostisistema. Proširenje algoritma za nelinearnu estimacijustanja je moguće unutar datog modela.Dalje se predlaže algoritam baziran na probabilističkimgrafičkim modelima koji je direktno primenjen nanelinearni problem estimacije stanja, što predstavljalogičan korak u tranziciji od linearnog ka nelinearnommodelu. Zbog nelinearnosti funkcija, izrazi za određenuklasu poruka ne mogu se dobiti u zatvorenoj formi, zbogčega rezultujući algoritam predstavlja aproksimativnorešenje. Nakon toga se predlaže distribuirani Gaus-Njutnov metod baziran na probabilističkim grafičkimmodelima i BP algoritmu koji postiže istu tačnost kao icentralizovana verzija Gaus-Njutnovog metoda zaestimaciju stanja, te je dat i novi algoritam za otkrivanjenepouzdanih merenja (outliers) prilikom merenjaelektričnih veličina. Predstavljeni algoritam uspostavljalokalni kriterijum za otkrivanje i identifikacijunepouzdanih merenja, a numerički je pokazano daalgoritam značajno poboljšava detekciju u odnosu nastandardne metode.
28
Perez, Manuel A. "A language for interactive computer graphics programming." Virtual Press, 1987. http://liblink.bsu.edu/uhtbin/catkey/484784.
Анотація:
The writer defines graphics-oriented data types and operators as the basis for a graphics-oriented programming language. Most of these data types are not available in today's languages. They are usually defined as structures or records composed of some other basic types. These include points, rectangles, transformations, etc. Some operators, such as vector addition, are defined to work with them.The design and implementation of an interpreter to test some of these graphics data types and operators are discussed.The writer also examines some of the tools needed in a graphics programming environment.
29
Santana, Sepulveda Julio Sergio. "The generation of coordinated natural language and graphical explanations in design environments." Thesis, University of Salford, 1999. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.301461.
30
Chunawala, Shakil A. (Shakil Ahmed). "Creatr, a genergtic graphical distributed debugger with language support for application interfacing." Thesis, Massachusetts Institute of Technology, 1994. http://hdl.handle.net/1721.1/34094.
Анотація:
Thesis (M.S.)--Massachusetts Institute of Technology, Dept. of Electrical Engineering and Computer Science, 1994.Includes bibliographical references (leaves 84-86).
by Shakil A. Chunawala.
M.S.
31
Jacobs, Robert N. (Robert Nathan). "A wireless sensor-based mobile music environment complied from a graphical language." Thesis, Massachusetts Institute of Technology, 2007. http://hdl.handle.net/1721.1/46087.
Анотація:
Thesis (M. Eng.)--Massachusetts Institute of Technology, Dept. of Electrical Engineering and Computer Science, 2007.Includes bibliographical references (p. 79-80).
In this thesis I demonstrate a framework for a wireless sensor-based mobile music environment. Most prior work has not been truly portable. Those that were have focused on external data as opposed to properties of the listener. In this project I built a short-range wireless sensor network (using the ZigBee protocol and an accelerometer) and a compiler for PureData, a graphical music processing language. With these parts, I realized a synchronized music experience that generates a soundtrack based on the listener's movement. By synchronizing the music to the user's natural rhythms, it encourages the user to maintain a given pace for a longer period of time. I describe extensions to this example that point to a future of portable interactive music tied to exercise and physical activity.
by Robert N. Jacobs.
M.Eng.
32
Déguernel, Ken. "Apprentissage de structures musicales en contexte d'improvisation." Electronic Thesis or Diss., Université de Lorraine, 2018. http://www.theses.fr/2018LORR0011.
Анотація:
Les systèmes actuels d’improvisation musicales sont capables de générer des séquences musicales unidimensionnelles par recombinaison du matériel musical. Cependant, la prise en compte de plusieurs dimensions (mélodie, harmonie...) et la modélisation de plusieurs niveaux temporels sont des problèmes difficiles. Dans cette thèse, nous proposons de combiner des approches probabilistes et des méthodes issues de la théorie des langages formels afin de mieux apprécier la complexité du discours musical à la fois d’un point de vue multidimensionnel et multi-niveaux dans le cadre de l’improvisation où la quantité de données est limitée. Dans un premier temps, nous présentons un système capable de suivre la logique contextuelle d’une improvisation représentée par un oracle des facteurs tout en enrichissant son discours musical à l’aide de connaissances multidimensionnelles représentées par des modèles probabilistes interpolés. Ensuite, ces travaux sont étendus pour modéliser l’interaction entre plusieurs musiciens ou entre plusieurs dimensions par un algorithme de propagation de croyance afin de générer des improvisations multidimensionnelles. Enfin, nous proposons un système capable d’improviser sur un scénario temporel avec des informations multi-niveaux représenté par une grammaire hiérarchique. Nous proposons également une méthode d’apprentissage pour l’analyse automatique de structures temporelles hiérarchiques. Tous les systèmes sont évalués par des musiciens et improvisateurs experts lors de sessions d’écouteCurrent musical improvisation systems are able to generate unidimensional musical sequences by recombining their musical contents. However, considering several dimensions (melody, harmony...) and several temporal levels are difficult issues. In this thesis, we propose to combine probabilistic approaches with formal language theory in order to better assess the complexity of a musical discourse, both from a multidimensional and multi-level point of view in the context of improvisation where the amount of data is limited. First, we present a system able to follow the contextual logic of an improvisation modelled by a factor oracle whilst enriching its musical discourse with multidimensional knowledge represented by interpolated probabilistic models. Then, this work is extended to create another system using a belief propagation algorithm representing the interaction between several musicians, or between several dimensions, in order to generate multidimensional improvisations. Finally, we propose a system able to improvise on a temporal scenario with multi-level information modelled with a hierarchical grammar. We also propose a learning method for the automatic analysis of hierarchical temporal structures. Every system is evaluated by professional musicians and improvisers during listening sessions
33
Carette, Titouan. "Manier le ZX-calcul : flexsymétrie, systèmes ouverts et limandes." Electronic Thesis or Diss., Université de Lorraine, 2021. http://www.theses.fr/2021LORR0200.
Анотація:
Cette thèse concerne l'application de langages graphiques à l'informatique quantique. Par langages graphiques on entends l'usage de diagrammes, très similaire au circuits, représentant des évolutions de systèmes quantique. La thèse introduit ces langages dans le formalisme de la théorie des catégories et s’intéresse en particulier a un langage : le ZX-calcul, ainsi qu'a ses proche parent le ZW-calcul et le ZH-calcul. La notion de flexsymmetrie est introduite, décrivant des diagrammes dont les entrés et sorties sont toutes interchangeables entre elles. La notion et ensuite utilisée pour classifier tout les langage similaire au ZX-calcul. Il est montré que les seuls langages admissibles sont le ZX-calcul, le ZW-calcul et le ZH-calcul. Ensuite est abordée la question de l'extension de ces langages au cas de systèmes mixtes classique-quantique. Une construction catégorique générale est proposée et est utilisée pour étendre les différent langages. Enfin la thèse introduit des notations permettant de représenter de manière compact des algorithmes quantiques mettant en jeux des diagrammes arbitrairement grand. Afin d'en éprouver l'efficacité, ces notations sont utilisé pour montrer graphiquement la correction de différents algorithmes quantiquesThis thesis is about the application of graphical languages to quantum computing. By graphical language, we mean the use of diagrams, similar to circuits, representing the evolution of quantum systems. The thesis introduces those languages in the formalism of category theory and focuses mainly on one language: the ZX-calculus, and its close relatives, the ZW-calculus and ZH-calculus. The notion of flexsymmetry is introduced, describing diagrams whose inputs and outputs are all interchangeable. This notion is used to classified all languages similar to the ZX-calculus. It is shown that the only admissible languages are the ZX-calculus, the ZH-calculus, and the ZW-calculus. Then is tackled the question of extending those languages to mixed-state quantum mechanics. A general categorical construction is proposed and is applied to provide extensions of the different languages. Finally, the thesis introduces notations allowing to handle in a compact way quantum algorithms relying on arbitrary large diagrams. To challenge their efficiency, those notations are used to show the correction of various quantum algorithms
34
Ford, Natanya. "Developing a graphical language to represent listeners' experiences of spatial attributes in reproduced sound." Thesis, University of Surrey, 2005. http://epubs.surrey.ac.uk/812994/.
Анотація:
Spatial attributes of reproduced sound have typically been described using primarily verbal descriptors. To gain an alternative perspective, the development of a communication medium is discussed which enables listeners' auditory spatial experiences to be represented graphically. Graphical descriptions of auditory spatial experiences were sought from listeners when multichannel audio was reproduced within an automotive setting. In order to avoid biasing results by adopting traditional assumptions relating to spatial audio evaluation, the listener was acknowledged as the originator of meaning and valid results sought by the exploration and understanding of the listeners' individual experiences. Because experiences are pre-linguistic and distinct from language, a communication medium was required for the structuring and representation of listeners' auditory spatial experiences in order that these could be understood by the researcher. A descriptive graphical language (GAL) was systematically developed and evaluated for this purpose. A series of investigations was conducted during which GAL evolved from a system of individually elicited descriptors to a universal language of graphical terms, capable of representing the salient spatial experiences of listeners with varying levels of critical listening expertise. At each successive stage in GAL's development, ambiguities which could impede the researcher's understanding of listeners' graphically represented spatial experiences were identified and minimised. A graphical model was presented for visualising instances where ambiguities occurred in the descriptive process. One notable anomaly was found to be related to the provision of unsuitable written instruction in listening investigations. The effect of this ambiguity was minimised by listeners developing their own verbal descriptors to accompany their graphical language. When a mutual language - developed by the listeners themselves - was evaluated, an unambiguous route through the descriptive process from Ustener to researcher was identified. Within the context of the research, it was concluded that this particular language enabled the researcher to acquire a valid understanding of listeners' auditory spatial experiences. It was further concluded that the method employed in the development of the language (an iterative process comprising descriptor elicitation, clarification, development, evaluation and ultimately validation) could be used in alternative contexts within subjective audio evaluation.
35
Wessler, Michael Alan 1970. "NPL : a graphical programming language for motor control and its application to bipedal walking." Thesis, Massachusetts Institute of Technology, 2002. http://hdl.handle.net/1721.1/29228.
Анотація:
Thesis (Ph. D.)--Massachusetts Institute of Technology, Dept. of Electrical Engineering and Computer Science, 2002.Includes bibliographical references (p. 123-126).
Current methods for bipedal walking control include playback of recorded joint motion and the derivation of dynamic equations to map desired forces at the body to the required torques at the joints. Both methods require a significant amount of up-front knowledge about the structure and characteristics of the robot. This thesis presents an alternative method of control that removes the interdependence of the joint torques and simplifies the mathematics considerably. The simplification allows a programmer to create and tune a bipedal walk controller without requiring a complete model of the dynamics. The controller is implemented in a graphical programming language similar to fuzzy logic and neural networks, in which the algorithm is contained in the structure of the nodes rather than in the weights of the connections. The language and its development environment are specifically designed to assist the programmer to create and debug the algorithm in a live environment.
by Michael Alan Wessler.
Ph.D.
36
Wall, Karl. "G#, a graphical approach to functional programming." Thesis, Tekniska Högskolan, Högskolan i Jönköping, JTH, Datateknik och informatik, 2019. http://urn.kb.se/resolve?urn=urn:nbn:se:hj:diva-43359.
Анотація:
The purpose of this bachelor thesis was to present a solution for how a graphical programming language with a functional mindset can be constructed with the help of inspiration from functional programming. An artefact was created by using design science as a research methodology and has in several iterations gone through development and testing to reassure the outcome works as intended. The graphical programming language which has been developed is a language that allows the programmer to code in depth, functions are written as blocks inside blocks and the language is made compact. A code structure in a JSON-format was developed at the same time as G#, allowing it to be presented in a texted data format. The purpose of the JSON-format was to enable execution of G# and the transformation to a text-based programming language. Implications can be made from this study by learning about how a graphical programming language can be built from scratch and what difficulties needs to be tackled to get a result that works as intended. G# was developed to only support a few selected and commonly used functions in programming due to time limitations. The final version of G# in this study can do calculations, handle lists and perform less complex algorithms. Under the development of G#’s graphical functions, the free tool Draw.io was used. Unknowingly from the start, Draw’s limitations made it not perform as expected. Therefore, it is recommended to investigate which available tools are most suited for the construction of the graphical functions before development begins.Syftet med examensarbetet var att med hjälp av inspiration från funktionell programmering, presentera en lösning på hur ett nytt grafiskt programmeringsspråk med ett funktionellt djup och tänk kan konstrueras. Med hjälp av designbaserad forskning har en artefakt tagits fram som genomgått iterationer av utveckling och testning för att uppnå ett resultat som fungerar som tänkt. Det grafiska språket som tagits fram kallas för G# och är ett språk som tillåter programmeraren att programmera på djupet, funktioner skrivs som block inuti block och språket blir kompakt. Tillhörande G# så konstruerades en struktur i ett JSON-format för hur funktioner i G# kan representeras i ett textat dataformat. Syftet med JSON-formatet var att möjliggöra exekvering av G# och transformering till ett textbaserat programmeringsspråk. Av denna studie kan det dras lärdomar kring hur ett programmeringsspråk kan byggas upp från grunden och vilka svårigheter som måste tacklas för att få ett resultat som fungerar. På grund av begränsning av tid så utvecklades endast vanligt förekommande funktioner inom programmering till G#, språkets slutversion kan göra beräkningar, sköta hantering av listor och utföra enklare algoritmer. Vid utvecklingen av G# användes verktyget Draw.io för att konstruera funktioner. Verktyget var begränsat i funktionalitet och presterade inte enligt förväntan. Därför borde en undersökning som svarar på vilket typ av verktyg som är mest lämpligt för utvecklingen av de grafiska funktionerna göras innan utvecklingen börjar.
37
Fogel, Earl. "Teaching Prolog using intelligent computer-assisted instruction and a graphical trace." Thesis, University of British Columbia, 1988. http://hdl.handle.net/2429/27923.
Анотація:
Two methods for improving the quality of Computer Assisted Instruction are examined. They are: using Intelligent Computer Assisted Instruction techniques to make the CAI system more flexible, and using graphics to increase the efficacy of teaching.
Two computer systems for teaching the Logic Programming language Prolog were developed.
The first is an ICAI system which uses the prerequisite relationships of the course material to plan a course of study. It distinguishes between methods of instruction and topics of instruction, giving students a great deal of freedom in choosing either one.
The second is an animated trace which graphically illustrates the execution of Prolog programs. Information is displayed in three windows — one for Prolog goals, one for the database, and one for output from the program being traced.
Results indicate that ICAI and graphics can both be used effectively in the teaching of programming languages, particularly in combination.Science, Faculty of
Computer Science, Department of
Graduate
38
Miller, Ruane. "A study of PostScript as a graphics programming language /." Online version of thesis, 1988. http://hdl.handle.net/1850/11483.
39
Beasley, Johnita. "A graphical alternative to direct SQL based querying." Master's thesis, This resource online, 1993. http://scholar.lib.vt.edu/theses/available/etd-12162009-020050/.
40
Trout, Terry Thoke. "Design of computer animation languages /." Title page, contents and abstract only, 1990. http://web4.library.adelaide.edu.au/theses/09SM/09smt861.pdf.
41
Pickering, Jonathan H. "Intelligent camera planning for computer graphics." Thesis, University of York, 2002. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.274489.
42
Clément, Alexandre. "Langages graphiques pour le contrôle quantique et l'optique linéaire." Electronic Thesis or Diss., Université de Lorraine, 2023. http://www.theses.fr/2023LORR0093.
Анотація:
Dans le modèle usuel de calcul quantique, des opérations sur des données quantiques sont contrôlées de manière essentiellement classique. Un contrôle lui aussi quantique est cependant possible, mais a été peu étudié en comparaison. En particulier, il manque au contrôle quantique un formalisme permettant de l'exprimer de manière simple afin de raisonner efficacement sur des processus l'impliquant. La première contribution de cette thèse est de poser les fondations d'un cadre formel dédié au contrôle quantique, sous la forme d'un langage graphique. Notre principal résultat concernant ce langage est l'introduction d'une théorie équationnelle complète, c'est à dire d'un ensemble d'équations permettant de transformer un diagramme, par réécriture locale successive, en n'importe quel autre diagramme représentant le même programme ou processus physique. Une deuxième contribution est l'application de ce formalisme d'une part au problème de l'optimisation des ressources dans les processus impliquant un contrôle quantique, et d'autre part à la caractérisation de l'équivalence observationnelle des canaux de communication quantiques. La troisième contribution de cette thèse est l'introduction d'un langage pour les circuits optiques linéaires. Nous l'équipons d'une théorie équationnelle complète, ainsi que d'une forme normale simple, accessible par un système de réécriture fortement normalisant et confluent. La dernière contribution de cette thèse, peut-être la plus importante, est l'introduction d'une théorie équationnelle complète pour le langage des circuits quantiques. Nous nous appuyons pour cela sur une correspondance entre les circuits quantiques et les circuits optiques, qui nous permet de transférer la théorie équationnelle déjà obtenue pour les circuits optiquesIn the models of quantum computing usually considered, some quantum data is manipulated by means of operations which are controlled in an essentially classical way. Controlling these operations in a quantum way is actually possible, but has been much less studied. In particular, quantum control misses a formalism in which one could represent it in a simple way in order to efficiently reason on processes involving it. The first contribution of this thesis is to lay the foundations of a formal framework dedicated to quantum control, in the form of a graphical language. Our main result about this language is the introduction of a complete equational theory, that is, a set of equations that makes it possible, by successive local rewriting, to transform a given diagram into any other diagram representing the same program or physical process. A second contribution is to apply this formalism, on the one hand, to the problem of resource optimisation of processes involving quantum control, and on the other hand, to the characterisation of the observational equivalence of quantum communication channels. A third contribution of this thesis is to introduce a language for linear optical circuits. We equip this language with a complete equational theory, together with a simple normal form, reachable via a strongly normalising and confluent rewriting system. The last contribution of this thesis, maybe the most significant one, is to introduce a complete equational theory for the language of quantum circuits. We obtain this result by exploiting a correspondence between quantum circuits and optical circuits, which allows us to transfer the equational theory already obtained for optical circuits
43
Parikh, Ankur. "Spectral Probablistic Modeling and Applications to Natural Language Processing." Research Showcase @ CMU, 2015. http://repository.cmu.edu/dissertations/791.
Анотація:
Probabilistic modeling with latent variables is a powerful paradigm that has led to key advances in many applications such natural language processing, text mining, and computational biology. Unfortunately, while introducing latent variables substantially increases representation power, learning and modeling can become considerably more complicated. Most existing solutions largely ignore non-identifiability issues in modeling and formulate learning as a nonconvex optimization problem, where convergence to the optimal solution is not guaranteed due to local minima. In this thesis, we propose to tackle these problems through the lens of linear/multi-linear algebra. Viewing latent variable models from this perspective allows us to approach key problems such as structure learning and parameter learning using tools such as matrix/tensor decompositions, inversion, and additive metrics. These new tools enable us to develop novel solutions to learning in latent variable models with theoretical and practical advantages. For example, our spectral parameter learning methods for latent trees and junction trees are provably consistent, local-optima-free, and 1-2 orders of magnitude faster thanEMfor large sample sizes. In addition, we focus on applications in Natural Language Processing, using our insights to not only devise new algorithms, but also to propose new models. Our method for unsupervised parsing is the first algorithm that has both theoretical guarantees and is also practical, performing favorably to theCCMmethod of Klein and Manning. We also developed power low rank ensembles, a framework for language modeling that generalizes existing n-gram techniques to non-integer n. It consistently outperforms state-of-the-art Kneser Ney baselines and can train on billion-word datasets in a few hours.
44
Yoo, Sirah. "Ineffable: Latency in Symbolic Languages." VCU Scholars Compass, 2017. http://scholarscompass.vcu.edu/etd/4814.
Анотація:
The design process demands comprehensive knowledge of visual signs and symbols with a focus on visual literacy; it is related to visual syntax, semantics, and the pragmatics of contexts. My work is an interdisciplinary investigation into how designers integrate polysemantic signs into their design process for particular and highly individualized audiences. By analyzing the role of signs in specific contexts across the spectrum of arts, society, literature, and semiotics, a designer's understanding of the cyclical nature of interpretation and reinterpretation in complex environments creates an avenue for cultivating a new schema that provides further levels of interpretations and different access points. By removing elements from their original context, and fusing these elements into new narratives, we implement new meanings and emphasize the value of interpretation.
45
Ucci, Allison. "American Sign Language : an influence on graphic design problem-solving /." Online version of thesis, 2008. http://hdl.handle.net/1850/6274.
46
Eade, Frederick Robert. "The graphic language of vernacular literacy primers in West Africa." Thesis, University of Reading, 1993. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.359789.
47
Sin, Chi-lun. "Interactive mapping using scalable vector graphics technology." Click to view the E-thesis via HKUTO, 2005. http://sunzi.lib.hku.hk/hkuto/record/B35518145.
48
Sin, Chi-lun, and 冼子倫. "Interactive mapping using scalable vector graphics technology." Thesis, The University of Hong Kong (Pokfulam, Hong Kong), 2005. http://hub.hku.hk/bib/B35518145.
49
Chow, Kent. "GPLOT : a language for plotting graphs." Thesis, McGill University, 1985. http://digitool.Library.McGill.CA:80/R/?func=dbin-jump-full&object_id=66062.
50
Willison, Richard. "PyGraph : a graphic front-end for the PAISLey executable specification language /." Online version of thesis, 1987. http://hdl.handle.net/1850/10142.