Dissertations / Theses on the topic 'Measures'
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 'Measures.'
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.
Moerters, Peter. "Tangent measure distributions and the geometry of measures." Thesis, University College London (University of London), 1995. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.307661.
Full textUyanik, Kivanc. "Entanglement Measures." Master's thesis, METU, 2008. http://etd.lib.metu.edu.tr/upload/12609292/index.pdf.
Full textOlsen, Lars. "Multifractal Measures." Thesis, University of North Texas, 1994. https://digital.library.unt.edu/ark:/67531/metadc279084/.
Full textSeguin, Troy. "Risk measures." Connect to online resource, 2008. http://gateway.proquest.com/openurl?url_ver=Z39.88-2004&rft_val_fmt=info:ofi/fmt:kev:mtx:dissertation&res_dat=xri:pqdiss&rft_dat=xri:pqdiss:3303861.
Full textHuang, Rong 1973. "Exploration of brand equity measures : linking customer mind-set measure to product-market performance measure." Thesis, McGill University, 2008. http://digitool.Library.McGill.CA:80/R/?func=dbin-jump-full&object_id=115606.
Full textTheoretical Framework: My main theoretical framework will be brand equity literature. I draw upon the Brand Value Chain framework (Keller & Lehmann, 2(03) to explore the conceptual differences between two types of brand equity measurements, namely customer mind-set and product-market performance measurements. Furthermore, I also use Keller's (1993) Customer-Based Brand Equity concept to explore how specific marketing activities impact the brand equity theoretically.
Data and Methodology: This thesis measures brand equity by two methods: customer mind-set (Keller, 1993) and revenue premium (Ailawadi, Lehmann, & Neslin, 2(03). I use two types of data in the empirical analyses. Survey data, procured from a consumer-packaged product company 1, is used to measure customer mind-set brand equity. This unique data consists of proprietary equity scan surveys on 11 brands from 2004 -- 2006 in the United States. The measurement model of brand equity is rooted in Keller's customer-based brand equity concept (1993). The measurements include brand awareness, brand performance, brand image, brand judgment, brand feelings and brand resonance (Keller, 2(01). The second data is from commercial sources, including IRI and TNS, for the specific brands and time periods corresponding to the survey data and includes revenue premium, price, sales, distribution, promotion, and advertising information. Various techniques are employed for analyses including descriptive and reliability analyses, correlation analyses, multiple-regression, and cross-validation.
Contribution: The contribution ofthis thesis is threefold. Firstly, it sheds light on the underlying theory and relationship between two types of brand equity measurements and provides empirical test of the theory. Secondly, it provides a systematic exploration of the impact of marketing mix elements on brand equity using real market data and two different measurements. Third, it offers very practical guidance for managers on how to choose a specific brand equity measures and how to track the brand equity measures over time for their brands.
1Because a confidential agreement with this company, the company name, brands name as well as product category will be disguised in the thesis.
Bausher, Christopher S. "Implementation and measures of effectiveness of travel demand management measures." Master's thesis, Virginia Tech, 1994. http://hdl.handle.net/10919/41847.
Full textMaster of Science
Paul, Philip Christopher. "Microelectronic security measures." Thesis, University of Cambridge, 2009. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.611689.
Full textMiallaret, Sophie. "Dynamic Monitoring Measures." Thesis, Université Clermont Auvergne (2017-2020), 2019. http://www.theses.fr/2019CLFAC091.
Full textThe measures are daily actions, they give us a lot of information and allow us to make decisions. The analysis of measures can allow us to learn more about our environment, but the error of a measure can have important consequences in certain areas. In a first part, we propose, thanks to the study of blood test measurements carried out at the CHU of Clermont-Ferrand, a procedure for detecting deviations from medical biology laboratory analyzers based on patient analysis measurements. After a descriptive analysis of the data, the method put in place, using methods of detection of breaks of time series, is tested for simulations of breaks representing offsets, imprecision or drifts of machine for different measured biological parameters. The method is adapted for two scenarios: when the patient's hospital service is known or not. The study is supplemented by an analysis of the impact of measurement uncertainty on patient analyses. In a second part we study measurements of volcanic ash forms made at “Laboratoire Magmas et Volcans” of the Clermont Auvergne University, in order to determine a link between the collection locations and the forms of the particles. After showing the dependence between these parameters, we propose, using a classification method, a grouping of particles representing different populations depending on the distance between the collection locations and the volcano crater
Bass, Jeremiah Joseph. "Mycielski-Regular Measures." Thesis, University of North Texas, 2011. https://digital.library.unt.edu/ark:/67531/metadc84171/.
Full textTchernychova, Maria. "Carathéodory cubature measures." Thesis, University of Oxford, 2015. https://ora.ox.ac.uk/objects/uuid:a3a10980-d35d-467b-b3c0-d10d2e491f2d.
Full textScquizzato, Gianmarco <1989>. "Systemic Risk Measures." Master's Degree Thesis, Università Ca' Foscari Venezia, 2017. http://hdl.handle.net/10579/9570.
Full textChmil, Shawn M. "Assessing five common measures of interobserver reliability, proposing new refined measures." Thesis, National Library of Canada = Bibliothèque nationale du Canada, 1998. http://www.collectionscanada.ca/obj/s4/f2/dsk2/tape15/PQDD_0011/MQ32911.pdf.
Full textBausher, Christopher S. "Implimentation [sic] and measures of effectiveness of travel demand management measures /." This resource online, 1994. http://scholar.lib.vt.edu/theses/available/etd-03302010-020412/.
Full textJoyce, Helen Janeith. "Packing measures, packing dimensions, and the existence of sets of positive finite measure." Thesis, University College London (University of London), 1995. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.307030.
Full textZhu, Sanguo. "Quantization for probability measures." [S.l.] : [s.n.], 2005. http://deposit.ddb.de/cgi-bin/dokserv?idn=979725658.
Full textEsteban, Ángeles Juan Luis. "Complexity measures for resolution." Doctoral thesis, Universitat Politècnica de Catalunya, 2003. http://hdl.handle.net/10803/6642.
Full textMejoramos separaciones de tamaño anteriores entre las versiones generales y arbóreas de Resolución y Planos Secantes. Para hacerlo, extendemos una cota inferior de tamaño para circuitos monótonos booleanos de Ran y McKenzie a circuitos monótonos reales. Este tipo de separaciones es interesante porque algunos demostradores automáticos se basan en la versión arbórea de sistemas de demostración, por tanto la separación indica que no es siempre una buena idea restringirnos a la versión arbórea.
Tras la reciente aparición de R(k), que es un sistema de demostración entre Resolución y Frege con profundidad acotada, era importante estudiar cuan potente es y su relación con otros sistemas de demostración. Resolvemos un problema abierto propuesto por Krajícek, concretamente mostramos que R(2) no tiene la propiedad de la interpolación monónota factible. Para hacerlo, mostramos que R(2) es estrictamente más potente que Resolución.
Una pregunta natural es averiguar si se pueden separar sucesivos niveles de R(k) o R(k) arbóreo. Mostramos separaciones exponenciales entre niveles sucesivos de lo que podemos llamar la jerarquía R(k) arbórea. Esto significa que hay formulas que requieren refutaciones de tamaño exponencial en R(k) arbóreo, pero tienen refutaciones de tamaño polinómico en R(k+1) arbóreo.
Propusimos una nueva definición de espacio para Resolución mejorando la anterior de Kleine-Büning y Lettmann. Dimos resultados generales sobre el espacio para Resolución y Resolución arbórea y también una caracterización combinatoria del espacio para Resolución arbórea usando un juego con dos adversarios para fórmulas en FNC. La caracterización permite demostrar cotas inferiores de espacio para la Resolución arbórea sin necesidad de usar el concepto de Resolución o Resolución arbórea. Durante mucho tiempo no se supo si el espacio para Resolución y Resolución arbórea coincidían o no. Hemos demostrado que no coinciden al haber dado la primera separación entre el espacio para Resolución y Resolución arbórea.
También hemos estudiado el espacio para R(k). Demostramos que al igual que pasaba con el tamaño, R(k) arbóreo también forma una jerarquía respecto al
espacio. Por tanto, hay fórmulas que necesitan espacio casi lineal en R(k) arbóreo mientras que tienen refutaciones en R(k+1) arbóreo con espacio contante. Extendemos todas las cotas inferiores de espacio para Resolución conocidas a R(k) de una forma sencilla y unificada, que también sirve para Resolución, usando el concepto de satisfactibilidad dinámica presentado en esta obra.
This work is a contribution to the field of Proof Complexity, which studies the complexity of proof systems in terms of the resources needed to prove or refute propositional formulas. Proof Complexity is an interesting field which has several connections to other fields of Computer Science like Computational Complexity or Automatic Theorem Proving among others. This work focuses in complexity measures for refutational proof systems for CNF formulas. We consider several proof systems, namely Resolution, R(k) and Cutting Planes and our results concern mainly to the size and space complexity measures.
We improve previous size separations between treelike and general versions of Resolution and Cutting Planes. To do so we extend a size lower bound for monotone boolean circuits by Raz and McKenzie, to monotone real circuits. This kind of separations is interesting because some automated theorem provers rely on the treelike version of proof systems, so the separations show that is not always a good idea to restrict to the treelike version.
After the recent apparition of R(k) which is a proof system lying between Resolution and bounded-depth Frege it was important to study how powerful it is and its relation with other proof systems. We solve an open problem posed by Krajícek, namely we show that R(2) does not have the feasible monotone interpolation property. To do so, we show that R(2) is strictly more powerful than Resolution.
A natural question is to find out whether we can separate successive levels of R(k) or treelike R(k). We show exponential separations between successive levels of what we can call now the treelike R(k) hierarchy. That means that there are formulas that require exponential size treelike R(k) refutations whereas they have polynomial size treelike R(k+1) refutations.
We have proposed a new definition for Resolution space improving a previous one from Kleine-Büning and Lettmann. We give general results for Resolution and treelike Resolution space and also a combinatorial characterization of treelike Resolution space via a Player-Adversary game over CNF formulas. The characterization allows to prove lower bounds for treelike Resolution space with no need to use the concept of Resolution or Resolution refutations at all. For a long time it was not known whether Resolution space and treelike Resolution space coincided or not. We have answered this question in the negative because we give the first space separation from Resolution to treelike Resolution.
We have also studied space for R(k). We show that, as happened with respect to size, treelike R(k) forms a hierarchy respect to space. So, there are formulas that require nearly linear space for treelike R(k) whereas they have constant space treelike R(k+1) refutations. We extend all known Resolution space lower bounds to R(k) in an easier and unified way, that also holds for Resolution, using the concept of dynamical satisfiability introduced in this work.
Leinonen, M. (Marko). "On various irrationality measures." Doctoral thesis, Oulun yliopisto, 2017. http://urn.fi/urn:isbn:9789526217031.
Full textTiivistelmä Tämä väitöskirja koostuu neljästä artikkelista, jotka kaikki käsittelevät irrationaalisuusmittoja. Ensimmäisessä artikkelissa irrationaalisuusmittoja johdetaan uudella tavalla irrationaalilukujen yksinkertaisista ketjumurtolukuesityksistä. Toisessa ja kolmannessa artikkelissa irrationaalisuusmitat konstruoidaan Padé-approksimaatioiden avulla. Toisessa artikkelissa saadaan eksplisiittinen irrationaalisuusmitta q-eksponenttisarjan arvoille, joiden vastaavat aikaisemmat irrationaalisuusmitat eivät ole näin eksplisiittisiä. Lisäksi samassa artikkelissa konstruoidaan q-eksponenttisarjan arvoille rajoitettu eksplisiittinen irrationaalisuusmitta, mikä parantaa aikaisempia tuloksia rajoitetussa tapauksessa. Kolmannessa artikkelissa johdetaan paras mahdollinen asymptoottinen irrationaalisuuseksponentti Jacobin kolmitulon arvoille. Viimeisessä artikkelissa käsitellään Cantorin sarjoja. Siinä yleistetään aikaisempia tuloksia johtamalla Sondowin irrationaalisuusmitta tietylle joukolle Cantorin sarjoja
Meijs, Wouter. "Probabilistic measures of coherence." [S.l. : Rotterdam : s.n.] ; Erasmus University [Host], 2005. http://hdl.handle.net/1765/6670.
Full textCrick, David Alan. "Measures of inexact diagnosability." Diss., Georgia Institute of Technology, 1990. http://hdl.handle.net/1853/9216.
Full textMatte, Robert. "Correlations and multifractal measures." Thesis, McGill University, 1992. http://digitool.Library.McGill.CA:80/R/?func=dbin-jump-full&object_id=56945.
Full textCheng, Chi-chung Vincent, and 鄭智聰. "Proactive infection control measures." Thesis, The University of Hong Kong (Pokfulam, Hong Kong), 2012. http://hub.hku.hk/bib/B48540596.
Full textpublished_or_final_version
Microbiology
Master
Doctor of Medicine
AGUIAR, JOSE LUIZ DO NASCIMENTO DE. "TIME SERIES SYMILARITY MEASURES." PONTIFÍCIA UNIVERSIDADE CATÓLICA DO RIO DE JANEIRO, 2016. http://www.maxwell.vrac.puc-rio.br/Busca_etds.php?strSecao=resultado&nrSeq=27789@1.
Full textCOORDENAÇÃO DE APERFEIÇOAMENTO DO PESSOAL DE ENSINO SUPERIOR
PROGRAMA DE EXCELENCIA ACADEMICA
Atualmente, uma tarefa muito importante na mineração de dados é compreender como extrair os dados mais informativos dentre um número muito grande de dados. Uma vez que todos os campos de conhecimento apresentam uma grande quantidade de dados que precisam ser reduzidas até as informações mais representativas, a abordagem das séries temporais é definitivamente um método muito forte para representar e extrair estas informações. No entanto nós precisamos ter uma ferramenta apropriada para inferir os dados mais significativos destas séries temporais, e para nos ajudar, podemos utilizar alguns métodos de medida de similaridade para saber o grau de igualdade entre duas séries temporais, e nesta pesquisa nós vamos realizar um estudo utilizando alguns métodos de similaridade baseados em medidas de distância e aplicar estes métodos em alguns algoritmos de clusterização para fazer uma avaliação de se existe uma combinação (método de similaridade baseado em distância / algoritmo de clusterização) que apresenta uma performance melhor em relação a todos os outros utilizados neste estudo, ou se existe um método de similaridade baseado em distância que mostra um desempenho melhor que os demais.
Nowadays a very important task in data mining is to understand how to collect the most informative data in a very amount of data. Once every single field of knowledge have lots of data to summarize in the most representative information, the time series approach is definitely a very strong way to represent and collect this information from it (12, 22). On other hand we need to have an appropriate tool to extract the most significant data from this time series. To help us we can use some similarity methods to know how similar is one time series from another In this work we will perform a research using some distance-based similarity methods and apply it in some clustering algorithms to do an assessment to see if there is a combination (distance-based similarity methods / clustering algorithm) that present a better performance in relation with all the others used in this work or if there exists one distancebased similarity method that shows a better performance between the others.
Soklakov, Andrei Nikolaevich. "Measures of dynamical complexity." Thesis, Royal Holloway, University of London, 2001. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.271547.
Full textDabrowski, Damian. "Rectifiability of Radon measures." Doctoral thesis, Universitat Autònoma de Barcelona, 2021. http://hdl.handle.net/10803/672535.
Full textEsta tesis está dedicada al estudio de medidas rectificables, rectificabilidad cuantitativa y, en menor grado, la acotación de operadores integrales singulares definidos respecto a medidas con crecimiento polinomial.
This thesis is dedicated to the study of rectifiable measures, quantitative rectifiability, and to a lesser degree, the boundedness of singular integral operators defined with respect to measures with polynomial growth.
Universitat Autònoma de Barcelona. Programa de Doctorat en Matemàtiques
Hoffman, Dieter. "Measures of financial development." Master's thesis, University of Cape Town, 2014. http://hdl.handle.net/11427/28973.
Full textLaubacher, Timothy Charles. "Physiological measures of presence." The Ohio State University, 2006. http://rave.ohiolink.edu/etdc/view?acc_num=osu1407237660.
Full textHaddad, Stephen. "Texture measures for segmentation." Master's thesis, University of Cape Town, 2007. http://hdl.handle.net/11427/7461.
Full textTexture is an important visual cue in both human and computer vision. Segmenting images into regions of constant texture is used in many applications. This work surveys a wide range of texture descriptors and segmentation methods to determine the state of the art in texture segmentation. Two types of texture descriptors are investigated: filter bank based methods and local descriptors. Filter banks deconstruct an image into several bands, each of which emphasises areas of the image with different properties. Textons are an adaptive histogram method which describes the distribution of typical feature vectors. Local descriptors calculate features from smaller neighbourhoods than filter banks. Some local descriptors calculate a scale for their local neighbourhood to achieve scale invariance. Both local and global segmentation methods are investigated. Local segmentation methods consider each pixel in isolation. Global segmentation methods penalise jagged borders or fragmented regions in the segmentation. Pixel labelling and border detection methods are investigated. Methods for measuring the accuracy of segmentation are discussed. Two data sets are used to test the texture segmentation algorithms. The Brodatz Album mosaics are composed of grayscale texture images from the Brodatz Album. The Berkeley Natural Images data set has 300 colour images of natural scenes. The tests show that, of the descriptors tested, filter bank based textons are the best texture descriptors for grayscale images. Local image patch textons are best for colour images. Graph cut segmentation is best for pixel labelling problems and edge detection with regular borders. Non-maxima suppression is best for edge detection with irregular borders. Factors affecting the performance of the algorithms are investigated.
Grannan, Benjamin. "Haar Measures for Groupoids." VCU Scholars Compass, 2009. http://scholarscompass.vcu.edu/etd/1738.
Full textBuchet, Mickaël. "Topological inference from measures." Thesis, Paris 11, 2014. http://www.theses.fr/2014PA112367/document.
Full textMassive amounts of data are now available for study. Asking questions that are both relevant and possible to answer is a difficult task. One can look for something different than the answer to a precise question. Topological data analysis looks for structure in point cloud data, which can be informative by itself but can also provide directions for further questioning. A common challenge faced in this area is the choice of the right scale at which to process the data.One widely used tool in this domain is persistent homology. By processing the data at all scales, it does not rely on a particular choice of scale. Moreover, its stability properties provide a natural way to go from discrete data to an underlying continuous structure. Finally, it can be combined with other tools, like the distance to a measure, which allows to handle noise that are unbounded. The main caveat of this approach is its high complexity.In this thesis, we will introduce topological data analysis and persistent homology, then show how to use approximation to reduce the computational complexity. We provide an approximation scheme to the distance to a measure and a sparsifying method of weighted Vietoris-Rips complexes in order to approximate persistence diagrams with practical complexity. We detail the specific properties of these constructions.Persistent homology was previously shown to be of use for scalar field analysis. We provide a way to combine it with the distance to a measure in order to handle a wider class of noise, especially data with unbounded errors. Finally, we discuss interesting opportunities opened by these results to study data where parts are missing or erroneous
Reshef, David N. "On measures of dependence." Thesis, University of Oxford, 2011. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.711631.
Full textLove, Randall James. "Predictive software design measures." Thesis, This resource online, 1994. http://scholar.lib.vt.edu/theses/available/etd-06112009-063248/.
Full textMcNiel, Patrick D. "Implicit and explicit measures." Thesis, Atlanta, Ga. : Georgia Institute of Technology, 2009. http://hdl.handle.net/1853/28132.
Full textFagelson, Marc A. "Psychoacoustic Measures of Tinnitus." Digital Commons @ East Tennessee State University, 2005. https://dc.etsu.edu/etsu-works/1620.
Full textPenner, Irina. "Dynamic convex risk measures." Doctoral thesis, Humboldt-Universität zu Berlin, Mathematisch-Naturwissenschaftliche Fakultät II, 2008. http://dx.doi.org/10.18452/15745.
Full textIn this thesis we study various properties of a dynamic convex risk measure for bounded random variables. The main subject is to investigate possible interdependence of conditional risk assessments at different times and the manifestation of these time consistency properties in the dynamics of corresponding penalty functions and risk processes. In Chapter 2 we focus first on the strong notion of time consistency and characterize it in terms of penalty functions, acceptance sets and a joint supermartingale property of the risk measure and its penalty function. The characterization in terms of penalty functions provides the explicit form of the Doob and of the Riesz decomposition of the penalty function process for a time consistent risk measure. Then we introduce and study a weaker notion of time consistency, that we call prudence. Similar to the time consistent case, we characterize prudent dynamic risk measures in terms of acceptance sets, of penalty functions and by a certain supermartingale property. This supermartingale property holds more generally for any bounded adapted process that can be upheld without any additional risk. We call such processes sustainable, and we give an equivalent characterization of sustainability in terms of a combined supermartingale property of a process and one-step penalty functions. This result can be viewed as a generalized optimal decomposition under convex constraints. The supermartingale property allows us to characterize the strongly time consistent risk measure arising from any dynamic risk measure via recursive construction as the smallest process that is sustainable and covers the final loss. Thus our discussion provides a new reason for using strongly time consistent risk measures. In Chapter 3 we discuss the limit behavior of time consistent and of prudent risk measures in terms of asymptotic safety and of asymptotic precision. In the final Chapter 4 we illustrate the general results of Chapter 2 and Chapter 3 by examples. In particular we study the entropic dynamic risk measure and the superhedging price process under convex constraints.
Gonzalez, Shannon M. "Biological Indicators of Wetland Health: Comparing Qualitative and Quantitative Vegetation Measures with Anuran Measures." Scholar Commons, 2004. https://scholarcommons.usf.edu/etd/1049.
Full textMak, Hoi-yan Jennifer. "Quantitative measures of supraglottic activity." Click to view the E-thesis via HKUTO, 2002. http://sunzi.lib.hku.hk/hkuto/record/B36208401.
Full text"A dissertation submitted in partial fulfilment of the requirements for the Bachelor of Science (Speech and Hearing Sciences), The University of Hong Kong, May 10, 2002." Also available in print.
Eksi, Zehra. "Comparative Study Of Risk Measures." Master's thesis, METU, 2005. http://etd.lib.metu.edu.tr/upload/12606501/index.pdf.
Full textYONEKAWA, YOSHIHARU. "TECHNICAL PREVENTIVE MEASURES IN JAPAN." Nagoya University School of Medicine, 1994. http://hdl.handle.net/2237/16070.
Full textKalmus, Ellis. "Forensic measures of sexual interest." Thesis, University of Birmingham, 2003. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.397547.
Full textBahsoun, Wael. "Invariant measures for inner functions." Thesis, National Library of Canada = Bibliothèque nationale du Canada, 2000. http://www.collectionscanada.ca/obj/s4/f2/dsk2/ftp01/MQ47799.pdf.
Full textRomanyshyn, Nicholas. "Automatic measures of oral reading." Connect to online resource, 2007. http://gateway.proquest.com/openurl?url_ver=Z39.88-2004&rft_val_fmt=info:ofi/fmt:kev:mtx:dissertation&res_dat=xri:pqdiss&rft_dat=xri:pqdiss:1442919.
Full textSmith, Kyla M. "Field measures of refractive error /." Adobe Acrobat Reader required to view document, 2008. http://library.neco.edu/theses/SmithThesisMay08.pdf.
Full textEnflo, Karin. "Measures of Freedom of Choice." Doctoral thesis, Uppsala universitet, Avdelningen för praktisk filosofi, 2012. http://urn.kb.se/resolve?urn=urn:nbn:se:uu:diva-179078.
Full textQuackenbush, Schuyler Reynier. "Objective measures of speech quality." Diss., Georgia Institute of Technology, 1995. http://hdl.handle.net/1853/13376.
Full textKing, James F. "Dimension characteristics for invariant measures." Diss., Georgia Institute of Technology, 1991. http://hdl.handle.net/1853/28788.
Full textPearce, Nathalie. "Measures of the supervisory relationship." Thesis, University of Oxford, 2010. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.531937.
Full textSousa, SeÌrgio Dinis Teixeira de. "Quality improvement measures in SMEs." Thesis, University of Birmingham, 2005. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.422289.
Full textGreenwood, Dona. "Measures of malnutrition in England." Thesis, University of Surrey, 1998. http://epubs.surrey.ac.uk/804888/.
Full textTwyman, Matthew Shaun. "Metacognitive measures of implicit knowledge." Thesis, University of Sussex, 2001. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.390629.
Full textPorter, Gillian. "Pupillometric measures of visual cognition." Thesis, University of Bristol, 2004. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.402313.
Full text