3 resultados para Genetic Algorithms and Simulated Annealing
em DigitalCommons@University of Nebraska - Lincoln
Resumo:
The Black Sea is a semi-enclosed body of water that differs from the adjacent Mediterranean Sea in terms of its biodiversity, oceanographical and ecological characteristics. There is growing international concern about pollution in the Black Sea and other anthropogenic threats to its fauna. The bottlenose dolphin (Tursiops truncatus) is one of three species of cetaceans living in the Azov-Black Sea basin. Despite considerable research on bottlenose dolphins elsewhere, the extent of human impacts on the Black Sea populations is unknown. Previous attempts to award special conservation status to Black Sea cetaceans have failed specifically because policy makers have viewed their ecological and evolutionary uniqueness as equivocal. This study assessed divergence between Black Sea, Mediterranean Sea and Atlantic Ocean bottlenose dolphins for 26 cranial measurements (n = 75 adult bottlenose dolphin skulls) and mitochondrial DNA (n = 99 individuals). Black Sea bottlenose dolphins are smaller than those in the Mediterranean, and possess a uniquely shaped skull. As in a previous study, we found the Black Sea population to be genetically distinct, with relatively low levels of mtDNA diversity. Population genetic models suggest that Black Sea bottlenose dolphins have so little gene flow with the Mediterranean due to historical isolation that they should be managed separately.
Resumo:
Townsend’s big-eared bat, Corynorhinus townsendii, is distributed broadly across western North America and in two isolated, endangered populations in central and eastern United States. There are five subspecies of C. townsendii; C. t. pallescens, C. t. australis, C. t. townsendii, C. t. ingens, and C. t. virginianus with varying degrees of concern over the conservation status of each. The aim of this study was to use mitochondrial and microsatellite DNA data to examine genetic diversity, population differentiation, and dispersal of three C. townsendii subspecies. C. t. virginianus is found in isolated populations in the eastern United States and was listed as endangered under the Endangered Species Act in 1979. Concern also exists about declining populations of two western subspecies, C. t. pallescens and C. t. townsendii. Using a comparative approach, estimates of the genetic diversity within populations of the endangered subspecies, C. t. virginianus, were found to be significantly lower than within populations of the two western subspecies. Further, both classes of molecular markers revealed significant differentiation among regional populations of C. t. virginianus with most genetic diversity distributed among populations. Genetic diversity was not significantly different between C. t. townsendii and C. t. pallescens. Some populations of C. t. townsendii are not genetically differentiated from populations of C. t. pallescens in areas of sympatry. For the western subspecies gene flow appears to occur primarily through male dispersal. Finally, geographic regions representing significantly differentiated and genetically unique populations of C. townsendii virginianus are recognized as distinct evolutionary significant units.
Resumo:
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.