3,520 research outputs found
Sixty Years of Community: St. Olaf Catholic Parish in Eau Claire, Wisconsin, 1952-2012
Full text linkThis paper will explore how the parish community of St. Olaf in Eau Claire, Wisconsin, established in 1952, reflects the Roman Catholic Church, specifically at the local, state, and national levels in the United States. It will also discuss the various changes that have occurred in the past 60 years of its history in terms of the various locations of worship for the members, the growth of the community outreach programs, and the effects of the Second Vatican Council. This ecumenical council was a meeting of Catholic bishops from around the whole that brought reform to the Catholic Church and affected the relationship of the Catholic Church to the world. The parish at St. Olaf has grown from having only 125 families in 1952 to over 1,000 families in 2012
Digging Into Data White Paper:Trading Consequences
Full text linkScholars interested in nineteenth-century global economic history face a voluminous historical record. Conventional approaches to primary source research on the economic and environmental implications of globalised commodity flows typically restrict researchers to specific locations or a small handful of commodities. By taking advantage of cutting-edge computational tools, the project was able to address much larger data sets for historical research, and thereby provides historians with the means to develop new data-driven research questions. In particular, this project has demonstrated that text mining techniques applied to tens of thousands of documents about nineteenth-century commodity trading can yield a novel understanding of how economic forces connected distant places all over the globe and how efforts to generate wealth from natural resources impacted on local environments.The large-scale findings that result from the application of these new methodologies would be barely feasible using conventional research methods. Moreover, the project vividly demonstrates how the digital humanities can benefit from trans-disciplinary collaboration between humanists, computational linguists and information visualisation experts. Important facets of this project include:· After considerable difficulty and lengthy negotiations, we acquired significantly more historical documents than we originally expected. The full corpus exceeds 7 billion word tokens, which is very big data by humanist standards.· Lexicon creation proved to be one of the most challenging and interesting aspects of the project, requiring interdisciplinary skills in archival research, linked data, text mining and knowledge of the historical context.· The project has identified almost 2,000 commodities that were regularly traded in the nineteenth century, two orders of magnitude more than are standardly studied by historians.· Historical sources that have undergone Optical Character Recognition (OCR) are challenging to process and this, in combination with the particular questions asked by historians, required the text mining team to develop new approaches and new text processing tools for the project.· The geospatial nature of the data lent itself well to an interactive visualisation that displays commodities in relation to locations on a world map. The same commodities can also be visualised on a timeline to show how trading evolved over the nineteenth century.· The relational database and visualisation software is well advanced and ready for use in historical research. The database can by used by historians for unguided research aimed at developing new research questions and identifying crucial primary source texts related to a specific commodit
From Mansions to Towers: A History of Residence Halls at the University of Wisconsin-Eau Claire
Full text linkThe construction of the University of Wisconsin-Eau Claire's residence halls has generally followed that of the national trend. The school struggled to find enough funds to build residence halls in the early years. Eventually, student housing was in needed so badly that the school had no choice but to provide housing for the students. In 1947, the Dulany mansion was purchased and remodeled by the school. This building served as the University's first resident hall. Since then, eleven resident halls have been built on campus with one more being planned. Life in these residence halls have changed dramatically over time. In the 1960's, the students protested and eventually the strict rules of in loco parentis faded away. After this, students enjoyed the freedoms of new technologies, relaxed rules, and more professional housing leaders. Today, UW-Eau Claire is a thriving university. UW-Eau Claire has been recognized by many as a top school in the Midwest. Much of the success can be attributed to the residence halls and the happiness of the students. My paper will provide UW-Eau Claire and its students with a cohesive history of the residence halls on campus and will also show how student life has evolved since the University was first established
The Impact of Annotation on the Performance of Protein Tagging in Biomedical Text
No full textIn this paper we discuss five different corpora annotated forprotein names. We present several within- and cross-dataset proteintagging experiments showing that different annotation schemes severelyaffect the portability of statistical protein taggers. By means of adetailed error analysis we identify crucial annotation issues thatfuture annotation projects should take into careful consideration
Claire Tham (1967-)
Full text linkAs an author, Claire Tham has this far been less concerned to observe the canons of English literature and more concerned to explore its creative possibilities and its adaptability. She also articulates a significant viewpoint about national and personal identity, about cultural tensions in a dynamic urban centre in transition, and about the.flip-side of Singapore’s prodigious prosperity
Claire Wheeler: Fearless Psychologist
No full textFearless physician/psychologist Claire is a clinical psychologist and former emergency room doctor. As a full-time instructor at PSU’s School of Community Health she teaches classes in disease physiology, mind-body medicine, nutrition and health psychology. She is the author of 10 Simple Solutions to Stress, published in 2007. She’ll reveal some of the mysteries of how negative thoughts can affect your health, and teach techniques to avoid them. Think “cognitive reframing.”https://pdxscholar.library.pdx.edu/pdxtalks/1020/thumbnail.jp
Jurisprudence - the bystander to crime
No full textThe author raises questions about the predicament of a bystander to a serious crime who does not intervene to oppose it. Article by Claire Valier (Lecturer in Law, University of London) published in Amicus Curiae - Journal of the Society for Advanced Legal Studies. The Journal is produced by the Society for Advanced Legal Studies at the Institute of Advanced Legal Studies, University of London
Solutions améliorées de l'algorithme de Grover pour la détection d'utilisateurs actifs dans les résaux sans fil
No full text5G comprend des fonctionnalités telles que Ultra-fiables à faible latence (URLLC) et Massives entre machines (mMTC) pour minimiser les délais et connecter de nombreux appareils. Cela nécessite un schéma Détection des utilisateurs Actifs (AUD), nécessitant une détection en temps réel par Base Station (BS). Maximum de Vraisemblance (ML) est le plus performant pour AUD mais il est complexe. Pour simplifier, des alternatives comme CCR et ZF ont été introduites mais ne peuvent égaler les performances de ML. Pour y remédier, nous explorons l’algorithme de Grover, connu pour ses capacités de superposition (travail avec 0 et 1), superposition (travailler avec 0 et 1 en même temps). Cependant, l’algorithme de Grover, lorsqu’il est contraint par la fonction f(x) = δ, n’est pas aussi performant que ML ; il est plus proche de CCR et de ZF. Pour atteindre les performances de ML, l’algorithme de Grover doit être modifié pour trouver la distance minimale, comme ML la distance minimale, comme le fait ML. Nous proposons un nouvel algorithme, à savoir Algorithme Amélioré de Recherche de Minimum par Itération (IIMSA), visant à améliorer les algorithmes existants Boyer-Brassard-Høyer-Tapp (BBHT) et Durr-Hoyer Algorithm (DHA), qui sont les méthodes prometteuses pour trouver le minimum à l’aide de l’algorithme de Grover afin de réduire leur complexité tout en maintenant des performances élevées. L’idée est d’utiliser n’importe quel nombre aléatoire de solutions plutôt que d’effectuer L itérations aléatoires comme le suggère DHA. Nous incorporons également des méthodes classiques telles que ZF et CCR pour améliorer leurs performances et réduire la complexité. Nous adaptons également l’algorithme de Grover dans le contexte de AUD dans cette thèse. Nous présentons également un algorithme de Grover amélioré inspiré d’une solution hybride quantique qui exploite à la fois des éléments quantiques et classiques, solution hybride quantique qui exploite à la fois des éléments quantiques et classiques. L’objectif principal est d’augmenter la probabilité de succès Ps et de réduire la complexité de l’algorithme original de Grover de l’algorithme de Grover original. Le concept consiste à utiliser moins d’itérations de Grover que le nombre optimal, dénommé Ps. que le nombre optimal, noté Lopt, et de le combiner avec la probabilité de succès classique. Nous pensons que cette approche a le potentiel de modifier le comportement de la complexité et d’obtenir une probabilité de succès élevé et d’atteindre une probabilité de succès élevée.5G encompasses features such as Ultra-Reliable Low Latency Communication (URLLC) and Massive Machine Type Communication (mMTC) to minimize delays and connect numerous devices. This requires an Active User Detection (AUD) scheme, necessitating real-time detection by the Base Station (BS). Maximum Likelihood (ML) is the most efficient for AUD, but it is complex. To simplify, alternatives like CCR and ZF have been introduced but cannot match the performance of ML. To address this, we explore the Grover algorithm, known for its superposition capabilities (working with both 0 and 1 simultaneously). However, when constrained by the function f(x) = δ, Grover's algorithm is not as efficient as ML; it is closer to CCR and ZF. To achieve ML's performance, the Grover algorithm must be modified to find the minimum distance, similar to ML. We propose a new algorithm, namely the Improved Iterative Minimum Search Algorithm (IIMSA), aiming to enhance existing algorithms Boyer-Brassard-Høyer-Tapp (BBHT) and Durr-Hoyer Algorithm (DHA), which are promising methods for finding the minimum using the Grover algorithm, to reduce their complexity while maintaining high performance. The idea is to use any random number of solution rather than performing random iterations as suggested by DHA. We also incorporate classical methods like ZF and CCR to improve their performance and reduce complexity. We also adapt the Grover algorithm in the context of AUD in this thesis. We also present an enhanced Grover algorithm inspired by a quantum-classical hybrid solution that utilizes both quantum and classical elements. The main objective is to increase the success probability Ps and reduce the complexity of the original Grover algorithm. The concept involves using fewer Grover iterations than the optimal number, denoted Ps, and combining it with classical success probability. We believe this approach has the potential to alter complexity behavior and achieve a high success probability
Mixed Grover: A Hybrid Version to Improve Grover's Algorithm for Unstructured Database Search
No full textIn this article, we propose a new strategy to exploit Grover's algorithm for unstructured search problems. We first show that running Grover's routine with a reduced number of iterations but allowing several trials presents a complexity advantage while keeping the same success probability. Then, by a theoretical analysis of the performance, we provide a generic procedure to parameterize the number of iterations within one shot of Grover's algorithm and the maximum number of trials , given a targeted success and the size of the database . At the end, we highlight that this new approach permits to reduce the computational time by at least 10% for independently of the size of the database
La Fabrique des classiques africains: écrivains d’Afrique subsaharienne francophone . Par Ducournau Claire
No full textThis is a pre-copyedited, author-produced PDF of an article accepted for publication in French Studies following peer review. The version of record Claire H Griffiths (2018) La Fabrique des classiques africains : ecrivains d'Afrique subsaharienne francophone par Claire Ducournau, French Studies, Volume 72, Issue 2, 1 April 2018, Pages 318–319 is available online at: https://doi.org/10.1093/fs/kny023The review article evaluates major new scholarship on the development of the French literary system in colonial and postcolonial Africa and its impact on Francophone writing
- …
