通电螺线管2维磁场有限元计算

 通过对通电螺线管磁系统理论分析,实现了通电螺线管2维磁场计算。该算法是采用一次、二次插值函数计算螺线管模型磁场的有限元算法,用于求解螺线管内外任意位置处的磁感应强度分布。实现了螺线管及周期结构的计算,并将结果与Ansoft Maxwell 2-D的计算结果进行了对比。结果表明：较一次插值函数有限元算法相比,二次插值函数算法在对称轴上轴向磁感应强度的分布更准确,体现了该算法的优越性,具有显著的工程应用价值。     

Projective synchronization between different fractional‐order hyperchaotic systems with uncertain parameters using proposed modified adaptive projective synchronization technique

In the present article, the authors have proposed a modified projective adaptive synchronization technique for fractional‐order chaotic systems. The adaptive projective synchronization controller and identification parameters law are developed on the basis of Lyapunov direct stability theory. The proposed method is successfully applied for the projective synchronization between fractional‐order hyperchaotic Lü system as drive system and fractional‐order hyperchaotic Lorenz chaotic system as response system. A comparison between the effects on synchronization time due to the presence of fractional‐order time derivatives for modified projective synchronization method and proposed modified adaptive projective synchronization technique is the key feature of the present article. Numerical simulation results, which are carried out using Adams–Boshforth–Moulton method show that the proposed technique is effective, convenient and also faster for projective synchronization of fractional‐order nonlinear dynamical systems. Copyright © 2013 John Wiley & Sons, Ltd.     

Asymptotic properties of a new Sturm–Liouville problem with retarded argument

In this work, we study the asymptotic properties of a new Sturm–Liouville problem with retarded argument. Contrary to previous works, differential equation includes eigenparameter as a quadratic function. In the considered problem arise new difficulties. Copyright © 2013 John Wiley & Sons, Ltd.     

BOUNDED TRAVELING WAVE SOLUTIONS OF VARIANT BOUSSINESQ EQUATION WITH A DISSIPATION TERM AND DISSIPATION EFFECT

This article studies bounded traveling wave solutions of variant Boussinesq equation with a dissipation term and dissipation effect on them. Firstly, we make qualitative analysis to the bounded traveling wave solutions for the above equation by the theory and method of planar dynamical systems, and obtain their existent conditions, number, and general shape. Secondly, we investigate the dissipation effect on the shape evolution of bounded traveling wave solutions. We find out a critical value r*which can characterize the scale of dissipation effect, and prove that the bounded traveling wave solutions appear as kink profile waves if |r| ≥ r*; while they appear as damped oscillatory waves if |r| r*. We also obtain kink profile solitary wave solutions with and without dissipation effect. On the basis of the above discussion, we sensibly design the structure of the approximate damped oscillatory solutions according to the orbits evolution relation corresponding to the component u(ξ) in the global phase portraits, and then obtain the approximate solutions(u(ξ), H(ξ)). Furthermore,by using homogenization principle, we give their error estimates by establishing the integral equation which reflects the relation between exact and approximate solutions. Finally, we discuss the dissipation effect on the amplitude, frequency, and energy decay of the bounded traveling wave solutions.     

Global Existence and Asymptotic Behavior for the 3D Compressible Non–isentropic Euler Equations with Damping

We investigate the global existence and asymptotic behavior of classical solutions for the 3D compressible non-isentropic damped Euler equations on a periodic domain. The global existence and uniqueness of classical solutions are obtained when the initial data is near an equilibrium. Furthermore, the exponential convergence rates of the pressure and velocity are also proved by delicate energy methods.     

The fekete-szegö problem for close-to-convex functions with respect to the koebe function

An analytic function f   in the unit disk D :={z ∈ ? : |z| < 1}$\mathbb{D}\hspace{0.17em}:=\left\{z\hspace{0.17em}\in \hspace{0.17em}?\hspace{0.17em}:\hspace{0.17em}\left|z\right|\hspace{0.17em}<\hspace{0.17em}1\right\}$, standardly normalized, is called close-to-convex with respect to the Koebe function k(z) := z/(1−z)², z ∈ D$k\left(z\right)\hspace{0.17em}:=\hspace{0.17em}z/{\left(1-z\right)}^2,\hspace{0.17em}z\hspace{0.17em}\in \hspace{0.17em}\mathbb{D}$ if there exists δ∈(-π/2,π/2) such that Re{eiδ(1−z)²f^′(z)} > 0, ∈ D$\text{Re}\left\{{\text{e}}^{\text{i}\delta }{\left(1-z\right)}^2{f}^{\prime }\left(z\right)\right\}\hspace{0.17em}>\hspace{0.17em}0,\hspace{0.17em}\in \hspace{0.17em}\mathbb{D}$. For the class C(k) of all close-to-convex functions with respect to k, related to the class of functions convex in the positive direction of the imaginary axis, the Fekete-Szegö problem is studied.     

A discrete artificial bee colony algorithm for the multi-objective flexible job-shop scheduling problem with maintenance activities

This paper presents a novel discrete artificial bee colony (DABC) algorithm for solving the multi-objective flexible job shop scheduling problem with maintenance activities. Performance criteria considered are the maximum completion time so called makespan, the total workload of machines and the workload of the critical machine. Unlike the original ABC algorithm, the proposed DABC algorithm presents a unique solution representation where a food source is represented by two discrete vectors and tabu search (TS) is applied to each food source to generate neighboring food sources for the employed bees, onlooker bees, and scout bees. An efficient initialization scheme is introduced to construct the initial population with a certain level of quality and diversity. A self-adaptive strategy is adopted to enable the DABC algorithm with learning ability for producing neighboring solutions in different promising regions whereas an external Pareto archive set is designed to record the non-dominated solutions found so far. Furthermore, a novel decoding method is also presented to tackle maintenance activities in schedules generated. The proposed DABC algorithm is tested on a set of the well-known benchmark instances from the existing literature. Through a detailed analysis of experimental results, the highly effective and efficient performance of the proposed DABC algorithm is shown against the best performing algorithms from the literature.     

Modeling,simulation and validation of material flow on conveyor belts

In this paper a model comparison approach based on material flow systems is investigated that is divided into a microscopic and a macroscopic model scale. On the microscopic model scale particles are simulated using a model based on Newton dynamics borrowed from the engineering literature. Phenomenological observations lead to a hyperbolic partial differential equation on the macroscopic model scale. Suitable numerical algorithms are presented and both models are compared numerically and validated against real-data test settings.     

Polynomial cases of the economic lot sizing problem with cost discounts

In this paper we study the economic lot sizing problem with cost discounts. In the economic lot sizing problem a facility faces known demands over a discrete finite horizon. At each period, the ordering cost function and the holding cost function are given and they can be different from period to period. There are no constraints on the quantity ordered in each period and backlogging is not allowed. The objective is to decide when and how much to order so as to minimize the total ordering and holding costs over the finite horizon without any shortages. We study two different cost discount functions. The modified all-unit discount cost function alternates increasing and flat sections, starting with a flat section that indicates a minimum charge for small quantities. While in general the economic lot sizing problem with modified all-unit discount cost function is known to be NP-hard, we assume that the cost functions do not vary from period to period and identify a polynomial case. Then we study the incremental discount cost function which is an increasing piecewise linear function with no flat sections. The efficiency of the solution algorithms follows from properties of the optimal solution. We computationally test the polynomial algorithms against the use of CPLEX.