Sökning: "isomorphism"

Visar resultat 6 - 10 av 47 avhandlingar innehållade ordet isomorphism.

1. 6. Random Multigraphs : Complexity Measures, Probability Models and Statistical Inference

   Författare :Termeh Shafie; Ove Frank; Krzysztof Nowicki; Stockholms universitet; []
   Nyckelord :SAMHÄLLSVETENSKAP; SOCIAL SCIENCES; multigraph; vertex labeled graph; edge labeled graph; isomorphism; edge multiplicity; simplicity and complexity; entropy; joint information; information divergence; goodness-of-fit; Statistics; statistik;

   Sammanfattning : This thesis is concerned with multigraphs and their complexity which is defined and quantified by the distribution of edge multiplicities. Two random multigraph models are considered.  The first model is random stub matching (RSM) where the edges are formed by randomly coupling pairs of stubs according to a fixed stub multiplicity sequence. LÄS MER

3. 7. Evidensbaserat socialt arbete : Från idé till praktik

   Författare :Kajsa Svanevie; Lindqvist Rafael; Stefan Sjöström; Björn Blom; Lars Oscarsson; Umeå universitet; []
   Nyckelord :SAMHÄLLSVETENSKAP; SOCIAL SCIENCES; Evidence-based practice; social work; critical realism; narrative synthesis; actor-structure perspective; contextual model; paradigm shift; program theory; neo-institutional theory; isomorphism; diffusion; social change; social mechanisms; learning organization; Evidensbaserad praktik; socialt arbete; kritisk realism; narrativ syntes; aktör-struktur perspektiv; kontextuell modell; paradigmskifte; programteori; nyinstitutionell teori; isomorfism; diffusion; social förändring; sociala mekanismer; lärande organisation;

   Sammanfattning : As an innovation Evidence-Based Practice (EBP) is designed as a tool for clinical problem solving. According to its theory of use EBP will bring a difference for policy makers, for professionals, for researchers and for service users. One question to be asked is whether EBP actually leads to the radical social change it is designed to accomplish. LÄS MER

4. 8. Isomorphism classes of abelian varieties over finite fields

   Författare :Stefano Marseglia; Jonas Bergström; Lars Halle; Stockholms universitet; []
   Nyckelord :NATURVETENSKAP; NATURAL SCIENCES; NATURVETENSKAP; NATURAL SCIENCES; Algebraic Geometry; Abelian Varieties; Finite Fields; Ideal Class Group; Ideal Class Monoid;

   Sammanfattning : Deligne and Howe described polarized abelian varieties over finite fields in terms of finitely generated free Z-modules satisfying a list of easy to state axioms. In this thesis we address the problem of developing an effective algorithm to compute isomorphism classes of (principally) polarized abelian varieties over a finite field, together with their automorphism groups. LÄS MER

5. 9. Ny situation - ny organisation : Gatutidningen Situation Sthlm 1995-2000

   Författare :Jan Magnusson; Socialhögskolan; []
   Nyckelord :SAMHÄLLSVETENSKAP; SOCIAL SCIENCES; resource dependence; mimicry; homelessness; social change; resource mobilization; voluntary sector; NGO; adaptive forms; help-to-self-help; new organizations; neocorporatism; institutional isomorphism; emulation; street paper; Social problems and welfare; national insurance; Sociala problem; social välfärd; socialförsäkring;

   Sammanfattning : New organizations emerge in times of social change. Their survival depends on their ability to mobilize resources in an environment defined by an old order, and thus they must adapt to it. LÄS MER

7. 10. New Results on Combinatorial Algorithms

   Författare :Anders Dessmark; Data Vetenskap; []
   Nyckelord :NATURVETENSKAP; NATURAL SCIENCES; Sorting; Subgraph isomorphism; Partial k-trees; computer technology; Time complexity; Parallel computation; Data- och systemvetenskap; Convex layers; Systems engineering; Broadcasting;

   Sammanfattning : In this thesis improved upper bounds for several important combinatorial problems are provided. Below is a list of the main results showed in the thesis. The problem of determining whether a k-connected partial k-tree is isomorphic to subgraph of another partial k-tree is shown to be solvable in time O(nk+2). LÄS MER