Log in

Relevant bibliographies by topics / Graphic methods / Dissertations / Theses

To see the other types of publications on this topic, follow the link: Graphic methods.

Dissertations / Theses on the topic 'Graphic methods'

Author: Grafiati

Published: 4 June 2021

Last updated: 25 July 2025

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

Select a source type:

Consult the top 50 dissertations / theses for your research on the topic 'Graphic methods.'

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

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

Browse dissertations / theses on a wide variety of disciplines and organise your bibliography correctly.

1

Khouzam, Nelly. "A new class of brittle graphs /." Thesis, McGill University, 1986. http://digitool.Library.McGill.CA:80/R/?func=dbin-jump-full&object_id=66048.

Full text

APA, Harvard, Vancouver, ISO, and other styles

2

Eiser, Leslie Agrin. "Microcomputer graphics to teach high school physics." Thesis, McGill University, 1985. http://digitool.Library.McGill.CA:80/R/?func=dbin-jump-full&object_id=66055.

Full text

APA, Harvard, Vancouver, ISO, and other styles

3

Li, Lizhi. "Graphic Network based Methods in Discovering TFBS Motifs." The Ohio State University, 2012. http://rave.ohiolink.edu/etdc/view?acc_num=osu1325276730.

Full text

APA, Harvard, Vancouver, ISO, and other styles

4

Sehgal, Nidhi Rodger C. A. "4-cycles systems of line graphs of complete multipartite graphs." Auburn, Ala, 2008. http://repo.lib.auburn.edu/EtdRoot/2008/SUMMER/Mathematics_and_Statistics/Thesis/Sehgal_Nidhi_47.pdf.

Full text

APA, Harvard, Vancouver, ISO, and other styles

5

Luo, Xueyi. "A tool for computer verification of properties of certain classes of visibility graphs." Virtual Press, 1994. http://liblink.bsu.edu/uhtbin/catkey/897510.

Full text

Abstract:

Segment endpoint visibility graph is a representation scheme for art gallery problems, guard problems, and other shortest path or shortest circuit problems. In the research of visibility graphs, drawing graphs is a time-consuming task. VGE (Visibility Graphs Editor) is developed for visibility graphs reseacheres to create and modify graphs interactively in X-window environment. Appropriate graphics user interface allows the researcher to edit a graph, save and open a file, and make a hard copy of a graph. VGE is developed in C under X-window environment and using EZD[3] graphics tool. The thes

APA, Harvard, Vancouver, ISO, and other styles

6

Nieuwoudt, Isabelle. "On the maximum degree chromatic number of a graph." Thesis, Stellenbosch : Stellenbosch University, 2007. http://hdl.handle.net/10019.1/46214.

Full text

Abstract:

