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 45 for “"rectangles"”.
-
Area-contracting maps between rectangles
… of all diffeomorphisms between two n-dimensional rectangles R and S. I proved that for many rectangles there are highly non-linear diffeomorphisms with much smaller k-dilation than any linear diffeomorphism. When k is equal to n-l, I determined the smallest k-dilation up to a constant factor. For …
-
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 …
-
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, …
-
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 …
-
Contributions on secretary problems, independent sets of rectangles and related problems
… independent set of a well-behaved family of rectangles. Using this, we devise combinatorial and LP-based algorithms for the jump number problem, extending the class of bipartite posets for which this problem is polynomially solvable and improving on the running time of existing algorithms for …
-
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 Geometric Networks
… where we aim to place a set of different sized rectangles, such that the area of their corresponding bounding box is minimized, and such that a grid may be placed over the rectangles. The grid should not intersect any rectangle, and each cell of the grid should contain at most one rectangle. All …
-
An Analysis of the Impact of Reinforcement on Response Variability on Multiple Behavioural Dimensions
… In Experiment 1, adult participants drew 300 rectangles on a computer screens; variability in the Area, Shape and Location dimensions of the rectangles drawn was measured. One group of participants received reinforcement when they drew rectangles varying on all three dimensions (VAR) using a …
-
Approximation algorithms for packing and scheduling problems
… bin-packing problem: Place a given list of rectangles into the minimum number of unit square bins. In the restricted case where all rectangles are squares, we design an algorithm with an asymptotic performance guarantee arbitrarily close to optimal. In the general case, we give an algorithm …
-
O método dos elementos finitos aplicado à análise de vigas e placas apoiadas em meio elástico
… also handle plates wich can be decomposed into rectangles.
-
Geometric Decompositions and Networks - Approximation Bounds and Algorithms
… arbitrary polygon with simpler polygons, i.e., rectangles. We present several approximation algorithms for this problem, and also some lower bounds on the number of rectangles needed in a covering of a hole-free polygon and on the time-complexity for this and related problems. Then, we consider …
-
Study of Plasmonic Properties of the Gold Nanorods in the Visible to Near Infrared Light Regime
… wavelength of the sharp-corner and round-corner rectangles of constant length 100 nm and width 60 nm. The result shows that resonance wavelength depends on the polarization of the incident light; there also exists a strong dependence of the optical enhancement and absorption on the thickness of …
-
Tower House
… since the late 1940s. The house is a pair of rectangles separated by a stair. The concrete block walls are punctured by large windows, aligned to define interior passage and establishing clarity of spatial and formal relationships. The tower house is the reduction and rational manifestation of …
-
Small and Stable Descriptors of Distributions for Geometric Statistical Problems
… family of ranges (e.g., disks, axis-aligned rectangles). An ε-kernel approximates the width of a point set in all directions. Both coresets have size that depends only on ε, the error parameter, not the size of the original data set. We demonstrate several improvements to …
-
A new soil stabilisation technique
… oriented mesh elements in the form of squares, rectangles or ribbons. Laboratory compaction, CBR, permeability, triaxial, repeated loading, long term loading (creep) and model footing tests are detailed in which 50 mm square, or 50 x 100 mm rectangular mesh elements are mixed with various soils …
-
Applications of Computational Geometry and Computer Vision
… compared and new methods for finding empty hyper-rectangles are introduced. The problem of finding holes is then linked to the problem of extracting features from images and deep learning methods such as convolutional neural networks. The performance of the hole-finding algorithm is measured using …
-
An interactive design rule checker for integrated circuit layout
… rule checking on a design which contains global rectangles. Using these three options, very efficient hierarchical checking can be performed.
-
Nonconvex optimization algorithm with a new Bi-criteria selection of potential simplices using an estimate of Lipschitz constant /
In this thesis, Direct (DIviding RECTangles) type algorithms based on Lipschitz objective function models with unknown Lipschitz constant, which are often applied for practical black-box optimization problems, are considered. The main goal of this thesis is set - to propose a global optimization …
-
Neiškiliojo optimizavimo algoritmas su nauju bikriteriniu potencialiųjų simpleksų išrinkimu naudojant Lipšico konstantos įvertį /
In this thesis, Direct (DIviding RECTangles) type algorithms based on Lipschitz objective function models with unknown Lipschitz constant, which are often applied for practical black-box optimization problems, are considered. The main goal of this thesis is set - to propose a global optimization …
Page 1 of 3