Comparative Study on the Properties of Galvanically Deposited Nano- and Microcrystalline Thin Films of PbSe

Thin films of PbSe having both nano- and microstructures have been deposited on transparent conducting oxide (TCO)-coated glass substrates electrochemically, from an aqueous solution of Pb(OAc)₂, ethylenediamine tetraacetic acid (EDTA), and SeO₂. A Pb strip acted as the sacrificial anode, while the TCO glass was the cathode. No external bias was applied. The formation of PbSe was pH sensitive, and pH ~3 was found to be optimum for film deposition. Films grown at room temperature (25°C) were nanocrystalline (~25 nm), while those deposited at 80°C were microcrystalline (~150 nm). Films were characterized by x-ray diffraction studies, field-emission scanning electron microscope image analysis, infrared spectral analysis, and by both alternating-current (a.c.) and direct-current (d.c.) electrical measurements. A blue-shift was observed for the nanocrystalline films. Film resistivity and junction properties were obtained from electrical measurements.     

Fair queueing with service envelopes (FQSE): a cousin-fair hierarchical scheduler for subscriber access networks

In this paper, we propose and investigate the characteristics of a fair queueing with service envelopes (FQSE) algorithm-a hierarchical fair-share scheduling algorithm for access networks based on a remote scheduling system such as Ethernet passive optical networks (EPON) or cable TV network. FQSE is designed to overcome the limiting factors of a typical remote scheduling system such as large control-plane delay, limited control-plane bandwidth, and significant queue switch-over overhead. The algorithm is based on a concept of service envelope-a function representing the fair allocation of resources based on a global network condition called satisfiability parameter (SP). We define properties of cousin-fairness and sibling-fairness and show the FQSE to be cousin-fair. FQSE is unique in that it is the only hierarchical algorithm that is simultaneously cousin-fair. Furthermore, we show the necessary techniques to adapt FQSE to variable-sized packet-based networks. We analyze FQSE performance in EPON serving 1024 independent queues and demonstrate FQSE's ability to provide guaranteed bandwidth to each queue and to share the excess bandwidth fairly.     

Survivable WDM mesh networks

In a wavelength-division-multiplexing (WDM) optical network, the failure of network elements (e.g., fiber links and cross connects) may cause the failure of several optical channels, thereby leading to large data losses. This study examines different approaches to protect a mesh-based WDM optical network from such failures. These approaches are based on two survivability paradigms: 1) path protection/restoration and 2) link protection/restoration. The study examines the wavelength capacity requirements, and routing and wavelength assignment of primary and backup paths for path and link protection and proposes distributed protocols for path and link restoration. The study also examines the protection-switching time and the restoration time for each of these schemes, and the susceptibility of these schemes to multiple link failures. The numerical results obtained for a representative network topology with random traffic demands demonstrate that there is a tradeoff between the capacity utilization and the susceptibility to multiple link failures. We find that, on one hand, path protection provides significant capacity savings over link protection, and shared protection provides significant savings over dedicated protection; while on the other hand, path protection is more susceptible to multiple link failures than link protection, and shared protection is more susceptible to multiple link failures than dedicated protection. We formulate a model of protection-switching times for the different protection schemes based on a fully distributed control network. We propose distributed control protocols for path and link restoration. Numerical results obtained by simulating these protocols indicate that, for a representative network topology, path restoration has a better restoration efficiency than link restoration, and link restoration has a faster restoration time compared with path restoration.     

WDM optical communication networks: progress and challenges

While optical-transmission techniques have been researched for quite some time, optical "networking" studies have been conducted only over the past dozen years or so. The field has matured enormously over this time: many papers and Ph.D. dissertations have been produced, a number of prototypes and testbeds have been built, several books have been written, a large number of startups have been formed, and optical WDM technology is being deployed in the marketplace at a very rapid rate. The objective of this paper is to summarize the basic optical networking approaches, report on the WDM deployment strategies of two major US carriers, and outline the current research and development trends on WDM optical networks.     

A graph-theoretic approach for studying the convergence of fractalencoding algorithm

We present a graph-theoretic interpretation of convergence of fractal encoding based on partial iterated function system (PIFS). First we have considered a special circumstance, where no spatial contraction has been allowed in the encoding process. The concept leads to the development of a linear time fast decoding algorithm from the compressed image. This concept is extended for the general scheme of fractal compression allowing spatial contraction (on averaging) from larger domains to smaller ranges. A linear time fast decoding algorithm is also proposed in this situation, which produces a decoded image very close to the result obtained by an ordinary iterative decompression algorithm.     

