• Refine Query
  • Source
  • Publication year
  • to
  • Language
  • 7
  • 2
  • 1
  • 1
  • 1
  • Tagged with
  • 115
  • 115
  • 40
  • 30
  • 18
  • 18
  • 14
  • 14
  • 13
  • 13
  • 12
  • 12
  • 11
  • 11
  • 11
  • About
  • The Global ETD Search service is a free service for researchers to find electronic theses and dissertations. This service is provided by the Networked Digital Library of Theses and Dissertations.
    Our metadata is collected from universities around the world. If you manage a university/consortium/country archive and want to be added, details can be found on the NDLTD website.
111

Computational and Geometric Aspects of Linear Optimization

Xie, Feng 04 1900 (has links)
<p>This thesis deals with combinatorial and geometric aspects of linear optimization, and consists of two parts.</p> <p>In the first part, we address a conjecture formulated in 2008 and stating that the largest possible average diameter of a bounded cell of a simple hyperplane arrangement of n hyperplanes in dimension d is not greater than the dimension d. The average diameter is the sum of the diameters of each bounded cell divided by the total number of bounded cells, and then we consider the largest possible average diameter over all simple hyperplane arrangements. This quantity can be considered as an indication of the average complexity of simplex methods for linear optimization. Previous results in dimensions 2 and 3 suggested that a specific type of extensions, namely the covering extensions, of the cyclic arrangement might achieve the largest average diameter. We introduce a method for enumerating the covering extensions of an arrangement, and show that covering extensions of the cyclic arrangement are not always among the ones achieving the largest diameter.</p> <p>The software tool we have developed for oriented matroids computation is used to exhibit a counterexample to the hypothesized minimum number of external facets of a simple arrangement of n hyperplanes in dimension d; i.e. facets belonging to exactly one bounded cell of a simple arrangement. We determine the largest possible average diameter, and verify the conjectured upper bound, in dimensions 3 and 4 for arrangements defined by no more than 8 hyperplanes via the associated uniform oriented matroids formulation. In addition, these new results substantiate the hypothesis that the largest average diameter is achieved by an arrangement minimizing the number of external facets.</p> <p>The second part focuses on the colourful simplicial depth, i.e. the number of colourful simplices in a colourful point configuration. This question is closely related to the colourful linear programming problem. We show that any point in the convex hull of each of (d+1) sets of (d+1) points in general position in R<sup>d</sup> is contained in at least (d+1)<sup>2</sup>/2 simplices with one vertex from each set. This improves the previously established lower bounds for d>=4 due to Barany in 1982, Deza et al in 2006, Barany and Matousek in 2007, and Stephen and Thomas in 2008.</p> <p>We also introduce the notion of octahedral system as a combinatorial generalization of the set of colourful simplices. Configurations of low colourful simplicial depth correspond to systems with small cardinalities. This construction is used to find lower bounds computationally for the minimum colourful simplicial depth of a configuration, and, for a relaxed version of the colourful depth, to provide a simple proof of minimality.</p> / Doctor of Philosophy (PhD)
112

Self-Assembly of DNA Graphs and Postman Tours

Bakewell, Katie 01 January 2018 (has links)
DNA graph structures can self-assemble from branched junction molecules to yield solutions to computational problems. Self-assembly of graphs have previously been shown to give polynomial time solutions to hard computational problems such as 3-SAT and k-colorability problems. Jonoska et al. have proposed studying self-assembly of graphs topologically, considering the boundary components of their thickened graphs, which allows for reading the solutions to computational problems through reporter strands. We discuss weighting algorithms and consider applications of self-assembly of graphs and the boundary components of their thickened graphs to problems involving minimal weight Eulerian walks such as the Chinese Postman Problem and the Windy Postman Problem.
113

The Effects of the Use of Technology In Mathematics Instruction on Student Achievement

