Communication-Aware Processor Allocation for Supercomputers: Finding Point Sets of Small Average Distance

Algorithmica ◽  
2007 ◽  
Vol 50 (2) ◽  
pp. 279-298 ◽  
Author(s):  
Michael A. Bender ◽  
David P. Bunde ◽  
Erik D. Demaine ◽  
Sándor P. Fekete ◽  
Vitus J. Leung ◽  
...  
Keyword(s):  
Average Distance ◽  
Processor Allocation ◽  
Point Sets ◽  
Finding Point

On the Location of Quiescent Prominences with Respect to Coronal Holes

1979 ◽  
Vol 44 ◽  
pp. 209-213
Author(s):  
B. Rompolt
Keyword(s):  
Coronal Hole ◽  
Average Distance ◽  
Coronal Holes

The aim of this contribution is to turn attention to a peculiarity of location of the filaments (quiescent prominences) with respect to the boundaries of the coronal holes. It is generally known that quiescent prominences are located at some distance from the boundary of coronal holes. My intention was to check whether the average distance between the nearest border of a coronal hole and the prominence is comparable to the average horizontal extension of a helmet structure overlying the prominence. As well as, whether this average distance depends upon the orientation of the long axis of the prominence with respect to the nearest boundary of the coronal hole.

Almost empty polygons

2003 ◽  
Vol 40 (3) ◽  
pp. 269-286 ◽  
Author(s):  
H. Nyklová
Keyword(s):  
Exact Results ◽  
Point Sets ◽  
Planar Point ◽  
Convex Position ◽  
Vertex Set ◽  
Point Set ◽  
Empty Polygons

In this paper we study a problem related to the classical Erdos--Szekeres Theorem on finding points in convex position in planar point sets. We study for which n and k there exists a number h(n,k) such that in every planar point set X of size h(n,k) or larger, no three points on a line, we can find n points forming a vertex set of a convex n-gon with at most k points of X in its interior. Recall that h(n,0) does not exist for n = 7 by a result of Horton. In this paper we prove the following results. First, using Horton's construction with no empty 7-gon we obtain that h(n,k) does not exist for k = 2(n+6)/4-n-3. Then we give some exact results for convex hexagons: every point set containing a convex hexagon contains a convex hexagon with at most seven points inside it, and any such set of at least 19 points contains a convex hexagon with at most five points inside it.

Mobile network synthesis strategy

2019 ◽  
pp. 98-101
Author(s):  
V. Lyandres
Keyword(s):  
Average Distance ◽  
Mobile Network ◽  
Base Station ◽  
Service Area ◽  
Base Stations ◽  
Frequency Assignment ◽  
Network Synthesis ◽  
Universal Method ◽  
Synthesis Strategy ◽  
Adaptive Vector Quantization

Introduction:Effective synthesis of а mobile communication network includes joint optimisation of two processes: placement of base stations and frequency assignment. In real environments, the well-known cellular concept fails due to some reasons, such as not homogeneous traffic and non-isotropic wave propagation in the service area.Purpose:Looking for the universal method of finding a network structure close to the optimal.Results:The proposed approach is based on the idea of adaptive vector quantization of the network service area. As a result, it is reduced to a 2D discrete map split into zones with approximately equal number of service requests. In each zone, the algorithm finds such coordinates of its base station that provide the shortest average distance to all subscribers. This method takes into account the shortage of the a priory information about the current traffic, ensures maximum coverage of the service area, and what is not less important, significantly simplifies the process of frequency assignment.

An Algorithm for Extracting and Enhancing Valley-ridge Features from Point Sets

2010 ◽  
Vol 36 (8) ◽  
pp. 1073-1083 ◽  
Author(s):  
Xu-Fang PANG ◽  
Ming-Yong PANG ◽  
Chun-Xia XIAO
Keyword(s):  
Point Sets

Multifractal Analysis of Chaotic Point Sets

1992 ◽  
Author(s):  
L. V. Meisel ◽  
M. A. Johnson
Keyword(s):  
Multifractal Analysis ◽  
Point Sets

What Makes a City Bikeable? A Study of Intercity and Intracity Patterns of Bicycle Ridership using Mobike Big Data Records

