Global ETD Search

1	Reviving women : Irish women's prose writing 1890-1920 Meredith, Robert Beorn January 1999 (has links) No description available. 800 Irish Literary Revival; Emily Lawless
2	Utopias, magic realism and rebellious spirits : films of Christine Parker 1990 to 2000 Templeton-Parker, Christine January 2015 (has links) “The More You Look, the more THERE IS to see…” From Hinekaro Goes on a Picnic and Blows up Another Obelisk (Christine Parker, Oceania Parker, 1995) In the 1990s New Zealand was in the grip of free market fundamentalism, neo-liberal deregulation of the economy having begun in the mid-eighties. The Maori protest movement was a major source of societal conflict and feminism had become the ‘F’ word. This study examines my writing and directing during the 1990s in New Zealand. It is proposed that the films contributed to national and international conversations around feminism, colonial struggles, spirituality and the supernatural. It is argued that these works offer a social critique of neoliberalism and the divisive effects of it, on women in particular. In the context of this appraisal neoliberalism is understood to be a set of beliefs that support the functioning of the global free market, with minimal government regulation, except to protect the functioning of private enterprise and the ownership of private property. The short films One Man’s Meat (1991), Peach (1993), and Hinekaro Goes on a Picnic and Blows up Another Obelisk (1995) and the feature film Channelling Baby (1999) are located in an oeuvre of female, Gay, and Maori film makers and artists responding to this environment. The recurrence of alternative utopias, the use of magic realism and the representation of the spiritual and supernatural in my work are also considered in relation to other films made in the period. A case is made that the films were part of a small vanguard of films responding to the 1990s status quo by offering alternative modes of discourse to the dominant economic rationalism. Rich in visual intensity and heightened narrative tropes, such as irony and fragmented narratives, my aesthetic choices, together with recurring themes of chance and fate, agency and identity, are considered to link the films together as a coherent study. While the works are located in an evolving feminist tradition in the 1990s, their continued relevance today, particularly in relation to foregrounding marginal voices and the disruption of dominant paradigms and expectations of female behaviour and identity, underpin the claim for originality. 791.43
3	Issues of Governance and Culture in the FATA Of Pakistan: Examining the Sources of Insecurity and Extremism Younas, Sadia January 2021 (has links) The full text will be available at the end of the embargo period: 5th Sept 2027 Pakistan Ungoverned spaces Tribal areas Lawless territory 9/11 Pakistan’s security establishment Tribespeople Militant extremism Pashtunwali Durand Line Afghanistan American interference Governance Culture
4	再發事件資料之無母數分析黃惠芬 Unknown Date (has links) 再發事件資料常見於醫學、工業、財經、社會等等領域中，對再發資料分析研究時，我們往往無法確知再發事件發生的時間或是發生次數的分配。因此，本論文探討的是分析再發事件的無母數方法，包括Nelson提出的平均累積函數(mean cumulative function)估計量，及Wang、Chiang與Huang介紹的發生率(occurrence rate)之核函數(kernel function)估計量。就平均累積函數估計量來說，藉由Nelson導出的變異數及自然(naive)變異數，可分別求得平均累積函數的區間估計。本文利用靴環法(bootstrap)計算出平均累積函數在不同時點的變異數，再與Nelson變異數及自然變異數比較，結果顯示Nelson變異數與靴環法算出的變異數較接近。因此，應依據Nelson變異數建構出事件發生累積次數之漸近信賴區間。本論文亦介紹了兩個或多個母體的平均累積函數的比較方法，包含固定時點之比較與整條曲線之比較。在固定時點之下，比較方法分別為平均累積函數成對差異之漸近信賴區間及靴環信賴區間、變異數分析比較法，與排列檢定法；而整條曲線比較方法包含：類似統計量、Lawless-Nadeau檢定。這些方法應用在本論文所採之實證資料時，所得到的檢定結論是一致的。 / Recurrent event data arise in many fields, such as medicine, industry, economics, social sciences and so on. When studying recurrent event data, we usually don’t know the exact joint or marginal distributions of the occurrence times or the number of events over time. So, in this article we talk about some nonparametric methods, such as the mean cumulative function (MCF) discussed by Nelson, and kernel estimation of the rate function introduced by Wang, Chiang and Huang. As to the estimator of MCF, we can compute the confidence interval by Nelson’s variance and naive variance. We use bootstrap method to compare the performance of Nelson variance of the estimated MCF and naive variance of the estimated MCF. The results show that Nelson variance is better than naive variance, so we should construct the confidence limits for the MCF by Nelson’s variance except when only grouped data are available. We also introduce methods for comparing MCFs, including pointwise comparison of MCFs and comparison of entire MCFs. Methods for pointwise comparing MCFs include approximate confidence limits for difference between two MCFs, analysis-of-variance comparison, permutation test, and bootstrap’s confidence limits for difference between two MCFs. Methods for comparing entire MCFs include a statistic like Hoetelling’s , and Lawless-Nadeau test. Finally, all approaches are employed to analyze a real data, and the conclusions concordance with each other. 再發事件平均累積函數發生率函數核函數靴環法排列檢定變異數分析比較法 Lawless-Nadeau檢定類似 Hoetelling's T square recurrent events mean cumulative function rate function bootstrap permutation test analysis-of-variance comparison Lawless-Nadeau test statistic like Hoetelling's T square kernel estimation
5	On Weak Limits and Unimodular Measures Artemenko, Igor 14 January 2014 (has links) In this thesis, the main objects of study are probability measures on the isomorphism classes of countable, connected rooted graphs. An important class of such measures is formed by unimodular measures, which satisfy a certain equation, sometimes referred to as the intrinsic mass transport principle. The so-called law of a finite graph is an example of a unimodular measure. We say that a measure is sustained by a countable graph if the set of rooted connected components of the graph has full measure. We demonstrate several new results involving sustained unimodular measures, and provide thorough arguments for known ones. In particular, we give a criterion for unimodularity on connected graphs, deduce that connected graphs sustain at most one unimodular measure, and prove that unimodular measures sustained by disconnected graphs are convex combinations. Furthermore, we discuss weak limits of laws of finite graphs, and construct counterexamples to seemingly reasonable conjectures. tree automorphism group ball path connected component rooted birooted graph Cayley converges weakly extreme point mass transport principle involution invariance law neighbourhood orbit rigid subgraph unimodular unimodularity vertex-transitive walk weak limit weak convergence probability measure barred binary tree bi-infinite path first ancestor judicial lawless negligible stabilizer sustained strictly sustained random graph
6	On Weak Limits and Unimodular Measures Artemenko, Igor January 2014 (has links) In this thesis, the main objects of study are probability measures on the isomorphism classes of countable, connected rooted graphs. An important class of such measures is formed by unimodular measures, which satisfy a certain equation, sometimes referred to as the intrinsic mass transport principle. The so-called law of a finite graph is an example of a unimodular measure. We say that a measure is sustained by a countable graph if the set of rooted connected components of the graph has full measure. We demonstrate several new results involving sustained unimodular measures, and provide thorough arguments for known ones. In particular, we give a criterion for unimodularity on connected graphs, deduce that connected graphs sustain at most one unimodular measure, and prove that unimodular measures sustained by disconnected graphs are convex combinations. Furthermore, we discuss weak limits of laws of finite graphs, and construct counterexamples to seemingly reasonable conjectures. tree automorphism group ball path connected component rooted birooted graph Cayley converges weakly extreme point mass transport principle involution invariance law neighbourhood orbit rigid subgraph unimodular unimodularity vertex-transitive walk weak limit weak convergence probability measure barred binary tree bi-infinite path first ancestor judicial lawless negligible stabilizer sustained strictly sustained random graph

1

Page generated in 0.0335 seconds