A theoretical foundation for the relationship between generalized origin–destination matrix and flow matrix based on ordinal graph trajectories

This paper shows the relationship between flow, generalized origin–destination (OD), and alternative route flow from a set of ordinal graph trajectories. In contrast to traffic assignment methods that employ OD matrix to produce flow matrix, we use ordinal trajectory on a network graph as input and produce both the generalized OD matrix and the flow matrix, with the alternative and substitute route flow matrices as additional outputs. By using linear algebra‐like operations on matrix sets, the relationship between network utilization (in terms of flow, generalized OD, alternative route flow, and desire line) and network structure (in terms of distance matrix and adjacency matrix) are derived. Copyright © 2012 John Wiley & Sons, Ltd.     

A mathematical programming technique for matching time-stamped records in logistics and transportation systems

Time-stamped data for transportation and logistics are essential for estimating times on transportation legs and times between successive stages in logistic processes. Often these data are subject to recording errors and omissions. Matches must then be inferred from the time stamps alone because identifying keys are unavailable, suppressed to preserve confidentiality, or ambiguous because of missing observations. We present an integer programming (IP) model developed for matching successive events in such situations and illustrate its application in three problem settings involving (a) airline operations at an airport, (b) taxi service between an airport and a train station, and (c) taxi services from an airport. With data from the third setting (where a matching key was available), we illustrate the robustness of estimates for median and mean times between events under different random rates for “failure to record”, different screening criteria for outliers, and different target times used in the IP objective. The IP model proves to be a tractable and informative tool for data matching and data cleaning, with a wide range of potential applications.     

对体系运行中假记录的探讨

国际安全管理规则（ISM）实施后,各航运公司相继实施了体系化管理,体系的建立与运行推动了各航运公司的各项管理工作,对保障船公司船舶安全与防污染起到了根本性的作用。然而,体系运行的有效性问题一直困扰着各家公司。本文分析了体系运行中＂假记录＂的产生原因、危害及治理方法,仅供同行参考。     

Joint distortion model for progressive image transmission using error correcting arithmetic codes

A novel joint source channel distortion model was proposed, which can essentially estimate the average distortion in progressive image transmission. To improve the precision of the model, the redundancy generated by a forbidden symbol in the arithmetic codes is used to distinguish the quantization distortion and the channel distortion, all the coefficients from the first error one to the end of the sequence are set to be a value within the variance range of the coefficients instead of zero, then the error propagation coming from the entropy coding can be essentially estimated, which is disregarded in the most conventional joint source channel coding （JSCC） systems. The precision of the model in terms of average peak-signal-to-noise has been improved about 0.5 dB compared to classical works. An efficient unequal error protection system based on the model is developed, and can be used in the wireless communication systems.     

船舶管路三维布局优化的变长度编码遗传算法

基于遗传算法提出一种适合船舶管路布局特点的变长度编码技术和相应的遗传算子。该编码方式和遗传算子具有下述的设计特点:保证染色体中的基因相互关联,避免在遗传操作中非法个体的产生;采用有方向指导的随机方式生成初始路径和子路径;根据约束条件划分布局空间;可在三维空间下对船舶管路优化布局进行研究。经仿真试验证明该方法可行、有效,优化结果令人满意。     

基于现代造船模式的船体零件编码研究和应用

基于对现代造船模式下船体分段建造作业的分析,应用编码技术,结合先进设计软件的编码功能,根据船体分段零部件特点,对工程编码、分段编码、组立类型代码、组立编码、零件分类代码、零件号和零件加工代码的设置,组立流向、编码级数和编码完整性,编码体系与TR IBON设计软件的匹配等问题,通过综合研究,建立了一套基于现代造船模式的船体零件编码体系。     

基于IC卡数据挖掘获取公交OD矩阵的方法

以广州市羊城通IC卡以及广州市公交系统信息为例子,探讨了实现基于IC卡信息获取公交客流出行特征的方法。在IC卡数据挖掘和统计基础上,对线路站点OD矩阵、区域OD矩阵进行了推算。相比传统的人工统计法。该方法易于实现,能运用到实际中且运算效率高,适用于海量数据的客流出行特征统计分析。     

VDR图像压缩方法研究

简单介绍了船载航行数据记录仪(VDR)的基本功能、系统结构和工作原理,并对其图像压缩方法作了详细介绍.先分别介绍了离散余弦变换(DCT)和嵌入式零树小波编码(EZW)的优缺点,针对VDR图像压缩的具体情况,提出采用DCT和EZW相结合的方法,可发挥它们的优势,克服缺点,达到更好的压缩效果.     

多媒体教学系统中数据压缩方法的研究

如何在网络上实时地传输图像一直是网络数据传输的难点,作者简单介绍了无损数据压缩中的游程编码和帧间编码,然后提出一种游程编码和帧间编码相结合的混合编码数据压缩方法,实现了网络图像传输中对大量图像数据的快速、高效压缩。     

Fine-grained OD estimation with automated zoning and sparsity regularisation

Given a road network, a fundamental object of interest is the matrix of origin destination (OD) flows. Estimation of this matrix involves at least three sub-problems: (i) determining a suitable set of traffic analysis zones, (ii) the formulation of an optimisation problem to determine the OD matrix, and (iii) a means of evaluating a candidate estimate of the OD matrix. This paper describes a means of addressing each of these concerns. We propose to automatically uncover a suitable set of traffic analysis zones based on observed link flows. We then employ regularisation to encourage the estimation of a sparse OD matrix. We finally propose to evaluate a candidate OD matrix based on its predictive power on held out link flows. Analysis of our approach on a real-world transport network reveals that it discovers automated zones that accurately capture regions of interest in the network, and a corresponding OD matrix that accurately predicts observed link flows.