自动化码头运输设备充电策略优化的仿真研究

随着自动化集装箱码头成为当今码头的发展趋势,AGV(automated guided vehicle) 作为自动化码头中使用最为广泛的水平运输工具,合理制定其充电策略至关重要。针对当前自动化集装箱码头中AGV充电策略的不足,提出一种以离线充电为主在线充电为辅的充电策略,并且针对在线充电站点位置选择问题提出一种利用热区图选择有效在线充电站点的快捷方法。在使用该种充电策略情况下,通过大量仿真实验得出在码头工作任务量不变的前提下可减少AGV数量配置的结果,说明自动化集装箱码头水平搬运效率得到提高,证明该充电策略具有有效性。     

系统方法论研究的现状分析与展望

对目前系统方法论的研究进行分类：硬系统方法论、软系统方法论和批评性系统方法论，分析了不同系统方法的哲学思想、方法步骤及其局限性，探讨了未来系统方法论发展的形式。     

ISAR target recognition based on non-negative sparse coding

Aiming at technical difficulties in feature extraction for the inverse synthetic aperture radar (ISAR) target recognition, this paper imports the concept of visual perception and presents a novel method, which is based on the combination of non-negative sparse coding (NNSC) and linear discrimination optimization, to recognize targets in ISAR images. This method implements NNSC on the matrix constituted by the intensities of pixels in ISAR images for training, to obtain non-negative sparse bases which characterize sparse distribution of strong scattering centers. Then this paper chooses sparse bases via optimization criteria and calculates the corresponding non-negative sparse codes of both training and test images as the feature vectors, which are input into k neighbors classifier to realize recognition finally. The feasibility and robustness of the proposed method are proved by comparing with the template matching, principle component analysis (PCA) and non-negative matrix factorization (NMF) via simulations.     

Improved adaptive pruning algorithm for least squares support vector regression

As the solutions of the least squares support vector regression machine(LS-SVRM) are not sparse,it leads to slow prediction speed and limits its applications.The defects of the existing adaptive pruning algorithm for LS-SVRM are that the training speed is slow,and the generalization performance is not satisfactory,especially for large scale problems.Hence an improved algorithm is proposed.In order to accelerate the training speed,the pruned data point and fast leave-one-out error are employed to validate the temporary model obtained after decremental learning.The novel objective function in the termination condition which involves the whole constraints generated by all training data points and three pruning strategies are employed to improve the generalization performance.The effectiveness of the proposed algorithm is tested on six benchmark datasets.The sparse LS-SVRM model has a faster training speed and better generalization performance.     

Novel reference range selection method in InlSAR imaging

Aiming at the reference range selection for different antennas in interferometric inverse synthetic aperture radar (InISAR) systems, this paper proposes a respective focusing (RF) method. The reference ranges for echoes of different antennas are selected respectively for RF, which is different from the traditional uniform focusing (UF) with the same reference range applied to all the antennas. First, a comparison between UF and RF for InISAR signal model considering the ranging error is given. Compared with RF, UF has an advantage in overcoming the ranging error differences between different antennas. Then the influence of ranging error upon the interferometric imaging with RF is investigated particularly, and it is found that the ranging error differences between different antennas are far smaller than the wavelength, which is advantageous to imaging. By comparing the capabilities of interferometric imaging between RF and UF, it is concluded that RF is a better choice in conquering problems such as image mismatching and phase ambiguity even with ranging errors. Simulations demonstrate the validity of the proposed method.     

Modeling the congestion cost and vehicle emission within multimodal traffic network under the condition of equilibrium

Traditional system optimization models for traffic network focus on the treatment of congestion, which usually have an objective of minimizing the total travel time.However,the negative externality of congestion,such as environment pollution,is neglected in most cases.Such models fall short in taking Greenhouse Gas(GHG) emissions and its impact on climate change into consideration.In this paper,a social-cost based system optimization(SO) model is proposed for the multimodal traffic network considering both traffic congestion and corresponding vehicle emission.Firstly,a variation inequality model is developed to formulate the equilibrium problem for such network based on the analysis of travelers’ combined choices.Secondly,the computational models of traffic congestion and vehicle emission of whole multimodal network are proposed based on the equilibrium link-flows and the corresponding travel times.A bi-level programming model,in which the social-cost based SO model is treated as the upper-level problem and the combined equilibrium model is processed as the lower-level problem,is then presented with its solution algorithm.Finally,the proposed models are illustrated through a simple numerical example.The study results confirm and support the idea of giving the priority to the development of urban public transport,which is an effective way to achieve a sustainable urban transportation.     

Finding the topology of implicitly defined two algebraic plane curves

An algorithm is given for computing in a very efficient way the topology of two real algebraic plane curves defined implicitly.The authors preform a symbolic pre-processing that allows us later to execute all numerical computations in an accurate way.     

On functional decomposition of multivariate polynomials with differentiation and homogenization

This paper gives a theoretical analysis for the algorithms to compute functional decomposition for multivariate polynomials based on differentiation and homogenization which were proposed by Ye,Dai,and Lam(1999) and were developed by Faugere,Perret(2006,2008,2009).The authors show that a degree proper functional decomposition for a set of randomly decomposable quartic homogenous polynomials can be computed using the algorithm with high probability.This solves a conjecture proposed by Ye,Dai,and Lam(1999).The authors also propose a conjecture which asserts that the decomposition for a set of polynomials can be computed from that of its homogenization and show that the conjecture is valid with high probability for quartic polynomials.Finally,the authors prove that the right decomposition factors for a set of polynomials can be computed from its right decomposition factor space.     

模糊加工时间调度问题的研究

提出模糊加工时间调度问题,隶属函数建立在工件的模糊加工时间上,隶属度表示工件在一段加工时间下属于完工集合的程度,在假设工件的隶属函数是单调递增的情况下,的多个工件所迭加的联合隶属函数所对应的性质,根据迪些性质研究了一种单机模糊加工时间的调度模型。     

多准则、多目标决策评价系统的设计与实现

以导弹系统设计方案评应用为背景,针对多准则、多目标的决策问题,研究和设计系统化的决策评价体系,完成具有核心功能的,通用性、实用性较好的多准则、多目标决策评价工具,对复杂的决策问题提供决策支持。