the large amount of computation necessary for obtaining time optimal solution for moving a manipulator on specified path has made it impossible to introduce an on line time optimal control algorithm. most of this computational burden is due to calculation of switching points. in this paper a learning algorithm is proposed for finding the switching points. the method, which can be used for both ...

Trapezoid graphs are intersection graphs of trapezoids between two horizontal lines. They generalize both interval graphs and permutation graphs. Interval graphs are intersection graphs of intervals on the real line. Permutation graphs are intersection graphs of straight lines between two horizontal lines. They can be represented by a permutation diagram consisting of a pair of horizontal lines...

Combining results presented in two papers in this Monthly yields the following elementary result. Any line of best fit for the zeros of a polynomial is a line of best fit for its critical points. This note gives a generalization of results on cubic polynomials presented in [1]. Our notation will follow that paper. A line of best fit for a set of points in the plane is defined, as in [1, p. 682]...

distance relays are used to protect ehv and hv transmission lines. over the past decades many algorithms have emerged for digital distance relays. these are based on the calculation of the transmission line impedance from the relaying to fault points. in this paper a novel method for digital distance relaying is proposed. in the method the tracking procedure is implemented. the method uses the ...

In this paper, we classify the finite generalized quadrangles of order (s, t), s, t > 1, which have a line L of elation points, with the additional property that there is a line M not meeting L for which {L , M} is regular. This is a first fundamental step towards the classification of those generalized quadrangles having a line of elation points.

the block size must be O(1= p) can be found in 2]. The observation that the overlap must be O(1= p) was also communicated to the authors by Brandt. To the best of the authors' knowledge, this paper contains the rst published numerical results and analysis. REFERENCES 1] A. Brandt. Multi{level adaptive solutions to boundary{value problems. 9 The results of this analysis agree with Observation 2....

In this paper, using the best proximity theorems for an extensionof Brosowski's theorem. We obtain other results on farthest points. Finally, wedene the concept of e- farthest points. We shall prove interesting relationshipbetween the -best approximation and the e-farthest points in normed linearspaces (X; ||.||). If z in W is a e-farthest point from an x in X, then z is also a-best approximati...

background morphometric data of the frontal lobe are important for surgical planning of lesions in the frontal lobe and its surroundings. magnetic resonance imaging (mri) techniques provide suitable data for this purpose. objectives in our study, the morphometric data of mid-sagittal mri of the frontal lobe in certain age and gender groups of children have been presented. patients and methods i...

Given a positive real value δ, a set P of points along a line and a distance function d, in the movement to independence problem, we wish to move the points to new positions on the line such that for every two points pi, pj ∈ P , we have d(pi, pj) ≥ δ while minimizing the sum of movements of all points. This measure of the cost for moving the points was previously unsolved in this setting. Howe...

An algorithm for modeling a set of unordered two-dimensional points by line segments is presented. The points are modeled by highly eccentric ellipses, and line segments are extracted by the major axes of these elongated ellipses. At first, a single ellipse is fitted to points which is then iteratively split to a large number of highly eccentric ellipses to cover the set of points. Then, a merg...