In this paper, a new method is presented for encryption of colored images. This method is based on using stack data structure and chaos which make the image encryption algorithm more efficient and robust. In the proposed algorithm, a series of data whose range is between 0 and 3 is generated using chaotic logistic system. Then, the original image is divided into four subimages, and these four i...

in order to evaluate the effect of different planting patterns and different varieties of corn on quantity management in 2015 as a split-plot in a randomized complete block with 3 replications. the test pattern as the main factor in two levels in the atmosphere and the stack corn hybrids in four sub-levels maxima, asv3, magi 704 and 400 were hybrids. the effect of planting pattern, the maximum ...

The four different types of stack filters, type-0 through type-3, are determined by four different shapes of the on-set of the positive Boolean function from which the stack filter is constructed. Under all three appending strategies commonly considered in the literature---first and last value carry-on strategy, constant value carry-on strategy, and the circular approach--stack filters of type-...

This paper presents the work done by the group of authors in the framework of the N 3 project, sponsored by Bell Labs/Lucent Technologies, since April, 1997. N 3 is a protocol stack for the provision of native services over networks that belong to the NBMA (Non Broadcasting Medium Access) family, like ATM, ISDN, etc. N 3 resembles an alternative way to networking, rather than traditional MAC/IP...

The four direrent types of stack filters, type-0 through type-3, are determined by four dfferent shapes of the on-set of the positive Boolean function from which the stack filter is constructed. Under all three appending strategies commonly considered in the literature --first and last value carry on strategy, constant value carry on strategy, and the circular approach -stack filters of type-0 ...

Robert Weida and Diane Lit-man. Terminological reasoning with constraint networks and an application to plan recognition. In Proc. (a)g where S { called the Step Interpretation { is a function associating a newly generated function to each interval introduced by a decomposition operator. The representation of the Double-Stack plan in the extended language is: Double-Stack : = 3(x y) (x d ])(y d...