Dissertations / Theses: 'Polygyni'

1

Hambert, Malin. "”En fru är ett problem, två fruar är två problem” : synen på polygyni bland unga ogifta män i Gambia." Thesis, Stockholm University, Department of Social Work, 2007. http://urn.kb.se/resolve?urn=urn:nbn:se:su:diva-7264.

Full text

Abstract:

Studien syftar till att undersöka attityderna kring polygyni bland unga ogifta män i Gambia. Kvalitativa enskilda intervjuer har utförts på män i landets stadsområden, och svaren har sedan analyserats utifrån ett socialkonstruktivistiskt perspektiv. Resultatet påvisar att polygyni har många negativa aspekter och inte alltid är frivilligt, ens för männen. Det indikerar även att traditionen håller på att avta i landets urbana delar. Attityderna förändras och polygyni anses, av många, vara ett problem mer än ett privilegium. Studien är relevant för socialarbetare och andra yrkesgrupper som arbetar med människor, speciellt de som arbetar internationellt i länder där liknande familjestrukturer är vanliga.

APA, Harvard, Vancouver, ISO, and other styles

2

Burn, Joseph L. "Polygyny and the wren." Thesis, University of Oxford, 1996. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.360161.

Full text

APA, Harvard, Vancouver, ISO, and other styles

3

Mora, Frédéric. "Visibilité polygone à polygone : calcul, représentation, applications." Phd thesis, Université de Poitiers, 2006. http://tel.archives-ouvertes.fr/tel-00090127.

Full text

Abstract:

Cette thèse aborde le problème du calcul et de la représentation de la visibilité mutuelle de polygones. Elle montre tout le potentiel et l'intérêt de cette information pour la résolution de problèmes difficiles en synthèse d'images et en propagation électromagnétique.
Nous proposons un nouvel algorithme pour calculer la visibilité dans l'espace de Plücker, afin de minimiser les coûts en temps et mémoire vis-à-vis des précédentes approches.
En synthèse d'images, nous utilisons l'information ainsi calculée pourproposer une nouvelle solution au calcul analytique des ombres douces en illumination directe. Cette solution concilie la qualité et la rapidité du rendu.
En propagation électromagnétique, nous proposons l'optimisation sans perte d'un modèle basé rayons. Celle-ci permet d'effectuer des simulations dont la précision est optimale tout en s'appliquant à des environnements de tailles significatives.

APA, Harvard, Vancouver, ISO, and other styles

4

Mora, Frédéric. "Visibilité polygone à polygone : calcul, représentation, application." Poitiers, 2006. http://www.theses.fr/2006POIT2292.

Full text

Abstract:

Cette thèse aborde le problème du calcul et de la représentation de la visibilité mutuelle de polygones. Elle montre tout le potentiel et l'intérêt de cette information pour la résolution de problèmes difficiles en synthèse d'images et en propagation électromagnétique. Nous proposons un nouvel algorithme pour calculer la visibilité dans l'espace de Plücker, afin de minimiser les coûts en temps et mémoire vis-à-vis des précédentes approches. En synthèse d'images, nous utilisons l'information ainsi calculée pour proposer une nouvelle solution au calcul analytique des ombres douces en illumination directe. Cette solution concilie la qualité et la rapidité du rendu. En propagation électromagnétique, nous proposons l'optimisation sans perte d'un modèle basé rayons. Celle-ci permet d'effectuer des simulations dont la précision est optimale tout en s'appliquant à des environnements de tailles significatives
This thesis addresses the visibility computation between two polygons and its representation. We bring up the potential of this information to solve difficult problems in image synthesis and in electromagnetic waves propagation. We present a new algorithm for the visibility computation in the Plücker space. In comparison to previous methods, it reduces the time computation and the memory requirements. In image synthesis, we use the computed information to design a new solution for the analytic computation of soft shadows. This solution is both accurate and fast in comparison with stochastic approaches. In electromagnetic waves propagation, we present the first ray based model optimisation without path lost. This optimisation allows to perform accurate simulations on significant environments

APA, Harvard, Vancouver, ISO, and other styles

5

Bretschneider, Peter. "Polygyny : a cross-cultural study /." Stockholm : Almqvist & Wiqsell, 1995. http://catalogue.bnf.fr/ark:/12148/cb36960460z.

Full text

APA, Harvard, Vancouver, ISO, and other styles

6

Tami, Abdelkader. "Etude d'un problème pour le bilaplacien dans une famille d'ouverts du plan." Thesis, Aix-Marseille, 2016. http://www.theses.fr/2016AIXM4362/document.

Full text

Abstract:

