Reconfiguração de sistemas de distribuição operando em vários níveis de demanda através de uma meta-heurística de busca em vizinhança variável

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

Hard machining, glaze firing and hydrofluoric acid etching: Do these procedures affect the flexural strength of a leucite glass-ceramic?

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

Projeto de controlador gain scheduling usando realimentação derivativa via LMI

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

Abordagem icônica para modelagem e simulação de ambientes de computação em nuvem ?

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

Joint Computing and Network Resource Scheduling in a Lambda Grid Network

Data-intensive Grid applications require huge data transfers between grid computing nodes. These computing nodes, where computing jobs are executed, are usually geographically separated. A grid network that employs optical wavelength division multiplexing (WDM) technology and optical switches to interconnect computing resources with dynamically provisioned multi-gigabit rate bandwidth lightpath is called a Lambda Grid network. A computing task may be executed on any one of several computing nodes which possesses the necessary resources. In order to reflect the reality in job scheduling, allocation of network resources for data transfer should be taken into consideration. However, few scheduling methods consider the communication contention on Lambda Grids. In this paper, we investigate the joint scheduling problem while considering both optical network and computing resources in a Lambda Grid network. The objective of our work is to maximize the total number of jobs that can be scheduled in a Lambda Grid network. An adaptive routing algorithm is proposed and implemented for accomplishing the communication tasks for every job submitted in the network. Four heuristics (FIFO, ESTF, LJF, RS) are implemented for job scheduling of the computational tasks. Simulation results prove the feasibility and efficiency of the proposed solution.

Joint Computing and Network Resource Scheduling in a Lambda Grid Network

Data-intensive Grid applications require huge data transfers between grid computing nodes. These computing nodes, where computing jobs are executed, are usually geographically separated. A grid network that employs optical wavelength division multiplexing (WDM) technology and optical switches to interconnect computing resources with dynamically provisioned multi-gigabit rate bandwidth lightpath is called a Lambda Grid network. A computing task may be executed on any one of several computing nodes which possesses the necessary resources. In order to reflect the reality in job scheduling, allocation of network resources for data transfer should be taken into consideration. However, few scheduling methods consider the communication contention on Lambda Grids. In this paper, we investigate the joint scheduling problem while considering both optical network and computing resources in a Lambda Grid network. The objective of our work is to maximize the total number of jobs that can be scheduled in a Lambda Grid network. An adaptive routing algorithm is proposed and implemented for accomplishing the communication tasks for every job submitted in the network. Four heuristics (FIFO, ESTF, LJF, RS) are implemented for job scheduling of the computational tasks. Simulation results prove the feasibility and efficiency of the proposed solution.

Dynamic Lightpath Scheduling in Next-Generation WDM Optical Networks

Lightpath scheduling is an important capability in next-generation wavelength-division multiplexing (WDM) optical networks to reserve resources in advance for a specified time period while provisioning end-to-end lightpaths. In this study, we propose an approach to support dynamic lightpath scheduling in such networks. To minimize blocking probability in a network that accommodates dynamic scheduled lightpath demands (DSLDs), resource allocation should be optimized in a dynamic manner. However, for the network users who desire deterministic services, resources must be reserved in advance and guaranteed for future use. These two objectives may be mutually incompatible. Therefore, we propose a two-phase dynamic lightpath scheduling approach to tackle this issue. The first phase is the deterministic lightpath scheduling phase. When a lightpath request arrives, the network control plane schedules a path with guaranteed resources so that the user can get a quick response with the deterministic lightpath schedule. The second phase is the lightpath re-optimization phase, in which the network control plane re-provisions some already scheduled lightpaths. Experimental results show that our proposed two-phase dynamic lightpath scheduling approach can greatly reduce WDM network blocking.

A Two-phase Approach for Dynamic Lightpath Scheduling in WDM Optical Networks

