熵模糊物元分析法在水库正常高水位决策中的应用

基于信息熵理论和模糊物元分析理论,探讨了水库正常高水位的熵模糊物元决策模型.以待选方案与最优方案间的海明贴近度来决策水库正常高水位.在确定评价综合指标信息熵的熵权和专家知识权重的的过程中,充分挖掘待选方案的固有信息和避免个人主观因素的弊端.实例应用表明,该方法有效、可行.     

动态评价技术在塔河碳酸盐岩缝洞型油气藏中的应用

塔河油田奥陶系油气藏是大型碳酸盐岩溶洞型油气藏，其储渗空间主要为大小不同的溶洞、裂缝带、溶蚀孔隙等组成，该油气藏具有极强的非均质性，单纯用静态资料来认识这类油气藏是非常困难。文章提出利用生产动态资料和信息进行该类型油气藏研究的新思路，利用人工神经网络技术在处理非线性相关参数预测方面的优势，并以渗流理论为基础，结合试井成果，选用已知油井的产量、油嘴、油压、含水率、气油比、原油密度等6个开发动态参数作为样品输入数据，推导出影响油气藏开发的重要参数（地层系数）与生产信息的关系，建立了人工神经网络预测储层参数的结构模型。通过塔里木盆地塔河油气田实例研究，说明了利用动态信息评价油气藏技术在碳酸盐岩缝洞型油气藏储层预测和非均质性分析等方面具有较高的实用价值。     

异构分层无线网络中基于逗留时间的动态流量均衡算法研究

为使异构分层无线网络能服务更多的移动用户,提出了一种基于逗留时间的动态流量均衡算法.该算法首先根据用户移动模型计算其在小区内的逗留时间,然后基于小区呼叫到达率和重叠覆盖小区的流量状态来确定一个周期内呼叫转移的数量,最后依据逗留时间门限值将重负载小区中满足条件的呼叫转移到轻负载的重叠覆盖小区中.为降低切换呼叫掉线率,还对异构网间的呼叫切换策略做了改进.仿真实验结果表明,本算法在新呼叫阻塞率和切换呼叫掉线率等性能指标上比传统方法有显著的提高.     

Moving the goal posts: a reply to Dawson and Piercey

Berkeley [Minds Machines 10 (2000) 1] described a methodology that showed the subsymbolic nature of an artificial neural network system that had been trained on a logic problem, originally described by Bechtel and Abrahamsen [Connectionism and the mind. Blackwells, Cambridge, MA, 1991]. It was also claimed in the conclusion of this paper that the evidence was suggestive that the network might, in fact, count as a symbolic system. Dawson and Piercey [Minds Machines 11 (2001) 197] took issue with this latter claim. They described some lesioning studies that they argued showed that Berkeley’s (2000) conclusions were premature. In this paper, these lesioning studies are replicated and it is shown that the effects that Dawson and Piercey rely upon for their argument are merely an artifact of a threshold function they chose to employ. When a threshold function much closer to that deployed in the original studies is used, the significant effects disappear.     

Relationship between poles and zeros of input–output and chain-scattering systems

A system is frequently represented by transfer functions in an input–output characterization. However, such a system (under mild assumptions) can also be represented by transfer functions in a port characterization, frequently referred to as a chain-scattering representation. Due to its cascade properties, the chain-scattering representation is used throughout many fields of engineering. This paper studies the relationship between poles and zeros of input–output and chain-scattering representations of the same system.     

基于交会图和多元统计法的神经网络技术在火山岩识别中的应用

针对火山岩储层的特殊性(复杂性、离散性和随机性),应用BP神经网络技术对火山岩测井解释中岩性识别问题进行了研究。该方法的技术关键是样本集和初始权重的建立,以及模型的优选。本文提出了一种基于交会图和多元统计法的学习样本生成方法,即根据取心岩样的地球化学和岩石学研究,用交会图技术建立样本集,采用聚类分析和距离判别法确定初始权重。将研究方法应用在松辽盆地杏山地区火山岩岩性识别问题中,取得了很好的效果,岩性解释符合率高于90%。文中通过四种岩性识别处理模式的对比研究,表明赋权重处理模式为最优处理模型。在神经网络模型预测过程中,需充分利用已有的地质经验和测井曲线信息建立典型可靠的样本文件,同时考虑神经网络方法中各种因素的影响,优选模型和计算参数才能使预测结果符合实际情况。     

