过饱和交叉口信号配时方法的优化及实证研究

在城市道路交叉口交通管理的信号控制常用信号配时方法,对于饱和度较低的交叉口有较好的交通调控作用;但实际交通管理的高峰时段常常会出现过饱和交叉口,信号配时方法就显示出不适应性。针对饱和交叉口的交通特性进行分析,采用了一种考虑进口道排队长度的信号配时模型,通过与传统配时模型的比较并进行了实例验证,得出这种模型更适合对过饱和交叉口的交通控制。     

信号交叉口汽车燃油消耗的研究

为探索交叉口信号灯的设置对汽车燃油消耗影响的规律，对信号交叉口汽车的运行过程进行了分析，研究了汽车在通信信号交叉口时减速、怠速停车、加速离开过程中的燃料油消耗，并得出了相应的计算方法，在此基础上，建立了信号交叉口的汽车燃油消耗增量增模型，并对该模型的应用进行了分析，该模型可为信号交叉口的信号配时的优化，交叉口设计与渠化，运输成本分析等提供参考。     

近距离交叉口信号配时协调控制方法研究

连续近距离信号灯控制交叉口采用协调控制,可以提高车辆运行速度,减小路段总延误。对北京市白云路莲花池东路至长安街段的四个近距离交叉口,运用交通调查数据,分析了目前信号配时方案及交通运行中存在的问题,按照交叉口信号配时协调控制设计的方法,确定了交叉口信号协调方案,并对配时方案的效果进行了分析评价,结论表明合理的信号协调控制可达到降低交叉口延误的目的。通过该实例研究获得了近距离灯控交叉口信号配时应注意的问题。     

单交叉口信号配时软件设计

经济的发展、人民生活水平的提高以及小汽车数量的剧增,对现在交通造成越来越大的压力,特别是对交叉口通行能力造成很大影响.平面交叉口是城市交通的关键,它是整个城市道路的瓶颈地带,对其交通信号控制方法进行研究具有重大意义.从定时控制着手,解决单交叉口信号控制中人工配时计算复杂的问题,运用VB软件对交叉口进行单点配时研究,从而提高配时计算效率.基于单交叉口信号控制目前存在的问题,进行了如下研究:首先介绍了单点定时信号控制算法及基本工作原理;其次,设计了一种基于VB软件的单交叉口定时信号配时软件,运用这个软件,根据交叉口实际交通情况选择合理的定时信号配时方案.     

考虑交通流不确定性的单交叉口信号配时方法

为应对交通系统的随机特性,提出一种考虑不确定性的单交叉口信号配时方法。首先应用季节性自回归平均移动-广义自回归条件异方差(seasonal autoregressive integrated moving average-generalized autoregressive conditional heteroskedasticity,SARIMA-GARCH)模型计算交叉口交通流的不确定性,然后根据得到的交通流不确定性特征,参考Webster模型,计算交叉口的信号配时参数,得到考虑交通流不确定性的单交叉口信号配时方案。最后,以南京市一交叉口为研究对象,应用实际数据,计算得到17种不同交通不确定性水平下的单交叉口配时参数,并采用Paramics仿真软件分析了各信号配时方案的性能,验证了所提方法的有效性。     

基于知识的信号交叉口配时设计系统

信号配时是影响信号交叉口通行能力的关键,本文根据专家系统的有关理论和信号交叉口的配时设计原理,研究了一种基于信号交叉口配时设计系统,并编写了相应的软件,研究该系统的主要出发点是基于交通流的随机性和不确定性较强,难以用精确的数学模型加以描述,但是可以根据经验进行适当的分析。     

城市信号控制交叉口信号周期时长优化模型

提出一种新的城市道路交叉口信号配时方法,同以信方法相比,新方法更适应交叉口的交通特征,更符合信号实时变化的特点,可以作为交叉口交通信号自适应控制的配时基础。     

考虑区域交通信号配时优化的公交专用道线网规划

