By the name HALFSPACE SYSTEMS, this dissertation refers to systems whose dynamics are modeled by linear constraints of the form Exk+1 <= Fxk + Buk (where E, F 2 andlt;mn, B 2 andlt;mp). This dissertation explores the concepts of BOUNDEDNESS, STABILITY, IRREDUNDANCY, and MAINTAINABILITY (which is the same as REACHABILITY OF A TARGET TUBE) that are related to the control of halfspace systems. Given that a halfspace system is bounded, and that a given static target tube is reachable for this system, this dissertation presents algorithms to MAINTAIN the system in this target tube. A DIFFERENCE INCLUSION has the form xk+1 = Axk + Buuk, where xk, xk+1 2 andlt;n, uk 2 andlt;p, A 2 andlt;nn, Bu 2 andlt;np, Ai 2 andlt;nn, Bj 2 andlt;np, and A and Bu belong to the convex hulls of (A1,A2, . . . ,Aq) and (B1, B2, . . . , Br) respectively. This dissertation investigates the possibility that halfspace systems have equivalent difference inclusion representation for the case of uk = 0. An affirmitive result in this direction may make it possible to apply to halfspace systems the control theory that exists for difference inclusions.

The close proximity of the Nicoya Peninsula to the Cocos-Caribbean Subduction zone plate boundary makes it a prime location to use GPS to study episodic tremor and slip. Nicoya Peninsula currently has operating networks of both continuous GPS (CGPS) and seismic stations designed to identify and characterize the pattern of episodic tremor and slip (ETS) events along the seismogenic zone under Costa Rica's Pacific Margin. The occurrence of slow slip events has been previously postulated in this region based on correlated fluid flow and seismic tremor events recorded near the margin wedge in 2000 and from sparse GPS observations in 2003. Paucity of data prevented details of these events from being resolved. In May 2007 a slow slip event was recorded on our densified GPS network. This slow slip event was also accompanied by seismic tremor, worked up by colleagues at the University of California - San Diego. I will present the GPS time series, correlated with the seismic tremor for the event in May 2007. I will also present the inferred pattern of slip on the plate interface from elastic half space inversion modeling compared with the tremor and Low Frequency Earthquake (LFE) locations. The geodetic slip and seismic tremor co-locate temporally very well. Spatially the seismic tremor and LFE locations are offset but not independent of both the up dip and down dip patches of geodetic slip. The identification of these slow slip events enhances our understanding of the nuances of the interseismic period. Previous studies of the interseismic strain accumulation patterns in the region of the Nicoya Peninsula have not accounted for the occurrence of slow slip, thus underestimating the magnitude of locking on the fault plane. My study resolves this bias by using our CGPS network to estimate the interseismic surface velocity field, accounting for the May 2007 slow slip event. I will present the results of this velocity field estimation and the results of inversions for locking patterns on the fault plane. My study has also elucidated a potential temporal variability in the locking pattern on the fault plane beneath Nicoya.

No description available.

In this thesis, we introduce a concept of directional quantile envelopes, the intersection of the halfspaces determined by directional quantiles, and show that they allow for explicit probabilistic interpretation, compared to other multivariate quantile concepts. Directional quantile envelopes provide a way to perform multivariate quantile regression: to ``regress contours'' on covariates. We also develop theory and algorithms for an important application of multivariate quantile regression in biometry: bivariate growth charts. We prove that directional quantiles are continuous and derive their closed-form expression for elliptically symmetric distributions. We provide probabilistic interpretations of directional quantile envelopes and establish that directional quantile envelopes are essentially halfspace depth contours. We show that distributions with smooth directional quantile envelopes are uniquely determined by their envelopes. We describe an estimation scheme of directional quantile envelopes and prove its affine equivariance. We establish the consistency of the estimates of directional quantile envelopes and describe their accuracy. The results are applied to estimation of bivariate extreme quantiles. One of the main contributions of this thesis is the construction of bivariate growth charts, an important application of multivariate quantile regression. We discuss the computation of our multivariate quantile regression by developing a fast elimination algorithm. The algorithm constructs the set of active halfspaces to form a directional quantile envelope. Applying this algorithm to a large number of quantile halfspaces, we can construct an arbitrary exact approximation of the direction quantile envelope. In the remainder of the thesis, we exhibit the connection between depth contours and directional regression quantiles (Laine, 2001), stated without proof in Koenker (2005). Our proof uses the duality theory of primal-dual linear programming. Aiming at interpreting halfspace depth contours, we explore their properties for empirical distributions, absolutely continuous distributions and certain general distributions. Finally, we propose a generalized quantile concept, depth quantile, inspired by halfspace depth (Tukey, 1975) and regression depth (Rousseeuw and Hubert, 1999). We study its properties in various data-analytic situations: multivariate and univariate locations, regression with and without intercept. In the end, we show an example that while the quantile regression of Koenker and Bassett (1978) fails, our concept provides sensible answers. / Statistics

