实时图像处理系统的软件开发技术研究

本文分析了图像处理系统中不同编程方法的处理效率,提出了基于实式下直接访问４ＧＢ内存及其Ｃ程序设计方法,从而实现了对扩展内存中的图像数据进行直接访问和运算。最后,讨论了应用ＶＥＳＡ视频接口时行图像显示的编程方法。     

Rescheduling through stop-skipping in dense railway systems

Based on the analysis of the railway system in the Paris region in France, this paper presents a rescheduling problem in which stops on train lines can be skipped and services are retimed to recover when limited disturbances occur. Indeed, in such mass transit systems, minor disturbances tend to propagate and generate larger delays through the shared use of resources, if no action is quickly taken. An integrated Integer Linear Programming model is presented whose objective function minimizes both the recovery time and the waiting time of passengers. Additional criteria related to the weighted number of train stops that are skipped are included in the objective function. Rolling-stock constraints are also taken into account to propose a feasible plan. Computational experiments on real data are conducted to show the impact of rescheduling decisions depending on key parameters such as the duration of the disturbances and the minimal turning time between trains. The trade-off between the different criteria in the objective function is also illustrated and discussed.     

Non-discriminatory train dispatching in a rail transport market with multiple competing and collaborative train operating companies

Train dispatching is vital for the punctuality of train services, which is critical for a train operating company (TOC) to maintain its competitiveness. Due to the introduction of competition in the railway transport market, the issue of discrimination is attracting more and more attention. This paper focuses on delivering non-discriminatory train dispatching solutions while multiple TOCs are competing in a rail transport market, and investigating impacting factors of the inequity of train dispatching solutions. A mixed integer linear programming (MILP) model is first proposed, in which the inequity of competitors (i.e., trains and TOCs) is formalized by a set of constraints. In order to provide a more flexible framework, a model is further reformulated where the inequity of competitors is formalized as the maximum individual deviation of competitors’ delay cost from average delay cost in the objective function. Complex infrastructure capacity constraints are considered and modelled through a big M-based approach. The proposed models are solved by a standard MILP solver. A set of comprehensive experiments is conducted on a real-world dataset adapted from the Dutch railway network to test the efficiency, effectiveness, and applicability of the proposed models, as well as determine the trade-off between train delays and delay equity.     

Fuzzy neural network control of underwater vehicles based on desired state programming

1 Introduction1 With the development of the activities in deep sea, the application of underwater vehicle is widespread. However, owing to the nonlinearity and unpredictable operating environment of underwater vehicles, many factors must be taken into con…     

基于Web的程序执行效果动态演示软件的设计

程序的单步演示有利于学生理解程序的执行流程,也方便教师的讲解.本文介绍的演示软件采用Java Applet编程实现,该软件具有较大适应性,被演示程序和执行效果描述均通过Applet参数传递.     

城市道路交通网络容量问题分析

城市道路网络容量是判断现状城市道路网是否处于一种平衡稳定状态的重要决策变量。在对路网容量影响因素进行分析的基础上,将路网容量计算方法按照微观和宏观2个层面划分。针对研究路网容量存在的问题,提出一种新的基于出行者随机路径选择的研究路网容量方法,为今后深入研究在复杂道路条件下的路网容量提供科学理论依据和技术路线。     

北京地铁双超列车运行图编制方法

为研究疫情期间北京地铁"超常"条件下的"超强"运行图编制方法,根据"双超"运行图编制流程提出一种面向车厢低满载率的双层规划优化模型.上层模型基于客流的时空分布规律优化列车的开行方案;下层模型优化列车运行图中全周转运行时分,停站时分,运行时分,折返时分等要素.双层规划模型转化为线性模型并用CPLEX软件通过迭代算法求解"...     

���ڶ�̬�滮�ij��н�ͨ��Ԥ�������

城市交通系统是一个复杂的大系统,针对交通流的不确定性,本文基于动态规划思想提出了交通流预测与分配的方法。考虑路段容量对交通分配的影响,建立了路网流量预测和分配模型。为了保持并充分利用传统网络模型的性质和特征,引入惩罚函数,将容量约束条件转换到目标函数中,使模型符合传统均衡网络流结构。将凸规划法作为一个子过程植入惩罚函数,得到模型的求解算法。控制策略上采取预测控制、反馈校正和滚动优化的方式。最后,通过算例分析,进一步阐述模型和算法的应用,验证算法的有效性。为交通流预测和分配提供一定的参考。     

��Ͻ�ͨ������Ƽ����߿�¡�˻��㷨����о�

研究混合交通网络设计问题,以交通网络总阻抗最小为目标,在建设资金的约束条件下给出了双层规划模型。将模拟退火算法中的退火策略引入到免疫克隆算法中,设计了求解模型的免疫克隆退火算法。算例验证了算法的可行性,并通过与模拟退火算法比较证明了设计算法的有效性。最后,在给定不同建设资金的约束条件下进行了灵敏度分析,并讨论了投资成本与网络总阻抗、建设资金约束与网络设计决策的关系。     

Sensitivity Analysis of Simulated Annealing for Continuous Network Design Problems

In this paper, parameters choices of simulated annealing for continuous network design problems are discussed. A bi-level programming model for continuous network design problem is introduced. Objective function of the upper level is defined as the sum of the total travel time on the network and the total investment costs of link capacity expansions. The lower level problem is the user equilibrium assignment model, which is solved by the Gradient projection algorithm. Sensitivity analysis method is the first time used to analyze and compare the influence of the different selection of parameters to the implementation of simulated annealing algorithm. Suggestions of parameter selection are also given. Analysis demonstrates that the efficiency and precision of these methods can be improved clearly with the proposed suggestions.