基于收费数据的高速公路站间旅行时间预测

针对高速公路断面检测数据密度不足现状,采用收费数据预测收费站间车辆旅行时间。首先,研究收费数据实时修正处理方法,改进平均旅行时间计算模型;其次,引入分段线性插值方法构建卡尔曼滤波模型,以减小卡尔曼滤波线性化产生的模型误差问题;接着,依据旅行时间预测业务逻辑开发应用系统,实时主动预测高速公路站间旅行时间。示范路段应用表明,插值后预测算法在正常、事故、小长假三种交通流状态下所有周期平均相对误差控制在10%内,事故周期平均相对误差控制在13%内。插值后算法预测精度有效提高,可为高速公路公众出行提供时间参考。     

高速公路旅行时间的自适应插值卡尔曼滤波预测

为解决高速公路收费站间非平稳交通流状态下因卡尔曼滤波算法自适应性能差而导致的旅行时间预测精度不稳定的问题,提出等间距插值和Sage-Husa自适应卡尔曼滤波相结合的预测算法。融合人工半自动收费和电子不停车收费数据计算平均旅行时间;引入等间距插值方法重构实时与历史旅行时间之间的时间序列;利用最小二乘法原理构建Sage-Husa自适应预测模型;开发旅行时间预测应用系统,实时主动预测高速公路站间旅行时间。在某示范路段的应用表明:在正常、事故、小长假3种交通流状态下,所提方法的所有周期平均相对误差均在7.5%内,事故周期平均相对误差均在10%内.     

基于基线漂移校正的旅行时间预测模型

路段旅行时间及其预测值是管理部门实施交通流组织,提供交通信息服务的重要依据,也是出行者合理选择出行路径的重要参考.文中基于浮动车检测数据研究了路段旅行时间的计算算法及数据预处理方法;分析了旅行时间序列中的基线漂移现象,并运用小波分析法给出了基线漂移的校正方法以达到对时间序列降噪处理的目的;最后,基于自回归移动平均法建立了路段旅行时间的预测模型,并选取实际数据验证了文中模型的有效性和精确性.     

基于收费数据的高速公路交通状态判别方法

目前高速公路交通数据资源未得到充分利用,使得管理和建设成本较高的高速公路联网收费系统只能实现车辆记录、联网收费等初级功能,导致交通数据资源的严重浪费.为此设计了基于高速公路联网收费数据的路段行程时间估计方法,提出以大、小车速度变化情况为基础,采用模糊C-均值聚类方法对高速公路交通状态进行判别,并应用VISSIM软件分别对上述两种方法验证分析.结果表明,路段行程时间估计方法能够获得高质量的路段行程时间数据,同时交通状态判别方法也能够准确判别出道路上所呈现的交通状态,可为历史数据更新提供技术支持,为高速公路交通管理部门提供精确的决策依据.     

基于J2EE架构的高速公路联网收费系统

随着我国高速公路的不断发展,原来的单一路段独立收费管理模式逐渐的发展为多路段联合收费管理模式.但与此同时,这也对现有的高速公路收费系统提出了进一步的要求,需要将现有的收费系统进行集成.为解决这一问,本文通过使用J2EE架构来实现对不同高速公路路段收费系统之间的集成.为企业应用集成(EAI)提供实现的可能性.     

基于模糊神经网络的短时公交到站时间预测

研究了中国公交运营特点,利用全球定位系统和电子票务收费系统收集的车辆实时信息,建立了路段和站点补偿模糊神经网络模型,分别预测车辆的路段行驶时间和站点停留时间.路段预测模型的输入是所有重合线路的站点行驶数据,改变了现有预测模型只采用单线路数据的不足.以济南市一条实际公交线路为例,利用VISSIM模拟专用道和非专用道两种道...     

基于GPS轨迹数据的拥堵路段预测

基于真实的GPS轨迹数据,对城市拥堵路段进行预测.在此过程中,摒弃传统的基于交通流预测和拥堵识别的方法,提出一种新的基于拥堵向量和拥堵转移矩阵的拥堵路段预测方法.该方法同时考虑路段拥堵的时间周期性和时空相关性,通过对出租车GPS轨迹数据进行挖掘和训练,建立拥堵向量和拥堵转移矩阵,实现对拥堵路段的预测.真实数据集上的实验验证了所提的拥堵路段预测方法的有效性.     

基于Carsim的弯道路段行车轨迹研究

