Objective: Quantum algorithm are stronger and more secure than the classical computers not because they run on faster harder but also, require fewer steps. With attackers have high computing power with quantum can easily break cryptographic system. Lattice is regularly spaced grid of points stretching to infinity. safe security algorithms resistant both attacks caused by attack computers. based...

This novel underwater acoustic azimuth-elevation source localization scheme realizes the eigenstructure-based polynomial rooting procedure for an L-shaped uniformly spaced array of diversely oriented and possibly spatially co-located velocity hydrophones and an optional pressure hydrophone. A velocity hydrophone measures a Cartesian component of the acoustic particle velocity vector of the inci...

This paper presents a spectral analysis algorithm for monitoring the characteristics of the damped oscillating “modes” which are set up after a disturbance in an electric power distribution system. This monitoring is necessary so that one can detect early whether any modes are “inverse damped” (ie. exponentially growing), and hence likely to create instability in the power system. In this appli...

This paper describes an algorithm to detect obstacles and landmarks, using the omnidirectional vision system of a RoboCup robot, to build an internal representation of the robot’s environment. The restriction to pixels corresponding to an equally spaced grid on the floor around the robot and a biologically inspired fault-tolerant colour segmentation of this grid result in a fast and robust dete...

The Euler method is a well-known numerical technique employed for solving initial value problems of ordinary differential equations. solution obtained through Euler's subject to significant inaccuracies, which tend amplify with each successive iteration. Particle Swarm Optimization (PSO) algorithm highly effective finding optimal solutions both linear and nonlinear optimization problems. In thi...

Image processing in the robotic soccer domain meets real time constraints that must be met with optimizations of the task. We are proposing a method to find objects using a non-uniformly spaced, optimally constructed grid. We are capitalizing on the fact that the apparent size of ground-based objects is related to their visible distance to the horizon. In a three-stage process, a pattern matchi...

A research testbed is described for exploring the automated layout of graphical displays. We address the problem of determining the size and position of the objects displayed to a user. Our approach is based on the graphic design concept of a design grid. A design grid is a set of proportionally-spaced vertical and horizontal lines that control the position and size of the objects being laid ou...

In this paper, we present an efficient algorithm for computing the Euclidean skeleton of an object directly from a point cloud representation on an underlying grid. The key point of this algorithm is to identify those grid points that are (approximately) on the skeleton using the closest point information of a grid point and its neighbors. The three main ingredients of the algorithm are: (1) co...