Among the available chaotic modulation schemes, differential chaos shift keying (DSCK) offers the perfect noise performance. The power consumption of DCSK is high since it sends chaotic signal in both of 1 and 0 transmission, so it does not represent the optimal choice for some applications like indoor wireless sensing where power consumption is a critical issue. In this paper a novel noncoherent chaotic communication scheme called differential chaos on-off keying (DCOOK) is proposed as a solution of this problem. With the proposed scheme, the DCOOK signal have a structure similar to chaos on-off keying (COOK) scheme with improved performance in noisy and multipath channels by introducing the concept of differential coherency used in DCS

In this paper, the continuous classical boundary optimal control problem (CCBOCP) for triple linear partial differential equations of parabolic type (TLPDEPAR) with initial and boundary conditions (ICs & BCs) is studied. The Galerkin method (GM) is used to prove the existence and uniqueness theorem of the state vector solution (SVS) for given continuous classical boundary control vector (CCBCV). The proof of the existence theorem of a continuous classical boundary optimal control vector (CCBOCV) associated with the TLPDEPAR is proved. The derivation of the Fréchet derivative (FrD) for the cost function (CoF) is obtained. At the end, the theorem of the necessary conditions for optimality (NCsThOP) of this problem is stated and prov

It is known that life is as series of variety of difficult problems that individual looks
forward to overcome so as to achieve adaptation and to reach the desired aims .The transition
of the students from the school stage to the stage of the university is actually regarded a
dramatic change where students face when they enter university life that differs from what
they lived in secondary school.
The executive functions are considered the main element that participate in solving the
problems of high orders , because it involves the mental abilities that assist individual to
think and initiative as well as solving problems .
These functions include operational planning and the activated memory and inhibition of
q

         The aim of this paper is to present a method for solving of system of first order initial value problems of ordinary differential equation by a semi-analytic technique with constructing polynomial solutions for decreasing dangers of lead. The original problem is concerned using two-point osculatory interpolation with the fit equals  numbers of derivatives at the end points of an interval [0 , 1].

Aggregate production planning (APP) is one of the most significant and complicated problems in production planning and aim to set overall production levels for each product category to meet fluctuating or uncertain demand in future. and to set decision concerning hiring, firing, overtime, subcontract, carrying inventory level. In this paper, we present a simulated annealing (SA) for multi-objective linear programming to solve APP. SA is considered to be a good tool for imprecise optimization problems. The proposed model minimizes total production and workforce costs. In this study, the proposed SA is compared with particle swarm optimization (PSO). The results show that the proposed SA is effective in reducing total production costs and req

This paper presents a newly developed method with new algorithms to find the numerical solution of nth-order state-space equations (SSE) of linear continuous-time control system by using block method. The algorithms have been written in Matlab language. The state-space equation is the modern representation to the analysis of continuous-time system. It was treated numerically to the single-input-single-output (SISO) systems as well as multiple-input-multiple-output (MIMO) systems by using fourth-order-six-steps block method. We show that it is possible to find the output values of the state-space method using block method. Comparison between the numerical and exact results has been given for some numerical examples for solving different type

Traditionally, path selection within routing is formulated as a shortest path optimization problem. The objective function for optimization could be any one variety of parameters such as number of hops, delay, cost...etc. The problem of least cost delay constraint routing is studied in this paper since delay constraint is very common requirement of many multimedia applications and cost minimization captures the need to
distribute the network. So an iterative algorithm is proposed in this paper to solve this problem. It is appeared from the results of applying this algorithm that it gave the optimal path (optimal solution) from among multiple feasible paths (feasible solutions).

The Wang-Ball polynomials operational matrices of the derivatives are used in this study to solve singular perturbed second-order differential equations (SPSODEs) with boundary conditions. Using the matrix of Wang-Ball polynomials, the main singular perturbation problem is converted into linear algebraic equation systems. The coefficients of the required approximate solution are obtained from the solution of this system. The residual correction approach was also used to improve an error, and the results were compared to other reported numerical methods. Several examples are used to illustrate both the reliability and usefulness of the Wang-Ball operational matrices. The Wang Ball approach has the ability to improve the outcomes by minimi