Local Bifurcation Analysis of a Delayed Fractional-order Dynamic Model of Dual Congestion Control Algorithms

In this paper, we propose a delayed fractional-order congestion control model which is more accurate than the original integer-order model when depicting the dual congestion control algorithms. The presence of fractional orders requires the use of suitable criteria which usually make the analytical work so harder. Based on the stability theorems on delayed fractionalorder differential equations, we study the issue of the stability and bifurcations for such a model by choosing the communication delay as the bifurcation parameter. By analyzing the associated characteristic equation, some explicit conditions for the local stability of the equilibrium are given for the delayed fractionalorder model of congestion control algorithms. Moreover, the Hopf bifurcation conditions for general delayed fractional-order systems are proposed. The existence of Hopf bifurcations at the equilibrium is established. The critical values of the delay are identified, where the Hopf bifurcations occur and a family of oscillations bifurcate from the equilibrium. Same as the delay, the fractional order normally plays an important role in the dynamics of delayed fractional-order systems. It is found that the critical value of Hopf bifurcations is crucially dependent on the fractional order. Finally, numerical simulations are carried out to illustrate the main results. © 2017 Chinese Association of Automation.

Artificial Bee Colony Algorithm-based Parameter Estimation of Fractional-order Chaotic System with Time Delay

It is an important issue to estimate parameters of fractional-order chaotic systems in nonlinear science, which has received increasing interest in recent years. In this paper, time delay and fractional order as well as system's parameters are concerned by treating the time delay and fractional order as additional parameters. The parameter estimation is converted into a multi-dimensional optimization problem. A new scheme based on artificial bee colony ABC algorithm is proposed to solve the optimization problem. Numerical experiments are performed on two typical time-delay fractional-order chaotic systems to verify the effectiveness of the proposed method. © 2014 Chinese Association of Automation.

Improved quantum bacterial foraging algorithm for tuning parameters of fractional-order PID controller

The quantum bacterial foraging optimization(QBFO)algorithm has the characteristics of strong robustness and global searching ability. In the classical QBFO algorithm, the rotation angle updated by the rotation gate is discrete and constant,which cannot affect the situation of the solution space and limit the diversity of bacterial population. In this paper, an improved QBFO(IQBFO) algorithm is proposed, which can adaptively make the quantum rotation angle continuously updated and enhance the global search ability. In the initialization process, the modified probability of the optimal rotation angle is introduced to avoid the existence of invariant solutions. The modified operator of probability amplitude is adopted to further increase the population diversity.The tests based on benchmark functions verify the effectiveness of the proposed algorithm. Moreover, compared with the integerorder PID controller, the fractional-order proportion integration differentiation(PID) controller increases the complexity of the system with better flexibility and robustness. Thus the fractional-order PID controller is applied to the servo system. The tuning results of PID parameters of the fractional-order servo system show that the proposed algorithm has a good performance in tuning the PID parameters of the fractional-order servo system.

Taboo Search Algorithm for Item Assignment in Synchronized Zone Automated Order Picking System

The idle time which is part of the order fulfillment time is decided by the number of items in the zone; therefore the item assignment method affects the picking efficiency. Whereas previous studies only focus on the balance of number of kinds of items between different zones but not the number of items and the idle time in each zone. In this paper, an idle factor is proposed to measure the idle time exactly. The idle factor is proven to obey the same vary trend with the idle time, so the object of this problem can be simplified from minimizing idle time to minimizing idle factor. Based on this, the model of item assignment problem in synchronized zone automated order picking system is built. The model is a form of relaxation of parallel machine scheduling problem which had been proven to be NP-complete. To solve the model, a taboo search algorithm is proposed. The main idea of the algorithm is minimizing the greatest idle factor of zones with the 2-exchange algorithm. Finally, the simulation which applies the data collected from a tobacco distribution center is conducted to evaluate the performance of the algorithm. The result verifies the model and shows the algorithm can do a steady work to reduce idle time and the idle time can be reduced by 45.63% on average. This research proposed an approach to measure the idle time in synchronized zone automated order picking system. The approach can improve the picking efficiency significantly and can be seen as theoretical basis when optimizing the synchronized automated order picking systems.

