Global ETD Search

Search theses and dissertations gathered from participating repositories worldwide. Every result links back to the library that holds it. No account is needed.

Results

Showing 1 to 18 of 18 for “"discrete math"”.

  1. User interface to an ICAI system that teaches discrete math

    … processor and runs on a personal computer. Discrete Mathematics is the knowledge domain for this project and the Discrete Math Tutor (DMT) is the name of the tutoring system. The DMT will allow the average student to benefit from a tutoring system now and not have to wait until the …

    nps Repository record for User interface to an ICAI system that teaches discrete math (opens in a new tab)

  2. Setpad: A Sketch-based Tool For Exploring Discrete Math Set Problems

    … that lets computer science students explore discrete math problems by sketching set expressions using pen-based input. Students can manipulate the expressions interactively with the tool via pen or multi-touch interface. Likewise, discrete mathematics instructors can use SetPad to display and …

    ucf Repository record for Setpad: A Sketch-based Tool For Exploring Discrete Math Set Problems (opens in a new tab)

  3. A Design of Computer Aided Instructions (CAI) For Undirected Graphs In The Discrete Math Tutorial (DMT)

    … for teaching aspects of "undirected graphs" in discrete math. It is one of the submodules of the Discrete Math Tutorial (DMT), which is a Computer Aided Instructional (CAI) tool for teaching discrete math to the Naval Academy and the Westpoint Military Academy students. In order to accomplish …

    nps Repository record for A Design of Computer Aided Instructions (CAI) For Undirected Graphs In The Discrete Math Tutorial (DMT) (opens in a new tab)

  4. Investigation of 4-cutwidth critical graphs

    … Lin and Aifeng Yang published in the journal Discrete Math characterized the set of a 3-cutwidth critical graphs by five specified elements. This project extends the idea to 4-cutwidth critical graphs.

    csusb Repository record for Investigation of 4-cutwidth critical graphs (opens in a new tab)

  5. Investigation of 4-cutwidth critical graphs

    … Lin and Aifeng Yang published in the journal Discrete Math characterized the set of a 3-cutwidth critical graphs by five specified elements. This project extends the idea to 4-cutwidth critical graphs.

    csusb-retro Repository record for Investigation of 4-cutwidth critical graphs (opens in a new tab)

  6. Topics in combinatorics: A statistical application

    The discrete math area known as combinatorics has specific applications in statistics. In this paper, the relationship between combinatorics and statistics will be explored. Major areas of concentration will include: generating functions, special combinatorial numbers and their use in statistics, …

    unlv Repository record for Topics in combinatorics: A statistical application (opens in a new tab) Download PDF for Topics in combinatorics: A statistical application (opens in a new tab)

  7. A FRAMEWORK FOR AUTOMATICALLY GENERATING QUESTIONS FOR TOPICS IN DISCRETE MATHEMATICS

    … from the text, therefore, other topics such as mathematics are lacking an automated question generation system that could help learners to assess their knowledge.In this research we present a novel framework that automatically generates unlimited numbers of questions for different topics in …

    ecu Repository record for A FRAMEWORK FOR AUTOMATICALLY GENERATING QUESTIONS FOR TOPICS IN DISCRETE MATHEMATICS (opens in a new tab)

  8. Spanning Trails and Spanning Trees

    … F2). Third, by solving a conjecture posed in [Discrete Math. 306 (2006) 87-98], we prove if G is essentially 4-edge-connected, then for any edge subset X0 ⊆ E(G) with |X0| ≤ 3 and any distinct edges e, e' 2 ∈ E(G), G has a spanning ( e, e')-trail containing all edges in X0.;The results on …

    wvu Repository record for Spanning Trails and Spanning Trees (opens in a new tab)

  9. Subdividing the cd-index

    This thesis aims to give the reader an introduction and overview of the cd-index of a poset, as well as establish some new results. We give a combinatorial proof of Ehrenborg and Karu's cd-index subdivision decomposition for Gorenstein* complexes and extend it to a wider class of subdivisions. In …

    waterloo Repository record for Subdividing the cd-index (opens in a new tab)

  10. 2-Swappability and the Edge-Reconstruction Number of Regular Graphs

    The edge-reconstruction number of a graph $G$, denoted $\ERN(G)$, is the size of the smallest multiset of unlabeled, edge-deleted subgraphs of $G$, from which the structure of $G$ can be uniquely determined. That there was some connection between the areas of edge reconstruction and swapping …

    umn Repository record for 2-Swappability and the Edge-Reconstruction Number of Regular Graphs (opens in a new tab)

  11. Amidakuji: Gray Code Algorithms for Listing Ladder Lotteries

    … of a bar. Ladder lotteries are an abstract mathematical object which correspond to permutations. They are a network of vertical lines and horizontal bars, which induce transpositions on elements in a specific permutation when the lines cross. Ladder lotteries are of interest to the field of …

    guelph Repository record for Amidakuji: Gray Code Algorithms for Listing Ladder Lotteries (opens in a new tab)

  12. From Graph Coloring to Receptor Clustering

    … ≤ K( r)+1. This extends a previous result in [Discrete Math. 269 (2003) 303--309].;2. Quantitative description and impact of VEGF receptor clustering .;Cell membrane-bound receptors control signal initiation in many important cellular signaling pathways. Microscopic imaging and modern labeling …

    wvu Repository record for From Graph Coloring to Receptor Clustering (opens in a new tab)

  13. From Graph Coloring to Receptor Clustering

    … ≤ K( r)+1. This extends a previous result in [Discrete Math. 269 (2003) 303--309].;2. Quantitative description and impact of VEGF receptor clustering .;Cell membrane-bound receptors control signal initiation in many important cellular signaling pathways. Microscopic imaging and modern labeling …

    wvu Repository record for From Graph Coloring to Receptor Clustering (opens in a new tab)

  14. On Generalizations of Supereulerian Graphs

    … sharpens the result obtained by Zhang et al. in [Discrete Math., 308 (2008) 4779-4785]. Harary and Nash-Williams in 1968 proved that the line graph of a graph $G$ is Hamiltonian if and only if $G$ has a dominating closed trail, Jaeger in 1979 showed that every 4-edge-connected graph is …

    wvu Repository record for On Generalizations of Supereulerian Graphs (opens in a new tab)

  15. A Study on Graph Coloring and Digraph Connectivity

    … H is a subdigraph of D{rcub}.;Catlin et al. in [Discrete Math., 309 (2009), 1033-1040] proved a characterization of kappa'(G) in terms of tau(G). We proved a digraph version of this characterization by showing that a digraph D is k-arc-strong if and only if for any vertex v in D, D has …

    wvu Repository record for A Study on Graph Coloring and Digraph Connectivity (opens in a new tab)

  16. Sarvate-beam group divisible designs and related multigraph decomposition problems

    A design is a set of points, V, together with a set of subsets of V called blocks. A classic type of design is a balanced incomplete block design, where every pair of points occurs together in a block the same number of times. This ‘balanced’ condition can be replaced with other properties. An …

    uvic Repository record for Sarvate-beam group divisible designs and related multigraph decomposition problems (opens in a new tab)

  17. 2-limited broadcast domination on grid graphs

    Suppose there is a transmitter located at each vertex of a graph G. A k-limited broadcast on G is an assignment of the integers 0,1,...,k to the vertices of G. The integer assigned to the vertex x represents the strength of the broadcast from x, where strength 0 means the transmitter at x is not …

    uvic Repository record for 2-limited broadcast domination on grid graphs (opens in a new tab)

  18. Online Steiner Cover Problems in Hypergraphs

    The online Steiner cover problem in hypergraphs (\treePN) is a generalization of the online Steiner tree problem in graphs. An edge-weighted hypergraph $H = (V, E, w)$ is given offline and a set of terminal vertices $R\subseteq V$ is requested sequentially online. Upon receiving each request …

    concordia Download PDF for Online Steiner Cover Problems in Hypergraphs (opens in a new tab)