http://chineseinput.net/에서 pinyin(병음)방식으로 중국어를 변환할 수 있습니다.
변환된 중국어를 복사하여 사용하시면 됩니다.
- 中文 을 입력하시려면 zhongwen을 입력하시고 space를누르시면됩니다.
- 北京 을 입력하시려면 beijing을 입력하시고 space를 누르시면 됩니다.
RISS 인기검색어
- 검색키워드
- 저자 : Wilms, Lynda Britt (검색결과 5 건)
-
-
Wilms, Sabine The University of Arizona 2002 해외박사(DDOD)
This dissertation investigates the medical treatment of the female body in medieval China based on the women-related sections of a pivotal work in the history of Chinese medicine, the second through fourth scrolls of Sun Simiao's <italic>Beiji qianjin yaofang</italic> (completed ca. 652 C.E.). This text provides central evidence for the emergence of gynecology as a separate medical specialty in medieval China and reflects the highest level of elite medical knowledge regarding women at its time. It is the first text in the Chinese medical tradition to clearly define the parameters based on which the gender-specific treatment of the female body was conceptualized in the medical practice of the literati tradition. Its comprehensive nature shows that women's medical treatment in the seventh century was performed by and contested between large variety of practitioners, including literate male elites, professional midwives, other female members of the household or community, and religious specialists. The core of this study consists of an annotated translation of this text, covering the topics of fertility, pregnancy, childbirth, lactation, postpartum recovery, supplementing and boosting, menstrual problems, vaginal discharge, and miscellaneous conditions. The translation is preceded by an introduction which discusses the author and his work, then summarizes and explains the contents of my text, and lastly indicates topics for future research and potential interpretation in the areas of women's health in general, reproduction, physiology, and issues of the gendered body. Lastly, this study includes two indeces for materia medica and for symptoms, syndromes, and diseases.
-
-
Structure, automorphisms, and isomorphisms of regular combinatorial objects
Wilmes, John ProQuest Dissertations & Theses The University of 2016 해외박사(DDOD)
We develop new structure theory for highly regular combinatorial objects, including Steiner designs, strongly regular graphs, and coherent configurations. As applications, we make progress on old problems in algebraic combinatorics and the theory of permutation groups, and break decades-old barriers on the complexity of the algorithmic Graph Isomorphism problem. A central aspect of our structural contributions is the discovery of clique geometries in regular structures. A second aspect is bounds on the rate of expansion of small sets. In the case of Steiner designs, we give a n O(log n) bound on the number of automorphisms where n is the number of points. This result is nearly optimal in two ways: it essentially matches the number of automorphisms in affine or projective space, and we show that the bound does not extend to the broader class of balanced incomplete block designs. The line-graphs of Steiner designs are strongly regular graphs, and in fact are one of the cases of Neumaier's classification of strongly regular graphs. We bound the number of reconstructions of a Steiner design from its line-graph in order to apply our automorphism bound for Steiner designs to this class of strongly regular graphs, and show that this class of strongly regular graphs has at most exp(O( v1/14)) automorphisms, where v is the number of vertices and the O hides polylogarithmic factors. We give an exp(O(1 + lambda/mu)) bound on the number of automorphisms of any nontrivial SR(v,rho,lambda,mu) strongly regular graph. (Here, upsilon is the number of vertices, rho is the valency, and lambda and mu are the number of common neighbors of a pair of adjacent and nonadjacent vertices, respectively.) As a consequence, we obtain a quasipolynomial bound on the number of automorphisms when rho = O(v5/6). In further study of the structure of the automorphism groups of SR( v,rho,lambda,mu) graphs, we find a Gammamu subgroup of index vO(log v ) (i.e., a subgroup of index vO(log v) for which all composition factors are subgroups of Smu) with known exceptions. In combination with our bound on the number of automorphisms and an earlier bound due to Spinlman, we find a Gammad subgroup of the automorphism group of index vd, where d = O (v1/5), again with known exceptions. We classify the primitive coherent configurations with not less than exp(O (v1/3)) automorphisms, where v is the number of vertices. As a corollary to our combinatorial classification result, we infer a classification of large primitive permutation groups, previously known only through the Classification of Finite Simple Groups. As a consequence of the combinatorial structure underlying our bounds for the automorphism groups, we give corresponding bounds for the time-complexity of deciding isomorphism. When we bound the order of the automorphism group, our time-complexity bounds are identical to the bounds on the order. From our study of the composition factors of automorphism groups of strongly regular graphs, we obtain a vmu+O(log v) and a exp( O (v1/5)) bound on the time-complexity of deciding isomorphism of strongly regular graphs.
-
Validation of a German language placement test based on a modified C-test procedure
Wilmes, Carsten University of Illinois at Urbana-Champaign 2007 해외박사(DDOD)
The C-test procedure, a variant of the cloze procedure, has long been advocated as an easy and effective method of assessing foreign language proficiency in a reliable fashion (Eckes & Grotjahn, 2006). For this reason, the Department of Germanic Languages and Literatures at the University of Illinois opted to employ this procedure for the development of a new placement test. This dissertation described both the development process and the challenges encountered during the validation of the test. Extant research on the C-test procedure was critically reviewed and problems with earlier research that are incompatible with current validity theory identified. Based on this, a modified procedure was proposed for the new placement test. This modified C-test procedure combined the specification-based test development process introduced by Davidson & Lynch (2002) with consensus-based content validation. For the modified procedure, content experts made deliberate changes to C-test source texts in an attempt to enhance criterion-referencing and collect content-related validity evidence. Results based on four pilot tests administered over the span of two academic semesters suggested that: (a) the modified C-test procedure delivered enhanced linkage to the department's curriculum, and (b) psychometric qualities such as reliability of test scores were not materially affected by the modifications. The study concluded that a modified C-test procedure might be an effective language testing procedure that is more compatible with current validity theory than the original C-test procedure.
연관 검색어 추천
이 검색어로 많이 본 자료
활용도 높은 자료
