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.     

下一代SONET/SDH对网络部署的冲击

面对电信业的低迷,运营商和设备制造商都捏紧了钱袋,想方设法少花钱多办事。这就意味着,必须改进现有传输网(见图1),使话音和数据传输效率更高。从网络部署的角度来看,运营商需要:用一些有效的方法,将多协议数据转换到SONET/SDH信道上;用一种灵活的带宽适应机制,使SONET/SDH信道大小与在其中传输的数据的需求相一致;用一种机制,灵活并以理想的动态方式改变整个SONET/SDH网络的信道带宽。这就要求集成电路供应商提供有助于在SONET/SDH上有效传输数据的芯片。虽然现在有多种SONET/SDH信息包(PoS)产品,但是它们的转换效率都太…     

Effect of immunosuppression and splenectomy in transplantation sarcomas in mice

After spontaneous regression of transplanted tumours, marked reduction in number of tumours was found when challenged with isogenic tumour cells. The ALS abrogates this effect. Tumour removal by surgical excision of limb and subsequent time scheduled challenge by tumour cells maximally suppress on the 10th day and continues up to the 42nd day the tumorogenic effect. Splenectomy has no effect if done before a day or 3 days after challenge but marked decrease in tumour development was seen when challenged on the 8th day after splenectomy. Amputation and splenectomy together potentiates tumour formation. Only in tumour extrication, does resistance develop up to the 42nd day from surgery. Challenging at a different site in mice with tumours, resulted in prolongation of the intervals of tumour formation. Challenge after surgical removal of tumour after a time lapse, results in marked reduction in number and size of tumours. Surgical tumour extrication after splenectomy and subsequent challenge on 11th day inhibited tumour formation. Whereas splenectomized tumour bearing mice when challenged at a heterosite did not develop resistance.     

Sodium silicate as a coke inhibitor during naphtha pyrolysis

Rates of coke formation during steam pyrolysis of naphtha have been investigated in a jet-stirred reactor both for sodium silicate coated and uncoated Inconel 600 surfaces in the temperature range of 1078–1108 K. Coke formation rates were significantly reduced on sodium silicate coated plates due to the passivation of the metal surface. However, the coking rates gradually increased with successive decokings of the coated surface.     

Stability and throughput analysis of unslotted CDMA‐ALOHA with finite number of users and code sharing

We consider a system comprising a finite number of nodes, with infinite packet buffers, that use unslotted ALOHA with Code Division Multiple Access (CDMA) to share a channel for transmitting packetised data. We propose a simple model for packet transmission and retransmission at each node, and show that saturation throughput in this model yields a sufficient condition for the stability of the packet buffers; we interpret this as the capacity of the access method. We calculate and compare the capacities of CDMA‐ALOHA (with and without code sharing) and TDMA‐ALOHA; we also consider carrier sensing and collision detection versions of these protocols. In each case, saturation throughput can be obtained via analysis of a continuous time Markov chain. Our results show how saturation throughput degrades with code‐sharing. Finally, we also present some simulation results for mean packet delay. Our work is motivated by optical CDMA in which “chips” can be optically generated, and hence the achievable chip rate can exceed the achievable TDMA bit rate which is limited by electronics. Code sharing may be useful in the optical CDMA context as it reduces the number of optical correlators at the receivers. Our throughput results help to quantify by how much the CDMA chip rate should exceed the TDMA bit rate so that CDMA‐ALOHA yields better capacity than TDMA‐ALOHA. This revised version was published online in June 2006 with corrections to the Cover Date.     

Scale periodicity and its sampling theorem

The scalar transform is a new representation for signals, offering a perspective that is different from the Fourier transform. We introduce the notion of a scalar periodic function. These functions are then represented through the discrete scale series. We also define the notion of a strictly scale-limited signal. Analogous to the Shannon interpolation formula, we show that such signals can be exactly reconstructed from exponentially spaced samples of the signal in the time domain. As an interesting, practical application, we show how properties unique to the scale transform make it very useful in computing depth maps of a scene     

Role of Specimen Geometry in the Effect of Fiber Orientation on the Thermal Conductivity of a Uniaxial Carbon-Fiber-Reinforced Aluminoborosilicate Glass-Matrix Composite

A study concerning the effect of fiber orientation on the thermal conductivity of a uniaxial carbon-fiber-reinforced borosilicate glass was conducted. For thin specimens, and thick specimens with specimen sides cut parallel to the fiber direction, the dependence of thermal conductivity on fiber orientation showed excellent agreement with theoretical behavior predicted for a composite infinite in extent. In contrast, the thermal conductivity data for rectangular thick specimens fell well below the data for the thin and angled specimens. For fiber orientation of 45° and higher, at which the heat was directed toward the side of the specimen rather than across, the thermal conductivity values showed excellent agreement with theoretical behavior predicted for a finite composite strip with insulated sides.     

Binary rewriting and call interception for efficient runtime protection against buffer overflows

Buffer overflow vulnerabilities are one of the most commonly and widely exploited security vulnerabilities in programs. Most existing solutions for avoiding buffer overflows are either inadequate, inefficient or incompatible with existing code. In this paper, we present a novel approach for transparent and efficient runtime protection against buffer overflows. The approach is implemented by two tools: Type Information Extractor and Depositor (TIED) and LibsafePlus. TIED is first used on a binary executable or shared library file to extract type information from the debugging information inserted in the file by the compiler and reinsert it in the file as a data structure available at runtime. LibsafePlus is a shared library that is preloaded when the program is run. LibsafePlus intercepts unsafe C library calls such as strcpy and uses the type information made available by TIED at runtime to determine whether it would be ‘safe’ to carry out the operation. With our simple design we are able to protect most applications with a performance overhead of less than 10%. Copyright © 2006 John Wiley & Sons, Ltd.