One of several major contributions of Edmonds to combinatorial optimization is algorithms and polyhedral theorems for matroid intersection, and more generally polymatroid intersection. From an optimization point of view, the matroid intersection problem is the following: Let M1 = (S, I1) and M2 = (S, I2) be two matroids on the same ground set S. Then I1 ∩ I2 is the collection of all sets that a...

Let X be a nonempty, compact, convex set in R and let f be an upper semicontinuous mapping from X to the collection of nonempty, compact, convex subsets of R. It is well known that such a mapping has a stationary point on X; i.e., there exists a point X such that its image under f has a nonempty intersection with the normal cone of X at the point. In the case where, for every point in X, it hol...

This paper proposes a method for buildings change detection. Vertical edges of buildings are extracted in pairs of aerial images respectively, taking advantage of the character that vertical edges intersect at their vanishing point without fail. The ground coordinates of the vertices on each vertical edge are calculated according to projection difference and the principle of frontage intersecti...

Uncontrolled intersections are the intersections where there are no external signs or signals to control the movement of vehicles. In mixed traffic conditions priority rules are often violated by the road users. In All-way-stop-controlled intersections (AWSC), the vehicle should stop themselves before they enter the intersection and should check whether any vehicles are present in the other app...

In this paper, we introduce a new concept of volumes difference function of the projection and intersection bodies. Following this, we establish the Minkowski and Brunn-Minkowski inequalities for volumes difference function of the projection and intersection bodies.