An effort is made to minimize the arithmetic intricacy of signal by using the VHDL module on FPGA. A curve fitting algorithm is used for finding the fundamental frequency of a given signal. Modification of algorithm is reducing the arithmetic complex-city become extinct the cubic solution. This is mature a fast approach for the signal processing and reduced the resultant error .This is made a c...

The principle of least authority states that each component of the system should be given authority to access only the information and resources that it needs for its operation. This principle is fundamental to the secure design of software systems, as it helps to limit an application’s attack surface and to isolate vulnerabilities and faults. Unfortunately, current programming languages do not...

various methods for parametric interpolation of nurbs curves have been proposed in the past. however, the errors caused by the approximate nature of the nurbs interpolator were rarely taken into account. this paper proposes an integrated look-ahead algorithm for parametric interpolation along nurbs curves. the algorithm interpolates the sharp corners on the curve with the pythagorean-hodograph ...

let $alpha$ be an endomorphism and $delta$ an $alpha$-derivationof a ring $r$.  in this paper we  study the relationship between an$r$-module $m_r$ and the  general polynomial module  $m[x]$ over theskew polynomial ring $r[x;alpha,delta]$. we introduce the notionsof skew-armendariz modules and skew quasi-armendariz modules whichare generalizations of $alpha$-armendariz modules and extend thecla...

Let $R$ be a commutative ring with identity and $M$ be an unitary $R$-module. The intersection graph of an $R$-module $M$, denoted by $Gamma(M)$, is a simple graph whose vertices are all non-trivial submodules of $M$ and two distinct vertices $N_1$ and $N_2$ are adjacent if and only if $N_1cap N_2neq 0$. In this article, we investigate the concept of a planar intersection graph and maximal subm...

We prove that ifM is a compact 4-manifold provided with a handle decomposition with 1-skeleton X , and if G is a finite crossed module, then the number of crossed module morphisms from the fundamental crossed module Π2(M,X , ∗) = (π1(X , ∗), π2(M,X , ∗), ∂, ⊲) into G can be re-scaled to a manifold invariant IG (i. e. not dependent on the choice of 1-skeleton), a construction similar to David Ye...

Let G be a connected reductive algebraic group defined over an algebraically closed field of characteristic p > 0. Our first aim in this note is to give concise and uniform proofs for two fundamental and deep results in the context of Serre’s notion of G-complete reducibility, at the cost of less favourable bounds. Here are some special cases of these results: Suppose that the index (H : H◦) is...

We propose an optoelectronic parallel-matching architecture (PMA) that provides powerful processing capability for distributed algorithms comparing with traditional parallel computing architectures. The PMA is composed of a parallel-matching (PM) module and multiple processing elements (PE's). The PM module is implemented by a large-fan-out free-space optical interconnection and parallel-matchi...

We propose an optoelectronic parallel-matching architecture (PMA) that provides powerful processing capabilities in global processing compared with conventional parallel-computing architectures. The PMA is composed of a global processor called a parallel-matching (PM) module and multiple processing elements (PE's). The PM module is implemented by a large-fan-out free-space optical interconnecti...

Two decision problems are very close in spirit: module checking of CTL/CTL* and model checking of ATL/ATL*. The latter appears to be a natural multi-agent extension of the former, and it is commonly believed that model checking of ATL(*) subsumes module checking of CTL(*) in a straightforward way. Perhaps because of that, the exact relationship between the two has never been formally establishe...