O processo de ensino aprendizagem da educação no trânsito por meio da construção de um personagem heróico

This research project aims to study the relationship between the myths and the automobile, the contributions to the literature of fairy tales and the possible contributions of the heroes of fairy tales can bring to the process of teaching and learning defensive behavior in traffic. Traffic is a phenomenon so common to modern societies that often do not pay attention to their relevance as synonymous with social space and contains diversity of people and behaviors. To counter the image of fatalistic accidents and transgressions, will support us in the virtues of the hero figure to culminate in a collective tale in which children want to rethink their behavior, becoming citizens, with a more preventative and better quality of life. The research will be held in four rooms of elementary school in a city public school that serves children from families of the urban popular classes. The research will seek to analyze how the design of transit for the children and what the increase attributed to the theme, after the establishment of a collective story

Melhoria do nível de serviço no atendimento ao cliente por meio da estrutura direta de distribuição Transit Point

Increasingly competitive markets have driven the search for companies in many different ways to win and keep customers. The service level is basically the performance of companies in fulfilling the orders made, or how companies demonstrate to their clients efforts in their behalf. This work aims to solve the difficulties faced by a multinational company present in Brazil, in the distribution of its products in the category Ice Cream in order to improve the service level of their customers. Review the logistics network and concepts related to the distribution system of products is one of several ways to achieve this goal, as well as the use of IT and tools to assist in planning and programming of the physical distribution of products. In this study we used the concept of direct distribution system called Transit Point (TP). The TP provides at the same time, a strategy of rapid response, flexibility, low transportation costs and no inventory. A router - software capable of simulating the actual conditions experienced in the daily distribution - was used to assist in calculations. Results showed reductions of up to 47.5% in transportation costs and better conditions were provided in the distribution of products, positively impacting on service levels and in the maintenance of products quality, with a reduction of 1.6% of the total costs involve

Optimizing urban traffic flow using genetic algorithm with petri net analysis as fitness function

This paper describes a new methodology adopted for urban traffic stream optimization. By using Petri net analysis as fitness function of a Genetic Algorithm, an entire urban road network is controlled in real time. With the advent of new technologies that have been published, particularly focusing on communications among vehicles and roads infrastructures, we consider that vehicles can provide their positions and their destinations to a central server so that it is able to calculate the best route for one of them. Our tests concentrate on comparisons between the proposed approach and other algorithms that are currently used for the same purpose, being possible to conclude that our algorithm optimizes traffic in a relevant manner.

Influence of post-transplant immunosuppressive therapy on gastrointestinal transit using biomagnetic method: a pilot study

Conselho Nacional de Desenvolvimento Científico e Tecnológico (CNPq)

Bupropion treatment increases epididymal contractility and impairs sperm quality with no effects on the epididymal sperm transit time of male rats

Bupropion is a dopamine (DA) and norepinephrine (NE) reuptake inhibitor used as smoking cessation and antidepressant drug with a lower incidence of male sexual dysfunction. We showed previously that sibutramine, a norepinephrine/serotonine reuptake inhibitor, reduced male rat fertility. As there are no studies evaluating the impact of bupropion treatment on spermatic parameters and male fertility, we evaluated the effects of bupropion treatment (15 and 30 mg kg(-1), 30 days) on sexual behavior, spermatic parameters and fertility of male Wistar rats and on the epididymal duct in vitro contractility. Bupropion 15 mg kg(-1) increased the serum luteinizing hormone level and the epididymal duct contractility, but the sperm quality was not affected. At 30 mg kg(-1) bupropion impaired sperm quality increasing the incidence of non-progressive sperm. The male sexual behavior and fertility were not modified at both bupropion doses. These results, in rats, suggest the importance of studies evaluating the effects of bupropion on the human male sperm quality.

Mutagenicity profile of atmospheric particulate matter in a small urban center subjected to airborne emission from vehicle traffic and sugar cane burning

Atmospheric particulate matter (PM) is genotoxic and recently was classified as carcinogenic to humans by the International Agency for Research on Cancer. PM chemical composition varies depending on source and atmospheric conditions. The Salmonella/microsome assay is the most used mutagenicity test and can identify the major chemical classes responsible for observed mutagenicity. The objective of this work was to characterize the mutagenicity of PM samples from a countryside city, Limeira, Brazil, which is influenced by heavy traffic and sugar cane biomass burning. Six samples of total PM were collected. Air mass backward trajectories were calculated. Organic extracts were assayed using the Salmonella/microsome microsuspension mutagenicity assay using TA98, YG1041, and TA1538, with and without metabolic activation (S9). YG1041 was the most sensitive strain and mutagenicity reached 9,700 revertants per m(3) without metabolic activation. Potency for TA1538 was higher than TA98, indicating that this strain should be considered in air mutagenicity studies. The increased response to YG1041 relative to TA98, and the decreased response with S9, suggests that nitroaromatics are the major contributors. Limeira is among the most mutagenic cities in the world. High mutagenicity in Limeira seems to occur when the air mass from the area of sugarcane production is mixed with air from the region impacted by anthropogenic activities such as traffic. An increase in the formation of nitro-polycyclic aromatic hydrocarbons may result from longer contact time between the aromatic compounds and the atmosphere with high NOx and ozone concentration, although more studies are required to confirm this hypothesis. Environ. Mol. Mutagen., 2015. © 2015 Wiley Periodicals, Inc.

