Dissertations / Theses on the topic 'YARU'
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 'YARU.'
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.
Clauß, Matthias, and Günther Fischer. "Automatisches Software-Update." Universitätsbibliothek Chemnitz, 2003. http://nbn-resolving.de/urn:nbn:de:swb:ch1-200301040.
Full textNie, Yaru [Verfasser], Uwe [Gutachter] Ritter, Thomas [Gutachter] Hübert, and Peter [Gutachter] Scharff. "Surface silanization of carbon nanofibers and nanotubes for altering the properties of epoxy composites / Yaru Nie ; Gutachter: Uwe Ritter, Thomas Hübert, Peter Scharff." Berlin : Bundesanstalt für Materialforschung und -prüfung (BAM), 2012. http://d-nb.info/1122740956/34.
Full textNie, Yaru Verfasser], Uwe [Gutachter] [Ritter, Thomas [Gutachter] Hübert, and Peter [Gutachter] Scharff. "Surface silanization of carbon nanofibers and nanotubes for altering the properties of epoxy composites / Yaru Nie ; Gutachter: Uwe Ritter, Thomas Hübert, Peter Scharff." Berlin : Bundesanstalt für Materialforschung und -prüfung (BAM), 2012. http://d-nb.info/1122740956/34.
Full textNie, Yaru [Verfasser], Uwe [Akademischer Betreuer] Ritter, Thomas [Akademischer Betreuer] Hübert, and Peter [Akademischer Betreuer] Scharff. "Surface silanization of carbon nanofibers and nanotubes for altering the properties of epoxy composites / Yaru Nie. Gutachter: Thomas Hübert ; Peter Scharff. Betreuer: Uwe Ritter." Ilmenau : Universitätsbibliothek Ilmenau, 2012. http://d-nb.info/1023249618/34.
Full textNie, Yaru Verfasser], Uwe [Akademischer Betreuer] Ritter, Thomas [Akademischer Betreuer] [Hübert, and Peter [Akademischer Betreuer] Scharff. "Surface silanization of carbon nanofibers and nanotubes for altering the properties of epoxy composites / Yaru Nie. Gutachter: Thomas Hübert ; Peter Scharff. Betreuer: Uwe Ritter." Ilmenau : Universitätsbibliothek Ilmenau, 2012. http://d-nb.info/1023249618/34.
Full textNie, Yaru Verfasser], Uwe [Akademischer Betreuer] [Ritter, Thomas [Akademischer Betreuer] Hübert, and Peter [Akademischer Betreuer] Scharff. "Surface silanization of carbon nanofibers and nanotubes for altering the properties of epoxy composites / Yaru Nie. Gutachter: Thomas Hübert ; Peter Scharff. Betreuer: Uwe Ritter." Ilmenau : Universitätsbibliothek Ilmenau, 2012. http://nbn-resolving.de/urn:nbn:de:gbv:ilm1-2012000133.
Full textGoksoy, M. "A study of yarn-on-yarn abrasion." Thesis, University of Manchester, 1986. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.382649.
Full textLeslie, Lauren Diana. "Sorting Yard." The University of Montana, 2009. http://etd.lib.umt.edu/theses/available/etd-06232009-141416/.
Full textMejía, Meléndez Gianmarco Alessandro, Lachira Luis Felipe Pachas, Rabanal Luis Alejandro Pareja, Palomino Dámaris Sotelo, and Pino Santiago Syou Yamamoto. "Proyecto: Yara." Bachelor's thesis, Universidad Peruana de Ciencias Aplicadas (UPC), 2019. http://hdl.handle.net/10757/651850.
Full textThis paper is about the idealization and structuring of a mobile application whose purpose is to restore the feeling of security to the users. This application was designed with for Lima citizens in mind and their constant fear of being victims of some criminal act. In the last decade, 95% of Lima citizens feel insecure within their daily lives, feeling distrust of the authorities and their social environment. YARA is an application which seeks to remedy the little lack of crime prevention alternatives that currently exists, offering an app that provides the necessary tools so that citizens always remain cautious and alert to avoid these situations. For the structuring of this project, the investigation takes the most important needs that Lima citizens seek. Needs such as the insecurity’s level in the areas, quick access to the emergency lines, collective help from the Lima community, among others that will form and strengthen a culture of prevention against criminal acts, with the collaboration of the community and the authorities.
Trabajo de investigación
Daniel, Latson Trudie I. "A GRIOT’S YARN." Kent State University / OhioLINK, 2011. http://rave.ohiolink.edu/etdc/view?acc_num=kent1310406150.
Full textChang, Lingli, and mikewood@deakin edu au. "An investigation of yarn hairiness." Deakin University. School of Engineering and Technology, 2002. http://tux.lib.deakin.edu.au./adt-VDU/public/adt-VDU20060823.141926.
Full textMirfakhrai, Tissaphern. "Carbon nanotube yarn actuators." Thesis, University of British Columbia, 2009. http://hdl.handle.net/2429/17441.
Full textGiannokostas, Vasileios. "Policy-Driven YARN Launcher." Thesis, KTH, Skolan för informations- och kommunikationsteknik (ICT), 2016. http://urn.kb.se/resolve?urn=urn:nbn:se:kth:diva-204461.
Full textDe senaste åren har haft en ökad efterfrågan på IT-lösningar som är kapabla att hantera stora mängd data. Hadoop är ett av de mest använda ramverken för att lagra och behandla stora datamängder distribuerat och i ett högt tempo. YARN är ett resurshanteringslager för Hadoop som skiljer programmeringsmodellen från resurshanteringsmekanismen. Även fast Hadoop och YARN skapar ett kraftfullt system som ger flexibilitet och skalbarhet så krävs det avancerade kunskaper om YARN för att göra detta. Detta examensarbete fokuserar på design och utveckling av en människovänlig YARN applikationsstartsmiljö där systemet tar ansvar för tilldelning av resurser till program. Denna nya idé förenklar starten av program och ger oerfarna användare möjligheten att köra program över Hadoop.
Sumner, Mark. "Continuous yarn processing systems." Thesis, University of Manchester, 1997. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.601466.
Full textGoktepe, Fatma. "The effect of yarn structure on the deformation of the yarn cross-section." Thesis, University of Leeds, 1997. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.416091.
Full textHasan, M. M. B., M. Offermann, M. Haupt, A. Nocke, and Ch Cherif. "Carbon filament yarn-based hybrid yarn for the heating of textile-reinforced concrete." Sage, 2014. https://tud.qucosa.de/id/qucosa%3A35610.
Full textHe, Peng. "Process-structure-property relationships of yarns produced on the card-spinning system." Thesis, Available online, Georgia Institute of Technology, 2004:, 2004. http://etd.gatech.edu/theses/available/etd-06072004-131148/unrestricted/he%5Fpeng%5F200405%5Fms.pdf.
Full textDurur, Gungor. "Cross winding of yarn packages." Thesis, University of Leeds, 2000. http://etheses.whiterose.ac.uk/4047/.
Full textKuganesan, Srijeyanthan. "Distributed Resource Management for YARN." Thesis, KTH, Skolan för informations- och kommunikationsteknik (ICT), 2015. http://urn.kb.se/resolve?urn=urn:nbn:se:kth:diva-187044.
Full textJurkow, Gillian. "Rediscovering and recovering the front yard, a study of garden yard meaning and owner attitudes." Thesis, National Library of Canada = Bibliothèque nationale du Canada, 2000. http://www.collectionscanada.ca/obj/s4/f2/dsk2/ftp01/MQ53164.pdf.
Full textRichter, Frank, and Ursula Riedel. "Mitteilungen des URZ 3/2003." Universitätsbibliothek Chemnitz, 2003. http://nbn-resolving.de/urn:nbn:de:swb:ch1-200301019.
Full textKelly, Jack, and Jim Walworth. "Managing Caliche in the Home Yard." College of Agriculture and Life Sciences, University of Arizona (Tucson, AZ), 2002. http://hdl.handle.net/10150/144769.
Full textOverington, Y. H. "Aspects of hollow spindle fancy yarn." Thesis, University of Manchester, 1986. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.556105.
Full textKnipprath, Christian. "Mechanical performance of binder yarn composites." Thesis, Cranfield University, 2010. http://dspace.lib.cranfield.ac.uk/handle/1826/6774.
Full textSunaryo. "Multi-yard ship construction and productivity." Thesis, University of Strathclyde, 1993. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.388338.
Full textHailer, Ulf. "Einzelgehöfte im Bergland von Yavu (Zentrallykien) /." Bonn : Rudolf Habelt, 2008. http://opac.nebis.ch/cgi-bin/showAbstract.pl?u20=9783774934245.
Full textHailer, Ulf. "Einzelgehöfte im Bergland von Yavu (Zentrallykien)." Bonn Habelt, 2001. http://d-nb.info/991932242/04.
Full textMillman, Michael Peter. "Computer vision for yarn quality inspection." Thesis, Loughborough University, 2000. https://dspace.lboro.ac.uk/2134/34196.
Full textDemir, Ali. "The air-jet yarn texturing process with particular reference to nozzle design and improved yarn test methods." Thesis, Loughborough University, 1987. https://dspace.lboro.ac.uk/2134/12477.
Full textLeung, Lo-ming, and 梁路明. "Artists village-place (space) for artists in Yau Tong Bay, Yau Tong." Thesis, The University of Hong Kong (Pokfulam, Hong Kong), 1999. http://hub.hku.hk/bib/B31985300.
Full textLeung, Lo-ming. "Artists village-place (space) for artists in Yau Tong Bay, Yau Tong." Hong Kong : University of Hong Kong, 1999. http://sunzi.lib.hku.hk/hkuto/record.jsp?B25947084.
Full textRypl, Rostislav, Rostislav Chudoba, Miroslav Vorechovský, and Thomas Gries. "Evaluation of the Length Dependent Yarn Properties." Saechsische Landesbibliothek- Staats- und Universitaetsbibliothek Dresden, 2011. http://nbn-resolving.de/urn:nbn:de:bsz:14-qucosa-77843.
Full textShaik, Asif Ur Rahman, Stefan Vlad, Pascal Rebreyend, and Siril Yella. "Multi-agent simulation of sawmill yard operations." Högskolan Dalarna, Datateknik, 2012. http://urn.kb.se/resolve?urn=urn:nbn:se:du-11791.
Full textHo, Ping-Wing. "Discrete event simulation for yarn manufacturing processes." Thesis, University of Huddersfield, 1992. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.315679.
Full textRollins, Lynnette S. "Revised lumber yard cost estimator work sample." Online version, 2000. http://www.uwstout.edu/lib/thesis/2000/2000rollinsl.pdf.
Full textAcosta, Enciso Nathaly Marjory, Figueroa Rosario Beatriz Cisneros, Bautista Karla María Hernando, and Crisóstomo Diego Alonso Nestares. "Proyecto Empresarial: Ahorrador de agua – Kawsay Yaku." Bachelor's thesis, Universidad Peruana de Ciencias Aplicadas (UPC), 2018. http://hdl.handle.net/10757/625421.
Full textThe technological progress, great discoveries and development of peoples, go creating more educated societies, not dependents of the maturity of adults, but the juvenile dynamism, challenging the future, focused in having the natural resources within easy reach, causing an excessive consumption, that forces the industry to satisfy the increasing demand forgetting the depletion. The wars of yesterday were for extending domains, today we are not far from another war for water conservation. Although governments, municipalities and organizations like the UNO, prevent the water shortage; surveys, interviews and visiting villages, demonstrate that many people close their eyes and ears not to harm their standard of living, strengthening an egoism that reduces living options to the future generations, where today one of 10 has drinking water, and others don't even have it As a result, arises Kawsay Yaku, a project managed by professional people, intended to homes class B and C, that re-uses soapy water of washing clothes, sending it to the water closet. The total investment of this project is S/.25,760, 40% own investment, and 60% with external support, generating 16.11% as an annual average return. It hopes to involve also the private sector to promote the habit for saving water in the society. It is not a question of seeing, but acting and planning the future for new generations That allows to enjoy a world where to live and not only to survive Kawsay Yaku, saving the water for tomorrow!
Trabajo de investigación
Allen, Keith John. "Friction spinning : an investigation of yarn formation." Thesis, Loughborough University, 1991. https://dspace.lboro.ac.uk/2134/27571.
Full textAndersson, Robin. "GPU integration for Deep Learning on YARN." Thesis, KTH, Skolan för informations- och kommunikationsteknik (ICT), 2017. http://urn.kb.se/resolve?urn=urn:nbn:se:kth:diva-222357.
Full textDe senaste åren har många framsteg gjorts inom maskininlärning och användning av dess tekniker inom många olika industrier. Djupinlärning är ett delområde inom maskininlärning som är hänförlig till många av de senaste innovativa applikationerna såsom system för autonom bilkörning. Att träna en djupinlärningsmodell är en beräkningsmässigt intensiv uppgift som i många fall är ineffektivt på endast en processor. Dramatiskt snabbare träning är möjlig genom att använda en eller flera grafikkort, kopplat med behov att träna mer komplexa modeller med större datamängder, är det inte hållbart att endast träna på en processor. Hops Hadoop är en Hadoop distribution med målet att göra Hadoop mer skalbart, genom att migrera metadata från YARN och HDFS till MySQL NDB. Hops utför i nuläget ett arbete med att stödja distribuerad TensorFlow. För närvarande finns inget stöd för grafikkort som en resurs i YARN, därmed, i Hadoop, så kan grafikkort inte schemaläggas för applikationer. Mer specifikt, det finns inget stöd för att isolera grafikkort för applikationer och erbjuda som en resurs. Den här uppsatsen presenterar en arkitektur för att schemalägga och isolera grafikkort som en resurs i Hops Hadoop. Arbetet innefattar stöd för den mest populära schemaläggaren i YARN, kapacitets schemaläggaren. Arkitekturen implementeras och verifieras utifrån en mängd testfall. Arkitekturen utvärderas sedan i ett kvantitativt tillvägagångssätt genom att mäta tidspåverkan att stödja grafikkort genom att utföra ett antal experiment. Lösningen tar inte hänsyn till grafikkort som en del av kapacitetsberäkningen. Node Manager komponenten använder Cgroups för att utföra isolering av grafikkort. En GPUAllocator komponent har implementerats som håller ett tillstånd över vilka grafikkort som allokerats och vilka som är lediga på Node Manager. Experimenten konkluderar att YARN kan stödja grafikkort som en resurs och att tidspåverkan för detta är försumbart. Detta arbete med att stödja grafikkort som en resurs på Hops Hadoop, gör det möjligt att utföra djupinlärnin på stora datamängder, och är ett första steg mot stöd för distribuerad djupinlärning.
Rajamanickam, Rangaswamy. "Studies on fiber-process-structure-property relationships in air-jet spinning." Thesis, Georgia Institute of Technology, 1996. http://hdl.handle.net/1853/8661.
Full textHu, Xiao Ping. "Structure and properties of polyacrylonitrile fibres." Thesis, University of Leeds, 1994. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.366460.
Full textMadipally, Sunil veer Kumar. "Simulation of Sawmill Yard Operations Using Software Agents." Thesis, Högskolan Dalarna, Datateknik, 2011. http://urn.kb.se/resolve?urn=urn:nbn:se:du-6026.
Full textKesici, Demet Akkaya Vahide Baysal. "Kortikosteroidlerle baskılanmış yara iyileşmesi üzerine Dietilaminoetil - Sefadeks'in etkisi /." Isparta : SDÜ Tıp Fakültesi, 2003. http://tez.sdu.edu.tr/Tezler/TT00124.pdf.
Full textSun, XingXian. "Technology and economics of sizing single worsted yarn." Thesis, University of Huddersfield, 1994. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.307839.
Full textBorjian, Boroujeni Setareh. "Optimization of yard operations in maritime container terminals." Thesis, Massachusetts Institute of Technology, 2015. http://hdl.handle.net/1721.1/99589.
Full textThesis: S.M., Massachusetts Institute of Technology, Sloan School of Management, Operations Research Center, 2015.
Cataloged from PDF version of thesis.
Includes bibliographical references (pages 107-109).
With the continuous growth in international container shipping, many container terminals in maritime ports face congestion, particularly during peak hours of service, and when there is limited space in the storage area. Thus, there has been increasing interest in improving operations efficiency in container terminals. An efficient terminal, in general, is one that discharges containers from the ships in a timely manner and delivers containers to customers with a reasonable wait time. Moreover, a key performance measure in the storage area is the number of moves performed by yard cranes. Due to limited space in the storage area, containers are stacked on top of each other, forming a column of containers that can be accessed by yard cranes only from the top. Therefore, in order to retrieve a container that is covered by other containers, the blocking containers must be relocated to other slots. Because such relocation moves are costly for the port operators and result in service delays, one of the main challenges in the storage area is to plan the moves such that the number of relocations is minimized. This problem is referred to as the Container Relocation Problem (CRP). The CRP in its most simplified setting is concerned with finding a sequence of moves that retrieves all containers in a pre-defined order with a minimum number of relocations, assuming that no new containers are stacked during the retrieval process. Also, it is often assumed that the non-blocking containers cannot be relocated (i.e., repositioning moves are not allowed), an assumption that can result in a sub-optimal solution. Other variants of the container relocation problem include the dynamic CRP and the CRP with incomplete information. The former involves minimizing the number of relocations when containers are continuously stacked in and retrieved from the storage area, and the latter refers to the case that the departure times of containers are not fully known in advance. For example, a probabilistic distribution of container departure orders, or approximate departure times (in the form of time windows) might be known. Another important efficiency metric, in addition to the number of relocations, is customer wait times during the retrieval process. In particular, when repositioning moves are allowed in the system, there is a trade-off between the total number of relocations (including repositionings) and wait times, because such repositioning moves make the retrieval process faster for trucks arriving in the future. Also, it might be desired to prioritize some customers so that those prioritized experience shorter wait times. For example, in terminals with appointment systems, shorter waiting time guarantees can be given to customers who book in advance a time slot for picking up their containers. In this thesis, we propose optimization models that capture service-based and cost-based objectives and study different service policies. In the first part of this thesis, we study the CRP with complete information using an optimization model and heuristic approach. In particular, we formulate CRP (with no restrictive assumptions on repositioning moves) as an Integer Program that minimizes the weighted sum of the number of relocations and the total wait time of customers. Our integer program provides the optimal sequence of moves for retrieving containers subject to various service policies. For example, it can be used by port operators to minimize customer wait times, or to give different waiting time guarantees to different customers to reflect relative priorities. Moreover, by assigning different weight factors to the two objectives, one can use our model to plan repositioning moves. We also extend our model to the dynamic CRP and illustrate how the flexibility in the stacking process can be exploited to optimize jointly the sequence of moves and the stacking position of containers. Additionally, we propose a class of flexible retrieval policies. We demonstrate that flexible policies can result in fewer relocations and shorter wait times, thereby benefiting both the port operators and customers. In the second part of this thesis, we study the CRP with incomplete information in a 2-stage setting where the departure times of a subset of containers are initially known and the departure times of other containers are revealed at once at a later time. The contributions are twofold. First, we propose an approximate stochastic optimization algorithm, called ASA*, which is a branch-and-bound framework combined with a sampling technique, and to the best of our knowledge is the first optimization algorithm proposed for this problem. We provide theoretical bounds on the approximation errors and present numerical results showing the computational tractability and efficiency of our algorithm. Second, we use the ASA* algorithm and a myopic heuristic to study the value of information, that is, the effect of the number of containers initially known on the number of relocations. In the last part of this thesis, we introduce a simulator that is capable of integrated simulation of port operations, including the retrieval process, the stacking process, and other aspects such as allocating cranes to containers and allocating trucks to cranes. Our simulator captures the practical details of operations that cannot be modelled in an optimization framework and is capable of simulating long periods (e.g. a week) of realistic-scale operations.
by Setareh Borjian Boroujeni.
S.M. in Transportation
S.M.
Bazbouz, Mohamed Basel. "An investigation of yarn spinning from electrospun nanofibres." Thesis, Heriot-Watt University, 2009. http://hdl.handle.net/10399/2245.
Full textAlshukur, Malek. "On the structure of multi-thread boucle yarn." Thesis, Heriot-Watt University, 2017. http://hdl.handle.net/10399/3362.
Full textWebb, Carwyn James. "Investigation and modelling of the yarn splicing process." Thesis, University of South Wales, 2008. https://pure.southwales.ac.uk/en/studentthesis/investigation-and-modelling-of-the-yarn-splicing-process(b153a874-d572-4b08-a047-e7b13741d65a).html.
Full textSen, Priyanka M. A. "The Choreographed Landscape:Performance of the Queensgate Rail Yard." University of Cincinnati / OhioLINK, 2017. http://rave.ohiolink.edu/etdc/view?acc_num=ucin1491316158905738.
Full textKakantousis, Theofilos. "Scaling YARN: A Distributed Resource Manager for Hadoop." Thesis, KTH, Skolan för informations- och kommunikationsteknik (ICT), 2014. http://urn.kb.se/resolve?urn=urn:nbn:se:kth:diva-177200.
Full textRashid, Zahin Azher. "Intelligent Scheduling for Yarn : Using Online Machine Learning." Thesis, KTH, Skolan för informations- och kommunikationsteknik (ICT), 2017. http://urn.kb.se/resolve?urn=urn:nbn:se:kth:diva-219607.
Full textMånga stora företag som tillhandahåller molninfrastruktur, plattformar och tjänster måste möta många utmaningar när det handlar om stora data och utförandeav tusentals uppgifter som körs på servrar. Tusentals servrar som kör i molnetförbrukar en stor mängd energi vilket i hög grad ökar driftskostnaden för företag som tillhandahåller infrastrukturer och plattformar som tjänster. Hundratusentals applikationer skickas varje dag på dessa servrar av användare. Vid inlämning av ansökningar på något sätt utnyttjas inte de totala resurserna korrekt, vilket medför att de totala driftskostnaderna ökar. En distribution av Apache Hadoop, kallad HOPS, är utvecklad hos SICS Swedish ICT, och det görs ansträngningar för att göra den till en bättre plattform för institutioner och företag. Garn används som resurshanteringsoch schemaläggningsramen som är ansvarig för att allokera resurser som minne och CPU-kärnor till inlämnade applikationer. Garn fördelar helt enkelt resurser utifrån standardvärdet av värden eller vilken användare som har krävt. Garn har ingentidigare information om de inlämnade ansökningarna så det är mycket möjligtatt tilldelade resurser är mer eller mindre än vad som krävs. Energi slösas bort om färre resurser krävs eller ansökan kommer sannolikt inte att lyckas om det behövs mer. I detta forskningsprojekt undersöks olika tekniker och metoder för insamling av användbara mätvärden relaterade till applikationer och resurser från Garn, Spark och andra källor. Machine Learning blir idag en mycket populär teknik för optimering av systemsom hanterar stora data i en molnmiljö.Målet är att samla in dessa viktigamätvärden och bygga en maskininlärningsmodell för att beställa smart fördelning av resurser till inlämnade applikationer. Detta kan hjälpa till att öka effektiviteten hos servrarna i molnet och minska driftskostnaden. Slutligen utvecklades en maskininlärningsmodell och minnet och vCores hade framgångsrikt förutsagt att tilldelas applikationer.