• Refine Query
  • Source
  • Publication year
  • to
  • Language
  • 1275
  • 320
  • 207
  • 152
  • 104
  • 87
  • 40
  • 22
  • 16
  • 16
  • 14
  • 14
  • 14
  • 13
  • 13
  • Tagged with
  • 2723
  • 579
  • 315
  • 234
  • 231
  • 226
  • 219
  • 200
  • 182
  • 175
  • 166
  • 131
  • 130
  • 130
  • 128
  • 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.
1

Social och emotionell träning i en skola för tidigare år : - En undersökning av metoden SET

Andersson, Anette January 2010 (has links)
No description available.
2

Social och emotionell träning i en skola för tidigare år : - En undersökning av metoden SET

Andersson, Anette January 2010 (has links)
No description available.
3

APPROXIMATING REACHABLE SETS FOR A CLASS OF LINEAR SYSTEMS SUBJECT TO BOUNDED CONTROL.

GAYEK, JONATHAN EDWARD. January 1984 (has links)
A method is proposed for approximating the reachable set from the origin for a class of n first order linear ordinary differential equations subject to bounded control. The technique involves decoupling the system equations into 1- and 2-dimensional linear subsystems, and then finding the reachable set of each of the subsystems. Having obtained bounds on each of the decoupled state variables, a n-dimensional parallelpiped is constructed which contains the reachable set from the origin for the original system. Several illustrative examples are presented for the case where the control is a scalar. The technique is also compared to a Lyapunov approach of approximating the reachable set in a simple 2-dimensional example.
4

Some results of abstract set theory

Unknown Date (has links)
"The purpose of this paper is to present some of the elementary results of abstract set theory. This will include the definition of an 'order' relation for cardinal numbers, and a discussion of whether or not this definition defines a simple ordering of the cardinals. Although we will not answer this question fully, in the course of the discussion a key theorem (the Bernstein Theorem) will arise. The remainder of the paper will be devoted to a discussion of this theorem, its proof, a generalization due to Banach, a discussion of this proof, and a generalization of Banach's Theorem by Ky Fan"--Introduction. / Typescript. / "February, 1958." / "Submitted to the Graduate Council of Florida State University in partial fulfillment of the requirements for the degree of Master of Science." / Advisor: Paul J. McCarthy, Professor Directing Paper. / Includes bibliographical references (leaf 25).
5

The structure of preordered sets and their topological properties /

Bu, How-shone. January 1972 (has links)
Thesis (M.S.)--Oregon State University, 1972. / Typescript (photocopy). Includes bibliographical references. Also available on the World Wide Web.
6

CONNECTED PACKINGS OF COMPACT SETS

Carlstedt, Linda Marie, 1941- January 1968 (has links)
No description available.
7

Complete extensions of ordered sets

Ballinger, Bruce T. (Bruce Thomas) January 1969 (has links)
No description available.
8

The covering of sets of constant width.

Cohn, Michael James. January 1972 (has links) (PDF)
Thesis (M.Sc.) -- University of Adelaide, Dept. of Pure Mathematics, 1972.
9

La philosophie mathématique et la théorie des ensembles ...

Tseng, Ting-ho. January 1938 (has links)
Thèse--Université de Paris. / Bibliography: p. [159-162].
10

Mengen und Mächtigkeiten eine erkenntniskritische Studie /

Sganzini, Carlo. January 1913 (has links)
Thesis (doctoral)--Universität Bern, 1913. / Includes bibliographical references (p. [137]-138).

Page generated in 0.1496 seconds