L’objet de cette thèse est l’étude du problème Δ 2uω = fω avec les conditions aux limites Uω = Δ uω = 0, le second membre étant supposé dépendre continûment de ω dans L2(ω), où ω = {(r, θ); 0 < r < 1, 0 < θ < ω} , 0 < ω ≤ π, est une famille de secteurs tronqués du plan. Si ω < π on sait d’après Blum et Rannacher (1980) que la solution de ce problème uω se décompose au voisinage de l’origine en uω = u1,ω + u2,ω + u3,ω, (1) où u1,ω, u2,ω sont les parties singulières de uω et u3,ω la partie régulière. En effet, au voisinage de l’origine u1,ω (resp. u2,ω, u3,ω) est de régularité H1+πω−ǫ (resp. H2+πω−ǫ, H4) pour tout Q > 0, tandis que la solution uπ appartient, au moins au voisinage de l’origine, à l’espace H4(π), où π est le demi-disque supérieur de centre 0 et de rayon r = 1. On voit clairement une résolution de la singularité près de l’angle π dont la description est l’objectif principal de ce travail. Le résultat obtenu est que la décomposition (1) de uω est uniforme par rapport à ω, lorsque ω → π, pour les meilleures topologies possibles pour chacun des termes, et converge terme à terme vers le développement limité de uπ au voisinage de 0
In this work, we study the family of problems Δ 2uω = fω with boundary conditionuω = Δ uω = 0. There, the second member is assumed to depend smoothly on ω in L2(ω), where ω = {(r, θ); 0 < r < 1, 0 < θ < ω} , 0 < ω ≤ π, is a family of truncated sectors of the plane. If ω < π it is known from Blum et Rannacher (1980) that the solution uω decomposes as uω = u1,ω + u2,ω + u3,ω, (1) where u1,ω, u2,ω are singular and u3,ω is regular. Indeed, near the origin, u1,ω(resp. u2,ω, u3,ω) is of regularity H1+πω−ǫ (resp. H2+πω−ǫ, H4) for every Q > 0, while the solution uπ is, in the neighborhood of the origin again, of regularity H4. One clearly sees a resolution of the singularity near the angle π whose descriptionis the main objective of this work. The obtained result is that there exists a decomposition (1) of uω which is uniform with respect to ω, when ω → π, with the best possible topologies for each term, and which term by term convergestowards the Taylor expansion of uπ near 0

APA, Harvard, Vancouver, ISO, and other styles

7

Soares, Benedict J. "Polynomial generated polygons." Thesis, University of St Andrews, 1999. http://hdl.handle.net/10023/14198.

Full text

Abstract:

A turtle geometric construction on the plane, called a polynomial generated polygon (PGP) and represented by Pf,pm, is generated from the sequence obtained from evaluating f(x) ∈ Z[x] over Z modulo pm where p is a prime and m ∈ N. Computational methods are developed to pre-calculate the symmetries exhibited by Pf,pm for a given f and pm. These include procedures to find whether Pf,pm is bounded or unbounded, the degree of rotational symmetry present, whether lines of reflectional symmetry can be observed, and in the case of Pf,pm unbounded, whether the PGP has a glide reflection. Methods are also sought to find a suitable f and pm to produce a desired 'feasible' shape in a PGP construction, and how the same shape might be generated modulo pm+k if it cannot be produced modulo pm.

APA, Harvard, Vancouver, ISO, and other styles

8

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

9

Rafique, Emran Carleton University Dissertation Computer Science. "On asymptotic algorithms for approximating arbitrary polygons by simpler convex polygons." Ottawa, 1993.

Find full text

APA, Harvard, Vancouver, ISO, and other styles

10

Shermer, Thomas C. "Visibility properties of polygons." Thesis, McGill University, 1989. http://digitool.Library.McGill.CA:80/R/?func=dbin-jump-full&object_id=74241.

Full text

Abstract:

In this thesis, we establish tight bounds on the maximum size of maximum hidden sets, minimum guard sets, and minimum partitions and covers of polygons, using link-visibility. These results unify and generalize the guard set results (and combinatorial method) of Chvatal and O'Rourke. Our method also provides tight bounds on independent and dominating sets in triangulation graphs, and almost-tight bounds on the size of hidden sets, guard sets, covers, and partitions of polygon exteriors. We also prove that, using link-visibility, the optimization problems of finding maximum hidden sets, minimum guard sets, or minimum covers are NP-hard.
Link-visibility is an extended notion of visibility arising from robotics and motion planning problems. Hidden sets are sets of points in a polygon such that no two points of the set are visible, and guard sets are sets such that each point of the polygon is visible to some point in the guard set. Both maximum hidden set sizes and minimum guard set sizes can be used as polygon shape complexity measures.

APA, Harvard, Vancouver, ISO, and other styles

11

Dean, James Alexander Carleton University Dissertation Computer Science. "Structural properties of polygons." Ottawa, 1985.

Find full text

APA, Harvard, Vancouver, ISO, and other styles

12

Turek, Robert O. "Polygons, stars, and clusters." Thesis, Virginia Polytechnic Institute and State University, 1986. http://hdl.handle.net/10919/101328.

Full text

Abstract:

One technique for displaying a set of quantitative variables is to represent the set as a polygon. Such displays allow the observer to visualize complex information quickly, as a whole. Polygon displays have been employed to display information for analysis, status, or presentation. An experimental investigation was undertaken to ascertain the effect of variation in certain visual features of the display on the consistency with which people categorize information presented as polygons. Variables included background information of the display, shading, and form. Subjects performed a categorization task on two sets of data; the results are analyzed for consistency between individuals and for consistency with certain standard clustering algorithms. The effects of distinctive portions of the figures on the judgment of similarity, and of the nature of the data and of interactions of combinations of the variables used in the experiment on the consistency of clustering were noted. Implications for the design of polygon displays are discussed.
M.S.

