Estimation and Forecasting in Vector Autoregressive Moving Average Models for Rich Datasets
DEFF Research Database (Denmark)
Dias, Gustavo Fruet; Kapetanios, George
We address the issue of modelling and forecasting macroeconomic variables using rich datasets, by adopting the class of Vector Autoregressive Moving Average (VARMA) models. We overcome the estimation issue that arises with this class of models by implementing an iterative ordinary least squares (...
Vector Nonlinear Time-Series Analysis of Gamma-Ray Burst Datasets on Heterogeneous Clusters
Directory of Open Access Journals (Sweden)
Ioana Banicescu
2005-01-01
Full Text Available The simultaneous analysis of a number of related datasets using a single statistical model is an important problem in statistical computing. A parameterized statistical model is to be fitted on multiple datasets and tested for goodness of fit within a fixed analytical framework. Definitive conclusions are hopefully achieved by analyzing the datasets together. This paper proposes a strategy for the efficient execution of this type of analysis on heterogeneous clusters. Based on partitioning processors into groups for efficient communications and a dynamic loop scheduling approach for load balancing, the strategy addresses the variability of the computational loads of the datasets, as well as the unpredictable irregularities of the cluster environment. Results from preliminary tests of using this strategy to fit gamma-ray burst time profiles with vector functional coefficient autoregressive models on 64 processors of a general purpose Linux cluster demonstrate the effectiveness of the strategy.
New fuzzy support vector machine for the class imbalance problem in medical datasets classification.
Gu, Xiaoqing; Ni, Tongguang; Wang, Hongyuan
2014-01-01
In medical datasets classification, support vector machine (SVM) is considered to be one of the most successful methods. However, most of the real-world medical datasets usually contain some outliers/noise and data often have class imbalance problems. In this paper, a fuzzy support machine (FSVM) for the class imbalance problem (called FSVM-CIP) is presented, which can be seen as a modified class of FSVM by extending manifold regularization and assigning two misclassification costs for two classes. The proposed FSVM-CIP can be used to handle the class imbalance problem in the presence of outliers/noise, and enhance the locality maximum margin. Five real-world medical datasets, breast, heart, hepatitis, BUPA liver, and pima diabetes, from the UCI medical database are employed to illustrate the method presented in this paper. Experimental results on these datasets show the outperformed or comparable effectiveness of FSVM-CIP.
New Fuzzy Support Vector Machine for the Class Imbalance Problem in Medical Datasets Classification
Directory of Open Access Journals (Sweden)
Xiaoqing Gu
2014-01-01
Full Text Available In medical datasets classification, support vector machine (SVM is considered to be one of the most successful methods. However, most of the real-world medical datasets usually contain some outliers/noise and data often have class imbalance problems. In this paper, a fuzzy support machine (FSVM for the class imbalance problem (called FSVM-CIP is presented, which can be seen as a modified class of FSVM by extending manifold regularization and assigning two misclassification costs for two classes. The proposed FSVM-CIP can be used to handle the class imbalance problem in the presence of outliers/noise, and enhance the locality maximum margin. Five real-world medical datasets, breast, heart, hepatitis, BUPA liver, and pima diabetes, from the UCI medical database are employed to illustrate the method presented in this paper. Experimental results on these datasets show the outperformed or comparable effectiveness of FSVM-CIP.
Alabama ESI: FISH (Fish Polygons)
National Oceanic and Atmospheric Administration, Department of Commerce — This data set contains sensitive biological resource data for marine, estuarine, and freshwater fish species in Alabama. Vector polygons in this data set represent...
Maryland ESI: FISH (Fish Polygons)
National Oceanic and Atmospheric Administration, Department of Commerce — This data set contains sensitive biological resource data for marine, estuarine, anadromous, and freshwater fish species in Maryland. Vector polygons in this data...
Hawaii ESI: FISH (Fish Polygons)
National Oceanic and Atmospheric Administration, Department of Commerce — This data set contains sensitive biological resource data for reef, marine, estuarine, and native stream fish species in coastal Hawaii. Vector polygons in this data...
Hawaii ESI: INDEX (Index Polygons)
National Oceanic and Atmospheric Administration, Department of Commerce — This data set contains vector polygons representing the boundaries of the U.S. Geological Survey 1:24,000 topographic maps and other map and digital data boundaries...
Alabama ESI: REPTILES (Reptile Polygons)
National Oceanic and Atmospheric Administration, Department of Commerce — This data set contains sensitive biological resource data for threatened/endangered and rare reptiles in Alabama. Vector polygons in this data set represent the rare...
Alabama ESI: INVERT (Invertebrate Polygons)
National Oceanic and Atmospheric Administration, Department of Commerce — This data set contains sensitive biological resource data for marine and estuarine invertebrate species in Alabama. Vector polygons in this data set represent...
Virginia ESI: INVERT (Invertebrate Polygons)
National Oceanic and Atmospheric Administration, Department of Commerce — This data set contains sensitive biological resource data for marine, estuarine, and rare invertebrate species in Virginia. Vector polygons in this data set...
Virginia ESI: INDEX (Index Polygons)
National Oceanic and Atmospheric Administration, Department of Commerce — This data set contains vector polygons representing the boundaries of all hardcopy cartographic products produced as part of the Environmental Sensitivity Index...
Louisiana ESI: BIRDS (Bird Polygons)
National Oceanic and Atmospheric Administration, Department of Commerce — This data set contains sensitive biological resource data for waterfowl species and shorebirds in coastal Louisiana. Vector polygons in this data set represent...
Virginia ESI: FISH (Fish Polygons)
National Oceanic and Atmospheric Administration, Department of Commerce — This data set contains sensitive biological resource data for marine, estuarine, anadromous, and brackishwater fish species in Virginia. Vector polygons in this data...
Louisiana ESI: FISH (Fish Polygons)
National Oceanic and Atmospheric Administration, Department of Commerce — This data set contains sensitive biological resource data for freshwater (inland) fish species in coastal Louisiana. Vector polygons represent water-bodies and other...
2004-01-01
16 January 2004 Looking somewhat like a roadmap, this 3 km (1.9 mi) wide view of a cratered plain in the martian south polar region shows a plethora of cracks that form polygonal patterns. This Mars Global Surveyor (MGS) Mars Orbiter Camera (MOC) image is located near 78.9oS, 357.3oW. Polygons such as these, where they are found on Earth, would be indicators of the presence of subsurface ice. Whether the same is true for Mars is uncertain. What is certain is that modern, seasonal frost on the surface enhances the appearance of the polygons as the frost persists longer in the cracks than on adjacent plains. This southern springtime image is illuminated by sunlight from the upper left.
2005-01-01
18 August 2005 This Mars Global Surveyor (MGS) Mars Orbiter Camera (MOC) image shows dark-outlined polygons on a frost-covered surface in the south polar region of Mars. In summer, this surface would not be bright and the polygons would not have dark outlines--these are a product of the presence of seasonal frost. Location near: 77.2oS, 204.8oW Image width: width: 3 km (1.9 mi) Illumination from: upper left Season: Southern Spring
Maldeghem, Hendrik
1998-01-01
This book is intended to be an introduction to the fascinating theory ofgeneralized polygons for both the graduate student and the specialized researcher in the field. It gathers together a lot of basic properties (some of which are usually referred to in research papers as belonging to folklore) and very recent and sometimes deep results. I have chosen a fairly strict geometrical approach, which requires some knowledge of basic projective geometry. Yet, it enables one to prove some typically group-theoretical results such as the determination of the automorphism groups of certain Moufang polygons. As such, some basic group-theoretical knowledge is required of the reader. The notion of a generalized polygon is a relatively recent one. But it is one of the most important concepts in incidence geometry. Generalized polygons are the building bricks of Tits buildings. They are the prototypes and precursors of more general geometries such as partial geometries, partial quadrangles, semi-partial ge ometries, near...
Van Maldeghem, Hendrik
1998-01-01
Generalized Polygons is the first book to cover, in a coherent manner, the theory of polygons from scratch. In particular, it fills elementary gaps in the literature and gives an up-to-date account of current research in this area, including most proofs, which are often unified and streamlined in comparison to the versions generally known. Generalized Polygons will be welcomed both by the student seeking an introduction to the subject as well as the researcher who will value the work as a reference. In particular, it will be of great value for specialists working in the field of generalized polygons (which are, incidentally, the rank 2 Tits-buildings) or in fields directly related to Tits-buildings, incidence geometry and finite geometry. The approach taken in the book is of geometric nature, but algebraic results are included and proven (in a geometric way!). A noteworthy feature is that the book unifies and generalizes notions, definitions and results that exist for quadrangles, hexagons, octagons - in the ...
Directory of Open Access Journals (Sweden)
Mustafa Serter Uzer
2013-01-01
Full Text Available This paper offers a hybrid approach that uses the artificial bee colony (ABC algorithm for feature selection and support vector machines for classification. The purpose of this paper is to test the effect of elimination of the unimportant and obsolete features of the datasets on the success of the classification, using the SVM classifier. The developed approach conventionally used in liver diseases and diabetes diagnostics, which are commonly observed and reduce the quality of life, is developed. For the diagnosis of these diseases, hepatitis, liver disorders and diabetes datasets from the UCI database were used, and the proposed system reached a classification accuracies of 94.92%, 74.81%, and 79.29%, respectively. For these datasets, the classification accuracies were obtained by the help of the 10-fold cross-validation method. The results show that the performance of the method is highly successful compared to other results attained and seems very promising for pattern recognition applications.
Federal Geographic Data Committee — The SMA implementation is comprised of one feature dataset, with several polygon feature classes, rather than a single feature class. SurfaceManagementAgency: The...
International Nuclear Information System (INIS)
2000-01-01
In Russian, ''The Polygon'' stands for a nuclear test site of 19.000 square kilometers in Kazakhstan, used by the former Soviet Union for hundreds of nuclear tests from 1947 to 1991. This film looks at the legacy of what was once a top secret area, now abandoned, but still sparsely populated, and at the work to be done to detect and map the areas of elevated radiation levels
Columbia River ESI: INVERT (Invertebrate Polygons)
National Oceanic and Atmospheric Administration, Department of Commerce — This data set contains sensitive biological resource data for clams, oysters, crabs, and other invertebrate species in Columbia River. Vector polygons in this data...
Louisiana ESI: REPTILES (Reptile and Amphibian Polygons)
National Oceanic and Atmospheric Administration, Department of Commerce — This data set contains sensitive biological resource data for reptiles and amphibians in coastal Louisiana. Vector polygons represent reptile and amphibian habitats,...
Western Alaska ESI: BIOINDEX (Biological Index Polygons)
National Oceanic and Atmospheric Administration, Department of Commerce — This data set contains vector polygons representing the boundaries of the 1:250,000 map boundaries used in the creation of the Environmental Sensitivity Index (ESI)...
Western Alaska ESI: INDEX (Index Polygons)
National Oceanic and Atmospheric Administration, Department of Commerce — This data set contains vector polygons representing the boundaries of all the hardcopy cartographic products produced as part of the Environmental Sensitivity Index...
Columbia River ESI: FISH (Fish Polygons)
National Oceanic and Atmospheric Administration, Department of Commerce — This data set contains sensitive biological resource data for marine, estuarine, anadromous, and freshwater fish species in Columbia River. Vector polygons in this...
Western Alaska ESI: LAKES (Lake Polygons)
National Oceanic and Atmospheric Administration, Department of Commerce — This data set contains vector polygons representing lakes and land masses used in the creation of the Environmental Sensitivity Index (ESI) for Western Alaska. The...
Western Alaska ESI: HYDRO (Land Mass Polygons)
National Oceanic and Atmospheric Administration, Department of Commerce — This data set contains vector polygons representing coastal hydrography that defines the primary land masses used in the creation of the Environmental Sensitivity...
Southeast Alaska ESI: BIRDS (Bird Polygons)
National Oceanic and Atmospheric Administration, Department of Commerce — This data set contains biological resource data for waterfowl in Southeast Alaska. Vector polygons in this data set represent locations of foraging and rafting...
Southeast Alaska ESI: MGT (Management Area Polygons)
National Oceanic and Atmospheric Administration, Department of Commerce — This data set contains management area data for National Parks, Wildlife Refuges, and areas designated as Critical Habitat in Southeast Alaska. Vector polygons in...
Western Alaska ESI: MGT (Management Area Polygons)
National Oceanic and Atmospheric Administration, Department of Commerce — This data set contains management area data for Designated Critical Habitats, Wildlife Refuges, Wild and Scenic Rivers, and State Parks. Vector polygons in this data...
Hawaii ESI: REPTILES (Reptile and Amphibian Polygons)
National Oceanic and Atmospheric Administration, Department of Commerce — This data set contains sensitive biological resource data for threatened/endangered sea turtles in coastal Hawaii. Vector polygons in this data set represent sea...
Virginia ESI: MGT (Management Area Polygons)
National Oceanic and Atmospheric Administration, Department of Commerce — This data set contains boundaries for management areas, national parks, state and local parks, and wildlife refuges in Virginia. Vector polygons in this data set...
Western Alaska ESI: FISH (Fish Polygons)
National Oceanic and Atmospheric Administration, Department of Commerce — This data set contains sensitive biological resource data for marine, estuarine, and anadromous fish species in Western Alaska. Vector polygons in this data set...
Columbia River ESI: MGT (Management Area Polygons)
National Oceanic and Atmospheric Administration, Department of Commerce — This data set contains sensitive human-use data for Wildlife Refuges, National Forests, and State Parks for the Columbia River area. Vector polygons in this data set...
Louisiana ESI: MGT (Management Area Polygons)
National Oceanic and Atmospheric Administration, Department of Commerce — This data set contains boundaries for managed lands in coastal Louisiana. Vector polygons in this data set represent the management areas. Location-specific type and...
Louisiana ESI: PARISH (Parish Management Area Polygons)
National Oceanic and Atmospheric Administration, Department of Commerce — This data set contains boundaries for parishes in coastal Louisiana. Vector polygons in this data set represent parish management areas. Location-specific type and...
Virginia ESI: HYDRO (Hydrography Lines and Polygons)
National Oceanic and Atmospheric Administration, Department of Commerce — This data set contains vector lines and polygons representing coastal hydrography used in the creation of the Environmental Sensitivity Index (ESI) for Virginia. The...
Southeast Alaska ESI: FISH (Fish Polygons)
National Oceanic and Atmospheric Administration, Department of Commerce — This data set contains biological resource data for estuarine, benthic, and pelagic fish in Southeast Alaska. Vector polygons in this data set represent locations of...
Andrade de Araújo, Hallysson Douglas; Dos Santos Silva, Luanna Ribeiro; de Siqueira, Williams Nascimento; Martins da Fonseca, Caíque Silveira; da Silva, Nicácio Henrique; de Albuquerque Melo, Ana Maria Mendonça; Barroso Martins, Mônica Cristina; de Menezes Lima, Vera Lúcia
2018-04-01
This text presents complementary data corresponding to schistosomiasis mansoni's vector control and enviromental toxicity using usnic acid. These informations support our research article "Toxicity of Usnic Acid from Cladonia substellata (Lichen) to embryos and adults of Biomphalaria glabrata " by Araújo et al. [1], and focuses on the analysis of the detailed data regarding the different concentrations of Usnic Acid and their efficiency to B. glabrata mortality and non-viability, as also to environmental toxicity, evaluated by A. salina mortality.
Directory of Open Access Journals (Sweden)
adi sucipto
2017-09-01
Full Text Available There are many types of investments that can be used to generate income, such as in the form of land, houses, gold, precious metals etc., there are also in the form of financial assets such as stocks, mutual funds, bonds and money markets or capital markets. One of the investments that attract enough attention today is the capital market investment. The purpose of this study is to predict and improve the accuracy of foreign exchange rates on forex business by using the Support Vector Machine model as a model for predicting and using more data sets compared with previous research that is as many as 1558 dataset. This study uses currency exchange rate data obtained from PT. Best Profit Future Cab. Surabaya is already in the form of data consisting of open, high, low, close attributes by using the current data of Euro currency exchange rate to USA Dollar with period every 1 minutes from May 12, 2016 at 09.51 until 13 May 2016 at 12:30 As much as 1689 dataset, After conducting research using Support Vector Machine model with kernel trick method to predict Forex using current data of Euro exchange rate to USA Dollar with period every 1 minutes from May 12, 2016 at 09.51 until 13 May 2016 at 12:30 as much as 1689 The dataset yielded a considerable prediction accuracy of 97.86%, with this considerable accuracy indicating that the movement of the Euro currency exchange rate to the USA Dollar on May 12 to May 13, 2016 can be predicted precisely.
Lu, Yanyan; Lien, Jyh-Ming; Ghosh, Mukulika; Amato, Nancy M.
2012-01-01
Decomposing a shape into visually meaningful parts comes naturally to humans, but recreating this fundamental operation in computers has been shown to be difficult. Similar challenges have puzzled researchers in shape reconstruction for decades. In this paper, we recognize the strong connection between shape reconstruction and shape decomposition at a fundamental level and propose a method called α-decomposition. The α-decomposition generates a space of decompositions parameterized by α, the diameter of a circle convolved with the input polygon. As we vary the value of α, some structural features appear and disappear quickly while others persist. Therefore, by analyzing the persistence of the features, we can determine better decompositions that are more robust to both geometrical and topological noises. © 2012 Elsevier Ltd. All rights reserved.
Lu, Yanyan
2012-08-01
Decomposing a shape into visually meaningful parts comes naturally to humans, but recreating this fundamental operation in computers has been shown to be difficult. Similar challenges have puzzled researchers in shape reconstruction for decades. In this paper, we recognize the strong connection between shape reconstruction and shape decomposition at a fundamental level and propose a method called α-decomposition. The α-decomposition generates a space of decompositions parameterized by α, the diameter of a circle convolved with the input polygon. As we vary the value of α, some structural features appear and disappear quickly while others persist. Therefore, by analyzing the persistence of the features, we can determine better decompositions that are more robust to both geometrical and topological noises. © 2012 Elsevier Ltd. All rights reserved.
Scott, Paul
2006-01-01
A "convex" polygon is one with no re-entrant angles. Alternatively one can use the standard convexity definition, asserting that for any two points of the convex polygon, the line segment joining them is contained completely within the polygon. In this article, the author provides a solution to a problem involving convex lattice polygons.
Stephenson, Paul
2009-01-01
In order to find its circumference, Archimedes famously boxed the circle between two polygons. Ending the first of a series of articles (MT179) with an aside, Francis Lopez-Real reverses the situation to ask: Which polygons can be boxed between two circles? (The official term for such polygons is "bicentric".) The sides of these polygons are…
Miladinovich, D.; Datta-Barua, S.; Bust, G. S.; Ramirez, U.
2017-12-01
Understanding physical processes during storm time in the ionosphere-thermosphere (IT) system is limited, in part, due to the inability to obtain accurate estimates of IT states on a global scale. One reason for this inability is the sparsity of spatially distributed high quality data sets. Data assimilation is showing promise toward enabling global estimates by blending high quality observational data sets with established climate models. We are continuing development of an algorithm called Estimating Model Parameters for Ionospheric Reverse Engineering (EMPIRE) to enable assimilation of global datasets for storm time estimates of IT drivers. EMPIRE is a data assimilation algorithm that uses a Kalman filtering routine to ingest model and observational data. The EMPIRE algorithm is based on spherical harmonics which provide a spherically symmetric, smooth, continuous, and orthonormal set of basis functions suitable for a spherical domain such as Earth's IT region (200-600 km altitude). Once the basis function coefficients are determined, the newly fitted function represents the disagreement between observational measurements and models. We apply spherical harmonics to study the March 17, 2015 storm. Data sources include Fabry-Perot interferometer neutral wind measurements and global Ionospheric Data Assimilation 4 Dimensional (IDA4D) assimilated total electron content (TEC). Models include Weimer 2000 electric potential, International Geomagnetic Reference Field (IGRF) magnetic field, and Horizontal Wind Model 2014 (HWM14) neutral winds. We present the EMPIRE assimilation results of Earth's electric potential and thermospheric winds. We also compare EMPIRE storm time E cross B ion drift estimates to measured drifts produced from the Super Dual Auroral Radar Network (SuperDARN) and Active Magnetosphere and Planetary Electrodynamics Response Experiment (AMPERE) measurement datasets. The analysis from these results will enable the generation of globally assimilated
Colleu , Thomas; Morin , Luce; Pateux , Stéphane; Labit , Claude
2011-01-01
International audience; This paper presents a new representation called floating polygon soup for applications like 3DTV and FTV (Free Viewpoint Television). This representation is based on 3D polygons and takes as input MVD data. It extends the previously proposed polygon soup representation which is appropriate for both compression, transmission and rendering stages. The floating polygon soup conserves these advantages while also taking into account misalignments at the view synthesis stage...
Scott, Paul
2006-01-01
A lattice is a (rectangular) grid of points, usually pictured as occurring at the intersections of two orthogonal sets of parallel, equally spaced lines. Polygons that have lattice points as vertices are called lattice polygons. It is clear that lattice polygons come in various shapes and sizes. A very small lattice triangle may cover just 3…
Aichholzer, Oswin; Aurenhammer, Franz; Hurtado Díaz, Fernando Alfredo; Ramos, Pedro A.; Urrutia, J.
2009-01-01
We introduce a notion of k-convexity and explore some properties of polygons that have this property. In particular, 2-convex polygons can be recognized in O(n log n) time, and k-convex polygons can be triangulated in O(kn) time.
Ergodicity of polygonal slap maps
International Nuclear Information System (INIS)
Del Magno, Gianluigi; Pedro Gaivão, José; Lopes Dias, João; Duarte, Pedro
2014-01-01
Polygonal slap maps are piecewise affine expanding maps of the interval obtained by projecting the sides of a polygon along their normals onto the perimeter of the polygon. These maps arise in the study of polygonal billiards with non-specular reflection laws. We study the absolutely continuous invariant probabilities (acips) of the slap maps for several polygons, including regular polygons and triangles. We also present a general method for constructing polygons with slap maps with more than one ergodic acip. (paper)
Knotting in stretched polygons
International Nuclear Information System (INIS)
Rensburg, E J Janse van; Orlandini, E; Tesi, M C; Whittington, S G
2008-01-01
The knotting in a lattice polygon model of ring polymers is examined when a stretching force is applied to the polygon. By examining the incidence of cut-planes in the polygon, we prove a pattern theorem in the stretching regime for large applied forces. This theorem can be used to examine the incidence of entanglements such as knotting and writhing. In particular, we prove that for arbitrarily large positive, but finite, values of the stretching force, the probability that a stretched polygon is knotted approaches 1 as the length of the polygon increases. In the case of writhing, we prove that for stretched polygons of length n, and for every function f(n)=o(√n), the probability that the absolute value of the mean writhe is less than f(n) approaches 0 as n → ∞, for sufficiently large values of the applied stretching force
Alabama ESI: M_MAMMAL (Marine Mammal Polygons)
National Oceanic and Atmospheric Administration, Department of Commerce — This data set contains sensitive biological resource data for dolphins and manatees in Alabama. Vector polygons in this data set represent marine mammal distribution...
Western Alaska ESI: M_MAMMAL (Marine Mammal Polygons)
National Oceanic and Atmospheric Administration, Department of Commerce — This data set contains sensitive biological resource data for seals, whales, dolphins, walruses, and Steller sea lions in Western Alaska. Vector polygons in this...
American Samoa ESI: M_MAMMAL (Marine Mammal Polygons)
National Oceanic and Atmospheric Administration, Department of Commerce — This data set contains sensitive biological resource data for whales and dolphins in American Samoa. Vector polygons in this data set represent marine mammal...
Columbia River ESI: NWI (National Wetlands Inventory - Polygons)
National Oceanic and Atmospheric Administration, Department of Commerce — This data set contains vector polygons representing the wetlands of Columbia River classified according to the Environmental Sensitivity Index (ESI) classification...
Coastal Resources Atlas: Long Island: FISH (Fish Polygons)
National Oceanic and Atmospheric Administration, Department of Commerce — This data set contains sensitive biological resource data for marine, estuarine, anadromous, and freshwater fish species for Long Island, New York. Vector polygons...
Coastal Resources Atlas: Long Island: REPTILES (Reptile and Amphibian Polygons)
National Oceanic and Atmospheric Administration, Department of Commerce — This data set contains sensitive biological resource data for sea turtles, estuarine turtles, and amphibians for Long Island, New York. Vector polygons in this data...
Louisiana ESI: T_MAMMAL (Terrestrial Mammal Polygons)
National Oceanic and Atmospheric Administration, Department of Commerce — This data set contains sensitive biological resource data for terrestrial mammals in Louisiana. Vector polygons in this data set represent terrestrial mammal...
North Slope, Alaska ESI: T_MAMMAL (Terrestrial Mammal Polygons)
National Oceanic and Atmospheric Administration, Department of Commerce — This data set contains sensitive biological resource data for brown bears, caribou, and muskoxen for the North Slope, Alaska. Vector polygons in this data set...
Virginia ESI: M_MAMMAL (Marine Mammal Polygons)
National Oceanic and Atmospheric Administration, Department of Commerce — This data set contains sensitive biological resource data for dolphin, seals, whales, and porpoise in Virginia. Vector polygons in this data set represent marine...
North Slope, Alaska ESI: M_MAMMAL (Marine Mammal Polygons)
National Oceanic and Atmospheric Administration, Department of Commerce — This data set contains sensitive biological resource data for whales, seals, walruses, and polar bears for the North Slope of Alaska. Vector polygons in this data...
Cook Inlet and Kenai Peninsula, Alaska ESI: INDEX (Index Polygons)
National Oceanic and Atmospheric Administration, Department of Commerce — This data set contains vector polygons representing the boundaries used in the creation of the Environmental Sensitivity Index (ESI) for Cook Inlet and Kenai...
Southeast Alaska ESI: T_MAMMAL (Terrestrial Mammal Polygons)
National Oceanic and Atmospheric Administration, Department of Commerce — This data set contains biological resource data for brown bears in Southeast Alaska. Vector polygons in this data set represent locations of bear concentrations....
American Samoa ESI: REPTILES (Reptile and Amphibian Polygons)
National Oceanic and Atmospheric Administration, Department of Commerce — This data set contains sensitive biological resource data for sea turtles in American Samoa. Vector polygons in this data set represent sea turtle nesting and...
Columbia River ESI: M_MAMMAL (Marine Mammal Polygons)
National Oceanic and Atmospheric Administration, Department of Commerce — This data set contains sensitive biological resource data for Steller sea lions, harbor seals, and California sea lions in Columbia River. Vector polygons in this...
Coastal Resources Atlas: Long Island: INVERT (Invertebrate Polygons)
National Oceanic and Atmospheric Administration, Department of Commerce — This data set contains sensitive biological resource data for coastal, estuarine, and marine invertebrate species for Long Island, New York. Vector polygons in this...
Cook Inlet and Kenai Peninsula, Alaska ESI: INVERT (Invertebrate Polygons)
National Oceanic and Atmospheric Administration, Department of Commerce — This data set contains biological resource data for razor clams in Cook Inlet and Kenai Peninsula, Alaska. Vector polygons in this data set represent locations of...
Columbia River ESI: REPTILES (Reptile and Amphibian Polygons)
National Oceanic and Atmospheric Administration, Department of Commerce — This data set contains sensitive biological resource data for western pond turtles and western painted turtles in Columbia River. Vector polygons in this data set...
Cook Inlet and Kenai Peninsula, Alaska ESI: FISH (Fish Polygons)
National Oceanic and Atmospheric Administration, Department of Commerce — This data set contains biological resource data for herring spawning areas in Cook Inlet and Kenai Peninsula, Alaska. Vector polygons in this data set represent...
North Slope, Alaska ESI: BIOINDEX (Biological Index Polygons)
National Oceanic and Atmospheric Administration, Department of Commerce — This data set contains vector polygons representing the quad boundaries of the 1:250,000 USGS topographic quadrangles. These boundaries represent the extent of the...
Louisiana ESI: LG_INDEX (Large Index Polygons)
National Oceanic and Atmospheric Administration, Department of Commerce — This data set contains vector polygons representing the boundaries of all the hardcopy cartographic products produced as part of the Environmental Sensitivity Index...
Bristol Bay, Alaska Subarea ESI: INDEX (Index Polygons)
National Oceanic and Atmospheric Administration, Department of Commerce — This data set contains vector polygons representing the boundaries of all the hardcopy cartographic products produced as part of the Environmental Sensitivity Index...
Maryland ESI: M_MAMMAL (Marine Mammal Polygons)
National Oceanic and Atmospheric Administration, Department of Commerce — This data set contains sensitive biological resource data for seals, whales, porpoise, and dolphin in Maryland. Vector polygons in this data set represent marine...
Alabama ESI: T_MAMMAL (Terrestrial Mammal Polygons)
National Oceanic and Atmospheric Administration, Department of Commerce — This data set contains sensitive biological resource data for Alabama and Perdido Key beach mice in Alabama. Vector polygons in this data set represent the rare...
Coastal Resources Atlas: Long Island: HYDRO (Hydrography Lines and Polygons)
National Oceanic and Atmospheric Administration, Department of Commerce — This data set contains vector lines and polygons representing coastal hydrography used in the creation of the Environmental Sensitivity Index (ESI) for Long Island,...
North Slope, Alaska ESI: HYDRO (Hydrography Lines and Polygons)
National Oceanic and Atmospheric Administration, Department of Commerce — This data set contains vector lines and polygons representing coastal hydrography used in the creation of the Environmental Sensitivity Index (ESI) for the North...
Columbia River ESI: HYDRO (Hydrography Lines and Polygons)
National Oceanic and Atmospheric Administration, Department of Commerce — This data set contains vector lines and polygons representing coastal hydrography used in the creation of the Environmental Sensitivity Index (ESI) for Columbia...
Bristol Bay, Alaska Subarea ESI: HYDRO (Hydrography Lines and Polygons)
National Oceanic and Atmospheric Administration, Department of Commerce — This data set contains vector lines and polygons representing coastal hydrography used in the creation of the Environmental Sensitivity Index (ESI) for the Bristol...
Atmospheres of polygons and knotted polygons
International Nuclear Information System (INIS)
Janse Rensburg, E J Janse; Rechnitzer, A
2008-01-01
In this paper we define two statistics a + (ω) and a - (ω), the positive and negative atmospheres of a lattice polygon ω of fixed length n. These statistics have the property that (a + (ω))/(a - (ω)) = p n+2 /p n , where p n is the number of polygons of length n, counted modulo translations. We use the pivot algorithm to sample polygons and to compute the corresponding average atmospheres. Using these data, we directly estimate the growth constants of polygons in two and three dimensions. We find that μ=2.63805±0.00012 in two dimensions and μ=4.683980±0.000042±0.000067 in three dimensions, where the error bars are 67% confidence intervals, and the second error bar in the three-dimensional estimate of μ is an estimated systematic error. We also compute atmospheres of polygons of fixed knot type K sampled by the BFACF algorithm. We discuss the implications of our results and show that different knot types have atmospheres which behave dramatically differently at small values of n
Homotopic Polygonal Line Simplification
DEFF Research Database (Denmark)
Deleuran, Lasse Kosetski
This thesis presents three contributions to the area of polygonal line simplification, or simply line simplification. A polygonal path, or simply a path is a list of points with line segments between the points. A path can be simplified by morphing it in order to minimize some objective function...
2003-01-01
MGS MOC Release No. MOC2-357, 11 May 2003This Mars Global Surveyor (MGS) Mars Orbiter Camera (MOC) picture shows a pattern of polygons on the floor of a northern plains impact crater. These landforms are common on crater floors at high latitudes on Mars. Similar polygons occur in the arctic and antarctic regions of Earth, where they indicate the presence and freeze-thaw cycling of ground ice. Whether the polygons on Mars also indicate water ice in the ground is uncertain. The image is located in a crater at 64.8oN, 292.7oW. Sunlight illuminates the scene from the lower left.
DEFF Research Database (Denmark)
Boeriis, Morten; van Leeuwen, Theo
2017-01-01
should be taken into account in discussing ‘reactions’, which Kress and van Leeuwen link only to eyeline vectors. Finally, the question can be raised as to whether actions are always realized by vectors. Drawing on a re-reading of Rudolf Arnheim’s account of vectors, these issues are outlined......This article revisits the concept of vectors, which, in Kress and van Leeuwen’s Reading Images (2006), plays a crucial role in distinguishing between ‘narrative’, action-oriented processes and ‘conceptual’, state-oriented processes. The use of this concept in image analysis has usually focused...
2003-01-01
MGS MOC Release No. MOC2-564, 4 December 2003This Mars Global Surveyor (MGS) Mars Orbiter Camera (MOC) image shows patterned ground, arranged in the form of polygons, on the undulating plains associated with ejecta from the Lyot impact crater on the martian northern plains. This picture was acquired in October 2003 and shows that the polygon margins are ridges with large boulders--shown here as dark dots--on them. On Earth, polygon patterns like this are created in arctic and antarctic regions where there is ice in the ground. The seasonal and longer-term cycles of freezing and thawing of the ice-rich ground cause these features to form over time. Whether the same is true for Mars is unknown. The polygons are located near 54.6oN, 326.6oW. The image covers an area 3 km (1.9 mi) wide and is illuminated from the lower left.
2005-01-01
26 September 2005 This Mars Global Surveyor (MGS) Mars Orbiter Camera (MOC) image shows polygonal patterned ground on a south high-latitude plain. The outlines of the polygons, like the craters and hills in this region, are somewhat enhanced by the presence of bright frost left over from the previous winter. On Earth, polygons at high latitudes would usually be attributed to the seasonal freezing and thawing cycles of ground ice. The origin of similar polygons on Mars is less certain, but might also be an indicator of ground ice. Location near: 75.3oS, 113.2oW Image width: width: 3 km (1.9 mi) Illumination from: upper left Season: Southern Spring
Polverari, F.; Talone, M.; Crapolicchio, R. Levy, G.; Marzano, F.
2013-12-01
The European Remote-sensing Satellite (ERS)-2 scatterometer provides wind retrievals over Ocean. To satisfy the needs of high quality and homogeneous set of scatterometer measurements, the European Space Agency (ESA) has developed the project Advanced Scatterometer Processing System (ASPS) with which a long-term dataset of new ERS-2 wind products, with an enhanced resolution of 25km square, has been generated by the reprocessing of the entire ERS mission. This paper presents the main results of the validation work of such new dataset using in situ measurements provided by the Prediction and Research Moored Array in the Tropical Atlantic (PIRATA). The comparison indicates that, on average, the scatterometer data agree well with buoys measurements, however the scatterometer tends to overestimates lower winds and underestimates higher winds.
FEMA DFIRM Panel Scheme Polygons
Minnesota Department of Natural Resources — This layer contains information about the Flood Insurance Rate Map (FIRM) panel areas. The spatial entities representing FIRM panels are polygons. The polygon for...
Near polygons and Fischer spaces
Brouwer, A.E.; Cohen, A.M.; Hall, J.I.; Wilbrink, H.A.
1994-01-01
In this paper we exploit the relations between near polygons with lines of size 3 and Fischer spaces to classify near hexagons with quads and with lines of size three. We also construct some infinite families of near polygons.
2005-01-01
3 September 2005 This Mars Global Surveyor (MGS) Mars Orbiter Camera (MOC) image shows polygons enhanced by subliming seasonal frost in the martian south polar region. Polygons similar to these occur in frozen ground at high latitudes on Earth, suggesting that perhaps their presence on Mars is also a sign that there is or once was ice in the shallow subsurface. The circular features are degraded meteor impact craters. Location near: 72.2oS, 310.3oW Image width: width: 3 km (1.9 mi) Illumination from: upper left Season: Southern Spring
Nanopatterning by molecular polygons.
Jester, Stefan-S; Sigmund, Eva; Höger, Sigurd
2011-07-27
Molecular polygons with three to six sides and binary mixtures thereof form long-range ordered patterns at the TCB/HOPG interface. This includes also the 2D crystallization of pentagons. The results provide an insight into how the symmetry of molecules is translated into periodic structures.
2002-01-01
[figure removed for brevity, see original site] This jumble of eroded ridges and mesas occurs within Ares Vallis, one of the largest catastrophic outflow channels on the planet. Floods raged through this channel, portions of which are up to 25 km wide, pouring out into the Chryse Basin to the north. Close inspection of the THEMIS image reveals polygonal shapes on the floor of the channel system. Polygonal terrain on Mars is fairly common although the variety of forms and scales of the polygons suggests multiple modes of origin. Those in Ares Vallis resemble giant desiccation polygons that form in soils on Earth when a moist layer at depth drys out. While polygons can form in icy soils (permafrost) and even lava flows, their presence in a channel thought to have been carved by flowing water is at least consistent with a mode of origin that involved liquid water.Note: this THEMIS visual image has not been radiometrically nor geometrically calibrated for this preliminary release. An empirical correction has been performed to remove instrumental effects. A linear shift has been applied in the cross-track and down-track direction to approximate spacecraft and planetary motion. Fully calibrated and geometrically projected images will be released through the Planetary Data System in accordance with Project policies at a later time.NASA's Jet Propulsion Laboratory manages the 2001 Mars Odyssey mission for NASA's Office of Space Science, Washington, D.C. The Thermal Emission Imaging System (THEMIS) was developed by Arizona State University, Tempe, in collaboration with Raytheon Santa Barbara Remote Sensing. The THEMIS investigation is led by Dr. Philip Christensen at Arizona State University. Lockheed Martin Astronautics, Denver, is the prime contractor for the Odyssey project, and developed and built the orbiter. Mission operations are conducted jointly from Lockheed Martin and from JPL, a division of the California Institute of Technology in Pasadena.
International Nuclear Information System (INIS)
Deo, Ravinesh C.; Wen, Xiaohu; Qi, Feng
2016-01-01
Highlights: • A forecasting model for short- and long-term global incident solar radiation (R_n) has been developed. • The support vector machine and discrete wavelet transformation algorithm has been integrated. • The precision of the wavelet-coupled hybrid model is assessed using several prediction score metrics. • The proposed model is an appealing tool for forecasting R_n in the present study region. - Abstract: A solar radiation forecasting model can be utilized is a scientific contrivance for investigating future viability of solar energy potentials. In this paper, a wavelet-coupled support vector machine (W-SVM) model was adopted to forecast global incident solar radiation based on the sunshine hours (S_t), minimum temperature (T_m_a_x), maximum temperature (T_m_a_x), windspeed (U), evaporation (E) and precipitation (P) as the predictor variables. To ascertain conclusive results, the merit of the W-SVM was benchmarked with the classical SVM model. For daily forecasting, sixteen months of data (01-March-2014 to 30-June-2015) partitioned into the train (65%) and test (35%) set for the three metropolitan stations (Brisbane City, Cairns Aero and Townsville Aero) were utilized. Data were decomposed into their wavelet sub-series by discrete wavelet transformation algorithm and summed up to create new series with one approximation and four levels of detail using Daubechies-2 mother wavelet. For daily forecasting, six model scenarios were formulated where the number of input was increased and the forecast was assessed by statistical metrics (correlation coefficient r; Willmott’s index d; Nash-Sutcliffe coefficient E_N_S; peak deviation P_d_v), distribution statistics and prediction errors (mean absolute error MAE; root mean square error RMSE; mean absolute percentage error MAPE; relative root mean square error RMSE). Results for daily forecasts showed that the W-SVM model outperformed the classical SVM model for optimum input combinations. A sensitivity
2008-01-01
This image shows a small-scale polygonal pattern in the ground near NASA's Phoenix Mars Lander. This pattern is similar in appearance to polygonal structures in icy ground in the arctic regions of Earth. Phoenix touched down on the Red Planet at 4:53 p.m. Pacific Time (7:53 p.m. Eastern Time), May 25, 2008, in an arctic region called Vastitas Borealis, at 68 degrees north latitude, 234 degrees east longitude. This image was acquired by the Surface Stereo Imager shortly after landing. On the Phoenix mission calendar, landing day is known as Sol 0, the first Martian day of the mission. The Phoenix Mission is led by the University of Arizona, Tucson, on behalf of NASA. Project management of the mission is by NASA's Jet Propulsion Laboratory, Pasadena, Calif. Spacecraft development is by Lockheed Martin Space Systems, Denver.
2005-01-01
14 April 2005 This Mars Global Surveyor (MGS) Mars Orbiter Camera (MOC) image shows a typical view of polygon-cracked and pitted surfaces unique to western Utopia Planitia. No other place on Mars has this appearance. Some Mars scientists have speculated that ground ice may be responsible for these landforms. Location near: 42.3oN, 275.6oW Image width: 3 km (1.9 mi) Illumination from: lower left Season: Northern Summer
2003-01-01
MGS MOC Release No. MOC2-339, 23 April 2003This Mars Global Surveyor (MGS) Mars Orbiter Camera (MOC) image shows a pattern of polygonal cracks and aligned, elliptical pits in western Utopia Planitia. The picture covers an area about 3 km (about 1.9 mi) wide near 44.9oN, 274.7oW. Sunlight illuminates the scene from the left.
Abandoned Uranium Mine (AUM) Region Polygons, Navajo Nation, 2016, US EPA Region 9
U.S. Environmental Protection Agency — This GIS dataset contains polygon features representing the boundaries of the six Abandoned Uranium Mines (AUM) Regions, including the: Central, Eastern, Northern,...
U.S. Environmental Protection Agency — This is a polygon feature dataset with areas along the shoreline of the Hawaiian islands. The National Coastal Condition Assessment (NCCA) is a national coastal...
National Oceanic and Atmospheric Administration, Department of Commerce — This data set contains vector polygons representing the boundaries of all hardcopy cartographic products produced as part of the Environmental Sensitivity Index...
National Oceanic and Atmospheric Administration, Department of Commerce — This data set contains sensitive biological resource data for marine, estuarine, and anadromous fish species in Central California. Vector polygons in this data set...
Sensitivity of Coastal Environments and Wildlife to Spilled Oil: Hudson River: FISH (Fish Polygons)
National Oceanic and Atmospheric Administration, Department of Commerce — This data set contains sensitive biological resource data for marine, estuarine, anadromous, and freshwater fish species in the Hudson River. Vector polygons in this...
National Oceanic and Atmospheric Administration, Department of Commerce — This data set contains sensitive biological resource data for amphibians and reptiles in Central California. Vector polygons in this data set represent sea turtle...
National Oceanic and Atmospheric Administration, Department of Commerce — This data set contains management area data for National Wildlife Refuges in the Aleutian Islands, Alaska. Vector polygons in this data set represent management...
National Oceanic and Atmospheric Administration, Department of Commerce — This data set contains sensitive biological resource data for sea turtles, estuarine turtles, and gopher tortoise in Mississippi. Vector polygons in this data set...
National Oceanic and Atmospheric Administration, Department of Commerce — This data set contains vector polygons representing the boundaries of all hardcopy cartographic products produced as part of the Environmental Sensitivity Index...
National Oceanic and Atmospheric Administration, Department of Commerce — This data set contains sensitive biological resource data for marine, estuarine, freshwater, and anadromous fish species in Northwest Arctic, Alaska. Vector polygons...
National Oceanic and Atmospheric Administration, Department of Commerce — This data set contains vector polygons representing coastal wetlands classified according to the Environmental Sensitivity Index (ESI) classification system for...
Cook Inlet and Kenai Peninsula, Alaska ESI: M_MAMMAL (Marine Mammal Polygons)
National Oceanic and Atmospheric Administration, Department of Commerce — This data set contains biological resource data for marine mammals in Cook Inlet and Kenai Peninsula, Alaska. Vector polygons in this data set represent locations of...
National Oceanic and Atmospheric Administration, Department of Commerce — This data set contains sensitive biological resource data for marine and estuarine invertebrate species for the Hudson River. Vector polygons in this data set...
National Oceanic and Atmospheric Administration, Department of Commerce — This data set contains sensitive biological resource data for dolphin and manatees in Mississippi. Vector polygons in this data set represent marine mammal...
National Oceanic and Atmospheric Administration, Department of Commerce — This data set contains vector polygons representing the boundaries of all hardcopy cartographic products produced as part of the Environmental Sensitivity Index...
National Oceanic and Atmospheric Administration, Department of Commerce — This data set contains sensitive biological resource data for endangered plants for the Upper Coast of Texas. Vector polygons in this data set represent occurrence...
Sensitivity of Coastal Environments and Wildlife to Spilled Oil: South Florida: FISH (Fish Polygons)
National Oceanic and Atmospheric Administration, Department of Commerce — This data set contains sensitive biological resource data for marine and estuarine fish species in South Florida. Vector polygons in this data set represent fish...
National Oceanic and Atmospheric Administration, Department of Commerce — This data set contains vector polygons representing the boundaries of all hardcopy cartographic products produced as part of the Environmental Sensitivity Index...
National Oceanic and Atmospheric Administration, Department of Commerce — This data set contains vector lines and polygons representing coastal hydrography used in the creation of the Environmental Sensitivity Index (ESI) for South...
National Oceanic and Atmospheric Administration, Department of Commerce — This data set contains benthic habitats, including coral reef and hardbottom, seagrass, algae, and others in [for] South Florida. Vector polygons in the data set...
National Oceanic and Atmospheric Administration, Department of Commerce — The ESIP data set contains vector polygons representing the shoreline and coastal habitats of South Florida classified according to the Environmental Sensitivity...
National Oceanic and Atmospheric Administration, Department of Commerce — This data set contains sensitive biological resource data for sea turtles and estuarine frogs and turtles in Northern California. Vector polygons in this data set...
Guam and the Northern Mariana Islands ESI: M_MAMMAL (Marine Mammal Polygons)
National Oceanic and Atmospheric Administration, Department of Commerce — This data set contains sensitive biological resource data for dolphins in Guam and the Northern Mariana Islands. Vector polygons in this data set represent marine...
Coastal Resources Atlas: Long Island: T_MAMMAL (Terrestrial Mammal Polygons)
National Oceanic and Atmospheric Administration, Department of Commerce — This data set contains sensitive biological resource data for northern river otter, mink, muskrat, and beaver for Long Island, New York. Vector polygons in this data...
National Oceanic and Atmospheric Administration, Department of Commerce — This data set contains sensitive biological resource data for marine and estuarine invertebrate species in Northwest Arctic, Alaska. Vector polygons in this data set...
National Oceanic and Atmospheric Administration, Department of Commerce — This data set contains sensitive biological resource data for marine, estuarine, and brackish water invertebrate species in Mississippi. Vector polygons in this data...
National Oceanic and Atmospheric Administration, Department of Commerce — This data set contains sensitive biological resource data for sea turtles and select estuarine/freshwater reptiles for the Florida Panhandle. Vector polygons in this...
Rhode Island, Connecticut, New York, and New Jersey ESI: INDEX (Index Polygons)
National Oceanic and Atmospheric Administration, Department of Commerce — This data set contains vector polygons representing the boundaries of the U.S. Geological Survey 1:24,000 topographic maps and other map and digital data boundaries...
National Oceanic and Atmospheric Administration, Department of Commerce — This data set contains sensitive biological resource data for marine, and estuarine invertebrate species in New Hampshire. Vector polygons in this data set represent...
National Oceanic and Atmospheric Administration, Department of Commerce — This data set contains sensitive biological resource data for marine and estuarine invertebrate species for the Upper Coast of Texas. Vector polygons in this data...
National Oceanic and Atmospheric Administration, Department of Commerce — This data set contains sensitive biological resource data for marine, estuarine, and freshwater fish species for the Upper Coast of Texas. Vector polygons in this...
National Oceanic and Atmospheric Administration, Department of Commerce — This data set contains sensitive biological resource data for marine and estuarine invertebrate species in South Florida. Vector polygons in this data set represent...
Coastal Resources Atlas: Long Island: M_MAMMAL (Marine Mammal Polygons)
National Oceanic and Atmospheric Administration, Department of Commerce — This data set contains sensitive biological resource data for seals, whales, and porpoises for Long Island, New York. Vector polygons in this data set represent...
National Oceanic and Atmospheric Administration, Department of Commerce — This data set contains sensitive biological resource data for marine and estuarine invertebrate species in North Carolina. Vector polygons in this data set represent...
National Oceanic and Atmospheric Administration, Department of Commerce — This data set contains vector polygons representing the boundaries of all hardcopy cartographic products produced as part of the Environmental Sensitivity Index...
Virginia ESI: ESI (Environmental Sensitivity Index Shoreline Types - Lines and Polygons)
National Oceanic and Atmospheric Administration, Department of Commerce — This data set contains vector lines and polygons representing the shoreline and coastal habitats for Virginia, classified according to the Environmental Sensitivity...
Maryland ESI: ESI (Environmental Sensitivity Index Shoreline Types - Lines and Polygons)
National Oceanic and Atmospheric Administration, Department of Commerce — This data set contains vector lines and polygons representing the shoreline and coastal habitats for Maryland, classified according to the Environmental Sensitivity...
Rhode Island, Connecticut, New York, and New Jersey ESI: T_MAMMAL (Terrestrial Mammal Polygons)
National Oceanic and Atmospheric Administration, Department of Commerce — This data set contains sensitive biological resource data for small mammal species in coastal Rhode Island, Connecticut, New York, and New Jersey. Vector polygons in...
National Oceanic and Atmospheric Administration, Department of Commerce — This data set contains sensitive biological resource data for marine, estuarine, anadromous, and brackish/freshwater fish species in North Carolina. Vector polygons...
National Oceanic and Atmospheric Administration, Department of Commerce — This data set contains vector lines and polygons representing coastal hydrography used in the creation of the Environmental Sensitivity Index (ESI) for Southern...
Guam and the Northern Mariana Islands ESI: HYDRO (Hydrography Lines and Polygons)
National Oceanic and Atmospheric Administration, Department of Commerce — This data set contains vector lines and polygons representing coastal hydrography used in the creation of the Environmental Sensitivity Index (ESI) for Guam and the...
National Oceanic and Atmospheric Administration, Department of Commerce — This data set contains vector lines and polygons representing coastal hydrography used in the creation of the Environmental Sensitivity Index (ESI) for Central...
National Oceanic and Atmospheric Administration, Department of Commerce — This data set contains vector polygons representing management area data for Designated Critical Habitats, National Park Service properties, Wildlife Refuges, and...
National Oceanic and Atmospheric Administration, Department of Commerce — This data set contains vector lines and polygons representing coastal hydrography used in the creation of the Environmental Sensitivity Index (ESI) for Northern...
Rhode Island, Connecticut, New York, and New Jersey ESI: HYDRO (Hydrography Lines and Polygons)
National Oceanic and Atmospheric Administration, Department of Commerce — This data set contains vector lines and polygons representing coastal hydrography used in the creation of the Environmental Sensitivity Index (ESI) for Rhode Island,...
Cook Inlet and Kenai Peninsula, Alaska ESI: HYDRO (Hydrography Lines and Polygons)
National Oceanic and Atmospheric Administration, Department of Commerce — This data set contains vector lines and polygons representing coastal hydrography used in the creation of the Environmental Sensitivity Index (ESI) for Cook Inlet...
National Oceanic and Atmospheric Administration, Department of Commerce — This data set contains vector lines and polygons representing coastal hydrography used in the creation of the Environmental Sensitivity Index (ESI) for New...
National Oceanic and Atmospheric Administration, Department of Commerce — This data set contains vector lines and polygons representing the shoreline and coastal habitats of Cook Inlet and Kenai Peninsula, Alaska, classified according to...
Origin of giant Martian polygons
Mcgill, George E.; Hills, L. S.
1992-01-01
Extensive areas of the Martian northern plains in Utopia and Acidalia planitiae are characterized by 'polygonal terrane'. Polygonal terrane consists of material cut by complex troughs defining a pattern resembling mudcracks, columnar joints, or frost-wedge polygons on earth. However, the Martian polygons are orders of magnitude larger than these potential earth analogues, leading to severe mechanical difficulties for genetic models based on simple analogy arguments. Plate-bending and finite element models indicate that shrinkage of desiccating sediment or cooling volcanics accompanied by differential compaction over buried topography can account for the stresses responsible for polygon troughs as well as the large size of the polygons. Although trough widths and depths relate primarily to shrinkage, the large scale of the polygonl pattern relates to the spacing between topographic elevations on the surface buried beneath polygonal terrane material. Geological relationships favor a sedimentary origin for polygonal terrane material, but our model is not dependent on the specific genesis. Our analysis also suggests that the polygons must have formed at a geologically rapid rate.
2003-01-01
MGS MOC Release No. MOC2-428, 21 July 2003This June 2003 Mars Global Surveyor (MGS) Mars Orbiter Camera (MOC) image shows a polygonal pattern developed in seasonal carbon dioxide frost in the martian southern hemisphere. The frost accumulated during the recent southern winter; it is now spring, and the carbon dioxide frost is subliming away. This image is located near 80.4oS, 200.2oW; it is illuminated by sunlight from the upper left, and covers an area 3 km (1.9 mi) across.
Casimir effect in hyperbolic polygons
International Nuclear Information System (INIS)
Ahmedov, H
2007-01-01
Using the point splitting regularization method and the trace formula for the spectra of quantum-mechanical systems in hyperbolic polygons which are the fundamental domains of discrete isometry groups acting in the two-dimensional hyperboloid we calculate the Casimir energy for massless scalar fields in hyperbolic polygons. The dependence of the vacuum energy on the number of vertices is established
Metric inequalities for polygons
Directory of Open Access Journals (Sweden)
Adrian Dumitrescu
2013-07-01
Full Text Available Let A1,A2,…,An be the vertices of a polygon with unit perimeter, that is Σi |Ai Ai+1|=1. We derive various tight estimates on the minimum and maximum values of the sum of pairwise distances, and respectively sum of pairwise squared distances among its vertices. In most cases such estimates on these sums in the literature were known only for convex polygons.In the second part, we turn to a problem of Braß regarding the maximum perimeter of a simplen-gon (n odd contained in a disk of unit radius. The problem was recently solved by Audet et al. 2009, who gave an exact formula. Here we present an alternative simpler proof of this formula. We then examine what happens if the simplicity condition is dropped, and obtain an exact formula for the maximum perimeter in this case as well.
Vermont Center for Geographic Information — (Link to Metadata) The BNDHASH dataset depicts Vermont villages, towns, counties, Regional Planning Commissions (RPC), and LEPC (Local Emergency Planning Committee)...
VT Boundaries - village polygons
Vermont Center for Geographic Information — (Link to Metadata) The BNDHASH dataset depicts Vermont villages, towns, counties, Regional Planning Commissions (RPC), and LEPC (Local Emergency Planning Committee)...
Vermont Center for Geographic Information — (Link to Metadata) The BNDHASH dataset depicts Vermont villages, towns, counties, Regional Planning Commissions (RPC), and LEPC (Local Emergency Planning Committee)...
VT Boundaries - county polygons
Vermont Center for Geographic Information — (Link to Metadata) The BNDHASH dataset depicts Vermont villages, towns, counties, Regional Planning Commissions (RPC), and LEPC (Local Emergency Planning Committee)...
Vermont Center for Geographic Information — (Link to Metadata) The BNDHASH dataset depicts Vermont villages, towns, counties, Regional Planning Commissions (RPC), and LEPC (Local Emergency Planning Committee)...
Vermont Center for Geographic Information — (Link to Metadata) The BNDHASH dataset depicts Vermont villages, towns, counties, Regional Planning Commissions (RPC), and LEPC (Local Emergency Planning Committee)...
2004-01-01
8 February 2004 This Mars Global Surveyor (MGS) Mars Orbiter Camera (MOC) image shows a summertime scene in the south polar region of the red planet. A patch of bright frost--possibly water ice--is seen in the lower third of the image. Polygon patterns that have developed in the ice as it sublimes away can be seen; these are not evident in the defrosted surfaces, so they are thought to have formed in the frost. This image is located near 82.6oS, 352.5oW. Sunlight illuminates this scene from the upper left; the image covers an area 3 km (1.9 mi) wide.
Control Point Generated PLS - polygons
Minnesota Department of Natural Resources — The Control Point Generated PLS layer contains line and polygon features to the 1/4 of 1/4 PLS section (approximately 40 acres) and government lot level. The layer...
Model for polygonal hydraulic jumps
DEFF Research Database (Denmark)
Martens, Erik Andreas; Watanabe, Shinya; Bohr, Tomas
2012-01-01
We propose a phenomenological model for the polygonal hydraulic jumps discovered by Ellegaard and co-workers [Nature (London) 392, 767 (1998); Nonlinearity 12, 1 (1999); Physica B 228, 1 (1996)], based on the known flow structure for the type-II hydraulic jumps with a "roller" (separation eddy...... nonhydrostatic pressure contributions from surface tension in light of recent observations by Bush and co-workers [J. Fluid Mech. 558, 33 (2006); Phys. Fluids 16, S4 (2004)]. The model can be analyzed by linearization around the circular state, resulting in a parameter relationship for nearly circular polygonal...... states. A truncated but fully nonlinear version of the model can be solved analytically. This simpler model gives rise to polygonal shapes that are very similar to those observed in experiments, even though surface tension is neglected, and the condition for the existence of a polygon with N corners...
Soils - Volusia County Soils (Polygons)
NSGIC Local Govt | GIS Inventory — Soils: 1:24000 SSURGO Map. Polygon boundaries of Soils in Volusia County, downloaded from SJRWMD and created by NRCS and SJRWMD. This data set is a digital version...
Inscribed polygons and Heron polynomials
International Nuclear Information System (INIS)
Varfolomeev, V V
2003-01-01
Heron's well-known formula expressing the area of a triangle in terms of the lengths of its sides is generalized in the following sense to polygons inscribed in a circle: it is proved that the area is an algebraic function of the lengths of the edges of the polygon. Similar results are proved for the diagonals and the radius of the circumscribed circle. The resulting algebraic equations are studied and elementary geometric applications of the algebraic results obtained are presented
Zernike-like systems in polygons and polygonal facets.
Ferreira, Chelo; López, José L; Navarro, Rafael; Sinusía, Ester Pérez
2015-07-20
Zernike polynomials are commonly used to represent the wavefront phase on circular optical apertures, since they form a complete and orthonormal basis on the unit disk. In [Opt. Lett.32, 74 (2007)10.1364/OL.32.000074OPLEDP0146-9592] we introduced a new Zernike basis for elliptic and annular optical apertures based on an appropriate diffeomorphism between the unit disk and the ellipse and the annulus. Here, we present a generalization of this Zernike basis for a variety of important optical apertures, paying special attention to polygons and the polygonal facets present in segmented mirror telescopes. On the contrary to ad hoc solutions, most of them based on the Gram-Smith orthonormalization method, here we consider a piecewise diffeomorphism that transforms the unit disk into the polygon under consideration. We use this mapping to define a Zernike-like orthonormal system over the polygon. We also consider ensembles of polygonal facets that are essential in the design of segmented mirror telescopes. This generalization, based on in-plane warping of the basis functions, provides a unique solution, and what is more important, it guarantees a reasonable level of invariance of the mathematical properties and the physical meaning of the initial basis functions. Both the general form and the explicit expressions for a typical example of telescope optical aperture are provided.
National Oceanic and Atmospheric Administration, Department of Commerce — This data set contains sensitive biological resource data for whales, porpoises, dolphins, manatees, and pinnipeds in North Carolina. Vector polygons in this data...
National Oceanic and Atmospheric Administration, Department of Commerce — This data set contains sensitive biological resource data for seals, porpoise, and whales in New Hampshire. Vector polygons in this data set represent marine mammal...
National Oceanic and Atmospheric Administration, Department of Commerce — This data set contains sensitive biological resource data for dolphins, porpoises, whales, seals, sea lions, and sea otters in Central California. Vector polygons in...
National Oceanic and Atmospheric Administration, Department of Commerce — This data set contains sensitive biological resource data for beach mice, red wolf, and Florida black bear for the Florida Panhandle. Vector polygons in this data...
National Oceanic and Atmospheric Administration, Department of Commerce — This data set contains sensitive biological resource data for marine mammals (seals) in the Hudson River. Vector polygons in this data set represent marine mammal...
National Oceanic and Atmospheric Administration, Department of Commerce — This data set contains sensitive biological resource data for seals, whales, dolphins, porpoises, sea otters, and sea lions in Northern California. Vector polygons...
National Oceanic and Atmospheric Administration, Department of Commerce — This data set contains sensitive biological resource data for terrestrial mammals for the Upper Coast of Texas. Vector polygons in this data set represent...
National Oceanic and Atmospheric Administration, Department of Commerce — This data set contains commercial fisheries in South Florida. Vector polygons in this data set represent statistical reporting grids used to aggregate commercial...
National Oceanic and Atmospheric Administration, Department of Commerce — This data set contains vector lines and polygons representing coastal hydrography used in the creation of the Environmental Sensitivity Index (ESI) for the Upper...
National Oceanic and Atmospheric Administration, Department of Commerce — This data set contains sensitive biological resource data for dolphins and manatees in for the Florida Panhandle. Vector polygons in this data set represent dolphins...
National Oceanic and Atmospheric Administration, Department of Commerce — This data set contains sensitive biological resource data for northern river otters, beavers, and muskrats in New Hampshire. Vector polygons in this data set...
National Oceanic and Atmospheric Administration, Department of Commerce — This data set contains vector lines and polygons representing the shoreline and coastal habitats for the Hudson River, classified according to the Environmental...
National Oceanic and Atmospheric Administration, Department of Commerce — This data set contains sensitive biological resource data for dolphins and manatees for the Upper Coast of Texas. Vector polygons in this data set represent marine...
National Oceanic and Atmospheric Administration, Department of Commerce — This data set contains sensitive biological resource data for manatees and bottlenose dolphins in [for] South Florida. Vector polygons in this data set represent...
National Oceanic and Atmospheric Administration, Department of Commerce — This data set contains sensitive biological resource data for rare/sensitive species occurrences of terrestrial mammals in Central California. Vector polygons in...
National Oceanic and Atmospheric Administration, Department of Commerce — This data set contains sensitive biological resource data for small terrestrial mammals (woodrats, myotis, muskrat, mink) for the Hudson River. Vector polygons in...
National Oceanic and Atmospheric Administration, Department of Commerce — This data set contains sensitive biological resource data for rare and threatened/endangered terrestrial mammals in Southern California. Vector polygons in this data...
National Oceanic and Atmospheric Administration, Department of Commerce — This data set contains sensitive biological resource data for seals, sea lions, whales, dolphins, porpoises, and sea otters in Southern California. Vector polygons...
National Oceanic and Atmospheric Administration, Department of Commerce — This data set contains vector lines and polygons representing the shoreline and coastal habitats of Northern California, classified according to the Environmental...
The generation algorithm of arbitrary polygon animation based on dynamic correction
Directory of Open Access Journals (Sweden)
Hou Ya Wei
2016-01-01
Full Text Available This paper, based on the key-frame polygon sequence, proposes a method that makes use of dynamic correction to develop continuous animation. Firstly we use quadratic Bezier curve to interpolate the corresponding sides vector of polygon sequence consecutive frame and realize the continuity of animation sequences. And then, according to Bezier curve characteristic, we conduct dynamic regulation to interpolation parameters and implement the changing smoothness. Meanwhile, we take use of Lagrange Multiplier Method to correct the polygon and close it. Finally, we provide the concrete algorithm flow and present numerical experiment results. The experiment results show that the algorithm acquires excellent effect.
Tessellating the Sphere with Regular Polygons
Soto-Johnson, Hortensia; Bechthold, Dawn
2004-01-01
Tessellations in the Euclidean plane and regular polygons that tessellate the sphere are reviewed. The regular polygons that can possibly tesellate the sphere are spherical triangles, squares and pentagons.
Tensor Product of Polygonal Cell Complexes
Chien, Yu-Yen
2017-01-01
We introduce the tensor product of polygonal cell complexes, which interacts nicely with the tensor product of link graphs of complexes. We also develop the unique factorization property of polygonal cell complexes with respect to the tensor product, and study the symmetries of tensor products of polygonal cell complexes.
Approximation algorithms for guarding holey polygons ...
African Journals Online (AJOL)
Guarding edges of polygons is a version of art gallery problem.The goal is finding the minimum number of guards to cover the edges of a polygon. This problem is NP-hard, and to our knowledge there are approximation algorithms just for simple polygons. In this paper we present two approximation algorithms for guarding ...
Triangulating and guarding realistic polygons
Aloupis, G.; Bose, P.; Dujmovic, V.; Gray, C.M.; Langerman, S.; Speckmann, B.
2008-01-01
We propose a new model of realistic input: k-guardable objects. An object is k-guardable if its boundary can be seen by k guards in the interior of the object. In this abstract, we describe a simple algorithm for triangulating k-guardable polygons. Our algorithm, which is easily implementable, takes
Triangulating and guarding realistic polygons
Aloupis, G.; Bose, P.; Dujmovic, V.; Gray, C.M.; Langerman, S.; Speckmann, B.
2014-01-01
We propose a new model of realistic input: k-guardable objects. An object is k-guardable if its boundary can be seen by k guards. We show that k-guardable polygons generalize two previously identified classes of realistic input. Following this, we give two simple algorithms for triangulating
Rotating Polygons on a Fluid Surface
DEFF Research Database (Denmark)
Bohr, Tomas; Jansson, Thomas; Haspang, Martin
spontaneously and the surface can take the shape of a rigidly rotating polygon. With water we have observed polygons with up to 6 corners. The rotation speed of the polygons does not coincide with that of the plate, but it is often mode-locked, such that the polygon rotates by one corner for each complete...... and R. Miraghaie, ”Symmetry breaking in free-surface cylinder flows”, J. Fluid Mech., 502, 99 (2004)). The polygons occur at much larger Reynolds numbers, for water around 500.000. Correspondingly, the dependence on viscosity is rather small....
Polygons, Stars, and Clusters; an Investigation of Polygon Displays
1988-01-01
variables were chosen, nine in each case , to give reasonably complex polygons without being too complex. I have seen no reported studies of the relation...Pont. Catalina C Datsun 210, Toyota Corolla, Dodge Colt, Honda Civic, Mazda GLC, Subaru, Ford Fiesta, Plym. Champ Figure 6. Clusters on the basis of...Merc. Marquis, Pont. Catalina, Pont. Grand Prix C Datsun 210, Toyota Corolla, Dodge Colt, Honda Civic, Mazda GLC, Subaru, Ford Fiesta, Plym. Champ
DEFF Research Database (Denmark)
Bennike, Tue Bjerg; Carlsen, Thomas Gelsing; Ellingsen, Torkell
2017-01-01
The datasets presented in this article are related to the research articles entitled “Neutrophil Extracellular Traps in Ulcerative Colitis: A Proteome Analysis of Intestinal Biopsies” (Bennike et al., 2015 [1]), and “Proteome Analysis of Rheumatoid Arthritis Gut Mucosa” (Bennike et al., 2017 [2])...... been deposited to the ProteomeXchange Consortium via the PRIDE partner repository with the dataset identifiers PXD001608 for ulcerative colitis and control samples, and PXD003082 for rheumatoid arthritis samples....
NSGIC Local Govt | GIS Inventory — Election Districts and Precincts dataset current as of 1991. PrecinctPoly-The data set is a polygon feature consisting of 220 segments representing voter precinct...
Random walks and polygons in tight confinement
International Nuclear Information System (INIS)
Diao, Y; Ernst, C; Ziegler, U
2014-01-01
We discuss the effect of confinement on the topology and geometry of tightly confined random walks and polygons. Here the walks and polygons are confined in a sphere of radius R ≥ 1/2 and the polygons are equilateral with n edges of unit length. We illustrate numerically that for a fixed length of random polygons the knotting probability increases to one as the radius decreases to 1/2. We also demonstrate that for random polygons (walks) the curvature increases to πn (π(n – 1)) as the radius approaches 1/2 and that the torsion decreases to ≈ πn/3 (≈ π(n – 1)/3). In addition we show the effect of length and confinement on the average crossing number of a random polygon
Lucchitta, B. K.
1984-01-01
Polygonal-fracture patterns on the martian surface were discovered on Viking Orbiter images. The polygons are 2-20 km in diameter, much larger than those of known patterned ground on Earth. New observations show, however, that polygons exist on Mars that have diameters similar to those of ice-wedge polygons on Earth (generally a few meters to more than 100 m). Various explanations for the origin of these crustal features are examined; seasonal desiccation and thermal-contraction cracking in ice-rich ground. It is difficult to ascertain whether the polygons are forming today or are relics from the past. The crispness of some crack suggests a recent origin. On the other hand the absence of upturned edges (indicating actively forming ice wedges), the locally disintegrating ground, and a few possible superposed rayed craters indicate that the polygons are not forming at the present.
National Oceanic and Atmospheric Administration, Department of Commerce — This data set contains vector polygons representing the boundaries of all hardcopy cartographic products produced as part of the Environmental Sensitivity Index...
National Oceanic and Atmospheric Administration, Department of Commerce — This data set contains sensitive biological resource data for marine and estuarine vegetation in Puget Sound and Strait of Juan de Fuca, Washington. Vector polygons...
Co-evolution of polygonal and scalloped terrains, southwestern Utopia Planitia, Mars
Haltigin, T. W.; Pollard, W. H.; Dutilleul, P.; Osinski, G. R.; Koponen, L.
2014-02-01
Thermal contraction crack polygons and scalloped depressions, two of the most common landforms found in Utopia Planitia, Mars, have previously been linked to the presence of ice-rich deposits in the subsurface. Although the formation and evolution of these features individually are relatively well understood, little to no effort has been directed towards elucidating possible interactions that occur between them during their development. Thus, the overarching goal of this research was to investigate if there is an evolutionary link between polygonal and scalloped terrains by correlating metrics representing polygon and scallop maturity. A variety of statistical analyses were performed using HiRISE and MOLA datasets to quantify interactions between four sets of polygonal and scalloped terrains. Our results demonstrate the existence of a negative relationship between polygonal subdivision and surface elevation, indicating that polygon networks become more ‘evolved’ as the surface subsides. These results suggest that the permafrost landscape in Utopia Planitia may once have been extremely ice-rich, and that multiple geomorphic processes may be responsible for its evolution. Ultimately, this work demonstrates that landscape reconstruction is more complete when a system approach is followed, quantifying interactions between landforms as opposed to examining an individual landform in isolation.
Properties of regular polygons of coupled microring resonators.
Chremmos, Ioannis; Uzunoglu, Nikolaos
2007-11-01
The resonant properties of a closed and symmetric cyclic array of N coupled microring resonators (coupled-microring resonator regular N-gon) are for the first time determined analytically by applying the transfer matrix approach and Floquet theorem for periodic propagation in cylindrically symmetric structures. By solving the corresponding eigenvalue problem with the field amplitudes in the rings as eigenvectors, it is shown that, for even or odd N, this photonic molecule possesses 1 + N/2 or 1+N resonant frequencies, respectively. The condition for resonances is found to be identical to the familiar dispersion equation of the infinite coupled-microring resonator waveguide with a discrete wave vector. This result reveals the so far latent connection between the two optical structures and is based on the fact that, for a regular polygon, the field transfer matrix over two successive rings is independent of the polygon vertex angle. The properties of the resonant modes are discussed in detail using the illustration of Brillouin band diagrams. Finally, the practical application of a channel-dropping filter based on polygons with an even number of rings is also analyzed.
Stanley, Clayton; Byrne, Michael D
2016-12-01
The growth of social media and user-created content on online sites provides unique opportunities to study models of human declarative memory. By framing the task of choosing a hashtag for a tweet and tagging a post on Stack Overflow as a declarative memory retrieval problem, 2 cognitively plausible declarative memory models were applied to millions of posts and tweets and evaluated on how accurately they predict a user's chosen tags. An ACT-R based Bayesian model and a random permutation vector-based model were tested on the large data sets. The results show that past user behavior of tag use is a strong predictor of future behavior. Furthermore, past behavior was successfully incorporated into the random permutation model that previously used only context. Also, ACT-R's attentional weight term was linked to an entropy-weighting natural language processing method used to attenuate high-frequency words (e.g., articles and prepositions). Word order was not found to be a strong predictor of tag use, and the random permutation model performed comparably to the Bayesian model without including word order. This shows that the strength of the random permutation model is not in the ability to represent word order, but rather in the way in which context information is successfully compressed. The results of the large-scale exploration show how the architecture of the 2 memory models can be modified to significantly improve accuracy, and may suggest task-independent general modifications that can help improve model fit to human data in a much wider range of domains. (PsycINFO Database Record (c) 2016 APA, all rights reserved).
DEFF Research Database (Denmark)
Bennike, Tue Bjerg; Carlsen, Thomas Gelsing; Ellingsen, Torkell
2017-01-01
patients (Morgan et al., 2012; Abraham and Medzhitov, 2011; Bennike, 2014) [8–10. Therefore, we characterized the proteome of colon mucosa biopsies from 10 inflammatory bowel disease ulcerative colitis (UC) patients, 11 gastrointestinal healthy rheumatoid arthritis (RA) patients, and 10 controls. We...... been deposited to the ProteomeXchange Consortium via the PRIDE partner repository with the dataset identifiers PXD001608 for ulcerative colitis and control samples, and PXD003082 for rheumatoid arthritis samples....
Parcels and Land Ownership - Volusia County Parcels (Polygons)
NSGIC Local Govt | GIS Inventory — Parcel Ownership Polygon Layer: Polygons showing property ownership created from the "master" subdivision base map for Volusia County. Multiple lots and parcels...
Entanglement complexity of semiflexible lattice polygons
International Nuclear Information System (INIS)
Orlandini, E; Tesi, M C; Whittington, S G
2005-01-01
We use Monte Carlo methods to study knotting in polygons on the simple cubic lattice with a stiffness fugacity. We investigate how the knot probability depends on stiffness and how the relative frequency of trefoils and figure eight knots changes as the stiffness changes. In addition, we examine the effect of stiffness on the writhe of the polygons. (letter to the editor)
Computing nonsimple polygons of minimum perimeter
Fekete, S.P.; Haas, A.; Hemmer, M.; Hoffmann, M.; Kostitsyna, I.; Krupke, D.; Maurer, F.; Mitchell, J.S.B.; Schmidt, A.; Schmidt, C.; Troegel, J.
2018-01-01
We consider the Minimum Perimeter Polygon Problem (MP3): for a given set V of points in the plane, find a polygon P with holes that has vertex set V , such that the total boundary length is smallest possible. The MP3 can be considered a natural geometric generalization of the Traveling Salesman
Kink-free deformations of polygons
Vegter, Gert
1989-01-01
We consider a discrete version of the Whitney-Graustein theorem concerning regular equivalence of closed curves. Two regular polygons P and P’, i.e. polygons without overlapping adjacent edges, are called regularly equivalent if there is a continuous one-parameter family Ps, 0 ≤ s ≤ 1, of regular
Accelerating Generalized Polygon Beams and Their Propagation
International Nuclear Information System (INIS)
Zhang Yun-Tian; Zhang Zhi-Gang; Cheng Teng; Zhang Qing-Chuan; Wu Xiao-Ping
2015-01-01
Accelerating beams with intensity cusps and exotic topological properties are drawing increasing attention as they have extensive uses in many intriguing fields. We investigate the structural features of accelerating polygon beams, show their generalized mathematical form theoretically, and discuss the even-numbered polygon beams. Furthermore, we also carry out the experiment and observe the intensity evolution during their propagation
Perceptually stable regions for arbitrary polygons.
Rocha, J
2003-01-01
Zou and Yan have recently developed a skeletonization algorithm of digital shapes based on a regularity/singularity analysis; they use the polygon whose vertices are the boundary pixels of the image to compute a constrained Delaunay triangulation (CDT) in order to find local symmetries and stable regions. Their method has produced good results but it is slow since its complexity depends on the number of contour pixels. This paper presents an extension of their technique to handle arbitrary polygons, not only polygons of short edges. Consequently, not only can we achieve results as good as theirs for digital images, but we can also compute skeletons of polygons of any number of edges. Since we can handle polygonal approximations of figures, the skeletons are more resilient to noise and faster to process.
Does a point lie inside a polygon
International Nuclear Information System (INIS)
Milgram, M.S.
1988-01-01
A superficially simple problem in computational geometry is that of determining whether a query point P lies in the interior of a polygon if it lies in the polygon's plane. Answering this question is often required when tracking particles in a Monte Carlo program; it is asked frequently and an efficient algorithm is crucial. Littlefield has recently rediscovered Shimrat's algorithm, while in separate works, Wooff, Preparata and Shamos and Mehlhorn, as well as Yamaguchi, give other algorithms. A practical algorithm answering this question when the polygon's plane is skewed in space is not immediately evident from most of these methods. Additionally, all but one fails when two sides extend to infinity (open polygons). In this paper the author review the above methods and present a new, efficient algorithm, valid for all convex polygons, open or closed, and topologically connected in n-dimensional space (n ≥ 2)
Mixed FEM for Second Order Elliptic Problems on Polygonal Meshes with BEM-Based Spaces
Efendiev, Yalchin
2014-01-01
We present a Boundary Element Method (BEM)-based FEM for mixed formulations of second order elliptic problems in two dimensions. The challenge, we would like to address, is a proper construction of H(div)-conforming vector valued trial functions on arbitrary polygonal partitions of the domain. The proposed construction generates trial functions on polygonal elements which inherit some of the properties of the unknown solution. In the numerical realization, the relevant local problems are treated by means of boundary integral formulations. We test the accuracy of the method on two model problems. © 2014 Springer-Verlag.
Stretched polygons in a lattice tube
Energy Technology Data Exchange (ETDEWEB)
Atapour, M [Department of Mathematics and Statistics, York University, Toronto, ON M3J 1P3 (Canada); Soteros, C E [Department of Mathematics and Statistics, University of Saskatchewan, Saskatoon, SK S7N 5E6 (Canada); Whittington, S G [Department of Chemistry, University of Toronto, Toronto, ON M5S 3H6 (Canada)], E-mail: atapour@mathstat.yorku.ca, E-mail: soteros@math.usask.ca, E-mail: swhittin@chem.utoronto.ca
2009-08-14
We examine the topological entanglements of polygons confined to a lattice tube and under the influence of an external tensile force f. The existence of the limiting free energy for these so-called stretched polygons is proved and then, using transfer matrix arguments, a pattern theorem for stretched polygons is proved. Note that the tube constraint allows us to prove a pattern theorem for any arbitrary value of f, while without the tube constraint it has so far only been proved for large values of f. The stretched polygon pattern theorem is used first to show that the average span per edge of a randomly chosen n-edge stretched polygon approaches a positive value, non-decreasing in f, as n {yields} {infinity}. We then show that the knotting probability of an n-edge stretched polygon confined to a tube goes to one exponentially as n {yields} {infinity}. Thus as n {yields} {infinity} when polygons are influenced by a force f, no matter its strength or direction, topological entanglements, as defined by knotting, occur with high probability. (fast track communication)
Stretched polygons in a lattice tube
International Nuclear Information System (INIS)
Atapour, M; Soteros, C E; Whittington, S G
2009-01-01
We examine the topological entanglements of polygons confined to a lattice tube and under the influence of an external tensile force f. The existence of the limiting free energy for these so-called stretched polygons is proved and then, using transfer matrix arguments, a pattern theorem for stretched polygons is proved. Note that the tube constraint allows us to prove a pattern theorem for any arbitrary value of f, while without the tube constraint it has so far only been proved for large values of f. The stretched polygon pattern theorem is used first to show that the average span per edge of a randomly chosen n-edge stretched polygon approaches a positive value, non-decreasing in f, as n → ∞. We then show that the knotting probability of an n-edge stretched polygon confined to a tube goes to one exponentially as n → ∞. Thus as n → ∞ when polygons are influenced by a force f, no matter its strength or direction, topological entanglements, as defined by knotting, occur with high probability. (fast track communication)
Analytical approach of laser beam propagation in the hollow polygonal light pipe.
Zhu, Guangzhi; Zhu, Xiao; Zhu, Changhong
2013-08-10
An analytical method of researching the light distribution properties on the output end of a hollow n-sided polygonal light pipe and a light source with a Gaussian distribution is developed. The mirror transformation matrices and a special algorithm of removing void virtual images are created to acquire the location and direction vector of each effective virtual image on the entrance plane. The analytical method is demonstrated by Monte Carlo ray tracing. At the same time, four typical cases are discussed. The analytical results indicate that the uniformity of light distribution varies with the structural and optical parameters of the hollow n-sided polygonal light pipe and light source with a Gaussian distribution. The analytical approach will be useful to design and choose the hollow n-sided polygonal light pipe, especially for high-power laser beam homogenization techniques.
Finding the Most Uniform Changes in Vowel Polygon Caused by Psychological Stress
Directory of Open Access Journals (Sweden)
M. Stanek
2015-06-01
Full Text Available Using vowel polygons, exactly their parameters, is chosen as the criterion for achievement of differences between normal state of speaker and relevant speech under real psychological stress. All results were experimentally obtained by created software for vowel polygon analysis applied on ExamStress database. Selected 6 methods based on cross-correlation of different features were classified by the coefficient of variation and for each individual vowel polygon, the efficiency coefficient marking the most significant and uniform differences between stressed and normal speech were calculated. As the best method for observing generated differences resulted method considered mean of cross correlation values received for difference area value with vector length and angle parameter couples. Generally, best results for stress detection are achieved by vowel triangles created by /i/-/o/-/u/ and /a/-/i/-/o/ vowel triangles in formant planes containing the fifth formant F5 combined with other formants.
Probing convex polygons with X-rays
International Nuclear Information System (INIS)
Edelsbrunner, H.; Skiena, S.S.
1988-01-01
An X-ray probe through a polygon measures the length of intersection between a line and the polygon. This paper considers the properties of various classes of X-ray probes, and shows how they interact to give finite strategies for completely describing convex n-gons. It is shown that (3n/2)+6 probes are sufficient to verify a specified n-gon, while for determining convex polygons (3n-1)/2 X-ray probes are necessary and 5n+O(1) sufficient, with 3n+O(1) sufficient given that a lower bound on the size of the smallest edge of P is known
Polygons on a rotating fluid surface
DEFF Research Database (Denmark)
Jansson, Thomas R.N.; Haspang, Martin P.; Jensen, Kåre H.
2006-01-01
We report a novel and spectacular instability of a fluid surface in a rotating system. In a flow driven by rotating the bottom plate of a partially filled, stationary cylindrical container, the shape of the free surface can spontaneously break the axial symmetry and assume the form of a polygon...... rotating rigidly with a speed different from that of the plate. With water, we have observed polygons with up to 6 corners. It has been known for many years that such flows are prone to symmetry breaking, but apparently the polygonal surface shapes have never been observed. The creation of rotating...
Hawaii ESI: INVERT (Invertebrate Polygons)
National Oceanic and Atmospheric Administration, Department of Commerce — This data set contains sensitive biological resource data for marine, estuarine, terrestrial, and native stream invertebrate species in coastal Hawaii. Vector...
Comic image understanding based on polygon detection
Li, Luyuan; Wang, Yongtao; Tang, Zhi; Liu, Dong
2013-01-01
Comic image understanding aims to automatically decompose scanned comic page images into storyboards and then identify the reading order of them, which is the key technique to produce digital comic documents that are suitable for reading on mobile devices. In this paper, we propose a novel comic image understanding method based on polygon detection. First, we segment a comic page images into storyboards by finding the polygonal enclosing box of each storyboard. Then, each storyboard can be represented by a polygon, and the reading order of them is determined by analyzing the relative geometric relationship between each pair of polygons. The proposed method is tested on 2000 comic images from ten printed comic series, and the experimental results demonstrate that it works well on different types of comic images.
Infinite genus surfaces and irrational polygonal billiards
Valdez, Ferrán
2009-01-01
We prove that the natural invariant surface associated with the billiard game on an irrational polygonal table is homeomorphic to the Loch Ness monster, that is, the only orientable infinite genus topological real surface with exactly one end.
From Newton's bucket to rotating polygons
DEFF Research Database (Denmark)
Bach, B.; Linnartz, E. C.; Vested, Malene Louise Hovgaard
2014-01-01
We present an experimental study of 'polygons' forming on the free surface of a swirling water flow in a partially filled cylindrical container. In our set-up, we rotate the bottom plate and the cylinder wall with separate motors. We thereby vary rotation rate and shear strength independently...... and move from a rigidly rotating 'Newton's bucket' flow to one where bottom and cylinder wall are rotating oppositely and the surface is strongly turbulent but flat on average. Between those two extremes, we find polygonal states for which the rotational symmetry is spontaneously broken. We investigate...... the phase diagram spanned by the two rotational frequencies at a given water filling height and find polygons in a regime, where the two frequencies are sufficiently different and, predominantly, when they have opposite signs. In addition to the extension of the family of polygons found with the stationary...
Anisotropic rectangular metric for polygonal surface remeshing
Pellenard, Bertrand
2013-06-18
We propose a new method for anisotropic polygonal surface remeshing. Our algorithm takes as input a surface triangle mesh. An anisotropic rectangular metric, defined at each triangle facet of the input mesh, is derived from both a user-specified normal-based tolerance error and the requirement to favor rectangle-shaped polygons. Our algorithm uses a greedy optimization procedure that adds, deletes and relocates generators so as to match two criteria related to partitioning and conformity.
Anisotropic rectangular metric for polygonal surface remeshing
Pellenard, Bertrand; Morvan, Jean-Marie; Alliez, Pierre
2013-01-01
We propose a new method for anisotropic polygonal surface remeshing. Our algorithm takes as input a surface triangle mesh. An anisotropic rectangular metric, defined at each triangle facet of the input mesh, is derived from both a user-specified normal-based tolerance error and the requirement to favor rectangle-shaped polygons. Our algorithm uses a greedy optimization procedure that adds, deletes and relocates generators so as to match two criteria related to partitioning and conformity.
Generating equilateral random polygons in confinement II
International Nuclear Information System (INIS)
Diao, Y; Ernst, C; Montemayor, A; Ziegler, U
2012-01-01
In this paper we continue an earlier study (Diao et al 2011 J. Phys. A: Math. Theor. 44 405202) on the generation algorithms of random equilateral polygons confined in a sphere. Here, the equilateral random polygons are rooted at the center of the confining sphere and the confining sphere behaves like an absorbing boundary. One way to generate such a random polygon is the accept/reject method in which an unconditioned equilateral random polygon rooted at origin is generated. The polygon is accepted if it is within the confining sphere, otherwise it is rejected and the process is repeated. The algorithm proposed in this paper offers an alternative to the accept/reject method, yielding a faster generation process when the confining sphere is small. In order to use this algorithm effectively, a large, reusable data set needs to be pre-computed only once. We derive the theoretical distribution of the given random polygon model and demonstrate, with strong numerical evidence, that our implementation of the algorithm follows this distribution. A run time analysis and a numerical error estimate are given at the end of the paper. (paper)
Control of grinding polygonal surfaces
Directory of Open Access Journals (Sweden)
Юрій Володимирович Петраков
2017-12-01
Full Text Available Grinding of non-round surfaces, in particular polygonal surfaces of dies, is characterized by substantial non stationary. At different sections of the profile, the change in the main characteristic (Material Removal Rate – MRR process reaches tens of times. To stabilize the grinding process, it is recommended to control the spindle speed of the workpiece CNC grinding machine. Created software that allows to design the control program on the basis of mathematical model of the system. The determination of MRR is realized automatically in the simulation of the grinding process which uses the algorithm developed for solving problems in geometric interaction of the workpiece and the wheel. In forming the control program is possible takes into account the limitations on the maximum circumferential force of cutting, and the maximum allowable acceleration of the machine spindle. Practice has shown that full stabilization is not obtained, even though the performance is increased more than 2 times, while ensuring the quality of the surface. The developed block diagram of the grinding process can serve as a basis for further improvement in the solution of dynamic problems.
Minnesota Department of Natural Resources — This vector dataset is a detailed (1-acre minimum), hierarchically organized vegetation cover map produced by computer classification of combined two-season pairs of...
Kansas Data Access and Support Center — The Kansas Tagged Vector Contour (TVC) dataset consists of digitized contours from the 7.5 minute topographic quadrangle maps. Coverage for the state is incomplete....
Matching soil grid unit resolutions with polygon unit scales for DNDC modelling of regional SOC pool
Zhang, H. D.; Yu, D. S.; Ni, Y. L.; Zhang, L. M.; Shi, X. Z.
2015-03-01
Matching soil grid unit resolution with polygon unit map scale is important to minimize uncertainty of regional soil organic carbon (SOC) pool simulation as their strong influences on the uncertainty. A series of soil grid units at varying cell sizes were derived from soil polygon units at the six map scales of 1:50 000 (C5), 1:200 000 (D2), 1:500 000 (P5), 1:1 000 000 (N1), 1:4 000 000 (N4) and 1:14 000 000 (N14), respectively, in the Tai lake region of China. Both format soil units were used for regional SOC pool simulation with DeNitrification-DeComposition (DNDC) process-based model, which runs span the time period 1982 to 2000 at the six map scales, respectively. Four indices, soil type number (STN) and area (AREA), average SOC density (ASOCD) and total SOC stocks (SOCS) of surface paddy soils simulated with the DNDC, were attributed from all these soil polygon and grid units, respectively. Subjecting to the four index values (IV) from the parent polygon units, the variation of an index value (VIV, %) from the grid units was used to assess its dataset accuracy and redundancy, which reflects uncertainty in the simulation of SOC. Optimal soil grid unit resolutions were generated and suggested for the DNDC simulation of regional SOC pool, matching with soil polygon units map scales, respectively. With the optimal raster resolution the soil grid units dataset can hold the same accuracy as its parent polygon units dataset without any redundancy, when VIV indices was assumed as criteria to the assessment. An quadratic curve regression model y = -8.0 × 10-6x2 + 0.228x + 0.211 (R2 = 0.9994, p < 0.05) was revealed, which describes the relationship between optimal soil grid unit resolution (y, km) and soil polygon unit map scale (1:x). The knowledge may serve for grid partitioning of regions focused on the investigation and simulation of SOC pool dynamics at certain map scale.
Microtopographic control on the ground thermal regime in ice wedge polygons
Abolt, Charles J.; Young, Michael H.; Atchley, Adam L.; Harp, Dylan R.
2018-06-01
The goal of this research is to constrain the influence of ice wedge polygon microtopography on near-surface ground temperatures. Ice wedge polygon microtopography is prone to rapid deformation in a changing climate, and cracking in the ice wedge depends on thermal conditions at the top of the permafrost; therefore, feedbacks between microtopography and ground temperature can shed light on the potential for future ice wedge cracking in the Arctic. We first report on a year of sub-daily ground temperature observations at 5 depths and 9 locations throughout a cluster of low-centered polygons near Prudhoe Bay, Alaska, and demonstrate that the rims become the coldest zone of the polygon during winter, due to thinner snowpack. We then calibrate a polygon-scale numerical model of coupled thermal and hydrologic processes against this dataset, achieving an RMSE of less than 1.1 °C between observed and simulated ground temperature. Finally, we conduct a sensitivity analysis of the model by systematically manipulating the height of the rims and the depth of the troughs and tracking the effects on ice wedge temperature. The results indicate that winter temperatures in the ice wedge are sensitive to both rim height and trough depth, but more sensitive to rim height. Rims act as preferential outlets of subsurface heat; increasing rim size decreases winter temperatures in the ice wedge. Deeper troughs lead to increased snow entrapment, promoting insulation of the ice wedge. The potential for ice wedge cracking is therefore reduced if rims are destroyed or if troughs subside, due to warmer conditions in the ice wedge. These findings can help explain the origins of secondary ice wedges in modern and ancient polygons. The findings also imply that the potential for re-establishing rims in modern thermokarst-affected terrain will be limited by reduced cracking activity in the ice wedges, even if regional air temperatures stabilize.
Generating equilateral random polygons in confinement
International Nuclear Information System (INIS)
Diao, Y; Ernst, C; Montemayor, A; Ziegler, U
2011-01-01
One challenging problem in biology is to understand the mechanism of DNA packing in a confined volume such as a cell. It is known that confined circular DNA is often knotted and hence the topology of the extracted (and relaxed) circular DNA can be used as a probe of the DNA packing mechanism. However, in order to properly estimate the topological properties of the confined circular DNA structures using mathematical models, it is necessary to generate large ensembles of simulated closed chains (i.e. polygons) of equal edge lengths that are confined in a volume such as a sphere of certain fixed radius. Finding efficient algorithms that properly sample the space of such confined equilateral random polygons is a difficult problem. In this paper, we propose a method that generates confined equilateral random polygons based on their probability distribution. This method requires the creation of a large database initially. However, once the database has been created, a confined equilateral random polygon of length n can be generated in linear time in terms of n. The errors introduced by the method can be controlled and reduced by the refinement of the database. Furthermore, our numerical simulations indicate that these errors are unbiased and tend to cancel each other in a long polygon. (paper)
Minimal knotted polygons in cubic lattices
International Nuclear Information System (INIS)
Van Rensburg, E J Janse; Rechnitzer, A
2011-01-01
In this paper we examine numerically the properties of minimal length knotted lattice polygons in the simple cubic, face-centered cubic, and body-centered cubic lattices by sieving minimal length polygons from a data stream of a Monte Carlo algorithm, implemented as described in Aragão de Carvalho and Caracciolo (1983 Phys. Rev. B 27 1635), Aragão de Carvalho et al (1983 Nucl. Phys. B 215 209) and Berg and Foester (1981 Phys. Lett. B 106 323). The entropy, mean writhe, and mean curvature of minimal length polygons are computed (in some cases exactly). While the minimal length and mean curvature are found to be lattice dependent, the mean writhe is found to be only weakly dependent on the lattice type. Comparison of our results to numerical results for the writhe obtained elsewhere (see Janse van Rensburg et al 1999 Contributed to Ideal Knots (Series on Knots and Everything vol 19) ed Stasiak, Katritch and Kauffman (Singapore: World Scientific), Portillo et al 2011 J. Phys. A: Math. Theor. 44 275004) shows that the mean writhe is also insensitive to the length of a knotted polygon. Thus, while these results for the mean writhe and mean absolute writhe at minimal length are not universal, our results demonstrate that these values are quite close the those of long polygons regardless of the underlying lattice and length
PATTERN CLASSIFICATION APPROACHES TO MATCHING BUILDING POLYGONS AT MULTIPLE SCALES
Directory of Open Access Journals (Sweden)
X. Zhang
2012-07-01
Full Text Available Matching of building polygons with different levels of detail is crucial in the maintenance and quality assessment of multi-representation databases. Two general problems need to be addressed in the matching process: (1 Which criteria are suitable? (2 How to effectively combine different criteria to make decisions? This paper mainly focuses on the second issue and views data matching as a supervised pattern classification. Several classifiers (i.e. decision trees, Naive Bayes and support vector machines are evaluated for the matching task. Four criteria (i.e. position, size, shape and orientation are used to extract information for these classifiers. Evidence shows that these classifiers outperformed the weighted average approach.
Two generalizations of column-convex polygons
International Nuclear Information System (INIS)
Feretic, Svjetlan; Guttmann, Anthony J
2009-01-01
Column-convex polygons were first counted by area several decades ago, and the result was found to be a simple, rational, generating function. In this work we generalize that result. Let a p-column polyomino be a polyomino whose columns can have 1, 2, ..., p connected components. Then column-convex polygons are equivalent to 1-convex polyominoes. The area generating function of even the simplest generalization, namely 2-column polyominoes, is unlikely to be solvable. We therefore define two classes of polyominoes which interpolate between column-convex polygons and 2-column polyominoes. We derive the area generating functions of those two classes, using extensions of existing algorithms. The growth constants of both classes are greater than the growth constant of column-convex polyominoes. Rather tight lower bounds on the growth constants complement a comprehensive asymptotic analysis.
Steady state of tapped granular polygons
International Nuclear Information System (INIS)
Carlevaro, Carlos M; Pugnaloni, Luis A
2011-01-01
The steady state packing fraction of a tapped granular bed is studied for different grain shapes via a discrete element method. Grains are monosized regular polygons, from triangles to icosagons. Comparisons with disc packings show that the steady state packing fraction as a function of the tapping intensity presents the same general trends in polygon packings. However, better packing fractions are obtained, as expected, for shapes that can tessellate the plane (triangles, squares and hexagons). In addition, we find a sharp transition for packings of polygons with more than 13 vertices signaled by a discontinuity in the packing fraction at a particular tapping intensity. Density fluctuations for most shapes are consistent with recent experimental findings in disc packing; however, a peculiar behavior is found for triangles and squares
Polygons on a rotating fluid surface.
Jansson, Thomas R N; Haspang, Martin P; Jensen, Kåre H; Hersen, Pascal; Bohr, Tomas
2006-05-05
We report a novel and spectacular instability of a fluid surface in a rotating system. In a flow driven by rotating the bottom plate of a partially filled, stationary cylindrical container, the shape of the free surface can spontaneously break the axial symmetry and assume the form of a polygon rotating rigidly with a speed different from that of the plate. With water, we have observed polygons with up to 6 corners. It has been known for many years that such flows are prone to symmetry breaking, but apparently the polygonal surface shapes have never been observed. The creation of rotating internal waves in a similar setup was observed for much lower rotation rates, where the free surface remains essentially flat [J. M. Lopez, J. Fluid Mech. 502, 99 (2004). We speculate that the instability is caused by the strong azimuthal shear due to the stationary walls and that it is triggered by minute wobbling of the rotating plate.
Exact generating function for 2-convex polygons
International Nuclear Information System (INIS)
James, W R G; Jensen, I; Guttmann, A J
2008-01-01
Polygons are described as almost-convex if their perimeter differs from the perimeter of their minimum bounding rectangle by twice their 'concavity index', m. Such polygons are called m-convex polygons and are characterized by having up to m indentations in their perimeter. We first describe how we conjectured the (isotropic) generating function for the case m = 2 using a numerical procedure based on series expansions. We then proceed to prove this result for the more general case of the full anisotropic generating function, in which steps in the x and y directions are distinguished. In doing so, we develop tools that would allow for the case m > 2 to be studied
Generating equilateral random polygons in confinement III
International Nuclear Information System (INIS)
Diao, Y; Ernst, C; Montemayor, A; Ziegler, U
2012-01-01
In this paper we continue our earlier studies (Diao et al 2011 J. Phys. A: Math. Theor. 44 405202, Diao et al J. Phys. A: Math. Theor. 45 275203) on the generation methods of random equilateral polygons confined in a sphere. The first half of this paper is concerned with the generation of confined equilateral random walks. We show that if the selection of a vertex is uniform subject to the position of its previous vertex and the confining condition, then the distributions of the vertices are not uniform, although there exists a distribution such that if the initial vertex is selected following this distribution, then all vertices of the random walk follow this same distribution. Thus in order to generate a confined equilateral random walk, the selection of a vertex cannot be uniform subject to the position of its previous vertex and the confining condition. We provide a simple algorithm capable of generating confined equilateral random walks whose vertex distribution is almost uniform in the confinement sphere. In the second half of this paper we show that any process generating confined equilateral random walks can be turned into a process generating confined equilateral random polygons with the property that the vertex distribution of the polygons approaches the vertex distribution of the walks as the polygons get longer and longer. In our earlier studies, the starting point of the confined polygon is fixed at the center of the sphere. The new approach here allows us to move the starting point of the confined polygon off the center of the sphere. (paper)
Equipartitioning and balancing points of polygons
Directory of Open Access Journals (Sweden)
Shunmugam Pillay
2010-07-01
Full Text Available The centre of mass G of a triangle has the property that the rays to the vertices from G sweep out triangles having equal areas. We show that such points, termed equipartitioning points in this paper, need not exist in other polygons. A necessary and sufficient condition for a quadrilateral to have an equipartitioning point is that one of its diagonals bisects the other. The general theorem, namely, necessary and sufficient conditions for equipartitioning points for arbitrary polygons to exist, is also stated and proved. When this happens, they are in general, distinct from the centre of mass. In parallelograms, and only in them, do the two points coincide.
Slow relaxation in weakly open rational polygons.
Kokshenev, Valery B; Vicentini, Eduardo
2003-07-01
The interplay between the regular (piecewise-linear) and irregular (vertex-angle) boundary effects in nonintegrable rational polygonal billiards (of m equal sides) is discussed. Decay dynamics in polygons (of perimeter P(m) and small opening Delta) is analyzed through the late-time survival probability S(m) approximately equal t(-delta). Two distinct slow relaxation channels are established. The primary universal channel exhibits relaxation of regular sliding orbits, with delta=1. The secondary channel is given by delta>1 and becomes open when m>P(m)/Delta. It originates from vertex order-disorder dual effects and is due to relaxation of chaoticlike excitations.
Random packing of regular polygons and star polygons on a flat two-dimensional surface.
Cieśla, Michał; Barbasz, Jakub
2014-08-01
Random packing of unoriented regular polygons and star polygons on a two-dimensional flat continuous surface is studied numerically using random sequential adsorption algorithm. Obtained results are analyzed to determine the saturated random packing ratio as well as its density autocorrelation function. Additionally, the kinetics of packing growth and available surface function are measured. In general, stars give lower packing ratios than polygons, but when the number of vertexes is large enough, both shapes approach disks and, therefore, properties of their packing reproduce already known results for disks.
Dilation-optimal edge deletion in polygonal cycles
Ahn, H.K.; Farshi, M.; Knauer, C.; Smid, M.H.M.; Wang, Y.; Tokuyama, T.
2007-01-01
Let C be a polygonal cycle on n vertices in the plane. A randomized algorithm is presented which computes in O(n log3 n) expected time, the edge of C whose removal results in a polygonal path of smallest possible dilation. It is also shown that the edge whose removal gives a polygonal path of
Calculating the Areas of Polygons with a Smartphone Light Sensor
Kapucu, Serkan; Simsek, Mertkan; Öçal, Mehmet Fatih
2017-01-01
This study explores finding the areas of polygons with a smartphone light sensor. A square and an irregular pentagon were chosen as our polygons. During the activity, the LED light was placed at the vertices of our polygons, and the illuminance values of this LED light were detected by the smartphone light sensor. The smartphone was placed on a…
Automatically repairing invalid polygons with a constrained triangulation
Ledoux, H.; Arroyo Ohori, K.; Meijers, M.
2012-01-01
Although the validation of single polygons has received considerable attention, the automatic repair of invalid polygons has not. Automated repair methods can be considered as interpreting ambiguous or ill-defined polygons and giving a coherent and clearly defined output. At this moment, automatic
Realistic roofs over a rectilinear polygon
Ahn, Heekap; Bae, Sangwon; Knauer, Christian; Lee, Mira; Shin, Chansu; Vigneron, Antoine E.
2013-01-01
Given a simple rectilinear polygon P in the xy-plane, a roof over P is a terrain over P whose faces are supported by planes through edges of P that make a dihedral angle π/4 with the xy-plane. According to this definition, some roofs may have faces
Exploring Nonconvex, Crossed and Degenerate Polygons
Contreras, Jose N.
2004-01-01
An exploration of nonconvex, crossed, and degenerate polygons (NCCDPs) are described with the help of examples with pedagogical tips and recommendations that are found useful when teaching the mathematical process of extending geometric patterns to NCCDPs. The study concludes that investigating such extensions with interactive geometry software…
Generating realistic roofs over a rectilinear polygon
Ahn, Heekap; Bae, Sangwon; Knauer, Christian; Lee, Mira; Shin, Chansu; Vigneron, Antoine E.
2011-01-01
Given a simple rectilinear polygon P in the xy-plane, a roof over P is a terrain over P whose faces are supported by planes through edges of P that make a dihedral angle π/4 with the xy-plane. In this paper, we introduce realistic roofs by imposing
The structure of near polygons with quads
Brouwer, A.E.; Wilbrink, H.A.
1983-01-01
We develop a structure theory for near polygons with quads. Main results are the existence of sub 2j-gons for 2jd and the nonexistence of regular sporadic 2d-gons for d4 with s>1 and t 2>1 and t 3t 2(t 2+1).
Fair partitions of polygons: An elementary introduction
Indian Academy of Sciences (India)
In this paper we discuss only convex polygonal regions with finite number of sides. But we think this property holds ... trivial interest and have updated [9] into the present paper. 2. Proof of the conjecture N = .... surface have a proper intersection if they cut through each other either at a point or after being coincident in a finite ...
Some solvable, and as yet unsolvable, polygon and walk models
International Nuclear Information System (INIS)
Guttmann, Anthony J
2006-01-01
One partly solvable and two solvable models of polygons are discussed. Using a simple transfer matrix approach Iwan Jensen has derived very long series expansions for the perimeter generating function of both three-choice polygons and punctured staircase polygons. In both cases it is found that all the terms in the generating function can be reproduced from a linear Fuchsian differential equation of order 8. We report on an analysis of the properties of the differential equations. Recently Enrica Duchi has discussed the problem of so-called prudent self-avoiding walks. We discuss the polygon analogue of this problem, and argue that the generating function for prudent polygons is unlikely to be differentiably finite, though a restricted version of the problem, called prudent polygons of the second type, is likely to be differentiably finite. The exact generating function for prudent polygons of the first type is also found
VECTORIZATION OF ROAD DATA EXTRACTED FROM AERIAL AND UAV IMAGERY
Directory of Open Access Journals (Sweden)
D. Bulatov
2016-06-01
Full Text Available Road databases are essential instances of urban infrastructure. Therefore, automatic road detection from sensor data has been an important research activity during many decades. Given aerial images in a sufficient resolution, dense 3D reconstruction can be performed. Starting at a classification result of road pixels from combined elevation and optical data, we present in this paper a fivestep procedure for creating vectorized road networks. These main steps of the algorithm are: preprocessing, thinning, polygonization, filtering, and generalization. In particular, for the generalization step, which represents the principal area of innovation, two strategies are presented. The first strategy corresponds to a modification of the Douglas-Peucker-algorithm in order to reduce the number of vertices while the second strategy allows a smoother representation of street windings by Bezir curves, which results in reduction – to a decimal power – of the total curvature defined for the dataset. We tested our approach on three datasets with different complexity. The quantitative assessment of the results was performed by means of shapefiles from OpenStreetMap data. For a threshold of 6 m, completeness and correctness values of up to 85% were achieved.
Self-assembly of chiral molecular polygons.
Jiang, Hua; Lin, Wenbin
2003-07-09
Treatment of 2,2'-diacetyl-1,1'-binaphthyl-6,6'-bis(ethyne), L-H2, with 1 equiv of trans-Pt(PEt3)2Cl2 led to a mixture of different sizes of chiral metallocycles [trans-(PEt3)2Pt(L)]n (n = 3-8, 1-6). Each of the chiral molecular polygons 1-6 was purified by silica gel column chromatography and characterized by 1H, 13C{1H}, and 31P{1H} NMR spectroscopy, MS, IR, UV-vis, and circular dichroism spectroscopies, and microanalysis. The presence of tunable cavities (1.4-4.3 nm) and chiral functionalities in these molecular polygons promises to make them excellent receptors for a variety of guests.
Simulating 3D deformation using connected polygons
Tarigan, J. T.; Jaya, I.; Hardi, S. M.; Zamzami, E. M.
2018-03-01
In modern 3D application, interaction between user and the virtual world is one of an important factor to increase the realism. This interaction can be visualized in many forms; one of them is object deformation. There are many ways to simulate object deformation in virtual 3D world; each comes with different level of realism and performance. Our objective is to present a new method to simulate object deformation by using a graph-connected polygon. In this solution, each object contains multiple level of polygons in different level of volume. The proposed solution focusses on performance rather while maintaining the acceptable level of realism. In this paper, we present the design and implementation of our solution and show that this solution is usable in performance sensitive 3D application such as games and virtual reality.
Counting convex polygons in planar point sets
Mitchell, J.S.B.; Rote, G.; Sundaram, Gopalakrishnan; Woeginger, G.J.
1995-01-01
Given a set S of n points in the plane, we compute in time O(n3) the total number of convex polygons whose vertices are a subset of S. We give an O(m · n3) algorithm for computing the number of convex k-gons with vertices in S, for all values k = 3,…, m; previously known bounds were exponential
Non-convex polygons clustering algorithm
Directory of Open Access Journals (Sweden)
Kruglikov Alexey
2016-01-01
Full Text Available A clustering algorithm is proposed, to be used as a preliminary step in motion planning. It is tightly coupled to the applied problem statement, i.e. uses parameters meaningful only with respect to it. Use of geometrical properties for polygons clustering allows for a better calculation time as opposed to general-purpose algorithms. A special form of map optimized for quick motion planning is constructed as a result.
137Cs in Research Polygon 'Sumbar'
International Nuclear Information System (INIS)
Skoko, B.; Marovic, G.; Babic, D.; Vickovic, I.
2011-01-01
In 2009, Radiation Protection Unit of the Institute for Medical Reseach and Occupational Health started a radioactivity measurement programme in research polygon ''Sumbar''. The purpose of these investigations is to collect as many data as possible about the contamination of the polygon that is mainly covered by a forest of English oak (Quercus robur) and hornbeam (Carpinus betulus). Once contaminated, forests represent long-term sources of radiation exposure to specific population groups which are using them as a source of foodstuffs. After the Chernobyl accident, researchers have shown that there has been more variability in radionuclide activity concentration in forests than in agricultural ecosystems. In order to carry out a radioactivity screening of the polygon, we randomly chosed three sampling sites for collecting soil, grass and moss samples. Different species of mushrooms were collected over the whole polygon area. The average activity concentration of 137Cs in soil for two sampling sites is (123 @ 9) Bq kg -1 , while the result for the third site is lower by an order of magnitude ((16.1@0.5) Bq kg -1 ). The activity concentration of 137Cs in grass samples ranges from (0.43 @ 0.03) Bq kg -1 to (13.2 @ 0.1) Bq kg -1 , and in moss samples from (8.7 @ 0.2) Bq kg -1 to (57.8 @ 0.3) Bq kg - 1. In five collected mushroom species, the activity of 137Cs is in the range between (4.1 @ 0.5) Bq kg -1 and (610 @ 5) Bq kg -1 , the lowest and the highest values referreing to Clitocybe nebularis and Gymnopus dryophilus, respectively. Parasitic mushrooms exhibit activity below the minimum detection level. Our preliminary results show and confirm variability of the activity concentration of 137Cs in different parts of this ecosystem. (author)
NSGIC Education | GIS Inventory — Fire Stations dataset current as of 2011. LAGIC is consulting with local parish GIS departments to create spatially accurate point and polygons data sets including...
NSGIC Education | GIS Inventory — Grocery Stores dataset current as of 2011. LAGIC is consulting with local parish GIS departments to create spatially accurate point and polygons data sets including...
NSGIC Education | GIS Inventory — Libraries dataset current as of 2011. LAGIC is consulting with local parish GIS departments to create spatially accurate point and polygons data sets including the...
NSGIC Local Govt | GIS Inventory — Parcels and Land Ownership dataset current as of 2005. ParcelView-The data set is a view of the parcel polygon consisting of more than 93,000 tax parcel boundaries...
U.S. Environmental Protection Agency — EPA Nanorelease Dataset. This dataset is associated with the following publication: Wohlleben, W., C. Kingston, J. Carter, E. Sahle-Demessie, S. Vazquez-Campos, B....
Generating random walks and polygons with stiffness in confinement
International Nuclear Information System (INIS)
Diao, Y; Ernst, C; Saarinen, S; Ziegler, U
2015-01-01
The purpose of this paper is to explore ways to generate random walks and polygons in confinement with a bias toward stiffness. Here the stiffness refers to the curvature angle between two consecutive edges along the random walk or polygon. The stiffer the walk (polygon), the smaller this angle on average. Thus random walks and polygons with an elevated stiffness have lower than expected curvatures. The authors introduced and studied several generation algorithms with a stiffness parameter s>0 that regulates the expected curvature angle at a given vertex in which the random walks and polygons are generated one edge at a time using conditional probability density functions. Our generating algorithms also allow the generation of unconfined random walks and polygons with any desired mean curvature angle. In the case of random walks and polygons confined in a sphere of fixed radius, we observe that, as expected, stiff random walks or polygons are more likely to be close to the confinement boundary. The methods developed here require that the random walks and random polygons be rooted at the center of the confinement sphere. (paper)
The magnetic field generated by a rotating charged polygon
International Nuclear Information System (INIS)
Wan, Songlin; Chen, Xiangyu; Teng, Baohua; Fu, Hao; Li, Yefeng; Wu, Minghe; Wu, Shaoyi; Balfour, E A
2014-01-01
The magnetic field along the symmetry axis of a regular polygon carrying a uniform electric charge on its edges is calculated systematically when the polygon is rotated about this axis of symmetry. A group of circular current-carrying coils arranged concentrically about the axis of the polygon has been designed to simulate the magnetic field characteristics of the rotating charged polygon. The magnetic field of the simulated coils is measured using the PASCO magnetic field sensor. The results show that the theoretical calculation agrees well with the experimental results. (paper)
International Nuclear Information System (INIS)
Exner, P.; Kolerov, G.I.
1981-01-01
Properties of the subset of polygonal paths in the Hilbert space H of paths referring to a d-dimensional quantum-mechanical system are examined. Using the reproduction kernel technique we prove that each element of H is approximated by polygonal paths uniformly with respect to the ''norm'' of time-interval partitions. This result will be applied in the second part of the present paper to prove consistency of the uniform polygonal-path extension of the Feynman maps [ru
Calculation of gravity and magnetic anomalies of finite-length right polygonal prisms.
Cady, J.W.
1980-01-01
An equation is derived for the vertical gravity field due to a homogeneous body with polygonal cross‐section and finite strike‐length. The equation can be separated into the two‐dimensional (2-D) terms of Talwani et al. (1959) and exact terms for the contributions of the ends of the prism. Equations for the magnetic field due to a similar body were derived by Shuey and Pasquale (1973), who coined the term “two‐and‐a‐half dimensional” (2 1/2-D) to describe the geometry. Magnetic intensities are expressed as a vector sum, from which the common dot product formulation can be obtained by binomial expansion.
Finding the Maximal Area of Bounded Polygons in a Circle
Rokach, Arie
2005-01-01
The article deals with the area of polygons that are inscribed in a given circle. Naturally, the following question arises: Among all n-polygons that are inscribed in a given circle, which one has the biggest area? Intuitively, it may be guessed that is suitable for secondary students, and without any use id calculus, but only using very…
Beam envelope profile of non-centrosymmetric polygonal phase space
International Nuclear Information System (INIS)
Chen Yinbao; Xie Xi
1984-01-01
The general theory of beam envelope profile of non-centrosymmetric polygonal phase space is developed. By means of this theory the beam envelope profile of non-centrosymmetric polygonal phase space can be calculated directly. An example is carried out in detail to show the practical application of the theory
Hamiltonian evolutions of twisted polygons in RPn
International Nuclear Information System (INIS)
Beffa, Gloria Marì; Wang, Jing Ping
2013-01-01
In this paper we find a discrete moving frame and their associated invariants along projective polygons in RP n , and we use them to describe invariant evolutions of projective N-gons. We then apply a reduction process to obtain a natural Hamiltonian structure on the space of projective invariants for polygons, establishing a close relationship between the projective N-gon invariant evolutions and the Hamiltonian evolutions on the invariants of the flow. We prove that any Hamiltonian evolution is induced on invariants by an invariant evolution of N-gons—what we call a projective realization—and both evolutions are connected explicitly in a very simple way. Finally, we provide a completely integrable evolution (the Boussinesq lattice related to the lattice W 3 -algebra), its projective realization in RP 2 and its Hamiltonian pencil. We generalize both structures to n-dimensions and we prove that they are Poisson, defining explicitly the n-dimensional generalization of the planar evolution (a discretization of the W n -algebra). We prove that the generalization is completely integrable, and we also give its projective realization, which turns out to be very simple. (paper)
Identifying Conventionally Sub-Seismic Faults in Polygonal Fault Systems
Fry, C.; Dix, J.
2017-12-01
Polygonal Fault Systems (PFS) are prevalent in hydrocarbon basins globally and represent potential fluid pathways. However the characterization of these pathways is subject to the limitations of conventional 3D seismic imaging; only capable of resolving features on a decametre scale horizontally and metres scale vertically. While outcrop and core examples can identify smaller features, they are limited by the extent of the exposures. The disparity between these scales can allow for smaller faults to be lost in a resolution gap which could mean potential pathways are left unseen. Here the focus is upon PFS from within the London Clay, a common bedrock that is tunnelled into and bears construction foundations for much of London. It is a continuation of the Ieper Clay where PFS were first identified and is found to approach the seafloor within the Outer Thames Estuary. This allows for the direct analysis of PFS surface expressions, via the use of high resolution 1m bathymetric imaging in combination with high resolution seismic imaging. Through use of these datasets surface expressions of over 1500 faults within the London Clay have been identified, with the smallest fault measuring 12m and the largest at 612m in length. The displacements over these faults established from both bathymetric and seismic imaging ranges from 30cm to a couple of metres, scales that would typically be sub-seismic for conventional basin seismic imaging. The orientations and dimensions of the faults within this network have been directly compared to 3D seismic data of the Ieper Clay from the offshore Dutch sector where it exists approximately 1km below the seafloor. These have typical PFS attributes with lengths of hundreds of metres to kilometres and throws of tens of metres, a magnitude larger than those identified in the Outer Thames Estuary. The similar orientations and polygonal patterns within both locations indicates that the smaller faults exist within typical PFS structure but are
Linking of uniform random polygons in confined spaces
Arsuaga, J.; Blackstone, T.; Diao, Y.; Karadayi, E.; Saito, M.
2007-03-01
In this paper, we study the topological entanglement of uniform random polygons in a confined space. We derive the formula for the mean squared linking number of such polygons. For a fixed simple closed curve in the confined space, we rigorously show that the linking probability between this curve and a uniform random polygon of n vertices is at least 1-O\\big(\\frac{1}{\\sqrt{n}}\\big) . Our numerical study also indicates that the linking probability between two uniform random polygons (in a confined space), of m and n vertices respectively, is bounded below by 1-O\\big(\\frac{1}{\\sqrt{mn}}\\big) . In particular, the linking probability between two uniform random polygons, both of n vertices, is bounded below by 1-O\\big(\\frac{1}{n}\\big) .
Linking of uniform random polygons in confined spaces
International Nuclear Information System (INIS)
Arsuaga, J; Blackstone, T; Diao, Y; Karadayi, E; Saito, M
2007-01-01
In this paper, we study the topological entanglement of uniform random polygons in a confined space. We derive the formula for the mean squared linking number of such polygons. For a fixed simple closed curve in the confined space, we rigorously show that the linking probability between this curve and a uniform random polygon of n vertices is at least 1-O(1/√n). Our numerical study also indicates that the linking probability between two uniform random polygons (in a confined space), of m and n vertices respectively, is bounded below by 1-O(1/√(mn)). In particular, the linking probability between two uniform random polygons, both of n vertices, is bounded below by 1-O(1/n)
An Analysis on Better Testing than Training Performances on the Iris Dataset
Schutten, Marten; Wiering, Marco
2016-01-01
The Iris dataset is a well known dataset containing information on three different types of Iris flowers. A typical and popular method for solving classification problems on datasets such as the Iris set is the support vector machine (SVM). In order to do so the dataset is separated in a set used
Wenrich, M. L.; Christensen, P. R.
1993-01-01
The mechanism for the genesis of the polygonal terrains in Acidalia and Utopia Planitia has long been sought: however, no completely satisfying model was put forth that characterizes the evolution of these complexly patterned terrains. The polygons are roughly hexagonal but some are not entirely enclosed by fractures. These polygonal features range in widths from approximately 5 to 20 km. Several origins were proposed that describe the polygon borders as desiccation cracks, columnar jointing in a cooled lava, or frost-wedge features. These tension-induced cracking hypotheses were addressed by Pechmann, who convincingly disputes these mechanisms of formation based on scale magnitude difficulties and morphology. Pechmann suggests instead that the cracks delineating the 5-20-km-wide polygons on the northern plains of Mars are graben resulting from deep-seated, uniform, horizontal tension. The difficulty with this hypothesis is that no analogous polygonal forms are known to have originated by tectonism on Earth. McGill and Hills propose that the polygonal terrains on Mars resulted from either rapid desiccation of sediments or cooling of volcanics coupled with differential compaction of the material over a buried irregular topographic surface. They suggest that fracturing was enhanced over the areas of positive relief and was suppressed above the topographic lows. McGill and Hills suggest that the spacing of the topographic highs primarily controls the size of the Martian polygons and the physics of the shrinkage process is a secondary concern. Ray et. al. conducted a terrestrial study of patterned ground in periglacial areas of the U.S. to determine the process responsible for polygonal ground formation. They developed a model for polygon formation in which convection of seasonal melt water above a permafrost layer, driven by an unstable density stratification, differentially melts the permafrost interface, causing it to become undulatory.
Uehara, Erica; Deguchi, Tetsuo
2017-12-07
We show that the average size of self-avoiding polygons (SAPs) with a fixed knot is much larger than that of no topological constraint if the excluded volume is small and the number of segments is large. We call it topological swelling. We argue an "enhancement" of the scaling exponent for random polygons with a fixed knot. We study them systematically through SAP consisting of hard cylindrical segments with various different values of the radius of segments. Here we mean by the average size the mean-square radius of gyration. Furthermore, we show numerically that the topological balance length of a composite knot is given by the sum of those of all constituent prime knots. Here we define the topological balance length of a knot by such a number of segments that topological entropic repulsions are balanced with the knot complexity in the average size. The additivity suggests the local knot picture.
Directory of Open Access Journals (Sweden)
Ana Rodríguez
2016-12-01
Full Text Available We have categorized the dataset from content and emission of terpene volatiles of peel and juice in both Navelina and Pineapple sweet orange cultivars in which D-limonene was either up- (S, down-regulated (AS or non-altered (EV; control (“Impact of D-limonene synthase up- or down-regulation on sweet orange fruit and juice odor perception”(A. Rodríguez, J.E. Peris, A. Redondo, T. Shimada, E. Costell, I. Carbonell, C. Rojas, L. Peña, (2016 [1]. Data from volatile identification and quantification by HS-SPME and GC–MS were classified by Principal Component Analysis (PCA individually or as chemical groups. AS juice was characterized by the higher influence of the oxygen fraction, and S juice by the major influence of ethyl esters. S juices emitted less linalool compared to AS and EV juices.
Generating realistic roofs over a rectilinear polygon
Ahn, Heekap
2011-01-01
Given a simple rectilinear polygon P in the xy-plane, a roof over P is a terrain over P whose faces are supported by planes through edges of P that make a dihedral angle π/4 with the xy-plane. In this paper, we introduce realistic roofs by imposing a few additional constraints. We investigate the geometric and combinatorial properties of realistic roofs, and show a connection with the straight skeleton of P. We show that the maximum possible number of distinct realistic roofs over P is ( ⌊(n-4)/4⌋ (n-4)/2) when P has n vertices. We present an algorithm that enumerates a combinatorial representation of each such roof in O(1) time per roof without repetition, after O(n 4) preprocessing time. We also present an O(n 5)-time algorithm for computing a realistic roof with minimum height or volume. © 2011 Springer-Verlag.
Rotational Fourier tracking of diffusing polygons.
Mayoral, Kenny; Kennair, Terry P; Zhu, Xiaoming; Milazzo, James; Ngo, Kathy; Fryd, Michael M; Mason, Thomas G
2011-11-01
We use optical microscopy to measure the rotational Brownian motion of polygonal platelets that are dispersed in a liquid and confined by depletion attractions near a wall. The depletion attraction inhibits out-of-plane translational and rotational Brownian fluctuations, thereby facilitating in-plane imaging and video analysis. By taking fast Fourier transforms (FFTs) of the images and analyzing the angular position of rays in the FFTs, we determine an isolated particle's rotational trajectory, independent of its position. The measured in-plane rotational diffusion coefficients are significantly smaller than estimates for the bulk; this difference is likely due to the close proximity of the particles to the wall arising from the depletion attraction.
High speed printing with polygon scan heads
Stutz, Glenn
2016-03-01
To reduce and in many cases eliminate the costs associated with high volume printing of consumer and industrial products, this paper investigates and validates the use of the new generation of high speed pulse on demand (POD) lasers in concert with high speed (HS) polygon scan heads (PSH). Associated costs include consumables such as printing ink and nozzles, provisioning labor, maintenance and repair expense as well as reduction of printing lines due to high through put. Targets that are applicable and investigated include direct printing on plastics, printing on paper/cardboard as well as printing on labels. Market segments would include consumer products (CPG), medical and pharmaceutical products, universal ID (UID), and industrial products. In regards to the POD lasers employed, the wavelengths include UV(355nm), Green (532nm) and IR (1064nm) operating within the repetition range of 180 to 250 KHz.
Self-avoiding polygons and walks in slits
International Nuclear Information System (INIS)
Alvarez, J; Whittington, S G; Rensburg, E J Janse van; Soteros, C E
2008-01-01
A polymer in a confined geometry may be modeled by a self-avoiding walk or a self-avoiding polygon confined between two parallel walls. In two dimensions, this model involves self-avoiding walks or self-avoiding polygons in the square lattice between two parallel confining lines. Interactions of the polymer with the confining walls are introduced by energy terms associated with edges in the walk or polygon which are at or near the confining lines. We use transfer-matrix methods to investigate the forces between the walk or polygon and the confining lines, as well as to investigate the effects of the confining slit's width and of the energy terms on the thermodynamic properties of the walks or polygons in several models. The phase diagram found for the self-avoiding walk models is qualitatively similar to the phase diagram of a directed walk model confined between two parallel lines, as was previously conjectured. However, the phase diagram of one of our polygon models is found to be significantly different and we present numerical data to support this. For that particular model we prove that, for any finite values of the energy terms, there are an infinite number of slit widths where a polygon will induce a steric repulsion between the confining lines
Conformal array design on arbitrary polygon surface with transformation optics
Energy Technology Data Exchange (ETDEWEB)
Deng, Li, E-mail: dengl@bupt.edu.cn; Hong, Weijun, E-mail: hongwj@bupt.edu.cn; Zhu, Jianfeng; Peng, Biao; Li, Shufang [Beijing Key Laboratory of Network System Architecture and Convergence, School of Information and Communication Engineering, Beijing University of Posts and Telecommunications, 100876 Beijing (China); Wu, Yongle, E-mail: wuyongle138@gmail.com [Beijing Key Laboratory of Work Safety Intelligent Monitoring, School of Electronic Engineering, Beijing University of Posts and Telecommunications, 100876 Beijing (China)
2016-06-15
A transformation-optics based method to design a conformal antenna array on an arbitrary polygon surface is proposed and demonstrated in this paper. This conformal antenna array can be adjusted to behave equivalently as a uniformly spaced linear array by applying an appropriate transformation medium. An typical example of general arbitrary polygon conformal arrays, not limited to circular array, is presented, verifying the proposed approach. In summary, the novel arbitrary polygon surface conformal array can be utilized in array synthesis and beam-forming, maintaining all benefits of linear array.
Interpolation Error Estimates for Mean Value Coordinates over Convex Polygons.
Rand, Alexander; Gillette, Andrew; Bajaj, Chandrajit
2013-08-01
In a similar fashion to estimates shown for Harmonic, Wachspress, and Sibson coordinates in [Gillette et al., AiCM, to appear], we prove interpolation error estimates for the mean value coordinates on convex polygons suitable for standard finite element analysis. Our analysis is based on providing a uniform bound on the gradient of the mean value functions for all convex polygons of diameter one satisfying certain simple geometric restrictions. This work makes rigorous an observed practical advantage of the mean value coordinates: unlike Wachspress coordinates, the gradient of the mean value coordinates does not become large as interior angles of the polygon approach π.
Conformal array design on arbitrary polygon surface with transformation optics
International Nuclear Information System (INIS)
Deng, Li; Hong, Weijun; Zhu, Jianfeng; Peng, Biao; Li, Shufang; Wu, Yongle
2016-01-01
A transformation-optics based method to design a conformal antenna array on an arbitrary polygon surface is proposed and demonstrated in this paper. This conformal antenna array can be adjusted to behave equivalently as a uniformly spaced linear array by applying an appropriate transformation medium. An typical example of general arbitrary polygon conformal arrays, not limited to circular array, is presented, verifying the proposed approach. In summary, the novel arbitrary polygon surface conformal array can be utilized in array synthesis and beam-forming, maintaining all benefits of linear array.
VT Biodiversity Project - Aquatic Sites boundary polygons
Vermont Center for Geographic Information — (Link to Metadata) Exemplary aquatic sites in Vermont, both standing water and running water, are represented in this dataset. It is the result of an analysis by the...
VT Geothermal Closed Loop Pond Systems - polygons
Vermont Center for Geographic Information — (Link to Metadata) The Renewable Energy Atlas of Vermont and this dataset were created to assist town energy committees, the Clean Energy Development Fund and other...
North Slope, Alaska ESI: FISH (Fish Polygons)
National Oceanic and Atmospheric Administration, Department of Commerce — This data set contains sensitive biological resource data for marine, estuarine, anadromous, and freshwater fish species for the North Slope of Alaska. Vector...
Alabama ESI: MGT (Management Area Polygons)
National Oceanic and Atmospheric Administration, Department of Commerce — This data set contains sensitive human-use data for designated critical habitats, state parks, wildlife refuges, and wildlife management areas in Alabama. Vector...
Aaron Journal article datasets
U.S. Environmental Protection Agency — All figures used in the journal article are in netCDF format. This dataset is associated with the following publication: Sims, A., K. Alapaty , and S. Raman....
Integrated Surface Dataset (Global)
National Oceanic and Atmospheric Administration, Department of Commerce — The Integrated Surface (ISD) Dataset (ISD) is composed of worldwide surface weather observations from over 35,000 stations, though the best spatial coverage is...
U.S. Environmental Protection Agency — The EPA Control Measure Dataset is a collection of documents describing air pollution control available to regulated facilities for the control and abatement of air...
National Hydrography Dataset (NHD)
Kansas Data Access and Support Center — The National Hydrography Dataset (NHD) is a feature-based database that interconnects and uniquely identifies the stream segments or reaches that comprise the...
National Oceanic and Atmospheric Administration, Department of Commerce — This dataset contains ecological information collected on the major adult spawning and juvenile habitats of market squid off California and the US Pacific Northwest....
U.S. Environmental Protection Agency — Soil and air concentrations of asbestos in Sumas study. This dataset is associated with the following publication: Wroble, J., T. Frederick, A. Frame, and D....
Shinarump Channel Polygons, North Central AUM Region, 1964, USDOE
U.S. Environmental Protection Agency — This is a polygon shapefile that provides Shinarump channels compiled and mapped by Young and Malan (1964) in the Monument Valley District, San Juan County, Utah,...
PNW River Reach Files -- 1:100k Waterbodies (polygons)
Pacific States Marine Fisheries Commission — This feature class includes the POLYGON waterbody features from the 2001 version of the PNW River Reach files Arc/INFO coverage. Separate, companion feature classes...
Structural characterization of the packings of granular regular polygons.
Wang, Chuncheng; Dong, Kejun; Yu, Aibing
2015-12-01
By using a recently developed method for discrete modeling of nonspherical particles, we simulate the random packings of granular regular polygons with three to 11 edges under gravity. The effects of shape and friction on the packing structures are investigated by various structural parameters, including packing fraction, the radial distribution function, coordination number, Voronoi tessellation, and bond-orientational order. We find that packing fraction is generally higher for geometrically nonfrustrated regular polygons, and can be increased by the increase of edge number and decrease of friction. The changes of packing fraction are linked with those of the microstructures, such as the variations of the translational and orientational orders and local configurations. In particular, the free areas of Voronoi tessellations (which are related to local packing fractions) can be described by log-normal distributions for all polygons. The quantitative analyses establish a clearer picture for the packings of regular polygons.
Polygon formation and surface flow on a rotating fluid surface
DEFF Research Database (Denmark)
Bergmann, Raymond; Tophøj, Laust Emil Hjerrild; Homan, T. A. M.
2011-01-01
We present a study of polygons forming on the free surface of a water flow confined to a stationary cylinder and driven by a rotating bottom plate as described by Jansson et al. (Phys. Rev. Lett., vol. 96, 2006, 174502). In particular, we study the case of a triangular structure, either completely...... there the symmetry breaking proceeds like a low-dimensional linear instability. We show that the circular state and the unstable manifold connecting it with the polygon solution are universal in the sense that very different initial conditions lead to the same circular state and unstable manifold. For a wet triangle......, we measure the surface flows by particle image velocimetry (PIV) and show that there are three vortices present, but that the strength of these vortices is far too weak to account for the rotation velocity of the polygon. We show that partial blocking of the surface flow destroys the polygons and re...
The unusual asymptotics of three-sided prudent polygons
International Nuclear Information System (INIS)
Beaton, Nicholas R; Guttmann, Anthony J; Flajolet, Philippe
2010-01-01
We have studied the area-generating function of prudent polygons on the square lattice. Exact solutions are obtained for the generating function of two-sided and three-sided prudent polygons, and a functional equation is found for four-sided prudent polygons. This is used to generate series coefficients in polynomial time, and these are analysed to determine the asymptotics numerically. A careful asymptotic analysis of the three-sided polygons produces a most surprising result. A transcendental critical exponent is found, and the leading amplitude is not quite a constant, but is a constant plus a small oscillatory component with an amplitude approximately 10 -8 times that of the leading amplitude. This effect cannot be seen by any standard numerical analysis, but it may be present in other models. If so, it changes our whole view of the asymptotic behaviour of lattice models. (fast track communication)
Average size of random polygons with fixed knot topology.
Matsuda, Hiroshi; Yao, Akihisa; Tsukahara, Hiroshi; Deguchi, Tetsuo; Furuta, Ko; Inami, Takeo
2003-07-01
We have evaluated by numerical simulation the average size R(K) of random polygons of fixed knot topology K=,3(1),3(1) musical sharp 4(1), and we have confirmed the scaling law R(2)(K) approximately N(2nu(K)) for the number N of polygonal nodes in a wide range; N=100-2200. The best fit gives 2nu(K) approximately 1.11-1.16 with good fitting curves in the whole range of N. The estimate of 2nu(K) is consistent with the exponent of self-avoiding polygons. In a limited range of N (N greater, similar 600), however, we have another fit with 2nu(K) approximately 1.01-1.07, which is close to the exponent of random polygons.
Morphometric analysis of the arteries of Willis Polygon
Directory of Open Access Journals (Sweden)
Canaz Huseyin
2018-03-01
Full Text Available Objective: Willis polygon forms the basis of the arterial circulation of the cerebrum. Willis polygon is a vascular structure whom variations are not rare. Knowledge of the anatomy and preservation of its integrity is crucial for performing neurovascular surgery and intracranial tumour surgery. Because of the important vascular and neurological structures, approaches to this region are considered extremely risky. One of the main variations in-person basis is the diameter differences of the arteries, which forms Willis polygon, between the left and right hemispheres. About structure and variations, studies of Rhoton and Yasargil had formed the touchstone. Our aim is to contribute to the literature and clinical studies, to be done in the future, by comparing our results with previous studies about variations and morphometric features of Willis polygon.
Spectral segmentation of polygonized images with normalized cuts
Energy Technology Data Exchange (ETDEWEB)
Matsekh, Anna [Los Alamos National Laboratory; Skurikhin, Alexei [Los Alamos National Laboratory; Rosten, Edward [UNIV OF CAMBRIDGE
2009-01-01
We analyze numerical behavior of the eigenvectors corresponding to the lowest eigenvalues of the generalized graph Laplacians arising in the Normalized Cuts formulations of the image segmentation problem on coarse polygonal grids.
Rotating polygon instability of a swirling free surface flow
DEFF Research Database (Denmark)
Tophøj, Laust Emil Hjerrild; Bohr, Tomas; Mougel, J.
2013-01-01
We explain the rotating polygon instability on a swirling fluid surface [G. H. Vatistas, J. Fluid Mech. 217, 241 (1990)JFLSA70022-1120 and Jansson et al., Phys. Rev. Lett. 96, 174502 (2006)PRLTAO0031-9007] in terms of resonant interactions between gravity waves on the outer part of the surface...... behavior near the corners), and indeed we show that we can obtain the polygons transiently by violently stirring liquid nitrogen in a hot container....
NSGIC State | GIS Inventory — SILURIAN_REEF_POLYGONS_MM54_IN is a polygon shapefile that shows the general locations of Silurian rock reef bank formations in Indiana. These data include two major...
Image segmentation by hierarchial agglomeration of polygons using ecological statistics
Prasad, Lakshman; Swaminarayan, Sriram
2013-04-23
A method for rapid hierarchical image segmentation based on perceptually driven contour completion and scene statistics is disclosed. The method begins with an initial fine-scale segmentation of an image, such as obtained by perceptual completion of partial contours into polygonal regions using region-contour correspondences established by Delaunay triangulation of edge pixels as implemented in VISTA. The resulting polygons are analyzed with respect to their size and color/intensity distributions and the structural properties of their boundaries. Statistical estimates of granularity of size, similarity of color, texture, and saliency of intervening boundaries are computed and formulated into logical (Boolean) predicates. The combined satisfiability of these Boolean predicates by a pair of adjacent polygons at a given segmentation level qualifies them for merging into a larger polygon representing a coarser, larger-scale feature of the pixel image and collectively obtains the next level of polygonal segments in a hierarchy of fine-to-coarse segmentations. The iterative application of this process precipitates textured regions as polygons with highly convolved boundaries and helps distinguish them from objects which typically have more regular boundaries. The method yields a multiscale decomposition of an image into constituent features that enjoy a hierarchical relationship with features at finer and coarser scales. This provides a traversable graph structure from which feature content and context in terms of other features can be derived, aiding in automated image understanding tasks. The method disclosed is highly efficient and can be used to decompose and analyze large images.
Aberdeen polygons: computer displays of physiological profiles for intensive care.
Green, C A; Logie, R H; Gilhooly, K J; Ross, D G; Ronald, A
1996-03-01
The clinician in an intensive therapy unit is presented regularly with a range of information about the current physiological state of the patients under care. This information typically comes from a variety of sources and in a variety of formats. A more integrated form of display incorporating several physiological parameters may be helpful therefore. Three experiments are reported that explored the potential use of analogue, polygon diagrams to display physiological data from patients undergoing intensive therapy. Experiment 1 demonstrated that information can be extracted readily from such diagrams comprising 8- or 10-sided polygons, but with an advantage for simpler polygons and for information displayed at the top of the diagram. Experiment 2 showed that colour coding removed these biases for simpler polygons and the top of the diagram, together with speeding the processing time. Experiment 3 used polygons displaying patterns of physiological data that were consistent with typical conditions observed in the intensive care unit. It was found that physicians can readily learn to recognize these patterns and to diagnose both the nature and severity of the patient's physiological state. These polygon diagrams appear to have some considerable potential for use in providing on-line summary information of a patient's physiological state.
Water polygons in high-resolution protein crystal structures.
Lee, Jonas; Kim, Sung-Hou
2009-07-01
We have analyzed the interstitial water (ISW) structures in 1500 protein crystal structures deposited in the Protein Data Bank that have greater than 1.5 A resolution with less than 90% sequence similarity with each other. We observed varieties of polygonal water structures composed of three to eight water molecules. These polygons may represent the time- and space-averaged structures of "stable" water oligomers present in liquid water, and their presence as well as relative population may be relevant in understanding physical properties of liquid water at a given temperature. On an average, 13% of ISWs are localized enough to be visible by X-ray diffraction. Of those, averages of 78% are water molecules in the first water layer on the protein surface. Of the localized ISWs beyond the first layer, almost half of them form water polygons such as trigons, tetragons, as well as expected pentagons, hexagons, higher polygons, partial dodecahedrons, and disordered networks. Most of the octagons and nanogons are formed by fusion of smaller polygons. The trigons are most commonly observed. We suggest that our observation provides an experimental basis for including these water polygon structures in correlating and predicting various water properties in liquid state.
Vigorous convection as the explanation for Pluto's polygonal terrain.
Trowbridge, A J; Melosh, H J; Steckloff, J K; Freed, A M
2016-06-02
Pluto's surface is surprisingly young and geologically active. One of its youngest terrains is the near-equatorial region informally named Sputnik Planum, which is a topographic basin filled by nitrogen (N2) ice mixed with minor amounts of CH4 and CO ices. Nearly the entire surface of the region is divided into irregular polygons about 20-30 kilometres in diameter, whose centres rise tens of metres above their sides. The edges of this region exhibit bulk flow features without polygons. Both thermal contraction and convection have been proposed to explain this terrain, but polygons formed from thermal contraction (analogous to ice-wedges or mud-crack networks) of N2 are inconsistent with the observations on Pluto of non-brittle deformation within the N2-ice sheet. Here we report a parameterized convection model to compute the Rayleigh number of the N2 ice and show that it is vigorously convecting, making Rayleigh-Bénard convection the most likely explanation for these polygons. The diameter of Sputnik Planum's polygons and the dimensions of the 'floating mountains' (the hills of of water ice along the edges of the polygons) suggest that its N2 ice is about ten kilometres thick. The estimated convection velocity of 1.5 centimetres a year indicates a surface age of only around a million years.
Realistic roofs over a rectilinear polygon
Ahn, Heekap
2013-11-01
Given a simple rectilinear polygon P in the xy-plane, a roof over P is a terrain over P whose faces are supported by planes through edges of P that make a dihedral angle π/4 with the xy-plane. According to this definition, some roofs may have faces isolated from the boundary of P or even local minima, which are undesirable for several practical reasons. In this paper, we introduce realistic roofs by imposing a few additional constraints. We investigate the geometric and combinatorial properties of realistic roofs and show that the straight skeleton induces a realistic roof with maximum height and volume. We also show that the maximum possible number of distinct realistic roofs over P is ((n-4)(n-4)/4 /2⌋) when P has n vertices. We present an algorithm that enumerates a combinatorial representation of each such roof in O(1) time per roof without repetition, after O(n4) preprocessing time. We also present an O(n5)-time algorithm for computing a realistic roof with minimum height or volume. © 2013 Elsevier B.V.
A new convexity measure for polygons.
Zunic, Jovisa; Rosin, Paul L
2004-07-01
Abstract-Convexity estimators are commonly used in the analysis of shape. In this paper, we define and evaluate a new convexity measure for planar regions bounded by polygons. The new convexity measure can be understood as a "boundary-based" measure and in accordance with this it is more sensitive to measured boundary defects than the so called "area-based" convexity measures. When compared with the convexity measure defined as the ratio between the Euclidean perimeter of the convex hull of the measured shape and the Euclidean perimeter of the measured shape then the new convexity measure also shows some advantages-particularly for shapes with holes. The new convexity measure has the following desirable properties: 1) the estimated convexity is always a number from (0, 1], 2) the estimated convexity is 1 if and only if the measured shape is convex, 3) there are shapes whose estimated convexity is arbitrarily close to 0, 4) the new convexity measure is invariant under similarity transformations, and 5) there is a simple and fast procedure for computing the new convexity measure.
Bifurcation of self-folded polygonal bilayers
Abdullah, Arif M.; Braun, Paul V.; Hsia, K. Jimmy
2017-09-01
Motivated by the self-assembly of natural systems, researchers have investigated the stimulus-responsive curving of thin-shell structures, which is also known as self-folding. Self-folding strategies not only offer possibilities to realize complicated shapes but also promise actuation at small length scales. Biaxial mismatch strain driven self-folding bilayers demonstrate bifurcation of equilibrium shapes (from quasi-axisymmetric doubly curved to approximately singly curved) during their stimulus-responsive morphing behavior. Being a structurally instable, bifurcation could be used to tune the self-folding behavior, and hence, a detailed understanding of this phenomenon is appealing from both fundamental and practical perspectives. In this work, we investigated the bifurcation behavior of self-folding bilayer polygons. For the mechanistic understanding, we developed finite element models of planar bilayers (consisting of a stimulus-responsive and a passive layer of material) that transform into 3D curved configurations. Our experiments with cross-linked Polydimethylsiloxane samples that change shapes in organic solvents confirmed our model predictions. Finally, we explored a design scheme to generate gripper-like architectures by avoiding the bifurcation of stimulus-responsive bilayers. Our research contributes to the broad field of self-assembly as the findings could motivate functional devices across multiple disciplines such as robotics, artificial muscles, therapeutic cargos, and reconfigurable biomedical devices.
Newell, Homer E
2006-01-01
When employed with skill and understanding, vector analysis can be a practical and powerful tool. This text develops the algebra and calculus of vectors in a manner useful to physicists and engineers. Numerous exercises (with answers) not only provide practice in manipulation but also help establish students' physical and geometric intuition in regard to vectors and vector concepts.Part I, the basic portion of the text, consists of a thorough treatment of vector algebra and the vector calculus. Part II presents the illustrative matter, demonstrating applications to kinematics, mechanics, and e
Hoffmann, Banesh
1975-01-01
From his unusual beginning in ""Defining a vector"" to his final comments on ""What then is a vector?"" author Banesh Hoffmann has written a book that is provocative and unconventional. In his emphasis on the unresolved issue of defining a vector, Hoffmann mixes pure and applied mathematics without using calculus. The result is a treatment that can serve as a supplement and corrective to textbooks, as well as collateral reading in all courses that deal with vectors. Major topics include vectors and the parallelogram law; algebraic notation and basic ideas; vector algebra; scalars and scalar p
Kashefpur, Masoud; Kafieh, Rahele; Jorjandi, Sahar; Golmohammadi, Hadis; Khodabande, Zahra; Abbasi, Mohammadreza; Teifuri, Nilufar; Fakharzadeh, Ali Akbar; Kashefpoor, Maryam; Rabbani, Hossein
2017-01-01
An online depository was introduced to share clinical ground truth with the public and provide open access for researchers to evaluate their computer-aided algorithms. PHP was used for web programming and MySQL for database managing. The website was entitled "biosigdata.com." It was a fast, secure, and easy-to-use online database for medical signals and images. Freely registered users could download the datasets and could also share their own supplementary materials while maintaining their privacies (citation and fee). Commenting was also available for all datasets, and automatic sitemap and semi-automatic SEO indexing have been set for the site. A comprehensive list of available websites for medical datasets is also presented as a Supplementary (http://journalonweb.com/tempaccess/4800.584.JMSS_55_16I3253.pdf).
CompMusic
2014-01-01
The audio examples were recorded from a professional Carnatic percussionist in a semi-anechoic studio conditions by Akshay Anantapadmanabhan using SM-58 microphones and an H4n ZOOM recorder. The audio was sampled at 44.1 kHz and stored as 16 bit wav files. The dataset can be used for training models for each Mridangam stroke. /n/nA detailed description of the Mridangam and its strokes can be found in the paper below. A part of the dataset was used in the following paper. /nAkshay Anantapadman...
DEFF Research Database (Denmark)
Sturm, Bob L.
2013-01-01
The GTZAN dataset appears in at least 100 published works, and is the most-used public dataset for evaluation in machine listening research for music genre recognition (MGR). Our recent work, however, shows GTZAN has several faults (repetitions, mislabelings, and distortions), which challenge...... of GTZAN, and provide a catalog of its faults. We review how GTZAN has been used in MGR research, and find few indications that its faults have been known and considered. Finally, we rigorously study the effects of its faults on evaluating five different MGR systems. The lesson is not to banish GTZAN...
Dataset - Adviesregel PPL 2010
Evert, van F.K.; Schans, van der D.A.; Geel, van W.C.A.; Slabbekoorn, J.J.; Booij, R.; Jukema, J.N.; Meurs, E.J.J.; Uenk, D.
2011-01-01
This dataset contains experimental data from a number of field experiments with potato in The Netherlands (Van Evert et al., 2011). The data are presented as an SQL dump of a PostgreSQL database (version 8.4.4). An outline of the entity-relationship diagram of the database is given in an
Wolstenholme, E Œ
1978-01-01
Elementary Vectors, Third Edition serves as an introductory course in vector analysis and is intended to present the theoretical and application aspects of vectors. The book covers topics that rigorously explain and provide definitions, principles, equations, and methods in vector analysis. Applications of vector methods to simple kinematical and dynamical problems; central forces and orbits; and solutions to geometrical problems are discussed as well. This edition of the text also provides an appendix, intended for students, which the author hopes to bridge the gap between theory and appl
Sequential and Parallel Algorithms for Finding a Maximum Convex Polygon
DEFF Research Database (Denmark)
Fischer, Paul
1997-01-01
This paper investigates the problem where one is given a finite set of n points in the plane each of which is labeled either ?positive? or ?negative?. We consider bounded convex polygons, the vertices of which are positive points and which do not contain any negative point. It is shown how...... such a polygon which is maximal with respect to area can be found in time O(n³ log n). With the same running time one can also find such a polygon which contains a maximum number of positive points. If, in addition, the number of vertices of the polygon is restricted to be at most M, then the running time...... becomes O(M n³ log n). It is also shown how to find a maximum convex polygon which contains a given point in time O(n³ log n). Two parallel algorithms for the basic problem are also presented. The first one runs in time O(n log n) using O(n²) processors, the second one has polylogarithmic time but needs O...
A QUALITY ASSESSMENT METHOD FOR 3D ROAD POLYGON OBJECTS
Directory of Open Access Journals (Sweden)
L. Gao
2015-08-01
Full Text Available With the development of the economy, the fast and accurate extraction of the city road is significant for GIS data collection and update, remote sensing images interpretation, mapping and spatial database updating etc. 3D GIS has attracted more and more attentions from academics, industries and governments with the increase of requirements for interoperability and integration of different sources of data. The quality of 3D geographic objects is very important for spatial analysis and decision-making. This paper presents a method for the quality assessment of the 3D road polygon objects which is created by integrating 2D Road Polygon data with LiDAR point cloud and other height information such as Spot Height data in Hong Kong Island. The quality of the created 3D road polygon data set is evaluated by the vertical accuracy, geometric and attribute accuracy, connectivity error, undulation error and completeness error and the final results are presented.
Long-term repetition priming with symmetrical polygons and words.
Kersteen-Tucker, Z
1991-01-01
In two different tasks, subjects were asked to make lexical decisions (word or nonword) and symmetry judgments (symmetrical or nonsymmetrical) about two-dimensional polygons. In both tasks, every stimulus was repeated at one of four lags (0, 1, 4, or 8 items interposed between the first and second stimulus presentations). This paradigm, known as repetition priming, revealed comparable short-term priming (Lag 0) and long-term priming (Lags 1, 4, and 8) both for symmetrical polygons and for words. A shorter term component (Lags 0 and 1) of priming was observed for nonwords, and only very short-term priming (Lag 0) was observed for nonsymmetrical polygons. These results indicate that response facilitation accruing from repeated exposure can be observed for stimuli that have no preexisting memory representations and suggest that perceptual factors contribute to repetition-priming effects.
Agency for Toxic Substances and Disease Registry (ATSDR) Hazardous Waste Site Polygon Data, 1996
National Aeronautics and Space Administration — The Agency for Toxic Substances and Disease Registry (ATSDR) Hazardous Waste Site Polygon Data, 1996 consists of 2042 polygons for selected hazardous waste sites...
United States National Grid for New Mexico, UTM 12, (1000m X 1000m polygons )
Earth Data Analysis Center, University of New Mexico — This is a polygon feature data layer of United States National Grid (1000m x 1000m polygons ) constructed by the Center for Interdisciplinary Geospatial Information...
United States National Grid for New Mexico, UTM 13, (1000m X 1000m polygons )
Earth Data Analysis Center, University of New Mexico — This is a polygon feature data layer of United States National Grid (1000m x 1000m polygons ) constructed by the Center for Interdisciplinary Geospatial Information...
A fast direct sampling algorithm for equilateral closed polygons
International Nuclear Information System (INIS)
Cantarella, Jason; Duplantier, Bertrand; Shonkwiler, Clayton; Uehara, Erica
2016-01-01
Sampling equilateral closed polygons is of interest in the statistical study of ring polymers. Over the past 30 years, previous authors have proposed a variety of simple Markov chain algorithms (but have not been able to show that they converge to the correct probability distribution) and complicated direct samplers (which require extended-precision arithmetic to evaluate numerically unstable polynomials). We present a simple direct sampler which is fast and numerically stable, and analyze its runtime using a new formula for the volume of equilateral polygon space as a Dirichlet-type integral. (paper)
Polygons of global undersea features for geographic searches
Hartwell, Stephen R.; Wingfield, Dana K.; Allwardt, Alan O.; Lightsom, Frances L.; Wong, Florence L.
2018-01-01
A shapefile of 311 undersea features from all major oceans and seas has been created as an aid for retrieving georeferenced information resources. Geospatial information systems with the capability to search user-defined, polygonal geographic areas will be able to utilize this shapefile or secondary products derived from it, such as linked data based on well-known text representations of the individual polygons within the shapefile. Version 1.1 of this report also includes a linked data representation of 299 of these features and their spatial extents.
Brand, Louis
2006-01-01
The use of vectors not only simplifies treatments of differential geometry, mechanics, hydrodynamics, and electrodynamics, but also makes mathematical and physical concepts more tangible and easy to grasp. This text for undergraduates was designed as a short introductory course to give students the tools of vector algebra and calculus, as well as a brief glimpse into these subjects' manifold applications. The applications are developed to the extent that the uses of the potential function, both scalar and vector, are fully illustrated. Moreover, the basic postulates of vector analysis are brou
Decomposition of orthogonal polygons in a set of rectanglеs
Shestakov, E.; Voronov, A.
2009-01-01
Algorithm for covering orthogonal integrated circuit layout objects is considered. Objects of the research are special single-connected orthogonal polygons which are generated during decomposition of any multiply connected polygon in a set of single-connected orthogonal polygons. Developed algorithm for covering polygons based on the mathematical techinque of logic matrix transformation. Results described in this paper, can be applied in computer geometry and image analysis.
A simple algorithm for computing positively weighted straight skeletons of monotone polygons.
Biedl, Therese; Held, Martin; Huber, Stefan; Kaaser, Dominik; Palfrader, Peter
2015-02-01
We study the characteristics of straight skeletons of monotone polygonal chains and use them to devise an algorithm for computing positively weighted straight skeletons of monotone polygons. Our algorithm runs in [Formula: see text] time and [Formula: see text] space, where n denotes the number of vertices of the polygon.
Speetjens, M.F.M.; Meleshko, V.V.; Heijst, van G.J.F.
2014-01-01
The present study addresses the classical problem of the dynamics and stability of a cluster of N point vortices of equal strength arranged in a polygonal configuration ("N-vortex polygons"). In unbounded domains, such N-vortex polygons are unconditionally stable for N
International Nuclear Information System (INIS)
Chenal, C.
1996-01-01
Semipalatinsk in Kazakhstan was one of the nuclear weapons polygon for atmospheric, excavation and underground tests. After a description of the actual state of the polygon, a dosimetric approach inside and outside the polygon is presented from 1949 to 1989. (A.B.). 5 refs., 3 figs., 5 tabs
Painting with polygons: a procedural watercolor engine.
DiVerdi, Stephen; Krishnaswamy, Aravind; Měch, Radomír; Ito, Daichi
2013-05-01
Existing natural media painting simulations have produced high-quality results, but have required powerful compute hardware and have been limited to screen resolutions. Digital artists would like to be able to use watercolor-like painting tools, but at print resolutions and on lower end hardware such as laptops or even slates. We present a procedural algorithm for generating watercolor-like dynamic paint behaviors in a lightweight manner. Our goal is not to exactly duplicate watercolor painting, but to create a range of dynamic behaviors that allow users to achieve a similar style of process and result, while at the same time having a unique character of its own. Our stroke representation is vector based, allowing for rendering at arbitrary resolutions, and our procedural pigment advection algorithm is fast enough to support painting on slate devices. We demonstrate our technique in a commercially available slate application used by professional artists. Finally, we present a detailed analysis of the different vector-rendering technologies available.
Network Intrusion Dataset Assessment
2013-03-01
International Conference on Computational Intelligence and Natural Computing, volume 2, pages 413–416, June 2009. • Rung Ching Chen, Kai -Fan Cheng, and...Chia-Fen Hsieh . “Using rough set and support vector machine for network intrusion detection.” International Journal of Network Security & Its...intrusion detection using FP tree rules.” Journal Of Advanced Networking and Applications, 1(1):30–39, 2009. • Ming-Yang Su, Gwo-Jong Yu , and Chun-Yuen
DEFF Research Database (Denmark)
2012-01-01
The present invention relates to a compact, reliable and low-cost vector velocimeter for example for determining velocities of particles suspended in a gas or fluid flow, or for determining velocity, displacement, rotation, or vibration of a solid surface, the vector velocimeter comprising a laser...
PolyFit: Polygonal Surface Reconstruction from Point Clouds
Nan, Liangliang; Wonka, Peter
2017-01-01
We propose a novel framework for reconstructing lightweight polygonal surfaces from point clouds. Unlike traditional methods that focus on either extracting good geometric primitives or obtaining proper arrangements of primitives, the emphasis of this work lies in intersecting the primitives (planes only) and seeking for an appropriate combination of them to obtain a manifold polygonal surface model without boundary.,We show that reconstruction from point clouds can be cast as a binary labeling problem. Our method is based on a hypothesizing and selection strategy. We first generate a reasonably large set of face candidates by intersecting the extracted planar primitives. Then an optimal subset of the candidate faces is selected through optimization. Our optimization is based on a binary linear programming formulation under hard constraints that enforce the final polygonal surface model to be manifold and watertight. Experiments on point clouds from various sources demonstrate that our method can generate lightweight polygonal surface models of arbitrary piecewise planar objects. Besides, our method is capable of recovering sharp features and is robust to noise, outliers, and missing data.
Determination of wave direction from linear and polygonal arrays
Digital Repository Service at National Institute of Oceanography (India)
Fernandes, A.A; Gouveia, A; Nagarajan, R.
documentation of Borgman (1974) in case of linear arrays; and the second issue being the failure of Esteva (1976, 1977) to correctly determine wave directions over the design range 25 to 7 sec of his polygonal array. This paper presents requisite documentation...
Vibrational resonances of nonrigid vehicles: Polygonization and ripple patterns
Dekker, H.
2009-01-01
The well-known phenomenon of ripples on roads has its modern counterpart in ripple patterns on railroads and polygonization of wheels on state-of-the-art lightrail streetcars. Here we study an idealized mechanical suspension model for the vibrational frequency response of a buggy with a nonrigid
design chart procedures for polygonal concrete-filled steel columns
African Journals Online (AJOL)
ADMIN
hexagonal and octagonal steel-concrete composite columns subjected to ... This paper also outlines procedures that will enable preparation of ... buildings and in a variety of large-span building ... Likewise, hot-rolled steel tubes are used while ... small moderate large. Fig. 2. Possible arrangement of composite polygonal ...
A Teaching Polygon Makes Learning a Community Enterprise
Colgan, Mark; DeLong, Matt
2015-01-01
In order to strengthen departmental collegiality and improve teaching, our mathematics department instituted a Teaching Polygon. Building on the faculty development idea of Teaching Squares, each member of our department visited one class taught by every other department member in a round-robin fashion during the school year. The visits were…
Sub-wavelength resonances in polygonal metamaterial cylinders
DEFF Research Database (Denmark)
Arslanagic, Samel; Breinbjerg, Olav
2008-01-01
It has been shown that the sub-wavelength resonances of circular MTM cylinders also occur for polygonal MTM cylinders. This is the case for lossless and non-dispersive cylinders as well as lossy and dispersive cylinders. The sub-wavelength resonances are thus not limited to structures of canonical...
Polygons, Pillars and Pavilions: Discovering Connections between Geometry and Architecture
Madden, Sean Patrick
2017-01-01
Crowning the second semester of geometry, taught within a Catholic middle school, the author's students explored connections between the geometry of regular polygons and architecture of local buildings. They went on to explore how these principles apply famous buildings around the world such as the monuments of Washington, D.C. and the elliptical…
Computing the Fréchet distance between folded polygons
Cook IV, A.F.; Driemel, A.; Sherette, J.; Wenk, C.
2015-01-01
Computing the Fréchet distance for surfaces is a surprisingly hard problem and the only known polynomial-time algorithm is limited to computing it between flat surfaces. We study the problem of computing the Fréchet distance for a class of non-flat surfaces called folded polygons. We present a
PolyFit: Polygonal Surface Reconstruction from Point Clouds
Nan, Liangliang
2017-12-25
We propose a novel framework for reconstructing lightweight polygonal surfaces from point clouds. Unlike traditional methods that focus on either extracting good geometric primitives or obtaining proper arrangements of primitives, the emphasis of this work lies in intersecting the primitives (planes only) and seeking for an appropriate combination of them to obtain a manifold polygonal surface model without boundary.,We show that reconstruction from point clouds can be cast as a binary labeling problem. Our method is based on a hypothesizing and selection strategy. We first generate a reasonably large set of face candidates by intersecting the extracted planar primitives. Then an optimal subset of the candidate faces is selected through optimization. Our optimization is based on a binary linear programming formulation under hard constraints that enforce the final polygonal surface model to be manifold and watertight. Experiments on point clouds from various sources demonstrate that our method can generate lightweight polygonal surface models of arbitrary piecewise planar objects. Besides, our method is capable of recovering sharp features and is robust to noise, outliers, and missing data.
New techniques in 3D scalar and vector field visualization
International Nuclear Information System (INIS)
Max, N.; Crawfis, R.; Becker, B.
1993-01-01
At Lawrence Livermore National Laboratory (LLNL) we have recently developed several techniques for volume visualization of scalar and vector fields, all of which use back-to-front compositing. The first renders volume density clouds by compositing polyhedral volume cells or their faces. The second is a ''splatting'' scheme which composites textures used to reconstruct the scalar or vector fields. One version calculates the necessary texture values in software, and another takes advantage of hardware texture mapping. The next technique renders contour surface polygons using semi-transparent textures, which adjust appropriately when the surfaces deform in a flow, or change topology. The final one renders the ''flow volume'' of smoke or dye tracer swept out by a fluid flowing through a small generating polygon. All of these techniques are applied to a climate model data set, to visualize cloud density and wind velocity
New techniques in 3D scalar and vector field visualization
Energy Technology Data Exchange (ETDEWEB)
Max, N.; Crawfis, R.; Becker, B.
1993-05-05
At Lawrence Livermore National Laboratory (LLNL) we have recently developed several techniques for volume visualization of scalar and vector fields, all of which use back-to-front compositing. The first renders volume density clouds by compositing polyhedral volume cells or their faces. The second is a ``splatting`` scheme which composites textures used to reconstruct the scalar or vector fields. One version calculates the necessary texture values in software, and another takes advantage of hardware texture mapping. The next technique renders contour surface polygons using semi-transparent textures, which adjust appropriately when the surfaces deform in a flow, or change topology. The final one renders the ``flow volume`` of smoke or dye tracer swept out by a fluid flowing through a small generating polygon. All of these techniques are applied to a climate model data set, to visualize cloud density and wind velocity.
Modeling of chromosome intermingling by partially overlapping uniform random polygons.
Blackstone, T; Scharein, R; Borgo, B; Varela, R; Diao, Y; Arsuaga, J
2011-03-01
During the early phase of the cell cycle the eukaryotic genome is organized into chromosome territories. The geometry of the interface between any two chromosomes remains a matter of debate and may have important functional consequences. The Interchromosomal Network model (introduced by Branco and Pombo) proposes that territories intermingle along their periphery. In order to partially quantify this concept we here investigate the probability that two chromosomes form an unsplittable link. We use the uniform random polygon as a crude model for chromosome territories and we model the interchromosomal network as the common spatial region of two overlapping uniform random polygons. This simple model allows us to derive some rigorous mathematical results as well as to perform computer simulations easily. We find that the probability that one uniform random polygon of length n that partially overlaps a fixed polygon is bounded below by 1 − O(1/√n). We use numerical simulations to estimate the dependence of the linking probability of two uniform random polygons (of lengths n and m, respectively) on the amount of overlapping. The degree of overlapping is parametrized by a parameter [Formula: see text] such that [Formula: see text] indicates no overlapping and [Formula: see text] indicates total overlapping. We propose that this dependence relation may be modeled as f (ε, m, n) = [Formula: see text]. Numerical evidence shows that this model works well when [Formula: see text] is relatively large (ε ≥ 0.5). We then use these results to model the data published by Branco and Pombo and observe that for the amount of overlapping observed experimentally the URPs have a non-zero probability of forming an unsplittable link.
Guilfoyle, Richard A.; Smith, Lloyd M.
1994-01-01
A vector comprising a filamentous phage sequence containing a first copy of filamentous phage gene X and other sequences necessary for the phage to propagate is disclosed. The vector also contains a second copy of filamentous phage gene X downstream from a promoter capable of promoting transcription in a bacterial host. In a preferred form of the present invention, the filamentous phage is M13 and the vector additionally includes a restriction endonuclease site located in such a manner as to substantially inactivate the second gene X when a DNA sequence is inserted into the restriction site.
Guilfoyle, R.A.; Smith, L.M.
1994-12-27
A vector comprising a filamentous phage sequence containing a first copy of filamentous phage gene X and other sequences necessary for the phage to propagate is disclosed. The vector also contains a second copy of filamentous phage gene X downstream from a promoter capable of promoting transcription in a bacterial host. In a preferred form of the present invention, the filamentous phage is M13 and the vector additionally includes a restriction endonuclease site located in such a manner as to substantially inactivate the second gene X when a DNA sequence is inserted into the restriction site. 2 figures.
Wentaschek, Stefan; Lehmann, Karl Martin; Scheller, Herbert; Weibrich, Gernot; Behneke, Nikolaus
2016-01-01
The aim of this in vitro study was to assess the increase in the polygonal area of implant-retained prosthesis supports in edentulous maxillae with the use of tilted distal implants compared with the use of straight distal implants, using a variety of implant lengths. A total of 25 DICOM datasets of atrophic edentulous maxillae were provided. Bone augmentations in the molar region had to be avoided. Two straight reference implants were virtually inserted in the anterior region. Two additional implants were placed far distally on both sides (4 groups: [1] straight, 12-mm length; [2] straight, 10 mm; [3] straight, 8 mm; [4] tilted, 12-16 mm). The resulting implant-supported polygon was measured for each of the 4 groups using three-dimensional planning software. The mean sagittal depth of the supported polygon in Group 1 was 9.9 mm (standard deviation [SD] 4.4) on the right and 10.2 mm (SD 4.4) on the left, and it was 33.7 mm (SD 5.8) in width. For Group 2, the mean sagittal depth was 11.5 mm (SD 5.0) on the right and 11.9 mm (SD 4.7) on the left, and the width was 35.2 mm (SD 5.6). The measurements for Group 3 were 13.8 mm (SD 4.9) deep on the right, 13.8 mm (SD 5.1) deep on the left, and 37.0 mm (SD 5.4) in width. For Group 4, the depth was 15.8 mm (SD 4.9) on the right and 16.4 mm (SD 5.8) on the left, and the width was 39.0 mm (SD 5.1). The area of implant-retained prosthesis support can be enlarged by the use of tilted implants (12 to 16 mm in length, 42 to 45 degrees) compared to the use of straight 8-mm implants (resulting increase: about 15%).
Levine, Robert
2004-01-01
The cross-product is a mathematical operation that is performed between two 3-dimensional vectors. The result is a vector that is orthogonal or perpendicular to both of them. Learning about this for the first time while taking Calculus-III, the class was taught that if AxB = AxC, it does not necessarily follow that B = C. This seemed baffling. The…
Automatic polygon layers integration and its implementation
Directory of Open Access Journals (Sweden)
Ondřej Skoupý
2012-01-01
Full Text Available Land cover change analysis is one of the most important tools for landscape management purposes, as it enables exploring of long-term natural processes especially in contrast with anthropogenic factors. Such analysis is always dependent on quality of available data. Due to long tradition of map making and quality and accuracy of preserved historical cartographic data in the Czech Republic it is possible to perform an effective land use change analysis using maps dating even back to early nineteenth century. Clearly, because map making methodology has evolved since then, the primary problem of land cover change analysis are different sources and thus different formats of analyzed data which need to be integrated, both spatially and contextually, into one coherent data set. One of the most difficult problems is caused by the fact that due to different map acquisition methodologies the maps are loaded with various errors originating from measurement, map drawing, storage, digitalization and finally georeferencing and possible vectorization. This means that some apparent changes may be for example caused by different methodology and accuracy of mapping a landscape feature that has not actually changed its shape and spatial position through the time. This work deals with spatial integration of data, namely identifying corresponding lines in map layers from different epochs and adjusting the borders plotted in the less accurate map to spatially correspond to the more accurate map. For such a purpose, a special program had to be created. It basically follows the work by Malach et al., 2009 who introduced their Layer Integrator. This work however presents a significantly different approach to creating an integration tool.
,
2002-01-01
The National Elevation Dataset (NED) is a new raster product assembled by the U.S. Geological Survey. NED is designed to provide National elevation data in a seamless form with a consistent datum, elevation unit, and projection. Data corrections were made in the NED assembly process to minimize artifacts, perform edge matching, and fill sliver areas of missing data. NED has a resolution of one arc-second (approximately 30 meters) for the conterminous United States, Hawaii, Puerto Rico and the island territories and a resolution of two arc-seconds for Alaska. NED data sources have a variety of elevation units, horizontal datums, and map projections. In the NED assembly process the elevation values are converted to decimal meters as a consistent unit of measure, NAD83 is consistently used as horizontal datum, and all the data are recast in a geographic projection. Older DEM's produced by methods that are now obsolete have been filtered during the NED assembly process to minimize artifacts that are commonly found in data produced by these methods. Artifact removal greatly improves the quality of the slope, shaded-relief, and synthetic drainage information that can be derived from the elevation data. Figure 2 illustrates the results of this artifact removal filtering. NED processing also includes steps to adjust values where adjacent DEM's do not match well, and to fill sliver areas of missing data between DEM's. These processing steps ensure that NED has no void areas and artificial discontinuities have been minimized. The artifact removal filtering process does not eliminate all of the artifacts. In areas where the only available DEM is produced by older methods, then "striping" may still occur.
Logarithmic solution to the line-polygon intersection problem. 127
International Nuclear Information System (INIS)
Siddon, R.L.; Barth, N.H.
1987-01-01
Algorithmic solution for a special case of the line - polygon intersection problem has been developed. The special case involves repeated solution to the problem where one point on the line is held fixed and the other allowed to vary. In addition, the fixed point on the line must lie outside the rectangle defined by the extrema of the polygon and varying point. In radiotherapy applications, the fixed point corresponds to the source of radiation, whereas the varying points refer to the grid of multiple calculation points. For smooth contours of 100-200 vertices, it is found that the new algorithm results in a CPU savings of approximately a factor of 3-5. 3 refs.; 4 figs
Exact moduli space metrics for hyperbolic vortex polygons
International Nuclear Information System (INIS)
Krusch, S.; Speight, J. M.
2010-01-01
Exact metrics on some totally geodesic submanifolds of the moduli space of static hyperbolic N-vortices are derived. These submanifolds, denoted as Σ n,m , are spaces of C n -invariant vortex configurations with n single vortices at the vertices of a regular polygon and m=N-n coincident vortices at the polygon's center. The geometric properties of Σ n,m are investigated, and it is found that Σ n,n-1 is isometric to the hyperbolic plane of curvature -(3πn) -1 . The geodesic flow on Σ n,m and a geometrically natural variant of geodesic flow recently proposed by Collie and Tong ['The dynamics of Chern-Simons vortices', Phys. Rev. D Part. Fields Gravit. Cosmol. 78, 065013 (2008);e-print arXiv:hep-th/0805.0602] are analyzed in detail.
Electron localization and optical absorption of polygonal quantum rings
Sitek, Anna; Serra, Llorenç; Gudmundsson, Vidar; Manolescu, Andrei
2015-06-01
We investigate theoretically polygonal quantum rings and focus mostly on the triangular geometry where the corner effects are maximal. Such rings can be seen as short core-shell nanowires, a generation of semiconductor heterostructures with multiple applications. We show how the geometry of the sample determines the electronic energy spectrum, and also the localization of electrons, with effects on the optical absorption. In particular, we show that irrespective of the ring shape low-energy electrons are always attracted by corners and are localized in their vicinity. The absorption spectrum in the presence of a magnetic field shows only two peaks within the corner-localized state domain, each associated with different circular polarization. This picture may be changed by an external electric field which allows previously forbidden transitions, and thus enables the number of corners to be determined. We show that polygonal quantum rings allow absorption of waves from distant ranges of the electromagnetic spectrum within one sample.
QUADRATIC SERENDIPITY FINITE ELEMENTS ON POLYGONS USING GENERALIZED BARYCENTRIC COORDINATES.
Rand, Alexander; Gillette, Andrew; Bajaj, Chandrajit
2014-01-01
We introduce a finite element construction for use on the class of convex, planar polygons and show it obtains a quadratic error convergence estimate. On a convex n -gon, our construction produces 2 n basis functions, associated in a Lagrange-like fashion to each vertex and each edge midpoint, by transforming and combining a set of n ( n + 1)/2 basis functions known to obtain quadratic convergence. The technique broadens the scope of the so-called 'serendipity' elements, previously studied only for quadrilateral and regular hexahedral meshes, by employing the theory of generalized barycentric coordinates. Uniform a priori error estimates are established over the class of convex quadrilaterals with bounded aspect ratio as well as over the class of convex planar polygons satisfying additional shape regularity conditions to exclude large interior angles and short edges. Numerical evidence is provided on a trapezoidal quadrilateral mesh, previously not amenable to serendipity constructions, and applications to adaptive meshing are discussed.
Selection of industrial robots using the Polygons area method
Directory of Open Access Journals (Sweden)
Mortaza Honarmande Azimi
2014-08-01
Full Text Available Selection of robots from the several proposed alternatives is a very important and tedious task. Decision makers are not limited to one method and several methods have been proposed for solving this problem. This study presents Polygons Area Method (PAM as a multi attribute decision making method for robot selection problem. In this method, the maximum polygons area obtained from the attributes of an alternative robot on the radar chart is introduced as a decision-making criterion. The results of this method are compared with other typical multiple attribute decision-making methods (SAW, WPM, TOPSIS, and VIKOR by giving two examples. To find similarity in ranking given by different methods, Spearman’s rank correlation coefficients are obtained for different pairs of MADM methods. It was observed that the introduced method is in good agreement with other well-known MADM methods in the robot selection problem.
Invariant polygons in systems with grazing-sliding.
Szalai, R; Osinga, H M
2008-06-01
The paper investigates generic three-dimensional nonsmooth systems with a periodic orbit near grazing-sliding. We assume that the periodic orbit is unstable with complex multipliers so that two dominant frequencies are present in the system. Because grazing-sliding induces a dimension loss and the instability drives every trajectory into sliding, the system has an attractor that consists of forward sliding orbits. We analyze this attractor in a suitably chosen Poincare section using a three-parameter generalized map that can be viewed as a normal form. We show that in this normal form the attractor must be contained in a finite number of lines that intersect in the vertices of a polygon. However the attractor is typically larger than the associated polygon. We classify the number of lines involved in forming the attractor as a function of the parameters. Furthermore, for fixed values of parameters we investigate the one-dimensional dynamics on the attractor.
Extending backward polygon beam tracing to glossy scattering surfaces
CSIR Research Space (South Africa)
Duvenhage, B
2011-05-01
Full Text Available to render caustics that could not otherwise be sim- ulated efficiently using the high fidelity forward raytracing and radiosity rendering techniques of the time. Similar to what Heckbert and Hanrahan proposed, Watt [Wat90] used backward polygon beam....: Adaptive radiosity textures for bidi- rectional ray tracing. In SIGGRAPH ?90: Proceedings of the 17th Annual Conference on Computer graphics and Interactive Techniques (New York, NY, USA, 1990), ACM Press, New York, pp. 145?154. [HH84] HECKBERT P. S...
Fat polygonal partitions with applications to visualization and embeddings
Directory of Open Access Journals (Sweden)
Mark de Berg
2013-12-01
Full Text Available Let T be a rooted and weighted tree, where the weight of any node is equal to the sum of the weights of its children. The popular Treemap algorithm visualizes such a tree as a hierarchical partition of a square into rectangles, where the area of the rectangle corresponding to any node in T is equal to the weight of that node. The aspect ratio of the rectangles in such a rectangular partition necessarily depends on the weights and can become arbitrarily high.We introduce a new hierarchical partition scheme, called a polygonal partition, which uses convex polygons rather than just rectangles. We present two methods for constructing polygonal partitions, both having guarantees on the worst-case aspect ratio of the constructed polygons; in particular, both methods guarantee a bound on the aspect ratio that is independent of the weights of the nodes.We also consider rectangular partitions with slack, where the areas of the rectangles may differ slightly from the weights of the corresponding nodes. We show that this makes it possible to obtain partitions with constant aspect ratio. This result generalizes to hyper-rectangular partitions in ℝd. We use these partitions with slack for embedding ultrametrics into d-dimensional Euclidean space: we give a polylog(Δ-approximation algorithm for embedding n-point ultrametrics into ℝd with minimum distortion, where Δ denotes the spread of the metric. The previously best-known approximation ratio for this problem was polynomial in n. This is the first algorithm for embedding a non-trivial family of weighted-graph metrics into a space of constant dimension that achieves polylogarithmic approximation ratio.
Measured Hydrologic Storage Characteristics of Three Major Ice Wedge Polygon Types, Barrow, Alaska
Chamberlain, A. J.; Liljedahl, A.; Wilson, C. J.; Cable, W.; Romanovsky, V. E.
2014-12-01
Model simulations have suggested that the hydrologic fluxes and stores of Arctic wetlands are constrained by the micro-topographical features of ice wedge polygons, which are abundant in lowland tundra landscapes. Recently observed changes in ice wedge polygon landscapes - in particular, ice wedge degradation and trough formation - emphasize the need to better understand how differing ice wedge polygon morphologies affect the larger hydrologic system. Here we present three seasons of measured end-of-winter snow accumulation, continuous soil moisture and water table elevations, and repeated frost table mapping. Together, these describe the hydrologic characteristics of three main ice wedge polygon types: low centered polygons with limited trough development (representative of a ~500 year old vegetated drained thaw lake basin), and low- and high-centered polygons with well-defined troughs. Dramatic spatiotemporal variability exists both between polygon types and between the features of an individual polygon (e.g. troughs, centers, rims). Landscape-scale end-of-winter snow water equivalent is similar between polygon types, while the sub-polygon scale distribution of the surface water differs, both as snow and as ponded water. Some sub-polygon features appear buffered against large variations in water levels, while others display periods of prolonged recessions and large responses to rain events. Frost table elevations in general mimic the ground surface topography, but with spatiotemporal variability in thaw rate. The studied thaw seasons represented above long-term average rainfall, and in 2014, record high June precipitation. Differing ice wedge polygon types express dramatically different local hydrology, despite nearly identical climate forcing and landscape-scale snow accumulation, making ice wedge polygons an important component when describing the Arctic water, nutrient and energy system.
A Novel Polygonal Finite Element Method: Virtual Node Method
Tang, X. H.; Zheng, C.; Zhang, J. H.
2010-05-01
Polygonal finite element method (PFEM), which can construct shape functions on polygonal elements, provides greater flexibility in mesh generation. However, the non-polynomial form of traditional PFEM, such as Wachspress method and Mean Value method, leads to inexact numerical integration. Since the integration technique for non-polynomial functions is immature. To overcome this shortcoming, a great number of integration points have to be used to obtain sufficiently exact results, which increases computational cost. In this paper, a novel polygonal finite element method is proposed and called as virtual node method (VNM). The features of present method can be list as: (1) It is a PFEM with polynomial form. Thereby, Hammer integral and Gauss integral can be naturally used to obtain exact numerical integration; (2) Shape functions of VNM satisfy all the requirements of finite element method. To test the performance of VNM, intensive numerical tests are carried out. It found that, in standard patch test, VNM can achieve significantly better results than Wachspress method and Mean Value method. Moreover, it is observed that VNM can achieve better results than triangular 3-node elements in the accuracy test.
Fast incorporation of optical flow into active polygons.
Unal, Gozde; Krim, Hamid; Yezzi, Anthony
2005-06-01
In this paper, we first reconsider, in a different light, the addition of a prediction step to active contour-based visual tracking using an optical flow and clarify the local computation of the latter along the boundaries of continuous active contours with appropriate regularizers. We subsequently detail our contribution of computing an optical flow-based prediction step directly from the parameters of an active polygon, and of exploiting it in object tracking. This is in contrast to an explicitly separate computation of the optical flow and its ad hoc application. It also provides an inherent regularization effect resulting from integrating measurements along polygon edges. As a result, we completely avoid the need of adding ad hoc regularizing terms to the optical flow computations, and the inevitably arbitrary associated weighting parameters. This direct integration of optical flow into the active polygon framework distinguishes this technique from most previous contour-based approaches, where regularization terms are theoretically, as well as practically, essential. The greater robustness and speed due to a reduced number of parameters of this technique are additional and appealing features.
PolyRES: A polygon-based Richards equation solver
International Nuclear Information System (INIS)
Hills, R.G.
1995-12-01
This document describes the theory, implementation, and use of a software package designed to solve the transient, two-dimensional, Richards equation for water flow in unsaturated-saturated soils. This package was specifically designed to model complex geometries with minimal input from the user and to simulate groundwater flow related to assessment of low-level radioactive waste disposal sites and engineered facilities. The spatial variation of the hydraulic properties can be defined across individual polygon-shaped subdomains, called objects. These objects combine to form a polygon-shaped model domain. Each object can have its own distribution of hydraulic parameters. The resulting model domain and polygon-shaped internal objects are mapped onto a rectangular, finite-volume, computational grid by a preprocessor. This allows the user to specify model geometry independently of the underlying grid and greatly simplifies user input for complex geometries. In addition, this approach significantly reduces the computational requirements since complex geometries are actually modeled on a rectangular grid. This results in well-structured, finite difference-like systems of equations that require minimal storage and are very efficient to solve. The documentation for this software package includes a user's manual, a detailed description of the underlying theory, and a detailed discussion of program flow. Several example problems are presented that show the use and features of the software package. The water flow predictions for several of these example problems are compared to those of another algorithm to test for prediction equivalency
A model of anelastic relaxation associated with polygonization boundary
International Nuclear Information System (INIS)
Yan, S.C.
1990-01-01
A model of anelastic relaxation associated with polygonization boundary is proposed in order to explain internal friction peaks and other experimental phenomena observed recently. The model, which is referred to as vacancy-thermal jog model, shows that under conditions of high temperature and low applied stress with lower frequencies of vibration, thermal jog pairs are generated on dislocation segments of the boundaries. These jogs are in saturation with vacancies in the vicinity of them, and the vacancy current due to the concentration gradient of vacancy drifts among the boundaries. As a result, a diffusional creep is produced and a part of energy is dissipated. For vacancy drift, it is required that the thermal jogs emit (absorb) vacancies, which brings climbing bow of segments into operation, and another part of energy is dissipated so that there are two parts of energy dissipated in the strain process connected with polygonization boundary. Based on this point of view, the mathematical expressions of internal friction and modulus defect associated with polygonization boundary were subsequently derived and found to be in satisfactory agreement with experiments. (author). 13 refs, 6 figs
Curvature of random walks and random polygons in confinement
International Nuclear Information System (INIS)
Diao, Y; Ernst, C; Montemayor, A; Ziegler, U
2013-01-01
The purpose of this paper is to study the curvature of equilateral random walks and polygons that are confined in a sphere. Curvature is one of several basic geometric properties that can be used to describe random walks and polygons. We show that confinement affects curvature quite strongly, and in the limit case where the confinement diameter equals the edge length the unconfined expected curvature value doubles from π/2 to π. To study curvature a simple model of an equilateral random walk in spherical confinement in dimensions 2 and 3 is introduced. For this simple model we derive explicit integral expressions for the expected value of the total curvature in both dimensions. These expressions are functions that depend only on the radius R of the confinement sphere. We then show that the values obtained by numeric integration of these expressions agrees with numerical average curvature estimates obtained from simulations of random walks. Finally, we compare the confinement effect on curvature of random walks with random polygons. (paper)
Electronic properties of carbon nanotubes with polygonized cross sections
International Nuclear Information System (INIS)
Charlier, J.; Lambin, P.; Ebbesen, T.
1996-01-01
The electronic properties of carbon nanotubes having polygonized cross sections instead of purely circular ones, such as recently observed using transmission electron microscopy, are investigated with plane-wave ab initio pseudopotential local-density-functional calculations and simple tight-binding models. Strong σ * -π * hybridization effects occur in zigzag nanotubes due to the high curvature located near the edges of the polygonal cross-section prism. These effects, combined with a lowering of symmetry, dramatically affect the electronic properties of the nanotubes. It is found that modified low-lying conduction-band states are introduced either into the bandgap of insulating nanotubes, or below the degenerate states that form the top of the valence band of metallic nanotubes, leading the corresponding nanostructures to be metals, semimetals, or at least very-small-gap semiconductors. The degree of the polygon representing the cross section of the tube, and the sharpness of the edge angles, are found to be major factors in the hybridization effect, and consequently govern the electronic behavior at the Fermi level. copyright 1996 The American Physical Society
The average crossing number of equilateral random polygons
International Nuclear Information System (INIS)
Diao, Y; Dobay, A; Kusner, R B; Millett, K; Stasiak, A
2003-01-01
In this paper, we study the average crossing number of equilateral random walks and polygons. We show that the mean average crossing number ACN of all equilateral random walks of length n is of the form (3/16)n ln n + O(n). A similar result holds for equilateral random polygons. These results are confirmed by our numerical studies. Furthermore, our numerical studies indicate that when random polygons of length n are divided into individual knot types, the for each knot type K can be described by a function of the form = a(n-n 0 )ln(n-n 0 ) + b(n-n 0 ) + c where a, b and c are constants depending on K and n 0 is the minimal number of segments required to form K. The profiles diverge from each other, with more complex knots showing higher than less complex knots. Moreover, the profiles intersect with the profile of all closed walks. These points of intersection define the equilibrium length of K, i.e., the chain length n e (K) at which a statistical ensemble of configurations with given knot type K-upon cutting, equilibration and reclosure to a new knot type K'-does not show a tendency to increase or decrease . This concept of equilibrium length seems to be universal, and applies also to other length-dependent observables for random knots, such as the mean radius of gyration g >
U.S. Environmental Protection Agency — Dataset presents concentrations of organic pollutants, such as polyaromatic hydrocarbon compounds, in water samples. Water samples of known volume and concentration...
Robinson, Gilbert de B
2011-01-01
This brief undergraduate-level text by a prominent Cambridge-educated mathematician explores the relationship between algebra and geometry. An elementary course in plane geometry is the sole requirement for Gilbert de B. Robinson's text, which is the result of several years of teaching and learning the most effective methods from discussions with students. Topics include lines and planes, determinants and linear equations, matrices, groups and linear transformations, and vectors and vector spaces. Additional subjects range from conics and quadrics to homogeneous coordinates and projective geom
Thomas, E. G. F.
2012-01-01
This paper deals with the theory of integration of scalar functions with respect to a measure with values in a, not necessarily locally convex, topological vector space. It focuses on the extension of such integrals from bounded measurable functions to the class of integrable functions, proving
Editorial: Datasets for Learning Analytics
Dietze, Stefan; George, Siemens; Davide, Taibi; Drachsler, Hendrik
2018-01-01
The European LinkedUp and LACE (Learning Analytics Community Exchange) project have been responsible for setting up a series of data challenges at the LAK conferences 2013 and 2014 around the LAK dataset. The LAK datasets consists of a rich collection of full text publications in the domain of
Small-Scale Polygons and the History of Ground Ice on Mars
Mellon, Michael T.
2000-01-01
This research has laid a foundation for continued study of permafrost polygons on Mars using the models and understanding discussed here. Further study of polygonal patterns on Mars is proceeding (under new funding) which is expected to reveal more results about the origin of observed martian polygons and what information they contain regarding the recent history of tile martian climate and of water ice on Mars.
Open University Learning Analytics dataset.
Kuzilek, Jakub; Hlosta, Martin; Zdrahal, Zdenek
2017-11-28
Learning Analytics focuses on the collection and analysis of learners' data to improve their learning experience by providing informed guidance and to optimise learning materials. To support the research in this area we have developed a dataset, containing data from courses presented at the Open University (OU). What makes the dataset unique is the fact that it contains demographic data together with aggregated clickstream data of students' interactions in the Virtual Learning Environment (VLE). This enables the analysis of student behaviour, represented by their actions. The dataset contains the information about 22 courses, 32,593 students, their assessment results, and logs of their interactions with the VLE represented by daily summaries of student clicks (10,655,280 entries). The dataset is freely available at https://analyse.kmi.open.ac.uk/open_dataset under a CC-BY 4.0 license.
Material parameters characterization for arbitrary N-sided regular polygonal invisible cloak
International Nuclear Information System (INIS)
Wu Qun; Zhang Kuang; Meng Fanyi; Li Lewei
2009-01-01
Arbitrary N-sided regular polygonal cylindrical cloaks are proposed and designed based on the coordinate transformation theory. First, the general expressions of constitutive tensors of the N-sided regular polygonal cylindrical cloaks are derived, then there are some full-wave simulations of the cloaks that are composed of inhomogeneous and anisotropic metamaterials, which will bend incoming electromagnetic waves and guide them to propagate around the inner region; such electromagnetic waves will return to their original propagation directions without distorting the waves outside the polygonal cloak. The results of full-wave simulations validate the general expressions of constitutive tensors of the N-sided regular polygonal cylindrical cloaks we derived.
A numerical investigation of sub-wavelength resonances in polygonal metamaterial cylinders
DEFF Research Database (Denmark)
Arslanagic, Samel; Breinbjerg, Olav
2009-01-01
The sub-wavelength resonances, known to exist in metamaterial radiators and scatterers of circular cylindrical shape, are investigated with the aim of determining if these resonances also exist for polygonal cylinders and, if so, how they are affected by the shape of the polygon. To this end, a set...... of polygonal cylinders excited by a nearby electric line current is analyzed numerically and it is shown, through detailed analysis of the near-field distribution and radiation resistance, that these polygonal cylinders do indeed support sub-wavelength resonances similar to those of the circular cylinders...
Local Patch Vectors Encoded by Fisher Vectors for Image Classification
Directory of Open Access Journals (Sweden)
Shuangshuang Chen
2018-02-01
Full Text Available The objective of this work is image classification, whose purpose is to group images into corresponding semantic categories. Four contributions are made as follows: (i For computational simplicity and efficiency, we directly adopt raw image patch vectors as local descriptors encoded by Fisher vector (FV subsequently; (ii For obtaining representative local features within the FV encoding framework, we compare and analyze three typical sampling strategies: random sampling, saliency-based sampling and dense sampling; (iii In order to embed both global and local spatial information into local features, we construct an improved spatial geometry structure which shows good performance; (iv For reducing the storage and CPU costs of high dimensional vectors, we adopt a new feature selection method based on supervised mutual information (MI, which chooses features by an importance sorting algorithm. We report experimental results on dataset STL-10. It shows very promising performance with this simple and efficient framework compared to conventional methods.
Interactive visualization and analysis of multimodal datasets for surgical applications.
Kirmizibayrak, Can; Yim, Yeny; Wakid, Mike; Hahn, James
2012-12-01
Surgeons use information from multiple sources when making surgical decisions. These include volumetric datasets (such as CT, PET, MRI, and their variants), 2D datasets (such as endoscopic videos), and vector-valued datasets (such as computer simulations). Presenting all the information to the user in an effective manner is a challenging problem. In this paper, we present a visualization approach that displays the information from various sources in a single coherent view. The system allows the user to explore and manipulate volumetric datasets, display analysis of dataset values in local regions, combine 2D and 3D imaging modalities and display results of vector-based computer simulations. Several interaction methods are discussed: in addition to traditional interfaces including mouse and trackers, gesture-based natural interaction methods are shown to control these visualizations with real-time performance. An example of a medical application (medialization laryngoplasty) is presented to demonstrate how the combination of different modalities can be used in a surgical setting with our approach.
An introduction to vectors, vector operators and vector analysis
Joag, Pramod S
2016-01-01
Ideal for undergraduate and graduate students of science and engineering, this book covers fundamental concepts of vectors and their applications in a single volume. The first unit deals with basic formulation, both conceptual and theoretical. It discusses applications of algebraic operations, Levi-Civita notation, and curvilinear coordinate systems like spherical polar and parabolic systems and structures, and analytical geometry of curves and surfaces. The second unit delves into the algebra of operators and their types and also explains the equivalence between the algebra of vector operators and the algebra of matrices. Formulation of eigen vectors and eigen values of a linear vector operator are elaborated using vector algebra. The third unit deals with vector analysis, discussing vector valued functions of a scalar variable and functions of vector argument (both scalar valued and vector valued), thus covering both the scalar vector fields and vector integration.
Engaging student expeditionary units to land work at aerospace polygons
Directory of Open Access Journals (Sweden)
Ирина Жемерова
2016-10-01
Full Text Available To organize the aerospace polygon it is necessary to conduct a large number of measurement and descriptive works. First and foremost is working with the fund and cartographic material. The map of the landfill shows the most important objects and phenomena: quarries, sinkholes, deep ravines, industrial, residential and protected areas. Organization of the aerospace polygon operation involves large labour costs. To train professionals on the ground research of the earth’s cover remote sensing, we have organized a permanent student expedition. Prior to the start of work, students listen to a series of introductory lectures on remote sensing, principles of ground work, methods of statistical evaluation, basic methods of data collection and processing. This article covers one direction of work - collecting and processing of phytometric data of crops and steppe vegetation in the Streletskaya steppe in the Central Chernozem nature reserve. The work is carried out on the test area of Kursk aerospace polygon, organized on the basis of Kursk biospheric station of the Institute of Geography RAS. A generally accepted method of test platforms is used on the routes. The results of measurements and observations are recorded in a field book. Species diversity, plant height, projective cover and crops density are determined on the sample area by the instrumental and visual methods. The rest phytometric indexes are calculated in laboratory conditions. The students can use the resulting material when writing articles, course and degree works. At the site, students acquire skills of working in field conditions with natural objects, collecting and processing of information by various methods, expanding understanding of the need and importance of the earth surface study by remote sensing methods.
The Knot Spectrum of Confined Random Equilateral Polygons
Directory of Open Access Journals (Sweden)
Diao Y.
2014-01-01
Full Text Available It is well known that genomic materials (long DNA chains of living organisms are often packed compactly under extreme confining conditions using macromolecular self-assembly processes but the general DNA packing mechanism remains an unsolved problem. It has been proposed that the topology of the packed DNA may be used to study the DNA packing mechanism. For example, in the case of (mutant bacteriophage P4, DNA molecules packed inside the bacteriophage head are considered to be circular since the two sticky ends of the DNA are close to each other. The DNAs extracted from the capsid without separating the two ends can thus preserve the topology of the (circular DNAs. It turns out that the circular DNAs extracted from bacteriophage P4 are non-trivially knotted with very high probability and with a bias toward chiral knots. In order to study this problem using a systematic approach based on mathematical modeling, one needs to introduce a DNA packing model under extreme volume confinement condition and test whether such a model can produce the kind of knot spectrum observed in the experiments. In this paper we introduce and study a model of equilateral random polygons con_ned in a sphere. This model is not meant to generate polygons that model DNA packed in a virus head directly. Instead, the average topological characteristics of this model may serve as benchmark data for totally randomly packed circular DNAs. The difference between the biologically observed topological characteristics and our benchmark data might reveal the bias of DNA packed in the viral capsids and possibly lead to a better understanding of the DNA packing mechanism, at least for the bacteriophage DNA. The purpose of this paper is to provide information about the knot spectrum of equilateral random polygons under such a spherical confinement with length and confinement ratios in a range comparable to circular DNAs packed inside bacteriophage heads.
Giant polygons and mounds in the lowlands of Mars: signatures of an ancient ocean?
Oehler, Dorothy Z; Allen, Carlton C
2012-06-01
This paper presents the hypothesis that the well-known giant polygons and bright mounds of the martian lowlands may be related to a common process-a process of fluid expulsion that results from burial of fine-grained sediments beneath a body of water. Specifically, we hypothesize that giant polygons and mounds in Chryse and Acidalia Planitiae are analogous to kilometer-scale polygons and mud volcanoes in terrestrial, marine basins and that the co-occurrence of masses of these features in Chryse and Acidalia may be the signature of sedimentary processes in an ancient martian ocean. We base this hypothesis on recent data from both Earth and Mars. On Earth, 3-D seismic data illustrate kilometer-scale polygons that may be analogous to the giant polygons on Mars. The terrestrial polygons form in fine-grained sediments that have been deposited and buried in passive-margin, marine settings. These polygons are thought to result from compaction/dewatering, and they are commonly associated with fluid expulsion features, such as mud volcanoes. On Mars, in Chryse and Acidalia Planitiae, orbital data demonstrate that giant polygons and mounds have overlapping spatial distributions. There, each set of features occurs within a geological setting that is seemingly analogous to that of the terrestrial, kilometer-scale polygons (broad basin of deposition, predicted fine-grained sediments, and lack of significant horizontal stress). Regionally, the martian polygons and mounds both show a correlation to elevation, as if their formation were related to past water levels. Although these observations are based on older data with incomplete coverage, a similar correlation to elevation has been established in one local area studied in detail with newer higher-resolution data. Further mapping with the latest data sets should more clearly elucidate the relationship(s) of the polygons and mounds to elevation over the entire Chryse-Acidalia region and thereby provide more insight into this
Turkey Run Landfill Emissions Dataset
U.S. Environmental Protection Agency — landfill emissions measurements for the Turkey run landfill in Georgia. This dataset is associated with the following publication: De la Cruz, F., R. Green, G....
U.S. Environmental Protection Agency — Emissions data from open air oil burns. This dataset is associated with the following publication: Gullett, B., J. Aurell, A. Holder, B. Mitchell, D. Greenwell, M....
Chemical product and function dataset
U.S. Environmental Protection Agency — Merged product weight fraction and chemical function data. This dataset is associated with the following publication: Isaacs , K., M. Goldsmith, P. Egeghy , K....
A fast ergodic algorithm for generating ensembles of equilateral random polygons
Varela, R.; Hinson, K.; Arsuaga, J.; Diao, Y.
2009-03-01
Knotted structures are commonly found in circular DNA and along the backbone of certain proteins. In order to properly estimate properties of these three-dimensional structures it is often necessary to generate large ensembles of simulated closed chains (i.e. polygons) of equal edge lengths (such polygons are called equilateral random polygons). However finding efficient algorithms that properly sample the space of equilateral random polygons is a difficult problem. Currently there are no proven algorithms that generate equilateral random polygons with its theoretical distribution. In this paper we propose a method that generates equilateral random polygons in a 'step-wise uniform' way. We prove that this method is ergodic in the sense that any given equilateral random polygon can be generated by this method and we show that the time needed to generate an equilateral random polygon of length n is linear in terms of n. These two properties make this algorithm a big improvement over the existing generating methods. Detailed numerical comparisons of our algorithm with other widely used algorithms are provided.
Development of polygon elements based on the scaled boundary finite element method
International Nuclear Information System (INIS)
Chiong, Irene; Song Chongmin
2010-01-01
We aim to extend the scaled boundary finite element method to construct conforming polygon elements. The development of the polygonal finite element is highly anticipated in computational mechanics as greater flexibility and accuracy can be achieved using these elements. The scaled boundary polygonal finite element will enable new developments in mesh generation, better accuracy from a higher order approximation and better transition elements in finite element meshes. Polygon elements of arbitrary number of edges and order have been developed successfully. The edges of an element are discretised with line elements. The displacement solution of the scaled boundary finite element method is used in the development of shape functions. They are shown to be smooth and continuous within the element, and satisfy compatibility and completeness requirements. Furthermore, eigenvalue decomposition has been used to depict element modes and outcomes indicate the ability of the scaled boundary polygonal element to express rigid body and constant strain modes. Numerical tests are presented; the patch test is passed and constant strain modes verified. Accuracy and convergence of the method are also presented and the performance of the scaled boundary polygonal finite element is verified on Cook's swept panel problem. Results show that the scaled boundary polygonal finite element method outperforms a traditional mesh and accuracy and convergence are achieved from fewer nodes. The proposed method is also shown to be truly flexible, and applies to arbitrary n-gons formed of irregular and non-convex polygons.
System and method for the adaptive mapping of matrix data to sets of polygons
Burdon, David (Inventor)
2003-01-01
A system and method for converting bitmapped data, for example, weather data or thermal imaging data, to polygons is disclosed. The conversion of the data into polygons creates smaller data files. The invention is adaptive in that it allows for a variable degree of fidelity of the polygons. Matrix data is obtained. A color value is obtained. The color value is a variable used in the creation of the polygons. A list of cells to check is determined based on the color value. The list of cells to check is examined in order to determine a boundary list. The boundary list is then examined to determine vertices. The determination of the vertices is based on a prescribed maximum distance. When drawn, the ordered list of vertices create polygons which depict the cell data. The data files which include the vertices for the polygons are much smaller than the corresponding cell data files. The fidelity of the polygon representation can be adjusted by repeating the logic with varying fidelity values to achieve a given maximum file size or a maximum number of vertices per polygon.
Decompositions, partitions, and coverings with convex polygons and pseudo-triangles
Aichholzer, O.; Huemer, C.; Kappes, S.; Speckmann, B.; Tóth, Cs.D.
2007-01-01
We propose a novel subdivision of the plane that consists of both convex polygons and pseudo-triangles. This pseudo-convex decomposition is significantly sparser than either convex decompositions or pseudo-triangulations for planar point sets and simple polygons. We also introduce pseudo-convex
Origin of the Polygons and Underground Structures in Western Utopia Planitia on Mars
Yoshikawa, K.
2002-01-01
The area of lower albedo (Hvm) has a higher density of polygonal patterns. These patterns potentially suggest that 1) the polygonal pattern is caused primarily by ground heaving and collapsing, 2) lower albedo materials had higher tensile strength. Additional information is contained in the original extended abstract.
Analysis of the Misconceptions of 7th Grade Students on Polygons and Specific Quadrilaterals
Ozkan, Mustafa; Bal, Ayten Pinar
2017-01-01
Purpose: This study will find out student misconceptions about geometrical figures, particularly polygons and quadrilaterals. Thus, it will offer insights into teaching these concepts. The objective of this study, the question of "What are the misconceptions of seventh grade students on polygons and quadrilaterals?" constitutes the…
International Nuclear Information System (INIS)
Yu Yunhan; Xia Yan; Liu Yaqiang; Wang Shi; Ma Tianyu; Chen Jing; Hong Baoyu
2013-01-01
To achieve a maximum compression of system matrix in positron emission tomography (PET) image reconstruction, we proposed a polygonal image pixel division strategy in accordance with rotationally symmetric PET geometry. Geometrical definition and indexing rule for polygonal pixels were established. Image conversion from polygonal pixel structure to conventional rectangular pixel structure was implemented using a conversion matrix. A set of test images were analytically defined in polygonal pixel structure, converted to conventional rectangular pixel based images, and correctly displayed which verified the correctness of the image definition, conversion description and conversion of polygonal pixel structure. A compressed system matrix for PET image recon was generated by tap model and tested by forward-projecting three different distributions of radioactive sources to the sinogram domain and comparing them with theoretical predictions. On a practical small animal PET scanner, a compress ratio of 12.6:1 of the system matrix size was achieved with the polygonal pixel structure, comparing with the conventional rectangular pixel based tap-mode one. OS-EM iterative image reconstruction algorithms with the polygonal and conventional Cartesian pixel grid were developed. A hot rod phantom was detected and reconstructed based on these two grids with reasonable time cost. Image resolution of reconstructed images was both 1.35 mm. We conclude that it is feasible to reconstruct and display images in a polygonal image pixel structure based on a compressed system matrix in PET image reconstruction. (authors)
Origami tubes with reconfigurable polygonal cross-sections.
Filipov, E T; Paulino, G H; Tachi, T
2016-01-01
Thin sheets can be assembled into origami tubes to create a variety of deployable, reconfigurable and mechanistically unique three-dimensional structures. We introduce and explore origami tubes with polygonal, translational symmetric cross-sections that can reconfigure into numerous geometries. The tubular structures satisfy the mathematical definitions for flat and rigid foldability, meaning that they can fully unfold from a flattened state with deformations occurring only at the fold lines. The tubes do not need to be straight and can be constructed to follow a non-linear curved line when deployed. The cross-section and kinematics of the tubular structures can be reprogrammed by changing the direction of folding at some folds. We discuss the variety of tubular structures that can be conceived and we show limitations that govern the geometric design. We quantify the global stiffness of the origami tubes through eigenvalue and structural analyses and highlight the mechanical characteristics of these systems. The two-scale nature of this work indicates that, from a local viewpoint, the cross-sections of the polygonal tubes are reconfigurable while, from a global viewpoint, deployable tubes of desired shapes are achieved. This class of tubes has potential applications ranging from pipes and micro-robotics to deployable architecture in buildings.
Origami tubes with reconfigurable polygonal cross-sections
Filipov, E. T.; Paulino, G. H.; Tachi, T.
2016-01-01
Thin sheets can be assembled into origami tubes to create a variety of deployable, reconfigurable and mechanistically unique three-dimensional structures. We introduce and explore origami tubes with polygonal, translational symmetric cross-sections that can reconfigure into numerous geometries. The tubular structures satisfy the mathematical definitions for flat and rigid foldability, meaning that they can fully unfold from a flattened state with deformations occurring only at the fold lines. The tubes do not need to be straight and can be constructed to follow a non-linear curved line when deployed. The cross-section and kinematics of the tubular structures can be reprogrammed by changing the direction of folding at some folds. We discuss the variety of tubular structures that can be conceived and we show limitations that govern the geometric design. We quantify the global stiffness of the origami tubes through eigenvalue and structural analyses and highlight the mechanical characteristics of these systems. The two-scale nature of this work indicates that, from a local viewpoint, the cross-sections of the polygonal tubes are reconfigurable while, from a global viewpoint, deployable tubes of desired shapes are achieved. This class of tubes has potential applications ranging from pipes and micro-robotics to deployable architecture in buildings. PMID:26997894
Transit Traffic Analysis Zone Delineating Method Based on Thiessen Polygon
Directory of Open Access Journals (Sweden)
Shuwei Wang
2014-04-01
Full Text Available A green transportation system composed of transit, busses and bicycles could be a significant in alleviating traffic congestion. However, the inaccuracy of current transit ridership forecasting methods is imposing a negative impact on the development of urban transit systems. Traffic Analysis Zone (TAZ delineating is a fundamental and essential step in ridership forecasting, existing delineating method in four-step models have some problems in reflecting the travel characteristics of urban transit. This paper aims to come up with a Transit Traffic Analysis Zone delineation method as supplement of traditional TAZs in transit service analysis. The deficiencies of current TAZ delineating methods were analyzed, and the requirements of Transit Traffic Analysis Zone (TTAZ were summarized. Considering these requirements, Thiessen Polygon was introduced into TTAZ delineating. In order to validate its feasibility, Beijing was then taken as an example to delineate TTAZs, followed by a spatial analysis of office buildings within a TTAZ and transit station departure passengers. Analysis result shows that the TTAZs based on Thiessen polygon could reflect the transit travel characteristic and is of in-depth research value.
Polygonal patterned peatlands of the White Sea islands
Kutenkov, S. A.; Kozhin, M. N.; Golovina, E. O.; Kopeina, E. I.; Stoikina, N. V.
2018-03-01
The summits and slopes of some islands along the northeastern and northern coasts of the White Sea are covered with dried out peatlands. The thickness of the peat deposit is 30–80 cm and it is separated by troughs into gently sloping polygonal peat blocks up to 20 m2 in size. On some northern islands the peat blocks have permafrost cores. The main components of the dried out peatlands vegetation are dwarf shrubs and lichens. The peat stratigraphy reveals two stages of peatland development. On the first stage, the islands were covered with wet cottongrass carpets, which repeated the convex relief shape. On the second stage, they were occupied by the xeromorphic vegetation. We suggest that these polygonal patterned peatlands are the remnants of blanket bogs, the formation of which assumes the conditions of a much more humid climate in the historical past. The time of their active development was calculated according to the White Sea level changes and radiocarbon dates from 1000–4000 BP.
Brooker, L. M.; Balme, M. R.; Conway, S. J.; Hagermann, A.; Barrett, A. M.; Collins, G. S.; Soare, R. J.
2018-03-01
Polygonal networks of patterned ground are a common feature in cold-climate environments. They can form through the thermal contraction of ice-cemented sediment (i.e. formed from fractures), or the freezing and thawing of ground ice (i.e. formed by patterns of clasts, or ground deformation). The characteristics of these landforms provide information about environmental conditions. Analogous polygonal forms have been observed on Mars leading to inferences about environmental conditions. We have identified clastic polygonal features located around Lyot crater, Mars (50°N, 30°E). These polygons are unusually large (>100 m diameter) compared to terrestrial clastic polygons, and contain very large clasts, some of which are up to 15 metres in diameter. The polygons are distributed in a wide arc around the eastern side of Lyot crater, at a consistent distance from the crater rim. Using high-resolution imaging data, we digitised these features to extract morphological information. These data are compared to existing terrestrial and Martian polygon data to look for similarities and differences and to inform hypotheses concerning possible formation mechanisms. Our results show the clastic polygons do not have any morphometric features that indicate they are similar to terrestrial sorted, clastic polygons formed by freeze-thaw processes. They are too large, do not show the expected variation in form with slope, and have clasts that do not scale in size with polygon diameter. However, the clastic networks are similar in network morphology to thermal contraction cracks, and there is a potential direct Martian analogue in a sub-type of thermal contraction polygons located in Utopia Planitia. Based upon our observations, we reject the hypothesis that polygons located around Lyot formed as freeze-thaw polygons and instead an alternative mechanism is put forward: they result from the infilling of earlier thermal contraction cracks by wind-blown material, which then became
A Polygon and Point-Based Approach to Matching Geospatial Features
Directory of Open Access Journals (Sweden)
Juan J. Ruiz-Lendínez
2017-12-01
Full Text Available A methodology for matching bidimensional entities is presented in this paper. The matching is proposed for both area and point features extracted from geographical databases. The procedure used to obtain homologous entities is achieved in a two-step process: The first matching, polygon to polygon matching (inter-element matching, is obtained by means of a genetic algorithm that allows the classifying of area features from two geographical databases. After this, we apply a point to point matching (intra-element matching based on the comparison of changes in their turning functions. This study shows that genetic algorithms are suitable for matching polygon features even if these features are quite different. Our results show up to 40% of matched polygons with differences in geometrical attributes. With regards to point matching, the vertex from homologous polygons, the function and threshold values proposed in this paper show a useful method for obtaining precise vertex matching.
The average inter-crossing number of equilateral random walks and polygons
International Nuclear Information System (INIS)
Diao, Y; Dobay, A; Stasiak, A
2005-01-01
In this paper, we study the average inter-crossing number between two random walks and two random polygons in the three-dimensional space. The random walks and polygons in this paper are the so-called equilateral random walks and polygons in which each segment of the walk or polygon is of unit length. We show that the mean average inter-crossing number ICN between two equilateral random walks of the same length n is approximately linear in terms of n and we were able to determine the prefactor of the linear term, which is a = 3ln2/8 ∼ 0.2599. In the case of two random polygons of length n, the mean average inter-crossing number ICN is also linear, but the prefactor of the linear term is different from that of the random walks. These approximations apply when the starting points of the random walks and polygons are of a distance ρ apart and ρ is small compared to n. We propose a fitting model that would capture the theoretical asymptotic behaviour of the mean average ICN for large values of ρ. Our simulation result shows that the model in fact works very well for the entire range of ρ. We also study the mean ICN between two equilateral random walks and polygons of different lengths. An interesting result is that even if one random walk (polygon) has a fixed length, the mean average ICN between the two random walks (polygons) would still approach infinity if the length of the other random walk (polygon) approached infinity. The data provided by our simulations match our theoretical predictions very well
The NOAA Dataset Identifier Project
de la Beaujardiere, J.; Mccullough, H.; Casey, K. S.
2013-12-01
The US National Oceanic and Atmospheric Administration (NOAA) initiated a project in 2013 to assign persistent identifiers to datasets archived at NOAA and to create informational landing pages about those datasets. The goals of this project are to enable the citation of datasets used in products and results in order to help provide credit to data producers, to support traceability and reproducibility, and to enable tracking of data usage and impact. A secondary goal is to encourage the submission of datasets for long-term preservation, because only archived datasets will be eligible for a NOAA-issued identifier. A team was formed with representatives from the National Geophysical, Oceanographic, and Climatic Data Centers (NGDC, NODC, NCDC) to resolve questions including which identifier scheme to use (answer: Digital Object Identifier - DOI), whether or not to embed semantics in identifiers (no), the level of granularity at which to assign identifiers (as coarsely as reasonable), how to handle ongoing time-series data (do not break into chunks), creation mechanism for the landing page (stylesheet from formal metadata record preferred), and others. Decisions made and implementation experience gained will inform the writing of a Data Citation Procedural Directive to be issued by the Environmental Data Management Committee in 2014. Several identifiers have been issued as of July 2013, with more on the way. NOAA is now reporting the number as a metric to federal Open Government initiatives. This paper will provide further details and status of the project.
The Harvard organic photovoltaic dataset.
Lopez, Steven A; Pyzer-Knapp, Edward O; Simm, Gregor N; Lutzow, Trevor; Li, Kewei; Seress, Laszlo R; Hachmann, Johannes; Aspuru-Guzik, Alán
2016-09-27
The Harvard Organic Photovoltaic Dataset (HOPV15) presented in this work is a collation of experimental photovoltaic data from the literature, and corresponding quantum-chemical calculations performed over a range of conformers, each with quantum chemical results using a variety of density functionals and basis sets. It is anticipated that this dataset will be of use in both relating electronic structure calculations to experimental observations through the generation of calibration schemes, as well as for the creation of new semi-empirical methods and the benchmarking of current and future model chemistries for organic electronic applications.
The Harvard organic photovoltaic dataset
Lopez, Steven A.; Pyzer-Knapp, Edward O.; Simm, Gregor N.; Lutzow, Trevor; Li, Kewei; Seress, Laszlo R.; Hachmann, Johannes; Aspuru-Guzik, Alán
2016-01-01
The Harvard Organic Photovoltaic Dataset (HOPV15) presented in this work is a collation of experimental photovoltaic data from the literature, and corresponding quantum-chemical calculations performed over a range of conformers, each with quantum chemical results using a variety of density functionals and basis sets. It is anticipated that this dataset will be of use in both relating electronic structure calculations to experimental observations through the generation of calibration schemes, as well as for the creation of new semi-empirical methods and the benchmarking of current and future model chemistries for organic electronic applications. PMID:27676312
Deformations of polyhedra and polygons by the unitary group
Energy Technology Data Exchange (ETDEWEB)
Livine, Etera R. [Laboratoire de Physique, ENS Lyon, CNRS-UMR 5672, 46 Allée d' Italie, Lyon 69007, France and Perimeter Institute, 31 Caroline St N, Waterloo, Ontario N2L 2Y5 (Canada)
2013-12-15
We introduce the set of framed (convex) polyhedra with N faces as the symplectic quotient C{sup 2N}//SU(2). A framed polyhedron is then parametrized by N spinors living in C{sup 2} satisfying suitable closure constraints and defines a usual convex polyhedron plus extra U(1) phases attached to each face. We show that there is a natural action of the unitary group U(N) on this phase space, which changes the shape of faces and allows to map any (framed) polyhedron onto any other with the same total (boundary) area. This identifies the space of framed polyhedra to the Grassmannian space U(N)/ (SU(2)×U(N−2)). We show how to write averages of geometrical observables (polynomials in the faces' area and the angles between them) over the ensemble of polyhedra (distributed uniformly with respect to the Haar measure on U(N)) as polynomial integrals over the unitary group and we provide a few methods to compute these integrals systematically. We also use the Itzykson-Zuber formula from matrix models as the generating function for these averages and correlations. In the quantum case, a canonical quantization of the framed polyhedron phase space leads to the Hilbert space of SU(2) intertwiners (or, in other words, SU(2)-invariant states in tensor products of irreducible representations). The total boundary area as well as the individual face areas are quantized as half-integers (spins), and the Hilbert spaces for fixed total area form irreducible representations of U(N). We define semi-classical coherent intertwiner states peaked on classical framed polyhedra and transforming consistently under U(N) transformations. And we show how the U(N) character formula for unitary transformations is to be considered as an extension of the Itzykson-Zuber to the quantum level and generates the traces of all polynomial observables over the Hilbert space of intertwiners. We finally apply the same formalism to two dimensions and show that classical (convex) polygons can be described in
A polygon soup representation for free viewpoint video
Colleu, T.; Pateux, S.; Morin, L.; Labit, C.
2010-02-01
This paper presents a polygon soup representation for multiview data. Starting from a sequence of multi-view video plus depth (MVD) data, the proposed representation takes into account, in a unified manner, different issues such as compactness, compression, and intermediate view synthesis. The representation is built in two steps. First, a set of 3D quads is extracted using a quadtree decomposition of the depth maps. Second, a selective elimination of the quads is performed in order to reduce inter-view redundancies and thus provide a compact representation. Moreover, the proposed methodology for extracting the representation allows to reduce ghosting artifacts. Finally, an adapted compression technique is proposed that limits coding artifacts. The results presented on two real sequences show that the proposed representation provides a good trade-off between rendering quality and data compactness.
Treks into intuitive geometry the world of polygons and polyhedra
Akiyama, Jin
2015-01-01
This book is written in a style that uncovers the mathematical theories buried in our everyday lives such as examples from patterns that appear in nature, art, and traditional crafts, and in mathematical mechanisms in techniques used by architects. The authors believe that through dialogues between students and mathematicians, readers may discover the processes by which the founders of the theories came to their various conclusions―their trials, errors, tribulations, and triumphs. The goal is for readers to refine their mathematical sense of how to find good questions and how to grapple with these problems. Another aim is to provide enjoyment in the process of applying mathematical rules to beautiful art and design by examples that highlight the wonders and mysteries from our daily lives. To fulfill these aims, this book deals with the latest unique and beautiful results in polygons and polyhedra and the dynamism of geometrical research history that can be found around us. The term "intuitive geometry" was ...
Reachability by paths of bounded curvature in a convex polygon
Ahn, Heekap; Cheong, Otfried; Matoušek, Jiřǐ; Vigneron, Antoine E.
2012-01-01
Let B be a point robot moving in the plane, whose path is constrained to forward motions with curvature at most 1, and let P be a convex polygon with n vertices. Given a starting configuration (a location and a direction of travel) for B inside P, we characterize the region of all points of P that can be reached by B, and show that it has complexity O(n). We give an O(n2) time algorithm to compute this region. We show that a point is reachable only if it can be reached by a path of type CCSCS, where C denotes a unit circle arc and S denotes a line segment. © 2011 Elsevier B.V.
Vortex breakdown in closed containers with polygonal cross sections
International Nuclear Information System (INIS)
Naumov, I. V.; Dvoynishnikov, S. V.; Kabardin, I. K.; Tsoy, M. A.
2015-01-01
The vortex breakdown bubble in the confined flow generated by a rotating lid in closed containers with polygonal cross sections was analysed both experimentally and numerically for the height/radius aspect ratio equal to 2. The stagnation point locations of the breakdown bubble emergence and the corresponding Reynolds number were determined experimentally and in addition computed numerically by STAR-CCM+ CFD software for square, pentagonal, hexagonal, and octagonal cross section configurations. The flow pattern and the velocity were observed and measured by combining the seeding particle visualization and the temporal accuracy of laser Doppler anemometry. The vortex breakdown size and position on the container axis were determined for Reynolds numbers, ranging from 1450 to 2400. The obtained results were compared with the flow structure in the closed container of cubical and cylindrical configurations. It is shown that the measured evolution of steady vortex breakdown is in close agreement with the numerical results
Convergence of Wachspress coordinates: from polygons to curved domains
Kosinka, Jiří
2014-08-08
Given a smooth, strictly convex planar domain, we investigate point-wise convergence of the sequence of Wachspress coordinates defined over finer and finer inscribed polygonal approximations of the domain. Based on a relation between the discrete Wachspress case and the limit smooth case given by the Wachspress kernel defined by Warren et al., we show that the corresponding sequences of Wachspress interpolants and mappings converge as 𝓞(h2) for a sampling step size h of the boundary curve of the domain as h → 0. Several examples are shown to numerically validate the results and to visualise the behaviour of discrete interpolants and mappings as they converge to their smooth counterparts. Empirically, the same convergence order is observed also for mean value coordinates. Moreover, our numerical tests suggest that the convergence of interpolants and mappings is uniform both in the Wachspress and mean value cases. © 2014 Springer Science+Business Media New York.
Polygons of differential equations for finding exact solutions
International Nuclear Information System (INIS)
Kudryashov, Nikolai A.; Demina, Maria V.
2007-01-01
A method for finding exact solutions of nonlinear differential equations is presented. Our method is based on the application of polygons corresponding to nonlinear differential equations. It allows one to express exact solutions of the equation studied through solutions of another equation using properties of the basic equation itself. The ideas of power geometry are used and developed. Our approach has a pictorial interpretation, which is illustrative and effective. The method can be also applied for finding transformations between solutions of differential equations. To demonstrate the method application exact solutions of several equations are found. These equations are: the Korteveg-de Vries-Burgers equation, the generalized Kuramoto-Sivashinsky equation, the fourth-order nonlinear evolution equation, the fifth-order Korteveg-de Vries equation, the fifth-order modified Korteveg-de Vries equation and the sixth-order nonlinear evolution equation describing turbulent processes. Some new exact solutions of nonlinear evolution equations are given
Convergence of Wachspress coordinates: from polygons to curved domains
Kosinka, Jiří
2014-01-01
Given a smooth, strictly convex planar domain, we investigate point-wise convergence of the sequence of Wachspress coordinates defined over finer and finer inscribed polygonal approximations of the domain. Based on a relation between the discrete Wachspress case and the limit smooth case given by the Wachspress kernel defined by Warren et al., we show that the corresponding sequences of Wachspress interpolants and mappings converge as 𝓞(h2) for a sampling step size h of the boundary curve of the domain as h → 0. Several examples are shown to numerically validate the results and to visualise the behaviour of discrete interpolants and mappings as they converge to their smooth counterparts. Empirically, the same convergence order is observed also for mean value coordinates. Moreover, our numerical tests suggest that the convergence of interpolants and mappings is uniform both in the Wachspress and mean value cases. © 2014 Springer Science+Business Media New York.
Generalized Swept Mid-structure for Polygonal Models
Martin, Tobias; Chen, Guoning; Musuvathy, Suraj; Cohen, Elaine; Hansen, Charles
2012-01-01
We introduce a novel mid-structure called the generalized swept mid-structure (GSM) of a closed polygonal shape, and a framework to compute it. The GSM contains both curve and surface elements and has consistent sheet-by-sheet topology, versus triangle-by-triangle topology produced by other mid-structure methods. To obtain this structure, a harmonic function, defined on the volume that is enclosed by the surface, is used to decompose the volume into a set of slices. A technique for computing the 1D mid-structures of these slices is introduced. The mid-structures of adjacent slices are then iteratively matched through a boundary similarity computation and triangulated to form the GSM. This structure respects the topology of the input surface model is a hybrid mid-structure representation. The construction and topology of the GSM allows for local and global simplification, used in further applications such as parameterization, volumetric mesh generation and medical applications.
Generalized Swept Mid-structure for Polygonal Models
Martin, Tobias
2012-05-01
We introduce a novel mid-structure called the generalized swept mid-structure (GSM) of a closed polygonal shape, and a framework to compute it. The GSM contains both curve and surface elements and has consistent sheet-by-sheet topology, versus triangle-by-triangle topology produced by other mid-structure methods. To obtain this structure, a harmonic function, defined on the volume that is enclosed by the surface, is used to decompose the volume into a set of slices. A technique for computing the 1D mid-structures of these slices is introduced. The mid-structures of adjacent slices are then iteratively matched through a boundary similarity computation and triangulated to form the GSM. This structure respects the topology of the input surface model is a hybrid mid-structure representation. The construction and topology of the GSM allows for local and global simplification, used in further applications such as parameterization, volumetric mesh generation and medical applications.
An electrophysiological study of the mental rotation of polygons.
Pierret, A; Peronnet, F; Thevenet, M
1994-05-09
Reaction times and event-related potentials (ERPs) were recorded during a task requiring subjects to decide whether two sequentially presented polygons had the same shape regardless of differences in orientation. Reaction times increased approximately linearly with angular departure from upright orientation, which suggests that mental rotation was involved in the comparison process. The ERPs showed, between 665 and 1055 ms, a late posterior negativity also increasing with angular disparity from upright, which we assumed to reflect mental rotation. Two other activities were exhibited, from 265 to 665 ms, which may be related either to an evaluation of the stimulus or a predetermination of its orientation, and from 1055 to 1600 ms attributed to the decision process.
Querying Large Biological Network Datasets
Gulsoy, Gunhan
2013-01-01
New experimental methods has resulted in increasing amount of genetic interaction data to be generated every day. Biological networks are used to store genetic interaction data gathered. Increasing amount of data available requires fast large scale analysis methods. Therefore, we address the problem of querying large biological network datasets.…
Fluxnet Synthesis Dataset Collaboration Infrastructure
Energy Technology Data Exchange (ETDEWEB)
Agarwal, Deborah A. [Lawrence Berkeley National Lab. (LBNL), Berkeley, CA (United States); Humphrey, Marty [Univ. of Virginia, Charlottesville, VA (United States); van Ingen, Catharine [Microsoft. San Francisco, CA (United States); Beekwilder, Norm [Univ. of Virginia, Charlottesville, VA (United States); Goode, Monte [Lawrence Berkeley National Lab. (LBNL), Berkeley, CA (United States); Jackson, Keith [Lawrence Berkeley National Lab. (LBNL), Berkeley, CA (United States); Rodriguez, Matt [Lawrence Berkeley National Lab. (LBNL), Berkeley, CA (United States); Weber, Robin [Univ. of California, Berkeley, CA (United States)
2008-02-06
The Fluxnet synthesis dataset originally compiled for the La Thuile workshop contained approximately 600 site years. Since the workshop, several additional site years have been added and the dataset now contains over 920 site years from over 240 sites. A data refresh update is expected to increase those numbers in the next few months. The ancillary data describing the sites continues to evolve as well. There are on the order of 120 site contacts and 60proposals have been approved to use thedata. These proposals involve around 120 researchers. The size and complexity of the dataset and collaboration has led to a new approach to providing access to the data and collaboration support and the support team attended the workshop and worked closely with the attendees and the Fluxnet project office to define the requirements for the support infrastructure. As a result of this effort, a new website (http://www.fluxdata.org) has been created to provide access to the Fluxnet synthesis dataset. This new web site is based on a scientific data server which enables browsing of the data on-line, data download, and version tracking. We leverage database and data analysis tools such as OLAP data cubes and web reports to enable browser and Excel pivot table access to the data.
A New Dataset Size Reduction Approach for PCA-Based Classification in OCR Application
Directory of Open Access Journals (Sweden)
Mohammad Amin Shayegan
2014-01-01
Full Text Available A major problem of pattern recognition systems is due to the large volume of training datasets including duplicate and similar training samples. In order to overcome this problem, some dataset size reduction and also dimensionality reduction techniques have been introduced. The algorithms presently used for dataset size reduction usually remove samples near to the centers of classes or support vector samples between different classes. However, the samples near to a class center include valuable information about the class characteristics and the support vector is important for evaluating system efficiency. This paper reports on the use of Modified Frequency Diagram technique for dataset size reduction. In this new proposed technique, a training dataset is rearranged and then sieved. The sieved training dataset along with automatic feature extraction/selection operation using Principal Component Analysis is used in an OCR application. The experimental results obtained when using the proposed system on one of the biggest handwritten Farsi/Arabic numeral standard OCR datasets, Hoda, show about 97% accuracy in the recognition rate. The recognition speed increased by 2.28 times, while the accuracy decreased only by 0.7%, when a sieved version of the dataset, which is only as half as the size of the initial training dataset, was used.
Measurement of Charmless B to Vector-Vector decays at BaBar
International Nuclear Information System (INIS)
Olaiya, Emmanuel
2011-01-01
The authors present results of B → vector-vector (VV) and B → vector-axial vector (VA) decays B 0 → φX(X = φ,ρ + or ρ 0 ), B + → φK (*)+ , B 0 → K*K*, B 0 → ρ + b 1 - and B + → K* 0 α 1 + . The largest dataset used for these results is based on 465 x 10 6 Υ(4S) → B(bar B) decays, collected with the BABAR detector at the PEP-II B meson factory located at the Stanford Linear Accelerator Center (SLAC). Using larger datasets, the BABAR experiment has provided more precise B → VV measurements, further supporting the smaller than expected longitudinal polarization fraction of B → φK*. Additional B meson to vector-vector and vector-axial vector decays have also been studied with a view to shedding light on the polarization anomaly. Taking into account the available errors, we find no disagreement between theory and experiment for these additional decays.
Experimental investigation into the mechanism of the polygonal wear of electric locomotive wheels
Tao, Gongquan; Wang, Linfeng; Wen, Zefeng; Guan, Qinghua; Jin, Xuesong
2018-06-01
Experiments were conducted at field sites to investigate the mechanism of the polygonal wear of electric locomotive wheels. The polygonal wear rule of electric locomotive wheels was obtained. Moreover, two on-track tests have been carried out to investigate the vibration characteristics of the electric locomotive's key components. The measurement results of wheels out-of-round show that most electric locomotive wheels exhibit polygonal wear. The main centre wavelength in the 1/3 octave bands is 200 mm and/or 160 mm. The test results of vibration characteristics indicate that the dominating frequency of the vertical acceleration measured on the axle box is approximately equal to the passing frequency of a polygonal wheel, and does not vary with the locomotive speed during the acceleration course. The wheelset modal analysis using the finite element method (FEM) indicates that the first bending resonant frequency of the wheelset is quite close to the main vibration frequency of the axle box. The FEM results are verified by the experimental modal analysis of the wheelset. Moreover, different plans were designed to verify whether the braking system and the locomotive's adhesion control have significant influence on the wheel polygon or not. The test results indicate that they are not responsible for the initiation of the wheel polygon. The first bending resonance of the wheelset is easy to be excited in the locomotive operation and it is the root cause of wheel polygon with centre wavelength of 200 mm in the 1/3 octave bands.
A Polygon Model for Wireless Sensor Network Deployment with Directional Sensing Areas
Wu, Chun-Hsien; Chung, Yeh-Ching
2009-01-01
The modeling of the sensing area of a sensor node is essential for the deployment algorithm of wireless sensor networks (WSNs). In this paper, a polygon model is proposed for the sensor node with directional sensing area. In addition, a WSN deployment algorithm is presented with topology control and scoring mechanisms to maintain network connectivity and improve sensing coverage rate. To evaluate the proposed polygon model and WSN deployment algorithm, a simulation is conducted. The simulation results show that the proposed polygon model outperforms the existed disk model and circular sector model in terms of the maximum sensing coverage rate. PMID:22303159
On reconstruction of an unknown polygonal cavity in a linearized elasticity with one measurement
International Nuclear Information System (INIS)
Ikehata, M; Itou, H
2011-01-01
In this paper we consider a reconstruction problem of an unknown polygonal cavity in a linearized elastic body. For this problem, an extraction formula of the convex hull of the unknown polygonal cavity is established by means of the enclosure method introduced by Ikehata. The advantages of our method are that it needs only a single set of boundary data and we do not require any a priori assumptions for the unknown polygonal cavity and any constraints on boundary data. The theoretical formula may have possibility of application in nondestructive evaluation.
Tribal Land Polygons, Region 9, 2006, US EPA Region 9
U.S. Environmental Protection Agency — Dataset of all Indian Reservations in US EPA Region 9 (California, Arizona and Nevada) with some reservation border areas of adjacent states included (adjacent areas...
VT Geothermal Closed Loop Horizontal or Vertical Systems - polygons
Vermont Center for Geographic Information — (Link to Metadata) The Renewable Energy Atlas of Vermont and this dataset were created to assist town energy committees, the Clean Energy Development Fund and other...
Tribal Boundary Polygons, Region 9, 2007, US EPA Region 9
U.S. Environmental Protection Agency — Dataset of all Indian Reservations in US EPA Region 9 (California, Arizona and Nevada) with some reservation border areas of adjacent states included (adjacent areas...
Feature Vector Construction Method for IRIS Recognition
Odinokikh, G.; Fartukov, A.; Korobkin, M.; Yoo, J.
2017-05-01
One of the basic stages of iris recognition pipeline is iris feature vector construction procedure. The procedure represents the extraction of iris texture information relevant to its subsequent comparison. Thorough investigation of feature vectors obtained from iris showed that not all the vector elements are equally relevant. There are two characteristics which determine the vector element utility: fragility and discriminability. Conventional iris feature extraction methods consider the concept of fragility as the feature vector instability without respect to the nature of such instability appearance. This work separates sources of the instability into natural and encodinginduced which helps deeply investigate each source of instability independently. According to the separation concept, a novel approach of iris feature vector construction is proposed. The approach consists of two steps: iris feature extraction using Gabor filtering with optimal parameters and quantization with separated preliminary optimized fragility thresholds. The proposed method has been tested on two different datasets of iris images captured under changing environmental conditions. The testing results show that the proposed method surpasses all the methods considered as a prior art by recognition accuracy on both datasets.
Coastal Resources Atlas: Long Island: HABITATS (Habitat Polygons)
National Oceanic and Atmospheric Administration, Department of Commerce — This data set contains sensitive biological resource data for sensitive/rare coastal plants and submerged aquatic vegetation (SAV) for Long Island, New York. Vector...
Guam and the Northern Mariana Islands ESI: FISH (Fish Polygons)
National Oceanic and Atmospheric Administration, Department of Commerce — This data set contains sensitive biological resource data for reef, pelagic, benthic, and estuarine fish species in Guam and the Northern Mariana Islands. Vector...
CERC Dataset (Full Hadza Data)
DEFF Research Database (Denmark)
2016-01-01
The dataset includes demographic, behavioral, and religiosity data from eight different populations from around the world. The samples were drawn from: (1) Coastal and (2) Inland Tanna, Vanuatu; (3) Hadzaland, Tanzania; (4) Lovu, Fiji; (5) Pointe aux Piment, Mauritius; (6) Pesqueiro, Brazil; (7......) Kyzyl, Tyva Republic; and (8) Yasawa, Fiji. Related publication: Purzycki, et al. (2016). Moralistic Gods, Supernatural Punishment and the Expansion of Human Sociality. Nature, 530(7590): 327-330....
Viking Seismometer PDS Archive Dataset
Lorenz, R. D.
2016-12-01
The Viking Lander 2 seismometer operated successfully for over 500 Sols on the Martian surface, recording at least one likely candidate Marsquake. The Viking mission, in an era when data handling hardware (both on board and on the ground) was limited in capability, predated modern planetary data archiving, and ad-hoc repositories of the data, and the very low-level record at NSSDC, were neither convenient to process nor well-known. In an effort supported by the NASA Mars Data Analysis Program, we have converted the bulk of the Viking dataset (namely the 49,000 and 270,000 records made in High- and Event- modes at 20 and 1 Hz respectively) into a simple ASCII table format. Additionally, since wind-generated lander motion is a major component of the signal, contemporaneous meteorological data are included in summary records to facilitate correlation. These datasets are being archived at the PDS Geosciences Node. In addition to brief instrument and dataset descriptions, the archive includes code snippets in the freely-available language 'R' to demonstrate plotting and analysis. Further, we present examples of lander-generated noise, associated with the sampler arm, instrument dumps and other mechanical operations.
PHYSICS PERFORMANCE AND DATASET (PPD)
L. Silvestris
2013-01-01
The first part of the Long Shutdown period has been dedicated to the preparation of the samples for the analysis targeting the summer conferences. In particular, the 8 TeV data acquired in 2012, including most of the “parked datasets”, have been reconstructed profiting from improved alignment and calibration conditions for all the sub-detectors. A careful planning of the resources was essential in order to deliver the datasets well in time to the analysts, and to schedule the update of all the conditions and calibrations needed at the analysis level. The newly reprocessed data have undergone detailed scrutiny by the Dataset Certification team allowing to recover some of the data for analysis usage and further improving the certification efficiency, which is now at 91% of the recorded luminosity. With the aim of delivering a consistent dataset for 2011 and 2012, both in terms of conditions and release (53X), the PPD team is now working to set up a data re-reconstruction and a new MC pro...
RECONSTRUCTION OF 3D VECTOR MODELS OF BUILDINGS BY COMBINATION OF ALS, TLS AND VLS DATA
Directory of Open Access Journals (Sweden)
H. Boulaassal
2012-09-01
Full Text Available Airborne Laser Scanning (ALS, Terrestrial Laser Scanning (TLS and Vehicle based Laser Scanning (VLS are widely used as data acquisition methods for 3D building modelling. ALS data is often used to generate, among others, roof models. TLS data has proven its effectiveness in the geometric reconstruction of building façades. Although the operating algorithms used in the processing chain of these two kinds of data are quite similar, their combination should be more investigated. This study explores the possibility of combining ALS and TLS data for simultaneously producing 3D building models from bird point of view and pedestrian point of view. The geometric accuracy of roofs and façades models is different due to the acquisition techniques. In order to take these differences into account, the surfaces composing roofs and façades are extracted with the same algorithm of segmentation. Nevertheless the segmentation algorithm must be adapted to the properties of the different point clouds. It is based on the RANSAC algorithm, but has been applied in a sequential way in order to extract all potential planar clusters from airborne and terrestrial datasets. Surfaces are fitted to planar clusters, allowing edge detection and reconstruction of vector polygons. Models resulting from TLS data are obviously more accurate than those generated from ALS data. Therefore, the geometry of the roofs is corrected and adapted according to the geometry of the corresponding façades. Finally, the effects of the differences between raw ALS and TLS data on the results of the modeling process are analyzed. It is shown that such combination could be used to produce reliable 3D building models.
National Priorities List (NPL) Site Polygons, Region 9, 2012, US EPA Region 9
U.S. Environmental Protection Agency — NPL site POLYGON locations for the US EPA Region 9. NPL (National Priorities List) sites are hazardous waste sites that are eligible for extensive long-term cleanup...
National Priorities List (NPL) Site Polygons, Region 9, 2010, US EPA Region 9
U.S. Environmental Protection Agency — NPL site POLYGON locations for the US EPA Region 9. NPL (National Priorities List) sites are hazardous waste sites that are eligible for extensive long-term cleanup...
AMCO Off-Site Air Monitoring Polygons, Oakland CA, 2017, US EPA Region 9
U.S. Environmental Protection Agency — This feature class was developed to support the AMCO Chemical Superfund Site air monitoring process and depicts a single polygon layer, Off-Site Air Monitors,...
National Priorities List (NPL) Site Polygons, Region 9, 2014, US EPA Region 9
U.S. Environmental Protection Agency — NPL site POLYGON locations for the US EPA Region 9. NPL (National Priorities List) sites are hazardous waste sites that are eligible for extensive long-term cleanup...
National Priorities List (NPL) Site Polygons, Region 9, 2013, US EPA Region 9
U.S. Environmental Protection Agency — NPL site POLYGON locations for the US EPA Region 9. NPL (National Priorities List) sites are hazardous waste sites that are eligible for extensive long-term cleanup...
National Priorities List (NPL) Site Polygons, Region 9, 2015, US EPA Region 9
U.S. Environmental Protection Agency — NPL site POLYGON locations for the US EPA Region 9. NPL (National Priorities List) sites are hazardous waste sites that are eligible for extensive long-term cleanup...
National Priorities List (NPL) Site Polygons, Region 9, 2017, US EPA Region 9
U.S. Environmental Protection Agency — NPL site POLYGON locations for the US EPA Region 9. NPL (National Priorities List) sites are hazardous waste sites that are eligible for extensive long-term cleanup...
Quasi regular polygons and their duals with Coxeter symmetries Dn represented by complex numbers
International Nuclear Information System (INIS)
Koca, M; Koca, N O
2011-01-01
This paper deals with tiling of the plane by quasi regular polygons and their duals. The problem is motivated from the fact that the graphene, infinite number of carbon molecules forming a honeycomb lattice, may have states with two bond lengths and equal bond angles or one bond length and different bond angles. We prove that the Euclidean plane can be tiled with two tiles consisting of quasi regular hexagons with two different lengths (isogonal hexagons) and regular hexagons. The dual lattice is constructed with the isotoxal hexagons (equal edges but two different interior angles) and regular hexagons. We also give similar tilings of the plane with the quasi regular polygons along with the regular polygons possessing the Coxeter symmetries D n , n=2,3,4,5. The group elements as well as the vertices of the polygons are represented by the complex numbers.
The packing of two species of polygons on the square lattice
International Nuclear Information System (INIS)
Dei Cont, David; Nienhuis, Bernard
2004-01-01
We decorate the square lattice with two species of polygons under the constraint that every lattice edge is covered by only one polygon and every vertex is visited by both types of polygons. We end up with a 24-vertex model which is known in the literature as the fully packed double loop model (FPL 2 ). In the particular case in which the fugacities of the polygons are the same, the model admits an exact solution. The solution is obtained using coordinate Bethe ansatz and provides a closed expression for the free energy. In particular, we find the free energy of the four-colouring model and the double Hamiltonian walk and recover the known entropy of the Ice model. When both fugacities are set equal to 2 the model undergoes an infinite-order phase transition
Measuring Historical Coastal Change using GIS and the Change Polygon Approach
Smith, M.J.; Cromley, R.G.
2012-01-01
This study compares two automated approaches, the transect-from-baseline technique and a new change polygon method, for quantifying historical coastal change over time. The study shows that the transect-from-baseline technique is complicated by choice of a proper baseline as well as generating transects that intersect with each other rather than with the nearest shoreline. The change polygon method captures the full spatial difference between the positions of the two shorelines and average coastal change is the defined as the ratio of the net area divided by the shoreline length. Although then change polygon method is sensitive to the definition and measurement of shoreline length, the results are more invariant to parameter changes than the transect-from-baseline method, suggesting that the change polygon technique may be a more robust coastal change method. ?? 2012 Blackwell Publishing Ltd.
Supramolecule-to-supramolecule transformations of coordination-driven self-assembled polygons.
Zhao, Liang; Northrop, Brian H; Stang, Peter J
2008-09-10
Two types of supramolecular transformations, wherein a self-assembled Pt(II)-pyridyl metal-organic polygon is controllably converted into an alternative polygon, have been achieved through the reaction between cobalt carbonyl and the acetylene moiety of a dipyridyl donor ligand. A [6 + 6] hexagon is transformed into two [3 + 3] hexagons, and a triangle-square mixture is converted into [2 + 2] rhomboids. 1H and 31P NMR spectra are used to track the transformation process and evaluate the yield of new self-assembled polygons. Such transformed species are identified by electrospray ionization (ESI) mass spectrometry. This new kind of supramolecule-to-supramolecule transformations provides a viable means for constructing, and then converting, new self-assembled polygons.
Convex lattice polygons of fixed area with perimeter-dependent weights.
Rajesh, R; Dhar, Deepak
2005-01-01
We study fully convex polygons with a given area, and variable perimeter length on square and hexagonal lattices. We attach a weight tm to a convex polygon of perimeter m and show that the sum of weights of all polygons with a fixed area s varies as s(-theta(conv))eK(t)square root(s) for large s and t less than a critical threshold tc, where K(t) is a t-dependent constant, and theta(conv) is a critical exponent which does not change with t. Using heuristic arguments, we find that theta(conv) is 1/4 for the square lattice, but -1/4 for the hexagonal lattice. The reason for this unexpected nonuniversality of theta(conv) is traced to existence of sharp corners in the asymptotic shape of these polygons.
U.S. Environmental Protection Agency — This feature class contains the 64 tax map key polygons across the state of Hawaii that have been inspected by US EPA Pacific Southwest Enforcement Division as of...
RARD: The Related-Article Recommendation Dataset
Beel, Joeran; Carevic, Zeljko; Schaible, Johann; Neusch, Gabor
2017-01-01
Recommender-system datasets are used for recommender-system evaluations, training machine-learning algorithms, and exploring user behavior. While there are many datasets for recommender systems in the domains of movies, books, and music, there are rather few datasets from research-paper recommender systems. In this paper, we introduce RARD, the Related-Article Recommendation Dataset, from the digital library Sowiport and the recommendation-as-a-service provider Mr. DLib. The dataset contains ...
Model of Random Polygon Particles for Concrete and Mesh Automatic Subdivision
Institute of Scientific and Technical Information of China (English)
无
2001-01-01
In order to study the constitutive behavior of concrete in mesoscopic level, a new method is proposed in this paper. This method uses random polygon particles to simulate full grading broken aggregates of concrete. Based on computational geometry, we carry out the automatic generation of the triangle finite element mesh for the model of random polygon particles of concrete. The finite element mesh generated in this paper is also applicable to many other numerical methods.
In-gap corner states in core-shell polygonal quantum rings.
Sitek, Anna; Ţolea, Mugurel; Niţă, Marian; Serra, Llorenç; Gudmundsson, Vidar; Manolescu, Andrei
2017-01-10
We study Coulomb interacting electrons confined in polygonal quantum rings. We focus on the interplay of localization at the polygon corners and Coulomb repulsion. Remarkably, the Coulomb repulsion allows the formation of in-gap states, i.e., corner-localized states of electron pairs or clusters shifted to energies that were forbidden for non-interacting electrons, but below the energies of corner-side-localized states. We specify conditions allowing optical excitation to those states.
In-gap corner states in core-shell polygonal quantum rings
Sitek, Anna; Ţolea, Mugurel; Niţă, Marian; Serra, Llorenç; Gudmundsson, Vidar; Manolescu, Andrei
2017-01-01
We study Coulomb interacting electrons confined in polygonal quantum rings. We focus on the interplay of localization at the polygon corners and Coulomb repulsion. Remarkably, the Coulomb repulsion allows the formation of in-gap states, i.e., corner-localized states of electron pairs or clusters shifted to energies that were forbidden for non-interacting electrons, but below the energies of corner-side-localized states. We specify conditions allowing optical excitation to those states.
On the mean and variance of the writhe of random polygons
International Nuclear Information System (INIS)
Portillo, J; Scharein, R; Arsuaga, J; Vazquez, M; Diao, Y
2011-01-01
We here address two problems concerning the writhe of random polygons. First, we study the behavior of the mean writhe as a function length. Second, we study the variance of the writhe. Suppose that we are dealing with a set of random polygons with the same length and knot type, which could be the model of some circular DNA with the same topological property. In general, a simple way of detecting chirality of this knot type is to compute the mean writhe of the polygons; if the mean writhe is non-zero then the knot is chiral. How accurate is this method? For example, if for a specific knot type K the mean writhe decreased to zero as the length of the polygons increased, then this method would be limited in the case of long polygons. Furthermore, we conjecture that the sign of the mean writhe is a topological invariant of chiral knots. This sign appears to be the same as that of an 'ideal' conformation of the knot. We provide numerical evidence to support these claims, and we propose a new nomenclature of knots based on the sign of their expected writhes. This nomenclature can be of particular interest to applied scientists. The second part of our study focuses on the variance of the writhe, a problem that has not received much attention in the past. In this case, we focused on the equilateral random polygons. We give numerical as well as analytical evidence to show that the variance of the writhe of equilateral random polygons (of length n) behaves as a linear function of the length of the equilateral random polygon.
On the mean and variance of the writhe of random polygons.
Portillo, J; Diao, Y; Scharein, R; Arsuaga, J; Vazquez, M
We here address two problems concerning the writhe of random polygons. First, we study the behavior of the mean writhe as a function length. Second, we study the variance of the writhe. Suppose that we are dealing with a set of random polygons with the same length and knot type, which could be the model of some circular DNA with the same topological property. In general, a simple way of detecting chirality of this knot type is to compute the mean writhe of the polygons; if the mean writhe is non-zero then the knot is chiral. How accurate is this method? For example, if for a specific knot type K the mean writhe decreased to zero as the length of the polygons increased, then this method would be limited in the case of long polygons. Furthermore, we conjecture that the sign of the mean writhe is a topological invariant of chiral knots. This sign appears to be the same as that of an "ideal" conformation of the knot. We provide numerical evidence to support these claims, and we propose a new nomenclature of knots based on the sign of their expected writhes. This nomenclature can be of particular interest to applied scientists. The second part of our study focuses on the variance of the writhe, a problem that has not received much attention in the past. In this case, we focused on the equilateral random polygons. We give numerical as well as analytical evidence to show that the variance of the writhe of equilateral random polygons (of length n ) behaves as a linear function of the length of the equilateral random polygon.
International Nuclear Information System (INIS)
Mori, N.; Kobayashi, K.
1996-01-01
A two-dimensional neutron diffusion equation is solved for regular polygonal regions by the finite Fourier transformation, and geometrical bucklings are calculated for regular 3-10 polygonal regions. In the case of the regular triangular region, it is found that a simple and rigorous analytic solution is obtained for the geometrical buckling and the distribution of the neutron current along the outer boundary. (author)
The linking number and the writhe of uniform random walks and polygons in confined spaces
International Nuclear Information System (INIS)
Panagiotou, E; Lambropoulou, S; Millett, K C
2010-01-01
Random walks and polygons are used to model polymers. In this paper we consider the extension of the writhe, self-linking number and linking number to open chains. We then study the average writhe, self-linking and linking number of random walks and polygons over the space of configurations as a function of their length. We show that the mean squared linking number, the mean squared writhe and the mean squared self-linking number of oriented uniform random walks or polygons of length n, in a convex confined space, are of the form O(n 2 ). Moreover, for a fixed simple closed curve in a convex confined space, we prove that the mean absolute value of the linking number between this curve and a uniform random walk or polygon of n edges is of the form O(√n). Our numerical studies confirm those results. They also indicate that the mean absolute linking number between any two oriented uniform random walks or polygons, of n edges each, is of the form O(n). Equilateral random walks and polygons are used to model polymers in θ-conditions. We use numerical simulations to investigate how the self-linking and linking number of equilateral random walks scale with their length.
A Hybrid Neuro-Fuzzy Model For Integrating Large Earth-Science Datasets
Porwal, A.; Carranza, J.; Hale, M.
2004-12-01
A GIS-based hybrid neuro-fuzzy approach to integration of large earth-science datasets for mineral prospectivity mapping is described. It implements a Takagi-Sugeno type fuzzy inference system in the framework of a four-layered feed-forward adaptive neural network. Each unique combination of the datasets is considered a feature vector whose components are derived by knowledge-based ordinal encoding of the constituent datasets. A subset of feature vectors with a known output target vector (i.e., unique conditions known to be associated with either a mineralized or a barren location) is used for the training of an adaptive neuro-fuzzy inference system. Training involves iterative adjustment of parameters of the adaptive neuro-fuzzy inference system using a hybrid learning procedure for mapping each training vector to its output target vector with minimum sum of squared error. The trained adaptive neuro-fuzzy inference system is used to process all feature vectors. The output for each feature vector is a value that indicates the extent to which a feature vector belongs to the mineralized class or the barren class. These values are used to generate a prospectivity map. The procedure is demonstrated by an application to regional-scale base metal prospectivity mapping in a study area located in the Aravalli metallogenic province (western India). A comparison of the hybrid neuro-fuzzy approach with pure knowledge-driven fuzzy and pure data-driven neural network approaches indicates that the former offers a superior method for integrating large earth-science datasets for predictive spatial mathematical modelling.
This data is for Figures 6 and 7 in the journal article. The data also includes the two EPANET input files used for the analysis described in the paper, one for the looped system and one for the block system.This dataset is associated with the following publication:Grayman, W., R. Murray , and D. Savic. Redesign of Water Distribution Systems for Passive Containment of Contamination. JOURNAL OF THE AMERICAN WATER WORKS ASSOCIATION. American Water Works Association, Denver, CO, USA, 108(7): 381-391, (2016).
Visual feature discrimination versus compression ratio for polygonal shape descriptors
Heuer, Joerg; Sanahuja, Francesc; Kaup, Andre
2000-10-01
In the last decade several methods for low level indexing of visual features appeared. Most often these were evaluated with respect to their discrimination power using measures like precision and recall. Accordingly, the targeted application was indexing of visual data within databases. During the standardization process of MPEG-7 the view on indexing of visual data changed, taking also communication aspects into account where coding efficiency is important. Even if the descriptors used for indexing are small compared to the size of images, it is recognized that there can be several descriptors linked to an image, characterizing different features and regions. Beside the importance of a small memory footprint for the transmission of the descriptor and the memory footprint in a database, eventually the search and filtering can be sped up by reducing the dimensionality of the descriptor if the metric of the matching can be adjusted. Based on a polygon shape descriptor presented for MPEG-7 this paper compares the discrimination power versus memory consumption of the descriptor. Different methods based on quantization are presented and their effect on the retrieval performance are measured. Finally an optimized computation of the descriptor is presented.
Two-loop polygon Wilson loops in N = 4 SYM
International Nuclear Information System (INIS)
Anastasiou, C.; Brandhuber, A.; Heslop, P.; Spence, B.; Travaglini, G.; Khoze, V.V.
2009-01-01
We compute for the first time the two-loop corrections to arbitrary n-gon lightlike Wilson loops in N = 4 supersymmetric Yang-Mills theory, using efficient numerical methods. The calculation is motivated by the remarkable agreement between the finite part of planar six-point MHV amplitudes and hexagon Wilson loops which has been observed at two loops. At n = 6 we confirm that the ABDK/BDS ansatz must be corrected by adding a remainder function, which depends only on conformally invariant ratios of kinematic variables. We numerically compute remainder functions for n = 7,8 and verify dual conformal invariance. Furthermore, we study simple and multiple collinear limits of the Wilson loop remainder functions and demonstrate that they have precisely the form required by the collinear factorisation of the corresponding two-loop n-point amplitudes. The number of distinct diagram topologies contributing to the n-gon Wilson loops does not increase with n, and there is a fixed number of 'master integrals', which we have computed. Thus we have essentially computed general polygon Wilson loops, and if the correspondence with amplitudes continues to hold, all planar n-point two-loop MHV amplitudes in the N = 4 theory.
Conical twist fields and null polygonal Wilson loops
Castro-Alvaredo, Olalla A.; Doyon, Benjamin; Fioravanti, Davide
2018-06-01
Using an extension of the concept of twist field in QFT to space-time (external) symmetries, we study conical twist fields in two-dimensional integrable QFT. These create conical singularities of arbitrary excess angle. We show that, upon appropriate identification between the excess angle and the number of sheets, they have the same conformal dimension as branch-point twist fields commonly used to represent partition functions on Riemann surfaces, and that both fields have closely related form factors. However, we show that conical twist fields are truly different from branch-point twist fields. They generate different operator product expansions (short distance expansions) and form factor expansions (large distance expansions). In fact, we verify in free field theories, by re-summing form factors, that the conical twist fields operator product expansions are correctly reproduced. We propose that conical twist fields are the correct fields in order to understand null polygonal Wilson loops/gluon scattering amplitudes of planar maximally supersymmetric Yang-Mills theory.
The CMS dataset bookkeeping service
Afaq, A.; Dolgert, A.; Guo, Y.; Jones, C.; Kosyakov, S.; Kuznetsov, V.; Lueking, L.; Riley, D.; Sekhri, V.
2008-07-01
The CMS Dataset Bookkeeping Service (DBS) has been developed to catalog all CMS event data from Monte Carlo and Detector sources. It provides the ability to identify MC or trigger source, track data provenance, construct datasets for analysis, and discover interesting data. CMS requires processing and analysis activities at various service levels and the DBS system provides support for localized processing or private analysis, as well as global access for CMS users at large. Catalog entries can be moved among the various service levels with a simple set of migration tools, thus forming a loose federation of databases. DBS is available to CMS users via a Python API, Command Line, and a Discovery web page interfaces. The system is built as a multi-tier web application with Java servlets running under Tomcat, with connections via JDBC to Oracle or MySQL database backends. Clients connect to the service through HTTP or HTTPS with authentication provided by GRID certificates and authorization through VOMS. DBS is an integral part of the overall CMS Data Management and Workflow Management systems.
The CMS dataset bookkeeping service
Energy Technology Data Exchange (ETDEWEB)
Afaq, A; Guo, Y; Kosyakov, S; Lueking, L; Sekhri, V [Fermilab, Batavia, Illinois 60510 (United States); Dolgert, A; Jones, C; Kuznetsov, V; Riley, D [Cornell University, Ithaca, New York 14850 (United States)
2008-07-15
The CMS Dataset Bookkeeping Service (DBS) has been developed to catalog all CMS event data from Monte Carlo and Detector sources. It provides the ability to identify MC or trigger source, track data provenance, construct datasets for analysis, and discover interesting data. CMS requires processing and analysis activities at various service levels and the DBS system provides support for localized processing or private analysis, as well as global access for CMS users at large. Catalog entries can be moved among the various service levels with a simple set of migration tools, thus forming a loose federation of databases. DBS is available to CMS users via a Python API, Command Line, and a Discovery web page interfaces. The system is built as a multi-tier web application with Java servlets running under Tomcat, with connections via JDBC to Oracle or MySQL database backends. Clients connect to the service through HTTP or HTTPS with authentication provided by GRID certificates and authorization through VOMS. DBS is an integral part of the overall CMS Data Management and Workflow Management systems.
The CMS dataset bookkeeping service
International Nuclear Information System (INIS)
Afaq, A; Guo, Y; Kosyakov, S; Lueking, L; Sekhri, V; Dolgert, A; Jones, C; Kuznetsov, V; Riley, D
2008-01-01
The CMS Dataset Bookkeeping Service (DBS) has been developed to catalog all CMS event data from Monte Carlo and Detector sources. It provides the ability to identify MC or trigger source, track data provenance, construct datasets for analysis, and discover interesting data. CMS requires processing and analysis activities at various service levels and the DBS system provides support for localized processing or private analysis, as well as global access for CMS users at large. Catalog entries can be moved among the various service levels with a simple set of migration tools, thus forming a loose federation of databases. DBS is available to CMS users via a Python API, Command Line, and a Discovery web page interfaces. The system is built as a multi-tier web application with Java servlets running under Tomcat, with connections via JDBC to Oracle or MySQL database backends. Clients connect to the service through HTTP or HTTPS with authentication provided by GRID certificates and authorization through VOMS. DBS is an integral part of the overall CMS Data Management and Workflow Management systems
The CMS dataset bookkeeping service
International Nuclear Information System (INIS)
Afaq, Anzar; Dolgert, Andrew; Guo, Yuyi; Jones, Chris; Kosyakov, Sergey; Kuznetsov, Valentin; Lueking, Lee; Riley, Dan; Sekhri, Vijay
2007-01-01
The CMS Dataset Bookkeeping Service (DBS) has been developed to catalog all CMS event data from Monte Carlo and Detector sources. It provides the ability to identify MC or trigger source, track data provenance, construct datasets for analysis, and discover interesting data. CMS requires processing and analysis activities at various service levels and the DBS system provides support for localized processing or private analysis, as well as global access for CMS users at large. Catalog entries can be moved among the various service levels with a simple set of migration tools, thus forming a loose federation of databases. DBS is available to CMS users via a Python API, Command Line, and a Discovery web page interfaces. The system is built as a multi-tier web application with Java servlets running under Tomcat, with connections via JDBC to Oracle or MySQL database backends. Clients connect to the service through HTTP or HTTPS with authentication provided by GRID certificates and authorization through VOMS. DBS is an integral part of the overall CMS Data Management and Workflow Management systems
Raster images vectorization system
Genytė, Jurgita
2006-01-01
The problem of raster images vectorization was analyzed and researched in this work. Existing vectorization systems are quite expensive, the results are inaccurate, and the manual vectorization of a large number of drafts is impossible. That‘s why our goal was to design and develop a new raster images vectorization system using our suggested automatic vectorization algorithm and the way to record results in a new universal vectorial file format. The work consists of these main parts: analysis...
International Nuclear Information System (INIS)
Pavicic, Mladen; Merlet, Jean-Pierre; McKay, Brendan; Megill, Norman D
2005-01-01
We give a constructive and exhaustive definition of Kochen-Specker (KS) vectors in a Hilbert space of any dimension as well as of all the remaining vectors of the space. KS vectors are elements of any set of orthonormal states, i.e., vectors in an n-dimensional Hilbert space, H n , n≥3, to which it is impossible to assign 1s and 0s in such a way that no two mutually orthogonal vectors from the set are both assigned 1 and that not all mutually orthogonal vectors are assigned 0. Our constructive definition of such KS vectors is based on algorithms that generate MMP diagrams corresponding to blocks of orthogonal vectors in R n , on algorithms that single out those diagrams on which algebraic (0)-(1) states cannot be defined, and on algorithms that solve nonlinear equations describing the orthogonalities of the vectors by means of statistically polynomially complex interval analysis and self-teaching programs. The algorithms are limited neither by the number of dimensions nor by the number of vectors. To demonstrate the power of the algorithms, all four-dimensional KS vector systems containing up to 24 vectors were generated and described, all three-dimensional vector systems containing up to 30 vectors were scanned, and several general properties of KS vectors were found
2008 TIGER/Line Nationwide Dataset
California Natural Resource Agency — This dataset contains a nationwide build of the 2008 TIGER/Line datasets from the US Census Bureau downloaded in April 2009. The TIGER/Line Shapefiles are an extract...
International Nuclear Information System (INIS)
Fox, Christopher; Romeijn, H. Edwin; Dempsey, James F.
2006-01-01
We present work on combining three algorithms to improve ray-tracing efficiency in radiation therapy dose computation. The three algorithms include: An improved point-in-polygon algorithm, incremental voxel ray tracing algorithm, and stereographic projection of beamlets for voxel truncation. The point-in-polygon and incremental voxel ray-tracing algorithms have been used in computer graphics and nuclear medicine applications while the stereographic projection algorithm was developed by our group. These algorithms demonstrate significant improvements over the current standard algorithms in peer reviewed literature, i.e., the polygon and voxel ray-tracing algorithms of Siddon for voxel classification (point-in-polygon testing) and dose computation, respectively, and radius testing for voxel truncation. The presented polygon ray-tracing technique was tested on 10 intensity modulated radiation therapy (IMRT) treatment planning cases that required the classification of between 0.58 and 2.0 million voxels on a 2.5 mm isotropic dose grid into 1-4 targets and 5-14 structures represented as extruded polygons (a.k.a. Siddon prisms). Incremental voxel ray tracing and voxel truncation employing virtual stereographic projection was tested on the same IMRT treatment planning cases where voxel dose was required for 230-2400 beamlets using a finite-size pencil-beam algorithm. Between a 100 and 360 fold cpu time improvement over Siddon's method was observed for the polygon ray-tracing algorithm to perform classification of voxels for target and structure membership. Between a 2.6 and 3.1 fold reduction in cpu time over current algorithms was found for the implementation of incremental ray tracing. Additionally, voxel truncation via stereographic projection was observed to be 11-25 times faster than the radial-testing beamlet extent approach and was further improved 1.7-2.0 fold through point-classification using the method of translation over the cross product technique
Friedman, Alinda; Montello, Daniel R; Burte, Heather
2012-09-01
We conducted 3 experiments to examine the category adjustment model (Huttenlocher, Hedges, & Duncan, 1991) in circumstances in which the category boundaries were irregular schematized polygons made from outlines of maps. For the first time, accuracy was tested when only perceptual and/or existing long-term memory information about identical locations was cued. Participants from Alberta, Canada and California received 1 of 3 conditions: dots-only, in which a dot appeared within the polygon, and after a 4-s dynamic mask the empty polygon appeared and the participant indicated where the dot had been; dots-and-names, in which participants were told that the first polygon represented Alberta/California and that each dot was in the correct location for the city whose name appeared outside the polygon; and names-only, in which there was no first polygon, and participants clicked on the city locations from extant memory alone. Location recall in the dots-only and dots-and-names conditions did not differ from each other and had small but significant directional errors that pointed away from the centroids of the polygons. In contrast, the names-only condition had large and significant directional errors that pointed toward the centroids. Experiments 2 and 3 eliminated the distribution of stimuli and overall screen position as causal factors. The data suggest that in the "classic" category adjustment paradigm, it is difficult to determine a priori when Bayesian cue combination is applicable, making Bayesian analysis less useful as a theoretical approach to location estimation. PsycINFO Database Record (c) 2012 APA, all rights reserved.
High-order polygonal discontinuous Petrov-Galerkin (PolyDPG) methods using ultraweak formulations
Vaziri Astaneh, Ali; Fuentes, Federico; Mora, Jaime; Demkowicz, Leszek
2018-04-01
This work represents the first endeavor in using ultraweak formulations to implement high-order polygonal finite element methods via the discontinuous Petrov-Galerkin (DPG) methodology. Ultraweak variational formulations are nonstandard in that all the weight of the derivatives lies in the test space, while most of the trial space can be chosen as copies of $L^2$-discretizations that have no need to be continuous across adjacent elements. Additionally, the test spaces are broken along the mesh interfaces. This allows one to construct conforming polygonal finite element methods, termed here as PolyDPG methods, by defining most spaces by restriction of a bounding triangle or box to the polygonal element. The only variables that require nontrivial compatibility across elements are the so-called interface or skeleton variables, which can be defined directly on the element boundaries. Unlike other high-order polygonal methods, PolyDPG methods do not require ad hoc stabilization terms thanks to the crafted stability of the DPG methodology. A proof of convergence of the form $h^p$ is provided and corroborated through several illustrative numerical examples. These include polygonal meshes with $n$-sided convex elements and with highly distorted concave elements, as well as the modeling of discontinuous material properties along an arbitrary interface that cuts a uniform grid. Since PolyDPG methods have a natural a posteriori error estimator a polygonal adaptive strategy is developed and compared to standard adaptivity schemes based on constrained hanging nodes. This work is also accompanied by an open-source $\\texttt{PolyDPG}$ software supporting polygonal and conventional elements.
Satellite-Based Precipitation Datasets
Munchak, S. J.; Huffman, G. J.
2017-12-01
Of the possible sources of precipitation data, those based on satellites provide the greatest spatial coverage. There is a wide selection of datasets, algorithms, and versions from which to choose, which can be confusing to non-specialists wishing to use the data. The International Precipitation Working Group (IPWG) maintains tables of the major publicly available, long-term, quasi-global precipitation data sets (http://www.isac.cnr.it/ ipwg/data/datasets.html), and this talk briefly reviews the various categories. As examples, NASA provides two sets of quasi-global precipitation data sets: the older Tropical Rainfall Measuring Mission (TRMM) Multi-satellite Precipitation Analysis (TMPA) and current Integrated Multi-satellitE Retrievals for Global Precipitation Measurement (GPM) mission (IMERG). Both provide near-real-time and post-real-time products that are uniformly gridded in space and time. The TMPA products are 3-hourly 0.25°x0.25° on the latitude band 50°N-S for about 16 years, while the IMERG products are half-hourly 0.1°x0.1° on 60°N-S for over 3 years (with plans to go to 16+ years in Spring 2018). In addition to the precipitation estimates, each data set provides fields of other variables, such as the satellite sensor providing estimates and estimated random error. The discussion concludes with advice about determining suitability for use, the necessity of being clear about product names and versions, and the need for continued support for satellite- and surface-based observation.
Louisiana Geographic Information Center — This data set contains polygons representing the Environmental Sensitivity Index (ESI) classification of coastal Louisiana. The ESI is a classification and ranking...
Heil, Martin; Jansen-Osmann, Petra
2008-05-01
Sex differences in mental rotation were investigated as a function of stimulus complexity with a sample size of N = 72. Replicating earlier findings with polygons, mental rotation was faster for males than for females, and reaction time increased with more complex polygons. Additionally, sex differences increased for complex polygons. Most importantly, however, mental rotation speed decreased with increasing complexity for women but did not change for men. Thus, the sex effects reflect a difference in strategy, with women mentally rotating the polygons in an analytic, piecemeal fashion and men using a holistic mode of mental rotation.
Directory of Open Access Journals (Sweden)
Mok Tik
2014-06-01
Full Text Available This study formulates regression of vector data that will enable statistical analysis of various geodetic phenomena such as, polar motion, ocean currents, typhoon/hurricane tracking, crustal deformations, and precursory earthquake signals. The observed vector variable of an event (dependent vector variable is expressed as a function of a number of hypothesized phenomena realized also as vector variables (independent vector variables and/or scalar variables that are likely to impact the dependent vector variable. The proposed representation has the unique property of solving the coefficients of independent vector variables (explanatory variables also as vectors, hence it supersedes multivariate multiple regression models, in which the unknown coefficients are scalar quantities. For the solution, complex numbers are used to rep- resent vector information, and the method of least squares is deployed to estimate the vector model parameters after transforming the complex vector regression model into a real vector regression model through isomorphism. Various operational statistics for testing the predictive significance of the estimated vector parameter coefficients are also derived. A simple numerical example demonstrates the use of the proposed vector regression analysis in modeling typhoon paths.
Structural control of polygonal cracks in La Pedriza del Manzanares (Madrid)
International Nuclear Information System (INIS)
Garcia-Rodriguez, M.; Aroztegui, J.; Lopez Portillo, H.
2015-01-01
Polygonal cracks represent a common way of modeling granite whose origin and evolution continues under study not even existing a systematization of these diverse structures. Some authors explain their origin by internal geo dynamic processes relating to movements of fracture planes in later stages of magmatic consolidation. Other authors attribute their formation and development to external factors related to climate regime. The great variety of polygonal cracks requires the use of a greater number of variables to define their different origins, the possible interrelations between external and internal factors, to explain the evolution of these structures and advance the classification of specific patterns. This work aims to contribute to systematize the mechanisms involved in the development of polygonal cracks. For that only polygonal cracks formed on flat vertical or sub vertical fractures are studied. In particular relations are established between the presence of polygonal cracks with: the fracturing network, height of appearance, angle and tilt of the wall, plaque morphology and depth of incision of the perimeter cracks. Moreover it establishes relationships between internal geo dynamic processes and external weathering processes. (Author)
Global regularizing flows with topology preservation for active contours and polygons.
Sundaramoorthi, Ganesh; Yezzi, Anthony
2007-03-01
Active contour and active polygon models have been used widely for image segmentation. In some applications, the topology of the object(s) to be detected from an image is known a priori, despite a complex unknown geometry, and it is important that the active contour or polygon maintain the desired topology. In this work, we construct a novel geometric flow that can be added to image-based evolutions of active contours and polygons in order to preserve the topology of the initial contour or polygon. We emphasize that, unlike other methods for topology preservation, the proposed geometric flow continually adjusts the geometry of the original evolution in a gradual and graceful manner so as to prevent a topology change long before the curve or polygon becomes close to topology change. The flow also serves as a global regularity term for the evolving contour, and has smoothness properties similar to curvature flow. These properties of gradually adjusting the original flow and global regularization prevent geometrical inaccuracies common with simple discrete topology preservation schemes. The proposed topology preserving geometric flow is the gradient flow arising from an energy that is based on electrostatic principles. The evolution of a single point on the contour depends on all other points of the contour, which is different from traditional curve evolutions in the computer vision literature.
Effects of Rashba spin–orbit coupling and a magnetic field on a polygonal quantum ring
International Nuclear Information System (INIS)
Tang, Han-Zhao; Zhai, Li-Xue; Shen, Man; Liu, Jian-Jun
2014-01-01
Using standard quantum network method, we analytically investigate the effect of Rashba spin–orbit coupling (RSOC) and a magnetic field on the spin transport properties of a polygonal quantum ring. Using Landauer–Büttiker formula, we have found that the polarization direction and phase of transmitted electrons can be controlled by both the magnetic field and RSOC. A device to generate a spin-polarized conductance in a polygon with an arbitrary number of sides is discussed. This device would permit precise control of spin and selectively provide spin filtering for either spin up or spin down simply by interchanging the source and drain. - Highlights: • Spin conductance of polygon with RSOC and magnetic field is calculated analytically. • We show how the RSOC and a magnetic field control the phase of electron in polygon. • The AB oscillation and shape-dependent conductance are studied in a polygonal ring. • Our model can provide spin filtering simply by interchanging the source and drain
International Nuclear Information System (INIS)
Speetjens, M F M; Meleshko, V V; Van Heijst, G J F
2014-01-01
The present study addresses the classical problem of the dynamics and stability of a cluster of N-point vortices of equal strength arranged in a polygonal configuration (‘N-vortex polygons’). In unbounded domains, such N-vortex polygons are unconditionally stable for N⩽7. Confinement in a circular domain tightens the stability conditions to N⩽6 and a maximum polygon size relative to the domain radius. This work expands on existing studies on stability and integrability by a first giving an exploratory spectral analysis of the dynamics of N vortex polygons in circular domains. Key to this is that the spectral signature of the time evolution of vortex positions reflects their qualitative behaviour. Expressing vortex motion by a generic evolution operator (the so-called Koopman operator) provides a rigorous framework for such spectral analyses. This paves the way to further differentiation and classification of point-vortex behaviour beyond stability and integrability. The concept of Koopman-based spectral analysis is demonstrated for N-vortex polygons. This reveals that conditional stability can be seen as a local form of integrability and confirms an important generic link between spectrum and dynamics: discrete spectra imply regular (quasi-periodic) motion; continuous (sub-)spectra imply chaotic motion. Moreover, this exposes rich nonlinear dynamics as intermittency between regular and chaotic motion and quasi-coherent structures formed by chaotic vortices. (ss 1)
Direct Monte Carlo dose calculation using polygon-surface computational human model
International Nuclear Information System (INIS)
Jeong, Jong Hwi; Kim, Chan Hyeong; Yeom, Yeon Su; Cho, Sungkoo; Chung, Min Suk; Cho, Kun-Woo
2011-01-01
In the present study, a voxel-type computational human model was converted to a polygon-surface model, after which it was imported directly to the Geant4 code without using a voxelization process, that is, without converting back to a voxel model. The original voxel model was also imported to the Geant4 code, in order to compare the calculated dose values and the computational speed. The average polygon size of the polygon-surface model was ∼0.5 cm 2 , whereas the voxel resolution of the voxel model was 1.981 × 1.981 × 2.0854 mm 3 . The results showed a good agreement between the calculated dose values of the two models. The polygon-surface model was, however, slower than the voxel model by a factor of 6–9 for the photon energies and irradiation geometries considered in the present study, which nonetheless is considered acceptable, considering that direct use of the polygon-surface model does not require a separate voxelization process. (author)
Chirico, P.G.; Moran, T.W.
2011-01-01
This dataset contains a collection of 24 folders, each representing a specific U.S. Geological Survey area of interest (AOI; fig. 1), as well as datasets for AOI subsets. Each folder includes the extent, contours, Digital Elevation Model (DEM), and hydrography of the corresponding AOI, which are organized into feature vector and raster datasets. The dataset comprises a geographic information system (GIS), which is available upon request from the USGS Afghanistan programs Web site (http://afghanistan.cr.usgs.gov/minerals.php), and the maps of the 24 areas of interest of the USGS AOIs.
U.S. Department of Health & Human Services — VectorBase is a Bioinformatics Resource Center for invertebrate vectors. It is one of four Bioinformatics Resource Centers funded by NIAID to provide web-based...
PHYSICS PERFORMANCE AND DATASET (PPD)
L. Silvestris
2012-01-01
Introduction The first part of the year presented an important test for the new Physics Performance and Dataset (PPD) group (cf. its mandate: http://cern.ch/go/8f77). The activity was focused on the validation of the new releases meant for the Monte Carlo (MC) production and the data-processing in 2012 (CMSSW 50X and 52X), and on the preparation of the 2012 operations. In view of the Chamonix meeting, the PPD and physics groups worked to understand the impact of the higher pile-up scenario on some of the flagship Higgs analyses to better quantify the impact of the high luminosity on the CMS physics potential. A task force is working on the optimisation of the reconstruction algorithms and on the code to cope with the performance requirements imposed by the higher event occupancy as foreseen for 2012. Concerning the preparation for the analysis of the new data, a new MC production has been prepared. The new samples, simulated at 8 TeV, are already being produced and the digitisation and recons...
Pattern Analysis On Banking Dataset
Directory of Open Access Journals (Sweden)
Amritpal Singh
2015-06-01
Full Text Available Abstract Everyday refinement and development of technology has led to an increase in the competition between the Tech companies and their going out of way to crack the system andbreak down. Thus providing Data mining a strategically and security-wise important area for many business organizations including banking sector. It allows the analyzes of important information in the data warehouse and assists the banks to look for obscure patterns in a group and discover unknown relationship in the data.Banking systems needs to process ample amount of data on daily basis related to customer information their credit card details limit and collateral details transaction details risk profiles Anti Money Laundering related information trade finance data. Thousands of decisionsbased on the related data are taken in a bank daily. This paper analyzes the banking dataset in the weka environment for the detection of interesting patterns based on its applications ofcustomer acquisition customer retention management and marketing and management of risk fraudulence detections.
PHYSICS PERFORMANCE AND DATASET (PPD)
L. Silvestris
2013-01-01
The PPD activities, in the first part of 2013, have been focused mostly on the final physics validation and preparation for the data reprocessing of the full 8 TeV datasets with the latest calibrations. These samples will be the basis for the preliminary results for summer 2013 but most importantly for the final publications on the 8 TeV Run 1 data. The reprocessing involves also the reconstruction of a significant fraction of “parked data” that will allow CMS to perform a whole new set of precision analyses and searches. In this way the CMSSW release 53X is becoming the legacy release for the 8 TeV Run 1 data. The regular operation activities have included taking care of the prolonged proton-proton data taking and the run with proton-lead collisions that ended in February. The DQM and Data Certification team has deployed a continuous effort to promptly certify the quality of the data. The luminosity-weighted certification efficiency (requiring all sub-detectors to be certified as usab...
Generalization of concurrence vectors
International Nuclear Information System (INIS)
Yu Changshui; Song Heshan
2004-01-01
In this Letter, based on the generalization of concurrence vectors for bipartite pure state with respect to employing tensor product of generators of the corresponding rotation groups, we generalize concurrence vectors to the case of mixed states; a new criterion of separability of multipartite pure states is given out, for which we define a concurrence vector; we generalize the vector to the case of multipartite mixed state and give out a good measure of free entanglement
Ebrahimi, Javad; Fragouli, Christina
2010-01-01
We develop new algebraic algorithms for scalar and vector network coding. In vector network coding, the source multicasts information by transmitting vectors of length L, while intermediate nodes process and combine their incoming packets by multiplying them with L X L coding matrices that play a similar role as coding coefficients in scalar coding. Our algorithms for scalar network jointly optimize the employed field size while selecting the coding coefficients. Similarly, for vector co...
Vector Network Coding Algorithms
Ebrahimi, Javad; Fragouli, Christina
2010-01-01
We develop new algebraic algorithms for scalar and vector network coding. In vector network coding, the source multicasts information by transmitting vectors of length L, while intermediate nodes process and combine their incoming packets by multiplying them with L x L coding matrices that play a similar role as coding c in scalar coding. Our algorithms for scalar network jointly optimize the employed field size while selecting the coding coefficients. Similarly, for vector coding, our algori...
Null polygonal Wilson loops and minimal surfaces in Anti-de-Sitter space
International Nuclear Information System (INIS)
Alday, Luis F.; Maldacena, Juan
2009-01-01
We consider minimal surfaces in three dimensional anti-de-Sitter space that end at the AdS boundary on a polygon given by a sequence of null segments. The problem can be reduced to a certain generalized Sinh-Gordon equation and to SU(2) Hitchin equations. We describe in detail the mathematical problem that needs to be solved. This problem is mathematically the same as the one studied by Gaiotto, Moore and Neitzke in the context of the moduli space of certain supersymmetric theories. Using their results we can find the explicit answer for the area of a surface that ends on an eight-sided polygon. Via the gauge/gravity duality this can also be interpreted as a certain eight-gluon scattering amplitude at strong coupling. In addition, we give fairly explicit solutions for regular polygons.
On the areas of various bodies in the Euclidean space: The case of irregular convex polygons
International Nuclear Information System (INIS)
Ozoemena, P.C.
1988-11-01
A theorem is proposed for the areas of n-sided irregular convex polygons, of given length of sides. The theorem is illustrated as a simple but powerful one in estimating the areas of irregular polygons, being dependent only on the number of sides n (and not on any of the explicit angles) of the irregular polygon. Finally, because of the global symmetry shown by equilateral triangles, squares and circles under group (gauge) theory, the relationships governing their areas, when they are inscribed or escribed in one another are discussed as riders, and some areas of their applications in graph theory, ratios and maxima and minima problems of differential calculus briefly mentioned. (author). 11 refs, 6 figs, 1 tab
Generation of oculomotor images during tasks requiring visual recognition of polygons.
Olivier, G; de Mendoza, J L
2001-06-01
This paper concerns the contribution of mentally simulated ocular exploration to generation of a visual mental image. In Exp. 1, repeated exploration of the outlines of an irregular decagon allowed an incidental learning of the shape. Analyses showed subjects memorized their ocular movements rather than the polygon. In Exp. 2, exploration of a reversible figure such as a Necker cube varied in opposite directions. Then, both perspective possibilities are presented. The perspective the subjects recognized depended on the way they explored the ambiguous figure. In both experiments, during recognition the subjects recalled a visual mental image of the polygon they compared with the different polygons proposed for recognition. To interpret the data, hypotheses concerning common processes underlying both motor intention of ocular movements and generation of a visual image are suggested.
Convexity and Marginal Vectors
van Velzen, S.; Hamers, H.J.M.; Norde, H.W.
2002-01-01
In this paper we construct sets of marginal vectors of a TU game with the property that if the marginal vectors from these sets are core elements, then the game is convex.This approach leads to new upperbounds on the number of marginal vectors needed to characterize convexity.An other result is that
DEFF Research Database (Denmark)
Becciolini, Diego; Franzosi, Diogo Buarque; Foadi, Roshan
2015-01-01
We analyze the Large Hadron Collider (LHC) phenomenology of heavy vector resonances with a $SU(2)_L\\times SU(2)_R$ spectral global symmetry. This symmetry partially protects the electroweak S-parameter from large contributions of the vector resonances. The resulting custodial vector model spectrum...
Directory of Open Access Journals (Sweden)
Luís F Seoane
2015-04-01
Full Text Available We provide a proof of concept for an EEG-based reconstruction of a visual image which is on a user's mind. Our approach is based on the Rapid Serial Visual Presentation (RSVP of polygon primitives and Brain-Computer Interface (BCI technology. In an experimental setup, subjects were presented bursts of polygons: some of them contributed to building a target image (because they matched the shape and/or color of the target while some of them did not. The presentation of the contributing polygons triggered attention-related EEG patterns. These Event Related Potentials (ERPs could be determined using BCI classification and could be matched to the stimuli that elicited them. These stimuli (i.e. the ERP-correlated polygons were accumulated in the display until a satisfactory reconstruction of the target image was reached. As more polygons were accumulated, finer visual details were attained resulting in more challenging classification tasks. In our experiments, we observe an average classification accuracy of around 75%. An in-depth investigation suggests that many of the misclassifications were not misinterpretations of the BCI concerning the users' intent, but rather caused by ambiguous polygons that could contribute to reconstruct several different images. When we put our BCI-image reconstruction in perspective with other RSVP BCI paradigms, there is large room for improvement both in speed and accuracy. These results invite us to be optimistic. They open a plethora of possibilities to explore non-invasive BCIs for image reconstruction both in healthy and impaired subjects and, accordingly, suggest interesting recreational and clinical applications.
The polygonal model: A simple representation of biomolecules as a tool for teaching metabolism.
Bonafe, Carlos Francisco Sampaio; Bispo, Jose Ailton Conceição; de Jesus, Marcelo Bispo
2018-01-01
Metabolism involves numerous reactions and organic compounds that the student must master to understand adequately the processes involved. Part of biochemical learning should include some knowledge of the structure of biomolecules, although the acquisition of such knowledge can be time-consuming and may require significant effort from the student. In this report, we describe the "polygonal model" as a new means of graphically representing biomolecules. This model is based on the use of geometric figures such as open triangles, squares, and circles to represent hydroxyl, carbonyl, and carboxyl groups, respectively. The usefulness of the polygonal model was assessed by undergraduate students in a classroom activity that consisted of "transforming" molecules from Fischer models to polygonal models and vice and versa. The survey was applied to 135 undergraduate Biology and Nursing students. Students found the model easy to use and we noted that it allowed identification of students' misconceptions in basic concepts of organic chemistry, such as in stereochemistry and organic groups that could then be corrected. The students considered the polygonal model easier and faster for representing molecules than Fischer representations, without loss of information. These findings indicate that the polygonal model can facilitate the teaching of metabolism when the structures of biomolecules are discussed. Overall, the polygonal model promoted contact with chemical structures, e.g. through drawing activities, and encouraged student-student dialog, thereby facilitating biochemical learning. © 2017 by The International Union of Biochemistry and Molecular Biology, 46(1):66-75, 2018. © 2017 The International Union of Biochemistry and Molecular Biology.
International Nuclear Information System (INIS)
Nguyen, Tat Thang; Yeom, Yeon Soo; Han, Min Cheol; Kim, Chan Hyeong
2013-01-01
Even though International Commission on Radiological Protection (ICRP) officially adopted a set of adult male and female voxel phantoms as the ICRP reference phantoms, there are several critical limitations due to the nature of voxel geometry and their low voxel resolutions. In order to overcome these limitations of the ICRP phantoms, we are currently developing polygonal surface version of ICRP reference phantoms by directly converting the ICRP voxel phantoms to polygonal surface geometries. Among the many advantages of the ICRP polygonal surface phantom, especially, it is flexible and deformable. In principle, it is, therefore, possible to make the posture-changed ICRP phantoms which can provide more accurate dose values for exposure situations strongly relevant to worker's postures. As a preliminary study for developing the posture-changed ICRP phantoms, in this work we changed the posture of the preliminary version of ICRP male polygon-surface phantom constructed in the previous study. Organ doses were then compared between original and posture-changed phantoms. In the present study, we successfully changed a posture of the preliminary version of ICRP male polygon-surface phantom to the walking posture. From this results, it was explicitly shown that the polygon-surface version of the ICRP phantoms can be sufficiently modified to be various postures with the posture-changing method used in this study. In addition, it was demonstrated that phantom's posture must be considered in certain exposure situations, which can differ dose values from the conventional standing-posture phantom
International Nuclear Information System (INIS)
Lv, Jun; Tang, Liang; Li, Wenbo; Liu, Lei; Zhang, Hongwu
2016-01-01
This paper mainly focuses on the fast and efficient design method for plant bioinspired fluidic cellular materials and structures composed of polygonal motor cells. Here we developed a novel structural optimization method with arbitrary polygonal coarse-grid elements based on multiscale finite element frameworks. The fluidic cellular structures are meshed with irregular polygonal coarse-grid elements according to their natural size and the shape of the imbedded motor cells. The multiscale base functions of solid displacement and hydraulic pressure are then constructed to bring the small-scale information of the irregular motor cells to the large-scale simulations on the polygonal coarse-grid elements. On this basis, a new topology optimization method based on the resulting polygonal coarse-grid elements is proposed to determine the optimal distributions or number of motor cells in the smart cellular structures. Three types of optimization problems are solved according to the usages of the fluidic cellular structures. Firstly, the proposed optimization method is utilized to minimize the system compliance of the load-bearing fluidic cellular structures. Second, the method is further extended to design biomimetic compliant actuators of the fluidic cellular materials due to the fact that non-uniform volume expansions of fluid in the cells can induce elastic action. Third, the optimization problem focuses on the weight minimization of the cellular structure under the constraints for the compliance of the whole system. Several representative examples are investigated to validate the effectiveness of the proposed polygon-based topology optimization method of the smart materials. (paper)
Erbas, Ayhan Kursat; Yenmez, Arzu Aydogan
2011-01-01
The purpose of this study was to investigate the effects of using a dynamic geometry environment (DGE) together with inquiry-based explorations on the sixth grade students' achievements in polygons and congruency and similarity of polygons. Two groups of sixth grade students were selected for this study: an experimental group composed of 66…
Rancan, Marzio; Tessarolo, Jacopo; Zanonato, Pier Luigi; Seraglia, Roberta; Quici, Silvio; Armelao, Lidia
2013-06-07
A small coordination constitutional dynamic library (CDL) is self-assembled from Cu(2+) ions and the ortho bis-(3-acetylacetone)benzene ligand. Two coordination polygons, a rhomboid and a triangle, establish a dynamic equilibrium. Quantitative sorting of the rhomboidal polygon is reversibly obtained by crystallization. Thermodynamic and kinetic aspects ruling the CDL system have been elucidated.
Polygonal approximation and scale-space analysis of closed digital curves
Ray, Kumar S
2013-01-01
This book covers the most important topics in the area of pattern recognition, object recognition, computer vision, robot vision, medical computing, computational geometry, and bioinformatics systems. Students and researchers will find a comprehensive treatment of polygonal approximation and its real life applications. The book not only explains the theoretical aspects but also presents applications with detailed design parameters. The systematic development of the concept of polygonal approximation of digital curves and its scale-space analysis are useful and attractive to scholars in many fi
International Nuclear Information System (INIS)
Larikov, L.N.; Belyakova, M.N.; Maksimenko, E.A.; Mudruk, P.V.
1984-01-01
The effect of shear bands on polygonization and recrystallization is studied on molybdenum monocrystals deformed by compression. A sharp bend of the lattice is shown to be a structural condition necessary for arising the shear step. Internal stress relaxation strongly changes kinetics of softening processes in compressed molybdenum crystals: it slows down polygonization under low-temperature heating (below 700 deg C) and accelerates it under high-temperature heating (higher 1000 deg C). Under the effect of relaxation of internal streses recrystallization in the investigated crystals is similar to dynamical: recrystallized grains are distorted and they have a developed substructure
BFACF-style algorithms for polygons in the body-centered and face-centered cubic lattices
Energy Technology Data Exchange (ETDEWEB)
Janse van Rensburg, E J [Department of Mathematics and Statistics, York University, Toronto, Ontario M3J 1P3 (Canada); Rechnitzer, A, E-mail: rensburg@yorku.ca, E-mail: andrewr@math.ubc.ca [Department of Mathematics, The University of British Columbia, Vancouver V6T 1Z2, British Columbia (Canada)
2011-04-22
In this paper, the elementary moves of the BFACF-algorithm (Aragao de Carvalho and Caracciolo 1983 Phys. Rev. B 27 1635-45, Aragao de Carvalho and Caracciolo 1983 Nucl. Phys. B 215 209-48, Berg and Foester 1981 Phys. Lett. B 106 323-6) for lattice polygons are generalized to elementary moves of BFACF-style algorithms for lattice polygons in the body-centered (BCC) and face-centered (FCC) cubic lattices. We prove that the ergodicity classes of these new elementary moves coincide with the knot types of unrooted polygons in the BCC and FCC lattices and so expand a similar result for the cubic lattice (see Janse van Rensburg and Whittington (1991 J. Phys. A: Math. Gen. 24 5553-67)). Implementations of these algorithms for knotted polygons using the GAS algorithm produce estimates of the minimal length of knotted polygons in the BCC and FCC lattices.
BFACF-style algorithms for polygons in the body-centered and face-centered cubic lattices
Janse van Rensburg, E. J.; Rechnitzer, A.
2011-04-01
In this paper, the elementary moves of the BFACF-algorithm (Aragão de Carvalho and Caracciolo 1983 Phys. Rev. B 27 1635-45, Aragão de Carvalho and Caracciolo 1983 Nucl. Phys. B 215 209-48, Berg and Foester 1981 Phys. Lett. B 106 323-6) for lattice polygons are generalized to elementary moves of BFACF-style algorithms for lattice polygons in the body-centered (BCC) and face-centered (FCC) cubic lattices. We prove that the ergodicity classes of these new elementary moves coincide with the knot types of unrooted polygons in the BCC and FCC lattices and so expand a similar result for the cubic lattice (see Janse van Rensburg and Whittington (1991 J. Phys. A: Math. Gen. 24 5553-67)). Implementations of these algorithms for knotted polygons using the GAS algorithm produce estimates of the minimal length of knotted polygons in the BCC and FCC lattices.
BFACF-style algorithms for polygons in the body-centered and face-centered cubic lattices
International Nuclear Information System (INIS)
Janse van Rensburg, E J; Rechnitzer, A
2011-01-01
In this paper, the elementary moves of the BFACF-algorithm (Aragao de Carvalho and Caracciolo 1983 Phys. Rev. B 27 1635-45, Aragao de Carvalho and Caracciolo 1983 Nucl. Phys. B 215 209-48, Berg and Foester 1981 Phys. Lett. B 106 323-6) for lattice polygons are generalized to elementary moves of BFACF-style algorithms for lattice polygons in the body-centered (BCC) and face-centered (FCC) cubic lattices. We prove that the ergodicity classes of these new elementary moves coincide with the knot types of unrooted polygons in the BCC and FCC lattices and so expand a similar result for the cubic lattice (see Janse van Rensburg and Whittington (1991 J. Phys. A: Math. Gen. 24 5553-67)). Implementations of these algorithms for knotted polygons using the GAS algorithm produce estimates of the minimal length of knotted polygons in the BCC and FCC lattices.
Rotations with Rodrigues' vector
International Nuclear Information System (INIS)
Pina, E
2011-01-01
The rotational dynamics was studied from the point of view of Rodrigues' vector. This vector is defined here by its connection with other forms of parametrization of the rotation matrix. The rotation matrix was expressed in terms of this vector. The angular velocity was computed using the components of Rodrigues' vector as coordinates. It appears to be a fundamental matrix that is used to express the components of the angular velocity, the rotation matrix and the angular momentum vector. The Hamiltonian formalism of rotational dynamics in terms of this vector uses the same matrix. The quantization of the rotational dynamics is performed with simple rules if one uses Rodrigues' vector and similar formal expressions for the quantum operators that mimic the Hamiltonian classical dynamics.
The Geometry of Finite Equilibrium Datasets
DEFF Research Database (Denmark)
Balasko, Yves; Tvede, Mich
We investigate the geometry of finite datasets defined by equilibrium prices, income distributions, and total resources. We show that the equilibrium condition imposes no restrictions if total resources are collinear, a property that is robust to small perturbations. We also show that the set...... of equilibrium datasets is pathconnected when the equilibrium condition does impose restrictions on datasets, as for example when total resources are widely non collinear....
IPCC Socio-Economic Baseline Dataset
National Aeronautics and Space Administration — The Intergovernmental Panel on Climate Change (IPCC) Socio-Economic Baseline Dataset consists of population, human development, economic, water resources, land...
Veterans Affairs Suicide Prevention Synthetic Dataset
Department of Veterans Affairs — The VA's Veteran Health Administration, in support of the Open Data Initiative, is providing the Veterans Affairs Suicide Prevention Synthetic Dataset (VASPSD). The...
Nanoparticle-organic pollutant interaction dataset
U.S. Environmental Protection Agency — Dataset presents concentrations of organic pollutants, such as polyaromatic hydrocarbon compounds, in water samples. Water samples of known volume and concentration...
An Annotated Dataset of 14 Meat Images
DEFF Research Database (Denmark)
Stegmann, Mikkel Bille
2002-01-01
This note describes a dataset consisting of 14 annotated images of meat. Points of correspondence are placed on each image. As such, the dataset can be readily used for building statistical models of shape. Further, format specifications and terms of use are given.......This note describes a dataset consisting of 14 annotated images of meat. Points of correspondence are placed on each image. As such, the dataset can be readily used for building statistical models of shape. Further, format specifications and terms of use are given....
Effective Clipart Image Vectorization through Direct Optimization of Bezigons.
Yang, Ming; Chao, Hongyang; Zhang, Chi; Guo, Jun; Yuan, Lu; Sun, Jian
2016-02-01
Bezigons, i.e., closed paths composed of Bézier curves, have been widely employed to describe shapes in image vectorization results. However, most existing vectorization techniques infer the bezigons by simply approximating an intermediate vector representation (such as polygons). Consequently, the resultant bezigons are sometimes imperfect due to accumulated errors, fitting ambiguities, and a lack of curve priors, especially for low-resolution images. In this paper, we describe a novel method for vectorizing clipart images. In contrast to previous methods, we directly optimize the bezigons rather than using other intermediate representations; therefore, the resultant bezigons are not only of higher fidelity compared with the original raster image but also more reasonable because they were traced by a proficient expert. To enable such optimization, we have overcome several challenges and have devised a differentiable data energy as well as several curve-based prior terms. To improve the efficiency of the optimization, we also take advantage of the local control property of bezigons and adopt an overlapped piecewise optimization strategy. The experimental results show that our method outperforms both the current state-of-the-art method and commonly used commercial software in terms of bezigon quality.
Desingularization strategies for three-dimensional vector fields
Torres, Felipe Cano
1987-01-01
For a vector field #3, where Ai are series in X, the algebraic multiplicity measures the singularity at the origin. In this research monograph several strategies are given to make the algebraic multiplicity of a three-dimensional vector field decrease, by means of permissible blowing-ups of the ambient space, i.e. transformations of the type xi=x'ix1, 2s. A logarithmic point of view is taken, marking the exceptional divisor of each blowing-up and by considering only the vector fields which are tangent to this divisor, instead of the whole tangent sheaf. The first part of the book is devoted to the logarithmic background and to the permissible blowing-ups. The main part corresponds to the control of the algorithms for the desingularization strategies by means of numerical invariants inspired by Hironaka's characteristic polygon. Only basic knowledge of local algebra and algebraic geometry is assumed of the reader. The pathologies we find in the reduction of vector fields are analogous to pathologies in the pro...
Music Signal Processing Using Vector Product Neural Networks
Fan, Z. C.; Chan, T. S.; Yang, Y. H.; Jang, J. S. R.
2017-05-01
We propose a novel neural network model for music signal processing using vector product neurons and dimensionality transformations. Here, the inputs are first mapped from real values into three-dimensional vectors then fed into a three-dimensional vector product neural network where the inputs, outputs, and weights are all three-dimensional values. Next, the final outputs are mapped back to the reals. Two methods for dimensionality transformation are proposed, one via context windows and the other via spectral coloring. Experimental results on the iKala dataset for blind singing voice separation confirm the efficacy of our model.
Shi, Yingzhong; Chung, Fu-Lai; Wang, Shitong
2015-09-01
Recently, a time-adaptive support vector machine (TA-SVM) is proposed for handling nonstationary datasets. While attractive performance has been reported and the new classifier is distinctive in simultaneously solving several SVM subclassifiers locally and globally by using an elegant SVM formulation in an alternative kernel space, the coupling of subclassifiers brings in the computation of matrix inversion, thus resulting to suffer from high computational burden in large nonstationary dataset applications. To overcome this shortcoming, an improved TA-SVM (ITA-SVM) is proposed using a common vector shared by all the SVM subclassifiers involved. ITA-SVM not only keeps an SVM formulation, but also avoids the computation of matrix inversion. Thus, we can realize its fast version, that is, improved time-adaptive core vector machine (ITA-CVM) for large nonstationary datasets by using the CVM technique. ITA-CVM has the merit of asymptotic linear time complexity for large nonstationary datasets as well as inherits the advantage of TA-SVM. The effectiveness of the proposed classifiers ITA-SVM and ITA-CVM is also experimentally confirmed.
Perimeter generating functions for the mean-squared radius of gyration of convex polygons
International Nuclear Information System (INIS)
Jensen, Iwan
2005-01-01
We have derived long series expansions for the perimeter generating functions of the radius of gyration of various polygons with a convexity constraint. Using the series we numerically find simple (algebraic) exact solutions for the generating functions. In all cases the size exponent ν 1. (letter to the editor)