The authors acknowledge that knowledge creation is a collaborative process by nature and attempt to leverage current IS methods and technology to recreate the classical salons that yielded philosophical discourse. Research has demonstrated physical proximity as a key indicator of both the undertaking and successful completion of research, yet this physical proximity has not shown analogous carr...

Using our photoionization code CIRRUS [1], we show that the study of proximity effect on metal elements provides a possibility of placing constraints on the spectral shape of the metagalactic UV background (MUVB). From theoretical point of view, the most optimum indicator of the spectral shape of the MUVB is the ratio O iv/O iii. Unlike previous thought, the ratio Si iv/C iv is not a good indic...

The inability to answer proximity queries efficiently for spaces of dimension d > 2 has led to the study of approximation to proximity problems. Several techniques have been proposed to address different approximate proximity problems. In this paper, we present a new and unified approach to proximity searching, which provides efficient solutions for several problems: spherical range queries, id...

Lemma 2.2. It suffices to find disjoint L,R ∈ V such that they are (1) Large in Ω(n), or more formally stated, |L||R| ≥ α(n). (2) ∆-separated for ∆ = Ω( 1 logn) Let us define what ∆-separated means so that we can formalize this notion of “farness”. Recall that a distance from a vertex i to a set S is defined as d(i, S) = minj∈S d(i, j) (distance to the closest point in the set) and a distance f...

Finding the closest or farthest line segment (line) from a point are fundamental proximity problems. Given a set S of n points in the plane and another point q, we present optimal O(n logn) time, O(n) space algorithms for finding the closest and farthest line segments (lines) from q among those spanned by the points in S. We further show how to apply our techniques to find the minimum (maximum)...

When comparing the average citation impact of research groups, universities and countries, field normalisation reduces the influence of discipline and time. Confidence intervals for these indicators can help with attempts to infer whether differences between sets of publications are due to chance factors. Although both bootstrapping and formulae have been proposed for these, their accuracy is u...

OBJECTIVES To assess the relationship between proximity to specific sports facilities and participation in the corresponding sports activities for adolescents in Germany. METHODS A sample of 1,768 adolescents aged 11-17 years old and living in 161 German communities was examined. Distances to the nearest sports facilities were calculated as an indicator of proximity to sports facilities using...

Graph analytics algorithms leverage quantifiable structural properties of the data to predict interesting concepts and relationships. The same information, however, can be represented using many different structures and the structural properties observed over particular representations do not necessarily hold for alternative structures. Because these algorithms tend to be highly effective over ...