单重工作休假M/M/c排队驱动的流体模型分析

该文在M/M/c排队驱动系统中加入工作休假策略,研究了单重工作休假多服务台排队驱动的流体模型.利用拟生灭过程和矩阵几何解法得到驱动系统稳态队长分布.构建净输入率结构,导出流体模型的稳态联合分布函数满足的的矩阵微分方程组,进而利用Laplace-Stieltjes变换(LST)方法得到稳态下缓冲器库存量的空库概率及均值表...     

The existence of sensitive optimal policies in two multi-dimensional queueing models

Recently Dekker and Hordijk [3,4] introduced conditions for the existence of deterministic Blackwell optimal policies in denumerable Markov decision chains with unbounded rewards. These conditions include- uniform geometric recurrence.The-uniform geometric recurrence property also implies the existence of average optimal policies, a solution to the average optimality equation with explicit formula's and convergence of the value iteration algorithm for average rewards. For this reason, the verification of-uniform geometric convergence is also useful in cases where average and-discounted rewards are considered.On the other hand,-uniform geometric recurrence is a heavy condition on the Markov decision chain structure for negative dynamic programming problems. The verification of-uniform geometric recurrence for the Markov chain induced by some deterministic policy together with results by Sennott [14] yields the existence of a deterministic policy that minimizes the expected average cost for non-negative immediate cost functions.In this paper-uniform geometric recurrence will be proved for two queueing models: theK competing queues and the two centre open Jackson network with control of the service rates.The research of the author is supported by the Netherlands Organization for Scientific Research N.W.O.     

Use of dynamic trees in a network simplex algorithm for the maximum flow problem

Goldfarb and Hao (1990) have proposed a pivot rule for the primal network simplex algorithm that will solve a maximum flow problem on ann-vertex,m-arc network in at mostnm pivots and O(n ² m) time. In this paper we describe how to extend the dynamic tree data structure of Sleator and Tarjan (1983, 1985) to reduce the running time of this algorithm to O(nm logn). This bound is less than a logarithmic factor larger than those of the fastest known algorithms for the problem. Our extension of dynamic trees is interesting in its own right and may well have additional applications.Research partially supported by a Presidential Young Investigator Award from the National Science Foundation, Grant No. CCR-8858097, an IBM Faculty Development Award, and AT&T Bell Laboratories.Research partially supported by the Office of Naval Research, Contract No. N00014-87-K-0467.Research partially supported by the National Science Foundation, Grant No. DCR-8605961, and the Office of Naval Research, Contract No. N00014-87-K-0467.     

考虑边流量有限的网络路径博弈问题研究

考虑每条边有流量约束的网络路径博弈问题, 根据收益函数单调递增的特点分析其内在零和性质, 并建模为存在公共边的路径博弈模型。在寻找均衡解的过程中, 首先考虑非合作的情形, 在局中人风险中性的假设下, 给出了求Nash均衡流量分配的标号法并证明该均衡分配的唯一性。接着进一步考虑局中人合作的可能性, 给出模型求得所有局中人的整体最大收益, 并基于纳什谈判模型给出目标函数为凸函数的数学模型确定唯一收益分配方案。事实上, 该方案是对剩余价值的平均分配。最后给出一个算例, 验证本文理论和方法的可行性。关键词:流量约束; 均衡流量; 网络路径博弈; 收益分配     

平台参与下网络食品安全政府监管策略研究

针对“互联网+食品”新兴业态产生的更为严峻的食品安全问题,本文研究政府对网络食品安全实施直接监管下的最优监管策略,以及在网络平台参与监管时政府的最优间接监管策略,并考虑了网络平台与食品企业合谋对监管效率的影响。结果表明,在食品安全问题被发现的概率越大或食品安全问题发生对政府影响较大时,选择直接监管策略会更优;但监管成本的增加会降低政府直接监管的动因,促使政府选择间接监管策略;比较两种策略可知,间接监管模式更能抑制平台与企业的合谋行为。此外,研究还表明在直接监管策略下,由于提高食品企业的惩罚力度会降低政府的监管强度,因此加大惩罚并不总能提高政府的效益;而在间接监管策略下,加大对网络平台的惩罚会使网络平台加大监管力度,从而提高政府的效益。     

