城际公共交通系统最短路算法

在借鉴城市公共交通最短路算法的基础上,针对城际网络的特点,研究了城际交通换乘路径的选择问题。以最小换乘次数为首要目标,并以此为基础,综合考虑时间、票价等因素,获取城际交通系统最短路。首先提出一种基于Flord算法的最小换乘矩阵及多条最短路的获取方法,然后利用最小换乘路径进行站线搜索与广义费用计算,获取城际交通的最短路,最后通过算例证明了本算法的可行性。     

Cycle Network Planning: Towards a Holistic Approach Using Temporal Topology

ABSTRACT

Current cycle-network planning (CNP) at the local level tends to be dominated by a subjective-pragmatic approach in which it is only possible to consider a limited number of route alignment possibilities and development-sequencing scenarios. Although this method may produce acceptable results, it may also be true that the final design could be improved – and the construction efficiency could be enhanced – by a more comprehensive review of the available options in relation to the objectives of the intervention. Such objectives may include accident reduction, modal shift in favour of cycling, health benefits or strategic expansion of a network. This article presents work undertaken to demonstrate a holistic approach to CNP, based on a logically defined spatio-temporal model and allowing some semi-automated multiobjective optimization of network designs in a GIS-based decision-support system. The model is introduced briefly before a case study applying this model to development of a cycle network in a small town in northeast England is described. The results obtained from this case study and the implications of this research for cycle network planners are discussed.     

Applications of intuitionistic fuzzy set aggregation operators in transport multi-factor project evaluation

Abstract

An intuitionistic fuzzy set (IFS) is a generalisation of a fuzzy set characterised by a truth membership function and a false membership function. The former is a lower bound on the grade of membership of the evidence in favour of a particular element belonging to the set and the latter is a lower bound on the negation of that element belonging to the set derived from evidence against that element belonging to the set. A similar concept is a vague set, though vague sets have been shown to be identical to IFSs. In the context of project evaluation, an IFS may be used to represent the degree to which a project satisfies a criterion and the degree to which it does not. Aggregation of such IFSs has been considered in recent years to identify a best project in terms of several criteria or factors. A particular desirable way to aggregate IFS is in terms of an ordered weighted average (OWA) which can be expressed in different forms such as arithmetic and geometric. In an OWA operator, weights are applied to the position of an element in the aggregation. In addition, hybrid OWA operators may be developed to not only weight the position of elements in the aggregation but the element itself. An example is given relating to the Kuranda Range Road upgrade (Queensland, Australia) which is limited by grade, poor overtaking opportunities, poor horizontal alignment and other constraints and the road is expected to become increasingly congested over the next few years. A more flexible multi-factor decision method is used to identify a ‘best’ project from a set of four alternative projects.     

野草算法优化提取广义切比雪夫滤波器耦合矩阵

介绍了野草算法优化提取广义切比雪夫滤波器耦合矩阵的方法。首先用野草算法控制耦合矩阵相似变换时的旋转角度,通过对目标函数的优化归零,实现对耦合矩阵任意位置元素的消零。接着给出广义切比雪夫滤波器的几种拓扑结构,设置传输零点在任意有限远处,并通过对其耦合矩阵的提取,计算耦合矩阵对应于归一化原型的幅频响应,验证了这种方法的可行性。最后以优化提取的耦合矩阵为基础设计了微带滤波器,测试结果与设计指标相吻合。     

�����������OD�ֲ������Ʒ���

以道路网络的路段流量为基础进行OD分布矩阵估计.与以往文献不同的是本文应用了多层前馈神经网络的方法.由于路段流量与相关的OD矩阵分布之间存在连续性关系,这为神经网络模型的逼近特性提供了可行性.本文的方法适用于OD分布矩阵的实时校正.在已知OD分布矩阵的前提下,对两种情境———试验网络和实际Naples农村道路网进行仿真分析.主成分分析法的应用减少了变量个数并有利于改进输入数据.估计误差相对较低,与分析方法相反的是处理的时间几乎是实时的,因此这种方法可用于动态交通管理.本文的神经网络方法在误差和计算时间方面优于传统商业软件得到的OD估计结果.     

Detecting shifted double JPEG compression tampering utilizing both intra-block and inter-block correlations

Copy-paste forgery is a very common type of forgery in JPEG images.The tampered patch has always suffered from JPEG compression twice with inconsistent block segmentation.This phenomenon in JPEG image forgeries is called the shifted double JPEG(SDJPEG) compression.Detection of SDJPEG compressed image patches can make crucial contribution to detect and locate the tampered region.However,the existing SDJPEG compression tampering detection methods cannot achieve satisfactory results especially when the tampered region is small.In this paper,an effective SDJPEG compression tampering detection method utilizing both intra-block and inter-block correlations is proposed.Statistical artifacts are left by the SDJPEG compression among the magnitudes of JPEG quantized discrete cosine transform(DCT) coefficients.Firstly,difference 2D arrays,which describe the differences between the magnitudes of neighboring JPEG quantized DCT coefficients on the intrablock and inter-block,are used to enhance the SDJPEG compression artifacts.Then,the thresholding technique is used to deal with these difference 2D arrays for reducing computational cost.After that,co-occurrence matrix is used to model these difference 2D arrays so as to take advantage of second-order statistics.All elements of these co-occurrence matrices are served as features for SDJPEG compression tampering detection.Finally,support vector machine(SVM) classifier is employed to distinguish the SDJPEG compressed image patches from the single JPEG compressed image patches using the developed feature set.Experimental results demonstrate the efficiency of the proposed method.     

乡村公路桥梁养护工程决策方法研究

乡村公路桥梁是国家路网的支节点,具有数目众多,养护任务艰巨,养护资金有限等具体特点和实际情况,通过考虑乡村公路桥梁质量水平的影响因素权重,分析应用模糊数学方法建立桥梁养护决策模型,本文以蓟县部分乡村公路桥梁工程为例,对养护决策方法进行了具体阐述和应用,并对其决策成效进行了分析。     

基于完全信息的车速建模及Moore-Penrose广义逆求解

针对交通事故中的车速估计，提出了基于事故中的完全信息建立车速估计数学模型，摒弃传统的仅根据未知量个数建立方程组的方法，意在构造出方程个数多于未知量个数的不相容线性方程组，利用Moore-Penrose广义逆求解未知参数，使与事故车速关联的信息在车速估计中充分体现，从而减小模型误差和数据误差对事故车速估计结果的影响，获得车速的最优估计值。     

汽车方案设计智能决策支持系统

从汽车整体设计的需要出发,分析了汽车总体方案设计的特点。介绍了一种智能化方案设计推理决策系统,该系统是在一个面向对象的数据库管理系统基础上开发的。在ACDIDSS中,问题求解主要采用基于实例的推理,辅之以基于规则的推理模式。论述了ACDIDSS系统的设计思想和各个主要模块的功能,并重点介绍了实例推进器的设计与实现。