Academic literature on the topic 'Graphical representation'

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

Select a source type:

Consult the lists of relevant articles, books, theses, conference reports, and other scholarly sources on the topic 'Graphical representation.'

Next to every source in the list of references, there is an 'Add to bibliography' button. Press on it, and we will generate automatically the bibliographic reference to the chosen work in the citation style you need: APA, MLA, Harvard, Chicago, Vancouver, etc.

You can also download the full text of the academic publication as pdf and read online its abstract whenever available in the metadata.

Journal articles on the topic "Graphical representation"

1

Clary, Renee M., and James H. Wandersee. "The evolution of non-quantitative geological graphics in texts during the formative years of geology (1788–1840)." Earth Sciences History 34, no. 1 (January 1, 2015): 59–91. http://dx.doi.org/10.17704/1944-6187-34.1.59.

Full text
Abstract:
Although modern geology uses both pictorial and graphical illustrations for conveying information and data presentation, early books in the discipline did not place such a reliance on graphics. This study investigated the numbers and types of graphics in 72 texts containing geological illustrations, which were considered to be representative (excluding works with solely mineralogical or paleontological illustrations), published during the formative years of geology (1788–1840) in terms of Edward R. Tufte's principles of graphic design. The text graphics were analyzed in terms of the presence of proxy or inferred imagery, direct or keyed labeling, unnecessary embellishment, and their data density; and whether they exhibited multivariate properties, represented the small multiple format, or exhibited graphic modifications. Mixed methodology analyses revealed four stages in the evolution of geologic illustrations in the interval from 1788–1840: (1) early pictorial or proxy representations; (2) the introduction of labeled graphics, coinciding with the first geology textbooks; (3) ‘grand' or elaborate illustration; and (4) a high graphic density. Although progress was made in graphical representation during the time period studied, statistical graphics were hardly ever used.
APA, Harvard, Vancouver, ISO, and other styles
2

Fortes, Fabrício Pires. "A Distinção Gráfico-Linguístico e a Notação Musical." Philosophy of Music 74, no. 4 (December 30, 2018): 1465–92. http://dx.doi.org/10.17990/rpf/2018_74_4_1465.

Full text
Abstract:
This paper examines the traditional musical notation from the viewpoint of the general problem concerning the types of visual representations. More specifically, we analyze this system in relation to the distinction between graphical and linguistic representations. We start by comparing this notation with the representational systems which are most commonly associated with such categories: on the one hand, pictorial representations as an example of a graphical representation; on the other hand, verbal writing usually associated with a linguistic representation. Then, we examine the traditional musical notation in relation to different ways of drawing the distinction graphic–linguistic, and we evaluate the applicability of such criteria to the former system. Finally, we present some general remarks about the legitimacy of this distinction both with respect to representational systems in general and to the specific case of the traditional musical notation.
APA, Harvard, Vancouver, ISO, and other styles
3

Millán-Martínez, Pere, and Pedro Valero-Mora. "Automating statistical diagrammatic representations with data characterization." Information Visualization 17, no. 4 (July 21, 2017): 316–34. http://dx.doi.org/10.1177/1473871617715326.

Full text
Abstract:
The search for an efficient method to enhance data cognition is especially important when managing data from multidimensional databases. Open data policies have dramatically increased not only the volume of data available to the public, but also the need to automate the translation of data into efficient graphical representations. Graphic automation involves producing an algorithm that necessarily contains inputs derived from the type of data. A set of rules are then applied to combine the input variables and produce a graphical representation. Automated systems, however, fail to provide an efficient graphical representation because they only consider either a one-dimensional characterization of variables, which leads to an overwhelmingly large number of available solutions, a compositional algebra that leads to a single solution, or requires the user to predetermine the graphical representation. Therefore, we propose a multidimensional characterization of statistical variables that when complemented with a catalog of graphical representations that match any single combination, presents the user with a more specific set of suitable graphical representations to choose from. Cognitive studies can then determine the most efficient perceptual procedures to further shorten the path to the most efficient graphical representations. The examples used herein are limited to graphical representations with three variables given that the number of combinations increases drastically as the number of selected variables increases.
APA, Harvard, Vancouver, ISO, and other styles
4

T. HEALEY, PATRICK G., NIK SWOBODA, ICHIRO UMATA, and YASUHIRO KATAGIRI. "Graphical representation in graphical dialogue." International Journal of Human-Computer Studies 57, no. 4 (October 2002): 375–95. http://dx.doi.org/10.1006/ijhc.2002.1022.

Full text
APA, Harvard, Vancouver, ISO, and other styles
5

Pugh, Zachary H., and Douglas J. Gillan. "Nodes Afford Connection: A Pilot Study Examining the Design and Use of a Graphical Modeling Language." Proceedings of the Human Factors and Ergonomics Society Annual Meeting 65, no. 1 (September 2021): 1024–28. http://dx.doi.org/10.1177/1071181321651150.

Full text
Abstract:
External representations such as diagrams facilitate reasoning. Many diagramming systems and notations are amenable to manipulation by actual or imagined intervention (e.g., transposing terms in an equation). Such manipulation is constrained by user-enforced constraints, including rules of syntax and semantics which help preserve the representation’s validity. We argue that the concepts of affordances and signifiers can be applied to understand such representations, and we suggest the term graphical affordance to refer to rule-constrained syntactic manipulation of an external representation. Following this argument, we examine a graphical modeling language in terms of these graphical affordances, and we present a pilot study examining how participants interact with the modeling language. Preliminary results suggest that using the modeling language, as opposed to prose representation, influences user behavior in a manner aligned with the graphical affordances and signifiers of the modeling language.
APA, Harvard, Vancouver, ISO, and other styles
6

