We consider combinatorial t-design problems as discrete optimization problems. Our motivation is that only a few studies have been done on the use of exact optimization techniques in designs, and that classical methods in design theory have still left many open existence questions. Roughly defined, t-designs are pairs of discrete sets that are related following some strict properties of size, balance, and replication. These highly structured relationships provide optimal solutions to a variety of problems in computer science like error-correcting codes, secure communications, network interconnection, design of hardware; and are applicable to other areas like statistics, scheduling, games, among others. We give a new approach to combinatorial t-designs that is useful in constructing t-designs by polyhedral methods. The first contribution of our work is a new result of equivalence of t-design problems with a graph theory problem. This equivalence leads to a novel integer programming formulation for t-designs, which we call GDP. We analyze the polyhedral properties of GDP and conclude, among other results, the associated polyhedron dimension. We generate new classes of valid inequalities to aim at approximating this integer program by a linear program that has the same optimal solution. Some new classes of valid inequalities are generated as Chv´atal-Gomory cuts, other classes are generated by graph complements and combinatorial arguments, and others are generated by the use of incidence substructures in a t-design. In particular, we found a class of valid inequalities that we call stable-set class that represents an alternative graph equivalence for the problem of finding a t-design. We analyze and give results on the strength of these new classes of valid inequalities. We propose a separation problem and give its integer programming formulation as a maximum (or minimum) edge-weight biclique subgraph problem. We implement a pure cutting-plane algorithm using one of the stronger classes of valid inequalities derived. Several instances of t-designs were solved efficiently by this algorithm at the root node of the search tree. Also, we implement a branch-and-cut algorithm and solve several instances of 2-designs trying different base formulations. Computational results are included.

This thesis is divided into two parts that each is concerned with a specific problem. The problem under consideration in the first part is to find suitable graph representations, abstractions, cost measures and algorithms for calculating placements of unmanned aerial vehicles (UAVs) such that they can keep one or several static targets under constant surveillance. Each target is kept under surveillance by a surveillance UAV, which transmits information, typically real time video, to a relay UAV. The role of the relay UAV is to retransmit the information to another relay UAV, which retransmits it again to yet another UAV. This chain of retransmission continues until the information eventually reaches an operator at a base station. When there is a single target, then all Pareto-optimal solutions, i.e. all relevant compromises between quality and the number of UAVs required, can be found using an efficient new algorithm. If there are several targets, the problem becomes a variant of the Steiner tree problem and to solve this problem we adapt an existing algorithm to find an initial tree. Once it is found, we can further improve it using a new algorithm presentedin this thesis. The second problem is optimization of time-consuming problems where the objective function is seen as a black box, where the input parameters are sent and a function valueis returned. This has the important implication that no gradient or Hessian information is available. Such problems are common when simulators are used to perform advanced calculations such as crash test simulations of cars, dynamic multibody simulations etc. It is common that a single function evaluation takes several hours. Algorithms for solving such problems can be broadly divided into direct search algorithms and model building algorithms. The first kind evaluates the objective function directly, whereas the second kind builds a model of the objective function, which is then optimized in order to find a new point where it is believed that objective function has agood value. Then the objective function is evaluated in that point. Since the objective function is very time-consuming, it is common to focus on minimizing the number of function evaluations. However, this completely disregards the possibility to perform calculations in parallel and to exploit this we investigate different ways parallelization can be used in model-building algorithms. Some of the ways to do this is to use several starting points, generate several new points in each iteration, new ways of predicting a point’s value and more. We have implemented the parallel extensions in one of the state of the art algorithms for derivative-free optimization and report results from testing on synthetic benchmarksas well as from solving real industrial problems.

