The reduced probability of E2 transitions between rotational levels built upon γ-vibrational states was calculated for even-even nuclei. General expressions were derived as functions of the spin of the initial state and a parameter γ10. Branching ratios for special cases were obtained, which compare quite favourably with experiment. / Thesis / Master of Science (MS)

Suppose G is a graph and p >= 2q are positive integers. A color-list is a mapping L: V --> P(0, 1,...,p-1) which assigns to each vertex a set L(v) of permissible colors. An L-(p, q)-coloring of G is a (p, q)-coloring h of G such that for each vertex v, h(v) in L(v). We say G is L-(p, q)-colorable if such a coloring exists. A color-size-list is a mapping f: V -->{0, 1, 2,..., p}, which assigns to each vertex v a non-negative integer f(v). We say G is f-(p, q)-colorable if for every color-list L with |{L}(v)| = f(v), G is L-(p, q)-colorable. For odd cycles C, Raspaud and Zhu gave a sharp sufficient condition for a color-size-list f under which C is f-(2k+1, k)-colorable. The corresponding question for even cycles remained open. In this paper, we consider list circular coloring of even cycles. For each even cycle C of length n and for each positive integer k, we give a condition on f which is sufficient and sharp for C to be f-(2k+1, k)-colorable.

In typical distributions (Even [John] was late), 'even' projects two expected presuppositions: 1) There are more people than John who were late and 2) John is a surprising candidate to be late. In comparatives (John is even later than Sam), there is a unique inference, which is distinct from the two aforementioned and, critically, unique to the context of comparatives. In this case, we could say that John and Sam are both late, which is not entailed from the simple comparative ‘John is later than Sam’ (Rett, 2008). The aim of this thesis is to relate the expected presuppositions (Karttunen and Peters, 1979), which constitute the broad theoretical framing of ‘even’, to the unique inference borne from comparatives. Doing so brings two research questions. First, the syntactic element that 'even' focuses must be identified. Departing from Barker (1991), I argue this syntactic element, in many comparatives with 'even', is the structure obligatorily elided under the process of Comparative Deletion (Bresnan 1973, 1975). A key argument against Barker is on the grounds of discourse. The second research question pertains to satisfying the two expected presuppositions of ‘even’, which, in turn, situates the distribution under study within the larger theoretical framing of ‘even’. Together, the arguments for both questions give an explanation as to how the unique inference is derived.

In this thesis we will present two main theorems that can be used to study minor minimal non even cut matroids. Given any signed graph we can associate an even cut matroid. However, given an even cut matroid, there are in general, several signed graphs which represent that matroid. This is in contrast to, for instance graphic (or cographic) matroids, where all graphs corresponding to a particular graphic matroid are essentially equivalent. To tackle the multiple non equivalent representations of even cut matroids we use the concept of Stabilizer first introduced by Wittle. Namely, we show the following: given a "substantial" signed graph, which represents a matroid N that is a minor of a matroid M, then if the signed graph extends to a signed graph which represents M then it does so uniquely. Thus the representations of the small matroid determine the representations of the larger matroid containing it. This allows us to consider each representation of an even cut matroid essentially independently. Consider a small even cut matroid N that is a minor of a matroid M that is not an even cut matroid. We would like to prove that there exists a matroid N' which contains N and is contained in M such that the size of N' is small and such that N' is not an even cut matroid (this would imply in particular that there are only finitely many minimally non even cut matroids containing N). Clearly, none of the representations of N extends to M. We will show that (under certain technical conditions) starting from a fixed representation of N, there exists a matroid N' which contains N and is contained in M such that the size of N' is small and such that the representation of N does not extend to N'.

In this thesis we will present two main theorems that can be used to study minor minimal non even cut matroids. Given any signed graph we can associate an even cut matroid. However, given an even cut matroid, there are in general, several signed graphs which represent that matroid. This is in contrast to, for instance graphic (or cographic) matroids, where all graphs corresponding to a particular graphic matroid are essentially equivalent. To tackle the multiple non equivalent representations of even cut matroids we use the concept of Stabilizer first introduced by Wittle. Namely, we show the following: given a "substantial" signed graph, which represents a matroid N that is a minor of a matroid M, then if the signed graph extends to a signed graph which represents M then it does so uniquely. Thus the representations of the small matroid determine the representations of the larger matroid containing it. This allows us to consider each representation of an even cut matroid essentially independently. Consider a small even cut matroid N that is a minor of a matroid M that is not an even cut matroid. We would like to prove that there exists a matroid N' which contains N and is contained in M such that the size of N' is small and such that N' is not an even cut matroid (this would imply in particular that there are only finitely many minimally non even cut matroids containing N). Clearly, none of the representations of N extends to M. We will show that (under certain technical conditions) starting from a fixed representation of N, there exists a matroid N' which contains N and is contained in M such that the size of N' is small and such that the representation of N does not extend to N'.