Selecting between Sequential Zoning and Simultaneous Zoning for Picker-to-parts Order Picking System Based on Order Cluster and Genetic Algorithm

The existing research of sequential zoning system and simultaneous zoning system mainly focuses on some optimization problems such as workload balance,product assignment and simulation for each system separately.But there is little research on comparative study between sequential zoning and simultaneous zoning.In order to help the designers to choose the suitable zoning policy for picker-to-parts system reasonably and quickly,a systemic selection method is presented.Essentially,both zoning and batching are order clustering,so the customer order sheet can be divided into many unit grids.After the time formulation in one-dimensional unit was defined,the time models for each zoning policy in two-dimensional space were established using filling curves and sequence models to link the one-dimensional unit grids.In consideration of ＂U＂ shaped dual tour into consideration,the subtraction value of order picking time between sequential zoning and simultaneous zoning was defined as the objective function to select the suitable zoning policy based on time models.As it is convergent enough,genetic algorithm is adopted to find the optimal value of order picking time.In the experimental study,5 different kinds of order/stock keeping unit（SKU） matrices with different densities d and quantities q following uniform distribution were created in order to test the suitability of sequential zoning and simultaneous zoning to different kinds of orders.After parameters setting,experimental orders inputting and iterative computations,the optimal order picking time for each zoning policy was gotten.By observing whether the delta time between them is greater than 0 or not,the suitability of zoning policies for picker-to-parts system were obtained.The significant effect of batch size b,zone number z and density d on suitability was also found by experimental study.The proposed research provides a new method for selection between sequential zoning and simultaneous zoning for picker-to-parts system,and improves the rationality and efficiency of selection process in practical design.

Design of Second Order Sliding Mode and Sliding Mode Algorithms:A Practical Insight to DC-DC Buck Converter

This paper presents a simple and systematic approach to design second order sliding mode controller for buck converters.The second order sliding mode control(SOSMC)based on twisting algorithm has been implemented to control buck switch mode converter.The idea behind this strategy is to suppress chattering and maintain robustness and finite time convergence properties of the output voltage error to the equilibrium point under the load variations and parametric uncertainties.In addition,the influence of the twisting algorithm on the performance of closed-loop system is investigated and compared with other algorithms of first order sliding mode control such as adaptive sliding mode control(ASMC),nonsingular terminal sliding mode control(NTSMC).In comparative evaluation,the transient response of the output voltage with the step change in the load and the start-up response of the output voltage with the step change in the input voltage of buck converter were compared.Experimental results were obtained from a hardware setup constructed in laboratory.Finally,for all of the surveyed control methods,the theoretical considerations,numerical simulations,and experimental measurements from a laboratory prototype are compared for different operating points.It is shown that the proposed twisting method presents an improvement in steady state error and settling time of output voltage during load changes.

WFRFT modulation recognition based on HOC and optimal order searching algorithm

A hybrid carrier（HC） scheme based on weighted-type fractional Fourier transform（WFRFT） has been proposed recently.While most of the works focus on HC scheme＇s inherent characteristics, little attention is paid to the WFRFT modulation recognition.In this paper, a new theory is provided to recognize the WFRFT modulation based on higher order cumulants（HOC）. First, it is deduced that the optimal WFRFT received order can be obtained through the minimization of 4 th-order cumulants, C_（42）. Then, a combinatorial searching algorithm is designed to minimize C_（42）.Finally, simulation results show that the designed scheme has a high recognition rate and the combinatorial searching algorithm is effective and reliable.

AN INFEASIBLE-INTERIOR-POINT PREDICTOR-CORRECTOR ALGORITHM FOR THE SECOND-ORDER CONE PROGRAM

A globally convergent infeasible-interior-point predictor-corrector algorithm is presented for the second-order cone programming （SOCP） by using the Alizadeh- Haeberly-Overton （AHO） search direction. This algorithm does not require the feasibility of the initial points and iteration points. Under suitable assumptions, it is shown that the algorithm can find an -approximate solution of an SOCP in at most O（√n ln（ε0/ε）） iterations. The iteration-complexity bound of our algorithm is almost the same as the best known bound of feasible interior point algorithms for the SOCP.

