for many years, researchers have studied high accuracy methods for recognizing the handwriting and achieved many significant improvements. however, an issue that has rarely been studied is the speed of these methods. considering the computer hardware limitations, it is necessary for these methods to run in high speed. one of the methods to increase the processing speed is to use the computer pa...

I will present a way to implement graph algorithms which is different from traditional methods. This work was motivated by the belief that some ideas from software engineering should be applied to graph algorithms. Re-usability of software is an important and difficult problem in general, and this is particularly true for graph algorithms. The scientific literature demonstrates plenty of applic...

Synthetic biology is at the point where we can assemble complex systems from standard parts. This assembly needs to be done in an efficient way. There exists a number of algorithms which can aid in this process. We need a way to get these algorithms to the user easily. These algorithms also need to talk to databases and talk to DNA sequence manipulation software containing information on the ba...

We show a practical way for building wideband phase-shifting algorithms for interferometry. The idea presented combines first- and second-order quadrature filters to obtain wideband phase-shifting algorithms. These first- and second-order quadrature filters are analogous to the first- and second-order filters commonly used in communications engineering, named building blocks. We present a syste...

The quantum algorithms of Deutsch, Simon and Shor are described in a way which highlights their dependence on the Fourier transform. The general construction of the Fourier transform on an Abelian group is outlined and this provides a unified way of understanding the efficacy of the algorithms. Finally we describe an efficient quantum factoring algorithm based on a general formalism of Kitaev a...

this note introduces a new general conjecture correlating the dimensionality dt of an infinitelattice with n nodes to the asymptotic value of its wiener index w(n). in the limit of large nthe general asymptotic behavior w(n)≈ns is proposed, where the exponent s and dt are relatedby the conjectured formula s=2+1/dt allowing a new definition of dimensionality dw=(s-2)-1.being related to the topol...

We describe an approach to the derivation of correct algorithms on tree-based pointer structures. The approach is based on enriching trees in a way that allows us to model commonly-used pointer manipulations on tree structures. We provide rules which allow recursive functions on trees to be transformed into imperative algorithms on enriched trees. In addition, we provide rules which allow algor...

Many different programs are the implementation of the same algorithm. This makes the collection of algorithms a quotient of the collection of programs. Similarly, there are many different algorithms that implement the same computable function. This makes the collection of computable functions into a quotient of the collection of algorithms. Algorithms are intermediate between programs and funct...