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 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 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 coastal hydrography used in the creation of the Environmental Sensitivity Index (ESI) for New...
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 ...
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...
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…
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.
Sensitivity of Coastal Environments and Wildlife to Spilled Oil: New Hampshire: NESTS (Nest Points)
National Oceanic and Atmospheric Administration, Department of Commerce — This data set contains sensitive biological resource data for nesting birds in New Hampshire. Vector points in this data set represent locations of nesting osprey...
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
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.
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.
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 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 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.
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...
New Hampshire's Forest Resources, 2006
R.S. Morin; M. Tansey
2008-01-01
This publication provides an overview of forest resource attributes for New Hampshire based on an annual inventory conducted by the Forest Inventory and Analysis (FIA) program at the Northern Research Station of the U.S. Forest Service. These annual estimates, along with web-posted core tables, will be updated annually. For more information regarding past inventory...
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 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 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
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.
New Hampshire binder and mix review.
2012-08-01
This review was initiated to compare relative rut testing and simple performance tests (now known as Asphalt Mix : Performance Tests) for the New Hampshire inch mix with 15% Recycled Asphalt Pavement (RAP). The tested mixes were : made from ...
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...
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.
A PLAN FOR LIBRARY COOPERATION IN NEW HAMPSHIRE. REPORT TO NEW HAMPSHIRE STATE LIBRARY.
Little (Arthur D.), Inc., Cambridge, MA.
AS A STEP TOWARD IMPROVING SERVICES TO ALL USERS, THE NEW HAMPSHIRE STATE LIBRARY SPONSORED A STUDY OF BOTH THE SYSTEM OF LIBRARIES IN NEW HAMPSHIRE AND THEIR RESOURCES. THE STUDY ITSELF IS LIMITED TO THE POSSIBLE COORDINATION OF THE RESOURCES OF ALL TYPES OF LIBRARIES (PUBLIC, SPECIAL, SCHOOL, ACADEMIC) IN A WAY WHICH WILL MAKE THEM MORE READILY…
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.
The Fiscal Impacts of School Choice in New Hampshire
Gottlob, Brian J.
2004-01-01
This study addresses the fiscal impacts of school choice in New Hampshire. The author uses one example from the 2003 New Hampshire legislative session to illustrate the fiscal impacts of school choice on New Hampshire and its communities. He develops a unique database of individual and household level responses from the 2000 Census of New…
Alternative Fuels Data Center: New Hampshire Transportation Data for
Private Biodiesel (B20 and above) 1 3 Compressed Natural Gas (CNG) 3 1 Electric 80 20 Ethanol (E85) 0 0 YouTube Video thumbnail for New Hampshire Cleans up with Biodiesel Buses New Hampshire Cleans up with Biodiesel Buses May 26, 2017 https://www.youtube.com/embed/9Qq-Leiujjk Video thumbnail for New Hampshire
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...
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...
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.
Prenatal Care: New Hampshire Residents - 1976.
Mires, Maynard H.; Sirc, Charles E.
Data from 1976 New Hampshire birth certificates were used to examine the correlations between the degree (month of pregnancy that prenatal care began) and intensity (number of prenatal visits) of prenatal care and low infant birth weight, illegitimacy, maternal age, maternal education, and complications of pregnancy. The rate of low birth weight…
Residential Energy Efficiency Potential: New Hampshire
Energy Technology Data Exchange (ETDEWEB)
Wilson, Eric J [National Renewable Energy Laboratory (NREL), Golden, CO (United States)
2017-11-16
Energy used by New Hampshire single-family homes that can be saved through cost-effective improvements. Prepared by Eric Wilson and Noel Merket, NREL, and Erin Boyd, U.S. Department of Energy Office of Energy Policy and Systems Analysis.
New Hampshire's Accountability 3.0
Leather, Paul
2016-01-01
Paul Leather is New Hampshire's deputy commissioner of education. In this article he writes that he believes education policymakers over the past few decades have made two critical decisions that have had deep, deleterious effects on the overall public education system. First, by demanding that each school be evaluated based on a single externally…
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.
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
77 FR 68796 - New Hampshire; Emergency and Related Determinations
2012-11-16
... determined that the emergency conditions in the State of New Hampshire resulting from Hurricane Sandy... State of New Hampshire have been designated as adversely affected by this declared emergency: All..., Disaster Unemployment Assistance (DUA); 97.046, Fire Management Assistance Grant; 97.048, Disaster Housing...
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
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)
Hydroelectric Generating Facilities General Permit (HYDROGP) for Massachusetts & New Hampshire
Documents, links & contacts for the Notice of Availability of the Final NPDES General Permits (HYDROGP) for Discharges at Hydroelectric Generating Facilities in Massachusetts (MAG360000) and New Hampshire (NHG360000) and Tribal Lands in the State of MA.
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)
Scoping of Flood Hazard Mapping Needs for Coos County, New Hampshire
National Research Council Canada - National Science Library
Flynn, Robert H
2006-01-01
This report was prepared by the U.S. Geological Survey (USGS) New Hampshire/Vermont Water Science Center for scoping of flood-hazard mapping needs for Coos County, New Hampshire, under Federal Emergency Management Agency (FEMA...
Scoping of Flood Hazard Mapping Needs for Belknap County, New Hampshire
National Research Council Canada - National Science Library
Flynn, Robert H
2006-01-01
This report was prepared by the U.S. Geological Survey (USGS) New Hampshire/Vermont Water Science Center for scoping of flood-hazard mapping needs for Belknap County, New Hampshire, under Federal Emergency Management Agency (FEMA...
Scoping of Flood Hazard Mapping Needs for Merrimack County, New Hampshire
National Research Council Canada - National Science Library
Flynn, Robert H
2006-01-01
This report was prepared by the U.S. Geological Survey (USGS) New Hampshire/VermontWater Science Center for scoping of flood-hazard mapping needs for Merrimack County, New Hampshire, under Federal Emergency Management Agency (FEMA...
2012-02-06
... Promulgation of Implementation Plans; New Hampshire: Prevention of Significant Deterioration; Greenhouse Gas... revision modifies New Hampshire's Prevention of Significant Deterioration (PSD) program to establish... of Ecosystem Protection, Air Permits, Toxics, and Indoor Programs Unit, 5 Post Office Square--Suite...
Directory of Open Access Journals (Sweden)
Silvia Manduca Trapp
Full Text Available The present study aimed to determine the types of hemoglobin in Hampshire Down crossbreed sheep, and verify that this locus is in Hardy-Weinberg equilibrium. There have been collected 46 blood samples of healthy Hampshire Down crossbreed sheep. These samples were used to separate the hemoglobin per electrophoresis. The electrophoresis of the hemoglobin revealed a slow band characterized as hemoglobin A (HbAA, a fast band characterized as hemoglobin B (HbBB and two bands in the heterozygous hemoglobin A and B (HbAB. The HbAB type was the most frequently one, followed by hemoglobin A (HbAA and B (HbBB. The genotypic frequency of individuals BB, AB and AA were 36,95; 54,35 and 8,70% respectively. The allelic frequency of A and B were respectively 35,87% and 64,13%.. The qui square test (?2 = 0.859 and p = 0.6509 confirmed that the tested locus is in Hardy-Weinberg equilibrium.O presente trabalho teve como objetivo determinar os tipos de hemoglobinas em ovinos Hampshire Down e verificar se este locus encontra-se em equilíbrio de Hardy-Weinberg. Foram coletadas 46 amostras de sangue de ovinos Hampshire Down, considerados clinicamente sadios. Estas amostras foram utilizadas para a separação das hemoglobinas por eletroforese. A eletroforese das hemoglobinas revelou uma banda lenta caracterizada como hemoglobina B (HbBB, uma banda rápida caracterizada como hemoglobina A (HbAA e duas bandas no heterozigoto para hemoglobinas A e B (HbAB. A variante HbAB foi a mais freqüentemente encontrada, seguida pela hemoglobina A (HbAA e B (HbBB. A freqüência genotípica dos indivíduos BB, AB e AA foram 36,95; 54,35 e 8,70% respectivamente. A freqüência alélica de A e B foram respectivamente 35,87% e 64,13%. Pelo teste do qui-quadrado realizado (?2 = 0,859 e p=0,6509 confirmou-se que o locus testado está em equilíbrio de Hardy-Weinberg.
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)
Robert A. Robertson
2003-01-01
Social science research is often used by resource management agencies to "obtain a balanced view of the preferences and needs of individuals, communities, and special interest publics potentially affected by agency activities." This study explores the extent that those people who are born in New Hampshire (i.e., natives) are different from persons who moved...
Cost-Effectiveness Analysis of the Residential Provisions of the 2015 IECC for New Hampshire
Energy Technology Data Exchange (ETDEWEB)
Mendon, Vrushali V. [Pacific Northwest National Lab. (PNNL), Richland, WA (United States); Zhao, Mingjie [Pacific Northwest National Lab. (PNNL), Richland, WA (United States); Taylor, Zachary T. [Pacific Northwest National Lab. (PNNL), Richland, WA (United States); Poehlman, Eric A. [Pacific Northwest National Lab. (PNNL), Richland, WA (United States)
2016-02-15
The 2015 IECC provides cost-effective savings for residential buildings in New Hampshire. Moving to the 2015 IECC from the 2010 New Hampshire State Code base code is cost-effective for residential buildings in all climate zones in New Hampshire.
Alternative Fuels Data Center: New Hampshire Fleet Revs up With Natural Gas
New Hampshire Fleet Revs up With Natural Gas to someone by E-mail Share Alternative Fuels Data Center: New Hampshire Fleet Revs up With Natural Gas on Facebook Tweet about Alternative Fuels Data Center: New Hampshire Fleet Revs up With Natural Gas on Twitter Bookmark Alternative Fuels Data Center
2010-06-21
... Paper Company; Notice Rejecting Application, Waiving Regulations, and Soliciting Applications June 15, 2010. On June 2, 2010, Hampshire Paper Company (Hampshire Paper), licensee for the Emeryville....\\1\\ \\1\\ Hampshire Paper was issued a major license for the project on June 17, 1982, for a term of 30...
Hydrologic conditions in New Hampshire and Vermont, water year 2011
Kiah, Richard G.; Jarvis, Jason D.; Hegemann, Robert F.; Hilgendorf, Gregory S.; Ward, Sanborn L.
2013-01-01
Record-high hydrologic conditions in New Hampshire and Vermont occurred during water year 2011, according to data from 125 streamgages and lake gaging stations, 27 creststage gages, and 41 groundwater wells. Annual runoff for the 2011 water year was the sixth highest on record for New Hampshire and the highest on record for Vermont on the basis of a 111-year reference period (water years 1901–2011). Groundwater levels for the 2011 water year were generally normal in New Hampshire and normal to above normal in Vermont. Record flooding occurred in April, May, and August of water year 2011. Peak-of-record streamflows were recorded at 38 streamgages, 25 of which had more than 10 years of record. Flooding in April 2011 was widespread in parts of northern New Hampshire and Vermont; peak-of-record streamflows were recorded at nine streamgages. Flash flooding in May 2011 was isolated to central and northeastern Vermont; peakof- record streamflows were recorded at five streamgages. Devastating flooding in August 2011 occurred throughout most of Vermont and in parts of New Hampshire as a result of the heavy rains associated with Tropical Storm Irene. Peak-ofrecord streamflows were recorded at 24 streamgages.
New Hampshire Better Buildings - Final Report
Energy Technology Data Exchange (ETDEWEB)
Cramton, Karen [NH Office of Energy and Planning; Peters, Katherine
2014-11-01
With $10 million in funding from the U.S. Department of Energy's (DOE) Better Buildings Neighborhood Program, the NH Better Buildings program was established as an initiative that initially empowered the three “Beacon Communities” of Berlin, Nashua and Plymouth to achieve transformative energy savings and reductions in fossil fuel use and greenhouse gases through deep energy retrofits and complementary sustainable energy solutions. The program also enabled those Communities to provide leadership to other communities around the state as “beacons” of energy efficiency. The goal of the program was to reduce energy use by a minimum of 15% through energy efficiency upgrades in residential and commercial buildings in the communities. The program expanded statewide in April 2012 by issuing a competitive solicitation for additional commercial projects non-profit, and municipal energy efficiency projects from any community in the state, and a partnership with the state’s utility-run, ratepayer-funded residential Home Performance with ENERGY STAR® (HPwES) program. The NH Better Buildings program was administered by the New Hampshire Office of Energy and Planning (OEP) and managed by the NH Community Development Finance Authority (CDFA). The program started in July 2010 and the last projects funded with American Reinvestment and Recovery Act (ARRA) funds were completed in August 2013. The program will continue after the American Recovery and Reinvestment Act program period as a Revolving Loan Fund, enabling low-interest financing for deep energy retrofits into the future.
New Hampshire Better Buildings - Final Interim Report
Energy Technology Data Exchange (ETDEWEB)
Cramton, Karen [NH Office of Energy and Planning; Peters, Katherine
2014-02-20
With $10 million in funding from the U.S. Department of Energy's (DOE) Better Buildings Neighborhood Program, the NH Better Buildings program was established as an initiative that initially empowered the three “Beacon Communities” of Berlin, Nashua and Plymouth to achieve transformative energy savings and reductions in fossil fuel use and greenhouse gases through deep energy retrofits and complementary sustainable energy solutions. The program also enabled those Communities to provide leadership to other communities around the state as “beacons” of energy efficiency. The goal of the program was to reduce energy use by a minimum of 15% through energy efficiency upgrades in residential and commercial buildings in the communities. The program expanded statewide in April 2012 by issuing a competitive solicitation for additional commercial projects non-profit, and municipal energy efficiency projects from any community in the state, and a partnership with the state’s utility-run, ratepayer-funded residential Home Performance with ENERGY STAR® (HPwES) program. The NH Better Buildings program was administered by the New Hampshire Office of Energy and Planning (OEP) and managed by the NH Community Development Finance Authority (CDFA). The program started in July 2010 and the last projects funded with American Reinvestment and Recovery Act (ARRA) funds were completed in August 2013. The program will continue after the American Recovery and Reinvestment Act program period as a Revolving Loan Fund, enabling low-interest financing for deep energy retrofits into the future.
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.
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.
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...
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...
Digital Learning Compass: Distance Education State Almanac 2017. New Hampshire
Seaman, Julia E.; Seaman, Jeff
2017-01-01
This brief report uses data collected under the U.S. Department of Education's National Center for Educational Statistics (NCES) Integrated Postsecondary Education Data System (IPEDS) Fall Enrollment survey to highlight distance education data in the state of New Hampshire. The sample for this analysis is comprised of all active, degree-granting…
The Constitutionality of School Choice in New Hampshire
Douglas, Charles G., III; Komer, Richard D.
2004-01-01
Does a "school choice" program, under which state funds are disbursed on a neutral basis to parents in the form of a voucher to defray the cost of sending their children to a school of their choice, run afoul of the Establishment Clause of the First Amendment to the United States Constitution, or of the New Hampshire Constitution? No. A…
New Hampshire Public Schools Facilities Adequacy and Condition Study Report.
2000
This report presents New Hampshire survey data, methodology, and the survey instrument used to measure a school's physical quality and educational effectiveness. The survey instrument collects data in the following categories: school site; building; building systems; building maintenance; building safety and security; space adequacy; and building…
76 FR 61372 - New Hampshire; Emergency and Related Determinations
2011-10-04
... Hurricane Irene beginning on August 26, 2011, and continuing, are of sufficient severity and magnitude to... following areas of the State of New Hampshire have been designated as adversely affected by this declared... Assistance (DUA); 97.046, Fire Management Assistance Grant; 97.048, Disaster Housing Assistance to...
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
Energy Technology Data Exchange (ETDEWEB)
Walston, Leroy J.; Najjar, Stephen J.; LaGory, Kirk E.; Drake, Sean M.
2015-06-27
Understanding the spatial ecology and habitat requirements of rare turtle species and the factors that threaten their populations is important for the success of long-term conservation programs. We present results on an eight-year field study in which we used radiotelemetry to monitor the activity and habitat use of 23 adult (male, n = 7; female, n = 16) Blanding’s turtles in southcentral New Hampshire. We found that females occupied home ranges (as defined by minimum convex polygons) that were approximately two times larger than the home ranges of males. Despite the sex difference in home range size, we found no sex difference in core area size (defined as the 50% kernel density estimate). We found that activity patterns varied by season, with increased activity each month after hibernation, and peak activity coinciding with the late spring-early summer nesting season. We observed sex-based and seasonal differences in wetland use. Males appeared to prefer emergent and scrub-shrub wetlands in each season, whereas females preferred scrub-shrub wetlands in spring and ponds in summer and fall. We identified road mortality risk as a potentially important threat for this population because females crossed roads ten times more frequently than males (based on proportion of observations). The preservation of wetland networks, as well as the implementation of measures to minimize road mortality, are important considerations for the long-term persistence of this population.
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...
Berke, Ethan M; Shi, Xun
2009-04-29
Travel time is an important metric of geographic access to health care. We compared strategies of estimating travel times when only subject ZIP code data were available. Using simulated data from New Hampshire and Arizona, we estimated travel times to nearest cancer centers by using: 1) geometric centroid of ZIP code polygons as origins, 2) population centroids as origin, 3) service area rings around each cancer center, assigning subjects to rings by assuming they are evenly distributed within their ZIP code, 4) service area rings around each center, assuming the subjects follow the population distribution within the ZIP code. We used travel times based on street addresses as true values to validate estimates. Population-based methods have smaller errors than geometry-based methods. Within categories (geometry or population), centroid and service area methods have similar errors. Errors are smaller in urban areas than in rural areas. Population-based methods are superior to the geometry-based methods, with the population centroid method appearing to be the best choice for estimating travel time. Estimates in rural areas are less reliable.
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.
Climatic data for Mirror Lake, West Thornton, New Hampshire : 1985
Sturrock, Alex M.; Buso, D.C.; Scarborough, J.L.; Winter, T.C.
1988-01-01
Research on the hydrology of Mirror Lake, West Thornton, New Hampshire, includes a study of evaporation. Those climatic data needed for energy-budget and mass-transfer evaporation studies are presented, including: water surface temperature, dry-bulb and wet-bulb air temperatures, vapor pressure at and above the water surface, wind speed, and short- and long-wave radiation. Data are collected at raft and land stations. (USGS)
Climatic data for Mirror Lake, West Thornton, New Hampshire, 1984
Sturrock, A.M.; Buso, D.C.; Scarborough, J.L.; Winter, T.C.
1986-01-01
Research on the hydrology of Mirror lake, (north-central) New Hampshire includes study of evaporation. Presented here are those climatic data needed for energy-budget and mass-transfer studies, including: temperature of lake water surface; dry-bulb and wet-bulb air temperatures; wind speed at 3 levels above the water surface; and solar and atmospheric radiation. Data are collected at raft and land stations. (USGS)
New Hampshire's clean power act: why, what and how
International Nuclear Information System (INIS)
Colburn, K.
2002-01-01
A map depicting acid deposition levels in the United States, and a table on acid neutralizing capacity (ANC) of New Hampshire Lakes and remote ponds were displayed. The air quality in New Hampshire is a concern, especially as tourism represents the second largest industry. Several graphs were shown concerning the effects of contaminants with regard to air quality. The impact of ozone on human health was discussed. Anthropogenic mercury deposition rates in the United States was discussed, as was temperature change in New England. The economic impacts to forest products industry were examined under climate scenarios. Environmental leadership is required to mitigate the effects of acid rain and ozone, mercury levels for fish and climate change effects in New Hampshire. The design principles comprised cooperative development based on sound science with applicability and integrated and comprehensive approach. The legislation considered pollutants, levels and timetables. The pollutants included sulphur dioxide, nitrous oxide, carbon dioxide and mercury. The compliance date was set for December 31, 2006. Flexibility and incentives were built into the legislation. Cost estimates are in the order of 5 million dollars per year. The political process was explained, from the preparation of the Clean Power Strategy to its introduction in 2001 session. It was signed by the Governor on May 9, 2002. The author indicated renewable energy sources favor the environment and jobs. The new economics or environment and energy are beginning to be understood by States. A brief overview of initiatives from other States was provided. refs., tabs., figs
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.
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.
2013-08-09
... Hydroelectric, Inc., New Hampshire Hydro Associates; Notice of Transfer of Exemption August 5, 2013. 1. By letter filed July 19, 2013, Rivermill Hydroelectric, Inc. and New Hampshire Hydro Associates informed the... Project, FERC No. 9403. All correspondence should be forwarded to Rivermill Hydroelectric, Inc., c/o Essex...
75 FR 33763 - Agenda and Notice of Public Meeting of the New Hampshire Advisory Committee
2010-06-15
.... Commission on Civil Rights and the Federal Advisory Committee Act that a planning meeting of the New... COMMISSION ON CIVIL RIGHTS Agenda and Notice of Public Meeting of the New Hampshire Advisory...'s work on gender disparities in New Hampshire prisons. Members of the public are entitled to submit...
75 FR 53268 - Adequacy of New Hampshire Municipal Solid Waste Landfill Permit Program
2010-08-31
...] Adequacy of New Hampshire Municipal Solid Waste Landfill Permit Program AGENCY: Environmental Protection... modification of its approved Municipal Solid Waste Landfill Program. On March 22, 2004, EPA issued final... solid waste landfills by approved states. On June 28, 2010 New Hampshire submitted an application to EPA...
Marion, Scott F.; Vander Els, Jonathan; Leather, Paul
2017-01-01
In New Hampshire, a new performance assessment system focuses on reciprocal accountability and shared leadership among teachers and leaders at the school, district, and state levels. This concept of reciprocal accountability, developed by school improvement expert Richard Elmore, is at the core of New Hampshire's Performance Assessment of…
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.
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.
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 >
Bjerklie, David M.; Ayotte, Joseph D.; Cahillane, Matthew J.
2015-01-01
The State of New Hampshire has initiated a coordinated effort to proactively prepare for the effects of climate change on the natural and human resources of New Hampshire. An important aspect of this effort is to develop a vulnerability assessment of hydrologic response to climate change. The U.S. Geological Survey, in cooperation with the New Hampshire Department of Health and Human Services, is developing tools to predict how projected changes in temperature and precipitation will affect change in the hydrology of watersheds in the State. This study is a test case to assemble the information and create the tools to assess the hydrologic vulnerabilities in four specific watersheds.
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
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.
Determining a strategy for efficiently managing sign retroreflectivity in New Hampshire.
2012-05-01
The Manual on Uniform Traffic Control Devices (MUTCD) has developed minimum retroreflectivity requirements for sign sheeting that will : become a federal mandate for roadside signs in 2015 and for overhead signs in 2018. In 2012, the New Hampshire De...
National Oceanic and Atmospheric Administration, Department of Commerce — This data set comprises the Environmental Sensitivity Index (ESI) data for the New Hampshire coast from 2003 to 2004. ESI data characterize estuarine environments...
78 FR 55241 - Agenda and Notice of Public Meeting of the New Hampshire Advisory Committee
2013-09-10
... trafficking issues, racial profiling issues, mental health matters, and voting rights issues in New Hampshire... they become available, both before and after the meeting. Persons interested in the work of this...
Social Vulnerability Index (SoVI) for New Hampshire based on 2000 Census Block Groups
National Oceanic and Atmospheric Administration, Department of Commerce — This data depicts the social vulnerability of New Hampshire census block groups to environmental hazards. Data were culled primarily from the 2000 Decennial Census.
2011-06-14
... Promulgation of Implementation Plans; New Hampshire: Prevention of Significant Deterioration; Greenhouse Gas... Deterioration (PSD) program to establish appropriate emission thresholds for determining which new stationary... Protection Agency, EPA New England Regional Office, Office of Ecosystem Protection, 5 Post Office Square...
New Hampshire State Briefing Book for low-level radioactive waste management
International Nuclear Information System (INIS)
1981-07-01
The New Hampshire State Briefing Book is one of a series of state briefing books based on low-level radioactive waste management practices. It has been prepared to assist state and federal agency officials in planning for safe low-level radioactive waste generators in New Hampshire. The profile is the result of a survey of NRC licensees in New Hampshire. The briefing book also contains a comprehensive assessment of low-level radioactive waste management issues and concerns as defined by all major interested parties including industry, government, the media, and interest groups. The assessment was developed through personal communications with representatives of interested parties, and through a review of media sources. Lastly, the briefing book provides demographic and socioeconomic data and a discussion of relevant government agencies and activities, all of which may impact waste management practices in New Hampshire
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...
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
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
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
Gaseous elemental and reactive mercury in Southern New Hampshire
Directory of Open Access Journals (Sweden)
J. M. Sigler
2009-03-01
Full Text Available We conducted measurements of Hg^{0} and RGM at two inland sites, Thompson Farm (TF and Pac Monadnock (PM, and a marine site (Appledore Island (AI from the UNH AIRMAP observing network in New Hampshire in 2007. Measurements of other important trace gases and meteorological variables were used to help understand influences on the atmospheric Hg budget in New England. Seasonal variation in both species observed at TF and PM is attributable to such factors as seasonal variation in deposition strength, meteorological conditions and biogenic emissions. Hg^{0} and RGM varied diurnally at TF, particularly in spring, following the trend in air temperature and jNO_{2} and suggesting photochemical production of RGM. The diurnal patterns of Hg^{0} and RGM at AI during summer were nearly opposite in phase, with Hg^{0} decreasing through late afternoon, suggesting more significant photochemical oxidation of Hg^{0} to RGM in the marine environment, likely due to the presence of marine halogen compounds. A significant relationship of RGM with SO_{2} at TF suggests a strong contribution of RGM from anthropogenic sources. Significant levels of halogen compounds measured at TF in previous studies, as well as similar Hg^{0} levels and Hg^{0}-CO ratios at TF and AI may suggest that similar air masses are prevalent at these sites.
Aligning for Heroes: Partnership for Veteran Care in New Hampshire.
Fasoli, DiJon R
2015-01-01
A growing number of veterans and service members ("veterans" refers to both veterans and eligible service members) are returning home and may be living with mental health conditions related to their military service. For a variety of reasons, the majority of US veterans receive their health care outside the Veterans Administration or the military health system. Nurse leaders and citizen-soldiers were among a number of concerned government officials, health care professionals, service providers, and military leaders in New Hampshire (NH) who joined forces to explore NH veterans' mental health needs and manage provider service capacity. This article describes the formation and efforts of a permanent legislative commission, the NH Commission on PTSD and TBI (COPT), composed of interdisciplinary, multiorganizational, and cross-governmental leaders aligned to address the issues of stigma, military cultural awareness, and integration of care. Commission participants were asked to share their perspectives on the gaps and challenges to veterans' care, opportunities for collaboration, and measurable outcomes. Key challenges included interagency communication and care integration issues, veteran and provider knowledge gaps about needs and system problems. Favorable timing, available funding, and the collaborative environment of the commission were identified as potential opportunities. While still a work in progress, the COPT has begun making an impact. We identify early outcomes and lessons learned. The COPT is a model for leveraging interdisciplinary professional collaboration to improve access to care for veterans.
Kim Pawlawski; Robert A. Robertson; Laura Pfister
2003-01-01
This study was intended to provide New Hampshire agencies with a better understanding of public access-related demand information. Through an analysis of three groups of New Hampshire residents based upon geographic location and length of residency, important issues and attitudes were identified from all over the State. The results of this study will assist in policy-...
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.
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.
Genetic differentiation between 'Araucana' creole and 'Hampshire Down' sheeps in Chile
Directory of Open Access Journals (Sweden)
Silvana Bravo
2015-03-01
Full Text Available Genetic diversity studies in domestic animals allow evaluating genetic variation within and among breeds mainly for conservation purposes. In Chile exist isolated recovery programs, conservation and characterization of animal genetic resources, a consequence of which the vast majority of them have not been characterized, poorly used, and some of them have become extinct. The aim of this research was to determine genetic diversity and relationship between 'Araucana' creole and 'Hampshire Down' sheeps based on microsatellite markers; sheep breeds with similar phenotypic characteristics, raised in the south of Chile. A total of 64 'Araucana' sheep ('Araucana' from Freire, AF: 27, 'Araucana' from Padre Las Casas, AP: 10, 'Araucana' from Chol Chol, AC: 15, 'Araucana' from Villarrica, AV: 12 and 43 'Hampshire Down' sheep ('Hampshire' from Marchigue, HM: 18, 'Hampshire' from Valdivia, HV: 11, 'Hampshire' from San José, HS: 14 were analyzed using 17 microsatellite markers for determine the genetic diversity and relationship between breeds. A total of 284 alleles were observed with average polymorphic information content equal to 0.76, showing that the microsatellites panel used was highly informative. Estimated heterozygosity ranged from 0.73 in 'Hampshire Down' to 0.85 in 'Araucana'. The low inbreeding or endogamy coefficient (F IS, 0.022 and total inbreeding estimate (F IT, 0.070 indicated low level of inbreeding within and among breeds. The phylogenetic tree showed a separation between HS and HV, and the other sheep populations. The results indicated high genetic variability, low inbreeding, and low genetic differentiation, except for HV and HS, and were in according with geographical location and breeding practices.
Degnan, James; Barker, Gregory; Olson, Neil; Wilder, Leland
2012-01-01
The U.S. Geological Survey, in cooperation with the New Hampshire Geological Survey, measured the fluid temperature of groundwater in deep bedrock wells in the State of New Hampshire in order to characterize geothermal gradients in bedrock. All wells selected for the study had low water yields, which correspond to low groundwater flow from fractures. This reduced the potential for flow-induced temperature changes that would mask the natural geothermal gradient in the bedrock. All the wells included in this study were privately owned, and permission to use the wells was obtained from homeowners before logging.
Case study of recycling options for New Hampshire generators
Energy Technology Data Exchange (ETDEWEB)
Coleman, P.M. [Resource Conservation Services, Inc., Brunswick, ME (United States)
1993-12-31
The successful development of utilization programs for ash generated by the combustion of biomass in Northern New England is described, with special focus on the State of New Hampshire. With the development of over 25 large scale biomass boilers in Northern New England during the past ten years, has come the need to dispose of the over 300,000 cubic yards of ash produced as a combustion by-product. Resource Conservation Services, Inc., a private company, pioneered the development of various utilization options for biomass boiler ash. The major use of ash has been as an agricultural soil amendment. The high levels of calcium in wood ash make it valuable as a lime substitute for raising soil pH. Wood ash also contains significant levels of potassium, phosphorus and magnesium as well as lesser amounts of other plant nutrients which make it valuable as a fertilizer. Soil testing is used to determine application rates to agricultural land. Ash use is regulated by State environmental protection agencies. Heavy metal content of wood ash meets regulatory standards. Wood ash also proven valuable as a bulking and odor control material when mixed with municipal wastewater treatment plant sludge and composted. The high pH of wood ash controls odor producing compounds generated by the composting process. High carbon ash also controls odors through improved aeration and by adsorption of odor producing compounds by the {open_quotes}char{close_quotes} in the ash. Additional uses for wood ash are as a component of concrete products such as {open_quotes}flowable fill{close_quotes} and {open_quotes}soil cement,{close_quotes} as a lime substitute for sludge stabilization, and as landfill daily cover. As higher value uses for wood ash have been developed, ash disposal costs have been reduced and ash is viewed more like a commodity than a waste material.
Engaging Communities Where They Are: New Hampshire's Coastal Adaptation Workgroup
Wake, C. P.; Godlewski, S.; Howard, K.; Labranche, J.; Miller, S.; Peterson, J.; Ashcraft, C.
2015-12-01
Rising seas are expected to have significant impacts on infrastructure and natural and cultural resources on New Hampshire's 18 mile open-ocean coastline and 235 miles of tidal shoreline. However, most coastal municipalities in NH lack financial and human resources to even assess vulnerability, let alone plan for climate change. This gap has been filled since 2010 by the NH Coastal Adaptation Workgroup (CAW), composed of 21 regional, state, and federal agencies, businesses, municipalities, academics, and NGOs that bring together stakeholders to discuss climate change challenges and collaboratively develop and implement effective coastal adaptation strategies. Our grassroot efforts serve to nurture existing and build new relationships, disseminate coastal watershed climate assessments, and tap into state, federal, and foundation funds for specific coastal adaptation projects. CAW has achieved collective impact in by connecting federal and state resources to communities by raising money and facilitating projects, translating climate science, educating community members, providing direct technical assistance and general capacity, and sharing success stories and lessons learned. Indicators of success include: 12 coastal communities improved their technical, financial, and human resources for climate adaptation; 80% of the 300 participants in the eleven CAW 'Water, Weather, Climate, and Community Workshops' have increased knowledge, motivation, and capacity to address climate adaptation; $3 million in grants to help communities with climate adaptation; winner of the 2015 EPA Region 1 Environmental Merit Award; and ongoing support for community-led adaptation efforts. In addition, the NH Climate Summit attracts over 100 participants each year, over 90% whom attest to the applicability of what they learn there. CAW also plays a central role in the Coastal Risks and Hazards Commission (established by the state legislature in 2013) to help communities and businesses prepare
Trichinella nativa in a black bear from Plymouth, New Hampshire.
Hill, D E; Gamble, H R; Zarlenga, D S; Coss, C; Finnigan, J
2005-09-05
A suspected case of trichinellosis was identified in a single patient by the New Hampshire Public Health Laboratories in Concord, NH. The patient was thought to have become infected by consumption of muscle larvae (ML) in undercooked meat from a black bear killed in Plymouth, NH in October 2003 and stored frozen at -20 degrees C fro 4 months. In January 2004, a 600 g sample of the meat was thawed at 4 degrees C, digested in hydrochloric acid and pepsin, and larvae were collected by sedimentation. Intact, coiled, and motile ML were recovered (366 larvae per gram (l pg) of tissue), which were passed into mice and pigs. Multiplex PCR revealed a single 127 bp amplicon, indicative of Trichinella nativa. The Reproductive Capacity Index (RCI) for the T. nativa-Plymouth isolate in mice was 24.3. Worm burdens in the diaphragms of two 3-month-old pigs given 2,500 ML were 0.05 and 0.2l pg by 35 days post-inoculation, while 2.2 and 0.75 l pg were recovered from two 3-month-old pigs given 10,000 ML; no larvae were recovered from four 1-year-old pigs given 2,500 ML (n=2) or 10,000 ML (n=2). Viable larvae were also recovered from frozen black bear meat harvested at two additional locations, one in southern Ontario, Canada, and one in upstate New York, USA. Multiplex PCR using genomic DNA from these parasite samples demonstrated that both isolates were T. nativa. This is the first report of the freeze-resistant species, T. nativa, within the continental United States.
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...
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 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...
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)
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
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.
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.
2013-01-25
... repair network for an on-board diagnostic (OBD2) testing program for model year 1996 and newer vehicles... Hampshire; Enhanced Motor Vehicle Inspection and Maintenance Program AGENCY: Environmental Protection Agency... include regulations to update the enhanced motor vehicle inspection and maintenance (I/M) programs in...
Climatic data for Mirror Lake, West Thornton, New Hampshire, 1981-82
Sturrock, A.M.; Buso, D.C.; Bieber, G.M.; Engelbrecht, L.G.; Winter, T.C.
1984-01-01
Research on the hydrology of Mirror Lake, (north-central) New Hampshire includes study of evaporation. Presented here are those climatic data needed for energy-budget and mass-transfer studies, including: temperature of lake water surface, dry-bulb and wet-bulb air temperatures, wind speed, precipitation and solar radiation. Data are collected at raft and land stations. (USGS)
David A. Post; Julia A. Jones
2001-01-01
This study characterized the hydrologic regimes at four forested, mountainous long-term ecological research (LTER) sites: H.J. Andrews (Oregon), Coweeta (North Carolina), Hubbard Brook (New Hampshire), and Luquillo (Puerto Rico). Over 600 basinyears of daily streadow records were examined from 18 basins that have not experienced human disturbances since at least the...
Ben Amsden; Thad Guldbrandsen; Mark Okrant
2012-01-01
Nostalgia tourism is an emerging phenomenon in which visitors actively seek to relive their experiences and/or perceptions of yesteryear. How can modern-day tourism development best leverage this desire to reexperience the past? The Institute for New Hampshire Studies and the Center for Rural Partnerships at Plymouth State University sought to answer this question by...
Tree species migration studies in the White Mountains of New Hampshire
William B. Leak; Mariko. Yamasaki
2012-01-01
The movement of tree species in either latitude or elevation has attracted increased recent attention due to growing national/international concerns over climate change. However, studies on tree species movements began in the early 1970s in the White Mountains of New Hampshire, mostly due to ecological interests in the episodic behavior of upper-elevation tree species...
Nature and Properties of Some Forest Soils in the Mhite Mountains of New Hampshire
M.C. Hoyle; M.C. Hoyle
1973-01-01
Forested, podzol soils in the White Mountains of New Hampshire have developed in granitic, glacial material. They are coarse textured, acidic, and infertile. As a result of the latter condition, these soils can sustain a forest, but that forest is not healthy and vigorous.
33 CFR 165.106 - Security Zone: Seabrook Nuclear Power Plant, Seabrook, New Hampshire.
2010-07-01
... Guard District § 165.106 Security Zone: Seabrook Nuclear Power Plant, Seabrook, New Hampshire. (a... property boundary of Seabrook Nuclear Power Plant identified as follows: beginning at position 42°53′58″ N, 070°51′06″ W then running along the property boundaries of Seabrook Nuclear Power Plant to position 42...
2011-03-23
... enforceable emission limits on ozone precursors; any judgment about whether those emission limits discharge... attainment demonstration modeling efforts conducted by the Ozone Transport Commission. Connecticut, Maine... Implementation Plans; Connecticut, Maine, New Hampshire and Rhode Island; Infrastructure SIPs for the 1997 Ozone...
An evaluation of the Regional Mercury Cycling Model (R-MCM, a steady-state fate and transport model used to simulate mercury concentrations in lakes) is presented based on its application to a series of 91 lakes in Vermont and New Hampshire. Visual and statistical analyses are pr...
William B. Leak
2009-01-01
New England forest managers are faced with numerous environmental issues, such as global warming, nutrient depletion, and species declines that could influence the choice of appropriate silvicultural techniques and objectives. On the Bartlett Experimental Forest, New Hampshire, 70 years of change on more than 400 remeasured cruise plots by elevation classes ranging...
75 FR 53220 - Adequacy of New Hampshire Municipal Solid Waste Landfill Permit Program
2010-08-31
...] Adequacy of New Hampshire Municipal Solid Waste Landfill Permit Program AGENCY: Environmental Protection... approved municipal solid waste landfill (MSWLF) program. The approved modification allows the State to..., and demonstration (RD&D) permits to be issued to certain municipal solid waste landfills by approved...
76 FR 28022 - Hampshire Paper Company, Inc.; Notice of Availability of Environmental Assessment
2011-05-13
... DEPARTMENT OF ENERGY Federal Energy Regulatory Commission [Project No. 2850-015 New York ] Hampshire Paper Company, Inc.; Notice of Availability of Environmental Assessment In accordance with the... electronic filing, documents may also be paper-filed. To paper-file, mail an original and seven copies to...
The Green Launching Plan for New Hampshire's Environmental and Economic Future
Gittell, Ross
2010-01-01
Economic vitality and environmental protection have long been linked in New England, and will be again with efforts to address climate change in the region. There is an emerging body of literature to support the potential economic benefits of a so-called "green economy" in the region and the nation. In New Hampshire, economic studies of…
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.
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
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.
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.
National Oceanic and Atmospheric Administration, Department of Commerce — These data are an Integrated Ocean and Coastal Mapping (IOCM) Product of coastal New Hampshire. The images were acquired from a nominal altitude of 5,000 feet above...
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)
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...
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...
1980-01-01
The operational and thermal performance of the solar energy system, Contemporary-Manchester, is described. The system was designed by Contemporary Systems Incorporated to provide space heating and domestic hot water preheating for a three story dwelling located on the New Hampshire Vocational Technical College campus, Manchester, New Hampshire. The net fossil energy savings for the period from March, 1979 to February, 1980 was 14.52 million Btu. However, the performance of the system must be degraded due to the fact that the building was unoccupied throughout the data assessment and analysis period. The unoccupied status prevented the normal adjustment of heating and ventilating controls for maintenance of comfort levels within the building. This lack of occupancy also prevented the typical family hot water usage, which would have allowed for more realistic evaluation of the hot water subsystem.
Dam failure analysis/calibration using NWS models on dam failure in Alton, New Hampshire
International Nuclear Information System (INIS)
Capone, E.J.
1998-01-01
The State of New Hampshire Water Resources Board, the United States Geological Service, and private concerns have compiled data on the cause of a catastrophic failure of the Bergeron Dam in Alton, New Hampshire in March of 1996. Data collected related to the cause of the breach, the breach parameters, the soil characteristics of the failed section, and the limits of downstream flooding. Dam break modeling software was used to calibrate and verify the simulated flood-wave caused by the Bergeron Dam breach. Several scenarios were modeled, using different degrees of detail concerning the topography/channel-geometry of the affected areas. A sensitivity analysis of the important output parameters was completed. The relative importance of model parameters on the results was assessed against the background of observed historical events
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
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.
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)
2016-11-01
Petrographic Analysis of Portland Cement Concrete Cores from Pease Air National Guard Base, New Hampshire E n g in e e r R e s e a rc h a n d...id, age of the concrete being evaluated and tests performed...4 3 Preface This study was conducted in support of the Air Force Civil Engineer Center (AFCEC) to assess concrete obtained from Pease
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
The New Hampshire retail competition pilot program and the role of green marketing
Energy Technology Data Exchange (ETDEWEB)
Holt, E.A. [Ed Holt and Associates, Inc. (United States); Fang, J.M. [National Renewable Energy Lab., Golden, CO (United States)
1997-11-01
Most states in the US are involved in electric industry restructuring, from considering the pros and cons in regulatory dockets to implementing legislative mandates for full restructuring and retail access for all consumers. Several states and utilities have initiated pilot programs in which multiple suppliers or service providers may compete for business and some utility customers can choose among competing suppliers. The State of New Hampshire has been experimenting with a pilot program, mandated by the State Legislature in 1995 and implemented by the New Hampshire Public Utilities Commission (NHPUC), before it implements full retail access. Green marketing, an attempt to characterize the supplier or service provider as environmentally friendly without referring to the energy resource used to generate electricity, was used by several suppliers or service providers to attract customers. This appeal to environmental consumerism was moderately successful, but it raised a number of consumer protection and public policy issues. This issue brief examines the marketing methods used in New Hampshire and explores what green marketing might mean for the development of renewable energy generation. It also addresses the issues raised and their implications.
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.
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...
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)
Effect of climate on morphology and development of sorted circles and polygons
Czech Academy of Sciences Publication Activity Database
Uxa, Tomáš; Mida, P.; Křížek, M.
2017-01-01
Roč. 28, č. 4 (2017), s. 663-674 ISSN 1045-6740 Institutional support: RVO:67985530 Keywords : patterned ground * sorted circles and polygons * morphology * active layer * Svalbard * high Arctic Subject RIV: DE - Earth Magnetism, Geodesy, Geography OBOR OECD: Physical geography Impact factor: 2.815, year: 2016
3D Polygon Mesh Compression with Multi Layer Feed Forward Neural Networks
Directory of Open Access Journals (Sweden)
Emmanouil Piperakis
2003-06-01
Full Text Available In this paper, an experiment is conducted which proves that multi layer feed forward neural networks are capable of compressing 3D polygon meshes. Our compression method not only preserves the initial accuracy of the represented object but also enhances it. The neural network employed includes the vertex coordinates, the connectivity and normal information in one compact form, converting the discrete and surface polygon representation into an analytic, solid colloquial. Furthermore, the 3D object in its compressed neural form can be directly - without decompression - used for rendering. The neural compression - representation is viable to 3D transformations without the need of any anti-aliasing techniques - transformations do not disrupt the accuracy of the geometry. Our method does not su.er any scaling problem and was tested with objects of 300 to 107 polygons - such as the David of Michelangelo - achieving in all cases an order of O(b3 less bits for the representation than any other commonly known compression method. The simplicity of our algorithm and the established mathematical background of neural networks combined with their aptness for hardware implementation can establish this method as a good solution for polygon compression and if further investigated, a novel approach for 3D collision, animation and morphing.
Hydrobiological investigations of Kytalyk Wildlife Reserve polygonal ponds (North-Eastern Yakutia)
Nigamatzyanova, G.; Frolova, L.; Pestryakova, L.
2018-01-01
In the following article there are introduced the first researching results of 27 water bodies of polygonal tundra in Kytalyk Wildlife Reserve in the summer 2011. The evaluation of physic-hydrochemical indexes of water bodies is given. The basic structure-forming characteristics of zooplankton communities are analyzed. The ecological state of the lakes is estimated.
Directory of Open Access Journals (Sweden)
Frane Zuvela
2011-03-01
Full Text Available Inadequately adopted fundamental movement skills (FMS in early childhood may have a negative impact on the motor performance in later life (Gallahue and Ozmun, 2005. The need for an efficient FMS testing in Physical Education was recognized. The aim of this paper was to construct and validate a new FMS test for 8 year old children. Ninety-five 8 year old children were used for the testing. A total of 24 new FMS tasks were constructed and only the best representatives of movement areas entered into the final test product - FMS-POLYGON. The ICC showed high values for all 24 tasks (0.83-0.97 and the factorial analysis revealed the best representatives of each movement area that entered the FMS-POLYGON: tossing and catching the volleyball against a wall, running across obstacles, carrying the medicine balls, and straight running. The ICC for the FMS-POLYGON showed a very high result (0.98 and, therefore, confirmed the test's intra-rater reliability. Concurrent validity was tested with the use of the "Test of Gross Motor Development" (TGMD-2. Correlation analysis between the newly constructed FMS-POLYGON and the TGMD-2 revealed the coefficient of -0.82 which indicates a high correlation. In conclusion, the new test for FMS assessment proved to be a reliable and valid instrument for 8 year old children. Application of this test in schools is justified and could play an important factor in physical education and sport practice.
Subsatellite polygon for studying hydrophysical processes in the Black Sea shelf-slope zone
Zatsepin, A. G.; Ostrovskii, A. G.; Kremenetskiy, V. V.; Nizov, S. S.; Piotukh, V. B.; Soloviev, V. A.; Shvoev, D. A.; Tsibul'sky, A. L.; Kuklev, S. B.; Kukleva, O. N.; Moskalenko, L. V.; Podymov, O. I.; Baranov, V. I.; Kondrashov, A. A.; Korzh, A. O.; Kubryakov, A. A.; Soloviev, D. M.; Stanichny, S. V.
2014-01-01
The first data on the creation of the subsatellite polygon on the Black Sea shelf and continental slope in the Gelendzhik area (designed in order to permanently monitor the state of the aquatic environment and biota) and the plans for maintaining and developing this polygon are presented. The autonomous measuring systems of the polygon in the composition of bottom stations with acoustic Doppler current profilers (ADCP), Aqualog robotic profilers, and thermo-chains on moored buoy stations should make it possible to regularly obtain hydrophysical, hydrochemical, and bio-optical data with a high spatial-time resolution and transmit these data to the coastal center on a real-time basis. These field data should be used to study the characteristics and formation mechanisms of the marine environment and biota variability, as well as the water-exchange processes in the shelf-deep basin system, ocean-atmosphere coupling, and many other processes. These data are used to calibrate the satellite measurements and verify the water circulation numerical simulation. It is assumed to use these data in order to warn about the hazardous natural phenomena and control the marine environment state and its variation under the action of anthropogenic and natural factors, including climatic trends. It is planned to use the polygon subsatellite monitoring methods and equipment in other coastal areas, including other Black Sea sectors, in order to create a unified system for monitoring the Black Sea shelf-slope zone.
The growth of the mean average crossing number of equilateral polygons in confinement
International Nuclear Information System (INIS)
Arsuaga, J; Borgo, B; Scharein, R; Diao, Y
2009-01-01
The physical and biological properties of collapsed long polymer chains as well as of highly condensed biopolymers (such as DNA in all organisms) are known to be determined, at least in part, by their topological and geometrical properties. With this purpose of characterizing the topological properties of such condensed systems equilateral random polygons restricted to confined volumes are often used. However, very few analytical results are known. In this paper, we investigate the effect of volume confinement on the mean average crossing number (ACN) of equilateral random polygons. The mean ACN of knots and links under confinement provides a simple alternative measurement for the topological complexity of knots and links in the statistical sense. For an equilateral random polygon of n segments without any volume confinement constrain, it is known that its mean ACN (ACN) is of the order 3/16 n log n + O(n). Here we model the confining volume as a simple sphere of radius R. We provide an analytical argument which shows that (ACN) of an equilateral random polygon of n segments under extreme confinement (meaning R 2 ). We propose to model the growth of (ACN) as a(R)n 2 + b(R)nln(n) under a less-extreme confinement condition, where a(R) and b(R) are functions of R with R being the radius of the confining sphere. Computer simulations performed show a fairly good fit using this model.
Polygon construction to investigate melting in two-dimensional strongly coupled dusty plasma
International Nuclear Information System (INIS)
Ruhunusiri, W. D. Suranga; Goree, J.; Feng Yan; Liu Bin
2011-01-01
The polygon construction method of Glaser and Clark is used to characterize melting and crystallization in a two-dimensional (2D) strongly coupled dusty plasma. Using particle positions measured by video microscopy, bonds are identified by triangulation, and unusually long bonds are deleted. The resulting polygons have three or more sides. Geometrical defects, which are polygons with more than three sides, are found to proliferate during melting. Pentagons are found in liquids, where they tend to cluster with other pentagons. Quadrilaterals are a less severe defect, so that disorder can be characterized by the ratio of quadrilaterals to pentagons. This ratio is found to be less in a liquid than in a solid or a superheated solid. Another measure of disorder is the abundance of different kinds of vertices, according to the type of polygons that adjoin there. Unexpectedly, spikes are observed in the abundance of certain vertex types during rapid temperature changes. Hysteresis, revealed by a plot of a disorder parameter vs temperature, is examined to study sudden heating. The hysteresis diagram also reveals features suggesting a possibility of latent heat in the melting and rapid cooling processes.
Knot probability of polygons subjected to a force: a Monte Carlo study
International Nuclear Information System (INIS)
Rensburg, E J Janse van; Orlandini, E; Tesi, M C; Whittington, S G
2008-01-01
We use Monte Carlo methods to study the knot probability of lattice polygons on the cubic lattice in the presence of an external force f. The force is coupled to the span of the polygons along a lattice direction, say the z-direction. If the force is negative polygons are squeezed (the compressive regime), while positive forces tend to stretch the polygons along the z-direction (the tensile regime). For sufficiently large positive forces we verify that the Pincus scaling law in the force-extension curve holds. At a fixed number of edges n the knot probability is a decreasing function of the force. For a fixed force the knot probability approaches unity as 1 - exp(-α 0 (f)n + o(n)), where α 0 (f) is positive and a decreasing function of f. We also examine the average of the absolute value of the writhe and we verify the square root growth law (known for f = 0) for all values of f
Complete coverage path planning of a random polygon - A FroboMind component
DEFF Research Database (Denmark)
Aslund, Sebastian; Jensen, Kjeld; Jørgensen, Rasmus Nyholm
solution where all the steps in the process is included: Segmentation of a data set, creation of a configuration space, decomposition of a polygon, global and local path planning. To achieve this, a series of known algorithms are used including some tweaks and improvements to create a solid foundation...
On the Berry-Esséen bound of frequency polygons for ϕ-mixing samples.
Huang, Gan-Ji; Xing, Guodong
2017-01-01
Under some mild assumptions, the Berry-Esséen bound of frequency polygons for ϕ -mixing samples is presented. By the bound derived, we obtain the corresponding convergence rate of uniformly asymptotic normality, which is nearly [Formula: see text] under the given conditions.
Behavior of the polygonal HEPA filter exposed to water droplets carried by the offgas flow
International Nuclear Information System (INIS)
Jannakos, K.; Potgeter, G.; Legner, W.
1991-01-01
A polygonal high-efficiency particulate air (HEPA) filter element has been developed and tested with a view to cleaning the dissolver offgas from reprocessing plants. It is likewise suited to filter process offgases generated in other plants. Due to its high dew point (about 30 degree C) the dissolver offgas, before being directed into the HEPA filter, is heated with a gas heater to approx. 100 degree C so that condensation in the pipework upstream of the filter and in the filter proper is avoided. In case of failure of the heater the offgas may undergo condensation upstream of the HEPA filter until it is bypassed to a standby heater or a standby filter system. Consequently, the filter may be loaded with water droplets. therefore, experiments have been performed with a view to estimating the behavior of the polygonal filter element when exposed to condensate droplets in a real plant. According to the experiments performed so far it can be anticipated that in case of failure of the heater the amount of condensate produced until bypassing to a standby system will not damage a new or little loaded polygonal filter element. The experiments will be carried on with the goal of investigating the behavior of a heavily loaded polygonal filter element exposed to water droplets
DEFF Research Database (Denmark)
Breinbjerg, Olav
1992-01-01
An approach for including higher order edge diffraction in the equivalent edge current (EEC) method is proposed. This approach, which applies to monostatic as well as bistatic radar configurations with perfectly conducting polygonal plates, involves three distinct sets of EECs. All of these sets...
Pizza Again? On the Division of Polygons into Sections with a Common Origin
Sinitsky, Ilya; Stupel, Moshe; Sinitsky, Marina
2018-01-01
The paper explores the division of a polygon into equal-area pieces using line segments originating at a common point. The mathematical background of the proposed method is very simple and belongs to secondary school geometry. Simple examples dividing a square into two, four or eight congruent pieces provide a starting point to discovering how to…
Range-efficient consistent sampling and locality-sensitive hashing for polygons
DEFF Research Database (Denmark)
Gudmundsson, Joachim; Pagh, Rasmus
2017-01-01
Locality-sensitive hashing (LSH) is a fundamental technique for similarity search and similarity estimation in high-dimensional spaces. The basic idea is that similar objects should produce hash collisions with probability significantly larger than objects with low similarity. We consider LSH for...... or union of a set of preprocessed polygons. Curiously, our consistent sampling method uses transformation to a geometric problem....
Total curvature and total torsion of knotted random polygons in confinement
Diao, Yuanan; Ernst, Claus; Rawdon, Eric J.; Ziegler, Uta
2018-04-01
Knots in nature are typically confined spatially. The confinement affects the possible configurations, which in turn affects the spectrum of possible knot types as well as the geometry of the configurations within each knot type. The goal of this paper is to determine how confinement, length, and knotting affect the total curvature and total torsion of random polygons. Previously published papers have investigated these effects in the unconstrained case. In particular, we analyze how the total curvature and total torsion are affected by (1) varying the length of polygons within a fixed confinement radius and (2) varying the confinement radius of polygons with a fixed length. We also compare the total curvature and total torsion of groups of knots with similar complexity (measured as crossing number). While some of our results fall in line with what has been observed in the studies of the unconfined random polygons, a few surprising results emerge from our study, showing some properties that are unique due to the effect of knotting in confinement.
Rancan, Marzio; Tessarolo, Jacopo; Casarin, Maurizio; Zanonato, Pier Luigi; Quici, Silvio; Armelao, Lidia
2014-07-21
A constitutional dynamic library (CDL) of Cu(II) metallo-supramolecular polygons has been studied as a bench test to examine an interesting selection case based on molecular recognition. Sorting of the CDL polygons is achieved through a proper guest that is hosted into the triangular metallo-macrocycle constituent. Two selection mechanisms are observed, a guest induced path and a guest templated self-assembly (virtual library approach). Remarkably, the triangular host can accommodate several guests with a degree of selectivity ranging from ∼1 to ∼10(4) for all possible guest pairs. A double level selection operates: guests drive the CDL toward the triangular polygon, and, at the same time, this is able to pick a specific guest from a set of competitive molecules, according to a selectivity-affinity correlation. Association constants of the host-guest systems have been determined. Guest competition and exchange studies have been analyzed through variable temperature UV-Vis absorption spectroscopy and single crystal X-ray diffraction studies. Molecular structures and electronic properties of the triangular polygon and of the host-guest systems also have been studied by means of all electrons density functional theory (DFT) and time-dependent density functional theory (TDDFT) calculations including dispersive contributions. DFT outcomes ultimately indicate the dispersive nature of the host-guest interactions, while TDDFT results allow a thorough assignment of the host and host-guests spectral features.
Pixels, Blocks of Pixels, and Polygons: Choosing a Spatial Unit for Thematic Accuracy Assessment
Pixels, polygons, and blocks of pixels are all potentially viable spatial assessment units for conducting an accuracy assessment. We develop a statistical population-based framework to examine how the spatial unit chosen affects the outcome of an accuracy assessment. The populati...
An Investigation of K-8 Preservice Teachers' Concept Images and Mathematical Definitions of Polygons
Ward, Robin A.
2004-01-01
In this paper, the author presents a study which explored K-8 preservice teachers' concept images and mathematical definitions of polygons. This study was carried out in which K-8 teacher candidates enrolled in an elementary mathematics content course were asked to sort, identify, and provide definitions of such shapes including triangles,…
Self-Assembly of Flux-Closure Polygons from Magnetite Nanocubes.
Szyndler, Megan W; Corn, Robert M
2012-09-06
Well-defined nanoscale flux-closure polygons (nanogons) have been fabricated on hydrophilic surfaces from the face-to-face self-assembly of magnetite nanocubes. Uniform ferrimagnetic magnetite nanocubes (∼86 nm) were synthesized and characterized with a combination of electron microscopy, diffraction, and magnetization measurements. The nanocubes were subsequently cast onto hydrophilic substrates, wherein the cubes lined up face-to-face and formed a variety of polygons due to magnetostatic and hydrophobic interactions. The generated surfaces consist primarily of three- and four-sided nanogons; polygons ranging from two to six sides were also observed. Further examination of the nanogons showed that the constraints of the face-to-face assembly of nanocubes often led to bowed sides, strained cube geometries, and mismatches at the acute angle vertices. Additionally, extra nanocubes were often present at the vertices, suggesting the presence of external magnetostatic fields at the polygon corners. These nanogons are inimitable nanoscale magnetic structures with potential applications in the areas of magnetic memory storage and high-frequency magnetics.
(2+1) gravity for higher genus in the polygon model
Kádár, Zoltán; Loll, R.
2004-01-01
We construct explicitly a (12g − 12)-dimensional space P of unconstrained and independent initial data for ’t Hooft’s polygon model of (2+1) gravity for vacuum spacetimes with compact genus-g spacelike slices, for any g ≥ 2. Our method relies on interpreting the boost parameters of the gluing