A Second Order Training Algorithm for Multilayer Feedforward Neural Networks

ＡＳｅｃｏｎｄＯｒｄｅｒＴｒａｉｎｉｎｇＡｌｇｏｒｉｔｈｍｆｏｒＭｕｌｔｉｌａｙｅｒＦｅｅｄｆｏｒｗａｒｄＮｅｕｒａｌＮｅｔｗｏｒｋｓＴａｎＹｉｎｇ（谭营）ＨｅＺｈｅｎｙａ（何振亚）（ＤｅｐａｒｔｍｅｎｔｏｆＲａｄｉｏＥｎｇｉｎｅｅｒｉｎｇ，Ｓｏｕ...

A MODIFIED HIGH-ORDER CUMULANT MUSIC ALGORITHM FOR SIGNAL DOA ESTIMATION

This paper gives a MUSIC signal DOA estimation algorithm based on the modified high-order cumulant matrix which is constructed by the recieved data and their conjugate rearrangements. When the snapshot number is limited, this algorithm can improve the signal DOA estimation performances obviously, and its computational complexity scarcely increases. Finally, some simulation results to verify the theoretical analyses are presented.

ADAPTIVE ALGORITHM FOR CONSISTENTMA PARAMETER ESTIMATION VIATHIRD ORDER CUMULANT

This paper addresses the problem of adaptive,consistent parameter estimation for a MA model from the 3rd order cumulant of the system output. The proposed adaptive algorithm is derived by using the new linear equation system (J. K. Tugnait, 1990), which is proved to have unique solution,and hence guarantees the consistence of the MA parameters. Simulation results are provided to show the performance of the new algorithm.

Stable Model Order Reduction Method for Fractional-Order Systems Based on Unsymmetric Lanczos Algorithm

This study explores a stable model order reduction method for fractional-order systems. Using the unsymmetric Lanczos algorithm, the reduced order system with a certain number of matched moments is generated. To obtain a stable reduced order system, the stable model order reduction procedure is discussed. By the revised operation on the tridiagonal matrix produced by the unsymmetric Lanczos algorithm, we propose a reduced order modeling method for a fractional-order system to achieve a satisfactory fitting effect with the original system by the matched moments in the frequency domain. Besides, the bound function of the order reduction error is offered. Two numerical examples are presented to illustrate the effectiveness of the proposed method.

Two new predictor-corrector algorithms for second-order cone programming

Based on the ideas of infeasible interior-point methods and predictor-corrector algorithms, two interior-point predictor-corrector algorithms for the second-order cone programming （SOCP） are presented. The two algorithms use the Newton direction and the Euler direction as the predictor directions, respectively. The corrector directions belong to the category of the Alizadeh-Haeberly-Overton （AHO） directions. These algorithms are suitable to the cases of feasible and infeasible interior iterative points. A simpler neighborhood of the central path for the SOCP is proposed, which is the pivotal difference from other interior-point predictor-corrector algorithms. Under some assumptions, the algorithms possess the global, linear, and quadratic convergence. The complexity bound O（rln（εo/ε）） is obtained, where r denotes the number of the second-order cones in the SOCP problem. The numerical results show that the proposed algorithms are effective.

Optimization of a global seventh-order dissipative compact finite-difference scheme by a genetic algorithm

A global seventh-order dissipative compact finite-difference scheme is optimized in terms of time stability. The dissipative parameters appearing in the boundary closures are assumed to be different, resulting in an optimization problem with several parameters determined by applying a generic algorithm. The optimized schemes are analyzed carefully from the aspects of the eigenvalue distribution, the ε-pseudospectra, the short time behavior, and the Fourier analysis. Numerical experiments for the Euler equations are used to show the effectiveness of the final recommended scheme.

A New Eighth Order Implicit Block Algorithms for the Direct Solution of Second Order Ordinary Differential Equations

This paper focuses on derivation of a uniform order 8 implicit block method for the direct solution of general second order differential equations through continuous coefficients of Linear Multi-step Method (LMM). The continuous formulation and its first derivatives were evaluated at some selected grid and off grid points to obtain our proposed method. The superiority of the method over the existing methods is established numerically.

蒙特卡罗方法和ORDER算法在网络可靠度计算中的对比

