Sökresultat
Filtrera
Filtyp
Din sökning på "fc 26 coins Buyfc26coins.com is EA Sports official for FC 26 coins They are reliable and very fast..lT3A" gav 61738 sökträffar
Text som mängd eller helhet – och i verkligheten. Om en språkvetares textbegrepp
Svaga och starka verb – vilken styrka har de?
No title
Can dressings soaked with polyhexanide reduce bacterial loads of surgical wounds?
Local maxima of Gaussian fields
The structure of a stationary Gaussian process near a local maximum with a prescribed heightu has been explored in several papers by the present author, see [5]–[7], which include results for moderateu as well as foru→±∞. In this paper we generalize these results to a homogeneous Gaussian field {ξ(t) t ∈ R n}, with mean zero and the covariance functionr(t). The local structure of a Gaussian field
Ett steg framåt för universitetspedagogiken
Jag hör musik och letar efter orden -om en nyfunnen text av Hjalmar Gullberg till Peterson-Bergers Vid Frösö kyrka
Skapande falskhet. Till metaforens teori
Var Embla en klängranka? Om den fornnordiska skapelsemyten såsom den möter oss i Völuspá
Alltid när jag sätter på mig svart kavaj får jag mjäll. Om metonymier som argumentationsanalytiska redskap
Complex Collective Decisions – An Epistemic Perspective
Några ord om språkförståelsen i Skandinavien
Salstentamen och lärande - en omöjlig ekvation? Några erfarenheter av en tentaverkstad
Mosaiknummer
Sydvästsvensk a-genitiv - en levande relikt
In modern standard Swedish genitive is marked by -s, which, according to the standard analyses, is a phrasal clitic, viz. [mannen på gatan]s åsikt (man on street-s opinion). In dialects in parts of Småland, Halland, and Västergötland a variant on -a or -e, here called a-genitive, is used, primarily on proper names, viz. Erik-a bil (Erik-gen car) ‘Erik’s car’, a form that should be compared to the
Asymptotics for the size of the largest component scaled to "logn" in inhomogeneous random graphs
We study inhomogeneous random graphs in the subcritical case. Among other results, we derive an exact formula for the size of the largest connected component scaled by logn, with n being the size of the graph. This generalizes a result for the "rank-1 case". We also investigate branching processes associated with these graphs. In particular, we discover that the same well-known equation for the su
