No description available.

Consider distinct latin squares, L and M, of order n. Then the pair (T1, T2) where T1 = L \M and T2 = M \ L is called a latin bitrade. Furthermore T1 and T2 are referred to as latin trades, in which T2 is said to be a disjoint mate of T1 (and vice versa). Drápal (1991) showed that, under certain conditions, a partition of an equilateral triangle of side length n, where n is some integer, into smaller, integer length sided equilateral triangles gives rise to a latin trade within the latin square based on the addition table for the integers modulo n. A partial latin square P of order n is said to be completable if there exists a latin square L of order n such that P ⊆ L. If there is only one such possible latin square, L, of order n then P is said to be uniquely completable and P is called a defining set of L. Furthermore, if C is a uniquely completable partial latin square such that no proper subset of C is uniquely completable, C is said to be a critical set or a minimal defining set. These concepts, namely latin trades and defining sets in latin squares, are intimately connected by the following observation. If L is a latin square and D ⊆ L is a defining set, then D intersects all latin bitrades for which one mate is contained in L. In Part I of this thesis Dr´apal’s result is applied to investigate the structure of certain defining sets in latin squares. The results that are obtained are interesting in themselves; furthermore, the geometric approach to the problem yields additional appealing results. These geometric results are discussed in Chapters 3, 4, 5 and 6. They pertain to partitioning regions (polygons in R2 that satisfy certain obvious conditions) into equilateral, integer length sided, triangles, such that no point, in the region, is a corner of more than three distinct triangles. In Chapter 2 one of the main two theorems on defining sets is established, as is a method for using the above geometric results to prove the nonexistence of certain types of defining sets. In Part II of this thesis, intersection problems, for latin squares and Steiner triple systems, are considered. The seminal works, for problems of these types, are due to Lindner and Rosa (1975) and Fu (1980). A natural progression, from the established literature, for intersection problems between elements in a pair of latin squares or Steiner triple systems is to problems in which the intersection is composed of a number of disjoint configurations (isomorphic copies of some specified partial triple system). In this thesis solutions to two intersection problems for disjoint configurations are detailed. An m-flower, (F,F), is a partial triple system/configuration, such that: F = {{x, yi, zi} | {yi, zi} ∩ {yj , zj} = ∅, for 0 ≤ i, j ≤ m − 1, i 6= j}; and F = UX∈FX. The first such problem considered in this thesis asks for necessary and sufficient conditions for integers k and m ≥ 2 such that a pair of latin squares of order n exists that intersect precisely in k disjoint m-flowers. The necessary terminology, constructions, lemmas and proof for this result are contained in Chapters 7, 8 and 9. The second such problem considered in this thesis asks for necessary and sufficient conditions for integers k such that a pair of Steiner triple systems of order u exists that intersect precisely in k disjoint 2-flowers. This result relies on the solution to the latin square problem and an additional result from Chapter 9. The further constructions and lemmas used to prove this result are detailed in Chapter 10.

Consider distinct latin squares, L and M, of order n. Then the pair (T1, T2) where T1 = L \M and T2 = M \ L is called a latin bitrade. Furthermore T1 and T2 are referred to as latin trades, in which T2 is said to be a disjoint mate of T1 (and vice versa). Drápal (1991) showed that, under certain conditions, a partition of an equilateral triangle of side length n, where n is some integer, into smaller, integer length sided equilateral triangles gives rise to a latin trade within the latin square based on the addition table for the integers modulo n. A partial latin square P of order n is said to be completable if there exists a latin square L of order n such that P ⊆ L. If there is only one such possible latin square, L, of order n then P is said to be uniquely completable and P is called a defining set of L. Furthermore, if C is a uniquely completable partial latin square such that no proper subset of C is uniquely completable, C is said to be a critical set or a minimal defining set. These concepts, namely latin trades and defining sets in latin squares, are intimately connected by the following observation. If L is a latin square and D ⊆ L is a defining set, then D intersects all latin bitrades for which one mate is contained in L. In Part I of this thesis Dr´apal’s result is applied to investigate the structure of certain defining sets in latin squares. The results that are obtained are interesting in themselves; furthermore, the geometric approach to the problem yields additional appealing results. These geometric results are discussed in Chapters 3, 4, 5 and 6. They pertain to partitioning regions (polygons in R2 that satisfy certain obvious conditions) into equilateral, integer length sided, triangles, such that no point, in the region, is a corner of more than three distinct triangles. In Chapter 2 one of the main two theorems on defining sets is established, as is a method for using the above geometric results to prove the nonexistence of certain types of defining sets. In Part II of this thesis, intersection problems, for latin squares and Steiner triple systems, are considered. The seminal works, for problems of these types, are due to Lindner and Rosa (1975) and Fu (1980). A natural progression, from the established literature, for intersection problems between elements in a pair of latin squares or Steiner triple systems is to problems in which the intersection is composed of a number of disjoint configurations (isomorphic copies of some specified partial triple system). In this thesis solutions to two intersection problems for disjoint configurations are detailed. An m-flower, (F,F), is a partial triple system/configuration, such that: F = {{x, yi, zi} | {yi, zi} ∩ {yj , zj} = ∅, for 0 ≤ i, j ≤ m − 1, i 6= j}; and F = UX∈FX. The first such problem considered in this thesis asks for necessary and sufficient conditions for integers k and m ≥ 2 such that a pair of latin squares of order n exists that intersect precisely in k disjoint m-flowers. The necessary terminology, constructions, lemmas and proof for this result are contained in Chapters 7, 8 and 9. The second such problem considered in this thesis asks for necessary and sufficient conditions for integers k such that a pair of Steiner triple systems of order u exists that intersect precisely in k disjoint 2-flowers. This result relies on the solution to the latin square problem and an additional result from Chapter 9. The further constructions and lemmas used to prove this result are detailed in Chapter 10.