基于改进模糊综合评价法的水利工程社会评价研究

通过对水利工程社会评价及模糊综合评价法的介绍,讨论了模糊层次分析法中的一致性检验问题,并采用改进的模糊综合评价法对江垭水利枢纽工程进行社会评价,得到综合评价结果。     

人工神经网络预测煤的发热量

应用人工神经网络处理部分广东地区煤质分析数据,建立网络模型,预测出煤的发热量,经实测值与预测值比较,在一定的煤种范围内预测值与实测值比较接近。     

Modeling and analysis of hierarchical cellular networks with bidirectional overflow and take-back strategies under generally distributed cell residence times

The rapid growth of wireless services and mobile users drives a great interest in cellular networks with a hierarchical structure. Hierarchical cellular networks (HCNs) can provide high system capacity, efficient channel utilization and inherent load-balancing capability. In this paper, we develop an analytical model and a performance analysis method for a two-layer HCN with bidirectional overflow and take-back strategies. Mobile users are divided into two classes. The call requests (including new and handoff calls) of fast and slow users are preferably assigned to the macrolayer and microlayer, respectively. A call from a fast user or slow user can overflow to its non-preferable layer if there is no channel available. The successful overflow call can be taken back to its preferable layer if a channel becomes available. Since the commonly used exponentially distributed assumption for cell residence time and then the channel occupancy time does not hold for emerging mobile networks, we model various cell residence times by general distributions to adapt to more flexible mobility environments. The channel occupancy times are derived in terms of the Laplace transforms of various cell residence times. The handoff rates, overflow rates and take-back rates of each layer are also derived in terms of the new call arrival rates and related probabilities. The stationary probabilities (and then the performance measures) are determined on the basis of the theory of multi-dimensional loss systems.     

Efficient multicast search under delay and bandwidth constraints

The issue of a multicast search for a group of users is discussed in this study. Given the condition that the search is over only after all the users in the group are found, this problem is called the Conference Call Search (CCS) problem. The goal is to design efficient CCS strategies under delay and bandwidth constraints. While the problem of tracking a single user has been addressed by many studies, to the best of our knowledge, this study is one of the first attempts to reduce the search cost for multiple users. Moreover, as oppose to the single user tracking, for which one can always reduce the expected search delay by increasing the expected search cost, for a multicast search the dependency between the delay and the search cost is more complicated, as demonstrated in this study. We identify the key factors affecting the search efficiency, and the dependency between them and the search delay. Our analysis shows that under tight bandwidth constraints, the CCS problem is NP-hard. We therefore propose a search method that is not optimal, but has a low computational complexity. In addition, the proposed strategy yields a low search delay as well as a low search cost. The performance of the proposed search strategy is superior to the implementation of an optimal single user search on a group of users. Amotz Bar-Noy received the B.Sc. degree in 1981 in Mathematics and Computer Science and the Ph.D. degree in 1987 in Computer Science, both from the Hebrew University, Israel. From October 1987 to September 1989 he was a post-doc fellow in Stanford University, California. From October 1989 to August 1996 he was a Research Staff Member with IBM T. J. Watson Research Center, New York. From February 1995 to September 2001 he was an associate Professor with the Electrical Engineering-Systems department of Tel Aviv University, Israel. From September 1999 to December 2001 he was with AT research labs in New Jersey. Since February 2002 he is a Professor with the Computer and Information Science Department of Brooklyn College - CUNY, Brooklyn New York. Zohar Naor received the Ph.D. degree in Computer Science from Tel Aviv University, Tel Aviv, Israel, in 2000. Since 2003 he is with the University of Haifa, Israel. His areas of interests include wireless networks, resource management of computer networks, mobility, search strategies, and multiple access protocols.