APA, Harvard, Vancouver, ISO, and other styles

13

Rachamadugu, Sairaj. "Manipulation of 3D knotted polygons." TopSCHOLAR®, 2012. http://digitalcommons.wku.edu/theses/1162.

Full text

Abstract:

This thesis discusses the development of software architecture to support the computational investigation of random polygons in 3 space. The random polygons themselves are a simple model of long polymer chains. (A DNA molecule is one example of a polymer.) This software architecture includes "building blocks" which specify the actual manipulations and computations to be performed, and a structural framework which allows the user to specify which manipulations/computations to perform, in which order and with how many repetitions. The overall framework is designed in such a way that new building blocks can easily be added in the future. The development of three different building blocks to be used in this architecture which are entitled: Reducer, Lengthener and OutsideInLengthener are also discussed in this thesis. These building blocks manipulate the existing polygons - increasing or decreasing their size.

APA, Harvard, Vancouver, ISO, and other styles

14

Ballinger, Brad. "Length-preserving transformations on polygons /." For electronic version search Digital dissertations database. Restricted to UC campuses. Access is free to UC campus dissertations, 2003. http://uclibs.org/PID/11984.

Full text

APA, Harvard, Vancouver, ISO, and other styles

15

Bohačík, Antonín. "Management polygonu energetické přenosové soustavy." Master's thesis, Vysoké učení technické v Brně. Fakulta elektrotechniky a komunikačních technologií, 2021. http://www.nusl.cz/ntk/nusl-442397.

Full text

Abstract:

The diploma thesis is focused on the creation of a control interface for a polygon simulating the electrical distribution network of the Czech Republic, where communication between substations is realized by IEC 60870-5-104 protocol. The theoretical part of the thesis explains the basic principles, properties and possibilities of communication standards IEC 60870 and IEC 61850. The next part is focused on the actual implementation and subsequent implementation of the control interface, including the implementation of the IEC 61850-80-1 module for data transfer between the mentioned standards. The last part describes the created behavior scenarios or the analysis of communication itself.

APA, Harvard, Vancouver, ISO, and other styles

16

Darmopilová, Jana. "GPS měření na polygonu Tetčice." Master's thesis, Vysoké učení technické v Brně. Fakulta stavební, 2014. http://www.nusl.cz/ntk/nusl-227118.

Full text

Abstract:

This thesis deals with periodical measurements at the Tetčice polygon to confirm geological activity caused by geological shift that pass through the center of the village. This work was focused on the third phase of measurement by long static GNSS observation in summer 2013 to monitor horizontal shifts on both edges of Boskovice furrow. Points are stabilized on pillars with forced centring. Part of the thesis is summary of present results, the differences between the various stages and graphical representations of shifts. The theoretical part deals with the geological conditions in the area and description of GNSS technology.

APA, Harvard, Vancouver, ISO, and other styles

17

Chénier, Christian. "Shortest paths in weighted polygons." Thesis, University of Ottawa (Canada), 1996. http://hdl.handle.net/10393/10034.

Full text

Abstract:

Consider a polygon P and two points $p,\ q\in P.$ Suppose that to move from p to q, we can travel along the edges of P or through the interior of P. Assume that the speed at which we can travel along the edges of P is one unit per second, and the travel speed through the interior of P is 1/s units per seconds ($s>1$). The problem consists of finding the shortest path between p and q. We solve this problem in O(n) time for convex polygons. For simple polygons, we show two algorithms. The first algorithm runs in O(E log n) time using O(E) space (where E is the size of the visibility of P). The second algorithm has two variations which both require O(n E log n) preprocessing (where E is the number of edges in the visibility graph of P). The first variation takes O(n log n) query time and O($n\sp2$ log n) space. The second variation has a query time of O(n log$\sp2$ n) but uses $O(n\sp2)$ space. For the orthogonal case, we give a O(E) time and space algorithm.

APA, Harvard, Vancouver, ISO, and other styles

18

Heinlein, David J. (David John). "Properties of Bicentric Circles for Three-Sided Polygons." Thesis, University of North Texas, 1998. https://digital.library.unt.edu/ark:/67531/metadc278727/.

Full text

Abstract:

We define and construct bicentric circles with respect to three-sided polygons. Then using inherent properties of these circles, we explore both tangent properties, and areas generated from bicentric circles.

APA, Harvard, Vancouver, ISO, and other styles

19

Carey, Peter Wright. "Behavioural thermoregulation and polygyny in the New Zealand fur seal." Thesis, University of Canterbury. Zoology, 1989. http://hdl.handle.net/10092/5788.

Full text

Abstract:

The polygynous New Zealand fur seal, Arctocephalus forsteri, breeds in densely-packed colonies with males defending exclusive territories. The distribution of animals within a colony of these seals was monitored over three consecutive breeding seasons and behavioural thermoregulation was found to be an important factor influencing the site selection of both males and females. Three substrates were available to seals: rocks in the sun, rocks in the shade, and pools of standing water. The shaded areas and pools were used for cooling and use of these cooling substrates increased as rock surface temperature increased, resulting in a clumped distribution on hot days. Substrate preferences were tested experimentally by manipulating the availability of cooling substrates during two seasons. The number of females using an area increased significantly after shade or pools of water were added to that area. For males, pool additions resulted in increased use of those areas, while adding shade had no effect. Cooling substrates had a patchy distribution and could, therefore, be monopolised by territorial males. The physical characteristics of territories were compared with the numbers of females per territory to determine if harem size was related to cooling substrate availability. Harem size was positively correlated with both shaded substrate area and total territory size, thus demonstrating that female thermoregulatory constraints are a major factor affecting male mating success. Substrate manipulation experiments also revealed that harem size varied in relation to changes in cooling substrate availability, both within the territory being measured and on sites adjacent to it. Harem size increased on two territories after shade was added to them, and also on two territories near sites from which cooling substrates were removed. Another two territories showed a decrease in harem size after cooling substrates were added to neighbouring areas. These results suggest that the quality of a territory (i.e. number of females on it) is directly related to its cooling potential. The role of female aggression in the seals' social system was also investigated. Females defended small territories within male territories using displays and vocalisations not unlike those used by males during territorial disputes. Agonistic interactions occurred most often on shaded rocks, suggesting that this is a limited resource being contested. It is proposed that this competition for preferred microhabitats will limit harem size and, therefore, the mating success of territorial males. Resident females won significantly more conflicts than intruders, regardless of the type of substrate on which the interaction took place.

APA, Harvard, Vancouver, ISO, and other styles

20

Stewart, Stephanie A. "Reproduction partitioning in polygyne nests of the yellowjacket Vespula squamosa /." View online, 2000. http://repository.eiu.edu/theses/docs/32211130921726.pdf.

Full text

APA, Harvard, Vancouver, ISO, and other styles

21

Milks, Maynard. "Female choice and polygyny in red-winged blackbirds, Agelaius phoeniceus." Thesis, University of Ottawa (Canada), 1988. http://hdl.handle.net/10393/5464.

Full text

APA, Harvard, Vancouver, ISO, and other styles

22

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

23

Lenngren, Nils. "k-uniform tilings by regular polygons." Thesis, Uppsala universitet, Algebra, geometri och logik, 2009. http://urn.kb.se/resolve?urn=urn:nbn:se:uu:diva-159395.

Full text

APA, Harvard, Vancouver, ISO, and other styles

24

El, Oraiby Wael. "K-set Polygons and Centroid Triangulations." Phd thesis, Université de Haute Alsace - Mulhouse, 2009. http://tel.archives-ouvertes.fr/tel-00871192.

Full text

Abstract:

This thesis is a contribution to a classical problem in computational and combinatorial geometry: the study of the k-sets of a set V of n points in the plane. First we introduce the notion of convex inclusion chain that is an ordering of the points of V such that no point is inside the convex hull of the points that precede it. Every k-set of an initial sub-sequence of the chain is called a k-set of the chain. We prove that the number of these k-sets is an invariant of V and is equal to the number of regions in the order-k Voronoi diagram of V. We then deduce an online algorithm for the construction of the k-sets of the vertices of a simple polygonal line such that every vertex of this line is outside the convex hull of all its preceding vertices on the line. If c is the total number of k-sets built with this algorithm, the complexity of our algorithm is in O(n log n + c log^2k) and is equal, per constructed k-set, to the complexity of the best algorithm known. Afterward, we prove that the classical divide and conquer algorithmic method can be adapted to the construction of the k-sets of V. The algorithm has a complexity of O(n log n + c log^2k log(n/k)), where c is the maximum number of k-sets of a set of n points. We finally prove that the centers of gravity of the k-sets of a convex inclusion chain are the vertices of a triangulation belonging to the family of so-called centroid triangulations. This family notably contains the dual of the order-k Voronoi diagram. We give an algorithm that builds particular centroid triangulations in O(n log n + k(n- k) log^2 k) time, which is more efficient than all the currently known algorithms.

APA, Harvard, Vancouver, ISO, and other styles

25

ElGindy, Hossam A. "Hierarchical decomposition of polygons with applications." Thesis, McGill University, 1985. http://digitool.Library.McGill.CA:80/R/?func=dbin-jump-full&object_id=72756.

Full text

APA, Harvard, Vancouver, ISO, and other styles

26

Belleville, Patrice. "Computing two-covers of simple polygons." Thesis, McGill University, 1991. http://digitool.Library.McGill.CA:80/R/?func=dbin-jump-full&object_id=60490.

Full text

Abstract:

A set ${ cal P} = P sb1,P sb2, ...,P sb{k}$ of polygons is called a k-cover of a simple polygon P if $P = cup sbsp{i=1}{k} P sb{i}$. It has been shown that finding k-covers of polygons by subpolygons of a given class is almost always NP-hard, whenever k is allowed to vary. Shermer (She91a) gave a linear time algorithm to determine if P has a two-cover by convex polygons, and to find one if it exists. A polygon P is star-shaped if it has a point which sees all the others, and $L sb{k}$-convex if every pair of points can be joined by a polygonal path of at most k links contained in P. In this thesis, we give algorithms to find two-covers of P by $L sb{k}$-convex polygons in $O(n sp2$) time and space, and by star-shaped polygons on $O(n sp4$) time and $O(n sp2$logn) space respectively, provided that they exist. We also give a characterization of the types of changes which occur in the region visible from a point as it moves along a line segment contained in P.