Consider distinct latin squares, L and M, of order n. Then the pair (T1, T2) where T1 = L \M and T2 = M \ L is called a latin bitrade. Furthermore T1 and T2 are referred to as latin trades, in which T2 is said to be a disjoint mate of T1 (and vice versa). Drápal (1991) showed that, under certain conditions, a partition of an equilateral triangle of side length n, where n is some integer, into smaller, integer length sided equilateral triangles gives rise to a latin trade within the latin square based on the addition table for the integers modulo n. A partial latin square P of order n is said to be completable if there exists a latin square L of order n such that P ⊆ L. If there is only one such possible latin square, L, of order n then P is said to be uniquely completable and P is called a defining set of L. Furthermore, if C is a uniquely completable partial latin square such that no proper subset of C is uniquely completable, C is said to be a critical set or a minimal defining set. These concepts, namely latin trades and defining sets in latin squares, are intimately connected by the following observation. If L is a latin square and D ⊆ L is a defining set, then D intersects all latin bitrades for which one mate is contained in L. In Part I of this thesis Dr´apal’s result is applied to investigate the structure of certain defining sets in latin squares. The results that are obtained are interesting in themselves; furthermore, the geometric approach to the problem yields additional appealing results. These geometric results are discussed in Chapters 3, 4, 5 and 6. They pertain to partitioning regions (polygons in R2 that satisfy certain obvious conditions) into equilateral, integer length sided, triangles, such that no point, in the region, is a corner of more than three distinct triangles. In Chapter 2 one of the main two theorems on defining sets is established, as is a method for using the above geometric results to prove the nonexistence of certain types of defining sets. In Part II of this thesis, intersection problems, for latin squares and Steiner triple systems, are considered. The seminal works, for problems of these types, are due to Lindner and Rosa (1975) and Fu (1980). A natural progression, from the established literature, for intersection problems between elements in a pair of latin squares or Steiner triple systems is to problems in which the intersection is composed of a number of disjoint configurations (isomorphic copies of some specified partial triple system). In this thesis solutions to two intersection problems for disjoint configurations are detailed. An m-flower, (F,F), is a partial triple system/configuration, such that: F = {{x, yi, zi} | {yi, zi} ∩ {yj , zj} = ∅, for 0 ≤ i, j ≤ m − 1, i 6= j}; and F = UX∈FX. The first such problem considered in this thesis asks for necessary and sufficient conditions for integers k and m ≥ 2 such that a pair of latin squares of order n exists that intersect precisely in k disjoint m-flowers. The necessary terminology, constructions, lemmas and proof for this result are contained in Chapters 7, 8 and 9. The second such problem considered in this thesis asks for necessary and sufficient conditions for integers k such that a pair of Steiner triple systems of order u exists that intersect precisely in k disjoint 2-flowers. This result relies on the solution to the latin square problem and an additional result from Chapter 9. The further constructions and lemmas used to prove this result are detailed in Chapter 10.

