Feature selection has been explored extensively for use in several real-world applications. In this paper, we propose a new method to select a salient subset of features from unlabeled data, and the selected features are then adaptively used to identify natural clusters in the cluster analysis. Unlike previous methods that select salient features for clustering, our method does not require a pr...

The nearest neighbour (NN) classifier is often known as a ‘lazy’ approach but it is still widely used particularly in the systems that require pattern matching. Many algorithms have been developed based on NN in an attempt to improve classification accuracy and to reduce the time taken, especially in large data sets. This paper proposes a new classification technique based on kNearest Neighbour...

Although the cerebrovasculature is known to be exquisitely sensitive to CO(2), there is no consensus on whether the sympathetic nervous system plays a role in regulating cerebrovascular responses to changes in arterial CO(2). To address this question, we investigated human cerebrovascular CO(2) reactivity in healthy participants randomly assigned to the α(1)-adrenoreceptor blockade group (9 par...

OBJECTIVE The value of different algorithms that estimate cardiac output (CO) by analysis of a peripheral arterial blood pressure (ABP) waveform has not been definitively identified. In this investigation, we developed a testing data set containing a large number of radial ABP waveform segments and contemporaneous reference CO by thermodilution measurements, collected in an intensive care unit ...

The concept of convex polygon-offset distance function was introduced in 2001 by Barequet, Dickerson, and Goodrich. Using this notion of point-to-point distance, they showed how to compute the corresponding nearestand farthest-site Voronoi diagram for a set of points. In this paper we generalize the polygon-offset distance function to be from a point to any convex object with respect to an m-si...

Given a set S of n static points and a free point p in the Euclidean plane, we study a new variation of the minimum enclosing circle problem, in which a dynamic weight that equals to the reciprocal of the distance from the free point p to the undetermined circle center is included. In this work, we prove the optimal solution of the new problem is unique and lies on the boundary of the farthest-...

Let A be a nonempty closed subset (resp. nonempty bounded closed subset) of a metric space (X, d) and x ∈ X \ A. The nearest point problem (resp. the farthest point problem) w.r.t. x considered here is to find a point a0 ∈ A such that d(x, a0) = inf{d(x, a) : a ∈ A} (resp. d(x, a0) = sup{d(x, a) : a ∈ A}). We study the well posedness of nearest point problems and farthest point problems in geod...

Given n point sites in the plane each painted in one of k colors, the region of a c-colored site p in the Farthest Color Voronoi Diagram (FCVD) contains all points of the plane for which c is the farthest color and p the nearest c-colored site. This novel structure generalizes both the standard Voronoi diagram (k = 1) and the farthest site Voronoi diagram (k = n). We show that the FCVD has stru...

Given a set of n colored points in some d-dimensional Euclidean space, a bichromatic closest (resp. farthest) pair is a closest (resp. farthest) pair of points of different colors. We present efficient algorithms to maintain both a bichromatic closest pair and a bichromatic farthest pair when the the points are fixed but they dynamically change color. We do this by solving the more general prob...

In this paper, we will discuss a map synthesis system which handles static information (geographic objects) as well as dynamic information (traffic conditions, weather, etc.). In addition to geographic thesauruses used in the previous systems, we will use co-existence relationships to improve the quality of maps generation. The system is considered to be general purpose (not restricted to car n...