Anderson, Gail M. "The Evolution of the Cartesian Connection." Mathematics Teacher 102, no. 2 (September 2008): 107–11. http://dx.doi.org/10.5951/mt.102.2.0107.

Full text
Abstract:
One of NCTM's ten standards for school mathematics is Representation: “Representations [such as diagrams, graphs, and symbols] should be treated as essential elements in supporting students' understanding of mathematical concepts and relationships; in communicating mathematical approaches, arguments, and understandings to one's self and to others; in recognizing connections among related mathematical concepts; and in applying mathematics to realistic problem situations through modeling” (NCTM 2000, p. 67). In my experience, one of the biggest issues students struggle with is the connection between equations and their graphs (referred to as the “Cartesian connection” in an interesting study by Knuth [2000]). Unfortunately, although students are becoming proficient in using algebraic and graphical representations independently, they often do not make the connection between the two representational formats (Knuth 2000; NCTM 2000; Van Dyke and White 2004). In this article, I will explore the history of the graphical representation of functions and curves, specifically, the development of the Cartesian coordinate system as the most common frame for this graphical representation.
APA, Harvard, Vancouver, ISO, and other styles
7

Anderson, Gail M. "The Evolution of the Cartesian Connection." Mathematics Teacher 102, no. 2 (September 2008): 107–11. http://dx.doi.org/10.5951/mt.102.2.0107.

Full text
Abstract:
One of NCTM's ten standards for school mathematics is Representation: “Representations [such as diagrams, graphs, and symbols] should be treated as essential elements in supporting students' understanding of mathematical concepts and relationships; in communicating mathematical approaches, arguments, and understandings to one's self and to others; in recognizing connections among related mathematical concepts; and in applying mathematics to realistic problem situations through modeling” (NCTM 2000, p. 67). In my experience, one of the biggest issues students struggle with is the connection between equations and their graphs (referred to as the “Cartesian connection” in an interesting study by Knuth [2000]). Unfortunately, although students are becoming proficient in using algebraic and graphical representations independently, they often do not make the connection between the two representational formats (Knuth 2000; NCTM 2000; Van Dyke and White 2004). In this article, I will explore the history of the graphical representation of functions and curves, specifically, the development of the Cartesian coordinate system as the most common frame for this graphical representation.
APA, Harvard, Vancouver, ISO, and other styles
8

Randić, Milan, Jure Zupan, Alexandru T. Balaban, Dražen Vikić-Topić, and Dejan Plavšić. "Graphical Representation of Proteins†." Chemical Reviews 111, no. 2 (February 9, 2011): 790–862. http://dx.doi.org/10.1021/cr800198j.

Full text
APA, Harvard, Vancouver, ISO, and other styles
9

Barthel, Friederike Maria-Sophie, and Patrick Royston. "Graphical Representation of Interactions." Stata Journal: Promoting communications on statistics and Stata 6, no. 3 (August 2006): 348–63. http://dx.doi.org/10.1177/1536867x0600600304.

Full text
APA, Harvard, Vancouver, ISO, and other styles
10

Hapizah, Hapizah, Ely Susanti, and Puji Astuti. "TEACHER’S ABILITIES OF TRANSLATION OF SYMBOLIC REPRESENTATION TO VISUAL REPRESENTATION AND VICE VERSA: ADDITION OF INTEGERS." International Journal of Pedagogy and Teacher Education 3, no. 1 (May 3, 2019): 41. http://dx.doi.org/10.20961/ijpte.v3i1.19268.

Full text
Abstract:
<p><em>Translation of representations is a process of changing </em><em>representations </em><em>from one into</em><em> </em><em>another</em><em> one</em><em>. In generally, mathematics representations consists of symbolical, </em><em>visual (</em><em>graphical</em><em>)</em><em>,</em><em> </em><em>verbal, and tabular representations. This article discusses results of research about teacher’s understanding of mathematics representations and its implementation, which is teacher’s ability of translating from symbolical representation to graphical representation and vice v</em><em>e</em><em>rsa. The sample of research were 91 mathematics teacher from some districts of South Sumatera and Bangka Belitung provinces. The data of research were collected by test related to addition of integers. The results show that teacher’s ability of translating from symbolical representation into graphical representation is very low which is only 48,4% of the sample could translate the representations correctly, meanwhile teacher’s ability of translating from graphical representation into symbolical representation</em><em> </em><em>is quite good which is 75,8% of the sample could translate the representations correctly.</em><em> The mistakes identified when the mathematics teachers translated symbolic representation to visual representation are the result of addition not presented in numbers line, no the result of addition presented at all, the order of numbers line not presented clearly, misdirection or no direction of numbers line, and no answers at all. Meanwhile the mistakes identified when the mathematics teachers translated visual representation to symbolic representation are no the result of addition presented, incorrectly order of numbers added, and no answers at all</em>.</p>
APA, Harvard, Vancouver, ISO, and other styles
More sources

Dissertations / Theses on the topic "Graphical representation"

1

Szalapaj, Peter J. "Logical graphics : logical representation of drawings to effect graphical transformation." Thesis, University of Edinburgh, 1988. http://hdl.handle.net/1842/19334.

Full text
APA, Harvard, Vancouver, ISO, and other styles
2