针对受驾驶人自身驾驶经验和习惯、视野、道路周边环境等因素影响的车辆行驶轨迹,探究了典型车辆行驶轨迹(正常轨迹、理想轨迹、切线轨迹、漂移轨迹、摇摆轨迹和修正轨迹)条件下的车辆动力学响应. 在Carsim环境中构建了以6种行车轨迹为道路中心线的弯道路段,并使车辆的左前轮始终沿道路中心线行驶,仿真过程中记录车辆动力学参数的时变曲线. 研究表明:车辆沿切线和正常轨迹行驶时,能够以安全、高效、舒适的理想状态通过弯道路段;而当车辆沿修正轨迹、摇摆轨迹等行驶时,行驶稳定性和舒适性较差.     

基于R-FP OP变点检测的城市路段旅行时间预测

针对城市路段旅行时间精准推送的不足,提出一种基于动态规划变点检测算法的旅行时间预测方法。以车牌识别数据为研究对象,利用R-FPOP算法对旅行时间均值变点进行在线检测,研究变点时域分布特征;基于均值变点检测结果,预测旅行时间并给出其预测区间。结果表明:在线检测出的变点能够有效辨识旅行时间的均值突变,变点时域分布主要集中在高峰期;旅行时间预测值对实际序列变化趋势估计准确,推送的预测区间平均覆盖率为79.54%,具有较优的预测精度。论文方法兼顾旅行时间均值突变且建模简单,可为路段旅行时间的在线智能推送及交通需求者的路线规划提供技术支持。     

策略性等待下Y型瓶颈的单步拥堵收费模型

本文针对包含至少一个上游瓶颈路段和一个共用的下游瓶颈路段的Y型交通路网,研究了策略性等待单步收费条件下早高峰期间通勤者的出行行为和最优道路拥挤收费方案。基于出行者的出发时间选择遵循用户均衡准则的假设,推导出了不同汇合规则下用户均衡的流入率和个人出行成本。依据出行者的出发时间选择规律,进一步推导出了最优的道路拥挤收费时段和费率。研究发现,策略性等待单步收费可以有效降低交通网络的系统总阻抗,但可能会增加出行者的个人出行成本。此外,还发现收费的有效性不但与汇合规则有关,还取决于上下游瓶颈路段通行能力的相对大小。该研究验证了Y型交通路网上存在Braess诡异现象,即扩大上游路段的瓶颈通行能力可能会引起系统总出行成本的增加。     

Characterization of Ordovician carbonate reservoirs, southeastern Saskatchewan, Canada

The discovery of the prolific Ordovician Red River reservoirs in 1995 in southeastern Saskatchewan was the catalyst for extensive exploration activity which resulted in the discovery of more than 15 new Red River pools. The best yields of Red River production to date have been from dolomite reservoirs. Understanding the processes of dolomitization is, therefore, crucial for the prediction of the connectivity, spatial distribution and heterogeneity of dolomite reservoirs.The Red River reservoirs in the Midale area consist of 3～4 thin dolomitized zones, with a total thickness of about 20 m, which occur at the top of the Yeoman Formation. Two types of replacement dolomite were recognized in the Red River reservoir: dolomitized burrow infills and dolomitized host matrix. The spatial distribution of dolomite suggests that burrowing organisms played an important role in facilitating the fluid flow in the backfilled sediments. This resulted in penecontemporaneous dolomitization of burrow infills by normal seawater. The dolomite in the host matrix is interpreted as having occurred at shallow burial by evaporitic seawater during precipitation of Lake Almar anhydrite that immediately overlies the Yeoman Formation. However, the low δ18O values of dolomited burrow infills (-5.9‰～ -7.8‰, PDB) and matrix dolomites (-6.6‰～ -8.1‰, avg. -7.4‰ PDB) compared to the estimated values for the late Ordovician marine dolomite could be attributed to modification and alteration of dolomite at higher temperatures during deeper burial, which could also be responsible for its 87Sr/86Sr ratios (0.7084～0.7088) that are higher than suggested for the late Ordovician seawaters (0.7078～0.7080). The trace amounts of saddle dolomite cement in the Red River carbonates are probably related to "cannibalization" of earlier replacement dolomite during the chemical compaction.     

A computer generator for randomly layered structures

AcomputergeneratorforrandomlylayeredstructuresYUJia shun1,2,HEZhen hua2(1.TheInstituteofGeologicalandNuclearSciences,NewZealand;2.StateKeyLaboratoryofOilandGasReservoirGeologyandExploitation,ChengduUniversityofTechnology,China)Abstract:Analgorithmisintrod…     

海南岛地体及其毗邻陆缘晚中生代—新生代古地磁研究和构造演化

