1,056 research outputs found

    On the time-dependent transport mechanism between surface traps and the 2DEG in AlGaN/GaN devices

    Get PDF
    The physical mechanisms involved in the trapping and de-trapping processes associated to surface donor traps in GaN transistors are discussed in this work. The paper challenges the conventional transient techniques adopted for extrapolating the trap energy level via experiments and TCAD simulations. Transient TCAD simulations were employed to reproduce the time-dependent electrical behavior of a Metal-on-Insulator Field-Effect-Transistor (MISFET) and explain the influence of the electric field and energy barrier on the transient time associated to the trapping and de-trapping mechanisms of surface traps. The comparison between three test-structures and the relative variation of the trapping and de-trapping times with the bias and trap parameters leads to the suggestion of a proposed test-structure and bias configuration to accurately extrapolate the energy level of surface traps in GaN transistors

    Reference and Definiteness

    Get PDF
    It has become increasingly clear since Longobardi (1994, 2003) that certain languages (e.g.Romance, but also Classical and Modern Greek, Bulgarian, Arabic (Fassi-Fehri 2003)…;henceforth 'strong D' languages) exhibit overt association of the referential content of nouns(proper names and referential generics) with D (either by overt N-to-D raising, e.g. of propernames, or by an arguably expletive article), others do not (e.g. English, but also probably therest of Germanic, Celtic…; 'weak D' languages). From a number of scattered observation itcan be suspected that a roughly analogous phenomenon arises with respect to anothersemantic property of DPs, namely definiteness: in certain constructions of some languages,but crucially not in the closely comparable constructions of others, the definite reading ofnominal arguments seems to depend on the overt association of some morphosyntacticmaterial with D (fronting to D° or SpecD)

    The underlying unity of Reference and Quantification

    Get PDF
    The mapping of nominal arguments to semantic interpretation exhibits a certain amount ofintriguing empirical variation across languages; it has become increasingly clear, at least sinceLongobardi (1994), that a good deal of such polymorphy depends on a major parametricdivide, separating two types of languages: certain languages (e.g. Romance, but also Classicaland Modern Greek, Bulgarian, Arabic (Fassi-Fehri 2003)…; henceforth 'strong D' languages)exhibit overt association of nouns functioning as referential constants (proper names andreferential generics) with D (either by overt N-to-D raising, e.g. of proper names, or by anarguably expletive article), others do not (e.g. English, but also probably the rest of Germanic,Celtic…; 'weak D' languages)

    Automorphism groups and new constructions of maximum additive rank metric codes with restrictions

    Full text link
    Let d,n∈Z+d, n \in \mathbb{Z}^+ such that 1≤d≤n1\leq d \leq n. A dd-code C⊂Fqn×n\mathcal{C} \subset \mathbb{F}_q^{n \times n} is a subset of order nn square matrices with the property that for all pairs of distinct elements in C\mathcal{C}, the rank of their difference is greater than or equal to dd. A dd-code with as many as possible elements is called a maximum dd-code. The integer dd is also called the minimum distance of the code. When d<nd<n, a classical example of such an object is the so-called generalized Gabidulin code. There exist several classes of maximum dd-codes made up respectively of symmetric, alternating and hermitian matrices. In this article we focus on such examples. Precisely, we determine their automorphism groups and solve the equivalence issue for them. Finally, we exhibit a maximum symmetric 22-code which is not equivalent to the one with same parameters known so far

    On the structure of subsets of an orderable group with some small doubling properties

    Full text link
    The aim of this paper is to present a complete description of the structure of subsets S of an orderable group G satisfying |S^2| = 3|S|-2 and is non-abelian
    • …
    corecore