Microsoft Word - Finding More Non-supersingular Elliptic Curves for Pairing..
ثبت نشده
چکیده
In this paper, a model of self-organizing spiking neural networks is introduced and applied to mobile robot environment representation and path planning problem. A network of spike-response-model neurons with a recurrent architecture is used to create robot’s internal representation from surrounding environment. The overall activity of network simulates a self-organizing system with unsupervised learning. A modified A* algorithm is used to find the best path using this internal representation between starting and goal points. This method can be used with good performance for both known and unknown environments. Keywords—Mobile Robot, Path Planning, Self-organization, Spiking Neural Networks.
منابع مشابه
Microsoft Word - Finding More Non-supersingular Elliptic Curves for Pairing..
In this paper, an effective sliding mode design is applied to chaos synchronization. The proposed controller can make the states of two identical modified Chua’s circuits globally asymptotically synchronized. Numerical results are provided to show the effectiveness and robustness of the proposed method. Keywords—Sliding mode, Chaos synchronization, Modified Chua’s circuit.
متن کاملFinding More Non-Supersingular Elliptic Curves for Pairing-Based Cryptosystems
Finding suitable non-supersingular elliptic curves for pairing-based cryptosystems becomes an important issue for the modern public-key cryptography after the proposition of id-based encryption scheme and short signature scheme. In previous work different algorithms have been proposed for finding such elliptic curves when embedding degree k ∈ {3, 4, 6} and cofactor h ∈ {1, 2, 3, 4, 5}. In this ...
متن کاملMicrosoft Word - Finding More Non-supersingular Elliptic Curves for Pairing..
Machine Translation, (hereafter in this document referred to as the "MT") faces a lot of complex problems from its origination. Extracting multiword expressions is also one of the complex problems in MT. Finding multiword expressions during translating a sentence from English into Urdu, through existing solutions, takes a lot of time and occupies system resources. We have designed a simple rela...
متن کاملMicrosoft Word - Finding More Non-supersingular Elliptic Curves for Pairing..
This Classifying Bird Sounds (chip notes) project’s purpose is to reduce the unwanted noise from recorded bird sound chip notes, design a scheme to detect differences and similarities between recorded chip notes, and classify bird sound chip notes. The technologies of determining the similarities of sound waves have been used in communication, sound engineering and wireless sound applications f...
متن کاملMicrosoft Word - Finding More Non-supersingular Elliptic Curves for Pairing..
Steganography is the art of hiding and transmitting data through apparently innocuous carriers in an effort to conceal the existence of the data. A lot of steganography algorithms have been proposed recently. Many of them use the digital image data as a carrier. In data hiding scheme of halftoning and coordinate projection, still image data is used as a carrier, and the data of carrier image ar...
متن کاملMicrosoft Word - Finding More Non-supersingular Elliptic Curves for Pairing..
Multicarrier code-division multiple-access is one of the effective techniques to gain its multiple access capability, robustness against fading, and to mitigate the ISI.In this paper, we propose an improved mulcarrier CDMA system with adaptive subchannel allocation. We analyzed the performance of our proposed system in frequency selective fading environment with narrowband interference existing...
متن کامل