Dissertations / Theses on the topic 'Eliminatie'
Create a spot-on reference in APA, MLA, Chicago, Harvard, and other styles
Consult the top 50 dissertations / theses for your research on the topic 'Eliminatie.'
Next to every source in the list of references, there is an 'Add to bibliography' button. Press on it, and we will generate automatically the bibliographic reference to the chosen work in the citation style you need: APA, MLA, Harvard, Chicago, Vancouver, etc.
You can also download the full text of the academic publication as pdf and read online its abstract whenever available in the metadata.
Browse dissertations / theses on a wide variety of disciplines and organise your bibliography correctly.
Gordon, John. "Should eliminative materialism be eliminated?" Thesis, University of Edinburgh, 1998. http://hdl.handle.net/1842/21264.
Full textYang, Ying. "Identification of the common eliminated region (CER1) by the microcell hybrid based "elimination test" /." Stockholm : [Karolinska institutets bibl.], 2001. http://diss.kib.ki.se/2001/91-7349-102-0.
Full textOuld, Mohamdi El Khalil. "Elimination réduite." Grenoble 2 : ANRT, 1988. http://catalogue.bnf.fr/ark:/12148/cb376172344.
Full textOuld, Mohamdi El Khalil. "Elimination réduite." Université Louis Pasteur (Strasbourg) (1971-2008), 1988. http://www.theses.fr/1988STR13182.
Full textKoutná, Barbora. "Kvalita úvěrového portfolia mikrofinančních institucí." Master's thesis, Vysoká škola ekonomická v Praze, 2015. http://www.nusl.cz/ntk/nusl-264625.
Full textFernández, Gómez Manuel. "Binary Redundancy Elimination." Doctoral thesis, Universitat Politècnica de Catalunya, 2005. http://hdl.handle.net/10803/5985.
Full textPor otro lado, las optimizaciones aplicadas en tiempo de enlace o directamente al programa ejecutable final han recibido una atención creciente en los últimos años, debido a limitaciones existentes en el modelo de compilación tradicional. Incluso aplicando sofisticados análisis y transformaciones interprocedurales, un compilador tradicional no es capaz de optimizar un programa como una entidad completa. Un problema similar aparece aplicando técnicas de compilación dirigidas por profiling: grandes proyectos se ven forzados a recompilar todos y cada uno de sus módulos para aprovechar dicha información. Por el contrario, seria más conveniente construir la aplicación completa, instrumentarla para obtener información de profiling y optimizar entonces el binario final sin recompilar ni un solo fichero fuente.
En esta tesis presentamos nuevas técnicas de compilación dirigidas por profiling para eliminar la redundancia encontrada en programas ejecutables a nivel binario (esto es, redundancia binaria), incluso aunque estos programas hayan sido compilados agresivamente con un novísimo compilador comercial. Nuestras técnicas de eliminación de redundancia están diseñadas para eliminar operaciones de memoria y de salto redundantes, que son las más importantes para mitigar los problemas de rendimiento que hemos mencionado. Estas propuestas están basadas en técnicas de eliminación de redundancia parcial sensibles al camino de ejecución. Los resultados muestran que aplicando nuestras optimizaciones, somos capaces de alcanzar una reducción del 14% en el tiempo de ejecución de nuestro conjunto de programas.
En este trabajo también revisamos el problemas del análisis de alias en programas ejecutables, identificando el por qué la desambiguación de memoria es uno de los puntos débiles en la modificación de código objeto. Proponemos varios análisis para ser aplicados en el contexto de optimizadores binarios. Primero un análisis de alias estricto para descubrir dependencias de memoria sensibles al camino de ejecución, el cual es usado en nuestras optimizaciones para la eliminación de redundancias de memoria.
Seguidamente, dos análisis especulativos de posibles alias para detección de independencias de memoria. Estos análisis están basados en introducir información especulativa en tiempo de análisis, lo que incrementa la precisión en partes importantes de código manteniendo el análisis eficiente. Los resultados muestran que nuestras propuestas son altamente útiles para incrementar la desambiguación de memoria de código binario, lo que se traduce en oportunidades para aplicar optimizaciones.
Todos nuestros algoritmos, tanto de análisis como de optimización, han sido implementados en un optimizador binario, enfatizando los problemas más relevantes en la aplicaciones de nuestros algoritmos en código ejecutable, sin la ayuda de gran parte de la información de alto nivel presente en compiladores tradicionales.
Two of the most important performance limiters in today's processor families comes from solving the memory wall and handling control dependencies. In order to address these issues, cache memories and branch predictors are well-known hardware proposals that take advantage of, among other things, exploiting both temporal memory reuse and branch correlation. In other words, they try to exploit the dynamic redundancy existing in programs. This redundancy comes partly from the way that programmers write source code, but also from limitations in the compilation model of traditional compilers, which introduces unnecessary memory and conditional branch instructions. We believe that today's optimizing compilers should be very aggressive in optimizing programs, and then they should be expected to optimize a significant part of this redundancy away.
On the other hand, optimizations performed at link-time or directly applied to final program executables have received increased attention in recent years, due to limitations in the traditional compilation model. First, even though performing sophisticated interprocedural analyses and transformations, traditional compilers do not have the opportunity to optimize the program as a whole. A similar problem arises when applying profile-directe compilation techniques: large projects will be forced to re-build every source file to take advantage of profile information. By contrast, it would be more convenient to build the full application, instrument it to obtain profile data and then re-optimize the final binary without recompiling a single source file.
In this thesis we present new profile-guided compiler optimizations for eliminating the redundancy encountered on executable programs at binary level (i.e.: binary redundancy), even though these programs have been compiled with full optimizations using a state-ofthe- art commercial compiler. In particular, our Binary Redundancy Elimination (BRE) techniques are targeted at eliminating both redundant memory operations and redundant conditional branches, which are the most important ones for addressing the performance issues that we mentioned above in today's microprocessors. These new proposals are mainly based on Partial Redundancy Elimination (PRE) techniques for eliminating partial redundancies in a path-sensitive fashion. Our results show that, by applying our optimizations, we are able to achieve a 14% execution time reduction in our benchmark suite.
In this work we also review the problem of alias analysis at the executable program level, identifying why memory disambiguation is one of the weak points of object code modification. We then propose several alias analyses to be applied in the context of linktime or executable code optimizers. First, we present a must-alias analysis to recognize memory dependencies in a path- sensitive fashion, which is used in our optimization for eliminating redundant memory operations. Next, we propose two speculative may-alias data-flow algorithms to recognize memory independencies. These may-alias analyses are based on introducing unsafe speculation at analysis time, which increases alias precision on important portions of code while keeping the analysis reasonably cost-efficient. Our results show that our analyses prove to be very useful for increasing memory disambiguation accuracy of binary code, which turns out into opportunities for applying optimizations.
All our algorithms, both for the analyses and the optimizations, have been implemented within a binary optimizer, which overcomes most of the existing limitations of traditional source-code compilers. Therefore, our work also points out the most relevant issues of applying our algorithms at the executable code level, since most of the high-level information available in traditional compilers is lost.
Krieger, Gordon S. F. "Connectionism, naturalized epistemology, and eliminative materialism." Thesis, McGill University, 1993. http://digitool.Library.McGill.CA:80/R/?func=dbin-jump-full&object_id=68112.
Full textI present a review of the connectionist approach to psychological models that contrasts it with the classical symbolic approach, focusing on the nature of their respective representations. While defending the legitimacy of the connectionist approach, I find that its most useful application is as a basis for neuroscientific investigation.
Discussing connectionist psychology, I find it inconsistent with folk psychology and therefore consistent with eliminative materialism. I argue also for the naturalization of epistemology and thus for the relevance of psychology for epistemology. The conclusion of the essay is an outline of connectionist epistemology, which centres around two mathematical analyses of the global activity of connectionist networks; I argue that connectionist psychology leads to a version of epistemic pragmatism.
Harkabus, Jenna. "Can Parental Work Eliminate Child Poverty?" Miami University Honors Theses / OhioLINK, 2010. http://rave.ohiolink.edu/etdc/view?acc_num=muhonors1272247536.
Full textKalmár, Róbert. "Optimalizace překladu agentních jazyků různé úrovně abstrakce." Master's thesis, Vysoké učení technické v Brně. Fakulta informačních technologií, 2012. http://www.nusl.cz/ntk/nusl-236560.
Full textŠácha, Marek. "Zhodnocení rizik v mezinárodním obchodování společnosti První Kompozitní s.r.o." Master's thesis, Vysoké učení technické v Brně. Ústav soudního inženýrství, 2016. http://www.nusl.cz/ntk/nusl-261291.
Full textVošická, Markéta. "Aplikace vybraného nástroje metody LEAN na příkladu mezinárodně působícího podniku." Master's thesis, Vysoká škola ekonomická v Praze, 2015. http://www.nusl.cz/ntk/nusl-264618.
Full textCai, Qiong Computer Science & Engineering Faculty of Engineering UNSW. "Profile-guided redundancy elimination." Awarded by:University of New South Wales. School of Computer Science and Engineering, 2006. http://handle.unsw.edu.au/1959.4/25156.
Full textBantegnie, Brice. "Eliminating propositional attitudes concepts." Thesis, Paris, Ecole normale supérieure, 2015. http://www.theses.fr/2015ENSU0020.
Full textIn this dissertation, I argue for the elimination of propositional attitudes concepts. In the first chapter I sketch the landscape of eliminativism in contemporary philosophy of mind and cognitive science. There are two kinds of eliminativism: eliminative materialism and concept eliminativism. One can further distinguish between folk and science eliminativism about concepts: whereas the former says that the concept should be eliminated from our folk theories, the latter says that the concept should be eliminated form our scientific theories. The eliminativism about propositional attitudes concepts I defend is a species of the latter. In the next three chapters I put forward three arguments for this thesis. I first argue that the interventionist theory of causation cannot lend credit to our claims of mental causation. I then support the thesis by showing that propositional attitudes concepts aren't natural kind concepts because they cross-cut the states of the modules posited by the thesis of massive modularity, a thesis which, I contend, is part of our best research-program. Finally, my third argument rests on science eliminativism about the concept of mental content. In the two last chapters of the dissertation I first defend the elimination of the concept of mental content from the success argument, according to which as psychologists produce successful science while using the concept of mental content, the concept should be conserved. Then, I dismiss an alternative way of eliminating the concept, that is, the way taken by proponents of extended cognition, by refuting what I take to be the best argument for extended cognition, namely, the system argument
Meyer, Peter, and Rasmus Åström. "Eliminating Variability Through Standardization." Thesis, Örebro universitet, Institutionen för naturvetenskap och teknik, 2016. http://urn.kb.se/resolve?urn=urn:nbn:se:oru:diva-51841.
Full textSyftet med det genomförda examensarbetet var att undersöka och analysera vilka effekter logistik och hantering haft på hållfastheten av lastningsbärare för att ta fram ett lösningsförslag på hur brott kan förebyggas. Från införda standarder och riktlinjer, presenterade i det här examensarbetet kan reklamationskostnader, ekologiska kostnader och skaderisker kraftigt minimeras. Processkartläggning och risk sökning, Arkiv- och litteraturstudier, Ishikawa- kartläggning, fallstudie och intervjuer genomfördes och användes för att få fram resultatet. Med de använda metoderna kunde två problemområden hittas och undersökas. Analysering av dessa problemområden ledde till en rekommendation om applicering av standardiserat arbete.
Herold, F. W., and J. A. Kaiser. "ELIMINATION OF SIDELOBE RESPONSE." International Foundation for Telemetering, 1998. http://hdl.handle.net/10150/607377.
Full textConventional phased arrays nominally sum the signals received by the elements prior to detection. By multiplying rather than summing signals received from pairs of elements, i.e., interferometer pairs, a set of Spatial Frequencies (SFs) is obtained. Obtaining the SFs requires employment of a multiple local oscillator technique. When summed, these spatial frequencies produce a single lobed (voltage) radiation pattern which, when passed through a biased detector, removes all sidelobes from the response at a small loss of desired signal power.
Šklíbová, Veronika. "Posouzení informačního systému firmy a návrh změn." Master's thesis, Vysoké učení technické v Brně. Ústav soudního inženýrství, 2015. http://www.nusl.cz/ntk/nusl-233130.
Full textNavrátil, Martin. "Hodnocení ekonomického rizika investičního projektu z pohledu investora." Master's thesis, Vysoké učení technické v Brně. Fakulta stavební, 2018. http://www.nusl.cz/ntk/nusl-372173.
Full textKrzyžanková, Šárka. "Vylučované položky v konsolidaci účetních závěrek při kapitálových akvizících a při přeměnách obchodních společností." Master's thesis, Vysoká škola ekonomická v Praze, 2009. http://www.nusl.cz/ntk/nusl-11385.
Full textSochor, Tomáš. "Eliminace úniků na DPH." Master's thesis, Česká zemědělská univerzita v Praze, 2017. http://www.nusl.cz/ntk/nusl-262939.
Full textJalůvková, Lenka. "Eliminace zkreslení obrazů duhovky." Master's thesis, Vysoké učení technické v Brně. Fakulta elektrotechniky a komunikačních technologií, 2014. http://www.nusl.cz/ntk/nusl-220862.
Full textNovotný, František. "Návrh eliminace prostojů elektroúdržby." Master's thesis, Vysoké učení technické v Brně. Fakulta podnikatelská, 2010. http://www.nusl.cz/ntk/nusl-222771.
Full textMacháčková, Kristýna. "Eliminace akrylamidu v potravinách." Master's thesis, Vysoké učení technické v Brně. Fakulta chemická, 2008. http://www.nusl.cz/ntk/nusl-216342.
Full textTunklová, Vendula. "Eliminace rizika transferových cen." Master's thesis, Vysoká škola ekonomická v Praze, 2008. http://www.nusl.cz/ntk/nusl-10513.
Full textRoddy, Kevin Martin. "Folk psychology, eliminative materialism and the intentional stance." Thesis, Queen's University Belfast, 1991. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.334639.
Full textWernhard, Christoph. "Automated deduction for projection elimination /." Heidelberg : AKA, 2009. http://opac.nebis.ch/cgi-bin/showAbstract.pl?u20=9783898383240.
Full textYang, Shuo. "Ammonia elimination from protonated nucleobases." Diss., Columbia, Mo. : University of Missouri-Columbia, 2007. http://hdl.handle.net/10355/4977.
Full textThe entire dissertation/thesis text is included in the research.pdf file; the official abstract appears in the short.pdf file (which also appears in the research.pdf); a non-technical general description, or public abstract, appears in the public.pdf file. Title from title screen of research.pdf file (viewed on May 27, 2009) Typescript. Includes bibliographical references.
Sankar, Arvind 1976. "Smoothed analysis of Gaussian elimination." Thesis, Massachusetts Institute of Technology, 2004. http://hdl.handle.net/1721.1/28311.
Full textIncludes bibliographical references (p. 59-60).
We present a smoothed analysis of Gaussian elimination, both with partial pivoting and without pivoting. Let A be any matrix and let A be a slight random perturbation of A. We prove that it is unlikely that A has large condition number. Using this result, we prove it is unlikely that A has large growth factor under Gaussian elimination without pivoting. By combining these results, we bound the smoothed precision needed to perform Gaussian elimination without pivoting. Our results improve the average-case analysis of Gaussian elimination without pivoting performed by Yeung and Chan (SIAM J. Matrix Anal. Appl., 1997). We then extend the result on the growth factor to the case of partial pivoting, and present the first analysis of partial pivoting that gives a sub-exponential bound on the growth factor. In particular, we show that if the random perturbation is Gaussian with variance [sigma]², then the growth factor is bounded by (n/[sigma])[to the power of] (o log n) with very high probability.
by Arvind Sankar.
Ph.D.
Schwartz, Jacob B. (Jacob Benjamin) 1975. "Eliminating intermediate lists in pH." Thesis, Massachusetts Institute of Technology, 2000. http://hdl.handle.net/1721.1/86511.
Full textIncludes bibliographical references (p. 89-92).
by Jacob B. Schwartz.
M.Eng.
Liu, Yanping. "Elimination de nanoparticules d'effluents liquides." Thesis, Toulouse, INSA, 2010. http://www.theses.fr/2010ISAT0030/document.
Full textThe objective of this work is to develop a technique for separating nanoparticles from liquid media. The literature has shown the potential hazard of nanoparticules and a large quantity of the nanosilica release has been entering in water resources. Tests flotation separations are carried out without additive, in the presence of AlCl3, CTAB, and trying to change the surface charge of the bubbles. These tests are not very conclusive. Flotation has been observed, but only when the additive has led to the formation of flocs which have themselves been floated. The results of tests with additives showed that the interaction between heterocoagulation (flotation) and homocoagulation is very important, leading to the study of coagulation under the effect of AlCl3 and CTAB. The results revealed complex mechanisms of coagulation, because the particle size plays an important role. For each observed phenomenon, a mechanism has been proposed, trying to link the observations to modeling mechanisms of aggregation. From the standpoint of the separation process, coagulation followed by sedimentation to separate the silica nanoparticles with remarkable efficiency (decrease of 99% of the turbidity)
Arnaudiès, Jean-Marie. "Elimination et theorie de galois." Toulouse 3, 1989. http://www.theses.fr/1989TOU30090.
Full textVizcaíno, Pedro Francisco Valencia. "Some uses of cut elimination." Thesis, University of Leeds, 2013. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.713880.
Full textBudd, Chris. "Data Protection and Data Elimination." International Foundation for Telemetering, 2015. http://hdl.handle.net/10150/596395.
Full textData security is becoming increasingly important in all areas of storage. The news services frequently have stories about lost or stolen storage devices and the panic it causes. Data security in an SSD usually involves two components: data protection and data elimination. Data protection includes passwords to protect against unauthorized access and encryption to protect against recovering data from the flash chips. Data elimination includes erasing the encryption key and erasing the flash. Telemetry applications frequently add requirements such as write protection, external erase triggers, and overwriting the flash after the erase. This presentation will review these data security features.
Choe, Chung. "The Outcomes of Policies Designed to Eliminate Discrimination." Diss., The University of Arizona, 2008. http://hdl.handle.net/10150/195490.
Full textMarková, Lucie. "Vliv přídavných látek na obsah akrylamidu v tepelně opracovaných potravinách." Master's thesis, Vysoké učení technické v Brně. Fakulta chemická, 2009. http://www.nusl.cz/ntk/nusl-216464.
Full textMarešová, Marcela. "Pokročilé úpravy obrazu pro aplikace rozpoznávání 2D obličeje." Master's thesis, Vysoké učení technické v Brně. Fakulta informačních technologií, 2010. http://www.nusl.cz/ntk/nusl-237238.
Full textNovotný, Jiří. "Eliminace zápachu na stokové síti." Master's thesis, Vysoké učení technické v Brně. Fakulta stavební, 2018. http://www.nusl.cz/ntk/nusl-372299.
Full textBruggeman, Karla E. "The effects of elimination and non-elimination games on physical activity and psychosocial responses in children." Thesis, Manhattan, Kan. : Kansas State University, 2008. http://hdl.handle.net/2097/747.
Full textLakhal, Anen [Verfasser]. "Elimination in Operator Algebras / Anen Lakhal." Kassel : Universitätsbibliothek Kassel, 2014. http://d-nb.info/1059428962/34.
Full textSchwöbel, Frank. "Execution and elimination of apoptotic cells." [S.l.] : [s.n.], 2002. http://deposit.ddb.de/cgi-bin/dokserv?idn=965885003.
Full textBell, Kathryn Emma. "Advances in the retro-Cope elimination." Thesis, University of Nottingham, 1996. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.307744.
Full textCleator, Edward. "Applications of the reverse Cope elimination." Thesis, University of Liverpool, 2001. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.250235.
Full textAmyes, T. L. "Mechanisms of carboxyl-activated elimination reactions." Thesis, University of Cambridge, 1986. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.383698.
Full textEmiris, Ioannis Z. "Sparse elimination and applications in kinematics /." Berkeley, CA US : Univ. of California at Berkeley, 1994. http://www-sop.inria.fr/saga/personnel/Ioannis.Emiris/index.html.
Full textIvashechkin, Pavel. "Elimination organischer Spurenstoffe aus kommunalem Abwasser." Aachen : Ges. zur Förderung der Siedlungswasserwirtschaft an der RWTH Aachen, 2006. http://bvbr.bib-bvb.de:8991/F?func=service&doc_library=BVB01&doc_number=015644505&line_number=0001&func_code=DB_RECORDS&service_type=MEDIA.
Full textAzouit, Rémi. "Elimination adiabatique pour systèmes quantiques ouverts." Thesis, Paris Sciences et Lettres (ComUE), 2017. http://www.theses.fr/2017PSLEM008/document.
Full textThis thesis addresses the model reduction problem for open quantum systems with differenttime-scales, also called adiabatic elimination. The objective is to derive a generic adiabaticelimination technique preserving the quantum structure for the reduced model.We consider an open quantum system, described by a Lindblad master equation withtwo time-scales, where the fast time-scale drives the system towards an equilibrium state.The cases of a unique steady state and a manifold of steady states (decoherence-free space)are considered. The slow dynamics is treated as a perturbation. Using the time-scaleseparation, we developed a new adiabatic elimination technique to derive at any orderthe reduced model describing the slow variables. The method, based on an asymptoticexpansion and geometric singular perturbation theory, ensures the physical interpretationof the reduced second-order model by giving the reduced dynamics in a Lindblad formand the mapping defining the slow manifold as a completely positive trace-preserving map(Kraus map) form. We give explicit second-order formulas, to compute the reduced model,for composite systems with weak - Hamiltonian or cascade - coupling between the twosubsystems and preliminary results on the third order. For systems with decoherence-freespace, explicit second order formulas are as well derived
LIMA, GUILHERME AUGUSTO FERREIRA. "ELIMINATING REDUNDANCIES FROM NCL EDTV PROFILE." PONTIFÍCIA UNIVERSIDADE CATÓLICA DO RIO DE JANEIRO, 2011. http://www.maxwell.vrac.puc-rio.br/Busca_etds.php?strSecao=resultado&nrSeq=18585@1.
Full textA implementação de uma máquina de apresentação NCL, ou formatador, e uma tarefa complexa. Essa complexidade decorre, principalmente, da distância semântica que existe entre os documentos NCL, especificações declarativas de alto-nível, e as API que o formatador utiliza para apresentá-los, em geral imperativas e de baixo-nível. Quanto maior a distância, maior a complexidade do mapeamento e, consequentemente, da sua implementação que tende a ser ineciente e não-confiável. Este trabalho apresenta um novo perfil para a linguagem NCL, chamado NCL Raw, que elimina as redundâncias do EDTV | o principal perfil da NCL 3.0 | e, de certa forma, aproxima os documentos da máquina. O perfil Raw captura apenas os conceitos essenciais do EDTV que por sua vez podem ser usados para simular a linguagem completa. Ou seja, podemos usar o Raw como uma linguagem intermediária mais simples para a qual documentos EDTV podem ser convertidos antes de serem apresentados. Esta dissertação discute as possíveis arquiteturas para conversores NCL e apresenta uma implementacão de um conversor de documentos (EDTV para Raw).
The implementation of a NCL presentation engine, or formatter, is a complex task. This complexity is mainly due to the semantic distance between NCL documents, high-level declarative specifications, and the API used by the formatter to present them, in most cases low-level and imperative. The greater the distance, the greater is the complexity of this mapping and, consequently, of its implementation, which is more likely to become ineficient and bug-prone. This work presents a new NCL profile, called NCL Raw, which eliminates most of the redundancies present in EDTV | the main profile of NCL 3.0 | and, in a certain way, reduces the distance between the documents and the machine. Raw profile captures only EDTV s essential concepts, which in turn can be used to simulate the whole language defined by EDTV itself. In other words, we can use the Raw profile as a simpler intermediate language to which EDTV documents can be converted before being presented. This dissertation discusses alternative architectures for NCL converters and presents the implementation of a document converter (from EDTV to Raw).
Palacios, B. Simón. "Estructura y defensa del materialismo eliminativo." Tesis, Universidad de Chile, 2008. http://repositorio.uchile.cl/handle/2250/109784.
Full textTeichmann, Fabian M. "Eliminating bribery - an incentive-based approach." Universität Leipzig, 2018. https://ul.qucosa.de/id/qucosa%3A32048.
Full textChambrin, Hélène. "Elimination des déchets d'activités de soins." Paris 5, 1994. http://www.theses.fr/1994PA05P123.
Full textHong, Hoon. "Improvements in CAD-based quantifier elimination /." The Ohio State University, 1990. http://rave.ohiolink.edu/etdc/view?acc_num=osu1487684245468432.
Full text