Lightpath scheduling is an important capability in next-generation wavelength-division multiplexing (WDM) optical networks to reserve resources in advance for a specified time period while provisioning end-to-end lightpaths. In a dynamic environment, the end user requests for dynamic scheduled lightpath demands (D-SLDs) need to be serviced without the knowledge of future requests. Even though the starting time of the request may be hours or days from the current time, the end-user however expects a quick response as to whether the request could be satisfied. We propose a two-phase approach to dynamically schedule and provision D-SLDs. In the first phase, termed the deterministic lightpath scheduling phase, upon arrival of a lightpath request, the network control plane schedules a path with guaranteed resources so that the user can get a quick response with a deterministic lightpath schedule. In the second phase, termed the lightpath re-optimization phase, we re-provision some already scheduled lightpaths to re-optimize for improving network performance. We study two reoptimization scenarios to reallocate network resources while maintaining the existing lightpath schedules. Experimental results show that our proposed two-phase dynamic lightpath scheduling approach can greatly reduce network blocking.

An Efficient Scheduling Scheme For On-Demand Lightpath Reservations In Reconfigurable WDM Optical Networks

We propose an efficient scheduling scheme that optimizes advance-reserved lightpath services in reconfigurable WDM networks. A re-optimization approach is devised to reallocate network resources for dynamic service demands while keeping determined schedule unchanged.

A Preliminary Linkage Map of the Hard Tick, Ixodes Scapularis

Blackwell Publishing Ltd. A linkage map of the Ixodes scapularis genome was constructed, based upon segregation amongst 127 loci. These included 84 random amplified polymorphic DNA (RAPD) markers, 32 Sequence-Tagged RAPD (STAR) markers, 5 cDNAs, and 5 microsatellites in 232 F1 intercross progeny from a single, field-collected P1 female. A preliminary linkage map of 616 cM was generated across 14 linkage groups with one marker every 10.8 cM. Assuming a genome size of ~ 10 9 bp, the relationship of physical to genetic distance was found to be ~ 300 kb/cM in the I. scapularis genome.

QUANTITATIVE TRAIT LOCI FOR AGRONOMIC AND END-USE QUALITY PERFORMANCE AND THE EFFECT OF SOILBORNE WHEAT MOSAIC VIRUS IN A HARD WINTER WHEAT POPULATION IN NEBRASKA

To better understand agronomic and end-use quality in wheat (Triticum aestivum L.) we developed a population containing 154 F6:8 recombinant inbred lines (RILs) from the cross TAM107-R7/Arlin. The parental lines and RILs were phenotyped at six environments in Nebraska and differed for resistance to Wheat soilborne mosaic virus (WSBMV), morphological, agronomic, and end-use quality traits. Additionally, a 2300 cM genome-wide linkage map was created for quantitative trait loci (QTL) analysis. Based on our results across multiple environments, the best RILs could be used for cultivar improvement. The population and marker data are publicly available for interested researchers for future research. The population was used to determine the effect of WSBMV on agronomic and end-use quality and for the mapping of a resistance locus. Results from two infected environments showed that all but two agronomic traits were significantly affected by the disease. Specifically, the disease reduced grain yield by 30% of susceptible RILs and they flowered 5 d later and were 11 cm shorter. End-use quality traits were not negatively affected but flour protein content was increased in susceptible RILs. The resistance locus SbmTmr1 mapped to 27.1 cM near marker wPt-5870 on chromosome 5DL using ELISA data. Finally, we investigated how WSBMV affected QTL detection in the population. QTLs were mapped at two WSBMV infected environments, four uninfected environments, and in the resistant and susceptible RIL subpopulations in the infected environments. Fifty-two significant (LOD≥3) QTLs were mapped in RILs at uninfected environments. Many of the QTLs were pleiotropic or closely linked at 6 chromosomal regions. Forty-seven QTLs were mapped in RILs at WSBMV infected environments. Comparisons between uninfected and infected environments identified 20 common QTLs and 21 environmentally specific QTLs. Finally, 24 QTLs were determined to be affected by WSBMV by comparing the subpopulations in QTL analyses within the same environment. The comparisons were statistically validated using marker by disease interactions. These results showed that QTLs can be affected by WSBMV and careful interpretation of QTL results is needed where biotic stresses are present. Finally, beneficial QTLs not affected by WSBMV or the environment are candidates for marker-assisted selection.