Sadeghi, Kayvan. "Graphical representation of independence structures." Thesis, University of Oxford, 2012. http://ora.ox.ac.uk/objects/uuid:86ff6155-a6b9-48f9-9dac-1ab791748072.

Full text
Abstract:
In this thesis we describe subclasses of a class of graphs with three types of edges, called loopless mixed graphs (LMGs). The class of LMGs contains almost all known classes of graphs used in the literature of graphical Markov models. We focus in particular on the subclass of ribbonless graphs (RGs), which as special cases include undirected graphs, bidirected graphs, and directed acyclic graphs, as well as ancestral graphs and summary graphs. We define a unifying interpretation of independence structure for LMGs and pairwise and global Markov properties for RGs, discuss their maximality, and, in particular, prove the equivalence of pairwise and global Markov properties for graphoids defined over the nodes of RGs. Three subclasses of LMGs (MC, summary, and ancestral graphs) capture the modified independence model after marginalisation over unobserved variables and conditioning on selection variables of variables satisfying independence restrictions represented by a directed acyclic graph (DAG). We derive algorithms to generate these graphs from a given DAG or from a graph of a specific subclass, and we study the relationships between these classes of graphs. Finally, a manual and codes are provided that explain methods and functions in R for implementing and generating various graphs studied in this thesis.
APA, Harvard, Vancouver, ISO, and other styles
3

Rodriguez, Villamizar Gustavo Enrique. "A Graphical Representation of Exposed Parallelism." BYU ScholarsArchive, 2017. https://scholarsarchive.byu.edu/etd/6467.

Full text
Abstract:
Modern-day microprocessors are measured in part by their parallel performance. Parallelizing sequential programs is a complex task, requiring data dependence analysis of the program constructs. Researchers in the field of parallel optimization are working on shifting the optimization effort from the programmer to the compiler. The goal of this work is for the compiler to visually expose the parallel characteristics of the program to researchers as well as programmers for a better understanding of the parallel properties of their programs. In order to do that we developed Exposed Parallelism Visualization (EPV), a statically-generated graphical tool that builds a parallel task graph of source code after it has been converted to the LLVM compiler frameworkq s Intermediate Representation (IR). The goal is for this visual representation of IR to provide new insights about the parallel properties of the program without having to execute the program. This will help researchers and programmers to understand if and where parallelism exists in the program at compile time. With this understanding, researchers will be able to more easily develop compiler algorithms that identify parallelism and improve program performance, and programmers will easily identify parallelizable sections of code that can be executed in multiple cores or accelerators such as GPUs or FPGAs. To the best of our knowledge, EPV is the first static visualization tool made for the identification of parallelism.
APA, Harvard, Vancouver, ISO, and other styles
4

Burnette, David G. "A graphical representation for VHDL models." Thesis, Virginia Tech, 1988. http://hdl.handle.net/10919/43381.

Full text
Abstract:
This paper describes a graphical representation technique for models in VHDL. The graphical representation is an extension of the Process Model Graph described in [1]. The Process Model Graph has representations for concurrent processes and signals. The representation described here, referred to as the Modified Process Model Graph, adds several new constructs to handle more features of VHDL. These new constructs include: variables inside process blocks, a visual notation for sensitivity lists, and a clear visual indication of the interface to an object. A software tool, called VHDLCad* (c)* * , has been developed that uses produces VHDL source code interactively from the graphical representation. The tool allows the user to use pre-defined modules, or create new modules and place them in the library. With the benefit of a graphical representation, a menu-driven system and re-usable code, VHDLCad can improve the productivity of VHDL modelers. *VHDLCad is a trademark of David G. Burnette. **Copyright 1988 by David G. Burnette. All rights reserved
Master of Science
APA, Harvard, Vancouver, ISO, and other styles
5

Cottee, Michaela J. "The graphical representation of structured multivariate data." Thesis, Open University, 1996. http://oro.open.ac.uk/57616/.

Full text
Abstract:
During the past two decades or so, graphical representations have been used increasingly for the examination, summarisation and communication of statistical data. Many graphical techniques exist for exploratory data analysis (ie. for deciding which model it is appropriate to fit to the data) and a number of graphical diagnostic techniques exist for checking the appropriateness of a fitted model. However, very few techniques exist for the representation of the fitted model itself. This thesis is concerned with the development of some new and existing graphical representation techniques for the communication and interpretation of fitted statistical models. The first part of this thesis takes the form of a general overview of the use in statistics of graphical representations for exploratory data analysis and diagnostic model checking. In relation to the concern of this thesis, particular consideration is given to the few graphical techniques which already exist for the representation of fitted models. A number of novel two-dimensional approaches are then proposed which go partway towards providing a graphical representation of the main effects and interaction terms for fitted models. This leads on to a description of conditional independence graphs, and consideration of the suitability of conditional independence graphs as a technique for the representation of fitted models. Conditional independence graphs are then developed further in accordance with the research aims. Since it becomes apparent that it is not possible to use any of the approaches taken m order to develop a simple two-dimensional pen-and-paper technique for the unambiguous graphical representation of all fitted statistical models, an interactive computer package based on the conditional independence graph approach is developed for the construction, communication and interpretation of graphical representations for fitted statistical models. This package, called the "Conditional Independence Graph Enhancer" (CIGE), does provide unambiguous graphical representations for all fitted statistical models considered.
APA, Harvard, Vancouver, ISO, and other styles
6

Flanagin, Maik (Maik Carsten) 1977. "Visualization of Usenet newsgroups throught graphical representation." Thesis, Massachusetts Institute of Technology, 2000. http://hdl.handle.net/1721.1/86609.