This phenomenology begins with an observation of a musical instrument, the piano. The piano is surrounded by an aura of lifelessness, for its sound world is dominated by tone-decay and a calcified intonation system. Therefore, a physically seamless legato rendering of melody is impossible for pianists, and the inflexible symmetry of given intervallic relations enforces a loss of tonal centre when a composer ventures into the intrinsically asymmetrical domain of chromaticism. However, the melodic interval - the element lying between the acoustically sounding pitches - is in essence always inaudible, whatever the instrument. Through the development of listening capacities directed specifically toward unveiling the non-positive musical element in its origin, namely, within human consciousness, it is possible to overcome external instrumental limitations. Human being’s intrinsic musicality is revealed through phenomenological observation of consciousness in its qualitatively differentiated, ordinarily related, temporally unfolding nature. External limitations can have no hold over living melodic expression when the essence of the melodic interval is discovered self-sufficiently within the non-positive dimension of human onticity, that is, within a consciousness in which the potential for clear spiritual cognition lies dormant. ‘Tonicness’ is discovered ultimately to be an inner awareness of self-voicefulness, independent from instrumental and linguistic contingencies; and the piano reveals an historical mission to awaken - from ‘death’ - new cognitive listening faculties. This research employs the spiritual-scientific method of Rudolf Steiner’s anthroposophy, or wisdom of the human being, which involves meditation and the cultivation of sense-independent logic as well as of lucid feeling (as distinct from blinding emotion).

This thesis presents and develops a theory of self-reduction. This process is used to map instances of combinatorial optimisation problems onto smaller, more easily solvable instances in such a way that a solution of the former can be readily re-constructed, without loss of information or quality, from a solution of the latter. Self-reduction rules are surveyed for the Graph Colouring Problem, the Maximum Clique Problem, the Steiner Problem in Graphs, the Bin Packing Problem and the Set Covering Problem. This thesis introduces the problem of determining the maximum sequence of self-reductions on a given structure, and shows how the theory of confluence can be adapted from term re-writing to solve this problem by identifying rule sets for which all maximal reduction sequences are equivalent. Such confluence results are given for a number of reduction rules on problems on discrete systems. In contrast, NP-hardness results are also presented for some reduction rules. A probabilistic analysis of self-reductions on graphs is performed, showing that the expected number of self-reductions on a graph tends to zero as the order of the graph tends to infinity. An empirical study is performed comparing the performance of self-reduction, graph decomposition and direct methods of solving the Graph Colouring and Set Covering Problems. The results show that self-reduction is a potentially valuable, but sometimes erratic, method of finding exact solutions to combinatorial problems.

Zugl.: Logan (Utah), Utah State Univ., Diss., 2005

The present master thesis compares die theories of colors created by Johann Wolfgang von Goethe and Rudolf Steiner, who both created their individual theory as a reaction regarding another one published approximately a century prior to them. The thesis presents their theories and compares them on the basis of a certain set of categories. Their circumstances of origin, contemporaneous usage, interdisciplinarity and creation of the chromatic circle as an explanatory tool are defined and discussed. Furthermore a description of noticeable differences and similarities is added and the author points out the possible influences of the chromatic theories towards other poetical, philosophical or paedagogical works of the respetive creator.