Robust Hybrid Mechanisms for Scheduling of Grid Tasks

This paper proposes three new hybrid mechanisms for the scheduling of grid tasks, which integrate reactive and proactive approaches. They differ by the scheduler used to define the initial schedule of an application and by the scheduler used to reschedule the application. The mechanisms are compared to reactive and proactive mechanisms. Results show that hybrid approach produces performance close to that of the reactive mechanisms, but demanding less migrations.

Integrated pulp and paper mill planning and scheduling

This article describes a real-world production planning and scheduling problem occurring at an integrated pulp and paper mill (P&P) which manufactures paper for cardboard out of produced pulp. During the cooking of wood chips in the digester, two by-products are produced: the pulp itself (virgin fibers) and the waste stream known as black liquor. The former is then mixed with recycled fibers and processed in a paper machine. Here, due to significant sequence-dependent setups in paper type changeovers, sizing and sequencing of lots have to be made simultaneously in order to efficiently use capacity. The latter is converted into electrical energy using a set of evaporators, recovery boilers and counter-pressure turbines. The planning challenge is then to synchronize the material flow as it moves through the pulp and paper mills, and energy plant, maximizing customer demand (as backlogging is allowed), and minimizing operation costs. Due to the intensive capital feature of P&P, the output of the digester must be maximized. As the production bottleneck is not fixed, to tackle this problem we propose a new model that integrates the critical production units associated to the pulp and paper mills, and energy plant for the first time. Simple stochastic mixed integer programming based local search heuristics are developed to obtain good feasible solutions for the problem. The benefits of integrating the three stages are discussed. The proposed approaches are tested on real-world data. Our work may help P&P companies to increase their competitiveness and reactiveness in dealing with demand pattern oscillations. (C) 2012 Elsevier Ltd. All rights reserved.

Using the Hard, Randy, and Rittler Test to Evaluate Color Vision in Capuchins (Cebus libidinosus)

The identification of color vision types in primates is fundamental to understanding the evolution and biological function of color perception. The Hard, Randy, and Rittler (HRR) pseudoisochromatic test categorizes human color vision types successfully. Here we provide an experimental setup to employ HRR in a nonhuman primate, the capuchin (Cebus libidinosus), a platyrrhine with polymorphic color vision. The HRR test consists of plates with a matrix composed of gray circles that vary in size and brightness. Differently colored circles form a geometric shape (X, O, or Delta) that is discriminated visually from the gray background pattern. The ability to identify these shapes determines the type of dyschromatopsy (deficiency in color vision). We tested six capuchins in their own cages under natural sunlight. The subjects chose between two HRR plates in each trial: one with the gray pattern only and the other with a colored shape, presented on the left or right side at random. We presented the test 40 times and calculated the 95 % confidence limits for chance performance based on the binomial test. We also genotyped all subjects for exons 3 and 5 of the X-linked opsin genes. The HRR test diagnosed two subjects as protan dichromats (missing or defective L-cone), three as deutan dichromats (missing or defective M-cone), and one female as trichromat. Genetic analysis supported the behavioral data for all subjects. These findings show that the HRR test can be applied to diagnose color vision in nonhuman primates.

Asynchronous teams for joint lot-sizing and scheduling problem in flow shops

The integrated production scheduling and lot-sizing problem in a flow shop environment consists of establishing production lot sizes and allocating machines to process them within a planning horizon in a production line with machines arranged in series. The problem considers that demands must be met without backlogging, the capacity of the machines must be respected, and machine setups are sequence-dependent and preserved between periods of the planning horizon. The objective is to determine a production schedule to minimise the setup, production and inventory costs. A mathematical model from the literature is presented, as well as procedures for obtaining feasible solutions. However, some of the procedures have difficulty in obtaining feasible solutions for large-sized problem instances. In addition, we address the problem using different versions of the Asynchronous Team (A-Team) approach. The procedures were compared with literature heuristics based on Mixed Integer Programming. The proposed A-Team procedures outperformed the literature heuristics, especially for large instances. The developed methodologies and the results obtained are presented.