快速公交系统票制票价敏感性分析

快速公交（BRT）因其快速、便捷、高效等优良品质被许多城市采用，近年来，在世界各地发展迅猛。票制票价作为BRT系统的重要组成部分也受到了关注。介绍国际国内城市的BRT票制票价情况，对票制票价的敏感性进行分析。从昆明市的实际情况出发，结合公众意愿调查数据，分析居民公交费用支出对居民收入、出行时耗、舒适度以及拥挤收费的影响情况，为昆明市BRT系统的改造与提升提供基础支撑。     

网络化SCADA系统调度端设计及可靠性分析

提出了一种高性能网络化ＳＣＡＤＡ系统调度端的设计方案，给出了其硬件结构图及网络软件设计框图，并建模分析了系统可靠性，该设计方案已成功地应用了于京郑线及湘黔线ＳＣＡＤＡ系统。     

一种实用路由器的设计研究

基于一个已完成的部级科研项目的研究，提出了一种实用的可用于互联中小型局域网的通用路由器的总体设计方案。说明了路由器的功能需求，着重从软硬件设计上讨论了其实现过程。     

大型机电设备仿真建模的智能方法研究

本文提出了一种基于神经网络的大型机电设备仿真建模智能方法，详细讨论并解决了该法实施过程中的若干关键技术问题。通过对某船用蒸气动力装置简易训练模拟器进行仿真建模研究，表明该法对大型机电设备的仿真建模非常有效。     

水声网络探测节点的一种运动目标参数估计算法

文章提出了一种水声网络探测节点的运动目标参数估计方法,即基于模型匹配原理的估计算法。给出了算法的原理和仿真分析。     

水下分布式远程感知技术的发展

目前,水下分布式远程感知技术已经具备了快速发展的基本条件,备受各主要海军国家的重视,预期在未来5~10年内将会有重大进展。但水下分布式远程感知技术的发展还面临着从基础、理论到实践的众多课题,包括系统构成和运用的概念,分布式传感器阵对目标的探测、分类和识别,固定、可部署传感器和移动节点构成的传感器场的配置,水下分布式网络的通信和控制,以及系统的部署和保障等。本文讨论水下分布式远程感知系统的基本组成,实现系统功能所面临的主要挑战,需要关注的主要关键技术,并提出相应的看法和建议。     

A New Wireless Packet Scheduling Algorithm Based on EDF and Its Application in Multi-bottleneck Networks

Most of current wireless packet scheduling algorithms aim at resource allocation as fairly as possible or maximizing throughput. This paper proposed a new packet scheduling algorithm that aims at satisfying delay requirement and is the improvement of earliest due first (EDF) algorithm in wired networks. The main idea is to classify the packets based on their delay bound, scheduling the most "urgent" class of user and the users that have the best channel condition with higher priority. This algorithm can easily integrate with common buffer management algorithms, when buffer management algorithm cannot accept new arrival packets, try to modify scheduling policy. Packet scheduling algorithms in multiple bottleneck wireless networks were also discussed. A new variable multi-hop factor was defined to estimate the congestion situation (including channel condition) of future hops. Multi-hop factor can be integrated into packet scheduling algorithms as assistant and supplement to improve its performance in multi-bottleneck wireless networks.     

一种基于单个移动信标的分布式节点定位算法

定位是无线传感器网络中最重要的功能之一。通过利用一个移动信标节点（装备GPS或提前设定了移动路线）来帮助各个未知节点进行自身定位。信标节点周期性的发送自己位置信息给周围的未知节点,未知节点通过非测距技术估计自身位置。信标节点的移动路径在文中也进行了探讨。仿真结果说明了本文方法的有效性。     

Competition and disruption in a dynamic urban supply chain

Rapid changes and complexities in business environments have stressed the importance of interactions between partners and competitors, leading supply chains to become the most important element of contemporary business environments. There is a concomitant need for foresight in describing supply chain performance in all operating environments, including those involving punctuated disruptions. Furthermore, the urban metropolis is now widely recognized to be an environment which is especially vulnerable to supply chain disruptions and for which integrated supply chain decisions can produce very substantial net benefits. Accordingly, this paper presents a dynamic supply chain network model formulated as a differential variational inequality; the model is fashioned to allow consideration of supply chain disruption threats to producers, freight carriers, and retail enterprises. The DVI is solved using a fixed-point algorithm, and a simple numerical example, introduced to illustrate how the impacts of supply chain disruptions may be quantified, is presented.     

Schedule-based transit assignment model with vehicle capacity and seat availability

In this paper, we propose a new schedule-based equilibrium transit assignment model that differentiates the discomfort level experienced by sitting and standing passengers. The notion of seat allocation has not been considered explicitly and analytically in previous schedule-based frameworks. The model assumes that passengers use strategies when traveling from their origin to their destination. When loading a vehicle, standing on-board passengers continuing to the next station have priority to get available seats and waiting passengers are loaded on a First-Come-First-Serve (FCFS) principle. The stimulus of a standing passenger to sit increases with his/her remaining journey length and time already spent on-board. When a vehicle is full, passengers unable to board must wait for the next vehicle to arrive. The equilibrium conditions can be stated as a variational inequality involving a vector-valued function of expected strategy costs. To find a solution, we adopt the method of successive averages (MSA) that generates strategies during each iteration by solving a dynamic program. Numerical results are also reported to show the effects of our model on the travel strategies and departure time choices of passengers.