APA, Harvard, Vancouver, ISO, and other styles

27

Seater, Robert. "Minkowski sum decompositions of convex polygons." Diss., Connect to the thesis, 2002. http://hdl.handle.net/10066/1479.

Full text

APA, Harvard, Vancouver, ISO, and other styles

28

Fromm, Viktor. "The topology of spaces of polygons." Thesis, Durham University, 2011. http://etheses.dur.ac.uk/3208/.

Full text

Abstract:

We study the topology of spaces of polygons in Euclidean space, viewed up to translations. The main results concern the structure of the homology groups and of the cohomology rings of the spaces. In particular, it is shown that the spaces are classified by their cohomology rings. A principal tool used in the proofs is a new lacunary principle for Morse-Bott functions, which may be of independent interest. Several applications are discussed.

APA, Harvard, Vancouver, ISO, and other styles

29

Uçar, Eren. "Spectral invariants for polygons and orbisurfaces." Doctoral thesis, Humboldt-Universität zu Berlin, 2017. http://dx.doi.org/10.18452/18463.

Full text

Abstract:

In dieser Arbeit beschäftigen wir uns mit Spektralinvarianten von Polygonen und geschlossenen Orbiflächen konstanter Gaußkrümmung. Unsere Methode ist es jeweils den Wärmeleitungskern und die asymptotische Entwicklung der Wärmespur zu untersuchen. Als erstes untersuchen wir hyperbolische Polygone, d.h. relativ kompakte Gebiete in der hyperbolischen Ebene mit stückweise geodätischem Rand. Wir berechnen die asymptotische Entwicklung der Wärmespur bezüglich des Dirichlet-Laplace Operators eines beliebigen hyperbolischen Polygons, und wir erhalten explizite Formeln für alle Wärmeinvarianten. Analoge Resultate für euklidische und sphärische Polygone waren vorher bekannt. Wir vereinheitlichen diese Resultate und leiten die Wärmeinvarianten für beliebige Polygone her, d.h. für relativ kompakte Gebiete mit stückweise geodätischem Rand in einer vollständigen Riemann'schen Mannigfaltigkeit konstanter Gaußkrümmung. Es stellt sich heraus, dass die Wärmeinvarianten viele Informationen über ein Polygon liefern, falls die Krümmung nicht verschwindet. Zum Beispiel sind dann die Multimenge aller echten Winkel (d.h. derjenigen Winkel die ungleich Pi sind) und die Euler-Charakteristik eines Polygons Spektralinvarianten. Außerdem berechnen wir die asymptotische Entwicklung der Wärmespur von geschlossenen Riemann'schen Orbiflächen konstanter Krümmung und erhalten explizite Formeln für alle Wärmeinvarianten. Falls die Krümmung nicht verschwindet, so kann man interessante Informationen aus den Wärmeinvarianten über die Topologie und die singuläre Menge einer Orbifläche ermitteln.
In this thesis we deal with spectral invariants for polygons and closed orbisurfaces of constant Gaussian curvature. In each case our method is to study the heat kernel and the asymptotic expansion of the heat trace. First, we investigate hyperbolic polygons, i.e. relatively compact domains in the hyperbolic plane with piecewise geodesic boundary. We compute the asymptotic expansion of the heat trace associated to the Dirichlet Laplacian of any hyperbolic polygon, and we obtain explicit formulas for all heat invariants. Analogous results for Euclidean and spherical polygons were known before. We unify these results and deduce the heat invariants for arbitrary polygons, i.e. for relatively compact domains with piecewise geodesic boundary contained in a complete Riemannian manifold of constant Gaussian curvature. It turns out that the heat invariants provide much information about a polygon, if the curvature does not vanish. For example, then the multiset of all real angles (i.e. those which are not equal to pi) and the Euler characteristic of a polygon are spectral invariants. Furthermore, we compute the asymptotic expansion of the heat trace for any closed Riemannian orbisurface of constant curvature, and obtain explicit formulas for all heat invariants. If the curvature does not vanish, then it is possible to detect interesting information about the topology and the singular set of an orbisurface from the heat invariants.

APA, Harvard, Vancouver, ISO, and other styles

30

Petrlík, Karel. "Opakovaná GPS měření na polygonu Tetčice." Master's thesis, Vysoké učení technické v Brně. Fakulta stavební, 2017. http://www.nusl.cz/ntk/nusl-390235.

Full text

Abstract:

This diploma thesis deals with epoch GNSS measurement by static method at Tetčice polygon. The main purpose is to confirm the geological activity of the Earth's surface on the territory of the village, caused by a tectonic fault. As part of the thesis, the fourth phase of observation was carried out in June 2016 to detect horizontal shifts on four concrete pillars with depth stabilization and forced centering equipment. Results are velocity vector maps obtained by processing the measured data from all the measurement phases that have been performed so far. The thesis also contains the theoretical basis of geological conditions in the area and a description of technology of global navigation satellite systems.

APA, Harvard, Vancouver, ISO, and other styles

31

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

32

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

33

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

34

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

35

