Sexualidade e orientação sexual na escola em foco: algumas reflexões sobre a formação de professores

This article discusses the training of teachers to work with sexuality issues in regular school environment after the creation of the National Curriculum (PCNs) in 1997. The authors note that over a decade there have been no official regular and systematic initiatives or incentives to provide teachers with sex education disciplines at undergraduate level in Pedagogy, Teachers’ Training, Continuing Education or Initial Training courses, with rare exceptions. Generally the work with sexuality and sex education carry with it some coadjutors such as ignorance, prejudice, taboo and discrimination. In this way, if teachers are prepared to approach the field, they will experience a significant gain in performance and in the psycho-social development of their students, as well as work in a process of citizenship education.

O corpo: entre o sofrimento e a criatividade

Bodily and gender subjective experiences challenge Psychoanalysis to reconsider its conceptual apparatus and to sustain an ethics which enables a careful and attentive listening. It puts into question the existence of a taboo in relation to the body that would prevent this listening. Bodily interventions and changes observed in transsexuals and transgender people experiences have been the subject of efforts to approximate Psychoanalysis and Queer Theory. We believe that this approximation will bring us the possibility to formulate concepts that might clear up the understanding of these experiences. In order to investigate the status of the body we separate it from gender and sexual norms by choosing three interlocutors: psychiatry - the hormone treatment of adolescent transsexuals; art and biotechnological feminism. This way of considering things allows us to take into account different aspects of deconstruction and reconstruction of the body.

Uma das faces mais obscuras deste país: a prostituição pautada pelo conexão repórter

This Project proposes a study of three documentaries about prostitution produced by a television program, Conexão Repórter (http://www.sbt.com.br/conexaoreporter/). These Journalistic Productions were chosen because they are episodes of a high-visibility program which purpose is to show the backstage of news. The study is based on social-anthropological productions about gender and sexuality, besides national and international literature about the subject. The analyses are completed with contributions from Journalism Theories, like Framing and Agenda-Setting. The studies developed by Michel Foucault on the historic aspect of sexuality will also be useful to support the ideas presented throughout the project. The goal is to analyze the construction of narratives about prostitution in all productions, taking as initial hypotheses that documentaries continue to reproduce stereotypes about the subject and, especially, what is the reason for such reproduction. The research seeks answers about journalist's challenges approaching prostitution. Starting from the hypothesis that the episodes in the study approach prostitution based on stereotypes, which other possible ways there may be to address the subject on TV documentaries? The goal is to relate the plots constructed by the reporting team with the theory in order to analyze discourses about the issue

A família e o indivíduo no curso vital: compreensão trigeracional sobre a morte e o morrer

The death has been considered a forbidden issue. To develop studies that promote reflections about it allows the enlargement of the understanding as regarding the death as about life in that both are related during the human existence. This research aimed to understand the death’s conceptions and family meanings to three different generations. For this goal, through phenomenological methodology, were achieved individual interviews with adolescents, both his parents and the grandfather, all belonging to the same family. After to understand the participant’s experiences, six thematic categories were created: a) Death’s meanings; b) The death of himself; c) The death of another and/or its possibility; d) Sources of support; e) The family in the death’s presence; f) The life in the death’s inevitability presence. From these categories, the dates were phenomenologically. The participants showed similar reports in several times, confirming the literature that says that the daily life experiences among the family members take the family to form a peculiar way to understand and an interpret their experiences. This identity family, however, did not prevent each participant to develop his particular history based in idiosyncratic elements and associated with the stage of life cycle that it is. The reports showed that the prohibition of death in society is still very present, which prevents that discussions about the issue are present in daily life. This study provided for participants to reflect on their experiences around the phenomenon of death and, consequently, about the inseparable relationship between living and dying. It has also reiterated the literature, showing the similarity of views among the family members of three generations face a vital phenomenon potentially impacting the life cycle of individual and family.

