Global ETD Search

Search theses and dissertations gathered from participating repositories worldwide. Every result links back to the library that holds it. No account is needed.

Results

Showing 1 to 20 of 113 for “"N-dimensional"”.

  1. Supersymmetric quantum mechanics on n-dimensional manifolds

    In this thesis I investigate the properties of the supersymmetric path integral on Riemannian manifolds. Chapter 1 is a brief introduction to supersymmetric quantum mechanics. In Chapter 2 I show that the supersymmetric path integral can be defined as the continuum limit of a discrete …

    uiuc Repository record for Supersymmetric quantum mechanics on n-dimensional manifolds (opens in a new tab)

  2. Supersymmetric quantum mechanics on n-dimensional manifolds

    In this thesis I investigate the properties of the supersymmetric path integral on Riemannian manifolds. Chapter 1 is a brief introduction to supersymmetric quantum mechanics. In Chapter 2 I show that the supersymmetric path integral can be defined as the continuum limit of a discrete …

    uiuc Repository record for Supersymmetric quantum mechanics on n-dimensional manifolds (opens in a new tab)

  3. Digital Transmission by Hermite N-Dimensional Antipodal Scheme

    A new N-dimensional digital modulation technique is proposed as a bandwidth efficient method for the transmission of digital data. The technique uses an antipodal scheme in which parallel binary data signs baseband orthogonal waveforms derived from Hermite polynomials. Orthogonality guarantees …

    vt Repository record for Digital Transmission by Hermite N-Dimensional Antipodal Scheme (opens in a new tab)

  4. Discrete representations of n-dimensional wave equations and their applications to quantum mechanics

    Thesis (Ph. D.)--Massachusetts Institute of Technology, Dept. of Physics, 1992.

    mit Repository record for Discrete representations of n-dimensional wave equations and their applications to quantum mechanics (opens in a new tab)

  5. Organization as a pyramiding, n-dimensional network of interconnected and overlapping closed loop information feedback systems

    The theory of organization that this thesis proposes possesses a characteristic plasticity that should enable it to span the gap that has traditionally existed between the two broad types of current organizational theories. Generally, one type of theory proposes to describe how organizations should …

    vt Repository record for Organization as a pyramiding, n-dimensional network of interconnected and overlapping closed loop information feedback systems (opens in a new tab)

  6. Approximate solutions to the wave equation for a medium with one discontinuity

    This thesis deals with a particle limit for the n dimensional wave equation and shows that there are asymptotic solutions for certain pulses in the high-frequency limit. These pulses are shown to propagate along rays predicted by geometrical optics. The solutions are computed up to an error which …

    vt Repository record for Approximate solutions to the wave equation for a medium with one discontinuity (opens in a new tab)

  7. Métodos de clasificación de álgebras con anulador no nulo

    … by polynomial identities, of dimension n with a mdimensional annihilator, using the classification of algebras of dimensión n-m. In addition, we apply this procedure in different specific cases, obtaining the classification of the n-dimensional algebras with (n - 2)-dimensional annihilator, the …

    cadiz Repository record for Métodos de clasificación de álgebras con anulador no nulo (opens in a new tab)

  8. Hyperspace Topologies

    … the collection of closed subsets of R-n having n-dimensional Lebesgue measure zero. We conclude with the intersection of these two sets being a residual set representing the collection of uncountable, closed subsets of R-n having n-dimensional Lebesgue measure zero.

    unt Repository record for Hyperspace Topologies (opens in a new tab)

  9. Area-contracting maps between rectangles

    … k-dilation of all diffeomorphisms between two n-dimensional rectangles R and S. I proved that for many rectangles there are highly non-linear diffeomorphisms with much smaller k-dilation than any linear diffeomorphism. When k is equal to n-l, I determined the smallest k-dilation up to a constant …

    mit Repository record for Area-contracting maps between rectangles (opens in a new tab)

  10. Scaling laws for heterogeneous wireless networks

    … For traffic heterogeneity, we analyze the n x n dimensional unicast capacity region. For service heterogeneity, we consider the impact of multicasting and caching. This gives rise to the n x 2n dimensional multicast capacity region and the 2" x n dimensional caching capacity region. In each of …

    mit Repository record for Scaling laws for heterogeneous wireless networks (opens in a new tab)

  11. Near-optimal broadcast in all-port wormhole-routed hypercubes using error-correcting codes

    … The communication model assumed allows an n-dimensional hypercube to have at most n concurrent I/O communication along its ports. It assumes a distance insensitivity of (n + 1) with no intermediate reception capability for the nodes. The approach is based on determination of the set of nodes …

    unlv Repository record for Near-optimal broadcast in all-port wormhole-routed hypercubes using error-correcting codes (opens in a new tab)

  12. Proven Cases of a Generalization of Serre's Conjecture

    … a correspondence between modular forms and two-dimensional Galois representations. Ash, Doud, and Pollack have extended this conjecture to a correspondence between Hecke eigenclasses in arithmetic cohomology and n-dimensional Galois representations. We present some of the first examples of …

    byu Repository record for Proven Cases of a Generalization of Serre's Conjecture (opens in a new tab)

  13. On the hardness of the shortest vector problem

    An n-dimensional lattice is the set of all integral linear combinations of n linearly independent vectors in Rm. One of the most studied algorithmic problems on lattices is the shortest vector problem (SVP): given a lattice, find the shortest non-zero vector in it. We prove that the shortest vector …

    mit Repository record for On the hardness of the shortest vector problem (opens in a new tab)

  14. A framework for the visualization of multidimensional and multivariate data

    High dimensionality is a major challenge for data visualization. Parameter optimization problems require an understanding of the behaviour of an objective function in an n-dimensional space around the optimum - this is multidimensional visualization and is a natural extension of the traditional …

    whiterose Repository record for A framework for the visualization of multidimensional and multivariate data (opens in a new tab)

  15. Discrete dynamical systems in solving H-equations

    … H-equation is discussed. This is a nonlinear n-dimensional dynamical system. We study not only the solutions of the nth approximation for the H-equation but also the mathematical structure and behavior of the orbits with respect to the parameter function, i.e. characteristic function. The …

    vt Repository record for Discrete dynamical systems in solving H-equations (opens in a new tab)

  16. Representations of Algebras: Some Computational Aspects

    … algorithms is an algorithm deciding whether an n-dimensional irreducible representation exists. We also provide a package, finitely-presented-algebra, which implements these algorithms into the computer algebra system SAGE.

    temple Repository record for Representations of Algebras: Some Computational Aspects (opens in a new tab)

  17. Inequalities for Random Walk and Partially Observed Brownian Motion

    … studies the control of the maximal function of N-dimensional Brownian motion, B(,t), by the maximal function of partially observed Brownian motion. Let R denote a fixed open subset of (//R)('N), G an arbitrary open subset, and T the first exit time of the Brownian motion from G. Define the maximal …

    uiuc Repository record for Inequalities for Random Walk and Partially Observed Brownian Motion (opens in a new tab)

  18. Detector design and estimation for a digital communication system

    … MAMF system. In the traditional system the N-dimensional signal vector, which encodes the bit to be communicated, remains fixed throughout the whole communication process ( transmission and reception). In the proposed system the encoding N-dimensional signal vector is composed of K linearly …

    vt Repository record for Detector design and estimation for a digital communication system (opens in a new tab)

Page 1 of 6