Spelling suggestions: "subject:"12graphic 3methods"" "subject:"12graphic 4methods""
121 |
Some results on FPGAs, file transfers, and factorizations of graphs.January 1998 (has links)
by Pan Jiao Feng. / Thesis (M.Phil.)--Chinese University of Hong Kong, 1998. / Includes bibliographical references (leaves 89-93). / Abstract also in Chinese. / Abstract --- p.i / Acknowledgments --- p.v / List of Tables --- p.x / List of Figures --- p.xi / Chapter Chapter 1. --- Introduction --- p.1 / Chapter 1.1 --- Graph definitions --- p.2 / Chapter 1.2 --- The S box graph --- p.2 / Chapter 1.3 --- The file transfer graph --- p.4 / Chapter 1.4 --- "(g, f)-factor and (g, f)-factorization" --- p.5 / Chapter 1.5 --- Thesis contributions --- p.6 / Chapter 1.6 --- Organization of the thesis --- p.7 / Chapter Chapter 2. --- On the Optimal Four-way Switch Box Routing Structures of FPGA Greedy Routing Architectures --- p.8 / Chapter 2.1 --- Introduction --- p.9 / Chapter 2.1.1 --- FPGA model and S box model --- p.9 / Chapter 2.1.2 --- FPGA routing --- p.10 / Chapter 2.1.3 --- Problem formulation --- p.10 / Chapter 2.2 --- Definitions and terminology --- p.12 / Chapter 2.2.1 --- General terminology --- p.12 / Chapter 2.2.2 --- Graph definitions --- p.15 / Chapter 2.2.3 --- The S box graph --- p.15 / Chapter 2.3 --- Properties of the S box graph and side-to-side graphs --- p.16 / Chapter 2.3.1 --- On the properties of the S box graph --- p.16 / Chapter 2.3.2 --- The properties of side-to-side graphs --- p.19 / Chapter 2.4 --- Conversion of the four-way FPGA routing problem --- p.23 / Chapter 2.4.1 --- Conversion of the S box model --- p.24 / Chapter 2.4.2 --- Conversion of the DAAA model --- p.26 / Chapter 2.4.3 --- Conversion of the DADA model --- p.27 / Chapter 2.4.4 --- Conversion of the DDDA model --- p.28 / Chapter 2.5 --- Low bounds of routing switches --- p.28 / Chapter 2.5.1 --- The lower bound of the DAAA model --- p.29 / Chapter 2.5.2 --- The lower bound of the DADA model --- p.30 / Chapter 2.5.3 --- The lower bound of the DDDA model --- p.31 / Chapter 2.6 --- Optimal structure of one-side predetermined four-way FPGA routing --- p.32 / Chapter 2.7 --- Optimal structures of two-side and three-side predetermined four-way FPGA routing --- p.45 / Chapter 2.7.1 --- Optimal structure of two-side predetermined four-way FPGA routing --- p.46 / Chapter 2.7.2 --- Optimal structure of three-side predetermined four-way FPGA routing --- p.47 / Chapter 2.8 --- Conclusion --- p.49 / Appendix --- p.50 / Chapter Chapter 3. --- "Application of (0, f)-Factorization on the Scheduling of File Transfers" --- p.53 / Chapter 3.1 --- Introduction --- p.53 / Chapter 3.1.1 --- "(0,f)-factorization" --- p.54 / Chapter 3.1.2 --- File transfer model and its graph --- p.54 / Chapter 3.1.3 --- Previous results --- p.56 / Chapter 3.1.4 --- Our results and outline of the chapter --- p.56 / Chapter 3.2 --- NP-completeness --- p.57 / Chapter 3.3 --- Some lemmas --- p.58 / Chapter 3.4 --- Bounds of file transfer graphs --- p.59 / Chapter 3.5 --- Comparison --- p.62 / Chapter 3.6 --- Conclusion --- p.68 / Chapter Chapter 4. --- "Decomposition Graphs into (g,f)-Factors" --- p.69 / Chapter 4.1 --- Introduction --- p.69 / Chapter 4.1.1 --- "(g,f)-factors and (g,f)-factorizations" --- p.69 / Chapter 4.1.2 --- Previous work --- p.70 / Chapter 4.1.3 --- Our results --- p.72 / Chapter 4.2 --- Proof of Theorem 2 --- p.73 / Chapter 4.3 --- Proof of Theorem 3 --- p.79 / Chapter 4.4 --- Proof of Theorem 4 --- p.80 / Chapter 4.5 --- Related previous results --- p.82 / Chapter 4.6 --- Conclusion --- p.84 / Chapter Chapter 5. --- Conclusion --- p.85 / Chapter 5.1 --- About graph-based approaches --- p.85 / Chapter 5.2 --- FPGA routing --- p.87 / Chapter 5.3 --- The scheduling of file transfer --- p.88 / Bibliography --- p.89 / Vita --- p.94
|
122 |
Representation of knowledge using Sowa's conceptual graphs : an implementation of a set of toolsSchiltz, Gary January 2010 (has links)
Typescript (photocopy). / Digitized by Kansas Correctional Industries / Department: Computer Science.
|
123 |
A procedure to evaluate the feasibility of naval ship designsCassedy, William Augustus Tyler January 1977 (has links)
Thesis. 1977. Ocean E.--Massachusetts Institute of Technology. Dept. of Ocean Engineering. / MICROFICHE COPY AVAILABLE IN ARCHIVES AND ENGINEERING. / Includes bibliographical references. / by William Augustus Tyler Cassedy IV. / Ocean E.
|
124 |
Improving the efficiency of graph-based data mining with application to public health dataZhang, Yan, January 2007 (has links) (PDF)
Thesis (M.S. in computer science)--Washington State University, December 2007. / Includes bibliographical references (p. 77-79).
|
125 |
Some examples of Pearson's frequency curvesThomson, Mary Gilmore, 1897- January 1940 (has links)
No description available.
|
126 |
Visualizing three-dimensional graph drawingsHanlon, Sebastien, University of Lethbridge. Faculty of Arts and Science January 2006 (has links)
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 analysis algorithms in the Python
programming language is also provided. This thesis describes comprehensively the work
on the system by the author—this work includes the design and implementation of the major
features described above. Further directions for continued development and research in
cognitive tools for graph drawing research are also suggested. / viii, 110 leaves : ill. (some col.) ; 29 cm.
|
127 |
Classes of arrangement graphs in three dimensionsNickle, Elspeth J., University of Lethbridge. Faculty of Arts and Science January 2005 (has links)
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 Hamiltonian; and the 3D arrangement graphs created from four and five planes are planar
but none of the graphs created from six planes are planar. / x, 89 leaves : ill. (some col.) ; 29 cm
|
128 |
Jedit : a graph editor in JavaVemuri, Suresh P. January 1996 (has links)
There are increasing demands for graphics-oriented software packages for graph theory teaching and research. G-Net, a departmental research project headed by Dr. Jay Bagga, is an effort to create a software package that comprises of a graph database, a graph editor, 'and a collection of graph algorithms. Also, with widespread use of the World Wide Web, the graph editor should be accessible through the Web. Taking these issues into consideration Jedit (Java Graph editor) is developed. This thesis concentrates on the design and implementation of a graph editor and a graph object (Jgraph). Jgraph is developed in java to implement the graph algorithms in future. One of the unique features of this graph editor is that it can be used as stand-alone application or as an applet for the Web. In addition, it also provides a friendly user interface. / Department of Computer Science
|
129 |
The effects of graphic organizers on the comprehension and retention of Chinese sixth-grade readers in social studies classroomsCheng, Tzung-Yu January 1993 (has links)
The purpose of this study was to investigate the effects of using graphic organizers during prereading, reading, and postreading positions of the comprehension and retention of Chinese sixth-grade students who were identified as below-average or above-average readers. Chinese sixth graders from one school were first administered The Michigan Chinese Reading Test to identify reading level. Subjects were then assigned to one of the four treatment groups: traditional Chinese social studies method, graphic preorganizers, graphic organizers as a reading guide, and graphic post organizers.Two practice passages were first used to familiarize the subjects with how graphic organizers were utilized in instruction before reading on experimental passage. The dependent measure, 45 multiple-choice questions based on the experimental passage, was administered twice: the next day after the instructional sessions were concluded and again seven days later.The principal analysis to test the three null hypotheses was a 2 x 4 x 2 ANOVA with repeated measures on the last factor corresponding to the two administrations of the test. Two follow-up analyses of variance (ANOVAs) were used to test for differences in treatment condition sepa-rately for above-average readers and below-average readers, using the average of the immediate and the seven-day delayed tests. One Scheffe test was applied to find the location of significant differences among the four treatment conditions for above-average readers. Finally, four follow-up t-tests were used to test for differences in reading level at each of the four treatment levels.Three conclusions were drawn from the statistical analyses of the data: 1) graphic organizers had a significant effect on comprehension and retention only when above-average readers were required to process the organizers during reading; 2) graphic organizers did not produce significantly better comprehension and recall performance of below-average readers; and 3) the effect of graphic organizers was equal to that of the traditional Chinese social studies method in maintaining comprehension and recall for both above-average readers and below-average readers over a one-week delay. / Department of Elementary Education
|
130 |
An investigation of parallel algorithms developed for graph problems and their implementation on parallel computersKondo, Boubacar January 1991 (has links)
With the recent development of VLSI (Very Large Scale Integration) technology, research has increased considerably on the development of efficient parallel algorithms for solutions of practical graph problems. Varieties of algorithms have already been implemented on different models of parallel computers. But not too much is known yet about the question of which model of parallel computer will efficiently and definitely fit every graph problem. In this investigation the study will focus on a comparative analysis of speedup and efficiency of parallel algorithms with parallel model of computation, and with respect to some sequential algorithms. / Department of Computer Science
|
Page generated in 0.0627 seconds