n-GaAs Band-Edge Repositioning by Modification with Metalloporphyrin/Polysiloxane Matrices

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

The spectral edge of some random band matrices

We study the asymptotic distribution of the eigenvalues of random Hermitian periodic band matrices, focusing on the spectral edges. The eigenvalues close to the edges converge in distribution to the Airy point process if (and only if) the band is sufficiently wide (W ≫ N5/6). Otherwise, a different limiting distribution appears.

متن کامل

N- and Al-K-Edge EXAFS of AIN Grown on GaAs by MBE

Hexagonal AIN, epitaxially grown on GaAs, is studied with X-ray absorption measurements at the Nand A1-K-edges. The measured nearest neighbour (nn) distances are found shorter than expected by 0.04A to 0.13A for the lSt to 3rd nn shells, respectively, while there is no evidence of undercoordination for the N or A1 atom& The reduction in the nn distances is attributed to the presence of oxygen c...

متن کامل

Perturbations of Diagonal Matrices by Band Random Matrices

We exhibit an explicit formula for the spectral density of a (large) random matrix which is a diagonal matrix whose spectral density converges, perturbated by the addition of a symmetric matrix with Gaussian entries and a given (small) limiting variance profile. 1. Perturbation of the spectral density of a large diagonal matrix In this paper, we consider the spectral measure of a random matrix ...

متن کامل

Degree Matrices Realized by Edge-Colored Forests

Given a c-edge-colored graph G on n vertices, we define the degree matrix M as the c× n matrix whose entry dij is the degree of color i at vertex vj . We show that the obvious necessary conditions for a c× n matrix to be the degree matrix of a c-edge-colored forest on n vertices are also sufficient. It is well known that non-negative integers d1, d2, . . . , dn form a degree list of a forest on...

متن کامل

Improving Network Robustness by Edge Modification

An important property of networked systems is their robustness against removal of network nodes, through either random node failure or targeted attack. Although design methods have been proposed for creating, ab initio, a network that has optimal robustness according to a given measure, one is often instead faced with an existing network that cannot feasibly be substantially modified or redesig...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Active and Passive Electronic Components

سال: 2003

ISSN: 0882-7516,1563-5031

DOI: 10.1155/apec.26.11