abstract: The purpose of this dissertation was to document the teaching practices and underlying intentions of teachers in a Waldorf early childhood program in relationship to integrative movement and its connections to learning for the kindergarten through grade three learner. Current concerns about unhealthy sedentary lifestyles and the decreasing emphasis on physical activity/movement in public schools are growing. This dissertation explores current educational research related to the effects of movement on cognitive processing and the potential effects of movement on learning, particularly in a Waldorf-based early childhood program in which movement is integrated into all aspects of learning (including all academic subjects). This dissertation includes a literature review of current research and theory, and a qualitative micro-ethnographic case study of a Waldorf-based early childhood program that involved teacher observations and interviews. Key findings: the Waldorf-based early childhood program provided practical methods for (1) encouraging various modes of free play intended to enhance a child's physical, social/emotional and academic development, (2) integrating teacher-led movements into the daily curriculum, (3) utilizing movement to aid cognitive processing and prepare students for more sedentary academic work, (4) integrating remedial work into the daily classroom curriculum, and (5) utilizing intentional movement to help a child learn to embody stillness as a means of focusing attention and energy. Movements integrated into the curriculum by the teachers created observable positive effects on the students: eagerness to participate, recall, extending focus and attention, and creating social awareness and cooperation. Conclusions: (1) Waldorf-based education programs may provide practical examples and theoretical perspectives relevant to the creation of an integrated and comprehensive movement-based curriculum for the early childhood learner, and (2) The Waldorf teachers studied provide a counter-position to early childhood teaching practices that utilize movement as a break from sedentary learning. This study revealed the effects of imposing or integrating stillness into a movement-rich curriculum. Future recommendations include more comprehensive research on Waldorf-based educational programs and educational research that reaches beyond movement's potential positive or negative effect on a student's academic progress to study in more depth how and why movement impacts learning for the young child. / Dissertation/Thesis / Ed.D. Curriculum and Instruction 2012

Submitted by CAROLINA GULYAS FIGUEIREDO (cafigg@yahoo.com.br) on 2016-07-18T19:03:03Z No. of bitstreams: 1 Dissertacao_carolina gulyas figueiredo.pdf: 1707452 bytes, checksum: 64ac20498db3ad224c5aa00a09774a97 (MD5) / Approved for entry into archive by Ana Paula Grisoto (grisotoana@reitoria.unesp.br) on 2016-07-20T13:03:58Z (GMT) No. of bitstreams: 1 figueiredo_cg_me_bauru.pdf: 1707452 bytes, checksum: 64ac20498db3ad224c5aa00a09774a97 (MD5) / Made available in DSpace on 2016-07-20T13:03:58Z (GMT). No. of bitstreams: 1 figueiredo_cg_me_bauru.pdf: 1707452 bytes, checksum: 64ac20498db3ad224c5aa00a09774a97 (MD5) Previous issue date: 2015-07-08 / O presente trabalho visou identificar e analisar características do Ensino de Ciências no âmbito da Pedagogia Waldorf. A Pedagogia Waldorf, criada em 1919, na Alemanha, por Rudolf Steiner, está presente no mundo todo. Baseada na antroposofia, possui uma estratégia pedagógica que inclui o desenvolvimento físico, psicoemocional e espiritual do aluno. Dentre suas características estão o ensino em épocas (ensino concentrado de 4 a 6 semanas), a forte presença das artes e um processo cognitivo descrito por Goethe, que trata da observação de um fenômeno até que se chegue em sua essência. Foram realizadas entrevistas com seis professores, de cinco escolas, observadas aulas de ciências em duas escolas Waldorf, de São Paulo e de um município da região de São Paulo. Foram analisados documentos como periódicos de encontros de formação continuada em Pedagogia Waldorf e compilações curriculares. Os dados obtidos foram organizados em onze eixos e foi utilizada a análise de conteúdo proposta por Bardin. Este estudo traz uma discussão sobre os objetivos de Rudolf Steiner ao pensar a Pedagogia para o Ensino de Ciências. Os resultados obtidos evidenciam que a Pedagogia Waldorf tem como principal base de estruturação para o Ensino de Ciências a fenomenologia goetheanística, principalmente por não desvencilhar os fenômenos naturais de um mundo espiritual e desta forma, através das práticas de observação o aluno, de maneira inconsciente, compreenda a relação entre o mundo material e espiritual. Ainda espera-se que o aluno seja capaz de reconhecer no mundo natural e em sua vida cotidiana a essência dos fenômenos. A Pedagogia Waldorf adota práticas que incentivam ações humanitárias para que surja no jovem e consequentemente no adulto o impulso de intervir e transformar a realidade social e tem como meta final e longínqua uma sociedade baseada na trimembração social, na qual haja liberdade espiritual, igualdade de direitos e fraternidade econômica. Foi observado também que o Ensino Waldorf tem características interdisciplinares e transdisciplinares. Ainda Educação Waldorf também possui como objetivo o desenvolvimento das capacidades do ser humano, nos âmbitos cognitivo, espiritual, emocional e artístico, como também o estimulo da criatividade, iniciativa e autoconfiança. / This study address to identify and analyze the characteristics of Sciences under the Waldorf Pedagogy Scope. Waldorf Education, established in 1919 in Germany by Rudolf Steiner, is present worldwide. Based on anthroposophy, it has a pedagogical strategy that includes physical, psychoemotional and spiritual development of the student. Among its features are seasonal teaching (concentrated teaching between 4 to 6 weeks), the strong presence of the arts and a cognitive process described by Goethe, which deals with the observation of a phenomenon until it arrives at its core. Six interviews with teachers were conduct in five schools, science classes observed in two Waldorf Schools, being from São Paulo and from a municipality in the São Paulo region. Documents such as periodic meetings of continuing education in Waldorf Pedagogy and curriculum builds were analyzed. The captured data was organized in eleven axes and the content analysis proposed by Bardin was used. This study provides a discussion about the Rudolf Steiner goals when applying pedagogy for the Science Teaching. The results show that Waldorf's Pedagogy m ain base of structure for Science Education is the goetheanístic phenomenology, especially for not disentangling the natural phenomena of a spiritual world and thus, through the observation practices, the student unconsciously understand the relationship between the material and spiritual world. It is yet to expect that the student will be able to recognize in the natural world and in his everyday life the essence of phenomena. Waldorf Education adopts practices that encourage humanitarian actions hoping to arise in the young and consequently in the adult an impulse to intervene and transform the social reality, and has as the ultimate and faraway goal a society based on social threefolding, in which there is spiritual freedom, equal rights and economic fraternity. Was also observed that the Waldorf education has interdisciplinary and transdisciplinary characteristics. Waldorf Education also has the objective of developing the capabilities of the human being, in the cognitive, spiritual, emotional and artistic fields, as well as the stimulation of creativity, initiative and self-confidence.