Meta-heurísticas para o problema de planejamento de expansão da rede de transmissão de energia elétrica considerando restrições de segurança

Pós-graduação em Engenharia Elétrica - FEIS

Survivable Lightpath Provisioning in WDM Mesh Networks Under Shared Path Protection and Signal Quality Constraints

This paper addresses the problem of survivable lightpath provisioning in wavelength-division-multiplexing (WDM) mesh networks, taking into consideration optical-layer protection and some realistic optical signal quality constraints. The investigated networks use sparsely placed optical–electrical–optical (O/E/O) modules for regeneration and wavelength conversion. Given a fixed network topology with a number of sparsely placed O/E/O modules and a set of connection requests, a pair of link-disjoint lightpaths is established for each connection. Due to physical impairments and wavelength continuity, both the working and protection lightpaths need to be regenerated at some intermediate nodes to overcome signal quality degradation and wavelength contention. In the present paper, resource-efficient provisioning solutions are achieved with the objective of maximizing resource sharing. The authors propose a resource-sharing scheme that supports three kinds of resource-sharing scenarios, including a conventional wavelength-link sharing scenario, which shares wavelength links between protection lightpaths, and two new scenarios, which share O/E/O modules between protection lightpaths and between working and protection lightpaths. An integer linear programming (ILP)-based solution approach is used to find optimal solutions. The authors also propose a local optimization heuristic approach and a tabu search heuristic approach to solve this problem for real-world, large mesh networks. Numerical results show that our solution approaches work well under a variety of network settings and achieves a high level of resource-sharing rates (over 60% for O/E/O modules and over 30% for wavelength links), which translate into great savings in network costs.

Dynamic Traffic Grooming Algorithms for Reconfigurable SONET Over WDM Networks

The emergence of wavelength-division multiplexing (WDM) technology provides the capability for increasing the bandwidth of synchronous optical network (SONET) rings by grooming low-speed traffic streams onto different high-speed wavelength channels. Since the cost of SONET add–drop multiplexers (SADM) at each node dominates the total cost of these networks, how to assign the wavelength, groom the traffic, and bypass the traffic through the intermediate nodes has received a lot of attention from researchers recently. Moreover, the traffic pattern of the optical network changes from time to time. How to develop dynamic reconfiguration algorithms for traffic grooming is an important issue. In this paper, two cases (best fit and full fit) for handling reconfigurable SONET over WDM networks are proposed. For each approach, an integer linear programming model and heuristic algorithms (TS-1 and TS-2, based on the tabu search method) are given. The results demonstrate that the TS-1 algorithm can yield better solutions but has a greater running time than the greedy algorithm for the best fit case. For the full fit case, the tabu search heuristic yields competitive results compared with an earlier simulated annealing based method and it is more stable for the dynamic case.

Survivable Traffic Grooming With Path Protection at the Connection Level in WDM Mesh Networks

Survivable traffic grooming (STG) is a promising approach to provide reliable and resource-efficient multigranularity connection services in wavelength-division-multiplexing (WDM) optical networks. In this paper, we study the STG problem in WDM mesh optical networks employing path protection at the connection level. Both dedicated-protection and shared-protection schemes are considered. Given network resources, the objective of the STG problem is to maximize network throughput. To enable survivability under various kinds of single failures, such as fiber cut and duct cut, we consider the general shared-risklink- group (SRLG) diverse routing constraints. We first resort to the integer-linear-programming (ILP) approach to obtain optimal solutions. To address its high computational complexity, we then propose three efficient heuristics, namely separated survivable grooming algorithm (SSGA), integrated survivable grooming algorithm (ISGA), and tabu-search survivable grooming algorithm (TSGA). While SSGA and ISGA correspond to an overlay network model and a peer network model, respectively, TSGA further improves the grooming results from SSGA and ISGA by incorporating the effective tabu-search (TS) method. Numerical results show that the heuristics achieve comparable solutions to the ILP approach, which uses significantly longer running times than the heuristics.

