466 resultados para Parameterized polygons
Resumo:
Subgrid processes occur in various ecosystems and landscapes but, because of their small scale, they are not represented or poorly parameterized in climate models. These local heterogeneities are often important or even fundamental for energy and carbon balances. This is especially true for northern peatlands and in particular for the polygonal tundra, where methane emissions are strongly influenced by spatial soil heterogeneities. We present a stochastic model for the surface topography of polygonal tundra using Poisson-Voronoi diagrams and we compare the results with available recent field studies. We analyze seasonal dynamics of water table variations and the landscape response under different scenarios of precipitation income. We upscale methane fluxes by using a simple idealized model for methane emission. Hydraulic interconnectivities and large-scale drainage may also be investigated through percolation properties and thresholds in the Voronoi graph. The model captures the main statistical characteristics of the landscape topography, such as polygon area and surface properties as well as the water balance. This approach enables us to statistically relate large-scale properties of the system to the main small-scale processes within the single polygons.
Resumo:
During Cruise 46 of R/V Akademik Mstislav Keldysh (from June to September 2001), vertical distributions of Radiolaria (Acantharia - Bac and Euradiolaria - Beur), mesozooplankton (from 0.2 to 3.0 mm size, Bm), and chlorophyll a (Cchl) in the epipelagic zone of the North Atlantic were studied. To examine the above-listed characteristics, samples were taken by Niskin 30 l bottles from 12-16 depth levels within the upper 100 to 200 m layer in the subarctic (48°11'N, 16°06'W) and subtropical (27°31'N, 75°51'W) waters, as well as in the transitional zone (41°44'N, 49°57'W). The latter proved to be characterized by the highest values of all averaged parameters examined by us within the upper 100 m layer (Bm - 365mg/m**3, Bac - 140 mg/m**3, Beur - 0.37 mg/m**3, and Cchl - 0.32 mg/m**3). For subarctic and subtropical waters corresponding characteristics were as follows: Bm - 123 and 53 mg/m**3, Bac - 0 and 0.06 mg/m**3, Beur - 0.17 and 0.19 mg/m**3, and Cchl - 0.27 and 0.05 mg/m**3, respectively. Percentage of Acantharia in total biomass of Radiolaria and zooplankton ranged from 0 to 39%, whereas that of Euradiolaria varied from 0.01 to 0.36%. Depth levels with maximum abundance of Acantharia were located above maxima of zooplankton and chlorophyll a or coincided with them. As for Euradiolaria, vertical profiles of their biomass were more diverse as compared with Acantharia. The latter group preferred more illuminated depth levels for its maximum development (10-100% of surface irradiance, E0) with respect to Euradiolaria (1-60% of E0). Possible reasons for this difference are discussed.
Resumo:
In this paper the hardware implementation of an inner hair cell model is presented. Main features of the design are the use of Meddis’ transduction structure and the methodology for Design with Reusability. Which allows future migration to new hardware and design refinements for speech processing and custom-made hearing aids
Resumo:
Regional variations in abundance, morphology, and chemical composition of Fe-Mn nodules have a zonal character. Due to circumcontinental zonality of terrigenous sedimentation the main mass of the nodules occurs in the pelagic part of the ocean, in areas of minimal sedimentation rates. In spatial variations in morphology and chemical composition of the nodules the latitudinal zonality is very clear and associated with latitudinal changes in facial conditions of sedimentation. Elevated contents of Mn, Ni, and Cu and of Mn/Fe ratio occur in nodules from the radiolarian belt. Changes of chemical composition of the nodules with depth (vertical zonality of mineralization) are confirmed. Local variations in abundance, morphology and chemical composition of the nodules are caused by ruggedness of relief and depth variations, variations in sedimentation rate, age of ore formation, intensity of diagenetic redistribution of metals.
Resumo:
We consider the problems of finding two optimal triangulations of a convex polygon: MaxMin area and MinMax area. These are the triangulations that maximize the area of the smallest area triangle in a triangulation, and respectively minimize the area of the largest area triangle in a triangulation, over all possible triangulations. The problem was originally solved by Klincsek by dynamic programming in cubic time [2]. Later, Keil and Vassilev devised an algorithm that runs in O(n^2 log n) time [1]. In this paper we describe new geometric findings on the structure of MaxMin and MinMax Area triangulations of convex polygons in two dimensions and their algorithmic implications. We improve the algorithm’s running time to quadratic for large classes of convex polygons. We also present experimental results on MaxMin area triangulation.
Resumo:
In non-linear random effects some attention has been very recently devoted to the analysis ofsuitable transformation of the response variables separately (Taylor 1996) or not (Oberg and Davidian 2000) from the transformations of the covariates and, as far as we know, no investigation has been carried out on the choice of link function in such models. In our study we consider the use of a random effect model when a parameterized family of links (Aranda-Ordaz 1981, Prentice 1996, Pregibon 1980, Stukel 1988 and Czado 1997) is introduced. We point out the advantages and the drawbacks associated with the choice of this data-driven kind of modeling. Difficulties in the interpretation of regression parameters, and therefore in understanding the influence of covariates, as well as problems related to loss of efficiency of estimates and overfitting, are discussed. A case study on radiotherapy usage in breast cancer treatment is discussed.
Resumo:
Otto-von-Guericke-Universität Magdeburg, Fakultät für Mathematik, Dissertation, 2016
Resumo:
We say that a polygon inscribed in the circle is asymmetric if it contains no two antipodal points being the endpoints of a diameter. Given n diameters of a circle and a positive integer k < n, this paper addresses the problem of computing a maximum area asymmetric k-gon having as vertices k < n endpoints of the given diameters. The study of this type of polygons is motivated by ethnomusiciological applications.
Resumo:
This paper focuses on a variation of the Art Gallery problem that considers open-edge guards and open mobile-guards. A mobile guard can be placed on edges and diagonals of a polygon, and the ‘open’ prefix means that the endpoints of such an edge or diagonal are not taken into account for visibility purposes. This paper studies the number of guards that are sufficient and sometimes necessary to guard some classes of simple polygons for both open-edge and open mobile-guards. A wide range of polygons is studied, which include orthogonal polygons with or without holes, spirals, orthogonal spirals and monotone polygons. Moreover, this problem is also considered for planar triangulation graphs using open-edge guards.
Resumo:
In a paper by Biro et al. [7], a novel twist on guarding in art galleries is introduced. A beacon is a fixed point with an attraction pull that can move points within the polygon. Points move greedily to monotonically decrease their Euclidean distance to the beacon by moving straight towards the beacon or sliding on the edges of the polygon. The beacon attracts a point if the point eventually reaches the beacon. Unlike most variations of the art gallery problem, the beacon attraction has the intriguing property of being asymmetric, leading to separate definitions of attraction region and inverse attraction region. The attraction region of a beacon is the set of points that it attracts. For a given point in the polygon, the inverse attraction region is the set of beacon locations that can attract the point. We first study the characteristics of beacon attraction. We consider the quality of a "successful" beacon attraction and provide an upper bound of $\sqrt{2}$ on the ratio between the length of the beacon trajectory and the length of the geodesic distance in a simple polygon. In addition, we provide an example of a polygon with holes in which this ratio is unbounded. Next we consider the problem of computing the shortest beacon watchtower in a polygonal terrain and present an $O(n \log n)$ time algorithm to solve this problem. In doing this, we introduce $O(n \log n)$ time algorithms to compute the beacon kernel and the inverse beacon kernel in a monotone polygon. We also prove that $\Omega(n \log n)$ time is a lower bound for computing the beacon kernel of a monotone polygon. Finally, we study the inverse attraction region of a point in a simple polygon. We present algorithms to efficiently compute the inverse attraction region of a point for simple, monotone, and terrain polygons with respective time complexities $O(n^2)$, $O(n \log n)$ and $O(n)$. We show that the inverse attraction region of a point in a simple polygon has linear complexity and the problem of computing the inverse attraction region has a lower bound of $\Omega(n \log n)$ in monotone polygons and consequently in simple polygons.