在公交专用道线网实际规划时,需要综合考虑交叉口延误与信号配时等因素的影响。为了使公交专用道线网规划更加合理,在考虑区域信号配时优化的条件下,以绿信比作为各个交叉口的信号配时优化变量,建立了双层规划模型,上层模型的目标函数是使网络的总出行时间最小,下层模型由交通方式划分模型、小汽车客流分配模型和公交客流分配模型3部分组成,并采用遗传算法对模型进行了求解,通过算例验证了模型的有效性。结果表明：在进行公交专用道线网规划时,交叉口的延误不可忽略;在考虑交叉口延误的基础上,对区域信号配时优化可进一步降低网络的出行总成本。     

考虑区域交通信号配时优化的公交专用道线网规划

在公交专用道线网实际规划时,需要综合考虑交叉口延误与信号配时等因素的影响。为了使公交专用道线网规划更加合理,在考虑区域信号配时优化的条件下,以绿信比作为各个交叉口的信号配时优化变量,建立了双层规划模型,上层模型的目标函数是使网络的总出行时间最小,下层模型由交通方式划分模型、小汽车客流分配模型和公交客流分配模型3部分组成,并采用遗传算法对模型进行了求解,通过算例验证了模型的有效性。结果表明：在进行公交专用道线网规划时,交叉口的延误不可忽略;在考虑交叉口延误的基础上,对区域信号配时优化可进一步降低网络的出行总成本。     

基于Q-强化学习的干道交叉口信号配时模型

交叉口是城市交通的核心和枢纽,要想有效地提升城市交通体系的通行效率,对交叉口信号配时的优化显得尤为必要。由于城市路网中大范围的信号配时方法决策属于模糊决策问题,而且路网中的车辆具有实时性,强化学习的方法可以适用于交通信号配时领域。本文把主流的Q-强化学习方法应用于干道交叉口信号配时,在每个路口以状态空间、信号周期、每个相位绿灯时间为参数建立模型,设置奖惩函数,并以车辆延误为指标,即Q函数,在相邻路口Agent的信息交换之后得出每个路口该时段的最优动作,降低了由于交叉口数量增多造成的各交叉口Agent间信息交互的次数,避免了独立强化学习可能出现的维数灾难、无法长期学习等问题。实验结果表明:基于Q-强化学习的城市干道交叉口信号配时方法相比于固定配时和传统的Q-强化学习策略,能降低车辆延误,提升收敛速度,提高系统效率。     

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).     

An Index mechanism for multi-scale view in spatial databases

There are numerous geometric objects stored in the spatial databases. An importance function in a spatial database is that users can browse the geometric objects as a map efficiently. Thus the spatial database should display the geometric objects users concern about swiftly onto the display window. This process includes two operations:retrieve data from database and then draw them onto screen. Accordingly, to improve the efficiency, we should try to reduce time of both retrieving object and displaying them. The former can be achieved with the aid of spatial index such as R-tree, the latter require to simplify the objects. Simplification means that objects are shown with sufficient but not with unnecessary detail which depend on the scale of browse. So the major problem is how to retrieve data at different detail level efficiently. This paper introduces the implementation of a multi-scale index in the spatial database SISP (Spatial Information Shared Platform) which is generalized from R-tree. The difference between the generalization and the R-tree lies on two facets: One is that every node and geometric object in the generalization is assigned with a importance value which denote the importance of them, and every vertex in the objects are assigned with a importance value,too. The importance value can be use to decide which data should be retrieve from disk in a query. The other difference is that geometric objects in the generalization are divided into one or more sub-blocks, and vertexes are total ordered by their importance value. With the help of the generalized R-tree, one can easily retrieve data at different detail levels.Some experiments are performed on real-life data to evaluate the performance of solutions that separately use normal spatial index and multi-scale spatial index. The results show that the solution using multi-scale index in SISP is satisfying.     

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.