We present a deterministic algorithm that given a tree T with n vertices, a starting vertex v and a slackness parameter ǫ > 0, estimates within an additive error of ǫ the cover and return time, namely, the expected time it takes a simple random walk that starts at v to visit all vertices of T and return to v. The running time of our algorithm is polynomial in n/ǫ, and hence remains polynomial i...

The return of human space missions to the Moon puts Earth–Moon system (EMS) at center attention. Hence, studying periodic solutions circular restricted three-body problem (CR3BP) is crucial ease transfer computations, find new solutions, or better understand these orbits. This work proposes a novel continuation method families using differential algebra (DA) mapping. We exploit DA with automati...

We introduce a new geometric approach to Sturmian words by means of a mapping that associates certain lines in the n× n-grid and sets of finite Sturmian words of length n. Using this mapping, we give new proofs of the formulas enumerating the finite Sturmian words and the palindromic finite Sturmian words of a given length. We also give a new proof for the well-known result that a factor of a S...

Semantic matching of schemas in heterogeneous data sharing systems is time consuming and error prone. Existing mapping tools employ semi-automatic techniques for mapping two schemas at a time. In a large-scale scenario, where data sharing involves a large number of data sources, such techniques are not suitable. In this paper we present a method, which creates a mediated schema tree from a larg...

Semantic matching of schemas in heterogeneous data sharing systems is time consuming and error prone. Existing mapping tools employ semi-automatic techniques for mapping two schemas at a time. In a large-scale scenario, where data sharing involves a large number of data sources, such techniques are not suitable. In this paper we present a method, which creates a mediated schema tree from a larg...

In real time applications, biometric authentication has been widely regarded as the most foolproof or at least the hardest to forge or spoof. Several research works on face recognition based on appearance, features like intensity, color, textures or shape have been done over the last decade. In those works, mostly the classification is achieved by using the similarity measurement techniques tha...