Today, great observatories around the world, devote a substantial amount of observing time to sky surveys. The resulted images are inputs of source finder modules. These modules search for the target objects and provide us with source catalogues. We sought to quantify the ability of detection tools in recovering faint galaxies regularly encountered in deep surveys. Our approach was based on com...

model [2] has been generally considered in both computer graphics and computer vision areas as a good Since the surface reflectance is a function of the geophysics-based model to describe the specular reflecmetrical components and the physical surface chartion of rough surfaces. However, since this model is acteristics, the reflectance parameters can be esticomplicated in nature, the simplified...

An 8-bit programmable square finder cum frequency divider architecture is presented. This special architecture includes a high speed parallel counter, clock trigger circuit, eight bit multiplier logic, sequence termination logic and sequence restarter logic. The entire architecture is divided into two parts: The frequency divider section and the square finder section. The frequency divider circ...

BACKGROUND On 8 October 2008, members of a tour group experienced diarrhea and vomiting throughout an airplane flight from Boston, Massachusetts, to Los Angeles, California, resulting in an emergency diversion 3 h after takeoff. An investigation was conducted to determine the cause of the outbreak, assess whether transmission occurred on the airplane, and describe risk factors for transmission....

We consider the problem of allocating the cost of an optimal traveling salesman tour in a fair way among the nodes visited; in particular, we focus on the case where the distance matrix of the underlying TSP problem satisses the triangle inequality. We thereby use the model of TSP games in the sense of cooperative game theory. We give examples showing that the core of such games may be empty, e...

Let H be a k-uniform hypergraph, k > 2. By an Euler tour in H we mean an alternating sequence v0, e1, v1, e2, v2, . . . , vm−1, em, vm = v0 of vertices and edges in H such that each edge of H appears in this sequence exactly once and vi−1, vi ∈ ei, vi−1 6= vi, for every i = 1, 2, . . . ,m. This is an obvious generalization of the graph theoretic concept of an Euler tour. A straightforward neces...

Touring is a popular but time-consuming activity, due to the need to identify interesting attractions or Places-of-Interest (POIs) and structure these POIs in the form of a timeconstrained tour itinerary. To solve this challenge, we propose the Personalized Tour Recommendation and Planning (PersTour) system. The PersTour system is able to plan for a customized tour itinerary where the recommend...

We propose a learning algorithm for solving the traveling salesman problem based on a simple strategy of trial and adaptation: i) A tour is selected by choosing cities probabilistically according to the “synaptic” strengths between cities. ii) The “synaptic” strengths of the links that form the tour are then enhanced (reduced) if the tour length is shorter (longer) than the average result of th...

One of the important problems studied in the area of travel behavior analysis is travel mode choice which is one of the four crucial steps in transportation demand estimation for urban planning. State of the art models in travel demand modelling can be classified as trip based; tour based; and activity based. In trip based approach, each individual trips is modelled as independent and isolated ...