Survivable Virtual Topology Routing under Shared Risk Link Groups in WDM Networks

Network survivability is one of the most important issues in the design of optical WDM networks. In this work we study the problem of survivable routing of a virtual topology on a physical topology with Shared Risk Link Groups (SRLG). The survivable virtual topology routing problem against single-link failures in the physical topology is proved to be NP-complete in [1]. We prove that survivable virtual topology routing problem against SRLG/node failures is also NP-complete. We present an improved integer linear programming (ILP) formulation (in comparison to [1]) for computing the survivable routing under SRLG/node failures. Using an ILP solver, we computed the survivable virtual topology routing against link and SRLG failures for small and medium sized networks efficiently. As even our improved ILP formulation becomes intractable for large networks, we present a congestion-based heuristic and a tabu search heuristic (which uses the congestion-based heuristic solution as the initial solution) for computing survivable routing of a virtual topology. Our experimental results show that tabu search heuristic coupled with the congestion based heuristic (used as initial solution) provides fast and near-optimal solutions.

Survivable Traffic Grooming with Path Protection at the Connection Level in WDM Mesh Networks

Survivable traffic grooming (STG) is a promising approach to provide reliable and resource-efficient multigranularity connection services in wavelength division multiplexing (WDM) optical networks. In this paper, we study the STG problem in WDM mesh optical networks employing path protection at the connection level. Both dedicated protection and shared protection schemes are considered. Given the network resources, the objective of the STG problem is to maximize network throughput. To enable survivability under various kinds of single failures such as fiber cut and duct cut, we consider the general shared risk link group (SRLG) diverse routing constraints. We first resort to the integer linear programming (ILP) approach to obtain optimal solutions. To address its high computational complexity, we then propose three efficient heuristics, namely separated survivable grooming algorithm (SSGA), integrated survivable grooming algorithm (ISGA) and tabu search survivable grooming algorithm (TSGA). While SSGA and ISGA correspond to an overlay network model and a peer network model respectively, TSGA further improves the grooming results from SSGA and ISGA by incorporating the effective tabu search method. Numerical results show that the heuristics achieve comparable solutions to the ILP approach, which uses significantly longer running times than the heuristics.

Generating unconstrained two-dimensional non-guillotine cutting patterns by a Recursive Partitioning Algorithm

In this study, a dynamic programming approach to deal with the unconstrained two-dimensional non-guillotine cutting problem is presented. The method extends the recently introduced recursive partitioning approach for the manufacturer's pallet loading problem. The approach involves two phases and uses bounds based on unconstrained two-staged and non-staged guillotine cutting. The method is able to find the optimal cutting pattern of a large number of pro blem instances of moderate sizes known in the literature and a counterexample for which the approach fails to find known optimal solutions was not found. For the instances that the required computer runtime is excessive, the approach is combined with simple heuristics to reduce its running time. Detailed numerical experiments show the reliability of the method. Journal of the Operational Research Society (2012) 63, 183-200. doi: 10.1057/jors.2011.6 Published online 17 August 2011

Combining meta-learning and search techniques to select parameters for support vector machines

Support Vector Machines (SVMs) have achieved very good performance on different learning problems. However, the success of SVMs depends on the adequate choice of the values of a number of parameters (e.g., the kernel and regularization parameters). In the current work, we propose the combination of meta-learning and search algorithms to deal with the problem of SVM parameter selection. In this combination, given a new problem to be solved, meta-learning is employed to recommend SVM parameter values based on parameter configurations that have been successfully adopted in previous similar problems. The parameter values returned by meta-learning are then used as initial search points by a search technique, which will further explore the parameter space. In this proposal, we envisioned that the initial solutions provided by meta-learning are located in good regions of the search space (i.e. they are closer to optimum solutions). Hence, the search algorithm would need to evaluate a lower number of candidate solutions when looking for an adequate solution. In this work, we investigate the combination of meta-learning with two search algorithms: Particle Swarm Optimization and Tabu Search. The implemented hybrid algorithms were used to select the values of two SVM parameters in the regression domain. These combinations were compared with the use of the search algorithms without meta-learning. The experimental results on a set of 40 regression problems showed that, on average, the proposed hybrid methods obtained lower error rates when compared to their components applied in isolation.