Submitted by Divisão de Documentação/BC Biblioteca Central (ddbc@ufam.edu.br) on 2017-02-01T19:31:46Z No. of bitstreams: 2 license_rdf: 0 bytes, checksum: d41d8cd98f00b204e9800998ecf8427e (MD5) Dissertação - Ricardo Santos Fonseca.pdf: 3884170 bytes, checksum: c7f03d9fc12e685aabc06b6b6794a61b (MD5) / Approved for entry into archive by Divisão de Documentação/BC Biblioteca Central (ddbc@ufam.edu.br) on 2017-02-01T19:32:02Z (GMT) No. of bitstreams: 2 license_rdf: 0 bytes, checksum: d41d8cd98f00b204e9800998ecf8427e (MD5) Dissertação - Ricardo Santos Fonseca.pdf: 3884170 bytes, checksum: c7f03d9fc12e685aabc06b6b6794a61b (MD5) / Approved for entry into archive by Divisão de Documentação/BC Biblioteca Central (ddbc@ufam.edu.br) on 2017-02-01T19:32:17Z (GMT) No. of bitstreams: 2 license_rdf: 0 bytes, checksum: d41d8cd98f00b204e9800998ecf8427e (MD5) Dissertação - Ricardo Santos Fonseca.pdf: 3884170 bytes, checksum: c7f03d9fc12e685aabc06b6b6794a61b (MD5) / Made available in DSpace on 2017-02-01T19:32:17Z (GMT). No. of bitstreams: 2 license_rdf: 0 bytes, checksum: d41d8cd98f00b204e9800998ecf8427e (MD5) Dissertação - Ricardo Santos Fonseca.pdf: 3884170 bytes, checksum: c7f03d9fc12e685aabc06b6b6794a61b (MD5) Previous issue date: 2016-08-04 / CAPES - Coordenação de Aperfeiçoamento de Pessoal de Nível Superior / In this work, lectures on Optimization Problems Applied Geometry. It presents initially a little history of some classic optimization problems in Euclidean Geometry Plana, as the Isoperimétrico Problem, the Heron Problem an the Steiner Problem. From there, he used that knowledge to build definitions, theorems and propositions regarding the Optimization of Geometry which provided grandiose tools for problem solving that can be applied in high school or in Mathematics Olympics. / Neste trabalho, disserta-se sobre Problemas de Otimização Aplicados à Geometria. Apresentase inicialmente um pouco da história de alguns problemas clássicos de otimização em Geometria Euclidiana Plana, como, o Problema Isoperimétrico, o Problema de Heron e o Problema de Steiner. A partir daí, usou-se esse conhecimento para construir definições, teoremas e proposições a respeito da Otimização em Geometria o que proporcionou grandiosas ferramentas para a resolução de problemas que podem ser aplicados no Ensino Médio ou em Olimpíadas de Matemática.

