下一代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.     

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.     

Unnecessary inferences in associative-commutative completion procedures

Theoretical results for identifying unnecessary inferences are discussed in the context of the use of a completion-procedure-based approach toward automated reasoning. The notion of a general superposition is introduced and it is proved that in a completion procedure, once a general superposition is considered, all its instances are unnecessary inferences and, thus, do not have to be considered. It is also shown that this result can be combined with another criterion, called the prime superposition criterion, proposed by Kapur, Musser, and Narendran, thus implying that prime and general superpositions are sufficient. These results should be applicable to other approaches toward automated reasoning, too. These criteria can be effectively implemented, and their implementation has resulted in automatically proving instances of Jacobson's theorem (also known as the ring commutativity problems) usingRRL (Rewrite Rule Laboratory), a theorem prover based on rewriting techniques and completion.A preliminary version of this paper appeared in a paper entitled Consider only general superpositions in completion procedures in theProceedings of the Third International Conference on Rewriting Techniques and Applications, Chapel Hill, NC, April, 1989, Lecture Notes in Computer Science, Vol. 355, Springer-Verlag, Berlin, pp. 513–527. Part of the work of Hantao Zhang was done at the Rensselaer Polytechnic Institute, New York, and he was partially supported by National Science Foundation Grant No. CCR-8408461; also affiliated with Institute of Programming and Logics at SUNY, Albany, NY, and RPI. Deepak Kapur was partially supported by National Science Foundation Grantr Nos. CCR-8408461 and CCR-8906678.     

Simulation Study of Dielectric Modulated Dual Material Gate TFET Based Biosensor by Considering Ambipolar Conduction

Silicon - In this paper, a dielectric modulated dual material gate TFET (DM-DMG_TFET)based biosensor is proposed. In order to detect various biomolecules, a nanogap cavity is formed by the...     

Design of novel compact anti-stiction and low insertion loss RF MEMS switch

A novel torsional RF MEMS capacitive switch design on silicon substrate is presented. The optimized switch topology such as reduction in up-state capacitance results in insertion loss better than ?0.1 dB till 20 GHz. Off to on state capacitance ratio is also improved by 18 fold and isolation is better than ?43 dB at 9.5 GHz. The achieved on state return loss is ?38 dB as compared to ?21 dB at 9.5 GHz. An optimized reduction in contact area and use of floating metal layer increases the switching speed from 56 to 46 μsec. It also increases the switch reliability by alleviating the stiction.     

COMPUTER-AIDED GRAPHICS OF LIQUID-LIQUID EXTRACTION

An algorithm has been developed and tested for steady-state liquid-liquid extraction, using rectangular coordinates. It is capable of handling common types of stagewise contact, i.e., single stage extraction, multistage cross-current, and continuous countercurrent multistage extraction. The results depend on the nature of the extraction scheme and the extent of separation desired. While equilibrium data for some systems are stored in its data bank, the present portable computer simulator ( LIQEXT) has the flexibility of reading equilibrium data for other systems, as well as overriding stored data

Both design and rating cases can be performed. In the design mode, i.e., given the feed and solvent rates and the outlet concentration, it calculates the number of stages, the exit stream flow rates, and the concentration profile. In the rating ( or simulation) mode, i.e., given the feed and solvent rates, and the number of stages, it computes the exit streams flow rates and compositions, and the concentration profile. In both cases a graphical output of the concentration profile is produced, either on the screen or on a hard-copy plotter.