1.0 Introduction The contrast of a given feature at a specific wavelength of light is determined by the radiance of that feature and the radiance of the background or adjacent feature against which it is viewed. Target/Sky contrast (C) is defined as the ratio of the difference between the feature (target) and the background sky radiance to the background sky radiance: where N stands for radianc...

Let φ : C2×C2 → C, φ((x1, x2), (y1, y2)) = (x1 −y1) +(x2 −y2). We say that f : R → C preserves distance d ≥ 0 if for each x, y ∈ R φ(x, y) = d implies φ(f(x), f(y)) = d. We prove that if x, y ∈ R and |x − y| = (2 √ 2/3) · ( √ 3) (k, l are non-negative integers) then there exists a finite set {x, y} ⊆ Sxy ⊆ R such that each unit-distance preserving mapping from Sxy to C 2 preserves the distance ...

This is the project report for the Course CS573 Optimization Compilers. The goal of the project is to study the reuse distance of several of the applications included in the MediaBench Suite. 1 Methodology The reuse distance of a memory location or variable of a program is the number of individual memory references between two consecutive references to the same memory location or variable. The ...

The purpose of this letter is to define a distance on the underlying phase space of a chaotic map, based on natural invariant density of the map. It is observed that for logistic map this distance is equivalent to Wootters’ statistical distance. This distance becomes the Euclidean distance for a map with constant invariant density. ∗Postal Address: 1110, 36-C, Chandigarh -160014, India

We prove that a well-distributed subset of R 2 can have a separated distance set only if the distance is induced by a polygon. Basic definitions Separated sets. We say that S ⊂ R d is separated if there exists c separation > 0 such that ||x − y|| ≥ c separation for every x, y ∈ S, x = y. Here and throughout the paper, ||x|| = x 2 1 + · · · + x 2 d is the standard Euclidean distance. Well-distri...

The distance matrix of a simple graph G is D(G) = (di,j), where di,j is the distance between the ith and jth vertices of G. The greatest eigenvalue λ1 of D(G) is called the distance spectral radius of the graph G and is denoted by λ1(G). A simple connected graph G is called a 2-partite distance regular graph if there exists a partition V1 ∪V2 of the vertex set of G such that for i = 1, 2 and an...