Dans cette thèse, nous étudions les décompositions arborescentes qui satisfont certaines contraintes supplémentaires et nous proposons des algorithmes pour les calculer dans certaines classes de graphes. Finalement, nous résolvons des problèmes liés au routage en utilisant ces décompositions ainsi que des propriétés structurelles des graphes. Cette thèse est divisée en deux parties. Dans la première partie, nous étudions les décompositions arborescentes satisfaisant des propriétés spécifiques. Dans le Chapitre 2, nous étudions les décompositions de taille minimum, c’est-À-Dire avec un nombre minimum de sacs. Etant donné une entier k 4 fixé, nous prouvons que le problème de calculer une décomposition arborescente de largeur au plus k et de taille minimum est NP-Complet dans les graphes de largeur arborescente au plus 4. Nous décrivons ensuite des algorithmes qui calculent des décompositions de taille minimum dans certaines classes de graphes de largeur arborescente au plus 3. Ces résultats ont été présentés au workshop international ICGT 2014. Dans le Chapitre 3, nous étudions la cordalité des graphes et nous introduisons la notion de k-Good décomposition arborescente. Nous étudions tout d’abord les jeux de Gendarmes et Voleur dans les graphes sans long cycle induit. Notre résultat principal est un algorithme polynomial qui, étant donné un graphe G, soit trouve un cycle induit de longueur au moins k+1, ou calcule une k-Good décomposition de G. Ces résultats ont été publiés à la conférence internationale ICALP’12 et dans la revue internationale Algorithmica. Dans la seconde partie de la thèse, nous nous concentrons sur des problèmes de routage. / A tree decomposition of a graph is a way to represent it as a tree by preserving some connectivity properties of the initial graph. Tree decompositions have been widely studied for their algorithmic applications, in particular using dynamic programming approach. In this thesis, we study tree decompositions satisfying various constraints and design algorithms to compute them in some graph classes. We then use tree decompositions or specific graph properties to solve several problems related to routing. The thesis is divided into two parts. In the first part, we study tree decompositions satisfying some properties. In Chapter 2, we investigate minimum size tree decompositions, i.e., with minimum number of bags. Given a fixed k 4, we prove it is NP-Hard to compute a minimum size decomposition with width at most k in the class of graphs with treewidth at least 4. We design polynomial time algorithms to compute minimum size tree decompositions in some classes of graphs with treewidth at most 3 (including trees). Part of these results will be presented in ICGT 2014. In Chapter 3, we study the chordality (longest induced cycle) of graphs and introduce the notion of good tree decomposition (where each bag must satisfy some particular structure). Precisely, we study the Cops and Robber games in graphs with no long induced cycles. Our main result is the design of a polynomial-Time algorithm that either returns an induced cycle of length at least k+1 of a graph G or compute a k-Good tree decomposition of G. These results have been published in ICALP 2012 and Algorithmica. In the second part of the thesis, we focus on routing problems.