No description available.

Synthesis of structures is a very difficult task even with only a small number of components that form a system; yet it is the catalyst of innovation. Molecular structures and nanostructures typically have a large number of similar components but different connections, which manifests a more challenging task for their synthesis. <p> This thesis presents a novel method and its related algorithms and computer programs for the synthesis of structures. This novel method is based on several concepts: (1) the structure is represented by a graph and further by the adjacency matrix; and (2) instead of only exploiting the eigenvalue of the adjacency matrix, both the eigenvalue and the eigenvector are exploited; specifically the components of the eigenvector have been found very useful in algorithm development. This novel method is called the Eigensystem method.<p> The complexity of the Eigensystem method is equal to that of the famous program called Nauty in the combinatorial world. However, the Eigensystem method can work for the weighted and both directed and undirected graph, while the Nauty program can only work for the non-weighted and both directed and undirected graph. The cause for this is the different philosophies underlying these two methods. The Nauty program is based on the recursive component decomposition strategy, which could involve some unmanageable complexities when dealing with the weighted graph, albeit no such an attempt has been reported in the literature. It is noted that in practical applications of structure synthesis, weighted graphs are more useful than non-weighted graphs for representing physical systems. <p> Pivoted at the Eigensystem method, this thesis presents the algorithms and computer programs for the three fundamental problems in structure synthesis, namely the isomorphism/automorphism, the unique labeling, and the enumeration of the structures or graphs.

This thesis studies the transition matrix of a quantum walk on strongly regular graphs. It is proposed by Emms, Hancock, Severini and Wilson in 2006, that the spectrum of a matrix based on the amplitudes of walks in the quantum walk, distinguishes strongly regular graphs. We begin by finding the eigenvalues of matrices describing the quantum walk for regular graphs. We also show that if two graphs are isomorphic, then the corresponding matrices produced by the procedure of Emms et al. are cospectral. We then look at the entries of the cube of the transition matrix and find an expression for the matrices produced by the procedure of Emms et al. in terms of the adjacency matrix and incidence matrices of the graph.

Synthesis of structures is a very difficult task even with only a small number of components that form a system; yet it is the catalyst of innovation. Molecular structures and nanostructures typically have a large number of similar components but different connections, which manifests a more challenging task for their synthesis. <p> This thesis presents a novel method and its related algorithms and computer programs for the synthesis of structures. This novel method is based on several concepts: (1) the structure is represented by a graph and further by the adjacency matrix; and (2) instead of only exploiting the eigenvalue of the adjacency matrix, both the eigenvalue and the eigenvector are exploited; specifically the components of the eigenvector have been found very useful in algorithm development. This novel method is called the Eigensystem method.<p> The complexity of the Eigensystem method is equal to that of the famous program called Nauty in the combinatorial world. However, the Eigensystem method can work for the weighted and both directed and undirected graph, while the Nauty program can only work for the non-weighted and both directed and undirected graph. The cause for this is the different philosophies underlying these two methods. The Nauty program is based on the recursive component decomposition strategy, which could involve some unmanageable complexities when dealing with the weighted graph, albeit no such an attempt has been reported in the literature. It is noted that in practical applications of structure synthesis, weighted graphs are more useful than non-weighted graphs for representing physical systems. <p> Pivoted at the Eigensystem method, this thesis presents the algorithms and computer programs for the three fundamental problems in structure synthesis, namely the isomorphism/automorphism, the unique labeling, and the enumeration of the structures or graphs.

Abstract As a young offender in Sweden today you can be sentenced to juvenile care within the social services. Within the juvenile care it may be an option for these young offenders to undergo an affect program. That is a collective name for several types of structured programs that can include everything from conversations to visits. The purpose of this study was to create an understanding of which arguments there are for why these affect programs for young offenders is being used in three municipalities in southern Sweden. We authors found this interesting because of the lack of evidence for these affect programs. We do not know how effective these programs are for the young people that are undergoing them. We have interviewed employees at three different affect programs and the research questions that we have answered are: What arguments, for using these affect programs, do the concerned operators have? What do the concerned operators think about the lack of evidence for the affect programs? To achieve the aim of this study, we have implemented a qualitative study of semi-structured interviews. The analysis of our collected empirical work was based on the term isomorphism. The results of the study show that the reasons why the employees at the three studied affect programs chose to start these affect programs was because they had the requirement to be able to offer a legible, predictable and proportionate penalty. In the absence of evidence about how programs should be built the employees were inspired by other municipalities. The employees do not put much emphasis on different theories but instead they rely on their own experiences and on what they think is effective. The employees at the three programs think that it would be good if it existed evidence about the affect programs, but it is not crucial. Local resources set limits for how good the affect programs can become and the staff involvement also has a great significance.