Full text
Abstract:
Thesis (M.Eng. and S.B.)--Massachusetts Institute of Technology, Dept. of Electrical Engineering and Computer Science, 2000.
Includes bibliographical references (leaf 43).
by Maik Flanagin.
M.Eng.and S.B.
APA, Harvard, Vancouver, ISO, and other styles
7

Gouider, Héla. "Graphical preference representation under a possibilistic framework." Thesis, Toulouse 3, 2017. http://www.theses.fr/2017TOU30243/document.

Full text
Abstract:
La modélisation structurée de préférences, fondée sur les notions d'indépendance préférentielle, a un potentiel énorme pour fournir des approches efficaces pour la représentation et le raisonnement sur les préférences des décideurs dans les applications de la vie réelle. Cette thèse soulève la question de la représentation des préférences par une structure graphique. Nous proposons une nouvelle lecture de réseaux possibilistes, que nous appelons p-pref nets, où les degrés de possibilité représentent des degrés de satisfaction. L'approche utilise des poids de possibilité non instanciés (appelés poids symboliques), pour définir les tables de préférences conditionnelles. Ces tables donnent naissance à des vecteurs de poids symboliques qui codent les préférences qui sont satisfaites et celles qui sont violées dans un contexte donné. Nous nous concentrons ensuite sur les aspects théoriques de la manipulation de ces vecteurs. En effet, la comparaison de ces vecteurs peut s'appuyer sur différentes méthodes: celles induites par la règle de chaînage basée sur le produit ou celle basée sur le minimum que sous-tend le réseau possibiliste, les raffinements du minimum le discrimin, ou leximin, ainsi que l'ordre Pareto, et le Pareto symétrique qui le raffine. Nous prouvons que la comparaison par produit correspond exactement au celle du Pareto symétrique et nous nous concentrons sur les avantages de ce dernier par rapport aux autres méthodes. En outre, nous montrons que l'ordre du produit est consistant avec celui obtenu en comparant des ensembles de préférences satisfaites des tables. L'image est complétée par la proposition des algorithmes d'optimisation et de dominance pour les p-pref nets. Dans ce travail, nous discutons divers outils graphiques pour la représentation des préférences. Nous nous focalisons en particulier sur les CP-nets car ils partagent la même structure graphique que les p-pref nets et sont basés sur la même nature de préférences. Nous prouvons que les ordres induits par les CP-nets ne peuvent pas contredire ceux des p-pref nets et nous avons fixé les contraintes nécessaires pour raffiner les ordres des p-pref nets afin de capturer les contraintes Ceteris Paribus des CP-nets. Cela indique que les CP-nets représentent potentiellement une sous-classe des p-pref nets avec des contraintes. Ensuite, nous fournissons une comparaison approfondie entre les différents modèles graphiques qualitatifs et quantitatifs, et les p-pref nets. Nous en déduisons que ces derniers peuvent être placés à mi- chemin entre les modèles qualitatifs et les modèles quantitatifs puisqu'ils ne nécessitent pas une instanciation complète des poids symboliques alors que des informations supplémentaires sur l'importance des poids peuvent être prises en compte. La dernière partie de ce travail est consacrée à l'extension du modèle proposé pour représenter les préférences de plusieurs agents. Dans un premier temps, nous proposons l'utilisation de réseaux possibilistes où les préférences sont de type tout ou rien et nous définissons le conditionnement dans le cas de distributions booléennes. Nous montrons par ailleurs que ces réseaux multi-agents ont une contrepartie logique utile pour vérifier la cohérence des agents. Nous expliquons les étapes principales pour transformer ces réseaux en format logique. Enfin, nous décrivons une extension pour représenter des préférences nuancées et fournissons des algorithmes pour les requêtes d'optimisation et de dominance
Structured modeling of preference statements, grounded in the notions of preferential independence, has tremendous potential to provide efficient approaches for modeling and reasoning about decision maker preferences in real-life applications. This thesis raises the question of representing preferences through a graphical structure. We propose a new reading of possibilistic networks, that we call p-pref nets, where possibility weights represent satisfaction degrees. The approach uses non-instantiated possibility weights, which we call symbolic weights, to define conditional preference tables. These conditional preference tables give birth to vectors of symbolic weights that reflect the preferences that are satisfied and those that are violated in a considered situation. We then focus on the theoretical aspects of handling of these vectors. Indeed, the comparison of such vectors may rely on different orderings: the ones induced by the product-based, or the minimum based chain rule underlying the possibilistic network, the discrimin, or leximin refinements of the minimum- based ordering, as well as Pareto ordering, and the symmetric Pareto ordering that refines it. We prove that the product-based comparison corresponds exactly to symmetric Pareto and we focus on its assets compared to the other ordering methods. Besides, we show that productbased ordering is consistent with the ordering obtained by comparing sets of satisfied preference tables. The picture is then completed by the proposition of algorithms for handling optimization and dominance queries. In this work we discuss various graphical tools for preference representation. We shed light particularly on CP-nets since they share the same graphical structure as p-pref nets and are based on the same preference statements. We prove that the CP-net orderings cannot contradict those of the p-pref nets and we found suitable additional constraints to refine p-pref net orderings in order to capture Ceteris Paribus constraints of CP-nets. This indicates that CP-nets potentially represent a subclass of p-pref nets with constraints. Finally, we provide an thorough comparison between the different qualitative and quantitative graphical models and p-pref nets. We deduce that the latter can be positioned halfway between qualitative and quantitative models since they do not need a full instantiation of the symbolic weights while additional information about the relative strengths of these weights can be taken into account. The last part of this work is dedicated to extent the proposed model to represent multiple agents preferences. As a first step, we propose the use of possibilistic networks for representing all or nothing multiple agents preferences and define conditioning in the case of Boolean possibilities. These multiple agents networks have a logical counterpart helpful for checking agents consistency. We explain the main steps for transforming multiple agents networks into logical format. Finally, we outline an extension with priority levels of these networks and provide algorithms for handling optimization and dominance queries
APA, Harvard, Vancouver, ISO, and other styles
8