ENGLISH ABSTRACT: Determining the (classical) chromatic number of a graph (i.e. finding the smallest number of colours with which the vertices of a graph may be coloured so that no two adjacent vertices receive the same colour) is a well known combinatorial optimization problem and is widely encountered in scheduling problems. Since the late 1960s the notion of the chromatic number has been generalized in several ways by relaxing the restriction of independence of the colour classes.<br>AFRIKAANSE OPSOMMING: Die bepaling van die (klassieke) chromatiese getal van ’n grafiek (naamlik die k

APA, Harvard, Vancouver, ISO, and other styles

7

Kalk, Jonathan W. "Sparse ordinary graphs." Thesis, University of Hawaii at Manoa, 2005. http://hdl.handle.net/10125/25937.

Full text

Abstract:

Ordinary graphs are directed graphs that can be viewed as generalizations of symmetric block designs. They were introduced by Fossorier, Jezek, Nation and Pogel in [2] in an attempt to construct new finite projective planes. In this thesis we investigate some special cases of ordinary graphs, most prominently the case where nonadjacent vertices have no common neighbors. We determine all connected graphs of this type that exist.<br>vii, 65 leaves, bound ; 29 cm.<br>Thesis (Ph. D.)--University of Hawaii at Manoa, 2005.

APA, Harvard, Vancouver, ISO, and other styles

8

Muller, John H. "Local structure in graph classes." Diss., Georgia Institute of Technology, 1987. http://hdl.handle.net/1853/8224.

Full text

APA, Harvard, Vancouver, ISO, and other styles

9

Dey, Sanjoy. "Structural properties of visibility and weak visibility graphs." Virtual Press, 1997. http://liblink.bsu.edu/uhtbin/catkey/1048394.

Full text

Abstract:

Given a finite set S of n nonintersecting line segments with no three end points collinear, the segment end point visibility graph is defined as the graph whose vertices are the end points of the line segments in S and two vertices are adjacent if the straight line segment joining two end points does not intersect any element of S, or if they are end points of the same segment. Segment end point visibility graphs have a wide variety of applications in VLSI circuit design, study of art gallery problems, and other areas of computational geometry. This thesis contains a survey of the important re

APA, Harvard, Vancouver, ISO, and other styles

10

Dibble, Emily. "The interpretation of graphs and tables /." Thesis, Connect to this title online; UW restricted, 1997. http://hdl.handle.net/1773/9101.

Full text

APA, Harvard, Vancouver, ISO, and other styles

11

Noye, Janet B. (Janet Barbara) Carleton University Dissertation Computer Science. "A graphical user interface server for graph algorithm programs." Ottawa, 1992.

Find full text

APA, Harvard, Vancouver, ISO, and other styles

12

McOsker, Megan. "Student Understanding of Error and Variability in Primary Science Communication." Fogler Library, University of Maine, 2009. http://www.library.umaine.edu/theses/pdf/McOskerM2009.pdf.

Full text

APA, Harvard, Vancouver, ISO, and other styles

13

Huang, Xiaodi, and xhuang@turing une edu au. "Filtering, clustering and dynamic layout for graph visualization." Swinburne University of Technology, 2004. http://adt.lib.swin.edu.au./public/adt-VSWT20050428.111554.

Full text

Abstract:

Graph visualization plays an increasingly important role in software engineering and information systems. Examples include UML, E-R diagrams, database structures, visual programming, web visualization, network protocols, molecular structures, genome diagrams, and social structures. Many classical algorithms for graph visualization have already been developed over the past decades. However, these algorithms face difficulties in practice, such as the overlapping nodes, large graph layout, and dynamic graph layout. In order to solve these problems, this research aims to systematically address bot

APA, Harvard, Vancouver, ISO, and other styles

14

Laranjo, Francisco Miguel. "Design as criticism : methods for a critical graphic design practice." Thesis, University of the Arts London, 2017. http://ualresearchonline.arts.ac.uk/12027/.

Full text

Abstract:

This practice-led research is the result of an interest in graphic design as a specific critical activity. Existing in the context of the 2008 financial and subsequent political crisis, both this thesis and my work are situated in an expaded field of graphic design. This research examines the emergence of the terms critical design and critical practice,and aims to develop methods that use criticism during the design process from a practitioner’s perspective. Central aims of this research are to address a gap in design discourse in relation to this terminology and impact designers operating und

APA, Harvard, Vancouver, ISO, and other styles

15

Thomson, Jan McDonald. "Cyclically 5-connected graphs : their relevance to Tutte's 4-flow conjecture." Diss., Georgia Institute of Technology, 2000. http://hdl.handle.net/1853/28963.

Full text

APA, Harvard, Vancouver, ISO, and other styles

16

Vasquez, Maria Rosario. "An investigation of super line graphs of hypercubes." Virtual Press, 1993. http://liblink.bsu.edu/uhtbin/catkey/865951.

Full text

Abstract:

Graphs, as mathematical objects, play a dominant role in the study of network modeling, VLSI design, data structures, parallel computation, process scheduling and in a variety of other areas of computer science. Hypercubes are one of the preferred architectures for parallel computation, and a study of some properties of the hypercubes motivated this thesis.The concept of super line graphs, introduced by Bagga at el, generalizes the notion of line graphs. In this thesis several graph theoretic properties of super line graphs of hypercubes are studied. In particular the super line graphs of inde

APA, Harvard, Vancouver, ISO, and other styles

17

Hendry, George R. T. "On paths, factors and cycles in graphs." Thesis, University of Aberdeen, 1985. http://digitool.abdn.ac.uk:80/webclient/DeliveryManager?pid=201995.

Full text

APA, Harvard, Vancouver, ISO, and other styles

18

Hamilton, David. "An Exploration of Procedural Methods for Motion Design." Digital Commons @ East Tennessee State University, 2020. https://dc.etsu.edu/honors/522.

Full text

Abstract:

This research aims to apply procedural techniques, similar to those employed in node-based modeling or compositing software packages, to the motion design workflow in Adobe After Effects. The purpose is to increase efficiency in the motion design process between pre-production and production stages. Systems Theory is referenced as a basis for breaking down problems in terms of inputs and outputs. All of this takes place within the context of a larger motion design project.

APA, Harvard, Vancouver, ISO, and other styles

19

Owen, David R. "Random search of AND-OR graphs representing finite-state models." Morgantown, W. Va. : [West Virginia University Libraries], 2002. http://etd.wvu.edu/templates/showETD.cfm?recnum=2317.

Full text

Abstract:

Thesis (M.S.)--West Virginia University, 2002.<br>Title from document title page. Document formatted into pages; contains vi, 96 p. : ill. Includes abstract. Includes bibliographical references (p. 91-96).

APA, Harvard, Vancouver, ISO, and other styles

20

Hanlon, Sebastien, and University of Lethbridge Faculty of Arts and Science. "Visualizing three-dimensional graph drawings." Thesis, Lethbridge, Alta. : University of Lethbridge, Faculty of Arts and Science, 2006, 2006. http://hdl.handle.net/10133/348.

Full text

Abstract:

The GLuskap system for interactive three-dimensional graph drawing applies techniques of scientific visualization and interactive systems to the construction, display, and analysis of graph drawings. Important features of the system include support for large-screen stereographic 3D display with immersive head-tracking and motion-tracked interactive 3D wand control. A distributed rendering architecture contributes to the portability of the system, with user control performed on a laptop computer without specialized graphics hardware. An interface for implementing graph drawing layout and analys

APA, Harvard, Vancouver, ISO, and other styles

21

Nickle, Elspeth J., and University of Lethbridge Faculty of Arts and Science. "Classes of arrangement graphs in three dimensions." Thesis, Lethbridge, Alta. : University of Lethbridge, Faculty of Arts and Science, 2005, 2005. http://hdl.handle.net/10133/632.

Full text

Abstract:

A 3D arrangement graph G is the abstract graph induced by an arrangement of planes in general position where the intersection of any two planes forms a line of intersection and an intersection of three planes creates a point. The properties of three classes of arrangement graphs — four, five and six planes — are investigated. For graphs induced from six planes, specialized methods were developed to ensure all possible graphs were discovered. The main results are: the number of 3D arrangement graphs induced by four, five and six planes are one, one and 43 respectively; the three classes are Ham

APA, Harvard, Vancouver, ISO, and other styles

22

Hossain, Mahmud Shahriar. "Apriori approach to graph-based clustering of text documents." Thesis, Montana State University, 2008. http://etd.lib.montana.edu/etd/2008/hossain/HossainM0508.pdf.

Full text

Abstract:

This thesis report introduces a new technique of document clustering based on frequent senses. The developed system, named GDClust (Graph-Based Document Clustering) [1], works with frequent senses rather than dealing with frequent keywords used in traditional text mining techniques. GDClust presents text documents as hierarchical document-graphs and uses an Apriori paradigm to find the frequent subgraphs, which reflect frequent senses. Discovered frequent subgraphs are then utilized to generate accurate sense-based document clusters. We propose a novel multilevel Gaussian minimum support strat

APA, Harvard, Vancouver, ISO, and other styles

23

Woyak, Scott A. "A motif-like object-oriented interface framework using PHIGS." Thesis, This resource online, 1992. http://scholar.lib.vt.edu/theses/available/etd-09052009-040824/.

Full text

APA, Harvard, Vancouver, ISO, and other styles

24

Coetzer, Audrey. "Criticality of the lower domination parameters of graphs." Thesis, Link to the online version, 2007. http://hdl.handle.net/10019/1051.

Full text

APA, Harvard, Vancouver, ISO, and other styles

25

Corbett, Dan R. "Unification and constraints over conceptual structures." Title page, contents and summary only, 2000. http://web4.library.adelaide.edu.au/theses/09PH/09phc7889.pdf.

Full text

Abstract:

Bibliography: leaves 150-161. This thesis addresses two areas in the field of conceptual structures. The first is the unification of conceptual graphs, and the consequent work in projection and in type hierarchies... The second area of investigation is the definition of constraints, especially real-value constraints on the concept referents, with particular attention to handling constraints during the unification of conceptual graphs.

APA, Harvard, Vancouver, ISO, and other styles

26

Jazbutis, Gintautas Bronius. "A systematic approach to assessing and extending graphical models of manufacturing." Diss., Georgia Institute of Technology, 1996. http://hdl.handle.net/1853/16425.

Full text

APA, Harvard, Vancouver, ISO, and other styles

27

Keller, Stacy Kathryn. "Levels of line graph question interpretation with intermediate elementary students of varying scientific and mathematical knowledge and ability a think aloud study /." Orlando, Fla. : University of Central Florida, 2008. http://purl.fcla.edu/fcla/etd/CFE0002356.

Full text

APA, Harvard, Vancouver, ISO, and other styles

28

Scott, Beverly (Beverly Ann). "The Effect of Graphing Calculators in Algebra II Classrooms: A Study Comparing Achievement, Attitude, and Confidence." Thesis, University of North Texas, 1994. https://digital.library.unt.edu/ark:/67531/metadc278081/.

Full text

Abstract:

The purpose of this study was to investigate the effectiveness of the graphing calculator on the achievement, attitude toward mathematics, and confidence in learning mathematics of Algebra II students.

APA, Harvard, Vancouver, ISO, and other styles

29

Gaylin, Kenneth B. "An investigation of information display variables utilizing computer-generated graphics for decision support systems." Thesis, Virginia Polytechnic Institute and State University, 1985. http://hdl.handle.net/10919/53070.

Full text

Abstract:

The effectiveness of selected computer-generated graphics display variables was examined in a mixed-factors factorial experiment using thirty-two subjects. All subjects performed four different graph reading tasks consisting of point-reading, point-comparison, trendreading, and trend-comparison. In each task, line, point, bar, and three-dimensional bar graphs were investigated under two levels of task complexity, and two levels of coding (color and black-and-white). The effects of these independent variables on measures of task performance errors, time to complete the task, subjective mental w

APA, Harvard, Vancouver, ISO, and other styles

30

Stafford, Charles A. "The relationship between operational graphics and battlefield success." Thesis, Monterey, Calif. : Naval Postgraduate School, 1990. http://handle.dtic.mil/100.2/ADA238338.

Full text

Abstract:

Thesis (M.S. in Operations Research)--Naval Postgraduate School, September 1990.<br>Thesis Advisor(s): Read, Robert R. ; Dryer, David A. Second Reader: Whitaker, Lyn R. "September 1990." DTIC Descriptor(s): Army Training, Combat Information Centers, Organizations, Training, Battalion Level Organizations, Battlefields, Task Forces, Attack, Missions, Standards, Graphics, Military Training, Archives, Combat Forces, Discriminate Analysis, Doctrine, Frequency, Data Processing. DTIC Identifier(s): National Training Center, Army Operation. Author(s) subject terms: National Training Center, Deliberate

APA, Harvard, Vancouver, ISO, and other styles

31

Bussian, Eric R. "Bounding the edge cover time of random walks on graphs." Diss., Georgia Institute of Technology, 1996. http://hdl.handle.net/1853/28953.

Full text

APA, Harvard, Vancouver, ISO, and other styles

32

Hochstein, Allison Dana. "The effectiveness of display formats in a data retention task." Thesis, Georgia Institute of Technology, 1995. http://hdl.handle.net/1853/29172.

Full text

APA, Harvard, Vancouver, ISO, and other styles

33

Lau, Man-kin, and 劉文建. "Learning by example for parametric font design." Thesis, The University of Hong Kong (Pokfulam, Hong Kong), 2009. http://hub.hku.hk/bib/B41897183.

Full text

APA, Harvard, Vancouver, ISO, and other styles

34

Heinz, Adrian. "Planarity testing and drawing in Jedit 4.0." Virtual Press, 2001. http://liblink.bsu.edu/uhtbin/catkey/1204201.

Full text

Abstract:

In this project, an enhanced version of Jedit is presented. Jedit is a Graph Editor developed at Ball State University by a group of students under the direction of Dr. Jay Bagga. The following paper describes the new version, named Jedit 4.0.In this version two new algorithms are implemented. These are: Planarity Testing and Planarity Drawing. The first algorithm tests a graph for planarity and the second one makes a planar embedding of the graph in a grid of size (n-2) x (n-2), where n is the order of the graph. Planar graphs have important applications in the fields of computer engineering,

APA, Harvard, Vancouver, ISO, and other styles

35

Gardner, Sugnet. "Extensions of biplot methodology to discriminant analysis with applications of non-parametric principal components." Thesis, Stellenbosch : Stellenbosch University, 2001. http://hdl.handle.net/10019.1/52264.

Full text

Abstract:

Dissertation (PhD)--Stellenbosch University, 2001.<br>ENGLISH ABSTRACT: Gower and Hand offer a new perspective on the traditional biplot. This perspective provides a unified approach to principal component analysis (PCA) biplots based on Pythagorean distance; canonical variate analysis (CVA) biplots based on Mahalanobis distance; non-linear biplots based on Euclidean embeddable distances as well as generalised biplots for use with both continuous and categorical variables. The biplot methodology of Gower and Hand is extended and applied in statistical discrimination and classification.

APA, Harvard, Vancouver, ISO, and other styles

36

Vonder, Embse Charles Bernard. "An eye fixation study of time factors comparing experts and novices when reading and interpreting mathematical graphs /." The Ohio State University, 1987. http://rave.ohiolink.edu/etdc/view?acc_num=osu148733076121707.

Full text

APA, Harvard, Vancouver, ISO, and other styles

37

Lau, Man-kin. "Learning by example for parametric font design." Click to view the E-thesis via HKUTO, 2009. http://sunzi.lib.hku.hk/hkuto/record/B41897183.

Full text

APA, Harvard, Vancouver, ISO, and other styles

38

Chan, King-wah. "The impact of graphing software on the learning of curve sketching in a form six classroom." Hong Kong : University of Hong Kong, 2001. http://sunzi.lib.hku.hk/hkuto/record.jsp?B2350092X.

Full text

APA, Harvard, Vancouver, ISO, and other styles

39

馮榮錦 and Wing-kam Tony Fung. "Analysis of outliers using graphical and quasi-Bayesian methods." Thesis, The University of Hong Kong (Pokfulam, Hong Kong), 1987. http://hub.hku.hk/bib/B31230842.

Full text

APA, Harvard, Vancouver, ISO, and other styles

40

Loop, Sallie Bell Jackson. "The Effect of Teacher Training in the Use of Computer Graphing Software on the Achievement of Algebra II Students." Thesis, University of North Texas, 1991. https://digital.library.unt.edu/ark:/67531/metadc332459/.

Full text

Abstract:

The purpose of this study was to investigate the effectiveness of carefully designed teacher training in the use of the computer to teach graphing skills associated with Algebra II conic sections. Three areas were studied: the teachers' attitude toward mathematics, and the effect on students' achievement in the area of graphing skills.

APA, Harvard, Vancouver, ISO, and other styles

41

Young, Karen Elizabeth. "An exploration of the use of graphic facilitative methods within the strategic change process." Thesis, Cranfield University, 2003. http://dspace.lib.cranfield.ac.uk/handle/1826/102.

Full text

Abstract:

The strategy and change management fields have developed new perspectives in recent years. Studies show that a high percentage of strategic change efforts fail and it was argued that one problem was the unsuccessful communication of the vision and strategy to employees. This exploratory research studied the use of graphic facilitative methods within the context of an organisation's strategic change process. Phase one of the explorative study was carried out using the combination of interview data, workshops and literature to identify emerging themes and to develop a conceptual model. Phase two

APA, Harvard, Vancouver, ISO, and other styles

42

Li, Mingrui. "On the size of induced subgraphs of hypercubes and a graphical user interface to graph theory." Virtual Press, 1993. http://liblink.bsu.edu/uhtbin/catkey/879847.

Full text

Abstract:

The hypercube is one of the most versatile and efficient networks yet discovered for parallel computation. It is well suited for both special-purpose and general-purpose tasks, and it can efficiently simulate many other networks of the same size. The size of subgraphs can be used to estimate the efficient communications of hypercube computer systems.The thesis investigates induced subgraphs of a hypercube, discusses sizes of subgraphs, and provides a formula to give bounds on the size of any subgraph of the hypercube.The concept of spanning graphs and line graphs is useful for studying propert

APA, Harvard, Vancouver, ISO, and other styles

43

Armstrong, Helen School of Mathematics UNSW. "Bayesian estimation of decomposable Gaussian graphical models." Awarded by:University of New South Wales. School of Mathematics, 2005. http://handle.unsw.edu.au/1959.4/24295.

Full text

Abstract:

This thesis explains to statisticians what graphical models are and how to use them for statistical inference; in particular, how to use decomposable graphical models for efficient inference in covariance selection and multivariate regression problems. The first aim of the thesis is to show that decomposable graphical models are worth using within a Bayesian framework. The second aim is to make the techniques of graphical models fully accessible to statisticians. To achieve these aims the thesis makes a number of statistical contributions. First, it proposes a new prior for decomposable graphs

APA, Harvard, Vancouver, ISO, and other styles

44

Sellami, Hatem. "Parallel simulation of marked graphs." Diss., Georgia Institute of Technology, 1995. http://hdl.handle.net/1853/13045.

Full text

APA, Harvard, Vancouver, ISO, and other styles

45

Baamann, Katharina. "The maximum clique problem - on finding an upper bound with application to protein structure alignment." Thesis, Georgia Institute of Technology, 2003. http://hdl.handle.net/1853/28674.

Full text

APA, Harvard, Vancouver, ISO, and other styles

46

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.

Full text

APA, Harvard, Vancouver, ISO, and other styles

47

Summers, Jason. "A study and implementation of techniques for finding the integrity of graphs." Virtual Press, 1994. http://liblink.bsu.edu/uhtbin/catkey/897509.

Full text

Abstract:

Integrity was invented to be a realistic measure of how difficult it is to break up a graph into small pieces by removing some of its elements. There are many different types of integrity, but in general it is defined as the minimum possible sum of two numbers: a number indicating the number of elements that are removed from the graph, and a number reflecting the size of the largest group of elements that remain connected despite this removal.This thesis consists of a study of the known results in three varieties of graph integrity (vertex integrity, edge integrity, and pure integrity), and an

APA, Harvard, Vancouver, ISO, and other styles

48

Techakittiroj, Kittiphan. "Visibility graphs and motion planning." Virtual Press, 1995. http://liblink.bsu.edu/uhtbin/catkey/935947.

Full text

Abstract:

Motion planning in the presence of obstacles deals with finding efficient paths from source to target which avoid hitting any of the obstacles. Applications include motion planning in robotics and designing efficient routing systems.Theoretical concepts from graph theory, topology, and computational geometry form the basis for some of the algorithms used in motion planning. The visibility graph is a standard model used in the study of motion planning.This thesis is a report of the research project undertaken to study visibility graphs and their applications to motion planning for certain geome

APA, Harvard, Vancouver, ISO, and other styles

49

Frauenknecht, R. "Secondary and early tertiary student's understanding of graphs of motion." Thesis, University of Stellenbosch, 1998. http://hdl.handle.net/20.500.11838/2128.

Full text

Abstract:

Thesis (PhD (Education))--University of Stellenbosch, 1998.<br>This dissertation deals with typical, widespread student errors with respect to kinematic graphs as revealed by a literature survey, as well as an own empirical investigation into the nature and extent of these misconceptions. The fact that certain misconceptions turned out to be more widespread than initially believed, has serious consequences for educators' assumptions about students' understanding of graphs in general, as well as their ideas on how to minimise some generally occurring "alternative views on graphs". Student

APA, Harvard, Vancouver, ISO, and other styles

50

Ketkar, Nikhil S. "Empirical comparison of graph classification and regression algorithms." Pullman, Wash. : Washington State University, 2009. http://www.dissertations.wsu.edu/Dissertations/Spring2009/n_ketkar_042409.pdf.

Full text

Abstract:

Thesis (Ph. D.)--Washington State University, May 2009.<br>Title from PDF title page (viewed on June 3, 2009). "School of Electrical Engineering and Computer Science." Includes bibliographical references (p. 101-108).

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!