2020 ◽  
Vol 46 (1) ◽  
pp. 55-75
Author(s):  
Ying Long ◽  
Jianting Zhao
Keyword(s):  
Big Data ◽  
Average Distance ◽  
Policy Implications ◽  
Rating System ◽  
City Centre ◽  
Average Score ◽  
Policy Makers ◽  
Usage Frequency ◽  
Share Data ◽  
The City

This paper examines how mass ridership data can help describe cities from the bikers' perspective. We explore the possibility of using the data to reveal general bikeability patterns in 202 major Chinese cities. This process is conducted by constructing a bikeability rating system, the Mobike Riding Index (MRI), to measure bikeability in terms of usage frequency and the built environment. We first investigated mass ridership data and relevant supporting data; we then established the MRI framework and calculated MRI scores accordingly. This study finds that people tend to ride shared bikes at speeds close to 10 km/h for an average distance of 2 km roughly three times a day. The MRI results show that at the street level, the weekday and weekend MRI distributions are analogous, with an average score of 49.8 (range 0–100). At the township level, high-scoring townships are those close to the city centre; at the city level, the MRI is unevenly distributed, with high-MRI cities along the southern coastline or in the middle inland area. These patterns have policy implications for urban planners and policy-makers. This is the first and largest-scale study to incorporate mobile bike-share data into bikeability measurements, thus laying the groundwork for further research.

ON THE GENERAL THEORY OF POINT SETS, II

1986 ◽  
Vol 12 (1) ◽  
pp. 377 ◽  
Author(s):  
Morgan
Keyword(s):  
General Theory ◽  
Point Sets

Temporal Changes in Habitat Selection and Nest Spacing in a Colony of Ross' and Lesser Snow Geese

The Auk ◽  
1983 ◽  
Vol 100 (2) ◽  
pp. 335-343 ◽  
Author(s):  
M. Robert McLandress
Keyword(s):  
Nearest Neighbor ◽  
Average Distance ◽  
Habitat Preferences ◽  
Nearest Neighbors ◽  
Nest Density ◽  
Snow Goose ◽  
Snow Geese ◽  
Lesser Snow Geese ◽  
Average Size ◽  
Island Habitats

Abstract I studied the nesting colony of Ross' Geese (Chen rossii) and Lesser Snow Geese (C. caerulescens caerulescens) at Karrak Lake in the central Arctic of Canada in the summer of 1976. Related studies indicated that this colony had grown from 18,000 birds in 1966-1968 to 54,500 birds in 1976. In 1976, geese nested on islands that were used in the late 1960's and on an island and mainland sites that were previously unoccupied. Average nest density in 1976 was three-fold greater than in the late 1960's. Consequently, the average distance to nearest neighbors of Ross' Geese in 1976 was half the average distance determined 10 yr earlier. The mean clutch size of Ross' Geese was greater in island habitats where nest densities were high than in less populated island or mainland habitats. The average size of Snow Goose clutches did not differ significantly among island habitats but was larger at island than at mainland sites. Large clutches were most likely attributable to older and/or earlier nesting females. Habitat preferences apparently differed between species. Small clutches presumably indicated that young geese nested in areas where nest densities were low. The establishment of mainland nesting at Karrak Lake probably began with young Snow Geese using peripheral areas of the colony. Young Ross' Geese nested in sparsely populated habitats on islands to a greater extent than did Snow Geese. Ross' Geese also nested on the mainland but in lower densities than Ross' Geese nesting in similar island habitats. Successful nests with the larger clutches had closer conspecific neighbors than did successful nests with smaller clutches. The species composition of nearest neighbors changed significantly with distance from Snow Goose nests but not Ross' Goose nests. Nesting success was not affected by the species of nearest neighbor, however. Because they have complementary antipredator adaptations, Ross' and Snow geese may benefit by nesting together.

scholarly journals Sparse Approximation via Generating Point Sets

2019 ◽  
Vol 15 (3) ◽  
pp. 1-16
Author(s):  
Avrim Blum ◽  
Sariel Har-Peled ◽  
Benjamin Raichel
Keyword(s):  
Sparse Approximation ◽  
Point Sets
Sign in / Sign up

Export Citation Format

Share Document