different discrete models of population dynamics of certain insects have been investigated under various feasible conditions within the framework of nonlinear dynamics. evolutionary phenomena are discussed through bifurcation analysis leading to chaos. some tools of nonlinear dynamics, such as lyapunov characteristic exponents (lce), lyapunov numbers, correlation dimension, etc. are calculated ...

‎given an integer $n$‎, ‎we denote by $mathfrak b_n$ and $mathfrak c_n$ the classes of all groups $g$ for which the map $phi_{n}:gmapsto g^n$ is a monomorphism and an epimorphism of $g$‎, ‎respectively‎. ‎in this paper we give a characterization for groups in $mathfrak b_n$ and for groups in $mathfrak c_n$‎. ‎we also obtain an arithmetic description of the set of all integers $n$ such that a gr...

Observational learning algorithm is an ensemble algorithm where each network is initially trained with a bootstrapped data set and virtual data are generated from the ensemble for training. Here we propose a modular OLA approach where the original training set is partitioned into clusters and then each network is instead trained with one of the clusters. Networks are combined with different wei...

This paper presents the application of three optimization algorithms to increase chaotic behavior fractional order Chen system. is achieved by optimizing maximum Lyapunov exponent (MLE). The applied techniques are evolutionary (EAs), namely: differential evolution (DE), particle swarm (PSO), and invasive weed (IWO). In each algorithm, process performed using 100 individuals generations from 50 ...

We find a bound for the exponent of the Schur multiplier of a finite p-group in terms of the exponent and Engel length of the given group. It is also proved that if G is a 3-Engel group of finite exponent, then the exponent of H2(G) divides exp G. When G is a 4-Engel group of exponent e, the exponent of H2(G) divides 10e.

A novel optimization technique which is developed on mimicking the collective animal behaviour (CAB) is applied for the optimal design of hyper beamforming of linear antenna arrays. Hyper beamforming is based on sum and difference beam patterns of the array, each raised to the power of a hyperbeam exponent parameter. The optimized hyperbeam is achieved by optimization of current excitation weig...

The proliferation of multimedia and the advent of the Internet and other public networks have created many new applications of information hiding in multimedia security and forensics. This dissertation focuses on two of these application scenarios: steganography (and its counter problem, steganalysis), and fingerprinting. First, from a detection-theoretic perspective, we quantify the detectabil...

Power law cumulative frequency (P) versus event size (l) distributions P > or =l) approximately l(-alpha) are frequently cited as evidence for complexity and serve as a starting point for linking theoretical models and mechanisms with observed data. Systems exhibiting this behavior present fundamental mathematical challenges in probability and statistics. The broad span of length and time scale...

We derive a lower and upper bound on the reliability function of discrete memoryless multiple-access channel (MAC) with noiseless feedback and variable-length codes (VLCs). The bounds are similar to the one for point-to-point channels, increasing linearly with respect to an appropriate distance between the rate pair and the capacity boundary. For the lower bound on the error exponent, we adapt ...

This paper investigates delay-distortion-power trade offs in transmission of quasi-stationary sources over block fading channels by studying encoder and decoder buffering techniques to smooth out the source and channel variations. Four source and channel coding schemes that consider buffer and power constraints are presented to minimize the reconstructed source distortion. The first one is a hi...