A Reduced Reachability Tree for a Class of Unbounded Petri Nets

As a powerful analysis tool of Petri nets, reachability trees are fundamental for systematically investigating many characteristics such as boundedness, liveness and reversibility. This work proposes a method to generate a reachability tree, called ωRT for short, for a class of unbounded generalized nets called ω-independent nets based on new modified reachability trees (NMRTs). ωRT can effectively decrease the number of nodes by removing duplicate and ω-duplicate nodes in the tree, and verify properties such as reachability, liveness and deadlocks. Two examples are provided to show its superiority over NMRTs in terms of tree size.      

X70配套埋弧焊丝用H08D盘条的研制

介绍了北营公司X70配套埋弧焊丝用H08D盘条的开发研制情况.其生产工艺的关键点为:转炉采用“双渣法除磷”,脱氧合金化在转炉和LF炉两个阶段完成,连铸采用结晶器电磁搅拌及末端电磁搅拌、恒定拉速;盘条采用控冷控轧及轧后延迟型斯太尔摩冷却工艺等措施.生产的成品盘条成分、力学性能、金相组织等指标均满足客户拉拔工艺要求.     

海上稠油油田蒸汽吞吐产量确定新方法

针对目前蒸汽吞吐产量预测模型假设条件简单、普适性差等问题,一般采用测试法和类比法综合确定海上稠油油田蒸汽吞吐初期产量。由于目前海上油田通常只开展常规测试,无法直接获得热采开发初期产量。笔者提出海上稠油油田蒸汽吞吐初期产量确定新方法,建立蒸汽吞吐相对于常规开发的初期产量倍数预测模型,通过蒸汽吞吐产量倍数,将常规测试确定的产量转化为蒸汽吞吐产量。研究表明,蒸汽吞吐初期产量倍数主要受储集层渗透率、原油黏度、注入强度、蒸汽干度等因素影响,利用正交试验设计和多元回归等方法,建立海上稠油油田蒸汽吞吐初期产量倍数与油藏地质参数及注入参数之间的非线性预测模型,该模型经实际生产数据验证,预测误差小于5%,可靠性高,能够为海上稠油油田蒸汽吞吐初期产量的确定提供依据。     

现代化工分离技术讲座

<正>第十一章离子液体在分离过程中的应用(上接第2006年第5期) 5．2有机/生物/生物燃料分子的离子液体萃取由于带电有机物在离子液体中的高溶解性,促进了离子液体回收有机物的发展。如表11-7所示,在IL-H_2O两相体系中进行了一些取代苯衍生物的相分配研究。     

Uplink Scheduling in CDMA Packet-Data Systems

Uplink scheduling in wireless systems is gaining importance due to arising uplink intensive data services (ftp, image uploads etc.), which could be hampered by the currently in-built asymmetry in favor of the downlink. In this work, we propose and study algorithms for efficient uplink packet-data scheduling in a CDMA cell. The algorithms attempt to maximize system throughput under transmit power limitations on the mobiles assuming instantaneous knowledge of user queues and channels. However no channel statistics or traffic characterization is necessary. Apart from increasing throughput, the algorithms also improve fairness of service among users, hence reducing chances of buffer overflows for poorly located users. The major observation arising from our analysis is that it is advantageous on the uplink to schedule “strong” users one-at-a-time, and “weak” users in larger groups. This contrasts with the downlink where one-at-a-time transmission for all users has shown to be the preferred mode in much previous work. Based on the optimal schedules, we propose less complex and more practical approximate methods, both of which offer significant performance improvement compared to one-at-a-time transmission, and the widely acclaimed Proportional Fair (PF) algorithm, in simulations. When queue content cannot be fed back, we propose a simple modification of PF, Uplink PF (UPF), that offers similar improvement. Hereafter, we refer to users with low recieved power at the base even when transmitting at peak transmit power as “weak” users, and the strongly recieved users at the base as “strong” users. Krishnan Kumaran is currently a member of the Complex Systems Modeling section in the Corporate Strategic Research of ExxonMobil Corp., Clinton, NJ. Formerly, he was a Member of Technical Staff in the Mathematics of Networks and Systems Research Department at Bell Labs in Murray Hill, NJ, where his research interests were in modeling, analysis and simulation of design, resource management and scheduling issues in telecommunication networks. Lijun Qian is an assistant professor in the Department of Electrical Engineering at Prairie View A&M University. He received his B.S. from Tsinghua University in Beijing, M.S. from Technion-Israel Institute of Technology, and Ph.D. from WINLAB, Rutgers University, all in electrical engineering. Before joining PVAMU, he was a researcher at Networks and Systems Research Department of Bell Labs in Murray Hill, NJ. His major research interests are in wireless communications and networking technologies, especially in radio resource management, protocol design, TCP/RLP optimization and MPLS traffic engineering.