对蒙特卡罗方法和ORDER算法在计算某中等规模的桥梁网络连通可靠度方面进行了对比。结果表明:OR-DER算法可以获得更精确的计算结果,而蒙特卡罗方法在计算速度上有优势。计算结果有助于政府管理者更好地了解桥梁网络状态。

核映射和Rank-Order距离的局部保持投影相似性度量方法

针对近红外光谱高维、高冗余、非线性和小样本等特点导致光谱相似性度量时出现的“维度灾难”,提出一种基于核映射和rank-order距离的局部保持投影(KRLPP)算法。首先将光谱数据经过核变换映射到更高维空间,有效保证了流形结构的非线性特征。然后改进局部保持投影(LPP)算法对数据进行降维操作,将rank-order距离替代传统的欧氏距离或测地线距离,通过共享邻近点的信息,得到更加准确的局部邻域关系。最后在低维空间通过距离的计算实现光谱的度量。该方法不仅有效解决了高维空间存在的“距离失效”问题,同时还提高了相似性度量结果的精度。为了验证KRLPP算法的有效性,首先根据降维前后数据集信息残差的变化确定了最佳参数近邻点的个数k和降维后的维数d。其次,从光谱降维投影效果和模型分类效果两个角度与PCA,LPP和INLPP算法进行了对比,结果表明KRLPP算法对于烟叶的部位有较好的区分能力,降维效果以及对于不同部位的正确识别率明显优于PCA,LPP和INLPP。最后,从某品牌卷烟叶组配方中选取了5个代表性烟叶作为目标烟叶,分别采用PCA,LPP和KRLPP方法从300个用于配方维护的烟叶样品中为每个目标烟叶寻找相似烟叶,并从化学成分和感官评价两方面对替换前后的烟叶及叶组配方进行了评价分析。其中LPP和KRLPP用于降维的参数选择保持一致,PCA选择前6个主成分。结果表明,由KRLPP选出的替换烟叶与替换配方在总糖、还原糖、总烟碱、总氮等化学成分以及香气、烟气、口感等感官指标上较PCA、LPP方法差异最小,相似性度量准确度最高。该方法可应用于配方产品替换原料的查找,辅助企业实现产品质量的维护。

Pseudospectral method with symplectic algorithm for the solution of time-dependent SchrSdinger equations

A pseudospectral method with symplectic algorithm for the solution of time-dependent Schrodinger equations （TDSE） is introduced. The spatial part of the wavefunction is discretized into sparse grid by pseudospectral method and the time evolution is given in symplectic scheme. This method allows us to obtain a highly accurate and stable solution of TDSE. The effectiveness and efficiency of this method is demonstrated by the high-order harmonic spectra of one-dimensional atom in strong laser field as compared with previously published work. The influence of the additional static electric field is also investigated.

Asymptotic properties and expectation-maximization algorithm for maximum likelihood estimates of the parameters from Weibull-Logarithmic model

In this article, we consider a lifetime distribution, the Weibull-Logarithmic distri- bution introduced by [6]. We investigate some new statistical characterizations and properties. We develop the maximum likelihood inference using EM algorithm. Asymptotic properties of the MLEs are obtained and extensive simulations are conducted to assess the performance of parameter estimation. A numerical example is used to illustrate the application.

Cultural Algorithm for Minimization of Binary Decision Diagram and Its Application in Crosstalk Fault Detection

The binary decision diagrams （BDDs） can give canonical representation to Boolean functions; they have wide applications in the design and verification of digital systems. A new method based on cultural algorithms for minimizing the size of BDDs is presented in this paper. First of all, the coding of an individual representing a BDDs is given, and the fitness of an individual is defined. The population is built by a set of the individuals. Second, the implementations based on cultural algorithms for the minimization of BDDs, i.e., the designs of belief space and population space, and the designs of acceptance function and influence function, are given in detail. Third, the fault detection approaches using BDDs for digital circuits are studied. A new method for the detection of crosstalk faults by using BDDs is presented. Experimental results on a number of digital circuits show that the BDDs with small number of nodes can be obtained by the method proposed in this paper, and all test vectors of a fault in digital circuits can also be produced.