Comparison between common traffic lights and three types of traffic lights with visual cycle a safety and capacity analysis

The objective of this paper is compare the common traffic lights (CTL) to three different types of traffic lights with countdown displays (SCD) and assess their effects on road safety and capacity. This comparison is required because the results found in the literature are divergent among countries and cities, and one of the SCD analyzed in our study is different from the SCD used worldwide. An observational before-after study was conducted to evaluate the safety and capacity in a period of one year before and one year after the implementation of the SCD in three Brazilian cities. The results indicate that the SCD models 1 and 3 had around 35%±14% reduction in the total number of accidents; the model 2, does not have significant reduction. In order to perform the capacity analysis a framework for data collection and an adaptation for estimation of initial lost time in each phase were developed. Considering the capacity analysis there was a reduction around 11% in the lost time in SCD model 1, 7% in SCD model 2 and 3% in SCD model 3. However the implications of this on capacity are trifle due to a small increase in the average headways for all SCD models compare to CTL.

Zonas Estratégicas e Estruturais para os Trânsitos Ilícitos (ZEETI): desafios à zona de paz na América do Sul

Coordenação de Aperfeiçoamento de Pessoal de Nível Superior (CAPES)

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.

Centralized vs. Distributed Connection Management Schemes under Different Traffic Patterns in Wavelength-Convertible Optical Networks

Centralized and Distributed methods are two connection management schemes in wavelength convertible optical networks. In the earlier work, the centralized scheme is said to have lower network blocking probability than the distributed one. Hence, much of the previous work in connection management has focused on the comparison of different algorithms in only distributed scheme or in only centralized scheme. However, we believe that the network blocking probability of these two connection management schemes depends, to a great extent, on the network traffic patterns and reservation times. Our simulation results reveal that the performance improvement (in terms of blocking probability) of centralized method over distributed method is inversely proportional to the ratio of average connection interarrival time to reservation time. After that ratio increases beyond a threshold, those two connection management schemes yield almost the same blocking probability under the same network load. In this paper, we review the working procedure of distributed and centralized schemes, discuss the tradeoff between them, compare these two methods under different network traffic patterns via simulation and give our conclusion based on the simulation data.

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.

Rerouting Schemes for Dynamic Traffic Grooming in Optical WDM Mesh Networks

Traffic grooming in optical WDM mesh networks is a two-layer routing problem to effectively pack low-rate connections onto high-rate lightpaths, which, in turn, are established on wavelength links. In this work, we employ the rerouting approach to improve the network throughput under the dynamic traffic model. We propose two rerouting schemes, rerouting at lightpath level (RRAL) and rerouting at connection level (RRAC). A qualitative comparison is made between RRAL and RRAC. We also propose the critical-wavelength-avoiding one-lightpath-limited (CWA-1L) and critical-lightpath-avoiding one-connection-limited (CLA-1C) rerouting heuristics, which are based on the two rerouting schemes respectively. Simulation results show that rerouting reduces the connection blocking probability significantly.

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 in the traffic and bypass the traffic through the intermediate nodes has received a lot of attention from researchers recently.

Performance Analysis of Sparse Traffic Grooming in WDM Mesh Networks

Sparse traffic grooming is a practical problem to be addressed in heterogeneous multi-vendor optical WDM networks where only some of the optical cross-connects (OXCs) have grooming capabilities. Such a network is called as a sparse grooming network. The sparse grooming problem under dynamic traffic in optical WDM mesh networks is a relatively unexplored problem. In this work, we propose the maximize-lightpath-sharing multi-hop (MLS-MH) grooming algorithm to support dynamic traffic grooming in sparse grooming networks. We also present an analytical model to evaluate the blocking performance of the MLS-MH algorithm. Simulation results show that MLSMH outperforms an existing grooming algorithm, the shortest path single-hop (SPSH) algorithm. The numerical results from analysis show that it matches closely with the simulation. The effect of the number of grooming nodes in the network on the blocking performance is also analyzed.