Neural networks for contract bridge bidding

The objective of this study is to explore the possibility of capturing the reasoning process used in bidding a hand in a bridge game by an artificial neural network. We show that a multilayer feedforward neural network can be trained to learn to make an opening bid with a new hand. The game of bridge, like many other games used in artificial intelligence, can easily be represented in a machine. But, unlike most games used in artificial intelligence, bridge uses subtle reasoning over and above the agreed conventional system, to make a bid from the pattern of a given hand. Although it is difficult for a player to spell out the precise reasoning process he uses, we find that a neural network can indeed capture it. We demonstrate the results for the case of one-level opening bids, and discuss the need for a hierarchical architecture to deal with bids at all levels.     

无线传感器网络MAC层协议的对比研究

无线传感器网络是二十一世纪新兴的网络技术，它的出现使网络的发展进入一个新的阶段。针对无线传感器网络MAC层协议的研究一直是人们普遍关注的问题。总结了近年来的研究成果并针对TDMA，IEEE802．15．4，S—MAC，T—MAC几种典型的MAC层协议进行了对比分析，根据其各自的优点提出将来工作的方向和建议。     

Estimation of fouling in a plate heat exchanger through the application of neural networks

Pasteurization is an important, if not the most important, process step in the packaging of milk. It is subject to alterations stemming from the variation in the temperature, pH and raw milk quality. The variability may manifest itself in changes in the formation of the deposit (fouling) in the pasteurization unit, such that there is a need for tools, both instrumentation and computational, to help in monitoring the process and keeping it on the desired course. In this paper we describe a practical procedure based on artificial neural networks (ANN) that allows prediction of the deposit thickness, the overall heat transfer coefficient and the critical time (the time that the unit has to be stopped for cleaning) for reducing the impact of fouling on such processes. The procedure determines when the cleaning operation is required once the system is under critical conditions of operations. A combination of fundamental studies and plant measurements were used for study of the operating conditions and thus evaluation of the trades‐offs between operating conditions and longer operating life span. The results are encouraging, enough to validate current operating industrial techniques. Copyright © 2005 Society of Chemical Industry     

Pancyclicity of recursive circulant graphs

In this paper, we study the existence of cycles of all lengths in the recursive circulant graphs, and we show a necessary and sufficient condition for the graph being pancyclic and bipancyclic.     

Learning Recursive Bayesian Multinets for Data Clustering by Means of Constructive Induction

This paper introduces and evaluates a new class of knowledge model, the recursive Bayesian multinet (RBMN), which encodes the joint probability distribution of a given database. RBMNs extend Bayesian networks (BNs) as well as partitional clustering systems. Briefly, a RBMN is a decision tree with component BNs at the leaves. A RBMN is learnt using a greedy, heuristic approach akin to that used by many supervised decision tree learners, but where BNs are learnt at leaves using constructive induction. A key idea is to treat expected data as real data. This allows us to complete the database and to take advantage of a closed form for the marginal likelihood of the expected complete data that factorizes into separate marginal likelihoods for each family (a node and its parents). Our approach is evaluated on synthetic and real-world databases.     

Process and technology challenges in swift-starting virtual teams

Virtual teams often face tight schedules and a need to start quickly and perform instantly. The goal of our study was to enhance understanding of the challenges faced by such teams. We used time–interaction–performance theory as the framework for following the processes and functions within virtual teams working on a systems development task. Our study provided a detailed examination of the group process, applied to virtual teams working under time pressure. The challenges faced by virtual teams in such settings showed that teams must work to enhance their effectiveness in multiple dimensions.     

两相电流互感器配电网零序电流构造方法

中性点非直接接地配电网大多只安装A，C两相电流互感器（TA），而现有单相接地故障选线方法基本都以零序电流为基础实现。如何在两相TA配电网中准确检测并隔离接地故障线路，成为长期困扰实际运行的技术难题。通过对暂态电流的频域和时域分析，找出B相暂态电流与A，C相暂态电流的对应关系，提出在A相和C相接地时由A相和C相暂态电流构造B相暂态电流，进而得到较精确零序电流的方法。通过大量仿真实验验证了所提出的构造方法的正确性。零序电流的成功构造为实现两相TA配电网单相接地故障选线提供了基础。     

A genetic‐based neuro‐fuzzy controller for blind equalization of time‐varying channels

This paper presents a neuro‐fuzzy network (NFN) where all its parameters can be tuned simultaneously using genetic algorithms (GAs). The approach combines the merits of fuzzy logic theory, neural networks and GAs. The proposed NFN does not require a priori knowledge about the system and eliminates the need for complicated design steps such as manual tuning of input–output membership functions, and selection of fuzzy rule base. Although, only conventional GAs have been used, convergence results are very encouraging. A well‐known numerical example derived from literature is used to evaluate and compare the performance of the network with other equalizing approaches. Simulation results show that the proposed neuro‐fuzzy controller, all parameters of which have been tuned simultaneously using GAs, offers advantages over existing equalizers and has improved performance. From the perspective of application and implementation, this paper is very interesting as it provides a new method for performing blind equalization. The main contribution of this paper is the use of learning algorithms to train a feed‐forward neural network for M‐ary QAM and PSK signals. This paper also provides a platform for researchers of the area for further development. Copyright © 2008 John Wiley & Sons, Ltd.     

Performance analysis of IEEE 802.11 ad hoc networks in the presence of exposed terminals

The paper evaluates the performance effects of exposed terminals in IEEE 802.11 ad hoc networks in finite load conditions. It derives analytical models for the estimation of channel utilization and media access delay for IEEE 802.11 ad hoc networks in finite load conditions with and without exposed terminals. The simulation results show that the analytical estimated channel utilization and media access delay metrics are fairly accurate.     

Bandwidth‐guaranteed QoS routing of multiple parallel paths in CDMA/TDMA ad hoc wireless networks

This paper investigates the issues of QoS routing in CDMA/TDMA ad hoc networks. Since the available bandwidth is very limited in ad hoc networks, a QoS request between two nodes will be blocked if there does not exist a path that can meet the QoS requirements, even though there is enough free bandwidth in the whole system. In this paper, we propose a new scheme of using multiple paths between two nodes as the route for a QoS call. The aggregate bandwidth of the multiple paths can meet the bandwidth requirement of the call and the delays of these paths are within the required bound of the call. We also propose three strategies by which to choose a set of paths as the route, namely, shortest path first (SPF), largest bandwidth first (LBF), and largest hop‐bandwidth first (LHBF). Extensive simulations have been conducted to evaluate the performance of the three strategies in comparison with a traditional single path routing algorithm. The simulation results show that the proposed multiple paths routing scheme significantly reduces the system blocking rates in various network environments, especially when the network load is heavy. Copyright © 2005 John Wiley & Sons, Ltd.