of articles on ' Epidemic Dropsy '??the burning question of the day?even in the remotest villages. The treatment indicated is tincture ephedra vulgaris for the heart, which is analogous to the action of adrenalin and so will accelerate the heart. What should be done in the following case of epidemic dropsy? (1) Patient, aged 7 years; history of beri-beri? three months. (2) Sudden dilatation of ...

Mars topographic data, such as digital orthophoto maps (DOMs) and digital elevation models (DEMs) are essential to planetary science and exploration missions. The main objective of our study is to generate a higher resolution DEM using the Mars Express (MEX) High Resolution Stereo Camera (HRSC). This paper presents a novel pixel-level image matching method for HRSC linear pushbroom imagery. We ...

We study the problem of finding a minimum spanning tree on the complete graph on n points in E' , with the weight of an edge between any two points being the distance between the two points under some distance metric. A fast algorithm, which finds an approximate minimum spanning tree with wei h t a t most (1+c) times optimal in developed for the L,, q =2,3, ..., distance metrics. Moreover, if t...

Borrowing concepts from linear algebra and convex analysis, it has been shown how the feasible set for a general vector optimization problem can be mapped under a linear transformation so that Pareto points in the image correspond to nondominated solutions for the original problem. The focus of this paper is to establish corresponding results for approximate nondominated points, based on a new ...

This paper presents a piecewise cubic approximation method with approximate G1 continuity. For a given triangular mesh of points with arbitrary topology, one cubic triangular Bézier patch surface is constructed. The resulting surfaces have G1 continuity at the vertex points, but only requires approximate G1 continuity along the macro-patch boundaries so as to lower the patch degree. While our s...

We present LPI, a novel approach for finding approximate shortest paths in weighted graphs. The basis of the algorithm is the presence of landmarks placed at vertices throughout the graph. Each landmark stores the shortest path from itself to all other vertices. LPI works by searching the intersection points along the landmark paths to approximate a path between two points. We show that the pat...

Throughout, X stands for a real Banach space, SX for its unit sphere, X ∗ for its topological dual, and 〈·, ·〉 for the duality pairing. All the functions f : X → R∪{+∞} are lower semicontinuous. The Clarke subdifferential , the Hadamard subdifferential and the Fréchet subdifferential of f are respectively denoted by ∂Cf , ∂Hf and ∂F f . The Zagrodny two points mean value inequality has proved t...