Dissertations / Theses on the topic 'Fasore'
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 'Fasore.'
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.
Fioresi, Adriano. "A new method to characteriz e monitoring platforms for dynamic distribution systems." Master's thesis, Alma Mater Studiorum - Università di Bologna, 2016. http://amslaurea.unibo.it/12387/.
Full textFiebrandt, Julia [Verfasser], Hartmut [Akademischer Betreuer] Bartelt, Stefan [Akademischer Betreuer] Nolte, and Johannes [Akademischer Betreuer] Roths. "Eigenschaften von Faser-Bragg-Gittern in seltenerddotierten optischen Fasern / Julia Fiebrandt. Gutachter: Hartmut Bartelt ; Stefan Nolte ; Johannes Roths." Jena : Thüringer Universitäts- und Landesbibliothek Jena, 2014. http://d-nb.info/1050978013/34.
Full textPolz, Leonhard [Verfasser], Hartmut [Gutachter] Bartelt, Robert R. J. [Gutachter] Maier, Andreas [Gutachter] Rüger, and Johannes [Gutachter] Roths. "Regenerieren von Faser-Bragg-Gittern in polarisationserhaltenden optischen Fasern / Leonhard Polz ; Gutachter: Hartmut Bartelt, Robert R. J. Maier, Andreas Rüger, Johannes Roths." Jena : Friedrich-Schiller-Universität Jena, 2018. http://d-nb.info/1170399193/34.
Full textAycock, John Daniel. "Faster Tomita parsing." Thesis, National Library of Canada = Bibliothèque nationale du Canada, 1998. http://www.collectionscanada.ca/obj/s4/f2/dsk2/ftp03/MQ34479.pdf.
Full textPålvik, Richard. "H.P. Lovecraft : Narratologisk analys av atmosfär och fasor." Thesis, Linnéuniversitetet, Institutionen för film och litteratur (IFL), 2013. http://urn.kb.se/resolve?urn=urn:nbn:se:lnu:diva-26630.
Full textWulfinghoff, Malte [Verfasser], and Josephus D. M. [Akademischer Betreuer] Platenkamp. "Tour du Faso : Sport und nationale Identität in der multiethnischen Gesellschaft Burkina Fasos / Malte Wulfinghoff ; Betreuer: Josephus D. M. Platenkamp." Münster : Readbox Unipress / Münster (Westf), 2019. http://d-nb.info/1177145499/34.
Full textChmelik, Christian, Helge Bux, Jürgen Caro, Lars Heinke, Florian Hibbe, Tobias Titze, and Jörg Kärger. "Faster by opposing the stream." Universitätsbibliothek Leipzig, 2015. http://nbn-resolving.de/urn:nbn:de:bsz:15-qucosa-185127.
Full textMenzies, Lindsey. "Jigsaws and faster fractal pictures." Thesis, University of Glasgow, 1997. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.363150.
Full textChmelik, Christian, Helge Bux, Jürgen Caro, Lars Heinke, Florian Hibbe, Tobias Titze, and Jörg Kärger. "Faster by opposing the stream." Diffusion fundamentals 16 (2011) 49, S. 1-2, 2011. https://ul.qucosa.de/id/qucosa%3A13786.
Full textZarambukas, Michalis. "Přestavba experimentálního vozidla Formula Faster." Master's thesis, Vysoké učení technické v Brně. Fakulta strojního inženýrství, 2011. http://www.nusl.cz/ntk/nusl-229715.
Full textKidane, Tesfaye Kebede. "Toward Faster and Quieter MRI." Case Western Reserve University School of Graduate Studies / OhioLINK, 2005. http://rave.ohiolink.edu/etdc/view?acc_num=case1118850517.
Full textLundén, Philip. "Faster faster, cheaper cheaper : A study about how fast fashion brands have affected luxury brands." Thesis, Högskolan i Borås, Akademin för textil, teknik och ekonomi, 2017. http://urn.kb.se/resolve?urn=urn:nbn:se:hb:diva-12722.
Full textZürner, Jörg [Verfasser]. "Piezo-Faser-Composite zur Schwingungsbeeinflussung von Faser-Verbund-Kunststoffen / Jörg Zürner." Aachen : Shaker, 2004. http://d-nb.info/117054407X/34.
Full textAggarwal, Charu C., Haim Kaplan, and Robert E. 1948 Tarjan. "A Faster Primal Network Simplex Algorithm." Massachusetts Institute of Technology, Operations Research Center, 1996. http://hdl.handle.net/1721.1/5266.
Full textMunshi, Siddharth. "Faster algorithms for stable allocation problems." Connect to this title online, 2007. http://etd.lib.clemson.edu/documents/1193080488/.
Full textTermier, Alexandre. "Pattern mining rock: more, faster, better." Habilitation à diriger des recherches, Université de Grenoble, 2013. http://tel.archives-ouvertes.fr/tel-01006195.
Full textSteinbrenner, Todd James. "Citius, Altius, Fortius: faster, higher, stronger." Monterey, California: Naval Postgraduate School, 2013. http://hdl.handle.net/10945/34747.
Full textChinese elite female athletes have experienced extraordinary success in international athletic competitions. Since 1992, elite women athletes have been more represented and successful in the Olympics and National Championships then men; while accounting for less than 50 percent of the elite athletes in China, and competing in less Olympic events, in the Olympics, women were represented in less than 50 percent of the events until 2012. Concisely, the rise of Chinese female athletic participation and success in international competitions has become the backbone for Chinas rise to sports relevance, and has been unlike historical Western nation-states experience in athletics. This historical examination chronologically documents the rise of Chinese elite female athletes and the policies affecting athletes from 1949 to the present, and reveals a connection between female athletic success and state enforced gender equality policies that targeted culture, education, and labor. Through gender equality policies, men and women were uniformly exposed to a national sports system that invested in research, training, equipment, recruitment, and incentivizing athletes to win honors for the country. Moreover, this examination evaluates various hypotheses on what Chinese policies, if any, have produced these extraordinary results, and proposes the sports system, although exceptionally successful, is ultimately imbalanced and plateauing, while the Chinese Communist Party desires participation, power, and control at the expense of possible broad athletic victory.
Stoll, Detlef. "Nichtlineare Wellenausbreitung in Single-Mode-Fasern /." Düsseldorf : VDI Verlag, 1994. http://bvbr.bib-bvb.de:8991/F?func=service&doc_library=BVB01&doc_number=006517067&line_number=0001&func_code=DB_RECORDS&service_type=MEDIA.
Full textMa̧dry, Aleksander. "Faster generation of random spanning trees." Thesis, Massachusetts Institute of Technology, 2009. http://hdl.handle.net/1721.1/55126.
Full textCataloged from PDF version of thesis.
Includes bibliographical references (p. 39-40).
In this thesis, we set forth a new algorithm for generating approximately uniformly random spanning trees in undirected graphs. We show how to sample from a distribution that is within a multiplicative (1+6) of uniform in expected time ... . This improves the sparse graph case of the best previously known worst-case bound of O(min{mn, n2. 376}), which has stood for twenty years. To achieve this goal, we exploit the connection between random walks on graphs and electrical networks to introduce a new approach to the problem that integrates discrete random walk-based techniques with continuous linear algebraic methods. We believe that our use of electrical networks and sparse linear system solvers in conjunction with random walks and combinatorial partitioning techniques is a useful paradigm that will find further applications in algorithmic graph theory. This work was done in collaboration with Jonathan Kelner.
by Aleksander Ma̧dry.
S.M.
McGinley, Susan. "Determining Bull Fertility: A Faster Test." College of Agriculture and Life Sciences, University of Arizona (Tucson, AZ), 2006. http://hdl.handle.net/10150/622171.
Full textVieira, Pedro César Cordeiro. "Estudo do desempenho de canais de instrumentação para a medição sincronizada de fasores." reponame:Repositório Institucional da UFSC, 2014. https://repositorio.ufsc.br/xmlui/handle/123456789/123171.
Full textMade available in DSpace on 2014-08-06T17:53:55Z (GMT). No. of bitstreams: 1 326660.pdf: 7483181 bytes, checksum: daa90a83e5028a2df160133d5b29ad96 (MD5) Previous issue date: 2014
Sistemas de Medição Fasorial Sincronizada constituem uma ferramenta que permite o monitoramento em tempo real da dinâmica dos sistemas elétricos de potência. Aplicações que fazem uso de sincrofasores podem ser sensíveis aos erros de medição. Desta maneira, as normas aplicáveis à medição fasorial exigem elevados requisitos de exatidão e desempenho por parte dos equipamentos de medição. Entretanto, o erro fasorial total em uma instalação de medição de fasores é consequência não só da unidade de medição, mas de toda a cadeia de instrumentos, denominada Canais de Instrumentação, cuja finalidade é adequar os sinais de tensão e corrente para patamares mensuráveis, e transportar esses sinais até os instrumentos de medição. Neste trabalho é investigada a influência produzida pelos Canais de Instrumentação nos erros de medição, do ponto de vista da tecnologia de medição fasorial sincronizada. Para tanto são discutidos os aspectos de exatidão que abrangem todos os equipamentos que compõem um Canal de Instrumentação típico, incluindo a própria unidade de medição fasorial. É realizada a correlação dos conceitos adotados pelas normas, e proposto um índice de avaliação do erro fasorial global, que incorpora a contribuição de todos os equipamentos. Em seguida é feita a modelagem dos equipamentos do Canal de Instrumentação. Através desta modelagem são realizadas diversas simulações computacionais, com o intuito de verificar a magnitude dos erros fasoriais, presentes em uma instalação de medição fasorial. Estas simulações são realizadas nas condições nominais de operação dos equipamentos, nas condições de testes de regime permanente e regime dinâmico exigidas pela norma de medição fasorial, e durante eventos reais observados no sistema elétrico brasileiro. Os resultados obtidos mostram que as atuais normas aplicadas a CI permitem erros fasoriais muito superiores aos exigidos pela norma de medição fasorial. Além disso, os resultados de simulação mostram que os CI podem provocar erros fasoriais elevados, principalmente quando submetidos a condições onde os parâmetros do sinal de entrada (tensão e corrente) estão fora dos seus valores nominais.
Abstract : Synchronized Phasor Measurement Systems represent a useful tool on real time monitoring of power systems dynamics. Applications that use synchrophasors may be sensitive to measurement errors. Thus, the phasor measurement standards require high accuracy levels from measurement equipments. However, the total phasor error on a phasor measurement installation is not caused only by the measurement unit, but by the entire instruments network, called Instrumentation Channel. The Instrumentation Channel function consists in adjusting the voltage and current signals to measurable levels, and transport these signals to the measurement instruments. In this work, the influence of Instrumentation Channels on measurement errors is investigated, from the point of view of synchronized phasor measurement technology. For that purpose, the accuracy aspects that cover all the equipaments which compose a typical Instrumentation Channel are analyzed, including the phasor measurement unit itself. The concepts used by the standards are correlated and then an evaluation index for the global phasor error, that incorporates all equipment contribution, is proposed. After that, the modelling of Instrumentation Channel equipments is developed. Through this modelling, many computational simulations are performed, in order to verify the magnitude of phasor errors, present in a phasor measurement installation. These simulations are performed on nominal operation conditions, on test conditions of steady state and transient required by phasor measurement standard, and during real events observed on the Brazilian Interconnected Power System. The results show that the current standards, applied to Instrumentation Channels, allow phasor errors much higher than those required by the phasor measurement standard. Furthermore, the simulation results show that the instrumentation channels may produce high phasor errors, especially when facing conditions where the parameters of the input signal (voltage and current) are different from their nominal values.
Schuler, Frank [Verfasser], and Wolfgang [Akademischer Betreuer] Breit. "Richtungsanalyse von Fasern in Beton und Charakterisierung von rissquerenden Fasern mittels Computer-Tomografie / Frank Schuler ; Betreuer: Wolfgang Breit." Kaiserslautern : Technische Universität Kaiserslautern, 2020. http://d-nb.info/1224883845/34.
Full textDi, Luccio Luca. "Entertainement [!] for faster driving takeovers : Designing games for faster and safer takeovers on level 3 self-driving cars." Thesis, Högskolan i Skövde, Institutionen för informationsteknologi, 2020. http://urn.kb.se/resolve?urn=urn:nbn:se:his:diva-18690.
Full textTomioka, Jorge. "Modelagem de carga utilizando medidores de fasor em análise de estabilidade transitória." Universidade de São Paulo, 1995. http://www.teses.usp.br/teses/disponiveis/18/18133/tde-25012018-104745/.
Full textThe development of algorithms for analysis of transient stability with reduced computational effort is the main objective of this work. With that purpose a methodology to build reduced equivalents of a power system in a dynamic way is developed. The expression for the injected equivalent currents at the generator buses, is a result of load buses elimination corresponding to different load models, that is: constant PQ loads, PQ as voltage dependency model,as well as PQ as voltage and frequency dependency models. The electric power system is reduced to the generator buses only, using the classic methodology for equivalents developed by Ward. An improved version for the Ward equivalent updates the injected equivalent currents at the generator buses through the use of the phasor measurement units (PMU\'s) and a sensitivity matrix W; those units give the power angle deviation of the generators when some perturbation is applied to the system. In the process of correcting the injected equivalent currents the sensitivity matrix W is updated every time the operating point changes significatively. The technique used in developing the sensitivity matrix W was made through linearization of the load flow equations applied to the different load models. Computer programs taking the considerations above mentioned were developed. The AEP-14 bus power system was used to test the models proposed on this work.
Hahn, Harald. "Modularer Ansatz zu multifunktionellen Polymer-Peptid-Fasern." Phd thesis, Universität Potsdam, 2009. http://opus.kobv.de/ubp/volltexte/2009/3301/.
Full textThe combination of polymer with peptides combines the advantages of both substance classes. It is possible to use peptide structure-forming properties to assemble polymers. In my current research, a self assembling Polymer-Peptide-Conjugate was used, which forms ribbon-like structures in water. The peptide tendency to form β-sheets is the driving force for this process. The resulting Polymer-Peptide-Aggregate is build up of a core shell model, where the peptides are the core and the polymer (polyethylene oxide) is the lateral suited shell. A new peptide synthesis was necessary in order to change the functional groups in the peptide core. In my present work a modular strategy was developed to get access to various types of modified Polymer-Peptide-Fiber. This allows adjustiment to the fiber properties without changing the structure forming b‑sheet sequence. To apply these functions, 1,3‑dipolar addition was used. This reaction described the simultaneous reactions of alkynes and azides. The reaction occurs in most solvents under high yields. In the context of this work, the generation of azides was investigated and transferred to the Polymer-Peptide-Fibers. Diazotransfer was the chosen method to transfer primary amines into azidefunctions at the fiber surface. With the use of 1,3‑dipolar addition it was possible to bind alkyne functionalized molecules covalent to the azide functionalized fibers. A fluorescent dye was bound to the fibers to image these fibers with confocal microscopy. The properties of the azide fibers were further modified to incorporation three different carboxylic molecules. These fibers were used to estimate the calcium binding affinity. Thus, differing the number of bonded calcium is a function of the used fiber attachment. Investigations concerning the morphology of Calcium carbonate crystals can be done. The covalent attachment of reducing sugar to the Polymer-Peptide-Fibers should will allow the production of silver(0)clusters along the fibers with the use of Tollens´ reagent. With the help of a developer solution, similar to black and white photography, the possibility to archive silverrods in nanometer size can be obtained. The applied modifications on fibers is hence a promising first step in altering fibers in which by adjusting its properties, we broaden the applications of these Polymer-Peptide-Fibers.
Liem, Sebastian. "Faster Dark Matter Calculations Using the GPU." Thesis, Stockholms universitet, Fysikum, 2011. http://urn.kb.se/resolve?urn=urn:nbn:se:su:diva-62474.
Full textVi har undersökt om man kan använda grafikkortet för att få mjukvarupaketet DarkSUSY snabbare. DarkSUSY används, bland annat, för att beräkna relikdensiteten av mörk materia -- en mätbar kvantitet -- användandes den supersymmetriska neutralinon, χ, som mörk materia-kandidat. Supersymmetriska teorier har många fria parametrar och vi vill beräkna relikdensiteten för stora områden av parameterrummet. Resultaten kan sedan jämföras med observationer för att begränsa parametrarna. Ett snabbare DarkSUSY skulle tillåta större sökningar i parameterrummet. Vi modifierade DarkSUSY med hjälp av Nvidias CUDA-platform och skrev ett program som, genom att använda grafikkortet, beräknar χ + χ <-> W+ + W- kanalens bidrag till annihilationstvärsnittet. Vårt första försök var bara försumbart snabbare än vårt icke-CUDA program på grund av underanvändning av grafikkortet. Men med det åtgärdat så var programmet 47 gånger snabbare än referensprogrammet. Vi rapporterar också de problem vi stött på, både de vi löste och de vi inte löste. Detta så att läsaren kan avgöra värdet av att omarbeta så att alla de beräkningsintensiva delarna av DarkSUSY använder grafikkortet.
Strömberg, Eric. "Faster Optimal Design Calculations for Practical Applications." Thesis, Uppsala universitet, Institutionen för farmaceutisk biovetenskap, 2011. http://urn.kb.se/resolve?urn=urn:nbn:se:uu:diva-150802.
Full textPrang, Peter Franz-Josef. "Regenerationsfähigkeit entorhino-hippocampaler Fasern in organotypischen Schnittkulturen." [S.l.] : [s.n.], 2002. http://www.freidok.uni-freiburg.de/volltexte/381.
Full textWeeraprajak, Issarest. "Faster Adaptive Network Based Fuzzy Inference System." Thesis, University of Canterbury. Mathematics and Statistics, 2007. http://hdl.handle.net/10092/1234.
Full textLiu, Shih-Yuan. "Collaborative Team Evasion Against a Faster Pursuer." Thesis, University of California, Berkeley, 2015. http://pqdtopen.proquest.com/#viewpdf?dispub=3686396.
Full textIn the past decade, the level of autonomy of unmanned vehicles has been rising rapidly from remote-controlled towards fully autonomous. Without human operators on board, teams of autonomous vehicles are the best candidates for high risk applications such as search and rescue after disasters and information gathering in hostile environments. For a team of autonomous vehicles to operate effectively in these scenarios, it must be able to respond promptly to environmental hazards and/or hostile entities. In this dissertation, a collaborative team evasion framework is proposed to maximize the survival time of a team of autonomous vehicles against a faster and more agile hostile agent. The proposed framework is based on an open-loop formulation of the single-pursuer-multiple-evader pursuit-evasion game that is conservative to the evaders and provides guarantees on team survival time in the worst-case scenario. An iterative open-loop approach that repeatedly solves the open-loop problem corresponding to the most current state of the game is developed to relax the conservatism of the open-loop formulation and enhance the survival time performance. Extensions to the framework make it possible to take into account the turning rate constraints of the evaders and uncertainties in the position of the pursuer. Numerical approximations are also proposed to reduced the required computation time. Through extensive simulations, the proposed framework is shown to produce reliable strategies for the evaders that result in significantly longer team survival time than previous work in the literature.
Dai, Peng. "FASTER DYNAMIC PROGRAMMING FOR MARKOV DECISION PROCESSES." UKnowledge, 2007. http://uknowledge.uky.edu/gradschool_theses/428.
Full textHallqvist, Joakim. "Faster Locking Differential Through Active Brake-Control." Thesis, Linköpings universitet, Fordonssystem, 2015. http://urn.kb.se/resolve?urn=urn:nbn:se:liu:diva-119423.
Full textAggarwal, Charu C. (Charu Chandra). "Faster algorithms for some network flow problems." Thesis, Massachusetts Institute of Technology, 1996. http://hdl.handle.net/1721.1/11031.
Full textLee, Yin Tat. "Faster algorithms for convex and combinatorial optimization." Thesis, Massachusetts Institute of Technology, 2016. http://hdl.handle.net/1721.1/104467.
Full textThis 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 (pages 443-458).
In this thesis, we revisit three algorithmic techniques: sparsification, cutting and collapsing. We use them to obtain the following results on convex and combinatorial optimization: --Linear Programming: We obtain the first improvement to the running time for linear programming in 25 years. The convergence rate of this randomized algorithm nearly matches the universal barrier for interior point methods. As a corollary, we obtain the first ... time randomized algorithm for solving the maximum flow problem on directed graphs with m edges and n vertices. This improves upon the previous fastest running time of achieved over 15 years ago by Goldberg and Rao. --Maximum Flow Problem: We obtain one of the first almost-linear time randomized algorithms for approximating the maximum flow in undirected graphs. As a corollary, we improve the running time of a wide range of algorithms that use the computation of maximum flows as a subroutine. --Non-Smooth Convex Optimization: We obtain the first nearly-cubic time randomized algorithm for convex problems under the black box model. As a corollary, this implies a polynomially faster algorithm for three fundamental problems in computer science: submodular function minimization, matroid intersection, and semidefinite programming. --Graph Sparsification: We obtain the first almost-linear time randomized algorithm for spectrally approximating any graph by one with just a linear number of edges. This sparse graph approximately preserves all cut values of the original graph and is useful for solving a wide range of combinatorial problems. This algorithm improves all previous linear-sized constructions, which required at least quadratic time. --Numerical Linear Algebra: Multigrid is an efficient method for solving large-scale linear systems which arise from graphs in low dimensions. It has been used extensively for 30 years in scientific computing. Unlike the previous approaches that make assumptions on the graphs, we give the first generalization of the multigrid that provably solves Laplacian systems of any graphs in nearly-linear expected time.
by Yin Tat Lee.
Ph. D.
Shi, Peiyang. "Faster Unsupervised Object Detection For Symbolic Representation." Thesis, KTH, Skolan för elektroteknik och datavetenskap (EECS), 2020. http://urn.kb.se/resolve?urn=urn:nbn:se:kth:diva-277852.
Full textUnder slutet av 1900-talet har forskning inom symbolisk artificiell intelligens ökat kraftigt. Områdena djupinlärning och djup förstärkningsinlärning har på senare tid gjort stora framsteg inom datorseende och robotapplikationer. Både områdena har gjort imponerande framsteg men finner sig i motsatta ändar av AI-forskningens spektrum. Mainstream djupinlärning bygger på automatisk extraktion utan vidare hänsyn till tolkningsbara symboler medan symbolisk AI ofta fokuserar på handgjorda symboler. I denna studie introducerar vi en djupinlärningsalgoritm för symbolrepresentationsinlärning. Algoritmen baseras på de senaste framstegen inom oövervakad objektdetektering och vi visar att den lätt kan anpassas för symbolisk representation. Vår algoritm, FaSPAIR, är en anpassning av algoritmen för objektdetektering, SPAIR. Vi har gjort flera förändringar för att kunna länka modellen till den symboliska representationen som behövs för förstärkningsinlärning samt för förbättring av träningshastigheten. Våra resultat visar verkan och effektiviteten av att använda objektdetektion för symbolisk representationsinlärning. Vi visar även att FaSPAIR ger stor förbättring i beräkningshastigheten jämfört med den toppmoderna algoritmen SPAIR.
Alonso, Pedro. "Faster and More Resource-Efficient Intent Classification." Licentiate thesis, Luleå tekniska universitet, EISLAB, 2020. http://urn.kb.se/resolve?urn=urn:nbn:se:ltu:diva-81178.
Full textMammitzsch, Jens. "Untersuchungen zum Einsatz von ultrahochmolekularen Polyethylenfasern in Seilen für die Fördertechnik." Doctoral thesis, Universitätsbibliothek Chemnitz, 2015. http://nbn-resolving.de/urn:nbn:de:bsz:ch1-qucosa-159603.
Full textThis thesis covers investigations on the properties of ultrahigh-molecular-weight (UHMW) polyethylene fibers for use of manufacturing braided fiber ropes for conveyor and hoisting applications. The importance of synthetic fibres for conveying applications has increased during the last years. Due to the low density and bending stiffness at a strength that is comparable to steel, ropes made from high-strength UHMW polyethylene fibres have found their ways into several shipping and off-shore applications. The basic aptitude of UHMW polyethylene fibres to be used in applications like cranes, elevators and winch applications has already been proven in scientific works. Within this thesis, selected UHMW polyethylene fibres are investigated to determine how much their differing property profiles do influence their aptitude to be used in technical applications with cyclic bending loads and for which potentials for fields of application they might be appropriate. Starting with a short overview on the history of synthetic fibres and the use of such fibres in technical applications, manufacturing processes and properties of these fibres are to be compared. Further, fibre ropes, made from the selected fibres, are going to be investigated concerning their tensile strength, behaviour in cyclic bend-over-sheave tests and their aptitude to increase the strength by thermosetting. Occurring effects are going to be analysed and related to the properties of the yarns. A competitive view on the prices of the yarns regarding their portion of the total costs of rope manufacturing is finalising this work
Castellani, Agnese. "Le fasce di Van Allen." Bachelor's thesis, Alma Mater Studiorum - Università di Bologna, 2019. http://amslaurea.unibo.it/18745/.
Full textFürst, Andreas. "Laserstrahlschneiden von Faser-Kunststoff-Verbunden." Doctoral thesis, Saechsische Landesbibliothek- Staats- und Universitaetsbibliothek Dresden, 2017. http://nbn-resolving.de/urn:nbn:de:bsz:14-qucosa-225030.
Full textNilsson, Anders. "WebADmin : a faster way to administrate active directory." Thesis, University West, Department of Informatics and Mathematics, 2003. http://urn.kb.se/resolve?urn=urn:nbn:se:hv:diva-654.
Full textau, R. Doupe@murdoch edu, and Robert Gerard Doupe. "Selection for faster growing black bream Acanthopagrus butcheri." Murdoch University, 2004. http://wwwlib.murdoch.edu.au/adt/browse/view/adt-MU20040901.133809.
Full textDoupe, Robert Gerard. "Selection for faster growing black bream Acanthopagrus butcheri." Doupe, Robert Gerard (2004) Selection for faster growing black bream Acanthopagrus butcheri. PhD thesis, Murdoch University, 2004. http://researchrepository.murdoch.edu.au/25/.
Full textDoupé, Robert G. "Selection for faster growing black bream Acanthopagrus butcheri /." Access via Murdoch University Digital Theses Project, 2004. http://wwwlib.murdoch.edu.au/adt/browse/view/adt-MU20040901.133809.
Full textFergusson, Emma J. ""Going faster than speed" : Leigh Davis, 1983-1985." Thesis, University of Canterbury. English, 2003. http://hdl.handle.net/10092/7055.
Full textMatheson, Troy. "Why does Australia grow faster than New Zealand?" Thesis, University of Canterbury. Department of Economics, 2002. http://hdl.handle.net/10092/4312.
Full textKogel, Wendy E. "Faster Training of Neural Networks for Recommender Systems." Digital WPI, 2002. https://digitalcommons.wpi.edu/etd-theses/607.
Full textGalvin, Timothy Matthew. "Faster streaming algorithms for low-rank matrix approximations." Thesis, Massachusetts Institute of Technology, 2014. http://hdl.handle.net/1721.1/91810.
Full textCataloged from PDF version of thesis.
Includes bibliographical references (pages 53-55).
Low-rank matrix approximations are used in a significant number of applications. We present new algorithms for generating such approximations in a streaming fashion that expand upon recently discovered matrix sketching techniques. We test our approaches on real and synthetic data to explore runtime and accuracy performance. We apply our algorithms to the technique of Latent Semantic Indexing on a widely studied data set. We find our algorithms provide strong empirical results.
by Timothy Matthew Galvin.
M. Eng.
Rhee, Donguk. "Faster fully polynomial approximation schemes for Knapsack problems." Thesis, Massachusetts Institute of Technology, 2015. http://hdl.handle.net/1721.1/98564.
Full textThis 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 (pages 61-62).
A fully polynomial time approximation scheme (FPTAS) is an algorithm that returns ... -optimal solution to a maximization problem of size n, which runs in polynomial time in both ... We develop faster FPTASs for several classes of knapsack problems. In this thesis, we will first survey the relevant literature in FPTASs for knapsack problems. We propose the use of floating point arithmetic rather than the use of geometric rounding in order to simplify analysis. Given a knapsack problem that yield an ... -optimal solution for disjoint subsets S and T of decision variables, we show how to attain ... -optimal solution for the knapsack problem for the set ... We use this procedure to speed up the run-time of FPTASs for: 1. The Integer Knapsack Problem, 2. The Unbounded Integer Knapsack Problem, 3. The Multiple-Choice Knapsack Problem, and, 4. The Nonlinear Integer Knapsack Problem, Using addition ideas, we develop a fast fully polynomial time randomized approximation scheme (FPTAS) for the 0-1 Knapsack Problem, which has the run-time of ...
by Donguk Rhee.
S.M.
Silva, Filho José Grimaldo da. "Multiscale spectral residue for faster image object detection." reponame:Repositório Institucional da UFBA, 2013. http://www.repositorio.ufba.br/ri/handle/ri/13203.
Full textApproved for entry into archive by LIVIA FREITAS(livia.freitas@ufba.br) on 2013-10-11T19:14:00Z (GMT) No. of bitstreams: 1 dissertacao_mestrado_jose-grimaldo.pdf: 19406681 bytes, checksum: d108855fa0fb0d44ee5d1cb59579a04c (MD5)
Made available in DSpace on 2013-10-11T19:14:00Z (GMT). No. of bitstreams: 1 dissertacao_mestrado_jose-grimaldo.pdf: 19406681 bytes, checksum: d108855fa0fb0d44ee5d1cb59579a04c (MD5)
Accuracy in image object detection has been usually achieved at the expense of much computational load. Therefore a trade-o between detection performance and fast execution commonly represents the ultimate goal of an object detector in real life applications. Most images are composed of non-trivial amounts of background nformation, such as sky, ground and water. In this sense, using an object detector against a recurring background pattern can require a signi cant amount of the total processing time. To alleviate this problem, search space reduction methods can help focusing the detection procedure on more distinctive image regions. Among the several approaches for search space reduction, we explored saliency information to organize regions based on their probability of containing objects. Saliency detectors are capable of pinpointing regions which generate stronger visual stimuli based solely on information extracted from the image. The fact that saliency methods do not require prior training is an important bene t, which allows application of these techniques in a broad range of machine vision domains. We propose a novel method toward the goal of faster object detectors. The proposed method was grounded on a multi-scale spectral residue (MSR) analysis using saliency detection. For better search space reduction, our method enables ne control of search scale, more robustness to variations on saliency intensity along an object length and also a direct way to control the balance between search space reduction and false negatives caused by region selection. Compared to a regular sliding window search over the images, in our experiments, MSR was able to reduce by 75% (in average) the number of windows to be evaluated by an object detector while improving or at least maintaining detector ROC performance. The proposed method was thoroughly evaluated over a subset of LabelMe dataset (person images), improving detection performance in most cases. This evaluation was done comparing object detection performance against di erent object detectors, with and without MSR. Additionally, we also provide evaluation of how di erent object classes interact with MSR, which was done using Pascal VOC 2007 dataset. Finally, tests made showed that window selection performance of MSR has a good scalability with regard to image size. From the obtained data, our conclusion is that MSR can provide substantial bene ts to existing sliding window detectors.
Salvador
Silva, Filho Jose Grimaldo da. "Multiscale Spectral Residue for Faster Image Object Detection." Escola Politécnica / Instituto de Matemática, 2013. http://repositorio.ufba.br/ri/handle/ri/21340.
Full textApproved for entry into archive by Vanessa Reis (vanessa.jamile@ufba.br) on 2017-02-07T11:51:58Z (GMT) No. of bitstreams: 1 dissertacao_mestrado_jose-grimaldo.pdf: 19406681 bytes, checksum: d108855fa0fb0d44ee5d1cb59579a04c (MD5)
Made available in DSpace on 2017-02-07T11:51:58Z (GMT). No. of bitstreams: 1 dissertacao_mestrado_jose-grimaldo.pdf: 19406681 bytes, checksum: d108855fa0fb0d44ee5d1cb59579a04c (MD5)
Accuracy in image object detection has been usually achieved at the expense of much computational load. Therefore a trade-o between detection performance and fast execution commonly represents the ultimate goal of an object detector in real life applications. Most images are composed of non-trivial amounts of background information, such as sky, ground and water. In this sense, using an object detector against a recurring background pattern can require a signi cant amount of the total processing time. To alleviate this problem, search space reduction methods can help focusing the detection procedure on more distinctive image regions.
Among the several approaches for search space reduction, we explored saliency information to organize regions based on their probability of containing objects. Saliency detectors are capable of pinpointing regions which generate stronger visual stimuli based solely on information extracted from the image. The fact that saliency methods do not require prior training is an important benefit, which allows application of these techniques in a broad range of machine vision domains. We propose a novel method toward the goal of faster object detectors. The proposed method was grounded on a multi-scale spectral residue (MSR) analysis using saliency detection. For better search space reduction, our method enables fine control of search scale, more robustness to variations on saliency intensity along an object length and also a direct way to control the balance between search space reduction and false negatives caused by region selection. Compared to a regular sliding window search over the images, in our experiments, MSR was able to reduce by 75% (in average) the number of windows to be evaluated by an object detector while improving or at least maintaining detector ROC performance. The proposed method was thoroughly evaluated over a subset of LabelMe dataset (person images), improving detection performance in most cases. This evaluation was done comparing object detection performance against different object detectors, with and without MSR. Additionally, we also provide evaluation of how different object classes interact with MSR, which was done using Pascal VOC 2007 dataset. Finally, tests made showed that window selection performance of MSR has a good scalability with regard to image size. From the obtained data, our conclusion is that MSR can provide substantial benefits to existing sliding window detectors