Heijltjes, Willem Bernard. "Graphical representation of canonical proof : two case studies." Thesis, University of Edinburgh, 2012. http://hdl.handle.net/1842/5838.

Full text
Abstract:
An interesting problem in proof theory is to find representations of proof that do not distinguish between proofs that are ‘morally’ the same. For many logics, the presentation of proofs in a traditional formalism, such as Gentzen’s sequent calculus, introduces artificial syntactic structure called ‘bureaucracy’; e.g., an arbitrary ordering of freely permutable inferences. A proof system that is free of bureaucracy is called canonical for a logic. In this dissertation two canonical proof systems are presented, for two logics: a notion of proof nets for additive linear logic with units, and ‘classical proof forests’, a graphical formalism for first-order classical logic. Additive linear logic (or sum–product logic) is the fragment of linear logic consisting of linear implication between formulae constructed only from atomic formulae and the additive connectives and units. Up to an equational theory over proofs, the logic describes categories in which finite products and coproducts occur freely. A notion of proof nets for additive linear logic is presented, providing canonical graphical representations of the categorical morphisms and constituting a tractable decision procedure for this equational theory. From existing proof nets for additive linear logic without units by Hughes and Van Glabbeek (modified to include the units naively), canonical proof nets are obtained by a simple graph rewriting algorithm called saturation. Main technical contributions are the substantial correctness proof of the saturation algorithm, and a correctness criterion for saturated nets. Classical proof forests are a canonical, graphical proof formalism for first-order classical logic. Related to Herbrand’s Theorem and backtracking games in the style of Coquand, the forests assign witnessing information to quantifiers in a structurally minimal way, reducing a first-order sentence to a decidable propositional one. A similar formalism ‘expansion tree proofs’ was presented by Miller, but not given a method of composition. The present treatment adds a notion of cut, and investigates the possibility of composing forests via cut-elimination. Cut-reduction steps take the form of a rewrite relation that arises from the structure of the forests in a natural way. Yet reductions are intricate, and initially not well-behaved: from perfectly ordinary cuts, reduction may reach unnaturally configured cuts that may not be reduced. Cutelimination is shown using a modified version of the rewrite relation, inspired by the game-theoretic interpretation of the forests, for which weak normalisation is shown, and strong normalisation is conjectured. In addition, by a more intricate argument, weak normalisation is also shown for the original reduction relation.
APA, Harvard, Vancouver, ISO, and other styles
9

Hays, Benjamin James. "A Graphical Representation Framework for Enhanced Visualization of Construction Control Processes." Thesis, Virginia Tech, 2002. http://hdl.handle.net/10919/35298.

Full text
Abstract:
Graphical representation for construction control information--processes such as scheduling, budgeting and RFIs--follows no formalized method. Many graphics neglect relevant information necessary to highlight trends in or relationships between processes. The principles of data graphics offer visual capabilities beyond those currently employed by the construction industry to display appropriate information in a manner that enhances comprehension of control processes. This paper describes a method that incorporates four tasks; those of structuring and filtering data, editing for density and communicating efficiently; as necessary to creating effective data graphics. In addition to an evaluation technique, these tasks are outlined in a coherent framework. Several construction control processes are then described with respect to these four tasks. Focused application of the framework to the budgeting process produces four graphics that are subsequently evaluated by industry professionals. Conclusions detailed at the end of this document draw together lessons learned from the process of creating data graphics as well as from quantitative and qualitative evaluations of the visual cost report.
Master of Science
APA, Harvard, Vancouver, ISO, and other styles
10

Zhang, Zongxiang. "Using graphical representation of user interfaces as visual references." Thesis, Massachusetts Institute of Technology, 2012. http://hdl.handle.net/1721.1/75630.

Full text
Abstract:
Thesis (Ph. D.)--Massachusetts Institute of Technology, Dept. of Electrical Engineering and Computer Science, 2012.
Cataloged from PDF version of thesis.
Includes bibliographical references (p. 129-133).
My thesis investigates using a graphical representation of user interfaces - screenshots - as a direct visual reference to support various kinds of applications. We have built several systems to demonstrate and validate this idea in domains like searching documentation, GUI automation and testing, and cross-device information migration. In particular, Sikuli Search enables users to search documentation using screenshots of GUI elements instead of keywords. Sikuli Script enables users to programmatically control GUIs without support from the underlying applications. Sikuli Test lets GUI developers and testers create test scripts without coding. Deep Shot introduces a framework and interaction techniques to migrate work states across heterogeneous devices in one action, taking a picture. We also discuss challenges inherent in screenshot-based interactions and propose potential solutions and directions of future research.
by Tsung-Hsiang Chang.
Ph.D.
APA, Harvard, Vancouver, ISO, and other styles
More sources

Books on the topic "Graphical representation"

1

Roach, Victor D. Guides to methods of graphical representation. Port of Spain: The Office, 1987.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
2

