• Refine Query
  • Source
  • Publication year
  • to
  • Language
  • 144
  • 21
  • 17
  • 5
  • 4
  • 3
  • 2
  • 2
  • 2
  • 2
  • 2
  • 2
  • 1
  • 1
  • 1
  • Tagged with
  • 224
  • 224
  • 40
  • 29
  • 22
  • 21
  • 21
  • 19
  • 18
  • 15
  • 15
  • 14
  • 13
  • 12
  • 12
  • About
  • The Global ETD Search service is a free service for researchers to find electronic theses and dissertations. This service is provided by the Networked Digital Library of Theses and Dissertations.
    Our metadata is collected from universities around the world. If you manage a university/consortium/country archive and want to be added, details can be found on the NDLTD website.
131

Electrons in perturbed periodic lattices

January 1949 (has links)
J.C. Slater. / "May 12, 1949." / Includes bibliographical references. / Army Signal Corps Contract No. W36-039-sc-32037 Project No. 102B Dept. of the Army Project No. 3-99-10-022
132

Cusps of arithmetic orbifolds

McReynolds, David Ben, January 1900 (has links) (PDF)
Thesis (Ph. D.)--University of Texas at Austin, 2006. / Vita. Includes bibliographical references.
133

Characterizations of Planar Lattices by Left-relations

Zschalig, Christian 27 April 2009 (has links) (PDF)
Recently, Formal Concept Analysis has proven to be an efficient method for the analysis and representation of information. However, the possibility to visualize concept hierarchies is being affected by the difficulty of drawing attractive diagrams automatically. Reducing the number of edge crossings seems to increase the readability of those drawings. This dissertation concerns with a mandatory prerequisite of this constraint, namely the characterization and visual representation of planar lattices. The manifold existing approaches and algorithms are thereby considered under a different point of view. It is well known that exactly the planar lattices (or planar posets) possess an additional order ``from left to right''. Our aim in this work is to define left-relations and left-orders more precisely and to describe several aspects of planar lattices with their help. The three approaches employed structure the work in as many parts: Left-relations on lattices allow a more efficient consideration of conjugate orders since they are uniquely determined by the sorting of the meet-irreducibles. Additionally, the restriction on the meet-irreducibles enables us to achieve an intuitive description of standard contexts of planar lattices similar to the consecutive-one property. With the help of left-relations on diagrams, planar lattices can indeed be drawn without edge crossings in the plane. Thereby, lattice-theoretically found left-orders can be detected in the graphical representation again. Furthermore, we modify the left-right-numbering algorithm in order to obtain attribute-additive and plane drawings of planar lattices. Finally, we will consider left-relations on contexts. They turn out to be fairly similar structures to the Ferrers-graphs. Planar lattices can be characterized by a property of these graphs, namely the bipartiteness. We will constructively prove this result. Subsequently, we can design an efficient algorithm that finds all non-similar plane diagrams of a lattice. / Die Formale Begriffsanalyse hat sich in den letzten Jahren als effizientes Werkzeug zur Datenanalyse und -repräsentation bewährt. Die Möglichkeit der visuellen Darstellung von Begriffshierarchien wird allerdings durch die Schwierigkeit, ansprechende Diagramme automatisch generieren zu können, beeinträchtigt. Offenbar sind Diagramme mit möglichst wenig Kantenkreuzungen für den menschlichen Anwender leichter lesbar. Diese Arbeit beschäftigt sich mit mit einer diesem Kriterium zugrunde liegenden Vorleistung, nämlich der Charakterisierung und Darstellung planarer Verbände. Die schon existierenden vielfältigen Ansätze und Methoden werden dabei unter einem neuen Gesichtspunkt betrachtet. Bekannterweise besitzen genau die planaren Verbände (bzw. planare geordnete Mengen) eine zusätzliche Ordnung "von links nach rechts". Unser Ziel in dieser Arbeit ist es, solche Links-Relationen bzw. Links-Ordnungen genauer zu definieren und verschiedene Aspekte planarer Verbände mit ihrer Hilfe zu beschreiben. Die insgesamt drei auftretenden Sichtweisen gliedern die Arbeit in ebensoviele Teile: Links-Relationen auf Verbänden erlauben eine effizientere Behandlung konjugierter Ordnungen, da sie durch die Anordnung der Schnitt-Irreduziblen schon eindeutig festgelegt sind. Außerdem erlaubt die Beschränkung auf die Schnitt-Irreduziblen eine anschauliche Beschreibung von Standardkontexten planarer Verbände ähnlich der consecutive-one property. Mit Hilfe der Links-Relationen auf Diagrammen können planare Verbände tatsächlich eben gezeichnet werden. Dabei lassen sich verbandstheoretisch ermittelte Links-Ordnungen in der graphischen Darstellung wieder finden. Weiterhin geben wir in eine Modifikation des left-right-numbering an, mit der planare Verbände merkmaladditiv und eben gezeichnet werden können. Schließlich werden wir Links-Relationen auf Kontexten betrachten. Diese stellen sich als sehr ähnlich zu Ferrers-Graphen heraus. Planare Verbände lassen sich durch eine Eigenschaft dieser Graphen, nämlich die Bipartitheit, charakterisieren. Wir werden dieses Ergebnis konstruktiv beweisen und darauf aufbauend einen effizienten Algorithmus angeben, mit dem alle nicht-ähnlichen ebenen Diagramme eines Verbandes bestimmt werden können.
134

