基于GIS的城市公交查询系统的研究与实现

基于城市公交基础信息和乘客出行的特点,综合利用Web数据库和Web GIS技术,进行了相关功能模块的划分与开发.本系统可直观、方便地为乘客的公交出行提供准确、及时、优化的信息服务和出行辅助计划.     

面向低需求时空的实时预定公交动态调度系统

为改善城市低需求时空下交通供需不平衡问题,提出一种面向交通低出行需求场景的实时预定公交动态调度系统。当低需求时空下的出行者发出预定请求后,调度系统根据时空阈值筛选出满足条件的公交集;采用启发式最短路径算法和Python工具实现动态公交的路径规划;并利用响应判断函数计算出效益为正的公交子集,估算出公交预期到站时间并按到站时间由短至长排列出供乘客选择的公交方案,调度系统根据乘客选定方案指派公交并实时反馈公交信息给乘客。以重庆市396路公交线路为案例,验证了提出系统的可实施性;在三种乘客比例情景下测算乘客候车时间并与传统模式进行对比,结果表明,公交发车间隔增加20%时,乘客候车时间仍将减少53%以上。实时预定公交动态调度系统可有效提高低需求时空下乘客出行效率和公交运营效率。     

可变线路式公交的两阶段车辆调度模型

针对可变线路式公交设计了一种可同时处理预约需求和实时需求的两阶段车辆调度模型.第1阶段模型以预约需求为服务对象,建立了以乘客出行成本和车辆运营成本最小为目标的路径优化模型,采用模拟退火算法对模型进行求解,获得车辆初始行驶路径方案.第2阶段模型以实时需求为服务目标,在原定行驶路径方案上利用启发式插入算法将4类乘客排入车辆行车计划中.基于实例的仿真试验验证了两阶段车辆调度模型的可行性,结果表明:通过提高乘客预约出行比例的方式可提升系统性能,本例中当乘客需求量达到25人/h、预约出行比例达到70%时,系统整体性能相较于纯动态需求条件下提升近10%.     

考虑换乘时间需求的响应型接驳公交系统的协调优化

乘客换乘时间需求是响应型接驳公交提供换乘服务时应考虑的一个重要因素.为此,提出一种考虑换乘时间需求的响应型接驳公交运行路径与调度协调优化方法.首先,将乘客按是否有特定换乘班次需求进行分类;然后,以同时接送模式下响应型接驳公交为研究对象,以乘客与运营商的效用加权之和最大为目标,以乘客换乘时间需求、乘客预约时间窗、车辆容量、车辆单程最大行程时间等为约束,构建发车间隔和运行路径一体化的协调优化模型,并基于遗传算法设计求解算法;最后,以长沙市地铁一号线尚双塘站周边区域为例进行实例分析.结果 表明:与单接单送模式相比,同时接送模式系统的总效用提升了17.1％,同时接送模式的优越性显著;乘客换乘时间需求导致系统的总效用降低了9.42％,但考虑换乘时间需求提升了乘客的换乘效率,降低的系统总效用是可接受的;中小型车比较适合响应型接驳公交系统.     

基于XML的异构数据源间数据交换的实现研究

基于Web Service、XML等设计开发了可配置的灵动数据集成中间件,用于不同数据库系统之间的数据迁移,很好地解决了异构系统之间的数据集成问题,该中间件具有的可扩展性和随需应变的能力,可以适应企事业单位不断发展的信息化需要.详细介绍了数据集成中间件的结构和实现功能,并在基于关系型数据库的档案和办公系统的数据集成中应用了该方案,为用户提供可配置的使用方式.     

天津市轨道交通最优路径换乘查询系统

针对目前城市交通线网规划日渐复杂,乘客在选择换乘出行时易出现衔接导向不明确、局部换乘供需不平衡等问题,以天津市轨道交通为例,应用通用性、可移植性较强的SPFA算法对最优换乘路径做了系统性优化,从换乘乘客角度出发,本着最少换乘站数及最短换乘时间两方面原则,应用Microsoft Access作为数据库开发工具,基于Visual Basic语言设计最优换乘系统,为用户提供最优换乘路径,并提示乘客换乘所需时间及站数等,从根本上解决乘客因换乘所带来的出行困扰。     

公交出行查询系统中出行路径选择模型的研究

在公交出行查询系统中,最关键的部分就是出行路径的选择问题。为了帮助利用公交的出行者方便地进行出行路径、换乘路线等选择,文章首先对公交乘客出行路径的选择因素进行了简要分析,然后分别讨论了换乘次数算法和最短路算法,最后基于组合优化的角度,在两者的基础上对它们进行了综合,针对大部分乘客的出行需求提出了公交乘客出行路径的选择模型。     

支持Agent软件与Web服务软件互操作的AWIA

针对当前Agent软件系统与Web服务软件系统之是无法互操作和集成问题,设计并实现了一个JADE插件AWIA,该插件在Agent软件与Web服务软件之间建立了一座桥梁,提供了一系列的软件开发接口,可有效实现Agent软件与Web服务软件之间的相互访问.AWIA充分利用JADE的扩展机制和XFire的可嵌入特点,将XFire模块包装后插入JADE系统,使用该平台开发者可方便地开发能够提供Web服务或访问Web服务的Agent,从而实现Agent软件与Web服务软件的集成.该方法相比以往的集成实现方法具有性能高、实现简单、部署灵活、支持并行等特点.本文详细介绍了AWlA的技术框架和实现的技术细节,并通过案例分析来验证技术和插件的可行性和有效性.     

基于佛洛依德算法的各院校间最短路径问题的求解

利用弗洛伊德算法通过邻接矩阵D和路径矩阵P,文中不仅计算出了最短路径,还找出了该最短路径下所经过的结点,从而为应用系统的开发与设计提供理论依据和实现技术。     

基于构件的若干图算法开发和生成

软件构件技术可显著提高程序的可靠性和开发效率,极大减少开发成本.泛型程序设计有助于降低编程的复杂度,为重用构件开发提供有效支持.介绍了生成式程序设计思想及泛型程序设计技术,分析了图算法领域的关键特征及领域共性问题,并对广度优先搜索、单源最短路径、所有顶点对最短路径等一类问题进行抽象,设计出相应的泛型图算法构件,进一步借助PAR方法中的泛型机制进行描述,并在PAR平台程序生成系统上进行构件组装生成具体的算法程序.     

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.