The reflectance factors of transparent fibers, free delustering agent, are predicted by geometric as well as Kubelka-Munk models. Transparent fibers are simulated by a net of glass capillary tubes containing different solutions of dyestuffs. Based on the results, prediction of the reflectance factor of capillary net by geometric model is relatively better than those obtained from Kubelka-Munk...

In a geometric graph, G, the stretch factor between two vertices, u and w, is the ratio between the Euclidean length of the shortest path from u to w in G and the Euclidean distance between u and w. The average stretch factor of G is the average stretch factor taken over all pairs of vertices in G. We show that for any set, V , of n points in Rd , there exists a geometric graph with vertex set ...

The average ridge distance of "ngerprint images is used in many problems and applications. It is used in "ngerprint "lter design or in identi"cation and classi"cation procedures. This paper addresses the problem of local average ridge distance computation. This computation is based on a two-step procedure: "rst, the average distance is de"ned in each signi"cant portion of the image and then thi...

During inspection of 21 frozen breaded raw shrimp processors, 861 finished product units (retail packages) and 778 line samples were collected and analyzed bacteriologically. The bacteriological results for the finished product samples collected in plants with poor and good sanitary controls are presented and compared. The samples consisted of 4 to 38 units (retail packages) of the finished pro...

We define a new distance measure the resistor-average distance between two probability distributions that is closely related to the Kullback-Leibler distance. While the KullbackLeibler distance is asymmetric in the two distributions, the resistor-average distance is not. It arises from geometric considerations similar to those used to derive the Chernoff distance. Determining its relation to we...

The large-scale 3D structure of a protein can be represented by the polygonal curve through the carbon alpha atoms of the protein backbone. We introduce an algorithm for computing the average number of times that a given configuration of crossings on such polygonal curves is seen, the average being taken over all directions in space. Hereby, we introduce a new family of global geometric measure...

Consider the Delaunay triangulation T of a set P of points in the plane as a Euclidean graph, in which the weight of every edge is its length. It has long been conjectured that the dilation in T of any pair p, p′ ∈ P , which is the ratio of the length of the shortest path from p to p′ in T over the Euclidean distance ‖pp′‖, can be at most π/2 ≈ 1.5708. In this paper, we show how to construct po...

We propose a mathematical framework, based on conic geometric programming, to control a susceptible-infectedsusceptible viral spreading process taking place in a directed contact network with unknown contact rates. We assume that we have access to time series data describing the evolution of the spreading process observed by a collection of sensor nodes over a finite time interval. We propose a...

Next to the shortest path distance, the second most popular distance function between vertices in a graph is the commute distance (resistance distance). For two vertices u and v, the hitting time Huv is the expected time it takes a random walk to travel from u to v. The commute time is its symmetrized version Cuv = Huv + Hvu. In our paper we study the behavior of hitting times and commute dista...

A geometric program (GP) is a type of mathematical optimization problem characterized by objective and constraint functions that have a special form. Recently developed solution methods can solve even large-scale GPs extremely efficiently and reliably; at the same time a number of practical problems, particularly in circuit design, have been found to be equivalent to (or well approximated by) G...