Log in

Relevant bibliographies by topics / PolyTox / Dissertations / Theses

To see the other types of publications on this topic, follow the link: PolyTox.

Dissertations / Theses on the topic 'PolyTox'

Author: Grafiati

Published: 4 June 2021

Last updated: 1 February 2022

Create a spot-on reference in APA, MLA, Chicago, Harvard, and other styles

Select a source type:

Consult the top 50 dissertations / theses for your research on the topic 'PolyTox.'

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.

1

Salgueiro, Sérgio. "Estudo ecotoxicológico de afluentes e efluentes do sistema de tratamento biológico da ETAR de Frielas." Master's thesis, Escola Superior de Tecnologia do Instituto Politécnico de Setúbal, 2012. http://hdl.handle.net/10400.26/3854.

Full text

Abstract:

Mestrado em Tecnologia Ambiental
O Estudo sobre afluentes e efluentes da ETAR de Frielas integrou testes ecotoxicológicos e parâmetros físico-químicos relevantes para o tratamento biológico, para avaliar o impacto da toxicidade no processo de lamas ativadas. Nos testes PolyTox, os afluentes urbanos (la Campanha) apresentaram maior potencial de efeitos tóxicos do que os afluentes industriais (2' Campanha). A evolução da toxicidade afluente ao processo de lamas activadas acompanhou a evolução da qualidade do efluente tratado. A avaliação do potencial tóxico de amostras de afluentes e efluentes para o meio receptor a jusante da ETAR, através de bioensaios qualitativos com D. magna, mostrou que o Interceptor do Rio da Costa apresentou maior potencial tóxico do que o Emissário da E.N.8. O potencial tóxico de amostras do Efluente da Decantação Secundária releva a importância do pré-tratamento de efluentes industriais previamente à descarga na rede. A modelação QSAR de compostos orgânicos identificados nos afluentes revelou 17 compostos tóxicos e/ou persistentes, potencialmente danosos para o meio hídrico receptor a jusante da ETAR. Os testes ecotoxicológicos mostraram ser um complemento valioso para as ETAR na monitorização de afluentes complexos e permitem apoiar a tomada de decisão com vista à protecção dos sistemas de tratamento e dos meios receptores.

APA, Harvard, Vancouver, ISO, and other styles

2

Herrmann, Sven. "Splits and tight spans of convex polytopes." München Verl. Dr. Hut, 2009. http://d-nb.info/993259189/04.

Full text

APA, Harvard, Vancouver, ISO, and other styles

3

Jahrl, Timmy. "Ringar, Euklides och polynom : Från ring till polynom." Thesis, Örebro universitet, Institutionen för naturvetenskap och teknik, 2014. http://urn.kb.se/resolve?urn=urn:nbn:se:oru:diva-39674.

Full text

Abstract:

Heltalen och polynom tycks ha flera gemensamma egenskaper. En av heltalens egenskaper är aritmetikens fundamentalsats som säger att alla heltal kan skrivas som en produkt av primtal. Polynomen har en motsvarande egenskap, faktorsatsen, som innebär att varje polynom kan skrivas som en produkt av rotfaktorer. Denna och flera andra egenskaper som heltal och polynom har som motsvarar varandra beror inte på en slump utan på att de är besläktade. Egenskaper hos många välanvända mängder, de reella talen, de rationella talen samt heltalen kan beskrivas med gruppteori. Dessa egenskaper gäller endast över en binär operation men många intressanta och användbara egenskaper kräver två operationer. Inom denna uppsats undersöks den algebraiska strukturen ringar där många egenskaper som tas för givet beror på speciella egenskaper och därmed inte alltid finns närvarande. Efteråt studeras en speciell typ av ring kallad Euklidiska domän. Där många egenskaper som tillhör heltalen existerar i generaliserade former inom denna ring. Detta kapitel innehåller bevis som har generaliserats. Även polynomens struktur studeras och visar sig vara en Euklidisk domän. I studien används ett annat tillvägagångsätt än den traditionella där det bevisas genom idealer och PID. Uppsatsen avslutas med en kort studie av flervariabelpolynom där de egna bevisen finns varvid det ses att flervariabelpolynom med samma mängdvariabler är isomorfa.

APA, Harvard, Vancouver, ISO, and other styles

4

Kubica, Matěj. "Optický polygon." Master's thesis, Vysoké učení technické v Brně. Fakulta elektrotechniky a komunikačních technologií, 2021. http://www.nusl.cz/ntk/nusl-442372.

Full text

Abstract:

Diploma thesis focuses on a problematics of an optical networks in terms of an optical cables laying and a work with individual fibers. Thesis contains an basic physical properties which are used in a fiber optics. Methodology of correct working procedures used in fiber optics is discussed at the same time. Thesis also contains detailed documentation of realized optical connections including scheme of realized outdoor connection. 3D design of an rack case is also part of the thesis. Rack case provides an option to simulate plenty of different lengths of optical routes. Rack case is designed in 6U variant.

APA, Harvard, Vancouver, ISO, and other styles

5

Möller, Marco. "Vierdimensionale archimedische Polytope." [S.l. : s.n.], 2004. http://deposit.ddb.de/cgi-bin/dokserv?idn=972150285.

Full text

APA, Harvard, Vancouver, ISO, and other styles

6

Pfeifle, Julian. "Extremal constructions for polytopes and spheres." [S.l.] : [s.n.], 2003. http://deposit.ddb.de/cgi-bin/dokserv?idn=96753285X.

Full text

APA, Harvard, Vancouver, ISO, and other styles

7

Funke, Florian [Verfasser]. "The L²-Torsion Polytope of Groups and the Integral Polytope Group / Florian Funke." Bonn : Universitäts- und Landesbibliothek Bonn, 2018. http://d-nb.info/1153466996/34.

Full text

APA, Harvard, Vancouver, ISO, and other styles

8

Decker, Torsten. "Das verallgemeinerte Dale-Polytop und Anwendungen in linearen Programmen." Berlin VWF, 2006. http://d-nb.info/988283786/04.

Full text

Abstract:

Zugl.: Berlin, Humboldt-Univ., Diss., 2006 u.d.T.: Decker, Torsten: Die Charakterisierung des verallgemeinerten Dale-Polytops und ihre Verwendung in linearen Programmen zur Lösung von Austrittszeit-, Stopp- und anderen Optimierungsproblemen

APA, Harvard, Vancouver, ISO, and other styles

9

Decker, Torsten. "Das verallgemeinerte Dale-Polytop und Anwendungen in linearen Programmen /." Berlin : VWF, 2007. http://d-nb.info/988283786/04.

Full text

Abstract:

Humboldt-Univ., Diss u.d.T.: Decker, Torsten: Die Charakterisierung des verallgemeinerten Dale-Polytops und ihre Verwendung in linearen Programmen zur Lösung von Austrittszeit-, Stopp- und anderen Optimierungsproblemen--Berlin, 2006.

APA, Harvard, Vancouver, ISO, and other styles

10

LINDMARK, JONAS. "No Fit Polygon problem : Developing a complete solution to the No Fit Polygon problem." Thesis, KTH, Skolan för datavetenskap och kommunikation (CSC), 2013. http://urn.kb.se/resolve?urn=urn:nbn:se:kth:diva-142353.

Full text

Abstract:

This thesis evaluates some of the most recent and promising approaches for deriving the No Fit Polygon for two simple polygons, possibly with holes, and verify that the approach works in practice. We have chosen three different approaches based on the complexity of the input. These approaches were implemented and benchmarked against CGAL [1], a third party library which provides solvers for many computational geometry problems. Our solution solves problems of a higher degree of complexity than that of the library we benchmarked against and for input of lower complexity we solve the problem in a more efficient manner.
Den här uppsatsen evaluerar några av de senaste och mest lovande tillvägagånssätt för att generera No Fit - polygonen för två enkla polygoner, med och utan hål, och verifiera att de fungerar i praktiken. Vi har valt tre olika tillvägagångssätt baserat på komplexiteten av indata. Dessa tillvägagångssätt implementerades och jämfördes med CGAL [1], ett tredjepartsbibliotek som tillhandahåller lösare av många beräkningsgeometriska problem. Vår lösning klarar problem av en högre grad av komplexitet än tredjepartsbiblioteket vi jämför med. För indata av lägre komplexitetsnivåer löser vi problemet mer effektivt.

APA, Harvard, Vancouver, ISO, and other styles

11

Jackson, LillAnne Elaine, and University of Lethbridge Faculty of Arts and Science. "Polygon reconstruction from visibility information." Thesis, Lethbridge, Alta. : University of Lethbridge, Faculty of Arts and Science, 1996, 1996. http://hdl.handle.net/10133/41.

Full text

Abstract:

Reconstruction results attempt to rebuild polygons from visibility information. Reconstruction of a general polygon from its visibility graph is still open and only known to be in PSPACE; thus additional information, such as the ordering of the edges around nodes that corresponds to the order of the visibilities around vertices is frequently added. The first section of this thesis extracts, in o(E) time, the Hamiltonian cycle that corresponds to the boundary of the polygon from the polygon's ordered visibility graph. Also, it converts an unordered visibility graph and Hamiltonian cycle to the ordered visibility graph for that polygon in O(E) time. The secod, and major result is an algorithm to reconstruct an arthogonal polygon that is consistent with the Hamiltonian cylce and visibility stabs of the sides of an unknown polygon. The algorithm uses O(nlogn) time, assuming there are no collinear sides, and )(n2) time otherwise.
vii, 78 leaves ; 28 cm.

APA, Harvard, Vancouver, ISO, and other styles

12

Li, Nan Ph D. Massachusetts Institute of Technology. "Combinatorial aspects of polytope slices." Thesis, Massachusetts Institute of Technology, 2013. http://hdl.handle.net/1721.1/82441.

Full text

Abstract:

Thesis (Ph. D.)--Massachusetts Institute of Technology, Dept. of Mathematics, 2013.
Cataloged from PDF version of thesis.
Includes bibliographical references (pages 69-70).
We studies two examples of polytope slices, hypersimplices as slices of hypercubes and edge polytopes. For hypersimplices, the main result is a proof of a conjecture by R. Stanley which gives an interpretation of the Ehrhart h*-vector in terms of descents and excedances. Our proof is geometric using a careful book-keeping of a shelling of a unimodular triangulation. We generalize this result to other closely related polytopes. We next study slices of edge polytopes. Let G be a finite connected simple graph with d vertices and let PG C Rd be the edge polytope of G. We call PG decomposable if PG decomposes into integral polytopes PG+ and PG- via a hyperplane, and we give an algorithm which determines the decomposability of an edge polytope. Based on a sequence of papers by Ohsugi and Hibi, we prove that when PG is decomposable, PG is normal if and only if both PG+ and PG- are normal. We also study toric ideals of PG, PG+ and PG-. This part is joint work with Hibi and Zhang.
by Nan Li.
Ph.D.

APA, Harvard, Vancouver, ISO, and other styles

13

Eldridge, Matthew Willard. "SIMD column-parallel polygon rendering." Thesis, Massachusetts Institute of Technology, 1995. http://hdl.handle.net/1721.1/38742.

Full text

Abstract:

Thesis (M.S.)--Massachusetts Institute of Technology, Dept. of Electrical Engineering and Computer Science, 1995.
Includes bibliographical references (p. 171-173).
by Matthew Willard Eldridge.
M.S.

APA, Harvard, Vancouver, ISO, and other styles

14

Klint, Ludvig. "Polypop : Polyrytmik i modern populärmusik." Thesis, Kungl. Musikhögskolan, Institutionen för musik- och medieproduktion, 2018. http://urn.kb.se/resolve?urn=urn:nbn:se:kmh:diva-2818.

Full text

Abstract:

I detta självständiga arbete undersöks hur polyrytmik kan användas i en populärmusikalisk kontext. Syftet med den här studien är att undersöka hur polyrytmik kan användas som grund för att skapa poplåtar. I inledningen presenteras ett antal exempel på hur polyrytmik förekommer i olika genrer. Metal och Jazz tas upp som exempel på musikaliskt avancerade genrer där polyrytmik är vanligt förekommande. Vidare problematiseras hur polyrytmen 4:3 fått ett stort genomslag i populärmusiken, medan andra polyrytmer ignoreras. I metodavsnittet redogörs för hur samplingar och programmerad musik användes i arbetet för att behålla fokus på det rytmiska. Resultatet av denna studie är den klingande delen av det här arbetet som består av sex stycken/låtar av popkaraktär som var och en bygger på en unik polyrytm. Två låtar innehåller sång och text, resterande är instrumentala stycken. Reflektioner som framkommer av resultatet är bland annat hur tempon påverkar om en polyrytm upplevs som musikalisk eller inte.
In this study polyrhythms are examined as a way of writing pop songs. The purpose of the study is to research how polyrhythms can be used to create music productions in the context of popular music. As an introduction a few examples are given as to how polyrhythms appear in different genres of music. Metal and Jazz are both examples of musically advanced genres which are known to use polyrhythms. The Polyrhythm 4:3 is presented as the most common polyrhythm appearing in pop music, while other polyrhythms are left unused. In the Method chapter the use of sampling and music programming in this study is described, and why this was the preferred method over live musicians and acoustic recordings. The result of this study is the sounding material i.e. the pieces of music that was created as a part of this thesis. A total of six songs were written, two songs include vocals and lyrics while the remaining four are instrumental tracks. Important reflections include the aspect of tempo, and how it changes whether polyrhythms are perceived as musical or understandable, in my opinion.

APA, Harvard, Vancouver, ISO, and other styles

15

Boland, Ralph Patrick. "Polygon visibility decompositions with applications." Thesis, University of Ottawa (Canada), 2002. http://hdl.handle.net/10393/6244.

Full text

Abstract:

Many problems in Computational Geometry involve a simple polygon P and a family of geometric objects, say sigma, contained in P. For example, if sigma is the family of chords of P then we may want to find the longest chord in P. Alternatively, given a chord of P, we may wish to determine the areas of the two subpolygons of P determined by the chord. Let pi be a polygonal decomposition of a polygon P. We call pi a visibility decomposition with respect to sigma if, for any object g ∈ sigma, we can cover g with o(|P|) of the subpolygons of pi. We investigate the application of visibility decompositions of polygons to solving problems of the forms described. Any visibility decomposition pi of a polygon P that we construct will have the property that, for some class of polygons ℘ where the polygons in ℘ have useful properties, pi ⊆ ℘. Furthermore, the properties of ℘ will be key to solving any problems we solve on P using pi. Some of the visibility decomposition classes we investigate are already known in the literature, for example weakly edge visible polygon decompositions. We make improvements relating to these decomposition classes and in some cases we also find new applications for them. We also develop several new polygon visibility decomposition classes. We then use these decomposition classes to solve a number of problems on polygons including the circular ray shooting problem and the largest axis-aligned rectangle problem. It is noteworthy that the solutions to problems that we provide are usually more efficient and always simpler than alternative solutions.

APA, Harvard, Vancouver, ISO, and other styles

16

Flaaten, Marcus. "Efficient polygon reduction in Maya." Thesis, Linköpings universitet, Medie- och Informationsteknik, 2015. http://urn.kb.se/resolve?urn=urn:nbn:se:liu:diva-121687.

Full text

Abstract:

Reducing the number of vertices in a mesh is a problem that if solved correctly can save the user a lot of time in the entire process of handling the model. Most of the solutions today are focused on reducing the mesh in one big step by running a separate application. The goal of this implementation is to bring the reduction application into the users workspace as a plugin. Many of the modellers in the various computer graphics industries use Autodesk Maya the plugins intention is to create a efficient tool which also give the modellers as much freedom as possible without the need to ever leave Mayas workspace. During the process the possible issues and solutions of creating this tool in Maya will also examined to help introduce the process of creating a tool for Maya. This plugin has the potential to improve on the existing reduction tool in Maya by giving the user more options and a more exact solution.

APA, Harvard, Vancouver, ISO, and other styles

17

Krocak, Makenzie, Sean Ernst, Jinan Allan, Wesley Wehde, Joseph Ripberger, Carol Silva, and Hank Jenkins-Smith. "Thinking Outside the Polygon: A Study of Tornado Warning Perception Outside of Warning Polygon Bounds." Digital Commons @ East Tennessee State University, 2020. https://dc.etsu.edu/etsu-works/7865.

Full text

Abstract:

When the National Weather Service (NWS) issues a tornado warning, the alert is rapidly and widely disseminated to individuals in the general area of the warning. Historically, the assumption has been that a false-negative warning perception (i.e., when someone located within a warning polygon does not believe they have received a tornado warning) carries a higher cost than a false-positive warning perception (i.e., when someone located outside the warning area believes they have received a warning). While many studies investigate tornado warning false alarms (i.e., when the NWS issues a tornado warning, but a tornado does not actually occur), less work focuses on studying individuals outside of the warning polygon bounds who believe they received a warning (i.e., false-positive perceptions). This work attempts to quantify the occurrence of false-positive perceptions and possible factors associated with the rate of occurrence. Following two separate storm events, Oklahomans were asked whether they perceived a tornado warning. Their geolocated responses were then compared to issued warning polygons. Individuals closer to tornado warnings or within a different type of warning (e.g., a severe thunderstorm warning) are more likely to report a false-positive perception than those farther away or outside of other hazard warnings. Further work is needed to understand the rate of false-positive perceptions across different hazards and how this may influence warning response and trust in the National Weather Service.

APA, Harvard, Vancouver, ISO, and other styles

18

Wildt, Daniël de. "Automatic video segmentation by polygon evolution." [S.l.] : [s.n.], 2006. http://deposit.ddb.de/cgi-bin/dokserv?idn=978906063.

Full text

APA, Harvard, Vancouver, ISO, and other styles

19

Lessard, Dominic. "Optimal polygon placement on a grid." Thesis, National Library of Canada = Bibliothèque nationale du Canada, 2000. http://www.collectionscanada.ca/obj/s4/f2/dsk1/tape3/PQDD_0028/MQ52380.pdf.

Full text

APA, Harvard, Vancouver, ISO, and other styles

20

Lessard, Dominic Carleton University Dissertation Computer Science. "Optimal polygon placement on a grid." Ottawa, 2000.

Find full text

APA, Harvard, Vancouver, ISO, and other styles

21

Širjov, Jakub. "Testovací polygon pro kvantovou distribuci klíčů." Master's thesis, Vysoké učení technické v Brně. Fakulta elektrotechniky a komunikačních technologií, 2021. http://www.nusl.cz/ntk/nusl-442371.

Full text

Abstract:

The aim of this masters thesis is to explain quantum key distribution (QKD) and principle of signal transmission in the quantum channel. Further this thesis complains commercial distributors of QKD technologies and their individual appliances. Practical part of the thesis is separated to 3 parts. First part handles transmission of quantum keys in QKDNetsim simulator. Second part takes care of design and creation of a test polygon that allows for testing of many optical network configurations with quantum signal and normal data traffic being transmitted in a single fiber. Multiple simulations of use of various filter types to supress the signal noise in the program VPIphotonics and tested by QKDNetsim are shown in the last part of this thesis.

APA, Harvard, Vancouver, ISO, and other styles

22

Kreykenbohm, Michael Walter. "Replication patterns for polygon fill algorithms." Thesis, University of British Columbia, 1988. http://hdl.handle.net/2429/27974.

Full text

Abstract:

This thesis describes and compares several methods for producing bilevel patterns to simulate grey level values for use in polygon regions as generated for computer graphics. Random distribution, ordered dither, and error diffusion methods are shown to be visually inferior for many grey levels to the proposed maxmin algorithm for producing patterns for polygon area filling procedures. Through even spatial arrangement of the pixels and taking into consideration the edges of the pattern, the number of artifacts is decreased and the accuracy in small subregions of the pattern is improved, especially at low grey levels where most pattern generators degrade. At these lower levels, the maxmin algorithm can produce pleasing patterns if given sufficient flexibility through enlarged grid sizes. At higher grey levels, the proximity of pixels does not leave sufficient room to eliminate all artifacts, but by varying the criteria of the algorithm, the patterns still appear more pleasing than other methods.
Science, Faculty of
Computer Science, Department of
Graduate

APA, Harvard, Vancouver, ISO, and other styles

23

Mbakop, Guy Merlin. "Effiziente Lösung reeller polynomialer Gleichungssysteme." [S.l. : s.n.], 1999. http://deposit.ddb.de/cgi-bin/dokserv?idn=958731624.

Full text

APA, Harvard, Vancouver, ISO, and other styles

24

Wang, Qingda. "Facility location constrained to a simple polygon." Thesis, National Library of Canada = Bibliothèque nationale du Canada, 2001. http://www.collectionscanada.ca/obj/s4/f2/dsk3/ftp04/mq61034.pdf.

Full text

APA, Harvard, Vancouver, ISO, and other styles

25

Manning, James David. "Directional diffuse reflection from a polygon emitter." Thesis, University of Hull, 2007. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.445284.

Full text

APA, Harvard, Vancouver, ISO, and other styles

26

Hofmann, Jan [Verfasser]. "Three interesting lattice polytope problems / Jan Hofmann." Berlin : Freie Universität Berlin, 2018. http://d-nb.info/1153008092/34.

Full text

APA, Harvard, Vancouver, ISO, and other styles

27

Woodberry, Tonia. "Development of a mucosal HIV polytope vaccine /." [St. Lucia, Qld.], 2001. http://www.library.uq.edu.au/pdfserve.php?image=thesisabs/absthe16255.pdf.

Full text

APA, Harvard, Vancouver, ISO, and other styles

28

Shu, Felix Che. "The growth rate of random polynomials defined by a random difference equation." [S.l.] : [s.n.], 2000. http://edocs.tu-berlin.de/diss/2000/shu_felix.pdf.

Full text

APA, Harvard, Vancouver, ISO, and other styles

29

Rupprecht, Christopher. "Cohomological invariants for higher degree forms." [S.l. : s.n.], 2003. http://deposit.ddb.de/cgi-bin/dokserv?idn=968328172.

Full text

APA, Harvard, Vancouver, ISO, and other styles

30

Rößler, Jens [Verfasser], and Thomas [Akademischer Betreuer] Höfer. "Applications of Polylox barcoding to the hematopoietic system / Jens Rößler ; Betreuer: Thomas Höfer." Heidelberg : Universitätsbibliothek Heidelberg, 2020. http://d-nb.info/1217163824/34.

Full text

APA, Harvard, Vancouver, ISO, and other styles

31

Colleu, Thomas. "A floating polygon soup representation for 3D video." Phd thesis, Université Rennes 1, 2010. http://tel.archives-ouvertes.fr/tel-00592207.

Full text

Abstract:

Cette thèse présente une nouvelle représentation appeléesoupe de polygones déformables pour les applications telles que 3DTV et FTV (Free Viewpoint TV). La soupe de polygones prend en compte les problèmes de compacité, efficacité de compression, et synthèse de vue. Les polygones sont définis en 2D avec des valeurs de profondeurs à chaque coin. Ils ne sont pas nécessairement connectés entre eux et peuvent se déformer en fonction du point de vue et de l'instant dans la séquence vidéo. A partir de données multi-vues plus profondeur (MVD), la construction tient en deux étapes: la décomposition en quadtree et la réduction des redondances inter-vues. Un ensemble compact de polygones est obtenu à la place des cartes de profondeur, tout en préservant les discontinuités de profondeurs et les détails géométriques. Ensuite, l'efficacité de compression et la qualité de synthèse de vue sont évaluées. Des méthodes classiques comme l'\emph{inpainting} et des post-traitements sont implémentées et adaptées à la soupe de polygones. Une nouvelle méthode de compression est proposée. Elle exploite la structure en quadtree et la prédiction spatiale. Les résultats sont comparés à un schéma de compression MVD utilisant le standard MPEG H.264/MVC. Des valeurs de PSNR légèrement supérieures sont obtenues à moyens et hauts débits, et les effets fantômes sont largement réduits. Enfin, la soupe de polygone est déformée en fonction du point de vue désiré. Cette géométrie dépendante du point de vue est guidée par l'estimation du mouvement entre les vues synthétisées et originales. Cela réduit les artefacts restants et améliore la qualité d'image.

APA, Harvard, Vancouver, ISO, and other styles

32

Nilson, Tomas. "Diskret analys : En studie av polynom och talföljder." Thesis, Mittuniversitetet, Institutionen för teknik, fysik och matematik, 2002. http://urn.kb.se/resolve?urn=urn:nbn:se:miun:diva-8311.

Full text

APA, Harvard, Vancouver, ISO, and other styles

33

Altman, Irida. "On some properties of the sutured Floer polytope." Thesis, University of Warwick, 2013. http://wrap.warwick.ac.uk/55740/.

Full text

Abstract:

Each chapter of this thesis is a self-contained article on sutured Floer homology. Chapter 1: This article is a purely expository introduction to sutured Floer homology for graduate students in geometry and topology. The article contains most of the things the author wishes she had known when she started her journey into the world of sutured Floer homology. It is divided into three parts. The first part is an introductory level exposition of Lagrangian Floer homology. The second part is a construction of Heegaard Floer homology as a special, and slightly modified, case of Lagrangian Floer homology. The third part covers the background on sutured manifolds, the definition of sutured Floer homology, as well as a discussion of its most basic properties and implications (it detects the product, behaves nicely under surface decompositions, defines an asymmetric polytope, its Euler characteristic is computable using Fox calculus). Chapter 2: We exhibit the first example of a knot K in the three-sphere with a pair of minimal genus Seifert surfaces R1 and R2 that can be distinguished using the sutured Floer homology of their complementary manifolds together with the Spinc-grading. This answers a question of Juh´asz. More precisely, we show that the Euler characteristic of the sutured Floer homology distinguishes between R1 and R2, as does the sutured Floer polytope introduced by Juh´asz. Actually, we exhibit an infinite family of knots with pairs of Seifert surfaces that can be distinguished by the Euler characteristic. Chapter 3: For closed 3-manifolds, Heegaard Floer homology is related to the Thurston norm through results due to Ozsv´ath and Szab´o, Ni, and Hedden. For example, given a closed 3-manifold Y , there is a bijection between vertices of the HF+(Y ) polytope carrying the group Z and the faces of the Thurston norm unit ball that correspond to fibrations of Y over the unit circle. Moreover, the Thurston norm unit ball of Y is dual to the polytope of dHF(Y ). We prove a similar bijection and duality result for a class of 3-manifolds with boundary called sutured manifolds. A sutured manifold is essentially a cobordism between two possibly disconnected surfaces with boundary R+ and R−. We show that there is a bijection between vertices of the sutured Floer polytope carrying the group Z and equivalence classes of taut depth one foliations that form the foliation cones of Cantwell and Conlon. Moreover, we show that a function defined by Juh´asz, which we call the geometric sutured function, is analogous to the Thurston norm in this context. In some cases, this function is an asymmetric norm and our duality result is that appropriate faces of this norm’s unit ball subtend the foliation cones. An important step in our work is the following fact: a sutured manifold admits a fibration or a taut depth one foliation whose sole compact leaves are exactly the connected components of R+ and R−, if and only if, there is a surface decomposition of the sutured manifold resulting in a connected product manifold.

APA, Harvard, Vancouver, ISO, and other styles

34

Schwarze, Michael. "Generische Wahrheit : höfischer Polylog im Werk Jean Froissarts /." Stuttgart : F. Steiner, 2003. http://catalogue.bnf.fr/ark:/12148/cb412914783.

Full text

APA, Harvard, Vancouver, ISO, and other styles

35

Galanda, Martin. "Automated polygon generalization in a multi agent system /." [S.l.] : [s.n.], 2003. http://opac.nebis.ch:80/F/?func=service&doc_library=EBI01&doc_number=004623660&line_number=0001&func_code=WEB-FULL&service_type=MEDIA.

Full text

APA, Harvard, Vancouver, ISO, and other styles

36

Trhlík, Tomáš. "Návrhové podmínky pro polygon specializovaný na autonomní vozidla." Master's thesis, Vysoké učení technické v Brně. Fakulta stavební, 2019. http://www.nusl.cz/ntk/nusl-392235.

Full text

Abstract:

The aim of this diploma thesis is the research of building polygons for the testing of autonomous vehicles, from the point of view of road technology and also designing aspects. In the thesis are mentioned 9 most important world test polygons and their description of design parameters. There are described particular stages of automation from foreign organizations which are concerned with research and development in the automotive industry. In addition, there are described basic advanced driver assistance systems and connectivity between vehicles and infrastructure. Conclusion also contains the assessment of existing aerodrome test areas for autonomous vehicles.

APA, Harvard, Vancouver, ISO, and other styles

37

Keefe, Logan. "New Facets of the Balanced Minimal Evolution Polytope." University of Akron / OhioLINK, 2016. http://rave.ohiolink.edu/etdc/view?acc_num=akron1462199315.

Full text

APA, Harvard, Vancouver, ISO, and other styles

38

Durell, Cassandra M. "Facets of a Balanced Minimum Evolution Network Polytope." University of Akron / OhioLINK, 2019. http://rave.ohiolink.edu/etdc/view?acc_num=akron1555610317263679.

Full text

APA, Harvard, Vancouver, ISO, and other styles

39

Cockburn, Sally. "On DP-constraints for the Traveling Salesman polytope." Thesis, University of Ottawa (Canada), 2001. http://hdl.handle.net/10393/9349.

Full text

Abstract:

The DP-constraints are a recently defined class of valid inequalities for the Symmetric Traveling Salesman Polytope (STSP) which includes the family of comb constraints. Moreover, there exists a polynomial-time exact separation algorithm for the DP-constraints for points whose support graph is planar. However, while the comb constraints are known to be facet-inducing, the same is not true in general of the DP-constraints. This thesis addresses the question of which DP-constraints are facet-inducing; some sufficient conditions are given for identifying DP-constraints which are not facet-inducing, and a family of facet-inducing DP-constraints, the twisted comb constraints, is described and shown to be distinct from other known families of facet-inducing inequalities. We also present a new formulation of the DP-constraints in terms of tripartitions of the node set, which allows easier recognition of equivalent DP-constraints.

APA, Harvard, Vancouver, ISO, and other styles

40

Rasmus, Siljedahl. "3D Conversion from CAD models to polygon models." Thesis, Linköpings universitet, Institutionen för datavetenskap, 2016. http://urn.kb.se/resolve?urn=urn:nbn:se:liu:diva-129881.

Full text

Abstract:

This thesis describes the design and implementation of an application that converts CAD models into polygon models. When going from CAD models to 3D polygon models a conversion of the file type has to be performed. XperDI uses these polygon models in their tool, called sales configurator, to create a photo realistic environment to be able to have a look at the end product before it is manufactured. Existing tools are difficult to use and is missing features that is important for the Sales Configurator. The purpose of this thesis is to create a proof of concept application that converts CAD models into 3D polygon models. This new lightweight application is a simpler alternative to convert CAD models into polygon models and offers features needed for the intended use of these models, that the alternative products do not offer.

APA, Harvard, Vancouver, ISO, and other styles

41

Gill, Jonna. "The k-assignment Polytope and the Space of Evolutionary Trees." Licentiate thesis, Linköping : Univ, 2004. http://urn.kb.se/resolve?urn=urn:nbn:se:liu:diva-5677.

Full text

APA, Harvard, Vancouver, ISO, and other styles

42

Coskun, Sahin. "Synthesis Of Silver Nanowires Through Polyol Process." Master's thesis, METU, 2012. http://etd.lib.metu.edu.tr/upload/12614158/index.pdf.

Full text

Abstract:

Nanotechnology enabled synthesis of various shapes and morphologies of conventional materials. Nanotubes, nanoparticles, quantum dots and nanowires are the new form of materials. Especially nanowires have gotten great attention due to their unique physical, chemical and optical properties. Superior properties of nanowires are based on their high surface area and two quantum confinement directions. Silver is one of the most conductive metals and it has the highest thermal conductivity. Due to excellent properties of bulk silver its nanostructures especially silver nanowires have been widely studied. Silver nanowires have been demonstrated to be used in optical polarizers, photonic crystals, surface enhanced Raman spectroscopy and recently transparent and conducting electodes. Hence, production of silver nanowires through a cost-effective and well controlled method could make important contributions to these and other unprecedented. So far, many different methods have been explored for the synthesis of silver nanowires. Vapor-liquid-solid (VLS) technique, hard template techniques such as porous anodic alumina synthesis and soft template techniques such as DNA based synthesis and polyol process are some silver nanowire synthesis methods. Among these methods, solution based polyol process is the most feasible one in terms of cost, yield and simplicity. In this thesis, polyol process, which is a novel and solution based method enabling the synthesis of silver nanowires with precise length and diameter control, is investigated. A detailed parametric study resulting in a full control over the resultant nanowire morphology is provided. The parameters affecting the structure have been determined as temperature, injection rate, poly(vinylpyrrolidone):silver nitrate (PVP:AgNO3) molar ratio, sodium chloride (NaCl) amount and stirring rate. The results show that polyol process method could replace the conventional silver nanowire fabrication methods. It was shown that specific nanowire lengths and diameters for any application can be obtained simply by adjusting the parameters of the process.

APA, Harvard, Vancouver, ISO, and other styles

43

Heise, Martin. "Synthese intermetallischer Phasen mittels mikrowellenunterstütztem Polyol-Prozess." Doctoral thesis, Saechsische Landesbibliothek- Staats- und Universitaetsbibliothek Dresden, 2015. http://nbn-resolving.de/urn:nbn:de:bsz:14-qucosa-183425.

Full text

Abstract:

Schon seit dem 17. Jahrhundert ist bekannt, dass kolloidales Gold in wässrigen Lösungen eine rötliche Färbung hervorruft; ein Effekt der direkt aus der Nanostrukturierung des Goldes resultiert. Neben der Modifizierung optischer Eigenschaften können durch Nano- oder Mikrostrukturierung auch andere, neuartige Charakteristika hervorgerufen werden, wie bspw. an Bi3Ni nachgewiesen werden konnte: Mittels mikrowelleninduzierter, reduktiver Umsetzung in Ethylenglykol (mikrowellenunterstützter Polyol-Prozess) konnten submikroskalige Bi3Ni-Stäbchen kristallisiert werden, die in Magnetisierungsmessungen die überaus seltene Koexistenz von Supraleitung und Ferromagnetismus zeigten. Ein Quanteneffekt, der im entsprechenden Volumenmaterial nicht nachgewiesen werden kann und auf spezielle Oberflächenzustände zurückzuführen ist. Durch Nanostrukturierung können außerdem die chemischen Eigenschaften entscheidend beeinflusst werden, wie an BiRh gezeigt werden konnte. Der mikrowellenunterstützte Polyol-Prozess begünstigt hierbei die Kristallisation von pseudohexagonalen Plättchen mit 60 nm Durchmesser und 20 nm Dicke. Im Gegensatz zum Volumenmaterial zeigten diese in der industrierelevanten Semihydrierung von Acetylen zu Ethylen Bestwerte sowohl in Bezug auf den Umsatz als auch die Selektivität. Basierend auf diesen Erkenntnissen sollten mithilfe des mikrowellenunterstützten Polyol-Prozesses im Rahmen der vorliegenden Dissertation nanostrukturierte, intermetallische Verbindungen des Typs M–M‘ (M = Sn, Pb, Sb, Bi; M‘ = Fe, Co, Ni, Cu, Pd, Ir, Pt) hergestellt und eingehend chemisch sowie physikalisch charakterisiert werden. Als Edukte dienten Metallsalze, die stets in Ethylenglykol als primäres Lösungs- und Reduktionsmittel umgesetzt wurden. Das Polyol nimmt zusätzlich als oberflächenaktive Substanz Einfluss auf Partikelgröße und -gestalt. Zur Optimierung der Synthesen und um möglichst viele Phasen zugänglich zu machen, wurden Art und Konzentration der Metallsalze, pH-Wert, Reaktionstemperatur und -zeit variiert sowie die Zugabe von Oleylamin und/oder Ölsäure getestet. Oleylamin und Ölsäure sind ihrerseits oberflächenaktive Substanzen, wobei erstere zugleich reduktiv wirken kann. Die methodeninhärente Nanostrukturierung der Produkte führte teilweise zu bemerkenswerten Effekten in der Phasenbildung sowie Beeinflussung der chemischen Eigenschaften. Nahezu das komplette binäre Phasensystem Bi–Pd konnte durch Optimierung der Syntheseparameter zugänglich gemacht werden. Die Besonderheit hierbei: Neben den Raumtemperaturphasen Bi2Pd, Bi2Pd5 und BiPd3 konnte Bi12Pd31 als Hochtemperaturmodifikation sowie die neue und zugleich metastabile Modifikation gamma-Bi1.0Pd erzeugt und stabilisiert werden. Das im NiAs-Strukturtyp kristallisierende gamma-Bi1.0Pd zeigte in Magnetisierungs- und Widerstandsmessungen Supraleitung unterhalb von 3.2 K. Mittels mikrowellenunterstütztem Polyol-Prozess gelang bereits in eigenen Vorarbeiten die Synthese von nanostrukturiertem Bi3Ir. Die Verbindung ist ausschließlich in nanopartikulärer Form bei Raumtemperatur empfindlich gegenüber molekularem Sauerstoff und bildet im Zuge einer unkonventionellen oxidativen Interkalation das intermetallische Suboxid Bi3IrOx. Dieses Verhalten ist verknüpft mit einer amorphen Hülle um die Bi3Ir-Nanopartikel, da diese zur Aktivierung des molekularen Sauerstoffs benötigt wird. Unter Einsatz von Reduktionsmitteln — z.B. Wasserstoff, Superhydrid®, Hydrazin — ist der Oxidationsprozess für x < 2 vollständig reversibel. Im Rahmen der vorliegenden Arbeit konnten die Erkenntnisse über Bi3Ir und Bi3IrOx vertieft werden: Bi3IrOx konnte als erster Sauerstoffionenleiter bei Raumtemperatur klassifiziert werden, der darüber hinaus metallisch ist. Dies gelang mittels Röntgen- und Elektronenbeugung, hochauflösender Transmissionselektronenmikroskopie, Röntgenphotoelektronenspektroskopie, quantenchemischen Rechnungen, und Experimenten zur Reaktionskinetik. Mit 84 meV ist die Aktivierungsenergie für die Ionenleitung um eine Größenordnung kleiner als in allen konventionellen Sauerstoffionenleitern. Der Diffusionskoeffizient beträgt für 25 °C 1.2·10–22 m2s–1, was in Anbetracht der 10–19 m2s–1 des Yttrium-stabilisierten Zirkoniumoxids (häufig genutztes Referenzmaterial) bei 150 °C wenig erscheint, aber eben schon für Raumtemperatur gilt. Durch den mikrowellenunterstützten Polyol-Prozess konnten erstmals phasenreine, nanostrukturierte Proben von PbPd3, Pd20Sb7, Pd8Sb3, PdSb, Ni5Sb2, und Pd13Sn9 synthetisiert werden sowie alternative Syntheserouten für weitere Phasen (alpha-/beta-/gamma-Bi2Pt, BiPt, NiSb, beta-Ni3Sn2, Pd2Sn, PdSn, Pt3Sn, PtSn, PtPb) ermittelt werden, wobei mehrfach die Bildung von Hochtemperaturphasen beobachtet wurde. Weiterhin konnten einige Grenzen der Methode aufgezeigt werden: Während blei- und bismutreiche Phasen prinzipiell einfach kristallisiert werden können, sind antimon- und zinnreiche Verbindungen mit der Methode kaum erreichbar. Außerdem zeigte sich, dass in den meisten Phasensystemen nur bestimmte Verbindungen angesteuert werden können; die Bildung der intermetallischen Phasen ist häufig die Triebkraft zur Reduktion der Metallkationen. In den Systemen von Co-Sb, Co-Sn und Ir-Sb konnte bisher keine Feststoffbildung beobachtet werden.

APA, Harvard, Vancouver, ISO, and other styles

44

Wiesner, Dirk. "Polynomials in operator space theory /." Tönning ; Lübeck ; Marburg : Der Andere Verl, 2009. http://bvbr.bib-bvb.de:8991/F?func=service&doc_library=BVB01&doc_number=017610887&line_number=0001&func_code=DB_RECORDS&service_type=MEDIA.

Full text

APA, Harvard, Vancouver, ISO, and other styles

45

Willis, Oral R. "Characterizing fluoropolymeric materials for microelectronics and MEMS packaging." Diss., Online access via UMI:, 2007.

Find full text

APA, Harvard, Vancouver, ISO, and other styles

46

Zong, Ruifa. "Molecular polygons self-assembled from conjugated 1,1'-Ferrocenediyl Bridged Bis(pyridines), Bis(2,2'-bipyridines), and Bis(1,10-phenanthrolines) and transition metals as building blocks." [S.l. : s.n.], 2002. http://www.bsz-bw.de/cgi-bin/xvms.cgi?SWB10236414.

Full text

APA, Harvard, Vancouver, ISO, and other styles

47

Wiesner, Dirk. "Polynomials in operator space theory." Tönning Lübeck Marburg Der Andere Verl, 2008. http://d-nb.info/99429770X/04.

Full text

APA, Harvard, Vancouver, ISO, and other styles

48

Wallin, Hanna. "En topologisk representation av en polygon;det rakkantiga skelettet." Thesis, KTH, Skolan för teknikvetenskap (SCI), 2011. http://urn.kb.se/resolve?urn=urn:nbn:se:kth:diva-93303.

Full text

Abstract:

The aim of this thesis project is to produce an algorithm for finding a topologicalrepresentation of a polygon, called a straight skeleton, using floating pointarithmetic. Various straight skeleton algorithms are examined and discussed witha focus on time complexity and one is chosen for implementation. This implementationis then compared with the open source library CGAL with regards torunning time. The result is an algorithm which is based on an algorithm by Felkeland Obdrzalek and which, for polygons with more than five thousand vertices andthree significant digits representing points, runs around 25% faster than CGALsimplementation. Complications regarding the use of floating-point arithmetic arealso discussed.
Syftet med detta examensarbete är att producera en algoritm för att finna entopologisk representation av en polygon, som kallas det rakkantiga skelettet, genomatt använda flyttalsaritmetik. Olika algoritmer diskuteras med avseende främst påtidskomplexitet och en väljs för implementation. Denna implementation jämförssedan med ett öppet källkodsbibliotek, CGAL, med avseende på körtid. Resultatetär en algoritm som är baserad på en algoritm av Felkel och Obdrzalek och som, förpolygoner med fler än fem tusen hörn och tre värdesiffror hos punkter, har ungefär25% snabbare körtid än CGALs implementation. Komplikationer som uppstår pågrund av användandet av flyttalsaritmetik diskuteras också.1

APA, Harvard, Vancouver, ISO, and other styles

49

Gill, Jonna. "The k-assignment polytope, phylogenetic trees, and permutation patterns." Doctoral thesis, Linköpings universitet, Matematik och tillämpad matematik, 2013. http://urn.kb.se/resolve?urn=urn:nbn:se:liu:diva-98263.

Full text

Abstract:

In this thesis three combinatorial problems are studied in four papers. In Paper 1 we study the structure of the k-assignment polytope, whose vertices are the mxn (0,1)-matrices with exactly k 1:s and at most one 1 in each row and each column. This is a natural generalisation of the Birkhoff polytope and many of the known properties of the Birkhoff polytope are generalised. A representation of the faces by certain bipartite graphs is given. This representation is used to describe the properties of the polytope, such as a complete description of the cover relation in the face poset of the polytope and an exact expression for the diameter of its graph. An ear decomposition of these bipartite graphs is constructed. In Paper 2 we investigate the topology and combinatorics of a topological space, called the edge-product space, that is generated by a set of edge-weighted finite semi-labelled trees. This space arises by multiplying the weights of edges on paths in trees, and is closely connected to tree-indexed Markov processes in molecular evolutionary biology. In particular, by considering combinatorial properties of the Tuffley poset of semi-labelled forests, we show that the edge-product space has a regular cell decomposition with face poset equal to the Tuffley poset. The elements of the Tuffley poset are called X-forests, where X is a finite set of labels. A generating function of the X-forests withrespect to natural statistics is studied in Paper 3 and a closed formula is found. In addition, a closed formula for the corresponding generating function of X-trees is found. Singularity analysis is used on these formulas to find asymptotics for the number of components, edges, and unlabelled nodes in X-forests and X-trees as |X| goes towards infinity. In Paper 4 permutation statistics counting occurrences of patterns are studied. Their expected values on a product of t permutations chosen randomly from a subset Γ of Sn, where Γ is a union of conjugacy classes, are considered. Hultman has described a method for computing such an expected value, denoted E(s,t), of a statistic s, when Γ is a union of conjugacy classes of Sn. The only prerequisite is that the mean of s over the conjugacy classes is written as a linear combination of irreducible characters of Sn. Therefore, the main focus of this paper is to express the means of pattern-counting statistics as such linear combinations. A procedure for calculating such expressions for statistics counting occurrences of classical and vincular patterns of length 3 is developed, and is then used to calculate all these expressions.

APA, Harvard, Vancouver, ISO, and other styles

50

Moretti, Antonio Carlos. "A technique for finding the center of a polytope." Diss., Georgia Institute of Technology, 1992. http://hdl.handle.net/1853/24333.

Full text

APA, Harvard, Vancouver, ISO, and other styles

We offer discounts on all premium plans for authors whose works are included in thematic literature selections. Contact us to get a unique promo code!