• Refine Query
  • Source
  • Publication year
  • to
  • Language
  • 1
  • 1
  • Tagged with
  • 2
  • 2
  • 1
  • 1
  • 1
  • 1
  • 1
  • 1
  • 1
  • 1
  • 1
  • 1
  • 1
  • 1
  • 1
  • 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

The crossed product of C(X) by a free minimal action of R

Liang, Hutian 06 1900 (has links)
viii, 133 p. A print copy of this thesis is available through the UO Libraries. Search the library catalog for the location and call number. / In this dissertation, we will study the crossed product C*-algebras obtained from free and minimal [Special characters omitted.] actions on compact metric spaces with finite covering dimension. We first define stable recursive subhomogeneous algebras (SRSHAs), which differ from recursive subhomogeneous algebras introduced by N. C. Phillips in that the irreducible representations of SRSHAs are infinite dimensional instead of finite dimensional. We show that simple inductive limits of SRSHAs with no dimension growth in which the connecting maps are injective and non-vanishing have topological stable rank one. We then construct C*-subalgebras of the crossed product that are analogous to the C*-subalgebras in the studies of free minimal [Special characters omitted.] actions on compact metric spaces with finite covering dimension. Finally, we prove that these C*-algebras are in fact simple inductive limits of SRSHAs in which the connecting maps are injective and non-vanishing. Thus these C*-subalgebras have topological stable rank one. / Committee in charge: Christopher Phillips, Chairperson, Mathematics; Boris Botvinnik, Member, Mathematics; Huaxin Lin, Member, Mathematics; Yuan Xu, Member, Mathematics; Dietrich Belitz, Outside Member, Physics
2

Efficiency of a Scenario Editor for Connectivity Between Virtual Military Combat Systems / Effektivitet av en scenarioredigerare för kontakt mellan virtuella militära stridsledningssystem

Mellberg, Tobias, Vilhelmsson, Liam January 2019 (has links)
Today people spend a lot of time trying to complete software-related assignments. Poorly designed software can waste both time and resources needed to complete a task. It is therefore important to have efficient ways to complete these tasks. The Swedish Defence Research Agency, also known as FOI has developed software to calculate whether simulated units in the terrain have radio contact or not. In the current approach the employees manu-ally writes scenario files which contains information about the contact. However, these sce-nario files quickly become very large and difficult to work with. A possible solution to this issue is creating a scenario editor where the user can use an interface to create information about the contact between the units. This thesis suggests a Military Combat System Scenario Editor (MCSSE) which is compared to writing scenario files manually. The comparison is made by first performing a number of tasks with both applications. The applications thereafter evaluated using a metric called Minimal Actions Performed (MAP) which is defined for this comparison. The thesis also suggests appropriate tasks for evaluating the applications using an iterative method consisting of meetings with an expert with specified questions. By using the MAP metric, the application can be evaluated and the results show that the MCSSE is on average 66% more efficient than the current approach.

Page generated in 0.0638 seconds