A globally convergent algorithm for transportation continuous network design problem

The continuous network design problem (CNDP) is characterized by a bilevel programming model, in which the upper level problem is generally to minimize the total system cost under limited expenditure, while at the lower level the network users make choices with regard to route conditions following the user equilibrium principle. In this paper, the bilevel programming model for CNDP is transformed into a single level convex programming problem by virtue of an optimal-value function tool and the relationship between System Optimum (SO) and User Equilibrium (UE). By exploring the inherent nature of the CNDP, the optimal-value function for the lower level user equilibrium problem is proved to be continuously differentiable and its derivative in link capacity enhancement can be obtained efficiently by implementing user equilibrium assignment subroutine. However, the reaction (or response) function between the upper and lower level problem is implicit and its gradient is difficult to obtain. Although, here we approximately express the gradient with the difference concept at each iteration, based on the method of successive averages (MSA), we propose a globally convergent algorithm to solve the single level convex programming problem. Comparing with widely used heuristic algorithms, such as sensitivity analysis based (SAB) method, the proposed algorithm needs not strong hypothesis conditions and complex computation for the inverse matrix. Finally, a numerical example is presented to compare the proposed method with some existing algorithms.     

Explosive Random‐Coefficient AR(1) Processes and Related Asymptotics for Least‐Squares Estimation

Abstract. Large sample properties of the least‐squares and weighted least‐squares estimates of the autoregressive parameter of the explosive random‐coefficient AR(1) process are discussed. It is shown that, contrary to the standard AR(1) case, the least‐squares estimator is inconsistent whereas the weighted least‐squares estimator is consistent and asymptotically normal even when the error process is not necessarily Gaussian. Conditional asymptotics on the event that a certain limiting random variable is non‐zero is also discussed.     

THE ANALYSIS OF THE SEPARATED LAYERS ALGORITHM BY DOMAIN DECOMPOSITION METHOD

From the principle of of the Domain Decomposition Method (DDM), we analyse the 2nd-order linear elliptic partial differential problems and link the Separated-Layers Algorithm (SLA) with DDM. The mathematical properties of SLA and numerical example are presented to obtain satisfactory computation results. For general linear differential ones, also are the structure of SLA and its characteristics discussed.     

A Survey on the Numerics and Computations for the Landau-Lifshitz Equation of Micromagnetism

The Landau-Lifshitz (LL)equation of micromagnetism governs rich variety of the evolution of magnetization patterns in ferromagnetic media. This is due to the complexity of physical quantities appearing in the LL equation. This complexity causes also an interesting mathematical properties of the LL equation: nonlocal character for some quantities,nonconvex side-constraints, strongly nonlinear terms. These effects influence also the numerical approximations. In this work, recent developments on the approximation of weak solutions, together with the overview of well-known methods for strong solutions,are addressed. Author is supported by the Fund for Scientific Research - Flanders FWO (Belgium).     

固定网综合信息平台的建设

详细介绍了中兴ZXF118固定网综合业务信息平台的结构、建设方案及其组网方案。     

三网融合的技术现状和未来发展

三网融合是网络发展的主要方向,无线网络是接入有线网络的一个重要途径。本文主要概述了因特网、电信网络、有线电视网络和无线网络的技术现状;分析在三网融合的形势下,它们各自都可以为发展未来包含现在由三种网络提供的所有服务的综合业务网提供核心技术的能力;指出没有单个网络技术能够成为无争议的赢家:融合的网络将具有异构网络集合的特征,提供多种多样的服务;然后在更广阔的视野上阐明了在三网融合之后的未来全局多媒体网络的特征以及建立具有这样的特征的网络所面临的挑战和所需要的变革和创新。     

基于模型设计的数字集群分组数据业务的实现

为解决数字集群通信系统中图像、视频等大数据业务的传输问题,深入分析数字集群空中接口协议栈的结构,重点研究分组数据业务提供者子网相关汇聚协议的结构和原理。基于模型设计方法设计该协议的相关功能模块,并进行编码实现。开发中使用IBM Rational Rhapsody这一基于UML建模的开发工具,使整个开发过程简洁而清晰。最后,通过对协议进行一致性测试,证明协议参数及流程符合数字集群通信系统协议标准。     

一种新的修正恒模算法

阐述了恒模算法(CMA)、修正恒模算法(MCMA)和判决引导(DD)算法的基本原理。针对CMA和MCMA收敛速度慢,固定步长条件下收敛速度和剩余误差之间存在矛盾的缺陷,在分析CMA误差特性的基础上,利用DD算法误差函数的模值和判决器输出构造新的误差函数,提出了一种新的变步长MCMA。新算法在加快收敛速度的同时保持小的剩余误差。仿真结果表明,新算法比CMA和MCMA收敛速度快,均衡输出剩余码间干扰(ISI)小而且能克服相位偏移,具有很好的实用性。     

Calculated hardenability for improved consistency of properties in heat treatable engineering steels

Hardenability is one of the most important parameters controlling the heat treated properties of engineering steels. It affects the consistency of response for microstructure, hardness, strength, toughness, and dimensional change (distortion). This study illustrates that a major benefit of controlling hardenability is improving the consistency of dimensional distortion resulting from heat treatment. To facilitate the supply of steels to hardenability limits, especially restricted hardenability, a new technique was developed for the prediction of Jominy hardenability from chemical composition. The technique, termed the “Database Method,” uses measured Jominy hardenability and chemical composition data, contained in a database, to calculate the hardenability for a query composition. Using up to ten known steels, selected from the database with compositions closely matching that of the query steel, a small adjustment is made to the measured hardenability of each known steel allowing for the small difference in composition between the query and chosen steel. The final calculated result for the query steel is taken as the average of the various estimates. The basis of the Database Method is explained, and the advantages are illustrated for selecting engineering grades.     

Adaptive tracking control of leader–follower systems with unknown dynamics and partial measurements

In this paper, a decentralized adaptive tracking control is developed for a second-order leader–follower system with unknown dynamics and relative position measurements. Linearly parameterized models are used to describe the unknown dynamics of a self-active leader and all followers. A new distributed system is obtained by using the relative position and velocity measurements as the state variables. By only using the relative position measurements, a dynamic output–feedback tracking control together with decentralized adaptive laws is designed for each follower. At the same time, the stability of the tracking error system and the parameter convergence are analyzed with the help of a common Lyapunov function method. Some simulation results are presented to validate the proposed adaptive tracking control.