Consider distinct latin squares, L and M, of order n. Then the pair (T1, T2) where T1 = L \M and T2 = M \ L is called a latin bitrade. Furthermore T1 and T2 are referred to as latin trades, in which T2 is said to be a disjoint mate of T1 (and vice versa). Drápal (1991) showed that, under certain conditions, a partition of an equilateral triangle of side length n, where n is some integer, into smaller, integer length sided equilateral triangles gives rise to a latin trade within the latin square based on the addition table for the integers modulo n. A partial latin square P of order n is said to be completable if there exists a latin square L of order n such that P ⊆ L. If there is only one such possible latin square, L, of order n then P is said to be uniquely completable and P is called a defining set of L. Furthermore, if C is a uniquely completable partial latin square such that no proper subset of C is uniquely completable, C is said to be a critical set or a minimal defining set. These concepts, namely latin trades and defining sets in latin squares, are intimately connected by the following observation. If L is a latin square and D ⊆ L is a defining set, then D intersects all latin bitrades for which one mate is contained in L. In Part I of this thesis Dr´apal’s result is applied to investigate the structure of certain defining sets in latin squares. The results that are obtained are interesting in themselves; furthermore, the geometric approach to the problem yields additional appealing results. These geometric results are discussed in Chapters 3, 4, 5 and 6. They pertain to partitioning regions (polygons in R2 that satisfy certain obvious conditions) into equilateral, integer length sided, triangles, such that no point, in the region, is a corner of more than three distinct triangles. In Chapter 2 one of the main two theorems on defining sets is established, as is a method for using the above geometric results to prove the nonexistence of certain types of defining sets. In Part II of this thesis, intersection problems, for latin squares and Steiner triple systems, are considered. The seminal works, for problems of these types, are due to Lindner and Rosa (1975) and Fu (1980). A natural progression, from the established literature, for intersection problems between elements in a pair of latin squares or Steiner triple systems is to problems in which the intersection is composed of a number of disjoint configurations (isomorphic copies of some specified partial triple system). In this thesis solutions to two intersection problems for disjoint configurations are detailed. An m-flower, (F,F), is a partial triple system/configuration, such that: F = {{x, yi, zi} | {yi, zi} ∩ {yj , zj} = ∅, for 0 ≤ i, j ≤ m − 1, i 6= j}; and F = UX∈FX. The first such problem considered in this thesis asks for necessary and sufficient conditions for integers k and m ≥ 2 such that a pair of latin squares of order n exists that intersect precisely in k disjoint m-flowers. The necessary terminology, constructions, lemmas and proof for this result are contained in Chapters 7, 8 and 9. The second such problem considered in this thesis asks for necessary and sufficient conditions for integers k such that a pair of Steiner triple systems of order u exists that intersect precisely in k disjoint 2-flowers. This result relies on the solution to the latin square problem and an additional result from Chapter 9. The further constructions and lemmas used to prove this result are detailed in Chapter 10.

Thesis (M.G.S.)--Miami University, Dept. of Sociology and Gerontology, 2008. / Title from first page of PDF document. Includes bibliographical references (p. 47-49).

Recent literature by several eminent psychotherapists ·such as Bergin and Beutler argues that counsellors' personal values are probably the greatest influence on the success and outcome of therapy and that the counsellor tends to convert the client to the counsellor's values. This literature provided strong support for this researcher's contention of the need for similar studies in pastoral counselling. The researcher was particularly concerned about the role of pastoral counsellors' value systems and moral judgement development in counselling situations. The researcher selected the Rokeach Value Survey and the Rest Defining Issues Test as instruments to test a sample of South African pastoral counsellors in this regard. The research questions addressed were as follows. Firstly, what are the value systems of a sample of pastoral counsellors in the South African context? Secondly, what are the moral judgement development levels of the pastoral counsellors? Thirdly, what is the relationship between the rank ordering of values and pastoral counsellors' levels of moral judgement development? Fourthly, what implications could these variables have for pastoral-client pairing in pastoral counselling? The chief findings were as follows. Firstly, the pastoral counsellors were shown to have conservative value systems with a preference for introspective terminal values over social terminal values. Secondly, the pastoral counsellors had a P score of 39.6 on the Defining Issues Test. This compares favourably with Asian university students who score between 36-40 as opposed to American university students who have a mean P score of 42.6. The researcher concluded that the conservative religious ideology of the sample helped to explain the low P scores somewhat. Thirdly, the Spearman correlational coefficient indicated little correlation between the Rokeach Value Survey and the Rest Defining Issues Test. Fourthly, both instruments indicated that the conservative nature of the pastoral counsellors would no doubt make them very effective counsellors in most denominations. They would tend to counsel in support of the status quo in the church. A major recommendation of the study was the need for further pastoral counsellor education in dealing with moral values issues. / Philosophy, Practical and Systematic Theology / D.Th. (Practical theology)

