Light transmission through and its complete stoppage in an ultra slow wave optical medium

Light Wave transmission -- its compression, amplification, and the optical energy storage -- in an Ultra Slow Wave Medium (USWM) is studied analytically. Our phenomenological treatment is based entirely on the continuity equation for the optical energy flux, and the well known distribution-product property of Dirac delta-function. The results so obtained provide a clear understanding of some recent experiments on light transmission and its complete stoppage in an USWM. Keywords : Ultra slow light, stopped light, slow wave medium, EIT.Comment: (single-column 5pages PDF). Simple class-room phenomenological model of stopped light. Comments most welcom

Codes with Locality for Two Erasures

In this paper, we study codes with locality that can recover from two erasures via a sequence of two local, parity-check computations. By a local parity-check computation, we mean recovery via a single parity-check equation associated to small Hamming weight. Earlier approaches considered recovery in parallel; the sequential approach allows us to potentially construct codes with improved minimum distance. These codes, which we refer to as locally 2-reconstructible codes, are a natural generalization along one direction, of codes with all-symbol locality introduced by Gopalan \textit{et al}, in which recovery from a single erasure is considered. By studying the Generalized Hamming Weights of the dual code, we derive upper bounds on the minimum distance of locally 2-reconstructible codes and provide constructions for a family of codes based on Tur\'an graphs, that are optimal with respect to this bound. The minimum distance bound derived here is universal in the sense that no code which permits all-symbol local recovery from $2$ erasures can have larger minimum distance regardless of approach adopted. Our approach also leads to a new bound on the minimum distance of codes with all-symbol locality for the single-erasure case.Comment: 14 pages, 3 figures, Updated for improved readabilit

Thermal annealing behaviour on electrical properties of Pd/Ru Schottky contacts on n-type GaN

We have investigated the electrical properties of Pd/Ru Schottky contacts on n-GaN as a function of annealing temperature by current-voltage (I-V) and capacitance-voltage (C-V) measurements. The Schottky barrier height of the as-deposited Pd/Ru contact is found to be 0.67 eV (I-V) and 0.79 eV (C-V), respectively. Measurements showed that the Schottky barrier height increased from 0.68 eV (I-V) and 0.80 eV (C-V) to 0.80 eV (I-V) and 0.96 eV (C-V) as the annealing temperature is varied from 200 °C to 300 °C. Upon annealing at 400 °C and 500 °C, the Schottky barrier height decreased to 0.73 eV (I-V) and 0.85 eV (C-V) and 0.72 eV (I-V) and 0.84 eV (C-V), respectively. It is noted that the barrier height further decreased to 0.59 eV (I-V) and 0.72 eV (C-V) when the contact is annealed at 600 °C. The change of Schottky barrier heights and ideality factors with annealing temperature may be due to the formation of interfacial compounds at the Ru/Pd/n-GaN interface. When you are citing the document, use the following link http://essuir.sumdu.edu.ua/handle/123456789/2788

Classical Langevin dynamics of a charged particle moving on a sphere and diamagnetism: A surprise

It is generally known that the orbital diamagnetism of a classical system of charged particles in thermal equilibrium is identically zero -- the Bohr-van Leeuwen theorem. Physically, this null result derives from the exact cancellation of the orbital diamagnetic moment associated with the complete cyclotron orbits of the charged particles by the paramagnetic moment subtended by the incomplete orbits skipping the boundary in the opposite sense. Motivated by this crucial, but subtle role of the boundary, we have simulated here the case of a finite but \emph{unbounded} system, namely that of a charged particle moving on the surface of a sphere in the presence of an externally applied uniform magnetic field. Following a real space-time approach based on the classical Langevin equation, we have computed the orbital magnetic moment which now indeed turns out to be non-zero, and has the diamagnetic sign. To the best of our knowledge, this is the first report of the possibility of finite classical diamagnetism in principle, and it is due to the avoided cancellation.Comment: Accepted for publication in EP

A user's guide for the signal processing software for image and speech compression developed in the Communications and Signal Processing Laboratory (CSPL), version 1

A complete documentation of the software developed in the Communication and Signal Processing Laboratory (CSPL) during the period of July 1985 to March 1986 is provided. Utility programs and subroutines that were developed for a user-friendly image and speech processing environment are described. Additional programs for data compression of image and speech type signals are included. Also, programs for the zero-memory and block transform quantization in the presence of channel noise are described. Finally, several routines for simulating the perfromance of image compression algorithms are included

MOON: A Mixed Objective Optimization Network for the Recognition of Facial Attributes

Attribute recognition, particularly facial, extracts many labels for each image. While some multi-task vision problems can be decomposed into separate tasks and stages, e.g., training independent models for each task, for a growing set of problems joint optimization across all tasks has been shown to improve performance. We show that for deep convolutional neural network (DCNN) facial attribute extraction, multi-task optimization is better. Unfortunately, it can be difficult to apply joint optimization to DCNNs when training data is imbalanced, and re-balancing multi-label data directly is structurally infeasible, since adding/removing data to balance one label will change the sampling of the other labels. This paper addresses the multi-label imbalance problem by introducing a novel mixed objective optimization network (MOON) with a loss function that mixes multiple task objectives with domain adaptive re-weighting of propagated loss. Experiments demonstrate that not only does MOON advance the state of the art in facial attribute recognition, but it also outperforms independently trained DCNNs using the same data. When using facial attributes for the LFW face recognition task, we show that our balanced (domain adapted) network outperforms the unbalanced trained network.Comment: Post-print of manuscript accepted to the European Conference on Computer Vision (ECCV) 2016 http://link.springer.com/chapter/10.1007%2F978-3-319-46454-1_