Three centuries ago, Isaac Newton reported the experimental observation of tunnelling a light ray between two prisms separated by small gap once one them was shinned in total internal reflection. This article describes modern revisit this seminal Newton’s experiment, generally known as Frustrated Total Internal Reflection. experiment created framework series lectures about near-field optics and...

The present study was a part of a long time screening experiment that includeda high number of wheat landraces (Triticum aestivum L.) cultivated in Greece, andfocused on the agronomic point of view and the drought adaptation for some ofthese landraces. One of the most acceptable ways for the assessment of droughtresistance is the examination of yield and yield components in different waterregim...

Abstract. We consider point location in Delaunay triangulations with the aid of simple data structures. In particular, we analyze methods in which a simple data structure is used to first locate a point close to the query point. For points uniformly distributed on the unit square, we show that the expected point location complexities are Θ( √ n) for the Green-Sibson rectilinear search, Θ(n) for...

The k differences approximate string matching problem specifies a text string of length n, a pattern string of length m, the number k of differences (insertions, deletions, substitutions) allowed in a match, and asks for every location in the text where a match occurs. Previous algorithms require at least O(nk) time. When k is as large as a fraction of m, no substantial progress has been made o...

Emergency-vehicle drivers who aim to reach their destinations through the fastest possible routes cannot rely solely on expected average travel times. Instead, the drivers should combine this travel-time information with the characteristics of data variation and then select the best or optimal route. The problem can be formulated on a graph in which the origin point and destination point are gi...

Timed automata are a simple natural model of computation for the specification of timed behaviors [1]. They are finite automata extended with clocks, i.e. real-valued variables that increase with the passage of time. Timed automata have been used in a wide range of applications where real-time aspects of computation is important, and they are supported by a variety of efficient tools and model-...