Column generation for a multitrip vehicle routing problem with time windows, driver work hours, and heterogeneous fleet

This study addresses a vehicle routing problem with time windows, accessibility restrictions on customers, and a fleet that is heterogeneous with regard to capacity and average speed. A vehicle can performmultiple routes per day, all starting and ending at a single depot, and it is assigned to a single driverwhose totalwork hours are limited.Acolumn generation algorithmis proposed.The column generation pricing subproblem requires a specific elementary shortest path problem with resource constraints algorithm to address the possibility for each vehicle performingmultiple routes per day and to address the need to set the workday’s start time within the planning horizon. A constructive heuristic and a metaheuristic based on tabu search are also developed to find good solutions.

Sexualförbrytare- offer eller gärningsman?

Syftet med uppsatsen är att jämföra och se likheter respektive skillnader i förklaringen till ett sexuellt brottsligt beteende. Vi har valt att använda oss av en litteraturstudie som utgör grunden för en kvalitativ studie. Vi har tidigare granskat forskning som gjorts angående sexualförbrytare, beträffande förklarings- och behandlingsmodeller. Vår avgränsning är män över 18 år i Sverige. För att få aktuella uppgifter om behandling gjordes en intervju med en psykolog inom kriminalvården som dagligen arbetar med sexualförbrytare. Detta gjordes för att kunna analysera och kritiskt granska vår teoretiska referensram. Vi konstaterade ett förändrat synsätt, som tog sikte på rehabilitering med kognitiv beteendeterapi och med ett behandlingsprogram som kallas ROS. Grunden i kursen Relation Och Samlevnad bygger på gruppterapeutiskt tänkande. Genom metoden får männen insikt i sin egen avvikelse samt bättre förståelse för orsakerna till sitt eget beteende. Barndomen hos förövarna karakteriseras i regel av traumatiska upplevelser och sexuella övergrepp ofta i kombination med relationsproblem inom familjen. Det tabu mot incest som finns i en normal föräldrarelation fungerar inte i uppväxtfamiljen och samma beteende upprepas av förövaren mot andra individer, barn eller kvinnor. Senare i diskussionen presenterar vi några tankar och åsikter som hos oss under arbetets gång dykt upp.

Heuristic algorithms for the Capacitated Location-Routing Problem and the Multi-Depot Vehicle Routing Problem

The Capacitated Location-Routing Problem (CLRP) is a NP-hard problem since it generalizes two well known NP-hard problems: the Capacitated Facility Location Problem (CFLP) and the Capacitated Vehicle Routing Problem (CVRP). The Multi-Depot Vehicle Routing Problem (MDVRP) is known to be a NP-hard since it is a generalization of the well known Vehicle Routing Problem (VRP), arising with one depot. This thesis addresses heuristics algorithms based on the well-know granular search idea introduced by Toth and Vigo (2003) to solve the CLRP and the MDVRP. Extensive computational experiments on benchmark instances for both problems have been performed to determine the effectiveness of the proposed algorithms. This work is organized as follows: Chapter 1 describes a detailed overview and a methodological review of the literature for the the Capacitated Location-Routing Problem (CLRP) and the Multi-Depot Vehicle Routing Problem (MDVRP). Chapter 2 describes a two-phase hybrid heuristic algorithm to solve the CLRP. Chapter 3 shows a computational comparison of heuristic algorithms for the CLRP. Chapter 4 presents a hybrid granular tabu search approach for solving the MDVRP.