井底车场列车运行状态分析

长期以来,对列车在井底车场的运行状态未进行过详细分析与讨论。现行井底车场设计,未将列车驶入车场(输入)与列车卸载(输出),建立起相互影响、相互联系、相互制约的关系。 本文在现场统计与实测的基础上,以排队论作为分析的出发点,对列车运行状态进行了模拟与分析,其目的在于:通过列车运行状态的分析及排队系统运行效率的研究,初步探讨影响井底车场生产能力的有关参量,如:分析列车进入井底车场的分布;卸载站服务时间的分布,并确定服务强度ρ;输入流不均匀系数KS;空、重车场储车系数K等。从而估计井底车场的服务质量,确定系统是否合理,并可确定系统的最优参数。 我们认为评定井底车场运行状态质量好坏的指标应是: 1.列车等待系数:PW=WS/TA(等待时间/间隔时间); 2.井底车场的服务强度:p=TS/TA=λ/μ(卸载时间/间隔时间); 3.经济价值系数:V=M/m(创造价值/消耗费用)。     

某铀矿山井底车场氡浓度的影响因素敏感性分析

地下开采铀矿山井底车场的风质受多种因素影响,包括入风氡浓度、巷道岩壁氡析出和车场重列车所载松散铀矿石氡的析出.本文选取某地下开采铀矿山为研究对象,基于放射性衰变、连续性方程及紊流传质理论,建立了井底车场氡浓度分布的数学模型.此外,选取了入风氡浓度、待提重车数量及矿车所载铀矿堆氡析出率为变量因素,分析了其对井底车场最大氡浓度影响的敏感度.同时,为探究影响该铀矿井底车场氡浓度的最显著影响因素,结合5次现场调研情况,比较了各影响因素敏感程度.结果表明:在现有工况条件下,入风氡浓度敏感度待提重车数目敏感度=铀矿堆氡析出率敏感度.     

井底车场煤列车存车线长度确定的模拟研究

本文讨论了井底车场采用单个翻罐笼时,煤列车在列车存车线卸载系统内的运行过程。并以排队理论为基础,根据列车到达间隔时间与卸载时间的分布规律,给出产生列车到达、卸载和运行时间的随机变量公式,从而建立JZM计算机模拟模型。经对不同参数的模拟结果分折,提出一组确定存车线长度的取值范围     

随机电算模拟——井底车场罐笼井前重车道上矿车的排队长度

本文介绍了两个井底车场罐笼井前重车道上矿车排队长度随机模拟的电算程序。一个是用数字表示电算结果的程序,另一个是用图形表示电算结果的程序.     

矿区铁路集配站车场状态研究

针对矿区铁路集配站列车密集到达的实际作业情况，运用排队论理论和运筹学思想，建立了车场状态的数学模型，对集配站到发场充满过程进行了数学描述，为确定集配站在饱和状态下需要的到发线数量提供了新的计算方法，并结合实例进行了验证。研究结果表明，列车密集到达是造成集配站到发场能力紧张的重要原因。研究结论为确定集配站的设备规模提供了依据。     

一个采用混合存取协议的移动通信系统的分析

本文提出了一种将集中控制信道存取和随机信道存取相结合的混合式信道存取协议,用以解决以上两种信道存取共存时移动计算机通信系统的信道存取问题。本文以一个列车自动定位系统中的计算机移动通信网为例,提出了适用于此类系统的混合式信道存取协议,用排队理论分析了该协议的特性,并进行了模拟试验,证明此协议是正确可行的.     

井底车场列车到达流和卸载流的统计分布规律

本文应用数理统计原理,系统地阐述了研究列车到达流和卸截流的分布规律的方法与步骤。根据卸载流的特点,提出了位移统计法。通过几个典型实例的统计分布研究,以及对大量的实测数据和历史资料的统计分析,得出井底车场列车到达流和卸截流一般均服从负指数分布这一规律。     

基于终端受限的矿区集配站列车排队模型

为了描述列车在集配站排队的实际作业过程，运用系统分析方法和排队论理论，建立了基于列车出发终端受限的排队网络优化数学模型，并结合实例进行了验证计算和比较。结果显示集配站有65.35％的出矿列车出发受限，需要在集配站继续排队等待。实例研究表明，所建立的基于终端受限的矿区集配站列车排队模型具有较强的针对性和可用性。     

基于马尔科夫状态转移过程的 M/ M/ m 排队模型仿真

马尔科夫链是研究排队系统的主要方法,本文在现有M/M/m排队理论和排队系统仿真理论基础上,利用Matlab建立基于马尔科夫状态转移过程的M/M/m排队模型仿真程序。仿真程序在产生初始化参数设定后,利用时钟推进法来模拟空闲服务台和繁忙服务台情况下的服务流程,最后通过M/M/m模型特征描述的仿真计算,获得平均等待时间(E[W])、平均停机时间(E[DT])、平均排队队长E[Q]、系统中的平均客户数(E[L])和可能延迟的概率(П)5项重要的特征描述。模拟次数设定为20 000次,模拟客户服务率和客户到达率相同,服务台在3～6个的排队系统,并将仿真结果与理论值以及Queue2.0的模拟结果相比较。最终结果显示E[W]、[DT]和Π3项最重要指标的仿真结果和理论值都极为相近,误差范围小,本研究将为优先权排队系统的仿真研究提供理论依据。     

超市排队系统的分析与研究

运用排队模型理论对超市排队系统进行模拟仿真,通过分析模拟出收银台的数目对超市排队系统的影响.应用MATLAB模拟运算结果,并与实际数据进行对比分析.实验数据和分析显示,该系统不仅可以真实地模拟超市排队系统运行情况,而且减少了顾客平均等待时间,降低了超市运营成本,增加了顾客的满意度.     

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.