M/M/C排队模型在理发服务行业中的应用

将随机服务系统中M/M/C排队模型应用到理发服务行业.笔者对重庆南岸区某理发店进行了现场调查,以10 min为一个调查单位调查顾客到达数,统计了72个调查单位的数据,又随机调查了为113名顾客服务的时间,得到了单位时间内到达的顾客数n和为每位顾客服务的时间t,然后利用χ2拟合检验,得到单位时间的顾客到达数服从Possion分布,服务时间服从负指数分布,从而建立起M/M/C等待制FCFS排队模型,通过计算和分析M/M/C排队模型的主要指标,得到该理发店宜聘用的最佳理发师数.本文对随机服务系统中的M/M/C排队模型在各行业中的应用具有示范意义.     

串联排队系统平均等待时间的近似分析

文章研究GI/G/1→/G/1串联排队系统，该系统由两个单一服务器串联而成，系统的到达过程是更新过程，两个站的服务时间服从一般分布。由于系统的到达时间间隔和服务时间服从一般分布，导致很难用解析的方法进行分析。根据系统的到达时间间隔和服务时间的三阶矩，文章分别将两个站的到达过程近似为MAP，服务时间近似为PH分布，从而将GI/G/1→/G/1排队系统近似为MAP/PH/1→/PH/1排队系统，构建相应的马尔可夫过程，采用矩阵几何解的方法求解系统的平均排队时间等数量指标。通过数值实验，验证了文章提出的近似方法的有效性。     

ARFIMA模型参数贝叶斯估计的渐近性质

首先根据贝叶斯定理得到ARFIMA模型参数的后验边缘分布,并选择后验边缘分布的众数作为参数的估计值.参照季节性ARFIMA模型的极大似然估计的渐近性质的证明思路,证明了模型参数的贝叶斯估计具有相合性、有效性和渐近正态性.最后,对参数的贝叶斯估计方法的大样本性质进行仿真模拟,结果表明当时间序列样本足够大时,参数的估计值越来越接近于真实值.     

带RCE抵消策略的负顾客GI／M／1工作休假排队

考虑服务员在休假期间不是完全停止工作,而是以相对于正常服务期的低些的服务率服务顾客的GI/M/1工作休假排队模型.在此模型基础上,针对现实的GI/M/1排队模型中可能出现的外来干扰因素,提出了带RCE(removal of customers in the end)抵消策略的负顾客GI/M/1工作休假排队这一新的模型.服务规则为先到先服务.工作休假策略为空竭服务多重工作休假.抵消原则为负顾客一对一抵消队尾的正顾客,若系统中无正顾客时,到达的负顾客自动消失,负顾客不接受服务.首先通过引进补充变量得到一个向量马氏过程,然后由矩阵几何解方法成功求得到达时刻和任意时刻系统队长的稳态分布.     

马尔科夫链蒙特卡洛地面磁共振信号参数提取

为解决MＲS( Magnetic Ｒesonance Sounding) 信号中乘性噪声干扰的问题,提出了马尔科夫链蒙特卡洛的 参数提取方法。建立MＲS 复包络参数的先验信息模型与似然函数模型,使用马尔科夫链蒙特卡洛( MCMC: Markov Chain Monte Carlo) 方法对参数后验分布进行采样与拟合,在后验分布中出现次数最多、权值最大的数据 作为参数的最优估计值。通过多组不同噪声条件下的MCMC 参数提取结果与非线性拟合方法对比,证明了 MCMC 方法可在乘性噪声的干扰下进行MＲS 信号参数提取,准确度高、稳定性强。     

记录值样本下Rayleigh分布可靠性指标的Bayes估计

针对记录值样本,研究了Rayleigh分布可靠性指标的参数估计问题.首先给出了可靠性指标的极大似然估计,随后在损失函数为平方误差损失的情形下,应用Lindley近似法导出了Rayleigh分布可靠性指标的Bayes估计,最后利用R软件进行数值模拟,并比较两种参数估计的误差和均方误差,发现在对称损失函数下可靠性指标的Bayes估计值更加接近参数真实值.     

广义非线性模型的Bayes估计

针对广义非线性模型的参数估计问题,提出了从参数的条件后验分布中抽取观测值来估计参数值的Bayes估计法.利用贝叶斯统计分析中蒙特卡洛抽样方法中的M-H算法和Gibbs抽样算法相结合的混合算法进行分析,通过参数的条件后验分布抽取出每次迭代时的参数值,并利用参数的样本路径图和均值遍历图验证迭代时马尔科夫链的收敛性;计算马尔科夫链达到收敛后参数的后验均值得到参数的Bayes估计;通过对产品销售数据的实证分析,比较Bayes估计和极大似然估计的偏差,验证M-H算法和Gibbs抽样算法在对广义非线性模型的参数进行Bayes估计时的简洁性、有效性以及可行性.     

M/M/s排队模型在食堂中的应用

将随机服务系统中M/M/s排队模型应用到食堂排队及其管理中.笔者对浙江师范大学桂苑一楼食堂进行了调查,得到单位时间的学生到达数服从泊松分布,服务时间服从负指数分布,从而建立起M/M/s排队模型,通过计算和分析M/M/n排队模型的主要指标,得到桂一食堂应该启用的刷卡柜数量为7台。本文对随机服务系统中的M/M/s排队模型在各食堂中的应用有示范意义。     

基于推广贝叶斯法的岩土参数估计及基础设计

结合工程实例,介绍了推广贝叶斯(Bayes)法在岩土参数估计中的具体应用.该方法利用场地周围其他工程的数据拟合出各参数的最优分布函数,并以此为先验分布,用推广贝叶斯法对现有样本进行处理,得出后验分布参数以进行基础设计.实际观测结果表明,根据后验分布参数计算的基础沉降值与实际值吻合较好,证明了提出的岩土参数估计方法的可行性与可靠性.     

基于下记录值样本的双参数指数威布尔模型的Bayes估计

针对下记录值样本,研究了双参数指数威布尔模型的参数估计问题.首先给出了参数的极大似然估计,随后在参数的共轭先验分布为伽玛先验分布、损失函数为平方误差损失和Linex损失函数情形下,应用Lindley,近似法导出了双参数指数威布尔模型参数的Bayes估计,最后利用R软件进行数值模拟,并对两种参数估计进行比较,发现在合适的先验分布条件下Bayes估计值更加接近参数真实值.因此,在适当的先验分布下Bayes估计较传统的极大似然估计好.     

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.     

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.     

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.