A matroid M is a finite set E, called the ground set of M, together with a notion of what it means for subsets of E to be independent. Some matroids, called regular matroids, have the property that all elements in their ground set can be represented by vectors over any field. A matroid is called round if its dual has no two disjoint minimal dependent sets. Roundness is an important property that was very useful in the recent proof of Rota's conjecture, which remained an unsolved problem for 40 years in matroid theory. In this thesis, we give a characterization of regular round matroids.

A numerical investigation of the interaction of a planar shock wave with a rigid wedge and cone in an air-filled shock tube is performed by computing the unsteady flow field of the interaction process. The Euler and Navier-Stokes equations are solved in two dimensions to produce flow solutions for regular and Mach reflections with and without the viscous and thermal boundary layer on the inclined surface. The transition boundary between these two patterns is determined by changing both the shock strength and the angle of the inclined surface so that the simulations are perpendicular to the theoretical transition boundary. The numerically determined boundaries are compared to the theoretical boundaries predicted by two- and three- shock theories and with results obtained from experiments. The results show that the transition boundary between regular and Mach reflection is different not only for wedges and cones but also for inviscid and viscous numerical solutions.

A numerical investigation of the interaction of a planar shock wave with a rigid wedge and cone in an air-filled shock tube is performed by computing the unsteady flow field of the interaction process. The Euler and Navier-Stokes equations are solved in two dimensions to produce flow solutions for regular and Mach reflections with and without the viscous and thermal boundary layer on the inclined surface. The transition boundary between these two patterns is determined by changing both the shock strength and the angle of the inclined surface so that the simulations are perpendicular to the theoretical transition boundary. The numerically determined boundaries are compared to the theoretical boundaries predicted by two- and three- shock theories and with results obtained from experiments. The results show that the transition boundary between regular and Mach reflection is different not only for wedges and cones but also for inviscid and viscous numerical solutions.

En esta Tesis damos una descripción del monoide V(M(A)) de clases de equivalencia de idempotentes/proyecciones de anillos de multiplicadores M(A), en el sentido de Murray-Von Neumann. Esta correspondencia se aplica principalmente a anillos de multiplicadores de anillos regulares simples y a una clase amplia de C*-álgebras simples con rango real cero y rango estable uno. Con esta descripción analizamos el reticulo de ideales del monoide V(M(A)), que por otro lado es un ingrediente crucial para entender la estructura de ideales del correspondiente anillo de multiplicadores. En casos importantes, demostramos que si A tiene escala finita, entonces el cociente de M(A) por cualquier ideal cerrado I que contiene propiamente a A, tiene rango estable uno. La extraordinaria complicación que presenta el retículo de ideales de M(A) se ve reflejada en el hecho que M(A) puede tener una cantidad no numerable de cocientes distintos. La metodologia desarrollada se aplica para el estudio de la riqueza de extremos en C*-álgebras. En particular, demostramos que el espacio de quasitrazas y la escala contienen suficiente información para decidir si M(A)/A tiene riqueza de extremos, lo que ocurre si la escala es finita. Si la escala no es finita, necesitamos condiciones más restrictivas.

In this thesis, we cover the general topic of state complexity. In particular, we examine the bounds on the state complexity of some different representations of regular languages. As well, we consider the state complexity of the operation root(<i>L</i>). We give quick treatment of the deterministic state complexity bounds for nondeterministic finite automata and regular expressions. This includes an improvement on the worst-case lower bound for a regular expression, relative to its alphabetic length. The focus of this thesis is the study of the increase in state complexity of a regular language <i>L</i> under the operation root(<i>L</i>). This operation requires us to examine the connections between abstract algebra and formal languages. We present results, some original to this thesis, concerning the size of the largest monoid generated by two elements. Also, we give good bounds on the worst-case state complexity of root(<i>L</i>). In turn, these new results concerning root(<i>L</i>) allow us to improve previous bounds given for the state complexity of two-way deterministic finite automata.

In this thesis, we cover the general topic of state complexity. In particular, we examine the bounds on the state complexity of some different representations of regular languages. As well, we consider the state complexity of the operation root(<i>L</i>). We give quick treatment of the deterministic state complexity bounds for nondeterministic finite automata and regular expressions. This includes an improvement on the worst-case lower bound for a regular expression, relative to its alphabetic length. The focus of this thesis is the study of the increase in state complexity of a regular language <i>L</i> under the operation root(<i>L</i>). This operation requires us to examine the connections between abstract algebra and formal languages. We present results, some original to this thesis, concerning the size of the largest monoid generated by two elements. Also, we give good bounds on the worst-case state complexity of root(<i>L</i>). In turn, these new results concerning root(<i>L</i>) allow us to improve previous bounds given for the state complexity of two-way deterministic finite automata.

This essay mainly utilize theoretical tool of ¡§State Centralism¡¨ to observe fixed network industry development history in Taiwan. After 1980s, based on characteristics of fixed network, state monopolizes the industry. However, digital techniques develop rapidly from last 1970s, the legitimacy of traditionally state monopoly model is gradually decrease. In the meantime, authoritatrian regime reform and economic liberalization in Taiwan start from 1980s to make state autonomy decreasing and launch liberalization of fixed network industry. Nevertheless, state role in industry didn¡¦t disappear after fixed network liberalization. In this research, author point out fixed network liberalization process in Taiwan is one kind of state centralism model. The liberalization is an ¡§instrument¡¨ but ¡§object¡¨ for state to accelerate development of information society and industrial structure reform in Taiwan. After fixed network market open in 2000, the market almost still monopolized by Chunghwa Telecom Co. It never achieves ¡§competitive development¡¨ environment planed by state. For fixed network industry of Taiwan, though state have outline regulatory policy, how to achieve a competitive environment after liberalization is the most important challenge to state to face new age of digital convergence.

none

Thesis (D. Min.)--Northern Baptist Theological Seminary, 2000. / Abstract. Includes bibliographical references (leaves 269-277).

The aim of this study was to examine personal running histories of one successful and one less successful Swedish female runner. The focus was on finding the motivating and demotivating factors in becoming a runner, and major differences between the successful and the less successful runner. The theoretical frameworks- transtheoretical model and selfdetermination theory- were used as guides when conducting two narrative interviews. Data analysis was based on the recommendations of the Narrative Oriented Inquiry (NOI) model. Sjuzet and fabula, holistic content and categorical content analyses were the three analyses chosen out of the six recommended in the NOI model. The holistic content analysis resulted in narratives about each participant life background and previous training, personal history to become a runner, and present time and future plans for running. The categorical-content analysis revealed eight motivating factors for running, four demotivating factors for running and three themes contrasting the participants. Results are discussed in relation to the theoretical frameworks and previous research.