Dissertations / Theses on the topic 'Restrictor'
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 'Restrictor.'
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.
Bednář, Martin. "Automatické testování projektu JavaScript Restrictor." Master's thesis, Vysoké učení technické v Brně. Fakulta informačních technologií, 2020. http://www.nusl.cz/ntk/nusl-432879.
Full textDollhopf, Matthew John. "NASCAR RESTRICTOR PLATE EXHAUST MANIFOLD DESIGN STRATEGIES." Master's thesis, University of Central Florida, 2004. http://digital.library.ucf.edu/cdm/ref/collection/ETD/id/4456.
Full textM.S.
Department of Industrial Engineering and Management Systems
Engineering and Computer Science
Industrial Engineering and Management Systems
Tao, Fuyang. "Experimental study of restrictor noise in ventilation duct systems." Thesis, University of Southampton, 2016. https://eprints.soton.ac.uk/398630/.
Full textLindley, Dustin. "Design and Optimization of a Throttle and Restrictor for Formula SAE." University of Cincinnati / OhioLINK, 2012. http://rave.ohiolink.edu/etdc/view?acc_num=ucin1346171359.
Full textŠvancár, Matúš. "Přenos bezpečnostních opatření z prohlížeče Brave do rozšíření JavaScript Restrictor." Master's thesis, Vysoké učení technické v Brně. Fakulta informačních technologií, 2021. http://www.nusl.cz/ntk/nusl-445495.
Full textStone, Mark Adam. "Improving Off-line and On-line Supercritical Fluid Extraction Techniques by Elevating the Post-Restrictor Pressure." Diss., Virginia Tech, 2001. http://hdl.handle.net/10919/26623.
Full textPh. D.
Chládek, Martin. "Výroba jezdce." Master's thesis, Vysoké učení technické v Brně. Fakulta strojního inženýrství, 2013. http://www.nusl.cz/ntk/nusl-230449.
Full textŘehák, Ivo. "Návrh sacího traktu pro vůz Formule SAE." Master's thesis, Vysoké učení technické v Brně. Fakulta strojního inženýrství, 2008. http://www.nusl.cz/ntk/nusl-228026.
Full textPavličík, Lukáš. "Sací potrubí jednoválcového motoru." Master's thesis, Vysoké učení technické v Brně. Fakulta strojního inženýrství, 2014. http://www.nusl.cz/ntk/nusl-231694.
Full textAdámek, Ladislav. "Zvýšení pružnosti zážehového jednoválcového motoru formule Student." Master's thesis, Vysoké učení technické v Brně. Fakulta strojního inženýrství, 2011. http://www.nusl.cz/ntk/nusl-229714.
Full textHuber, Hillary. "Aggressive Behavioral Phenotype in Intrauterine Growth Restricted (IUGR) Baboons Exposed to Moderate Nutrient Restriction Early in Development." OpenSIUC, 2014. https://opensiuc.lib.siu.edu/dissertations/824.
Full textTimko, Martin. "Vylepšení rozšíření pro omezení volání JavaScriptu." Master's thesis, Vysoké učení technické v Brně. Fakulta informačních technologií, 2019. http://www.nusl.cz/ntk/nusl-403180.
Full textPohner, Pavel. "Detekce podezřelých síťových požadavků webových stránek." Master's thesis, Vysoké učení technické v Brně. Fakulta informačních technologií, 2020. http://www.nusl.cz/ntk/nusl-417225.
Full textSaloň, Marek. "Detekce metod zjišťujících otisk prohlížeče." Master's thesis, Vysoké učení technické v Brně. Fakulta informačních technologií, 2021. http://www.nusl.cz/ntk/nusl-445521.
Full textHind, Hugh Robert Faulkner. "Restricted edge-colourings." Thesis, University of Cambridge, 1988. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.279728.
Full textMay, Barnaby C. H. "Conformationally restricted peptidomimetics." Thesis, University of Canterbury. Chemistry, 2000. http://hdl.handle.net/10092/6083.
Full textli, sijia. "Perfection and Restriction." Thesis, Konstfack, Ädellab, 2020. http://urn.kb.se/resolve?urn=urn:nbn:se:konstfack:diva-7224.
Full textPagin, Peter. "Vagueness and Domain Restriction." Stockholms universitet, Filosofiska institutionen, 2011. http://urn.kb.se/resolve?urn=urn:nbn:se:su:diva-68416.
Full textAuthor count: 1;
Vagueness and Context Factors
Fürst, Maximilian [Verfasser]. "Restricted matchings / Maximilian Fürst." Ulm : Universität Ulm, 2019. http://d-nb.info/1190178249/34.
Full textDaniels, Lucy Elizabeth. "The SgrAI restriction endonuclease." Thesis, University of Bristol, 2002. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.393877.
Full textRamsey, Priscilla W., J. Cathelyn, B. Gugliotta, and L. Lee Glenn. "Restricted Versus Open ICUs." Digital Commons @ East Tennessee State University, 2000. https://dc.etsu.edu/etsu-works/7529.
Full textLewis, John Robert. "Bayesian Restricted Likelihood Methods." The Ohio State University, 2014. http://rave.ohiolink.edu/etdc/view?acc_num=osu1407505392.
Full textPersson, Johan. "Restricted Region Exact Designs." Thesis, Linköpings universitet, Matematiska institutionen, 2017. http://urn.kb.se/resolve?urn=urn:nbn:se:liu:diva-138614.
Full textFrågeställning: D-optimala designer är vanliga i kliniska studier. När flera faktorer (läkemedel) prövas samtidigt kan det vara nödvändigt att begränsa försöksrummet så att patienterna undviker att få en hög dos av flera faktorer samtidigt. I sådana begränsade försöksrum är det okänt vilka designer som är D-optimala. Uppsatsens mål har varit att hitta D-optimala designer i begränsade försöksrum. Metod: Två nya algoritmer för att hitta D-optimala designer med en, två eller tre dimensioner och linjära modeller har utvecklats och implementerats i MATLAB. Två begränsade försöksrum har utforskats. I de fall då MATLAB-programmet inte kunde hitta de D-optimala designerna användes analytiska metoder. Resultat: Analys av en tvåfaktormodell med interaktion utforskades särskilt noggrant. Alla D-optimala designer och permutationer av dessa i de båda begränsade försöksrummen har listats för alla N mindre än eller lika med 30, samt även deras kontinuerliga designer. Slutsats: För det ena försöksrummet upptäcktes ett mönster i designen då N är större än eller lika med 7. I det andra försöksrummet upptäcktes inget mönster och det krävdes således analytiska metoder för att finna dess kontinuerliga design. Det visade sig att antalet försök i den lägsta doskombinationen förblev oförändrat då man bytte från det fulla designrummet till de båda begränsade designrummen.
Brass, Stefan. "Range restriction for general formulas." Universität Potsdam, 2010. http://opus.kobv.de/ubp/volltexte/2010/4152/.
Full textSollazzo, Rhoda Jane. "The finite field restriction problem." Thesis, University of British Columbia, 2011. http://hdl.handle.net/2429/36900.
Full textTurner, Hazel L. "Stereocontrol in rotationally restricted ureas." Thesis, University of Manchester, 2008. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.505382.
Full textSapsed, Jonathan. "Restricted vision : strategizing under uncertainty." Thesis, University of Sussex, 1999. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.313942.
Full textFasulo, Daniel. "Algorithms for DNA restriction mapping /." Thesis, Connect to this title online; UW restricted, 2000. http://hdl.handle.net/1773/7020.
Full textWilstermann, Michael. "Synthesis of conformationally restricted oligosaccharides." Lund : Dept. of Organic Chemistry 2, Lund University, 1997. http://catalog.hathitrust.org/api/volumes/oclc/39751534.html.
Full textAlakuijala, A. (Anna). "Branding in temporally restricted campaigns." Master's thesis, University of Oulu, 2014. http://urn.fi/URN:NBN:fi:oulu-201406101710.
Full textWang, Hong Ph D. Massachusetts Institute of Technology Department of Mathematics. "A restriction estimate in R³." Thesis, Massachusetts Institute of Technology, 2019. https://hdl.handle.net/1721.1/122176.
Full textCataloged from PDF version of thesis.
Includes bibliographical references (page 87).
In this thesis, I proved a restriction estimate for paraboloid in R³ based on the polynomial partitioning method introduced by Larry Guth and the "two ends argument" introduced by Wolff and Tao.
by Hong Wang.
Ph. D.
Ph.D. Massachusetts Institute of Technology, Department of Mathematics
Svoboda, Jiří. "Multi-modální "Restricted Boltzmann Machines"." Master's thesis, Vysoké učení technické v Brně. Fakulta informačních technologií, 2013. http://www.nusl.cz/ntk/nusl-236426.
Full textHambrook, Kyle David. "Restriction theorems and Salem sets." Thesis, University of British Columbia, 2015. http://hdl.handle.net/2429/54044.
Full textScience, Faculty of
Mathematics, Department of
Graduate
Althorpe, Nicola Jayne. "Plasmid-mediated restriction evasion mechanisms." Thesis, University of Leicester, 1999. http://hdl.handle.net/2381/30313.
Full textMair, William. "Dietary restriction in Drosophila melanogaster." Thesis, University College London (University of London), 2005. http://discovery.ucl.ac.uk/1445680/.
Full textMiller, Christopher B. "Sleep restriction therapy : experimental studies." Thesis, University of Glasgow, 2014. http://theses.gla.ac.uk/5760/.
Full textMugodo, James, and n/a. "Plant species rarity and data restriction influence the prediction success of species distribution models." University of Canberra. Resource, Environmental & Heritage Sciences, 2002. http://erl.canberra.edu.au./public/adt-AUC20050530.112801.
Full textdeVries, Tiffany Dawn. "Neural Activation in Blood-Flow-Restricted Versus Non-Blood-Flow-Restricted Exercise: An fMRI Study." BYU ScholarsArchive, 2016. https://scholarsarchive.byu.edu/etd/5878.
Full textGomes, Josà Weligton FÃlix. "General equilibrium model for computable policy analysis fiscal agent heterogeneous restricted and non restricted credit." Universidade Federal do CearÃ, 2012. http://www.teses.ufc.br/tde_busca/arquivo.php?codArquivo=9873.
Full textThis research aims to develop a computable general equilibrium model with heterogeneous agents restricted (p-type) and not restricted to credit (q-type) for policy analysis. We used data from the National Accounts (IBGE), PNAD (2009), IPEADATA, to calibrate the model according to the Brazilian economy in 2009. According to the model 11:31% of agents (p-type) generate 0:65% of the total income and are responsible for paying 0:66% of the total tax burden. While other agents (q-type) generate 99:35% of income accounting for 99:34% of the payment of the tax burden. In terms of importance of sources of income, while for p-type income transfers correspond to 55% of labor income for agents of q-type these account for only 16%, which leads to dierent choices of work and leisure between these two types of agents.
O presente trabalho tem como objetivo desenvolver um modelo de equilbrio geral comput avel com agentes heterog^eneos restritos (tipo p) e n~ao restritos ao credito (tipo q) para ns de analise de poltica. Utilizou-se dados das Contas Nacionais (IBGE), PNAD (2009), IPEADATA, para calibrar o modelo segundo a economia brasileira no ano de 2009. De acordo com o modelo, 11; 31% dos agentes (tipo p) geram 0; 65% do total da renda e s~ao responsaveis por pagar 0; 66% da carga total tributaria. Enquanto que os demais agentes (tipo q) geram 99; 35% da renda sendo responsaveis por 99; 34% do pagamento da carga tributaria. Em termos de import^ancia das fontes de rendimentos, enquanto para o tipo p rendas de transfer^encias correspondem a 55% da renda do trabalho, para agentes do tipo q estas correspondem a apenas 16%, o que provoca escolhas distintas de trabalho e lazer entre esses dois tipos de agentes.
Doronina, Victoria Alexandrovna. "The mechanism of regulation of the restriction activity of the EcoKI, a type I restriction enzyme." Thesis, University of Edinburgh, 2001. http://hdl.handle.net/1842/10881.
Full textSaïda, Fakhri. "Etude de l'endoribonucléase de restriction RegB." Phd thesis, Ecole Polytechnique X, 2003. http://pastel.archives-ouvertes.fr/pastel-00000707.
Full textZhou, Da Sheng. "Eigenvalues statistics for restricted trace ensembles." Thesis, University of Macau, 2010. http://umaclib3.umac.mo/record=b2182958.
Full textWalls, Barrett Hamilton. "Coloring girth restricted graphs on surfaces." Diss., Georgia Institute of Technology, 1999. http://hdl.handle.net/1853/28939.
Full textLam, Bee K. "Restricted spanning trees and graph partitioning." Curtin University of Technology, School of Mathematics and Statistics, 1999. http://espace.library.curtin.edu.au:80/R/?func=dbin-jump-full&object_id=10306.
Full textAnalysis of both exact and heuristic methods is given. The second part of Chapter 2 provides a survey of the Graph Partitioning problem. We discuss the many different approaches that have been proposed to solve this problem. The quality of computational results achieved is discussed.Chapter 3 considers the Degree Constraint Minimum Weight Spanning Tree problem. This problem arises in networks where a given terminal is only allowed connections to a maximum number of specified terminals. We consider a number of cases including: same degree constraint on each vertex; different degree constraint on some vertices; and when the degree constraint is only on one or two vertices. A number of heuristics are developed and implemented and compared against an exact Branch and Cut algorithm. Our computational results demonstrated the value of our better performing heuristics.Chapter 4 considers the complexity of the (1,k)-tree problem. This problem is defined m given a graph G with maximum degree k find a spanning tree T with all vertices having degree 1 or k. Analysis is done on graphs with maximum degree 3, 4 and 5. Results establishing that the (1,3)-tree and (1, 4)-tree problems are NP-complete are presented. Further consideration is also given to the complexity of spanning trees with degree from the set { 1, 3, 5}. Analysis is also carried out on the number of degree one vertices in the (1, k)-tree. Presentation of heuristic procedures to solve this NP-complete problem concludes the chapter.Chapter 5 is devoted to the Graph Partitioning problem. A number of heuristics are presented and extensive computational work carried out. Computational findings support the usefulness of the heuristic methods both in terms of quality and time.We conclude this thesis by detailing some future work that can be carried out.
Johnston, Robert S. "Modeling the effects of restricted randomization." Thesis, National Library of Canada = Bibliothèque nationale du Canada, 1998. http://www.collectionscanada.ca/obj/s4/f2/dsk2/tape15/PQDD_0003/NQ31993.pdf.
Full textHadjifaradji, Saeed. "Learning algorithms for restricted neural networks." Thesis, National Library of Canada = Bibliothèque nationale du Canada, 2000. http://www.collectionscanada.ca/obj/s4/f2/dsk1/tape3/PQDD_0016/NQ48102.pdf.
Full textLiakhovitch, Evgueni. "Genetic algorithm using restricted sequence alignments." Ohio : Ohio University, 2000. http://www.ohiolink.edu/etd/view.cgi?ohiou1172598174.
Full textPapadimitropoulos, Christos. "Fourier restriction phenomenon in thin sets." Thesis, University of Edinburgh, 2010. http://hdl.handle.net/1842/4625.
Full textChen, Z. "Passive network synthesis of restricted complexity." Thesis, University of Cambridge, 2007. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.597545.
Full textBah, Bubacarr. "Restricted isometry constants in compressed sensing." Thesis, University of Edinburgh, 2012. http://hdl.handle.net/1842/7642.
Full text