Labor Law is an area of Law that has generated much controversy branch of over the years. This is mainly because this branch of Lawis in constant change and development, to which the system must adapt. Because of the importance of the topic, this article seeks to identify the essential  (defining) features of Labor law, including those features that have been recently defined.What this article tries to accomplish is to identify those defining features of Labor law and to give them a practical utility, and let us be able to monitor a branch of Law that has been constantly changing, and be prepared for its future development. / El Derecho del Trabajo es un área del Derecho que ha generado mucha polémica a lo largo de los años. Esto se debe, principalmente, aque  dicha rama se encuentra en constante desarrollo, al cual el sistema debe adaptarse. Debido a la importancia del tema, en este artículo se buscan definir los rasgos definitorios del Derecho del Trabajo, incluso aquellos quehan sido incorporados recientemente.El punto fundamental del presente artículo es identificar dichos rasgos definitorios y otorgarles una utilidad práctica. Esto con el objetivo de hacer un seguimiento de una rama del Derecho que ha ido cambiando y estar preparados para el futuro desarrollo.

Fundação de Apoio a Pesquisa e à Inovação Tecnológica do Estado de Sergipe - FAPITEC/SE / The Rees algebra of an ideal is an algebraic construction that takes place in commutative algebra and algebraic geometry. Currently, the study of arithmetic and homological properties of this object is cause for diverse research in commutative algebra. Our main goal in this work is to address aspects such as dimension and defining equations of the Rees algebra and other algebras that relate to it. / A álgebra de Rees de um ideal é uma construção algébrica que ocupa lugar de destaque na álgebra comutativa e na geometria algébrica. Atualmente, o estudo de propriedades aritméticas e homológicas desse objeto é motivo de diversas pesquisas em álgebra comutativa. Nosso principal objetivo nesse trabalho é tratar de aspectos como dimensão e equações de definição da álgebra de Rees e de outras álgebras que relacionam-se com ela.

La surveillance de la croissance des enfants est une activité quasi-universelle visant principalement à repérer des affections graves chez des enfants apparemment sains. Il existe des preuves empiriques que les performances de cette surveillance sont faibles, ce qui pourrait s’expliquer par l’absence de consensus sur trois questions clés et interdépendantes : quelles sont les affections à cibler en priorité ? comment définir une croissance anormale ? et quelles sont les courbes de croissance à utiliser ?Nous avons montré qu’il existait une grande hétérogénéité des pratiques de surveillance de la croissance en Europe et que les sept algorithmes proposés pour définir une croissance anormale avaient des performances et/ou un niveau de validation faible. Nous avons réalisé une étude de validation externe et une comparaison face-à-face de ces algorithmes et démontré que la règle de Grote avait les meilleures performances. Nous avons montré que la croissance des enfants français contemporains était plus proche des courbes de l’OMS que des courbes de référence françaises, excepté dans les six premiers mois de vie, et que l’introduction des courbes de l’OMS augmenterait la sensibilité des algorithmes au détriment de leurs spécificités. Nous avons obtenu un consensus d’experts internationaux sur la typologie des affections cibles prioritaires et un consensus national sur une liste réduite de huit affections cibles prioritaires des algorithmes de surveillance de la croissance.Ces connaissances nouvelles permettront très probablement de proposer des outils plus valides pour la surveillance de la croissance et de standardiser les pratiques pour améliorer la santé des enfants. / Growth monitoring in children is a worldwide health activity which aims at early detection of serious underlying disorders of apparently healthy children. Existing empirical evidence shows that growth-monitoring performance were low, this can be explained by a lack of consensus on three key and interconnected questions: which conditions should be targeted? how should abnormal growth be defined? and which growth charts should be used?We showed that there is a large heterogeneity in growth-monitoring practices in Europe and that the seven algorithms proposed for defining an abnormal growth had low performance and/or a level of validation. We performed an external validation study and head-to-head comparison of these seven algorithms and demonstrated that the Grote clinical rule had the best performance. We found that the growth of contemporary French children were closer to the WHO than French growth charts, except during the first six month of life. The introduction of WHO growth charts would increase the sensitivity at the expense of their specificity. We obtained an international consensus on the typology of priority target conditions and national consensus on a short list of eight priority target conditions of growth-monitoring algorithms.This new knowledge will most likely allow developing validated tools for growth monitoring and standardizing practices for improving child outcomes.