An Adaptive Transmission Mode Selection Scheme for Cellular Underlaid D2D Communication

In this paper, we propose to use Artificial Bee Colony (ABC) optimization to solve the joint mode selection, channel assignment, and power allocation (JMSCPA) problem to maximize system throughput and spectral efficiency. JMSCPA is a problem where the allocation of channel and power depends on the mode selection. Such problems require two step solution and are called bi-level optimization problems. As bi-level optimization increases the complexity and computational time, we propose a modified version of single-level ABC algorithm aided with the adaptive transmission mode selection algorithm to allocate the cellular, reuse, and dedicated modes to the DUs along with channel and power allocation based on the network traffic load scenarios. A single variable, represented by the users (CUs and DUs) is used to allocate mode selection, and channel allocation to solve the JMSCPA problem, leading to a simpler solution with faster convergence, and significant reduction in the computational complexity which scales linearly with the number of users. Further, the proposed solution avoids premature stagnation of conventional ABC into local minima by incorporating a modification in its update procedure. The efficacy of the ABC-aided approach, as compared to the results reported in the literature, is validated by extensive numerical investigations under different simulation scenarios.

     

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)产品,但是它们的转换效率都太…     

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.     

CARD: A Contact-based Architecture for Resource Discovery in Wireless Ad Hoc Networks

Traditional protocols for routing in ad hoc networks attempt to obtain optimal or shortest paths, and in doing so may incur significant route discovery overhead. Such approaches may be appropriate for routing long-lived transfers where the initial cost of route discovery may be amortized over the life of the connection. For short-lived connections, however, such as resource discovery and small transfers, traditional shortest path approaches may be quite inefficient. In this paper we propose a novel architecture, CARD, for resource discovery in large-scale wireless ad hoc networks. Our mechanism is suitable for resource discovery as well as routing very small data transfers or transactions in which the cost of data transfer is much smaller than the cost of route discovery. Our architecture avoids expensive mechanisms such as global flooding and complex hierarchy formation and does not require any location information. In CARD resources within the vicinity of a node, up to a limited number of hops, are discovered using a proactive scheme. For resources beyond the vicinity, each node maintains a few distant nodes called contacts. Contacts help in creating a small world in the network and provide an efficient way to query for distant resources. Using contacts, the network view (or reachability) of the nodes increases, reducing the discovery overhead and increasing the success rate. On the other hand, increasing the number of contacts also increases control overhead. We study such trade-off in depth and present mechanisms for contact selection and maintenance that attempt to increase reachability with reduced overhead. Our schemes adapt gracefully to network dynamics and mobility using soft-state periodic mechanisms to validate and recover paths to contacts. Our simulation results show that CARD is scalable and can be configured to provide desirable performance for various network sizes. Comparisons with other schemes show overhead savings reaching over 93% (vs. flooding) and 80% (vs. bordercasting or zone routing) for high query rates in large-scale networks.     

Stepwise-Graded Si3N4–SiC Ceramics with Improved Wear Properties

The processing of stepwise graded Si₃N₄/SiC ceramics by pressureless co-sintering is described. Here, SiC (high elastic modulus, high thermal expansion coefficient) forms the substrate and Si₃N₄ (low elastic modulus, low thermal expansion coefficient) forms the top contact surface, with a stepwise gradient in composition existing between the two over a depth of ∼1.7 mm. The resulting Si₃N₄ contact surface is fine-grained and dense, and it contains only 2 vol% yttrium aluminum garnet (YAG) additive. This graded ceramic shows resistance to cone-crack formation under Hertzian indentation, which is attributed to a combined effect of the elastic-modulus gradient and the compressive thermal-expansion-mismatch residual stress present at the contact surface. The presence of the residual stress is corroborated and quantified using Vickers indentation tests. The graded ceramic also possesses wear properties that are significantly improved compared with dense, monolithic Si₃N₄ containing 2 vol% YAG additive. The improved wear resistance is attributed solely to the large compressive stress present at the contact surface. A modification of the simple wear model by Lawn and co-workers is used to rationalize the wear results. Results from this work clearly show that the introduction of surface compressive residual stresses can significantly improve the wear resistance of polycrystalline ceramics, which may have important implications for the design of contact-damage-resistant ceramics.     

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.