Abstract: The present study is concerned with the optimal design of functionally graded plates using particle swarm optimization (PSO) algorithm. In this study, meshless local Petrov-Galerkin (MLPG) method is employed to obtain the functionally graded (FG) plate’s natural frequencies. Effects of two parameters including thickness to height ratio and volume fraction index on the natural frequencies and total mass of plate are studied by using the MLPG results. Then the first natural frequency of the plate, for different conditions where MLPG data are not available, is predicted by an artificial neural network (ANN) approach which is trained by back-error propagation (BEP) technique. The ANN results show that the predicted data are in good agreement with the actual one. To maximize the first natural frequency and minimize the mass of FG plate simultaneously, the weighted sum optimization approach and PSO algorithm are used. However, the proposed optimization process of this study can provide the designers of FG plates with useful data.
Abstract: In this paper, an encryption algorithm is proposed for real-time image encryption. The scheme employs a dual chaotic generator based on a three dimensional (3D) discrete Lorenz attractor. Encryption is achieved using non-autonomous modulation where the data is injected into the dynamics of the master chaotic generator. The second generator is used to permute the dynamics of the master generator using the same approach. Since the data stream can be regarded as a random source, the resulting permutations of the generator dynamics greatly increase the security of the transmitted signal. In addition, a technique is proposed to mitigate the error propagation due to the finite precision arithmetic of digital hardware. In particular, truncation and rounding errors are eliminated by employing an integer representation of the data which can easily be implemented. The simple hardware architecture of the algorithm makes it suitable for secure real-time applications.
Abstract: In this paper we propose a new classification method for automatic sleep scoring using an artificial neural network based decision tree. It attempts to treat sleep scoring progress as a series of two-class problems and solves them with a decision tree made up of a group of neural network classifiers, each of which uses a special feature set and is aimed at only one specific sleep stage in order to maximize the classification effect. A single electroencephalogram (EEG) signal is used for our analysis rather than depending on multiple biological signals, which makes greatly simplifies the data acquisition process. Experimental results demonstrate that the average epoch by epoch agreement between the visual and the proposed method in separating 30s wakefulness+S1, REM, S2 and SWS epochs was 88.83%. This study shows that the proposed method performed well in all the four stages, and can effectively limit error propagation at the same time. It could, therefore, be an efficient method for automatic sleep scoring. Additionally, since it requires only a small volume of data it could be suited to pervasive applications.
Abstract: The hidden-point bar method is useful in many
surveying applications. The method involves determining the
coordinates of a hidden point as a function of horizontal and vertical
angles measured to three fixed points on the bar. Using these
measurements, the procedure involves calculating the slant angles,
the distances from the station to the fixed points, the coordinates of
the fixed points, and then the coordinates of the hidden point. The
propagation of the measurement errors in this complex process has
not been fully investigated in the literature. This paper evaluates the
effect of the bar geometry on the position accuracy of the hidden
point which depends on the measurement errors of the horizontal and
vertical angles. The results are used to establish some guidelines
regarding the inclination angle of the bar and the location of the
observed points that provide the best accuracy.
Abstract: The RK5GL3 method is a numerical method for solving
initial value problems in ordinary differential equations, and is based
on a combination of a fifth-order Runge-Kutta method and 3-point
Gauss-Legendre quadrature. In this paper we describe the propagation
of local errors in this method, and show that the global order of
RK5GL3 is expected to be six, one better than the underlying Runge-
Kutta method.