28145787
Homotopy perturbation method for a type of nonlinear coupled equations with parameters derivative
Abstract In this paper, homotopy perturbation method is directly extended to investigate nonlinear coupled equations with parameters derivative and to derive their numerical solutions. These nonlinear coupled equations with parameters derivative contain many important mathematical physics equations and reaction–diffusion equations. By choosing different values of the parameters in general formal numerical solutions, as a result, a very rapidly convergent series solution is obtained. The efficiency and accuracy of the method are verified by using two famous examples: coupled Burgers and mKdV equations. Numerical solutions show that good results have been achieved.
12162530
A new general algebraic method with symbolic computation to construct new doubly-periodic solutions of the (2 + 1)-dimensional dispersive long wave equation
For constructing more new exact doubly-periodic solutions in terms of rational form Jacobi elliptic function of nonlinear evolution equations, a new direct and unified algebraic method, named Jacobi elliptic function rational expansion method, is presented and implemented in a computer algebraic system. Compared with most of the existing Jacobi elliptic function expansion methods, the proposed method can be expected to obtain new and more general formal solutions. We choose a (2+1)-dimensional dispersive long wave equation to illustrate the method.
18967560
Generalized Cascade Synchronization of Discrete-time Henon-like Map
This Letter addresses the generalized cascade synchronization problem of discrete-time hyperchaotic systems. By choosing a general kind of proportional scaling error functions and based on rigorous control theory, we take the discrete-time Henon-like map as a example to achieve the generalized cascade synchronization. Numerical simulations are used to show the effectiveness of the proposed technique.
27234161
Two-dimensional symmetry reduction of (2 + 1)-dimensional nonlinear Klein-Gordon equation
In this paper, one-dimensional optimal system of group invariant solutions of (2+1)-dimensional Klein-Gordon system is constructed. Then the classification of group invariant solutions is given out and the corresponding two-dimensional symmetry reduced equations are obtained. At last some symmetry transformations are gained in detail. Especially, we obtain the most general solution from a given solution by use of six variable one-parameter subgroups transformations.
20461063
The function cascade synchronization approach with uncertain parameters or not for hyperchaotic systems
The function cascade synchronization scheme for the hyperchaotic systems is proposed to make the states of two identical the hyperchaotic systems both with and without uncertain parameters asymptotically synchronized. Based on Lyapunov stability theory and the proposed scheme, the Lu system and Chen hyperchaotic system with and without uncertain parameters are chosen to achieve the function cascade synchronization simultaneously. Numerical simulations are used to verify the effectiveness and feasibility of the presented control scheme.
41322043
New exact travelling wave solutions for the shallow long wave approximate equations
Based upon a generally projective Riccati equation method, which is a direct and unified algebraic method for constructing more general form travelling wave solutions of nonlinear partial differential equations and implemented in a computer algebraic system, we consider the shallow long wave approximate equations. New and more general form solutions are obtained, including kink-shaped solitons, bell-shaped solitons, singular solitons and periodic solutions. The properties of the new formal solitary wave solutions are shown by some figures.
15212853
Core-aware memory access scheduling schemes
Multi-core processors have changed the conventional hardware structure and require a rethinking of system scheduling and resource management to utilize them efficiently. However, current multi-core systems are still using conventional single-core memory scheduling. In this study, we investigate and evaluate traditional memory access scheduling techniques, and propose a core-aware memory scheduling for multi-core environments. Since memory requests from the same source exhibit better locality, it is reasonable to schedule the requests by taking the source of the requests into consideration. Motivated from this principle of locality, we propose two core-aware policies based on traditional bank-first and row-first schemes. Simulation results show that the core-aware policies can effectively improve the performance. Compared with the bank-first and row-first policies, the proposed core-aware policies reduce the execution time of certain NAS Parallel Benchmarks by up to 20% in running the benchmarks separately, and by 11% in running them concurrently.
37352290
Comparison of Two Fitness Functions for GA-Based Path-Oriented Test Data Generation
Automatic path-oriented test data generation is not only a crucial problem but also a hot issue in the research area of software testing today. As a robust metaheuritstic search method in complex spaces, genetic algorithm (GA) has been used to path-oriented test data generation since 1992 and outperforms other approaches. A fitness function based on branch distance (BDBFF) and another based on normalized extended Hamming distance (SIMILARITY) are both applied in GA-based path-oriented test data generation. To compare performance of these two fitness functions, a triangle classification program was chosen as the example. Experimental results show that BDBFF-based approach can generate path-oriented test data more effectively and efficiently than SIMILARITY- based approach does.
206370432
An accurate sampling-based method for approximating geometry
We present a sampling-based method for approximating the boundary of a geometry defined by various geometric operations. Based on a novel adaptive sampling condition, we first construct volumetric grids such that an error-minimizing point can be found in each cell to capture all the geometric objects inside the cell. We then construct a polygonal model from the grid. We guarantee the boundary approximation has the same topology as the exact surfaces, and the maximum approximation error from the exact surfaces is bounded by a user specified tolerance. Our method is robust and easy to implement. We have applied it in various applications such as remeshing of polygonal models, Boolean operations, and offsetting operations. We report experimental results on a variety of CAD models.
15834568
An Artificial Neural Network Based on CIEA
Chaotic Immune evolutionary algorithm (CIEA) is proposed on the shortage of current algorithms training artificial neural network, biological immune mechanism and the characteristics of evolution. A novel artificial neural network based on chaotic immune evolutionary algorithm (CIEANN) is presented in this paper. The algorithm has the merits of chaos, immunity and evolutionary algorithm. It can ensure the ability of global search and local search and enhance the performances of the algorithm. At last, we analyzed the performance of CIEANN with a typical XOR problem and compared it with several common ANNs. The analysis results show that CIEANN converges quickly and avoids immature convergence and is an effective way to solve optimization problem.
14185433
Affective Computing Model Based on Rough Fuzzy Sets
In human affective research, the fuzziness and roughness of the affective computing is the chief difficult. This paper builds a novel affective model based on rough fuzzy sets for the first time and presents a serial of static description results, which effectively solve the fuzzy and rough problems in affective computing. The model can realize the precision control of affective computing conveniently. Finally, the simulation shows that the results of the model for the affective static description are reasonable. This paper extends the results in (Yong Chen and Tong He, 2005) and lays the foundation of the affective computing in depth