Submitted by ANA KARLA PEREIRA RODRIGUES (anakarla_@hotmail.com) on 2017-09-01T13:15:28Z No. of bitstreams: 1 arquivototal.pdf: 612605 bytes, checksum: 21376fa219dbfadac44b0c5d02d91cd3 (MD5) / Approved for entry into archive by Viviane Lima da Cunha (viviane@biblioteca.ufpb.br) on 2017-09-01T15:55:26Z (GMT) No. of bitstreams: 1 arquivototal.pdf: 612605 bytes, checksum: 21376fa219dbfadac44b0c5d02d91cd3 (MD5) / Made available in DSpace on 2017-09-01T15:55:26Z (GMT). No. of bitstreams: 1 arquivototal.pdf: 612605 bytes, checksum: 21376fa219dbfadac44b0c5d02d91cd3 (MD5) Previous issue date: 2017-03-20 / Conselho Nacional de Pesquisa e Desenvolvimento Científico e Tecnológico - CNPq / In this work we detail the results submitted by Ho man and Meeks in \The strong half-space theorem for minimal surfaces". The rst results are half-space theorems for minimal surfaces in R3 which have been generalized for other ambients, as have been done by Daniel, B./ Hauswirth, L., e Daniel, B./ Meeks, W. H. III. The third and last one result, caracterize convex hull in n- dimensional Euclidean spaces. / Neste trabalho detalhamos os resultados apresentados por William H. Meeks e David A. Ho man em \The strong half-space theorem for minimal surfaces", . Os primeiros resultados s~ao teoremas de semiespa co para superf cies m nimas no R3, os quais tem sido generalizados para outros ambientes como foi feito por Daniel, B./ Hauswirth, L., e Daniel, B./ Meeks, W. H. III. O terceiro e ultimo resultado, caracteriza fechos convexos no espa co euclidiano n-dimensional.

This thesis focuses on range searching data structures, an elementary problem in computational geometry with research spanning decades. These problems often involve very large data sets. Processor speeds increase faster than memory speeds, thus the gap between the rate at which CPUs can process data and the rate at which it can be retrieved is increasing. To bridge this gap, various levels of cache are used. Since cache misses are costly, algorithms should be cache-friendly. The input-output (I/O) model was the first model for constructing cache-efficient algorithms, focusing on a two-level memory hierarchy. Algorithms for this model require manual tuning to determine optimal values for hardware dependent parameters, and are only optimal at a single level of a memory hierarchy. Cache-oblivious (CO) algorithms are built without knowledge of the hierarchy, allowing them to be optimal across all levels at once. There exist strong theoretical and practical results for I/O-efficient range searching. Recently, the CO model has received attention, but range searching remains poorly understood. This thesis explores data structures for CO range counting and reporting. It presents the first space and worst-case query-time optimal approximate range counting structure for a family of related problems, and associated O(N log N)-space query-optimal reporting structures. The approximate counting structure is the first of its kind in internal memory, I/O and CO models. Researchers have been trying to create linear-space query-optimal CO reporting structures. This thesis shows that for a variety of problems, linear space is in fact impossible. Heuristics are also used for building cache-friendly algorithms. Space-filling curves are continuous functions mapping multi-dimensional sets into one-dimensional ones. They are used to build search structures in the hopes that objects that were close in the original space remain close in the resulting ordering. This results in queries incurring fewer page swaps when traversing the structure. The Hilbert curve is notably good at this, but often imposes a space or time penalty. This thesis introduces compact Hilbert indices, which remove the ineffiency inherent for input point sets with bounding boxes smaller than their bounding hypercubes.

Orientador: Lucas Catão de Freitas Ferreira / Tese (doutorado) - Universidade Estadual de Campinas, Instituto de Matemática Estatística e Computação Científica / Made available in DSpace on 2018-08-27T04:26:31Z (GMT). No. of bitstreams: 1 CastanedaCenturion_NestorFelipe_D.pdf: 1063498 bytes, checksum: bbaaad01ffead1389f469e88505aada5 (MD5) Previous issue date: 2015 / Resumo: Por apresentar basicamente fórmulas, o Resumo, na íntegra, poderá ser visualizado no texto completo da tese digital / Abstract: The complete Abstract is available with the full electronic document / Doutorado / Matematica / Doutor em Matemática