Kleiber, Danika Lynn. "Female intrasexual reproductive competition in the facultatively polygynous song sparrow." Thesis, University of British Columbia, 2008. http://hdl.handle.net/2429/2525.

Full text

Abstract:

Reproductive competition among females is an under-studied aspect of behavioural ecology. In species where males provide non-sharable resources that enhance individual and offspring fitness, such as feeding young, intrasexual conflict among females should be expected. My thesis examined reproductive competition among female song sparrows by estimating the reproductive costs of losing male care and behavioural strategies females employed to avoid the loss of male care. I used a long-term study of song sparrows, a facultatively polygynous passerine, on Mandarte Island, British Columbia Canada, to examine the potential reproductive and survival costs that polygyny might have on females. I found that polygynous females without male care experienced lower nest and lifetime reproductive success than polygynous females with male care. In contrast, female status within polygynous groups had no impact on overwinter survival. Three strategies that females might use to avoid polygyny or ensure access to male parental care while in polygyny include 1) intrasexual aggression to deter secondary females from settling, 2) infanticide of primary female’s nest by secondary females to improve nesting status or 3) nest timing to either increase the comparative worth of the nest through synchrony, or eliminate competition for male care through asynchrony. Using a mount presentation experiment I found that resident females reacted as predicted if intrasexual aggressive behaviour was used to deter secondary female settlement and ensure male parental care. Over 18 years when polygyny occurred in the population, I found evidence that the presence of secondary females was correlated with a rise in the nest failure rate of primary females, but I found no evidence that polygynous females used nest timing strategies to influence access to male care. Overall, my results suggest that female song sparrows use aggressive behaviours to reduce secondary female settlement, and within polygynous groups secondary females may use infanticide to advance their status. Despite the existence of female strategies to circumvent the loss of fitness due to polygynous mating, polygyny still occurred regularly in the population. This observation suggests that the strategies described above are often not effective, or that their costs outweigh the potential gains to individual fitness.

APA, Harvard, Vancouver, ISO, and other styles

36

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

37

Hartley, Ian Russell. "Polygyny, parentage and parental investment in the corn bunting, Miliaria calandra." Thesis, University of Leicester, 1991. http://hdl.handle.net/2381/34102.

Full text

Abstract:

1) This study investigated the costs and benefits of a polygynous mating system, and its effects on reproductive success and parental care in male and female com buntings (Miliaria calandra), on North Uist, Outer Hebrides. In 1989 and 1990, 41.2% of males were monogamously paired, 33.3% polygynous and 23.5% unpaired; the sex ratio was 1:1. Polygynous males usually paired with two females; occasionally three. The distribution of females among males was not significantly different from a binomial distribution. 2) DNA fingerprinting showed that there were only two possible cases of extra-pair paternity (EPP) due to extra-pair copulation (EPC) (4.5% of 44 offspring; 6.7% of broods), both from the same brood. There were no cases of intra-specific brood parasitism (IBP) (0% of 50 offspring; 0% of 16 broods). EPP was probably rare because of mate guarding by the male, asynchrony between broods for polygynous males and limited opportunities for EPC. Polygynous males fledged more offspring from their territories than did monogamous males because they paired with more females; unpaired males fledged no offspring. 3) Unlike most other polygynous birds, primary and secondary females of polygynous male com buntings had similar reproductive success and both had greater reproductive success than monogamous females. Monogamous females had lower reproductive success because their chicks starved more often. Although monogamous females provisioned nestlings at a similar rate to females of polygynous males, monogamous females delivered smaller food loads, which may have led to the reduced success of those nests. 4) Males rarely fed nestlings before they were four days old. Males provided less food for nestlings than did females at all chick ages and, on average, provided a maximum of only 22.0% of all feeds. Unusually for a polygynous species, males provisioned nestlings of monogamous, primary and secondary females with similar sized food loads and at similar rates. 5) Broods belonging to primary and secondary females were apparently equally valuable to their males because EPP was low in this population and brood sizes were similar between nest classes. Males may have been able to feed both nests because they were temporally separate, although at least one male was able to feed overlapping nests simultaneously. Males provisioned proportionately less than females at early stages of the nestling period, possibly because of sex differences in other available reproductive opportunities. Females had no better available option than to provide parental care to the current brood, whereas males could potentially increase their fitness better by defending a territory in which females could breed. 6) Males appeared to defend areas in which females chose to nest rather than to forage. Females often foraged outside male territories. The territories of unpaired, monogamous and polygynous males did not differ significantly in habitat composition. 7) Female corn buntings neither suffered costs to polygyny, nor did they compete for resources, such as male parental care, nest sites or food. Nests were under-dispersed in space, because of habitat aggregation, and were randomly dispersed in time within territories. Primary and secondary females of polygynous males did not choose territories in the same order, and the first settling females of polygynous males did not settle significantly earlier than monogamous females; this suggests that males were chosen randomly, rather than by the quality of their resources. I suggest that low variance of male territory quality facilitated random female choice of males. A no-cost, no-benefit model, with females choosing males randomly is suggested as the best explanation for the maintenance of polygyny in the com bunting.

APA, Harvard, Vancouver, ISO, and other styles

38

