19,070 research outputs found

    Strain-stress study of AlxGa1-xN/AlN heterostructures on c-plane sapphire and related optical properties

    Get PDF
    This work presents a systematic study of stress and strain of AlxGa1-xN/AlN with composition ranging from GaN to AlN, grown on a c-plane sapphire by metal-organic chemical vapor deposition, using synchrotron radiation high-resolution X-ray diffraction and reciprocal space mapping. The c-plane of the AlxGa1-xN epitaxial layers exhibits compressive strain, while the a-plane exhibits tensile strain. The biaxial stress and strain are found to increase with increasing Al composition, although the lattice mismatch between the AlxGa1-xN and the buffer layer AlN gets smaller. A reduction in the lateral coherence lengths and an increase in the edge and screw dislocations are seen as the AlxGa1-xN composition is varied from GaN to AlN, exhibiting a clear dependence of the crystal properties of AlxGa1-xN on the Al content. The bandgap of the epitaxial layers is slightly lower than predicted value due to a larger tensile strain effect on the a-axis compared to the compressive strain on the c-axis. Raman characteristics of the AlxGa1-xN samples exhibit a shift in the phonon peaks with the Al composition. The effect of strain is also discussed on the optical phonon energies of the epitaxial layers. The techniques discussed here can be used to study other similar materials.Comment: 14 pages, 5 figures, 2 table

    Some Exact Results for Spanning Trees on Lattices

    Full text link
    For nn-vertex, dd-dimensional lattices Ī›\Lambda with dā‰„2d \ge 2, the number of spanning trees NST(Ī›)N_{ST}(\Lambda) grows asymptotically as expā”(nzĪ›)\exp(n z_\Lambda) in the thermodynamic limit. We present an exact closed-form result for the asymptotic growth constant zbcc(d)z_{bcc(d)} for spanning trees on the dd-dimensional body-centered cubic lattice. We also give an exact integral expression for zfccz_{fcc} on the face-centered cubic lattice and an exact closed-form expression for z488z_{488} on the 4ā‹…8ā‹…84 \cdot 8 \cdot 8 lattice.Comment: 7 pages, 1 tabl

    Identifying influential spreaders and efficiently estimating infection numbers in epidemic models: a walk counting approach

    Full text link
    We introduce a new method to efficiently approximate the number of infections resulting from a given initially-infected node in a network of susceptible individuals. Our approach is based on counting the number of possible infection walks of various lengths to each other node in the network. We analytically study the properties of our method, in particular demonstrating different forms for SIS and SIR disease spreading (e.g. under the SIR model our method counts self-avoiding walks). In comparison to existing methods to infer the spreading efficiency of different nodes in the network (based on degree, k-shell decomposition analysis and different centrality measures), our method directly considers the spreading process and, as such, is unique in providing estimation of actual numbers of infections. Crucially, in simulating infections on various real-world networks with the SIR model, we show that our walks-based method improves the inference of effectiveness of nodes over a wide range of infection rates compared to existing methods. We also analyse the trade-off between estimate accuracy and computational cost, showing that the better accuracy here can still be obtained at a comparable computational cost to other methods.Comment: 6 page

    Spanning Trees on Graphs and Lattices in d Dimensions

    Full text link
    The problem of enumerating spanning trees on graphs and lattices is considered. We obtain bounds on the number of spanning trees NSTN_{ST} and establish inequalities relating the numbers of spanning trees of different graphs or lattices. A general formulation is presented for the enumeration of spanning trees on lattices in dā‰„2d\geq 2 dimensions, and is applied to the hypercubic, body-centered cubic, face-centered cubic, and specific planar lattices including the kagom\'e, diced, 4-8-8 (bathroom-tile), Union Jack, and 3-12-12 lattices. This leads to closed-form expressions for NSTN_{ST} for these lattices of finite sizes. We prove a theorem concerning the classes of graphs and lattices L{\cal L} with the property that NSTāˆ¼expā”(nzL)N_{ST} \sim \exp(nz_{\cal L}) as the number of vertices nā†’āˆžn \to \infty, where zLz_{\cal L} is a finite nonzero constant. This includes the bulk limit of lattices in any spatial dimension, and also sections of lattices whose lengths in some dimensions go to infinity while others are finite. We evaluate zLz_{\cal L} exactly for the lattices we considered, and discuss the dependence of zLz_{\cal L} on d and the lattice coordination number. We also establish a relation connecting zLz_{\cal L} to the free energy of the critical Ising model for planar lattices L{\cal L}.Comment: 28 pages, latex, 1 postscript figure, J. Phys. A, in pres

    Network Synchronization, Diffusion, and the Paradox of Heterogeneity

    Full text link
    Many complex networks display strong heterogeneity in the degree (connectivity) distribution. Heterogeneity in the degree distribution often reduces the average distance between nodes but, paradoxically, may suppress synchronization in networks of oscillators coupled symmetrically with uniform coupling strength. Here we offer a solution to this apparent paradox. Our analysis is partially based on the identification of a diffusive process underlying the communication between oscillators and reveals a striking relation between this process and the condition for the linear stability of the synchronized states. We show that, for a given degree distribution, the maximum synchronizability is achieved when the network of couplings is weighted and directed, and the overall cost involved in the couplings is minimum. This enhanced synchronizability is solely determined by the mean degree and does not depend on the degree distribution and system size. Numerical verification of the main results is provided for representative classes of small-world and scale-free networks.Comment: Synchronization in Weighted Network

    Spanning Trees on Lattices and Integration Identities

    Full text link
    For a lattice Ī›\Lambda with nn vertices and dimension dd equal or higher than two, the number of spanning trees NST(Ī›)N_{ST}(\Lambda) grows asymptotically as expā”(nzĪ›)\exp(n z_\Lambda) in the thermodynamic limit. We present exact integral expressions for the asymptotic growth constant zĪ›z_\Lambda for spanning trees on several lattices. By taking different unit cells in the calculation, many integration identities can be obtained. We also give zĪ›(p)z_{\Lambda (p)} on the homeomorphic expansion of kk-regular lattices with pp vertices inserted on each edge.Comment: 15 pages, 3 figures, 1 tabl

    Possible evidence of non-Fermi liquid behavior from quasi-one-dimensional indium nanowires

    Full text link
    We report possible evidence of non-Fermi liquid (NFL) observed at room temperature from the quasi one-dimensional (1D) indium (In) nanowires self-assembled on Si(111)-7Ɨ\times7 surface. Using high-resolution electron-energy-loss spectroscopy, we have measured energy and width dispersions of a low energy intrasubband plasmon excitation in the In nanowires. We observe the energy-momentum dispersion Ļ‰\omega(q) in the low q limit exactly as predicted by both NFL theory and the random-phase-approximation. The unusual non-analytic width dispersion Ī¶(q)āˆ¼qĪ±\zeta(q) \sim q^{\alpha} measured with an exponent Ī±{\alpha}=1.40Ā±\pm0.24, however, is understood only by the NFL theory. Such an abnormal width dispersion of low energy excitations may probe the NFL feature of a non-ideal 1D interacting electron system despite the significantly suppressed spin-charge separation (ā‰¤\leq40 meV).Comment: 11 pages and 4 figure

    Entanglement Perturbation Theory for Antiferromagnetic Heisenberg Spin Chains

    Full text link
    A recently developed numerical method, entanglement perturbation theory (EPT), is used to study the antiferromagnetic Heisenberg spin chains with z-axis anisotropy Ī»\lambda and magnetic field B. To demonstrate the accuracy, we first apply EPT to the isotropic spin-1/2 antiferromagnetic Heisenberg model, and find that EPT successfully reproduces the exact Bethe Ansatz results for the ground state energy, the local magnetization, and the spin correlation functions (Bethe ansatz result is available for the first 7 lattice separations). In particular, EPT confirms for the first time the asymptotic behavior of the spin correlation functions predicted by the conformal field theory, which realizes only for lattice separations larger than 1000. Next, turning on the z-axis anisotropy and the magnetic field, the 2-spin and 4-spin correlation functions are calculated, and the results are compared with those obtained by Bosonization and density matrix renormalization group methods. Finally, for the spin-1 antiferromagnetic Heisenberg model, the ground state phase diagram in Ī»\lambda space is determined with help of the Roomany-Wyld RG finite-size-scaling. The results are in good agreement with those obtained by the level-spectroscopy method.Comment: 12 pages, 14 figure

    Spanning trees on the Sierpinski gasket

    Full text link
    We obtain the numbers of spanning trees on the Sierpinski gasket SGd(n)SG_d(n) with dimension dd equal to two, three and four. The general expression for the number of spanning trees on SGd(n)SG_d(n) with arbitrary dd is conjectured. The numbers of spanning trees on the generalized Sierpinski gasket SGd,b(n)SG_{d,b}(n) with d=2d=2 and b=3,4b=3,4 are also obtained.Comment: 20 pages, 8 figures, 1 tabl

    Integrating high dimensional bi-directional parsing models for gene mention tagging

    Get PDF
    Motivation: Tagging gene and gene product mentions in scientific text is an important initial step of literature mining. In this article, we describe in detail our gene mention tagger participated in BioCreative 2 challenge and analyze what contributes to its good performance. Our tagger is based on the conditional random fields model (CRF), the most prevailing method for the gene mention tagging task in BioCreative 2. Our tagger is interesting because it accomplished the highest F-scores among CRF-based methods and second over all. Moreover, we obtained our results by mostly applying open source packages, making it easy to duplicate our results
    • ā€¦
    corecore