Duch, W. GRMS or Graphical Representation of Model Spaces. Berlin, Heidelberg: Springer Berlin Heidelberg, 1986. http://dx.doi.org/10.1007/978-3-642-93347-9.

Full text
APA, Harvard, Vancouver, ISO, and other styles
3

GRMS, or, Graphical representation of model spaces. Berlin: Springer-Verlag, 1986.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
4

Demiroz, Ahu. A study of graphical representation of knitted structures. Manchester: UMIST, 1998.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
5

Pruvost, Norman L. The Hansen-Roach cross sections: A graphical representation. Los Alamos, N.M: Los Alamos National Laboratory, 1988.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
6

Pruvost, Norman L. The Hansen-Roach cross sections: A graphical representation. Los Alamos, N.M: Los Alamos National Laboratory, 1988.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
7

Pruvost, Norman L. The Hansen-Roach cross sections: A graphical representation. Los Alamos, N.M: Los Alamos National Laboratory, 1988.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
8

Korneev, Viktor, Larisa Gagarina, and Mariya Korneeva. Visualization in scientific research. ru: INFRA-M Academic Publishing LLC., 2021. http://dx.doi.org/10.12737/1029660.

Full text
Abstract:
The textbook describes the methods of graphical representation of the results of the calculation of physical and engineering problems, represented by specialized programs and operating system tools. The graphic capabilities of the MATLAB package, which, along with powerful calculation tools, has excellent computer graphics, are studied in detail. A number of visualization tasks are solved by computer graphics programming methods in C++. The GDI GUI functions are used from the set of system API functions that the Windows operating system provides to the user. All examples in C++ are tested in the Visual Studio 2008 project development environment. The issues of interaction between the MATLAB package and programs written in C++ in the Visual Studio environment are considered. Meets the requirements of the federal state educational standards of higher education of the latest generation. For students studying in the field of training "Software Engineering".
APA, Harvard, Vancouver, ISO, and other styles
9

Visualizing time: Designing graphical representations for statistical data. New York: Springer, 2012.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
10

Pattanayak, P. M. A graphic representation of Vedanta sara. New Delhi: Harman Pub. House, 1987.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
More sources

Book chapters on the topic "Graphical representation"

1

Speights, David B., Daniel M. Downs, and Adi Raz. "Graphical Representation." In Essentials of Modeling and Analytics, 89–115. New York, NY : Routledge, 2017.: Routledge, 2017. http://dx.doi.org/10.1201/9781315158266-5.

Full text
APA, Harvard, Vancouver, ISO, and other styles
2

Di Lorenzo, Renato. "Graphical Representation." In Perspectives in Business Culture, 3–32. Milano: Springer Milan, 2013. http://dx.doi.org/10.1007/978-88-470-5421-9_1.

Full text
APA, Harvard, Vancouver, ISO, and other styles
3

Duch, W. "Introducing graphical representation." In Lecture Notes in Chemistry, 11–13. Berlin, Heidelberg: Springer Berlin Heidelberg, 1986. http://dx.doi.org/10.1007/978-3-642-93347-9_3.

Full text
APA, Harvard, Vancouver, ISO, and other styles
4

Port, Stanley. "Components: Graphical Representation." In The Management of CAD for Construction, 145–56. Boston, MA: Springer US, 1989. http://dx.doi.org/10.1007/978-1-4684-6605-8_9.

Full text
APA, Harvard, Vancouver, ISO, and other styles
5

Taylor, Sonia. "Graphical representation of data." In Business Statistics for non-mathematicians, 11–34. London: Macmillan Education UK, 2007. http://dx.doi.org/10.1057/978-0-230-20685-4_2.

Full text
APA, Harvard, Vancouver, ISO, and other styles
6

Sucar, Luis Enrique. "Bayesian Networks: Representation and Inference." In Probabilistic Graphical Models, 101–36. London: Springer London, 2015. http://dx.doi.org/10.1007/978-1-4471-6699-3_7.

Full text
APA, Harvard, Vancouver, ISO, and other styles
7

Sucar, Luis Enrique. "Bayesian Networks: Representation and Inference." In Probabilistic Graphical Models, 111–51. Cham: Springer International Publishing, 2020. http://dx.doi.org/10.1007/978-3-030-61943-5_7.

Full text
APA, Harvard, Vancouver, ISO, and other styles
8

Umata, Ichiro, Yasuhiro Katagiri, and Atsushi Shimojima. "Movement Conceptualizations in Graphical Communication." In Diagrammatic Representation and Inference, 3–17. Berlin, Heidelberg: Springer Berlin Heidelberg, 2002. http://dx.doi.org/10.1007/3-540-46037-3_2.

Full text
APA, Harvard, Vancouver, ISO, and other styles
9

Feeney, Aidan, John Adams, Lara Webber, and Michael Ewbank. "Individual Differences in Graphical Reasoning." In Diagrammatic Representation and Inference, 271–85. Berlin, Heidelberg: Springer Berlin Heidelberg, 2004. http://dx.doi.org/10.1007/978-3-540-25931-2_27.

Full text
APA, Harvard, Vancouver, ISO, and other styles
10

Um, Dugan. "Graphical Representation for Mechanical Design." In Solid Modeling and Applications, 17–49. Cham: Springer International Publishing, 2016. http://dx.doi.org/10.1007/978-3-319-21822-9_2.

Full text
APA, Harvard, Vancouver, ISO, and other styles

Conference papers on the topic "Graphical representation"

1