Myers, Ron Y 30 March 2009 (has links)
The purpose of this study was to examine the effects of the use of technology on students’ mathematics achievement, particularly the Florida Comprehensive Assessment Test (FCAT) mathematics results. Eleven schools within the Miami-Dade County Public School System participated in a pilot program on the use of Geometers Sketchpad (GSP). Three of these schools were randomly selected for this study. Each school sent a teacher to a summer in-service training program on how to use GSP to teach geometry. In each school, the GSP class and a traditional geometry class taught by the same teacher were the study participants. Students’ mathematics FCAT results were examined to determine if the GSP produced any effects. Students’ scores were compared based on assignment to the control or experimental group as well as gender and SES. SES measurements were based on whether students qualified for free lunch. The findings of the study revealed a significant difference in the FCAT mathematics scores of students who were taught geometry using GSP compared to those who used the traditional method. No significant differences existed between the FCAT mathematics scores of the students based on SES. Similarly, no significant differences existed between the FCAT scores based on gender. In conclusion, the use of technology (particularly GSP) is likely to boost students’ FCAT mathematics test scores. The findings also show that the use of GSP may be able to close known gender and SES related achievement gaps. The results of this study promote policy changes in the way geometry is taught to 10th grade students in Florida’s public schools.
114

BBT Acoustic Alternative Top Bracing CADD Data Set-NoRev-2022Jun28

Hemphill, Bill 22 July 2022 (has links)
This electronic document file set consists of an overview presentation (PDF-formatted) file and companion video (MP4) and CADD files (DWG & DXF) for laser cutting the ETSU-developed alternate top bracing designs and marking templates for the STEM Guitar Project’s BBT (OM-sized) standard acoustic guitar kit. The three (3) alternative BBT top bracing designs in this release are (a) a one-piece base for the standard kit's (Martin-style) bracing, (b) 277 Ladder-style bracing, and (c) an X-braced fan-style bracing similar to traditional European or so-called 'classical' acoustic guitars. The CADD data set for each of the three (3) top bracing designs includes (a) a nominal 24" x 18" x 3mm (0.118") Baltic birch plywood laser layout of (1) the one-piece base with slots, (2) pre-radiused and pre-scalloped vertical braces with tabs to ensure proper orientation and alignment, and (3) various gages and jigs and (b) a nominal 15" x 20" marking template. The 'provided as is" CADD data is formatted for use on a Universal Laser Systems (ULS) laser cutter digital (CNC) device. Each CADD drawing is also provided in two (2) formats: Autodesk AutoCAD 2007 .DWG and .DXF R12. Users should modify and adapt the CADD data as required to fit their equipment. This CADD data set is released and distributed under a Creative Commons license; users are also encouraged to make changes o the data and share (with attribution) their designs with the worldwide acoustic guitar building community.
115

BBT Acoustic Alternative Top Bracing CADD Data Set-NoRev-2022Jun28

Hemphill, Bill 22 July 2022 (has links)
This electronic document file set consists of an overview presentation (PDF-formatted) file and companion video (MP4) and CADD files (DWG & DXF) for laser cutting the ETSU-developed alternate top bracing designs and marking templates for the STEM Guitar Project’s BBT (OM-sized) standard acoustic guitar kit. The three (3) alternative BBT top bracing designs in this release are (a) a one-piece base for the standard kit's (Martin-style) bracing, (b) 277 Ladder-style bracing, and (c) an X-braced fan-style bracing similar to traditional European or so-called 'classical' acoustic guitars. The CADD data set for each of the three (3) top bracing designs includes (a) a nominal 24" x 18" x 3mm (0.118") Baltic birch plywood laser layout of (1) the one-piece base with slots, (2) pre-radiused and pre-scalloped vertical braces with tabs to ensure proper orientation and alignment, and (3) various gages and jigs and (b) a nominal 15" x 20" marking template. The 'provided as is" CADD data is formatted for use on a Universal Laser Systems (ULS) laser cutter digital (CNC) device. Each CADD drawing is also provided in two (2) formats: Autodesk AutoCAD 2007 .DWG and .DXF R12. Users should modify and adapt the CADD data as required to fit their equipment. This CADD data set is released and distributed under a Creative Commons license; users are also encouraged to make changes o the data and share (with attribution) their designs with the worldwide acoustic guitar building community.

Page generated in 0.073 seconds