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 20 of 226 for “"rectangles"”.
-
Decomposing rectilinear regions into rectangles
… with or without holes, into a minimum number of rectangles. There are two different types of decomposition considered here : decomposing a figure into non-overlapping parts, called partitioning, and decomposing a figure into possibly overlapping parts, called covering. A method is outlined and …
-
Supramolecular self-assembly of gold rectangles
… were designed and synthesized. The molecular rectangles possess large cavities. The first molecular rectangle, [Au4(PAnP)2(DPE)2](OTf)4, has a cavity of 8.108 x 19.093 Å. The second molecular rectangle, [Au4(PAnP)2(BPE)2](OTf)4, has a cavity of 9.197 x 18.662 Å. The electronic …
-
Tiling with Polyominoes, Polycubes, and Rectangles
… of polyominoes. We will then discuss tiling with rectangles. We will then get some new, and some analogous results concerning the possible hierarchical structure for the 3-d polycubes.
-
Pattern formation in squares and rectangles
This thesis considers pattern formation governed by the two dimensional Swift-Hohenberg equation in square and rectangular domains. For the square, the dependence of the solution on the size of the square relative to the characteristic wavelength of the pattern is investigated for periodic, …
-
Parametric rectangles: A model for spatiotemporal databases
In this dissertation, we propose parametric rectangles—cross products of intervals whose end points are functions of time—as a new data model for representing, querying, and animating spatiotemporal objects with continuous and periodic change. Parametric rectangles are a more natural representation …
-
Row-column factorial designs and mutually orthogonal frequency rectangles
… row and m/q times in each column. Two frequency rectangles of the same type are said to be orthogonal if each possible pair of symbols appears the same number of times when the two arrays are superimposed. By k–MOFR(m,n;q) we mean a set of k frequency rectangles of type FR(m,n;q) in which every …
-
Connected Painted Rectangles Experiments in Quantitative Shape and Contrasting Elements
The thesis consisted of a series of paintings in which the canvases were individually painted in a predetermined way, then arranged and assembled more spontaneously in a final wall construction. Narrow limitations, such as working with only horizontal and vertical compositions and contrasting …
-
Pre-Service Teachers' Understanding the Measurement of the Area of Rectangles
… (PTs’) difficulties with measuring the area of rectangles and explaining their approaches to area measurement. Yet, little is known about elementary PTs’ understandings of area measurement. Existing research has focused on children’s understanding of area measurement in the context of rectangles …
-
Hopf bifurcation in anisotropic reaction diffusion systems posed in large rectangles
… diffusion equations posed in large (but finite) rectangles is investigated. The work pursued in this dissertation extends previous studies for infinitely extended 2D systems to include finite-size effects. For the case considered, the solution of the reaction diffusion system is represented in …
-
The construction of a graded scale of rectangles (a problem in educational measurements)
Thesis (M.A.)--Boston University
-
Experimental evaluation of spinal fracture stabilization systems : comparison of Luque rectangles, the Kaneda device, and Harrington rods with sublaminar wires
"At the University of Missouri-Columbia a spinal stabilization instrument evaluation system was developed by Carson, Gaines, Glascock, Karra, and Pak [3,16] to determine the ability of internal fixation devices to stabilize fractured spines. The system was designed to measure and calculate the …
-
Construction of Sudoku, magic rectangles, magic Sudoku, twin Sudoku, and their extension to 3D Sudoku with application in cryptography and data security
… along the X, Y , and Z axes, respectively. Magic rectangles and nested magic rectangles are constructed. In addition, orthogonal balanced magic Sudoku tables as a class of Sudoku tables in which their blocks are magic are created and a method to construct nested Latin squares is presented. New …
-
Approximation Algorithms for Geometric Packing Problems
… packing problems. We have given a set of rectangles that have to be placed in one or several predetermined target regions. Such packing problems can be found in several branches of industry, for example when placing logic elements on a chip, or when cutting stock. We consider three …
-
SOLVING COMPUTATIONAL GEOMETRY PROBLEMS ON MESH-CONNECTED COMPUTERS
… properties of a set of, possibly intersecting rectangles are presented. Given a set of n iso-oriented rectangles, we describe MCC algorithms for determining the area of the logic "OR" of these rectangles, the area of pairwise logic "AND" of the rectangles, the largest number of rectangles that …
-
Weighted simultaneous Diophantine approximation in a variety of settings
… sets are often described by limsup sets of rectangles, so Mass Transference Principles on rectangles are favoured. Examples of these include the Mass Transference Principle from balls to rectangles (Wang, Wu, Xu, 2015), and the Mass Transference Principle from rectangles to rectangles (Wang, …
-
Maximal Operators in R^2
… theorem. If the bases are balls or rectangles parallel to the coordinate axes, the associated maximal operator is bounded from $L^p$ to $L^p$ for all $p>1$. On the other hand, Besicovitch showed that it is not bounded if the bases consists of arbitrary rectangles. In $\mathbb{R}^2$ …
-
Algorithms on Clustering, Orienteering, and Conflict -Free Coloring
… congruent disks, and nearly-equal axis-parallel rectangles. In all these cases, the coloring algorithms use O(log n) colors, with high probability. We also present the first efficient deterministic algorithm for the CF coloring of points in the plane with respect to nearly-equal axis-parallel …
-
Approximation Algorithms for Rectangle Piercing Problems
… known approximation ratio for arbitrarily sized rectangles is poor, we restrict our effort to designing approximation algorithms for unit-height rectangles. Our e-approximation scheme requires <I>n</I><sup><I>O</I>(1/ε²)</sup> time. We also consider the problem with restrictions like …
Page 1 of 12