Harth, Andreas, Sebastian Ryszard Kruk, and Stefan Decker. "Graphical representation of RDF queries." In the 15th international conference. New York, New York, USA: ACM Press, 2006. http://dx.doi.org/10.1145/1135777.1135914.

Full text
APA, Harvard, Vancouver, ISO, and other styles
2

Arniker, Swarna Bai, and Hon Keung Kwan. "Graphical representation of DNA sequences." In 2009 IEEE International Conference on Electro/Information Technology (eit '09). IEEE, 2009. http://dx.doi.org/10.1109/eit.2009.5189633.

Full text
APA, Harvard, Vancouver, ISO, and other styles
3

Fossoh, Karl Kevin Tiba, and Dan Lo. "Graphical Representation of Text Semantics." In ACM SE '20: 2020 ACM Southeast Conference. New York, NY, USA: ACM, 2020. http://dx.doi.org/10.1145/3374135.3385326.

Full text
APA, Harvard, Vancouver, ISO, and other styles
4

Prejmerean, Vasile, Militon Frentiu, Vasile Cioban, and Ovidiu Ghiran. "Graphical Representation of the Pandemic Spreading." In 2008 First International Conference on Complexity and Intelligence of the Artificial and Natural Complex Systems. Medical Applications of the Complex Systems. Biomedical Computing (CANS). IEEE, 2008. http://dx.doi.org/10.1109/cans.2008.30.

Full text
APA, Harvard, Vancouver, ISO, and other styles
5

Stone, Janice M. "A graphical representation of concurrent processes." In the 1988 ACM SIGPLAN and SIGOPS workshop. New York, New York, USA: ACM Press, 1988. http://dx.doi.org/10.1145/68210.69237.

Full text
APA, Harvard, Vancouver, ISO, and other styles
6

Kanmani, B. "Program educational objectives: A graphical representation." In 2014 International Conference on Interactive Collaborative Learning (ICL). IEEE, 2014. http://dx.doi.org/10.1109/icl.2014.7017844.

Full text
APA, Harvard, Vancouver, ISO, and other styles
7

Zhu, Mingrui, Nannan Wang, Xinbo Gao, and Jie Li. "Deep Graphical Feature Learning for Face Sketch Synthesis." In Twenty-Sixth International Joint Conference on Artificial Intelligence. California: International Joint Conferences on Artificial Intelligence Organization, 2017. http://dx.doi.org/10.24963/ijcai.2017/500.

Full text
Abstract:
The exemplar-based face sketch synthesis method generally contains two steps: neighbor selection and reconstruction weight representation. Pixel intensities are widely used as features by most of the existing exemplar-based methods, which lacks of representation ability and robustness to light variations and clutter backgrounds. We present a novel face sketch synthesis method combining generative exemplar-based method and discriminatively trained deep convolutional neural networks (dCNNs) via a deep graphical feature learning framework. Our method works in both two steps by using deep discriminative representations derived from dCNNs. Instead of using it directly, we boost its representation capability by a deep graphical feature learning framework. Finally, the optimal weights of deep representations and optimal reconstruction weights for face sketch synthesis can be obtained simultaneously. With the optimal reconstruction weights, we can synthesize high quality sketches which is robust against light variations and clutter backgrounds. Extensive experiments on public face sketch databases show that our method outperforms state-of-the-art methods, in terms of both synthesis quality and recognition ability.
APA, Harvard, Vancouver, ISO, and other styles
8

Reed, N. E., Yanhan Nie, and C. B. Mahnke. "A portable graphical representation tool for phonocardiograms." In 2009 Annual International Conference of the IEEE Engineering in Medicine and Biology Society. IEEE, 2009. http://dx.doi.org/10.1109/iembs.2009.5332544.

Full text
APA, Harvard, Vancouver, ISO, and other styles
9

Brophy, K., and M. D. Maggio. "A framework for multiple, concurrent graphical representation." In [1989] Proceedings of the Twenty-Second Annual Hawaii International Conference on System Sciences. Volume IV: Emerging Technologies and Applications Track. IEEE, 1989. http://dx.doi.org/10.1109/hicss.1989.48160.

Full text
APA, Harvard, Vancouver, ISO, and other styles
10

Linos, Panagiotis K. "Automatic layout for graphical representation of programs." In the 1988 ACM sixteenth annual conference. New York, New York, USA: ACM Press, 1988. http://dx.doi.org/10.1145/322609.323159.

Full text
APA, Harvard, Vancouver, ISO, and other styles

Reports on the topic "Graphical representation"

1

Eder, E., and C. Harrison. A Graphical Representation of Temporal Data from Simulations. Office of Scientific and Technical Information (OSTI), October 2005. http://dx.doi.org/10.2172/885393.

Full text
APA, Harvard, Vancouver, ISO, and other styles
2

Gosselin, Mark S., R. B. Taylor, and Kenneth R. Craig. Representation of Hydrodynamic Model Results through Graphical Displays. Fort Belvoir, VA: Defense Technical Information Center, September 2000. http://dx.doi.org/10.21236/ad1003878.

Full text
APA, Harvard, Vancouver, ISO, and other styles
3

Andryushina, T. V., O. B. Bolbat, and O. Yu Khekalo. Graphical representation of algorithms in the presentation: Electronic tutorial. OFERNIO, June 2020. http://dx.doi.org/10.12731/ofernio.2020.24534.

Full text
APA, Harvard, Vancouver, ISO, and other styles
4

Smith, Jijo K., Howell Li, and Darcy M. Bullock. Populating SAE J2735 Message Confidence Values for Traffic Signal Transitions Along a Signalized Corridor. Purdue University, 2019. http://dx.doi.org/10.5703/1288284317322.

Full text
Abstract:
The communication between connected vehicles and traffic signal controllers is defined in SAE Surface Vehicle Standard J2735. SAE J2735 defines traffic signal status messages and a series of 16 confidence levels for traffic signal transitions. This paper discusses a statistical method for tabulating traffic signal data by phase and time of day and populating the SAE J2735 messages. Graphical representation of the red-green and green-yellow transitions are presented from six intersections along a 4-mile corridor for five different time of day timing plans. The case study provided illustrates the importance of characterizing the stochastic variation of traffic signals to understand locations, phases, and time of day when traffic indications operate with high predictability, and periods when there are large variations in traffic signal change times. Specific cases, such as low vehicle demand and occasional actuation of pedestrian phases are highlighted as situations that may reduce the predictability of traffic signal change intervals. The results from this study also opens up discussion among transportation professionals on the importance of consistent tabulation of confidence values for both beginning and end of green signal states. We believe this paper will initiate dialog on how to consistently tabulate important data elements transmitted in SAE J2735 and perhaps refine those definitions. The paper concludes by highlighting the importance of traffic engineers and connected vehicle developers to work together to develop shared visions on traffic signal change characteristics so that the in-vehicle use cases and human-machine interface (HMI) meet user expectations.
APA, Harvard, Vancouver, ISO, and other styles
5

Nguyen, Binh Q. The ARL RaprEdt Tool -- A Graphical Editor for Creating Real-Time Application Representative (RAPR) Files. Fort Belvoir, VA: Defense Technical Information Center, September 2008. http://dx.doi.org/10.21236/ada487293.

Full text
APA, Harvard, Vancouver, ISO, and other styles
6

Nalla, Vineetha, and Nihal Ranjit. Afterwards: Graphic Narratives of Disaster Risk and Recovery from India. Indian Institute for Human Settlements, 2022. http://dx.doi.org/10.24943/9788195648559.

Full text
Abstract:
Afterwards is an anthology of visual narratives of disaster impacts and the process of recovery that follows. These stories were drawn from the testimonies of disaster-affected individuals, households, and communities documented between 2018-19 from the Indian states of Odisha, Tamil Nadu, and Kerala. They communicate challenges related to housing resettlement, loss of livelihoods, gender-based exclusion among others. At the heart of this anthology lies the idea of ‘representation’: how are those affected portrayed by the media, state actors, official documents; how are their needs represented and how do these portrayals impact the lives of those at risk and shape their recovery? Graphically illustrating these themes provides a platform to relay personal experiences of disaster risk and recovery.
APA, Harvard, Vancouver, ISO, and other styles
7

Arely Donis, C., and TG Martín Casado. Representation of the Other in social advertising: Analysis of the graphic advertising of NGDOs in social networks. Revista Latina de Comunicación Social, March 2017. http://dx.doi.org/10.4185/rlcs-2017-1172en.

Full text
APA, Harvard, Vancouver, ISO, and other styles
8

Temple, D. J., R. Ball, P. K. Weathersby, E. C. Parker, and S. S. Survanshi. The Dive Profiles and Manifestations of Decompression Sickness Cases After Air and Nitrogen-Oxygen Dives. Volume 2. Complete Profiles and Graphic Representations for DCS Events. Fort Belvoir, VA: Defense Technical Information Center, May 1999. http://dx.doi.org/10.21236/ada452742.

Full text
APA, Harvard, Vancouver, ISO, and other styles
9

VandenBerg, R. D., P. B. Kabanov, K E Dewing, and E. A. Atkinson. Geological and geochemical data from the Canadian Arctic Islands, part XVIII: XRF and TOC data, and formation tops in exploration wells from the Devonian clastic wedge and underlying strata, Northwest Territories and Nunavut. Natural Resources Canada/CMSS/Information Management, 2022. http://dx.doi.org/10.4095/329642.

Full text
Abstract:
This collection of data comprises new XRF data, TOC data, and a new table of formation tops for the lower portion of the Devonian clastic wedge (Weatherall, Cape de Bray and Blackley formations sensu Embry and Klovan, 1976) and the underlying basinal and carbonate-platform strata of variable Ordovician to Lower-Middle Devonian age. Main results include ED-XRF data for 15 well sections within the N.W.T. jurisdiction of the SW Arctic Archipelago. These XRF data were obtained in 2018- 2020 through non-destructive measurements of drillhole cutting samples using a Bruker Tracer IV instrument. Testing of these samples has been restricted to preserve them for future study as they are irreplaceable. The goal of using the non destructives XFR has given us a methodology that does not harm these samples. We find this to be a reasonable method when data is required but no destructive testing is permitted, such as in these legacy wells. Reading acquisition procedure and instrument calibrations are discussed herein. These XRF logs cover cumulatively 12,538 m of well sections, which is the best attainable physical coverage for these strata in the absence of representative cores. For each section surveyed with XRF, we provide graphical striplogs with geophysical logs, descriptive lithology, XRF elemental logs, biostratigraphic data, and, selectively, synthetic seismograms and TOC data. Scientific discussion based on these results is a subject of a separate paper-in-preparation, (Kabanov, P. 2020.)
APA, Harvard, Vancouver, ISO, and other styles
We offer discounts on all premium plans for authors whose works are included in thematic literature selections. Contact us to get a unique promo code!

To the bibliography