The work discussed in this article concentrates on applying a laser range finder instead of a silicon retina. The laser range finder is maximal focused at any time, but therefore a lowresolution total-scene-image, available with camera-like devices from scratch on, cannot be used here. By adapting a couple of algorithms, the edge-scanning module steering the laser range finder is able to trace ...

In this paper we are concerned with knight’s tours on high-dimensional boards. Our main aim is to show that on the d-dimensional board [n], with n even, there is always a knight’s tour provided that n is sufficiently large. In fact, we give an exact classification of the grids [n1] × . . . × [nd] in which there is a knight’s tour. This answers questions of DeMaio, DeMaio and Mathew, and Watkins.

This report presents an automatic method for recognition of paintings in a museum. The developed method recognizes the given input picture among 33 classes of paintings and provides the name of the painting as output. The proposed method can be used as an interactive museum guide, which provides more information of the paining to the visitors.

Even when the Global Positioning System (GPS) signal is blocked, a rate gyroscope (gyro) north finder is capable of providing the required azimuth reference information to a certain extent. In order to measure the azimuth between the observer and the north direction very accurately, we propose a multi-position non-continuous rotation gyro north finding scheme. Our new generalized mathematical m...

The TSP (traveling salesman problem) is one of the typical NP-hard problems in combinatorial optimization problem. The fast and effective approximate algorithms are needed to solve the large-scale problem in reasonable computing time. The known approximate algorithm can not give a good enough tour for the larger instance in reasonable time. So an algorithm called multilevel reduction algorithm ...