A method for Approximated evaluation of linear functional differential equations is described. where a function approximation as a linear combination of a set of orthogonal basis functions which are chebyshev functions .The coefficients of the approximation are determined by (least square and Galerkin’s) methods. The property of chebyshev polynomials leads to good results , which are demonstrated with examples.

The theory of probabilistic programming  may be conceived in several different ways. As a method of programming it analyses the implications of probabilistic variations in the parameter space of linear or nonlinear programming model. The generating mechanism of such probabilistic variations in the economic models may be due to incomplete information about changes in demand, pro­duction and technology, specification errors about the econometric relations presumed for different economic agents, uncertainty of various sorts and the consequences of imperfect aggregation or disaggregating of economic variables. In this Research we discuss the probabilistic programming problem when the coefficient b_i is random variable

The purpose behind building the linear regression model is to describe the real linear relation between any explanatory variable in the model and the dependent one, on the basis of the fact that the dependent variable is a linear function of the explanatory variables and one can use it for prediction and control. This purpose does not cometrue without getting significant, stable and reasonable estimatros for the parameters of the model, specifically regression-coefficients. The researcher found that "RUF" the criterian that he had suggested accurate and sufficient to accomplish that purpose when multicollinearity exists provided that the adequate model that satisfies the standard assumpitions of the error-term can be assigned. It

In this paper the oscillation criterion was investigated for all solutions of the third-order half linear neutral differential equations. Some necessary and sufficient conditions are established for every solution of (a(t)[(x(t)±p(t)x(?(t) ) )^'' ]^? )^'+q(t) x^? (?(t) )=0, t?t_0, to be oscillatory. Examples are given to illustrate our main results.

Due to that the Ultra Wide Band (UWB) technology has some attractive features like robustness to multipath fading, high data rate, low cost and low power consumption, it is widely use to implement cognitive radio network. Intuitively, one of the most important tasks required for cognitive network is the spectrum sensing. A framework for implementing spectrum sensing for UWB-Cognitive Network will be presented in this paper. Since the information about primary licensed users are known to the cognitive radios then the best spectrum sensing scheme for UWB-cognitive network is the matched filter detection scheme. Simulation results verified and demonstrated the using of matched filter spectrum sensing in cognitive radio network with UWB and pro

The objective of this work is to design and implement a cryptography system that enables the sender to send message through any channel (even if this channel is insecure) and the receiver to decrypt the received message without allowing any intruder to break the system and extracting the secret information. This work modernize the feedforward neural network, so the secret message will be encrypted by unsupervised neural network method to get the cipher text that can be decrypted using the same network to get the original text. The security of any cipher system depends on the security of the related keys (that are used by the encryption and the decryption processes) and their corresponding lengths. In this work, the key is the final weights

The limitations of wireless sensor nodes are power, computational capabilities, and memory. This paper suggests a method to reduce the power consumption by a sensor node. This work is based on the analogy of the routing problem to distribute an electrical field in a physical media with a given density of charges. From this analogy a set of partial differential equations (Poisson's equation) is obtained. A finite difference method is utilized to solve this set numerically. Then a parallel implementation is presented. The parallel implementation is based on domain decomposition, where the original calculation domain is decomposed into several blocks, each of which given to a processing element. All nodes then execute computations in parall