Tunneling Conductance Dependence of the Tunneling Spectra in Bi2Sr2CaCu2O8

We have measured the tunneling spectra in Bi₂Sr₂CaCu₂O₈ with a scanning tunneling microscope(STM) at various tip-sample distances by changing the tunneling conductance in a controlled manner. When the tunneling conductance is increased from 1×10^–9 to 1×10^–5 S, the spectra do not show changes in particular. However, the gap value decreases steeply and the asymmetric back ground density of states turns inverted V-shaped one above 6×10^–4 S. The changes in the tunneling spectra at the high tunneling conductances are explained by the enhancement of the local carrier density induced by the pressure that the STM tip applied to the sample.     

On-demand learning for a wireless campus

The current Internet and wireless networks are harsh environments for transporting high-bandwidth multimedia data. We examine the technical issues involved, and describe an end-to-end solution to support a Web-based learn-on-demand system that operates in a wireless campus environment.     

Practical OSPF traffic engineering

Open Shortest Path First (OSPF) traffic engineering (TE) is intended to bring long-awaited traffic management capabilities into IP networks, which still rely on today's prevailing routing protocols: OSPF or IS-IS. In OSPF, traffic is forwarded along, and split equally between, equal cost shortest paths. In this letter, we formulate the basic requirements placed on a practical TE architecture built on top of OSPF and present a theoretical framework meeting these requirements of practicality. The main contribution of our work comes from the recognition that coupled with an instance of the maximum throughput problem there exists a related inverse shortest-path problem yielding optimal OSPF link weights.     

Asymptotic performance of single parity-check product codes

This article investigates the asymptotic performance of single parity-check (SPC) product codes (PCs) from a decoding point of view. Specifically, the probability of bit error is bounded before and after the decoding of each dimension, similar to the analysis of "iterated codes" by Elias (1954). It is shown that the asymptotic probability of bit error can be driven to zero as the number of dimensions, and hence the block length, increases at signal-to-noise ratios (SNRs) within 2 dB of capacity over the additive white Gaussian noise (AWGN) channel.