Simonson, Matthew A. "Polygenic analysis of genome-wide SNP data." Thesis, University of Colorado at Boulder, 2013. http://pqdtopen.proquest.com/#viewpdf?dispub=3562047.

Full text

Abstract:

One of the central motivators behind genetic research is to understand how genetic variation relates to human health and disease. Recently, there has been a large-scale effort to find common genetic variants associated with many forms of disease and disorder using single nucleotide polymorphisms (SNPs). Several genome-wide association (GWAS) studies have successfully identified SNPs associated with phenotypes. However, the effect sizes attributed to individual variants is generally small, explaining only a very small amount of the genetic risk and heritability expected based on the estimates of family and twin studies. Several explanations exist for the inability of GWAS to find the "missing heritability."

The results of recent research appear to confirm the prediction made by population genetics theory that most complex phenotypes are highly polygenic, occasionally influenced by a few alleles of relatively large effect, and usually by several of small effect. Studies have also confirmed that common variants are only part of what contributes to the total genetic variance for most traits, indicating rare-variants may play a significant role.

This research addresses some of the most glaring weaknesses of the traditional GWAS approach through the application of methods of polygenic analysis. We apply several methods, including those that investigate the net effects of large sets of SNPs, more sophisticated approaches informed by biology rather than the purely statistical approach of GWAS, as well as methods that infer the effects of recessive rare variants.

Our results indicate that traditional GWAS is well complemented and improved upon by methods of polygenic analysis. We demonstrate that polygenic approaches can be used to significantly predict individual risk for disease, provide an unbiased estimate of a substantial proportion of the heritability for multiple phenotypes, identify sets of genes grouped into biological pathways that are enriched for associations, and finally, detect the significant influence of recessive rare variants.

APA, Harvard, Vancouver, ISO, and other styles

39

Rusaw, Shawn. "Orienting polygons, experiments in automated part orienting." Thesis, National Library of Canada = Bibliothèque nationale du Canada, 1998. http://www.collectionscanada.ca/obj/s4/f2/dsk2/tape17/PQDD_0027/MQ37625.pdf.

Full text

APA, Harvard, Vancouver, ISO, and other styles

40

Hsu, Yu-Cheng 1966. "Efficient covering of general polygons by rectangles." Thesis, The University of Arizona, 1990. http://hdl.handle.net/10150/291443.

Full text

Abstract:

Covering a polygon by a set of rectangles has many applications in the VLSI CAD area. In this thesis, a new efficient algorithm to cover a polygon has been developed. It is not limited by the rectilinear restriction, but each inner angle of the polygon is at least 90 degrees. The algorithm has two phases. The first phase decomposes a non-rectilinear polygon P(n) into two parts. One part is a rectilinear polygon P(r), and the other part consists of the rest of P(n). This phase also generates a set of rectangles covering the non-rectilinear part. The time complexity of this phase is O(b∗n), where b is the number of oblique edges and n is the number of vertices in P(n). The second phase finds an overlapping rectangle cover for the rectilinear part P(r) by generating a non-overlapping cover first. The complexity of this phase is O(klog (k) + r + m²), where k is the number of inversions, r the number of the vertices in P(r), and m the size of the non-overlapping rectangle cover. The algorithm has been implemented and experimental results are provided to show the effectiveness of our approach.

APA, Harvard, Vancouver, ISO, and other styles

41

Krapohl, Eva Maria Laura. "Multi-variable approaches to polygenic trait prediction." Thesis, King's College London (University of London), 2017. https://kclpure.kcl.ac.uk/portal/en/theses/multivariable-approaches-to-polygenic-trait-prediction(1e69a4a3-f89b-4646-980e-02031d5c23d3).html.

Full text

Abstract:

Robust evidence for the polygenicity and genetic correlations of complex traits across the phenome suggests both the necessity of polygenic instruments and the value of multi-trait prediction models. This thesis used multi-variable approaches in four papers and along two main threads: Multi-variable approaches to trait prediction A primary goal of polygenic scores, which aggregate effects of trait-associated variants discovered in genome-wide association studies (GWAS), is to estimate individual-specific genetic propensities to predict trait variation. This is typically achieved using one polygenic score predicting one outcome. Extending this to a multi-variable approach, a ‘phenome-wide analysis of genome-wide polygenic scores’ mapped associations between 13 polygenic scores created from GWAS for psychiatric disorders and cognitive traits and 50 behavioural traits. Extending the multi-variable approach further, a multi-polygenic score approach was employed to increase prediction by exploiting the joint power of multiple discovery GWAS in the same model. A regularised regression model combining summary statistics of 81 trait GWAS improved out-of-sample prediction of three child outcomes over the best single-predictor model. Multi-variable approaches to gene-environment correlation Although geneenvironment correlation is widely investigated by family studies and recently by SNP-heritability studies, the possibility that genetic effects on traits capture environmental risk factors or protective factors has been neglected by polygenic prediction models. First, a study using genome-wide SNP-heritability estimation and polygenic score analysis provided the first molecular evidence for substantial genetic influence on differences in children’s educational achievement and its association with family socio-economic status. Second, covariation between offspring trait-associated polygenic variation and a wide range of parent-mediated environmental exposures was estimated. For this, a mixed linear model estimated the effects of multiple polygenic scores on each environmental exposure while controlling for overall relatedness by fitting the effects of all SNPs as random effects. Findings illustrate the relevance of gene-environment correlation for polygenic prediction models. Taken together, the analyses illustrate the value of multi-variable approaches to complex trait prediction, as well as their current limitations and future potential.