This dissertation investigates the extraction of knowledge from a known environment. Virtual ontology – the extracted knowledge – is defined as a structure of a virtual environment with semantics. While many existing 3D reconstruction approaches can generate virtual environments without structure and related knowledge, the use of Metaearth architecture is proposed as a more descriptive data structure for virtual ontology. Its architecture consists of four layers: interactions and relationships between virtual components can be represented in the virtual space layer; and the library layers contribute to the design of large-scale virtual environments with less redundancy; and the mapping layer links the library layer to the virtual space layer; and the ontology layer functions as a context for the extracted knowledge. The dissertation suggests two construction methodologies. The first method generates a scene structure from a 2D image. Unlike other scene understanding techniques, the suggested method generates scene ontology without prior knowledge and human intervention. As an intermediate process, a new and effective fuzzy color-based over-segmentation method is suggested. The second method generates virtual ontology with 3D information using multi-view scenes. The many ambiguities in extracting 3D information are resolved by employing a new fuzzy dynamic programming method (FDP). The hybrid approach of FDP and 3D reconstruction method generates more accurate virtual ontology with 3D information. A virtual model is equipped with virtual ontology whereby contextual knowledge can be mapped into the Metaearth architecture via the proposed isomorphic matching method. The suggested procedure guarantees the automatic and autonomous processing demanded in virtual interaction analysis with far less effort and computational time.

In this thesis, we describe the Jordan isomorphisms and Jordan derivations on prime rings of characteristic 2. We prove that every Jordan isomorphism of M_{n}(F),n >= 3 is either an isomorphism or an antiisomorphism if n is odd, and it is not true if n is even. We also describe the Jordan isomorphisms and Jordan derivations on M_{2}(GF(2)).

<p>Abstract</p><p>As a young offender in Sweden today you can be sentenced to juvenile care within the social services. Within the juvenile care it may be an option for these young offenders to undergo an affect program. That is a collective name for several types of structured programs that can include everything from conversations to visits. The purpose of this study was to create an understanding of which arguments there are for why these affect programs for young offenders is being used in three municipalities in southern Sweden. We authors found this interesting because of the lack of evidence for these affect programs. We do not know how effective these programs are for the young people that are undergoing them. We have interviewed employees at three different affect programs and the research questions that we have answered are: What arguments, for using these affect programs, do the concerned operators have? What do the concerned operators think about the lack of evidence for the affect programs? To achieve the aim of this study, we have implemented a qualitative study of semi-structured interviews. The analysis of our collected empirical work was based on the term isomorphism. The results of the study show that the reasons why the employees at the three studied affect</p><p>programs chose to start these affect programs was because they had the requirement to be able to offer a legible, predictable and proportionate penalty. In the absence of evidence about how programs should be built the employees were inspired by other municipalities. The employees do not put much emphasis on different theories but</p><p>instead they rely on their own experiences and on what they think is effective. The employees at the three programs think that it would be good if it existed evidence about the affect programs, but it is not crucial. Local resources set limits for how good the affect programs can become and the staff involvement also has a great significance.</p>

Leadership development trends - isomorphism or innovation? This study examines leadership development within organizations, including strategies, objectives and processes that help to shape the organizations leadership development. The study is based on nine in-depth interviews with planners/decision-makers in eight different organizations. A part of the study consists of a web based survey completed by managers/leaders, were the gathered results assist in providing further insight on the topic being studied. The interaction between different players and stakeholders, significant social changes as well as major challenges in the continued leadership development process are highlighted and analysed. The study's most important conclusion is that successful and innovative leadership development is based on constant curiosity, business intelligence, understanding of the individual employee’s needs, as well as and business goals whilst achieving this by constant interaction throughout the organization. The overall trend is that leadership development is being increasingly adapted and renewed. Knowledge, understanding, relationships and values are strengthened and that coaching, personal development and a capability for renewal are provided.

This thesis studies the transition matrix of a quantum walk on strongly regular graphs. It is proposed by Emms, Hancock, Severini and Wilson in 2006, that the spectrum of a matrix based on the amplitudes of walks in the quantum walk, distinguishes strongly regular graphs. We begin by finding the eigenvalues of matrices describing the quantum walk for regular graphs. We also show that if two graphs are isomorphic, then the corresponding matrices produced by the procedure of Emms et al. are cospectral. We then look at the entries of the cube of the transition matrix and find an expression for the matrices produced by the procedure of Emms et al. in terms of the adjacency matrix and incidence matrices of the graph.