基因调控网络推断研究进展

随着高通量技术的发展,越来越多的生物医学组学数据亟需处理与分析,基于运筹优化的生物信息学方法是有效解析高维生物医学数据的重要途径之一。综述了近年来在基因调控网络推断方面的研究进展。针对不同类型的转录组学数据和研究目的,分别建立了相应的基因调控网络推断方法,主要包括先验基因调控网络数据库的建立、基于条件互信息的因果网络推断、基于微分方程的动态基因调控网络推断、转录调控和转录后调控协同作用的网络推断以及基因调控网络活性评价等,并展望了基因调控网络推断的重要研究方向。     

基于二阶段异质随机森林的汽油辛烷值预测

构建了基于二阶段异质随机森林的汽油辛烷值预测模型.首先利用样本-位点信息表知识约简模型,筛选出对汽油辛烷值影响大的位点数据作为第一阶段;然后,利用集成学习思想集成支持向量回归和动态时间序列神经网络,构建异质随机森林预测模型作为第二阶段.利用十折交叉法验证模型精度,结果表明该集成学习算法具有有效性和高精度.     

AN ACCELERATION STRATEGY FOR RANDOMIZE-THEN-OPTIMIZE SAMPLING VIA DEEP NEURAL NETWORKS

Randomize-then-optimize (RTO) is widely used for sampling from posterior distribu-tions in Bayesian inverse problems.However,RTO can be computationally intensive for complexity problems due to repetitive evaluations of the expensive forward model and its gradient.In this work,we present a novel goal-oriented deep neural networks (DNN) sur-rogate approach to substantially reduce the computation burden of RTO.In particular,we propose to drawn the training points for the DNN-surrogate from a local approximated posterior distribution-yielding a flexible and efficient sampling algorithm that converges to the direct RTO approach.We present a Bayesian inverse problem governed by elliptic PDEs to demonstrate the computational accuracy and efficiency of our DNN-RTO ap-proach,which shows that DNN-RTO can significantly outperform the traditional RTO.     

融合神经网络与数值计算的人体逆向运动学求解

人体逆向运动学问题是人体运动合成、人体运动捕获和理解的基本问题.由于人体关节链式系统的复杂性,人体逆向运动学方程往往存在多解或无解的情形.传统的方法通常采用解析或数值迭代方法求解逆向运动学问题,在给定足够多约束的情形下能够得到比较好的解,但无法处理少量约束下生成自然的人体姿态问题.近年来,从大规模数据集中学习统计模型参数的思想被广泛运用,求解人体逆向运动学的机器学习方法中经典工作|混合Gauss逆向运动求解模型(Gaussian mixture model-inverse kinematics,GMM-IK)就提出利用混合Gauss模型建模人体姿态数据分布,并采用期望最大化方法求解参数.随着深度学习技术的发展,本文提出一种自编码神经网络与数值迭代融合的方法,在给定少量约束的情形下依然能够得到自然的人体姿态,相较于GMM-IK方法,本文所提出的方法通过神经网络自动学习姿态分布,省去了模型的假设和特征的设计,且量化实验显示本文方法的关节坐标和角度重建误差相较于GMM-IK模型平均减少了25%和39%.在应用方面,本文方法可处理光学运动捕获数据,也可用于图像视频的人体姿态估计等领域.     

基于神经网络的间隙机构运动副磨损预测

应用BP神经网络建立了磨损率与接触应力、滑动速度和材料硬度之间的非线性关系模型,并对该网络模型进行了验证和测试,结果表明,训练良好的神经网络模型能够准确反映样本所蕴含的内在磨损规律,且具有较好的预测效果。基于非线性弹簧阻尼模型和修正的Coulomb摩擦力模型对含间隙曲柄滑块机构进行数值仿真分析,获得间隙机构运动副的接触应力和相对滑动速度,利用训练好的神经网络磨损模型对轴套的磨损进行迭代磨损预测分析,发现随着曲柄转数的增加,轴套表面一些特定位置处的磨损越来越严重,最终导致轴套表面出现非均匀磨损现象,其原因是间隙机构运转过程在一些特定位置处产生了较大接触应力和碰撞力。