APA, Harvard, Vancouver, ISO, and other styles

42

Staněk, Antonín. "Měření přesné opakované nivelace na polygonu Tetčice." Master's thesis, Vysoké učení technické v Brně. Fakulta stavební, 2014. http://www.nusl.cz/ntk/nusl-226599.

Full text

Abstract:

The diploma thesis deals with monitoring vertical shifts in the village Tetčice, located at the contact of two geological units in Boskovice furrow. The theoretical part describes the geological structure of the site and the technology high-precision levelling. It also includes measuring and graphic processing, including follow-up on results of previous stages.

APA, Harvard, Vancouver, ISO, and other styles

43

Daněk, Tomáš. "Analýza algoritmů booleovských operací nad obecnými polygony." Master's thesis, Vysoké učení technické v Brně. Fakulta informačních technologií, 2008. http://www.nusl.cz/ntk/nusl-235449.

Full text

Abstract:

This thesis deals with general polygon boolean operation algorithms. Boolean operations are e.g. intersection, union or difference. A general polygon can be e.g. a selfinterecting polygon with inner hole. Clipping of polygons against a rectangular window is probably the most familiar boolean operation on polygons. At first, basic definitions are listed. Then the principles of a selected set of boolean operation algorithms are reviewed. Finally, a complex comparison of the algorithms is undertaken. Performance as well as the ability to handle degenerate cases are tested. The output of this thesis is an overall evaluation of algorithm properties and a dynamic library that contains the implementation of all of the tested algorithms.

APA, Harvard, Vancouver, ISO, and other styles

44

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

45

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

46

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

47

Š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

48

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

49

Lightbody, Jill Patricia Carleton University Dissertation Biology. "Female settling patterns and polygyny in the yellow-headed blackbird (Xanthocephalus xanthocephalus)." Ottawa, 1986.

Find full text

APA, Harvard, Vancouver, ISO, and other styles

50

Uzoh-Baba, Betty. "Socio-anthropologie de la polygynie au Ghana : le cas du pays Dagomba." Thesis, Lille 1, 2013. http://www.theses.fr/2013LIL12014.

Full text

Abstract:

Notre étude est une approche pluridisciplinaire de la polyginie, par l'étude du cas des Dagombas du Nord du Ghana, qui sont en très grande majorité musulmans et moins scolarisés. Nous avons organisé notre thèse en trois parties. Dans la première partie, nous procédons à une analyse réflexive sur le terrain du Nord ghanéen, selon une approche anthropologique. Nous décrivons la logique polygynique africaine et son évolution dans le contexte des transformations de la société contemporaine. Dans nos hypothèses nous mettons en corrélation la pratique de la polygynie avec l’analphabétisme, la richesse, les mœurs, et les valeurs à l’origine des mariages forcés. Dans la seconde partie, nous décrivons successivement : les évolutions du mariage, des liaisons matrimoniales, etc. Les ressorts de la polygynie, son évolution et le rôle particulier du système éducatif sont mis en relief. Par le croisement des niveaux d’instruction des femmes vivant en situation de polygynie ou encore celle des situations socio- professionnelles permet de tester les ressorts des pratiques émergentes face à ce régime matrimonial. Dans la troisième partie, nous décrivons les mutations socioculturelles et économiques actuelles et leurs conséquences sur les pratiques polygyniques au Ghana. Nous analysons, à cet égard, les perceptions et représentations de la polygynie par les citadins à l’une de variable allant de la tranche d’âge au degré d’attachement à la religion et à la tradition. Partant de ce constat, nous investiguons sur l’avenir de ce régime matrimonial dans la société, l’émancipation et l’épanouissement socio-économiques de la femme et l’impact des évolutions en cours sur le devenir de la femme
Our study is a multidisciplinary approach to polygyny, by the case study of the Dagombas, of the Northern part of Ghana, in which majority of them are Muslims and uneducated. The introduction presents our epistemological position and our methodological options. We have classified our thesis in three parts. In the first part, we explore an anthropological approach based on the field research. The hypothesis correlated the practice of polygyny with illiteracy, wealth, morals, and values as factors related to forceful marriages. Finally, we evaluated the evolution of polygyny social changes in a contemporary society. In the second part, we successively elaborated: the changes in marriage, and matrimonial status, etc The outcome of polygyny and the role of the educational system are highlighted. Accessing the educational level of women, living in polygyny or the Socio- Professional conditions determines the institutional stakes emerging from this matrimonial practice. In the third part, we found out the socio-cultural and economic changes and their consequences on polygyniques practices in Ghana. We analyze, our samples given the perceptions and representations of polygyny by urban dwellers the variable ranging from the age group determined their commitment to religion and tradition. Deducing from this observation, we are investigating on the perspectives of this matrimonial status in the society, their emancipation and socio-economic development of women and the impact of woman in time and space

APA, Harvard, Vancouver, ISO, and other styles

Dissertations / Theses on the topic 'Polygyni'

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