Lattice subgroups of Kac-Moody groups

Cobbs, Ila Leigh, January 2009 (has links)
Thesis (Ph. D.)--Rutgers University, 2009. / "Graduate Program in Mathematics." Includes bibliographical references (p. 86-88).
135

Dynamics of quantum control in cold-atom systems

Roy, Analabha, 1978- 16 October 2012 (has links)
The dynamics of mesoscopic two-boson systems that model an interacting pair of ultracold alkali atoms in the presence of electromagnetic potentials are considered. The translational degrees of freedom of such a system can be described by a simple reduced atom Hamiltonian. Introducing time modulations in the laser fields causes parametric variations of the Hamiltonian's Floquet eigenvalue spectrum. Broken symmetries cause level repulsion and avoided crossings in this spectrum that are quantum manifestations of the chaos in the underlying classical dynamics of the systems. We investigate the effects of this phenomenon in the coherent control of excitations in these systems. These systems can be coherently excited from their ground states to higher energy states via a Stimulated Raman Adiabatic Passage (STIRAP). The presence of avoided crossings alter the outcome of STIRAP. First, the classical dynamics of such two-boson systems in double wells is described and manifestations of the same to the quantum mechanical system are discussed. Second, the quantum dynamics of coherent control in the manner discussed above is detailed for a select choice(s) of system parameters. Finally, the same chaos-assisted adiabatic passage is demonstrated for optical lattice systems based on experiments on the same done with noninteracting atoms. / text
136

Applications of lattice theory to model checking

Kashyap, Sujatha 27 April 2015 (has links)
Society is increasingly dependent on the correct operation of concurrent and distributed software systems. Examples of such systems include computer networks, operating systems, telephone switches and flight control systems. Model checking is a useful tool for ensuring the correctness of such systems, because it is a fully automatic technique whose use does not require expert knowledge. Additionally, model checking allows for the production of error trails when a violation of a desired property is detected. Error trails are an invaluable debugging aid, because they provide the programmer with the sequence of events that lead to an error. Model checking typically operates by performing an exhaustive exploration of the state space of the program. Exhaustive state space exploration is not practical for industrial use in the verification of concurrent systems because of the well-known phenomenon of state space explosion caused by the exploration of all possible interleavings of concurrent events. However, the exploration of all possible interleavings is not always necessary for verification. In this dissertation, we show that results from lattice theory can be applied to ameliorate state space explosion due to concurrency, and to produce short error trails when an error is detected. We show that many CTL formulae exhibit lattice-theoretic structure that can be exploited to avoid exploring multiple interleavings of a set of concurrent events. We use this structural information to develop efficient model checking techniques for both implicit (partial order) and explicit (interleaving) models of the state space. For formulae that do not exhibit the required structure, we present a technique called predicate filtering, which uses a weaker property with the desired structural characteristics to obtain a reduced state space which can then be exhaustively explored. We also show that lattice theory can be used to obtain a path of shortest length to an error state, thereby producing short error trails that greatly ease the task of debugging. We provide experimental results from a wide range of examples, showing the effectiveness of our techniques at improving the efficiency of verifying and debugging concurrent and distributed systems. Our implementation is based on the popular model checker SPIN, and we compare our performance against the state-of-the-art state space reduction strategies implemented in SPIN. / text
137

Cusps of arithmetic orbifolds

McReynolds, David Ben 28 August 2008 (has links)
Not available / text
138

TOPOLOGICAL ANALYSIS OF ACTIVE NETWORKS AND THE TREE-FINDING PROBLEM

Dawson, Darrow Finch, 1931- January 1967 (has links)
No description available.
139

Hexagonal lattice based hydrogen-bonding receptors for guanidine and urea & practical applications of surfactants

Ambatipudi, Sailaja Govindaraju. January 2007 (has links)
Thesis (Ph. D.)--University of Nevada, Reno, 2007. / "August, 2007." Includes bibliographical references (leaves 150-154). Online version available on the World Wide Web.
140

Connectivity properties of Archimedean and Laves lattices /

Parviainen, Robert, January 2004 (has links)
Diss. (sammanfattning) Uppsala : Univ., 2004. / Härtill 6 uppsatser.

Page generated in 0.0629 seconds