本文叙述了对海南岛及其毗邻大陆边缘白垩纪到第四纪地层岩石进行古地磁研究的全部工作过程。通过分析岩石中剩余磁矢量的磁偏角及磁倾角的变化,提出海南岛白垩纪以来经历的构造演化模式如下:早期伴随顺时针旋转而向南迁移,后期伴随逆时针转动并向北运移。联系该地区及邻区的地质、地球物理资料,对海南岛上述的构造地体运动提出以下认识:北部湾内早期有一拉张作用,主要是该作用使湾内地壳显著伸长减薄,形成北部湾盆地。从而导致了海南岛的早期构造运动,而海南岛后期的构造运动则主要是受南海海底扩张的影响。海南地体运动规律的阐明对于了解北部湾油气盆地的形成演化有重要的理论和实际意义。     

Exciton Seebeck in Molecular Systems

Various applications relevant to the exciton dynamics,such as the organic solar cell,the large-area organic light-emitting diodes and the thermoelectricity,are operating under temperature gradient.The potential abnormal behavior of the exicton dynamics driven by the temperature difference may affect the efficiency and performance of the corresponding devices.In the above situations,the exciton dynamics under temperature difference is mixed with     

Achieving Unusual States of Matter Under High Pressure

The elongation method,originally proposed by Imamura was further developed for many years in our group.As a method towards O(N)with high efficiency and high accuracy for any dimensional systems.This treatment designed for one-dimensional(ID)polymers is now available for three-dimensional(3D)systems,but geometry optimization is now possible only for 1D-systems.As an approach toward post-Hartree-Fock,it was also extended to     

《Chinese Science Bulletin》SUBJECT INDEX TO VOLUME 59(2014)

正~~     

An on-line scaling method for improving scalability of a database cluster

The explosive growth of the Internet and database applications has driven database to be more scalable and available, and able to support on-line scaling without interrupting service. To support more client's queries without downtime and degrading the response time, more nodes have to be scaled up while the database is running. This paper presents the overview of scalable and available database that satisfies the above characteristics. And we propose a novel on-line scaling method. Our method improves the existing on-line scaling method for fast response time and higher throughputs. Our proposed method reduces unnecessary network use, i.e. , we decrease the number of data copy by reusing the backup data. Also, our on-line scaling operation can be processed parallel by selecting adequate nodes as new node. Our performance study shows that our method results in significant reduction in data copy time.     

An improved R-tree based on childnode''s probability

R-Tree is a good structure for spatial searching. But in this indexing structure,either the sequence of nodes in the same level or sequence of traveling these nodes when queries are made is random. Since the possibility that the object appears in different MBR which have the same parents node is different, if we make the subnode who has the most possibility be traveled first, the time cost will be decreased in most of the cases. In some case, the possibility of a point belong to a rectangle will shows direct proportion with the size of the rectangle. But this conclusion is based on an assumption that the objects are symmetrically distributing in the area and this assumption is not always coming into existence. Now we found a more direct parameter to scale the possibility and made a little change on the structure of R-tree, to increase the possibility of founding the satisfying answer in the front sub trees. We names this structure probability based arranged R-tree (PBAR-tree).     

Integrating GIS Web services based on mediating architecture

The geographic information service is enabled by the advancements in general Web service technology and the focused efforts of the OGC in defining XML-based Web GIS service. Based on these models, this paper addresses the issue of services chaining,the process of combining or pipelining results from several interoperable GIS Web Services to create a customized solution. This paper presents a mediated chaining architecture in which a specific service takes responsibility for performing the process that describes a service chain. We designed the Spatial Information Process Language (SIPL) for dynamic modeling and describing the service chain, also a prototype of the Spatial Information Process Execution Engine (SIPEE) is implemented for executing processes written in SIPL. Discussion of measures to improve the functionality and performance of such system will be included.     

Tracking data management using topology of moving object database system for moving object constrained trajectory in LBS application

Advances in wireless technologies and positioning technologies and spread of wireless devices, an interest in LBS (Location Based Service) is arising. To provide location based service, tracking data should have been stored in moving object database management system (called MODBMS) with proper policies and managed efficiently. So the methods which acquire the location information at regular time intervals then, store and manage have been studied. In this paper, we suggest tracking data management techniques using topology that is corresponding to the moving path of moving object. In our techniques, we update the MODBMS when moving object arrived at a street intersection or a curved road which is represented as the node in topology and predict the location at past and future with attribute of topology and linear function. In this technique, location data that are corresponding to the node in topology are stored, thus reduce the number of update and amount of data. Also in case predicting the location,because topology are used as well as existing location information, accuracy for prediction is increased than applying linear function or spline function.