Bounded Tamper Resilience: How to Go Beyond the Algebraic Barrier

Related key attacks (RKAs) are powerful cryptanalytic attacks where an adversary can change the secret key and observe the effect of such changes at the output. The state of the art in RKA security protects against an a-priori unbounded number of certain algebraic induced key relations, e.g., affine functions or polynomials of bounded degree. In this work, we show that it is possible to go beyond the algebraic barrier and achieve security against arbitrary key relations, by restricting the number of tampering queries the adversary is allowed to ask for. The latter restriction is necessary in case of arbitrary key relations, as otherwise a generic attack of Gennaro et al. (TCC 2004) shows how to recover the key of almost any cryptographic primitive. We describe our contributions in more detail below. (1) We show that standard ID and signature schemes constructed from a large class of \(\Sigma \)-protocols (including the Okamoto scheme, for instance) are secure even if the adversary can arbitrarily tamper with the prover’s state a bounded number of times and obtain some bounded amount of leakage. Interestingly, for the Okamoto scheme we can allow also independent tampering with the public parameters. (2) We show a bounded tamper and leakage resilient CCA-secure public key cryptosystem based on the DDH assumption. We first define a weaker CCA-like security notion that we can instantiate based on DDH, and then we give a general compiler that yields CCA security with tamper and leakage resilience. This requires a public tamper-proof common reference string. (3) Finally, we explain how to boost bounded tampering and leakage resilience [as in (1) and (2) above] to continuous tampering and leakage resilience, in the so-called floppy model where each user has a personal hardware token (containing leak- and tamper-free information) which can be used to refresh the secret key. We believe that bounded tampering is a meaningful and interesting alternative to avoid known impossibility results and can provide important insights into the security of existing standard cryptographic schemes.     

Reliability bounds and other inequalities for discrete life distributions

In this paper we give sharp bounds on the reliability of discrete IFR, IFRA, NBU, DFR, DFRA and NWU classes, based on one known moment. Subsequently the discrete analogues of several continuous-time results related to maintained systems are also presented.     

Enhanced photoluminescence from free-standing microstructures fabricated on MBE grown PbSe–PbSrSe MQW structure

Fabrication of microrods from multi-quantum well (MQW) PbSe–PbSrSe structure grown in molecular beam epitaxy (MBE) followed by its morphological as well as optical characterizations are described. Pulsed PL intensity is increased by 64 times per unit surface area from a free-standing MQW microrod mounted on copper heat sink compared with the bulk sample. Enhancement in side emission power due to the higher optical confinement effect during pulsed photoluminescence (PL) from MQW semiconductor microtube inserted in hollow quartz optical fiber signifies that these microstructures are robust in nature and crucial contenders for portable mid-infrared optoelectronic devices to be used in the field of industrial trace-gas sensing.     

Elimination of Fresnel Reflection Boundary Effects and Beam Steering in Pulsed Terahertz Computed Tomography

For the past few decades there has been tremendous innovation and development of Terahertz (THz) science and imaging. In particular, the technique of 3-D computed tomography has been adapted from the X-Ray to the THz range. However, the finite refractive index of materials in the THz range can severally refract probing THz beams during the acquisition of tomography data. Due to Fresnel reflection power losses at the boundaries as well as steering of the THz beam through the sample, refractive effects lead to anomalously high local attenuation coefficients near the material boundaries of a reconstructed image. These boundary phenomena can dominate the reconstructed THz-CT images making it difficult to distinguish structural defect(s) inside the material. In this paper an algorithm has been developed to remove the effects of refraction in THz-CT reconstructed images. The algorithm is successfully implemented on cylindrical shaped objects.     

ISGP: Iterative sequential geometric programming for precise and robust CMOS analog circuit sizing

In this paper, a fast yet accurate CMOS analog circuit sizing method, referred to as Iterative Sequential Geometric Programming (ISGP), has been proposed. In this methodology, a correction factor has been introduced for each parameter of the geometric programming (GP) compatible device and performance model. These correction factors are updated using a SPICE simulation after every iteration of a sequential geometric programming (SGP) optimization. The proposed methodology takes advantage of SGP based optimization, namely, fast convergence and effectively optimum design and at the same time it uses SPICE simulation to fine tune the design point by rectifying inaccuracy that may exists in the GP compatible device and performance models. In addition, the ISGP considers the requirement of common centroid layout and yield aware design centering for robust final design point specifying the number of fingers and finger widths for each transistor which makes the design point ready for layout.