元胞自动机FI交通流模型的能耗研究

在周期边界条件下,通过引入确定(随机)减速过程中动能减少的车辆分布,研究单一交通流元胞自动机Fukui-Ishibashi模型(FI模型)的能耗问题.研究发现,FI交通流模型的能耗在最大流量处发生不连续的变化,急剧减少趋近零,其左右各存在交通能耗极大值.在最大流量处,确定(随机)减速过程中动能减少的车辆分布最小,交通能耗随着车辆最大速度的增大,车辆长度的增长和随机减速概率的增大而增加.     

一维交通流元胞自动机NS模型的统计平均解耦处理

将文献[12]提出的统计平均解藕处理方法推广应用到一维交通流元胞自动机NS模型，根据概率论的定义，建立一维交通流元胞自动机NS模型多格点耦合的空间关联函数，得出t→∞情况下平均速度随减速概率和车辆密度变化的平均场方程，通过近似解耦处理得出车辆密度、速度及刹车概率三者的关系，模拟结果表明，车流平均速度与理论结果符合得较好。     

单车道双概率元胞自动机模型

在分析经典一维单车道元胞自动机模型的基础上,提出了改进FI模型的TPFI模型.该模型在FI模型的基础上增加一个新的随机慢化概率,以减少FI模型中过大的瞬时加速度出现的概率.运用TPFI模型来描述交通流参数:密度-流量关系,发现在取得合适的概率值组合的条件下,该模型模拟的密度-流量曲线比其他元胞自动机模型的模拟结果更加接近于实际数据曲线,通过计算机编程实现车辆时空图模拟,验证TPFI模型与FI模型适用于低密度、高速度的交通流仿真.     

驾驶员的驾驶特性对交通流的影响

在单车道元胞自动机交通流N S模型基础上,通过引入不同的刹车概率来反映不同驾驶员的驾驶特性,并在周期边界条件下,对由激进驾驶车辆和谨慎驾驶车辆构成的混合交通流进行模拟.结果表明,在有谨慎驾驶车辆构成的交通流的临界密度以前,混合交通流的流量完全由谨慎驾驶员的特性决定;在谨慎驾驶车辆交通流临界密度以后,混合交通流的流量介于只有激进驾驶车辆和只有谨慎驾驶车辆的流量之间,小于完全是谨慎驾驶车辆流量和完全是激进驾驶车辆流量的线性之和;激进驾驶车辆和谨慎驾驶车辆的混合比例及它们的刹车概率对混合交通流的临界密度和流量有很大的影响.     

一维交通流元胞自机改进NS模型研究

本文基于NS交通流模型,优先考虑驾驶的安全性,引入安全概率,考虑仅最高速车辆随机慢化,建立了开放边界条件下改进的NS模型。研究了入口概率、出口概率、车辆最大速度、安全概率等参数对系数流量的影响。改进模型从自由流相转化为堵塞流相或者从堵塞流相转化为最大流相的临界点有所变化。     

考虑时延的网联车混合交通流基本图模型

由于智能网联车的不断发展,未来将出现智能网联车和人工驾驶车共同存在的混合交通流,因此,研究道路上的混合交通有助于解决交通拥堵等问题,具有一定的现实意义。为探究这类混合交通流的流量、密度和速度之间的关系,文中综合考虑智能网联车辆退化和车辆时延,建立了自动驾驶环境下混合交通流的基本图模型。首先,确定交通流中的车辆类型和不同类型车辆的比例,并考虑联网智能车辆跟随人工车辆时发生的车辆功能退化;然后,确定3种车辆的延迟时间并改进每种车辆的跟驰模型;在此基础上,同时考虑车辆时延和车辆功能退化两种因素,推导出交通流平衡时的基本图模型,并对模型中的自由流速度参数进行敏感度分析。研究结果表明,智能网联车对混合交通流的最大流量和最佳密度有积极影响,车辆时延有消极影响,自由流速度则对混合交通流的最大流量有积极影响,对最佳密度有消极影响。SUMO仿真结果表明,在不同场景下仿真得到的流量–密度分布点符合理论曲线,验证了文中理论模型的准确性。     

延迟概率和最大速度对交通流的影响

提出一种改进的单车道混合车辆元胞自动机交通流模型,考虑了车间距、车速对随机延迟概率的影响:当车速预期大于车间距时,其延迟概率较大;当车速预期等于车间距时,其相应的延迟概率较小;当车速预期小于车间距时,其具有的延迟概率最小.按此模型,通过计算机数值模拟,研究了具有不同最大行驶速度、不同随机延迟概率的车辆组成的混合交通流,得到的基本图在自由流区域出现跳变现象,在拥堵区域出现两个流量峰值,表明这是一种同步交通流现象.     

一维元胞自动机随机交通流模型的研究

依据概率论的定义，通过对稳态时关联函数的解耦，给出一维元胞自动机单速随机交通流模型中的关联函数与转入、转出及刹车概率之间的关系，继而进一步得出车辆的密度、速度、流量等物理量随这三个概率变化的理论值，理论结果与实验模拟相一致．     

考虑两次改变驾驶方式的双车道交通流元胞自动机模型

考虑驾驶员在不同交通环境下会变换驾驶方式的真实情况,建立两次改变驾驶方式的双车道交通流元胞自动机模型(TTChange-CA模型).通过数值模拟发现,2种类型车辆的初始混合比例和换道概率对交通流基本没有影响;与只改变一次驾驶方式的双车道模型(TChange-CA模型)相比,TTChange-CA模型提高了系统的流量、速度和临界密度,增加了道路利用率;与双车道SDNaSch模型和WWH模型相比,该模型的速度、流量及时空图的致密程度介于二者之间,更真实地刻画了现实交通流.     

考虑驾驶员特性的混合交通流演化网络特性研究

考虑驾驶员具有不同的驾驶特点,利用元胞自动机NS模型和FI模型的混合模型模拟交通流状态的演化网络,模拟结果表明:混合比例系数虽然对道路交通流的流量和平均速度影响很大,但是不改变交通流状态演化网络的无标度特性;网络模型的无标度特性呈几何分布.     

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.