In this thesis, various designs of VLSI sorter architectures are proposed. This thesis first presents a baseline serial sorter architecture built on a central memory module equipped with a single compare-and-swap (C&S) functional unit. A dedicated low-cost address generation circuit which controls the order of data accesses and C&S operation in order to support sorting of data sequences with any length is proposed. By exploring the bit-permutation technique to create the access orders suitable for different C&S steps, the address generator can be built by only two adders and three shifters plus some control circuits, and consumes only about 1K gates. Next, this thesis also proposes a two-bank memory architecture to reduce the required memory ports from four to two such that the sorter memory can be realized by on-chip SRAM blocks. Our experimental results show that the overall silicon cost can be reduced by more than 56% for the sorter circuit which can sort the data sequence of length up to 1024. In addition to the serial sorter architecture, this thesis further proposes three possible parallel sorter architectures including the pipeline sorter, cascade sorter, and block sorter. Among these three architectures, the pipeline sorter can deliver the best throughput although it can be used only for fixed-length data sequences. On the other hand, the block sorter is the most flexible design suitable for sequences with variable length. It is designed based on the block-level even-odd merge sort algorithm. It significantly outperforms the previous block sorter design by using more efficient algorithm, architectural pipelining, and better block C&S(BC&S) unit which can realize separate pre-sort and merge processes efficiently. Our implementation results show that by using the 0.18um technology, the core size of the proposed sorter with block-size of four is about 0.509mm2, and can sorting a 1024-point sequence within 32.84us.

A quantitative and qualitative research study was conducted to discover what assistors promoted continuous enrollment of women in Texas Even Start Family Literacy programs. 270 women who were enrolled for a second program year or longer anonymously completed a questionnaire that was available in both Spanish and English. Statements regarding which assistors promoted their continuous participation along with demographic statements were included in the questionnaire; free response comments were requested as well. Statistical measurements of factor analysis, frequency response, Chi-Square, and Analysis of Variance were used. Compared to previous research (Quigley, 1997) that identified three categories of barriers, this research identified five categories of assistors: situational, institutional, dispositional, parental, and program specific. Parental assistors, as a group, were statistically significant more than any of the other assistors when measured according to the independent variables of participants' age, children's age, and enrollment level. Institutional and dispositional assistors were found statistically significant when measured according to the variable of participants' age. Post-hoc measures did not reveal statistical significance for any of the levels of the variables. However, free responses from the participants did provide insight as to why parental, institutional, and dispositional assistors were significant in both their lives and the lives of their children.

A quantitative and qualitative research study was conducted to discover what assistors promoted continuous enrollment of women in Texas Even Start Family Literacy programs. 270 women who were enrolled for a second program year or longer anonymously completed a questionnaire that was available in both Spanish and English. Statements regarding which assistors promoted their continuous participation along with demographic statements were included in the questionnaire; free response comments were requested as well. Statistical measurements of factor analysis, frequency response, Chi-Square, and Analysis of Variance were used. Compared to previous research (Quigley, 1997) that identified three categories of barriers, this research identified five categories of assistors: situational, institutional, dispositional, parental, and program specific. Parental assistors, as a group, were statistically significant more than any of the other assistors when measured according to the independent variables of participants' age, children's age, and enrollment level. Institutional and dispositional assistors were found statistically significant when measured according to the variable of participants' age. Post-hoc measures did not reveal statistical significance for any of the levels of the variables. However, free responses from the participants did provide insight as to why parental, institutional, and dispositional assistors were significant in both their lives and the lives of their children.

Thesis (M.S.)--Oregon State University, 2007. / Printout. Includes bibliographical references (leaves 49-53). Also available on the World Wide Web.

The purpose of this work is to evaluate the performance of a specific ac drive topology that is of current interest in industry. With the increasing pressure for compliance with IEEE-519 and other international harmonic standards, many ac drive manufacturing companies are seeking innovative and cost effective solutions for controlling the amount of harmonics produced at the point of common coupling (PCC). The proposed topology is a potential alternative to the three-phase diode bridge which is the conventional rectifier topology for non-regenerative applications. The work of this thesis explains the theory of operation, control algorithms, and potential improvement strategies for the proposed "half-controlled" boost rectifier topology. The entire ac drive system with load is then modeled and the results verified using the Simulink simulation package. It is shown that the proposed topology has several distinct advantages over a traditional diode rectifier such as improved total harmonic distortion (THD) of the current waveforms, dc bus voltage regulation, and power factor control. In addition, these advantages are created at a price point which is significantly lower than that of a conventional fully-controlled pulse-width modulated (PWM) rectifier. The main disadvantage is that the current waveforms in the utility contain even harmonics which may cause significant problems in the power system.