Thèses sur le sujet « SPARS »
Créez une référence correcte selon les styles APA, MLA, Chicago, Harvard et plusieurs autres
Consultez les 50 meilleures thèses pour votre recherche sur le sujet « SPARS ».
À côté de chaque source dans la liste de références il y a un bouton « Ajouter à la bibliographie ». Cliquez sur ce bouton, et nous générerons automatiquement la référence bibliographique pour la source choisie selon votre style de citation préféré : APA, MLA, Harvard, Vancouver, Chicago, etc.
Vous pouvez aussi télécharger le texte intégral de la publication scolaire au format pdf et consulter son résumé en ligne lorsque ces informations sont inclues dans les métadonnées.
Parcourez les thèses sur diverses disciplines et organisez correctement votre bibliographie.
Rashid, Adnan. « Investigation of through-thickness assembly stresses in composite wing spars ». Thesis, University of Bristol, 2007. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.722699.
Texte intégralMehler, Felix Eckhart. « The structural testing and modification of a full-scale ornithopter's wing spars ». Thesis, National Library of Canada = Bibliothèque nationale du Canada, 1997. http://www.collectionscanada.ca/obj/s4/f2/dsk2/ftp04/mq29368.pdf.
Texte intégralBlondeau, Julie E. « Development and testing of a variable aspect ratio wing using pneumatic telescopic spars ». College Park, Md. : University of Maryland, 2004. http://hdl.handle.net/1903/1761.
Texte intégralThesis research directed by: Dept. of Aerospace Engineering. Title from t.p. of PDF. Includes bibliographical references. Published by UMI Dissertation Services, Ann Arbor, Mich. Also available in paper.
De, Shuvodeep. « Structural Modeling and Optimization of Aircraft Wings having Curvilinear Spars and Ribs (SpaRibs) ». Diss., Virginia Tech, 2017. http://hdl.handle.net/10919/88467.
Texte intégralPHD
Carlowitz, Christian, Thomas Girg, Hatem Ghaleb et Xuan-Quang Du. « Efficient Ultra-High Speed Communication with Simultaneous Phase and Amplitude Regenerative Sampling (SPARS) ». De Gruyter, 2017. https://tud.qucosa.de/id/qucosa%3A38596.
Texte intégralWynn, Milton E. « Spare parts nonavailability : the identification of impediments to spares acquisition ». Thesis, Monterey, California. Naval Postgraduate School, 1992. http://hdl.handle.net/10945/24042.
Texte intégralSohaib, Muhammad. « Parameterized Automated Generic Model for Aircraft Wing Structural Design and Mesh Generation for Finite Element Analysis ». Thesis, Linköpings universitet, Maskinkonstruktion, 2011. http://urn.kb.se/resolve?urn=urn:nbn:se:liu:diva-71264.
Texte intégralCox-Richard, Lillian. « Spark Gap ». VCU Scholars Compass, 2008. http://scholarscompass.vcu.edu/etd/698.
Texte intégralLustig, Michael. « Sparse MRI / ». May be available electronically:, 2008. http://proquest.umi.com/login?COPT=REJTPTU1MTUmSU5UPTAmVkVSPTI=&clientId=12498.
Texte intégralLowas, Albert Frank III. « Improved Spare Part Forecasting for Low Quantity Parts with Low and Increasing Failure Rates ». Wright State University / OhioLINK, 2015. http://rave.ohiolink.edu/etdc/view?acc_num=wright1432380369.
Texte intégralRamachandran, Shridhar. « Incremental PageRank acceleration using Sparse Matrix-Sparse Vector Multiplication ». The Ohio State University, 2016. http://rave.ohiolink.edu/etdc/view?acc_num=osu1462894358.
Texte intégralSphar, Shannah R. « Participant training and its effect on actual retrospective timeframes ». View electronic thesis, 2008. http://dl.uncw.edu/etd/2008-2/sphars/shannahsphar.pdf.
Texte intégralSummers, Andrew John. « SPAARS evidence ? : an empirical investigation into SPAARS applied to PTSD ». Thesis, University of Edinburgh, 2003. http://hdl.handle.net/1842/27487.
Texte intégralMonastyrsky, G. E., P. Ochin, A. V. Gilchuk et V. I. Kolomytsev. « Spark plasma sintering the spark-erosion powders of functional alloys ». Thesis, Sumy State University, 2011. http://essuir.sumdu.edu.ua/handle/123456789/20798.
Texte intégralBoeckx, W. D. « Recycling spare parts ». Maastricht : Maastricht : Maastricht University ; University Library, Maastricht University [Host], 1999. http://arno.unimaas.nl/show.cgi?fid=13042.
Texte intégralKalk, Jonathan W. « Sparse ordinary graphs ». Thesis, University of Hawaii at Manoa, 2005. http://hdl.handle.net/10125/25937.
Texte intégralvii, 65 leaves, bound ; 29 cm.
Thesis (Ph. D.)--University of Hawaii at Manoa, 2005.
Samandari, Farshid. « Sparks of Union ». Thesis, University of British Columbia, 2014. http://hdl.handle.net/2429/46483.
Texte intégralWillcocks, Christopher George. « Sparse volumetric deformation ». Thesis, Durham University, 2013. http://etheses.dur.ac.uk/8471/.
Texte intégralKim, Kwanghoon. « Infrared luminescence from spark-processed silicon and erbium-doped spark-processed silicon ». [Gainesville, Fla.] : University of Florida, 2005. http://purl.fcla.edu/fcla/etd/UFE0012860.
Texte intégralSchafmeister, Frank. « Indirekte Sparse-Matrix Konverter / ». Zürich : ETH, 2008. http://e-collection.ethbib.ethz.ch/show?type=diss&nr=17428.
Texte intégralWalls, Kate. « Muriel Spark and Catholicism ». Thesis, Queen's University Belfast, 2014. https://pure.qub.ac.uk/portal/en/theses/muriel-spark-and-catholicism(2d16b200-588b-4866-a1d6-dea6396b68cb).html.
Texte intégralDenil, Misha. « Recklessly approximate sparse coding ». Thesis, University of British Columbia, 2012. http://hdl.handle.net/2429/43662.
Texte intégralMahajan, Rohan. « Adaptive scheduling in Spark ». Thesis, Massachusetts Institute of Technology, 2016. http://hdl.handle.net/1721.1/105977.
Texte intégralThis electronic version was submitted by the student author. The certified thesis is available in the Institute Archives and Special Collections.
Cataloged from student-submitted PDF version of thesis.
Includes bibliographical references (page 33).
Because most data processing systems are distributed in nature, data must be transferred between machines. Currently, Spark, a prominent such system, predetermines the strategies for shuffling this data, but in certain situations, different shuffle strategies would improve performance. We add functionality to track metrics about the data during the job and appropriately adapt the shuffle strategy. We show improvements in ShuffledRDD performance, joins using Spark's RDD interface, and joins in Spark SQL.
by Rohan Mahajan.
M. Eng.
Chen, George H. « Deformation-invariant sparse coding ». Thesis, Massachusetts Institute of Technology, 2012. http://hdl.handle.net/1721.1/75709.
Texte intégralCataloged from PDF version of thesis.
Includes bibliographical references (p. 87-91).
Sparse coding represents input signals each as a sparse linear combination of a set of basis or dictionary elements where sparsity encourages representing each input signal with a few of the most indicative dictionary elements. In this thesis, we extend sparse coding to allow dictionary elements to undergo deformations, resulting in a general probabilistic model and accompanying inference algorithm for estimating sparse linear combination weights, dictionary elements, and deformations. We apply our proposed method on functional magnetic resonance imaging (fMRI) data, where the locations of functional regions in the brain evoked by a specific cognitive task may vary across individuals relative to anatomy. For a language fMRI study, our method identifies activation regions that agree with known literature on language processing. Furthermore, the deformations learned by our inference algorithm produce more robust group-level effects than anatomical alignment alone.
by George H. Chen.
S.M.
Will, Sebastian, et Hosna Jabbari. « Sparse RNA folding revisited ». Universitätsbibliothek Leipzig, 2016. http://nbn-resolving.de/urn:nbn:de:bsz:15-qucosa-204163.
Texte intégralChoy, Tze Leung. « Sparse distance metric learning ». Thesis, University of Oxford, 2014. http://ora.ox.ac.uk/objects/uuid:a98695a3-0a60-448f-9ec0-63da3c37f7fa.
Texte intégralDhanjal, Charanpal. « Sparse Kernel feature extraction ». Thesis, University of Southampton, 2008. https://eprints.soton.ac.uk/64875/.
Texte intégralBixler, Reid Morris. « Sparse Matrix Belief Propagation ». Thesis, Virginia Tech, 2018. http://hdl.handle.net/10919/83228.
Texte intégralMaster of Science
Kjølstad, Fredrik Berg. « Sparse tensor algebra compilation ». Thesis, Massachusetts Institute of Technology, 2020. https://hdl.handle.net/1721.1/128314.
Texte intégralCataloged from PDF of thesis.
Includes bibliographical references (pages 118-128).
This dissertation shows how to compile any sparse tensor algebra expression to CPU and GPU code that matches the performance of hand-optimized implementations. A tensor algebra expression is sparse if at least one of its tensor operands is sparse, and a tensor is sparse if most of its values are zero. If a tensor is sparse, then we can store its nonzero values in a compressed data structure, and omit the zeros. Indeed, as the matrices and tensors in many important applications are extremely sparse, compressed data structures provide the only practical means to store them. A sparse tensor algebra expression may contain any number of operations, which must be compiled to fused loops that compute the entire expression simultaneously. It is not viable to support only binary expressions, because their composition may result in worse asymptotic complexity than the fused implementation.
I present compiler techniques to generate fused loops that coiterate over any number of tensors stored in different types of data structures. By design, these loops avoid computing values known to be zero due to the algebraic properties of their operators. Sparse tensor algebra compilation is made possible by a sparse iteration theory that formulates sparse iteration spaces as set expressions of the coordinates of nonzero values. By ordering iteration space dimensions hierarchically, the compiler recursively generates loops that coiterate over tensor data structures one dimension at a time. By organizing per-dimension coiteration into regions based on algebraic operator properties, it removes operations that will result in zero. And by transforming the sparse iteration spaces, it optimizes the generated code. The result is the first sparse iteration compiler, called the Tensor Algebra Compiler (taco).
Taco can compile any tensor algebra expressions, with tensors stored in different types of sparse and dense data structures, to code that matches the performance of hand-optimized implementations on CPUs and GPUs.
by Fredrik Berg Kjølstad.
Ph. D.
Ph.D. Massachusetts Institute of Technology, Department of Electrical Engineering and Computer Science
Tan, Xing. « Bayesian sparse signal recovery ». [Gainesville, Fla.] : University of Florida, 2009. http://purl.fcla.edu/fcla/etd/UFE0041176.
Texte intégralBlom, Jonas. « Optimizing spare-parts management ». Thesis, Högskolan i Gävle, Industriell ekonomi, 2018. http://urn.kb.se/resolve?urn=urn:nbn:se:hig:diva-28822.
Texte intégralHäusner, Eva-Maria. « Att spara eller inte spara ? : En kvantitativ enkätstudie av informationslagringssystem för vetenskapliga artiklar ». Thesis, Uppsala universitet, Institutionen för ABM, 2012. http://urn.kb.se/resolve?urn=urn:nbn:se:uu:diva-174967.
Texte intégralLau, Pik-yuk Cecilia, et 劉碧玉. « SPARC and SPARC-like 1 are associated with tumor angiogenesis in hepatocellular carcinoma ». Thesis, The University of Hong Kong (Pokfulam, Hong Kong), 2004. http://hub.hku.hk/bib/B30284648.
Texte intégralKim, Jaecheol. « The role of radicals supplied directly and indirectly on ignition ». Diss., Georgia Institute of Technology, 2014. http://hdl.handle.net/1853/53001.
Texte intégralHarnesk, Malin. « Att spara eller inte att inte spara ? : En paneldatastudie över bestämningsfaktorer för hushållens sparkvot ». Thesis, Umeå universitet, Nationalekonomi, 2016. http://urn.kb.se/resolve?urn=urn:nbn:se:umu:diva-118707.
Texte intégralKarlsson, Robin. « Att spara eller inte spara : En jämförelsestudie i formmaterial vid gjutning av Prefab element ». Thesis, Högskolan i Borås, Akademin för textil, teknik och ekonomi, 2019. http://urn.kb.se/resolve?urn=urn:nbn:se:hb:diva-21667.
Texte intégralThe purpose of this study is to determent what type of build it’s more economic profitable for the supplier of prefab element to use single-use sheets or form plywood as mold material. Tasked by UBAB a survey was made to see which of the mold materials’ the most profitable alternative in production of stairs. This was made through analyzing the processes time consumption, material cost and total cost. Working procedure is different between the mold materials and that is why the operations been charted through time studies for input and observations for a greater understanding of the processes. A material consumption has emerged through interviews that together with the information from the time studies been used to determent the total cost. The result shows that the total cost for the single-use sheet is greater than when using the traditional form plywood. Only the first cast turns out to be more profitable with the single-use sheet. For the single-use sheet to be a cost efficient alternative at multiple casts the material consumption must be lowered since the cost quickly becomes twice as expensive as form plywood. Even though the cost of single-use sheets is greater there are still benefits and possibilities for improvement. To develop standardized working procedures for the single-use sheet as well could make it more time efficient and by decreasing the material consumption could make the single-use sheet a more profitable alternative.
Wolfe, Adam J. « 5-sparse steiner triple systems ». Connect to resource, 2005. http://rave.ohiolink.edu/etdc/view?acc%5Fnum=osu1122922255.
Texte intégralTitle from first page of PDF file. Document formatted into pages; contains xi, 196 p.; also includes graphics. Includes bibliographical references (p. 195-196). Available online via OhioLINK's ETD Center
Grădinaru, Vasile Catrinel. « Whitney elements on sparse grids ». [S.l. : s.n.], 2002. http://deposit.ddb.de/cgi-bin/dokserv?idn=964889897.
Texte intégralThom, Markus [Verfasser]. « Sparse neural networks / Markus Thom ». Ulm : Universität Ulm. Fakultät für Ingenieurwissenschaften und Informatik, 2015. http://d-nb.info/1067496319/34.
Texte intégralSelén, Yngve. « Model selection and sparse modeling / ». Uppsala : Department of Information Technology, Uppsala University, 2007. http://urn.kb.se/resolve?urn=urn:nbn:se:uu:diva-8202.
Texte intégralNi, Ze. « Comparative Evaluation of Spark andStratosphere ». Thesis, KTH, Skolan för informations- och kommunikationsteknik (ICT), 2013. http://urn.kb.se/resolve?urn=urn:nbn:se:kth:diva-118226.
Texte intégralSubhan, Fazli. « Multilevel sparse kernel-based interpolation ». Thesis, University of Leicester, 2011. http://hdl.handle.net/2381/9894.
Texte intégralChan, Vincent. « Finite configurations in sparse sets ». Thesis, University of British Columbia, 2014. http://hdl.handle.net/2429/46365.
Texte intégralLind, Tommy. « Schools in sparse spatial structures ». Licentiate thesis, Umeå universitet, Institutionen för geografi och ekonomisk historia, 2017. http://urn.kb.se/resolve?urn=urn:nbn:se:umu:diva-143192.
Texte intégralZhang, Yuan Ph D. Massachusetts Institute of Technology. « Parsing with sparse annotated resources ». Thesis, Massachusetts Institute of Technology, 2013. http://hdl.handle.net/1721.1/82180.
Texte intégralThis electronic version was submitted by the student author. The certified thesis is available in the Institute Archives and Special Collections.
Cataloged from student-submitted PDF version of thesis.
Includes bibliographical references (p. 67-73).
This thesis focuses on algorithms for parsing within the context of sparse annotated resources. Despite recent progress in parsing techniques, existing methods require significant resources for training. Therefore, current technology is limited when it comes to parsing sentences in new languages or new grammars. We propose methods for parsing when annotated resources are limited. In the first scenario, we explore an automatic method for mapping language-specific part of- speech (POS) tags into a universal tagset. Universal tagsets play a crucial role in cross-lingual syntactic transfer of multilingual dependency parsers. Our central assumption is that a high-quality mapping yields POS annotations with coherent linguistic properties which are consistent across source and target languages. We encode this intuition in an objective function. Given the exponential size of the mapping space, we propose a novel method for optimizing the objective over mappings. Our results demonstrate that automatically induced mappings rival their manually designed counterparts when evaluated in the context of multilingual parsing. In the second scenario, we consider the problem of cross-formalism transfer in parsing. We are interested in parsing constituency-based grammars such as HPSG and CCG using a small amount of data annotated in the target formalisms and a large quantity of coarse CFG annotations from the Penn Treebank. While the trees annotated in all of the target formalisms share a similar basic syntactic structure with the Penn Treebank CFG, they also encode additional constraints and semantic features. To handle this apparent difference, we design a probabilistic model that jointly generates CFG and target formalism parses. The model includes features of both parses, enabling transfer between the formalisms, and preserves parsing efficiency. Experimental results show that across a range of formalisms, our model benefits from the coarse annotations.
by Yuan Zhang.
S.M.
Price, Eric C. « Sparse recovery and Fourier sampling ». Thesis, Massachusetts Institute of Technology, 2013. http://hdl.handle.net/1721.1/85458.
Texte intégralCataloged from PDF version of thesis.
Includes bibliographical references (pages 155-160).
In the last decade a broad literature has arisen studying sparse recovery, the estimation of sparse vectors from low dimensional linear projections. Sparse recovery has a wide variety of applications such as streaming algorithms, image acquisition, and disease testing. A particularly important subclass of sparse recovery is the sparse Fourier transform, which considers the computation of a discrete Fourier transform when the output is sparse. Applications of the sparse Fourier transform include medical imaging, spectrum sensing, and purely computation tasks involving convolution. This thesis describes a coherent set of techniques that achieve optimal or near-optimal upper and lower bounds for a variety of sparse recovery problems. We give the following state-of-the-art algorithms for recovery of an approximately k-sparse vector in n dimensions: -- Two sparse Fourier transform algorithms, respectively taking ... time and ... samples. The latter is within log e log n of the optimal sample complexity when ... -- An algorithm for adaptive sparse recovery using ... measurements, showing that adaptivity can give substantial improvements when k is small. -- An algorithm for C-approximate sparse recovery with ... measurements, which matches our lower bound up to the log* k factor and gives the first improvement for ... In the second part of this thesis, we give lower bounds for the above problems and more.
by Eric Price.
Ph. D.
Naish-Guzman, Andrew Guillermo Peter. « Sparse and robust kernel methods ». Thesis, University of Cambridge, 2008. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.612420.
Texte intégralUsta, Fuat. « Sparse grid approximation with Gaussians ». Thesis, University of Leicester, 2015. http://hdl.handle.net/2381/33295.
Texte intégralKandola, Jasvinder S. « Interpretable modelling with sparse kernels ». Thesis, University of Southampton, 2001. https://eprints.soton.ac.uk/256087/.
Texte intégralBútora, Matúš. « Modelem řízený vývoj Spark úloh ». Master's thesis, Vysoké učení technické v Brně. Fakulta informačních technologií, 2019. http://www.nusl.cz/ntk/nusl-403168.
Texte intégral