a recursive-circulant $g(n; d)$ is defined to be acirculant graph with $n$ vertices and jumps of powers of $d$.$g(n; d)$ is vertex-transitive, and has some strong hamiltonianproperties. $g(n; d)$ has a recursive structure when $n = cd^m$,$1 leq c < d $ [10]. in this paper, we will find the automorphismgroup of some classes of recursive-circulant graphs. in particular, wewill find that the autom...

A technique based on fitting splines to the phase derivative curve is presented for the efficient and reliable computation of the two—dimensional complex cepstrum. The technique is an adaptive numerical integration scheme and makes use of several computational strategies within the Tribolet's phase unwrapping algorithm. An application of the complex cepstrum in testing the stability of two—dime...

Several methods have been proposed to compile recursive Datalog programs. The most well-known perform a rewriting of rules using MAGIC or PROBLEM predicates in order to push selections before recursion. Rewritten rule systems are generally complex and difficult to translate into optimized relational algebra programs. Moreover, they often generate too many results; thus, the query must be applie...

This paper presents a technique for achieving a class of optimizations related to the reduction of checks within cycles. The technique uses both Program Transformation and Abstract Interpretation. After a first pass of an abstract interpreter which detects simple invariants, program transformation is used to build a hypothetical situation that simplifies some predicates that should be executed ...

In this papr, we have minimized the effects of failures on network performace, by using suitable Routing and Wavelenghth Assignment(RWA) method without disturbing other performance criteria such as blocking probability(BP) and network management(NM). The computation complexity is reduced by using Kalaman Filter(KF) techniques. The minimum reconfiguration probability routing (MRPR) algorithm mus...

We consider the stationary memoryless channels with input cost. We prove that for transmission rates above the capacity the correct probability of decoding tends to zero exponentially as the block length n of codes tends to infinity. In the case where both of channel input and output sets are finite, we determine the optimal exponent function on the above exponential decay of the correct probab...

In this paper, a novel technique is introduced for the design of recursive digital filters in the state space form. The Roesser’s state space model has been used for the spatial domain representation of the 2-D causal recursive digital filters. This model divides the local state into a horizontal and a vertical state which are propagated in horizontal and vertical directions respectively. The d...