5 resultados para Graph-based methods
em DigitalCommons@University of Nebraska - Lincoln
Resumo:
We investigate the problem of waveband switching (WBS) in a wavelength-division multiplexing (WDM) mesh network with dynamic traffic requests. To solve the WBS problem in a homogeneous dynamic WBS network, where every node is a multi-granular optical cross-connect (MG-OXC), we construct an auxiliary graph. Based on the auxiliary graph, we develop two heuristic on-line WBS algorithms with different grouping policies, namely the wavelength-first WBS algorithm based on the auxiliary graph (WFAUG) and the waveband-first WBS algorithm based on the auxiliary graph (BFAUG). Our results show that the WFAUG algorithm outperforms the BFAUG algorithm.
Resumo:
Polymerase chain reaction techniques were developed and applied to identify DNA from .40 species of prey contained in fecal (scat) soft-part matrix collected at terrestrial sites used by Steller sea lions (Eumetopias jubatus) in British Columbia and the eastern Aleutian Islands, Alaska. Sixty percent more fish and cephalopod prey were identified by morphological analyses of hard parts compared with DNA analysis of soft parts (hard parts identified higher relative proportions of Ammodytes sp., Cottidae, and certain Gadidae). DNA identified 213 prey occurrences, of which 75 (35%) were undetected by hard parts (mainly Salmonidae, Pleuronectidae, Elasmobranchii, and Cephalopoda), and thereby increased species occurrences by 22% overall and species richness in 44% of cases (when comparing 110 scats that amplified prey DNA). Prey composition was identical within only 20% of scats. Overall, diet composition derived from both identification techniques combined did not differ significantly from hard-part identification alone, suggesting that past scat-based diet studies have not missed major dietary components. However, significant differences in relative diet contributions across scats (as identified using the two techniques separately) reflect passage rate differences between hard and soft digesta material and highlight certain hypothesized limitations in conventional morphological-based methods (e.g., differences in resistance to digestion, hard part regurgitation, partial and secondary prey consumption), as well as potential technical issues (e.g., resolution of primer efficiency and sensitivity and scat subsampling protocols). DNA analysis of salmon occurrence (from scat soft-part matrix and 238 archived salmon hard parts) provided species-level taxonomic resolution that could not be obtained by morphological identification and showed that Steller sea lions were primarily consuming pink (Oncorhynchus gorbuscha) and chum (Oncorhynchus keta) salmon. Notably, DNA from Atlantic salmon (Salmo salar) that likely originated from a distant fish farm was also detected in two scats from one site in the eastern Aleutian Islands. Overall, molecular techniques are valuable for identifying prey in the fecal remains of marine predators. Combining DNA and hard-part identification will effectively alleviate certain predicted biases and will ultimately enhance measures of diet richness, fisheries interactions (especially salmon-related ones), and the ecological role of pinnipeds and other marine predators, to the benefit of marine wildlife conservationists and fisheries managers.
Resumo:
Software product line (SPL) engineering offers several advantages in the development of families of software products such as reduced costs, high quality and a short time to market. A software product line is a set of software intensive systems, each of which shares a common core set of functionalities, but also differs from the other products through customization tailored to fit the needs of individual groups of customers. The differences between products within the family are well-understood and organized into a feature model that represents the variability of the SPL. Products can then be built by generating and composing features described in the feature model. Testing of software product lines has become a bottleneck in the SPL development lifecycle, since many of the techniques used in their testing have been borrowed from traditional software testing and do not directly take advantage of the similarities between products. This limits the overall gains that can be achieved in SPL engineering. Recent work proposed by both industry and the research community for improving SPL testing has begun to consider this problem, but there is still a need for better testing techniques that are tailored to SPL development. In this thesis, I make two primary contributions to software product line testing. First I propose a new definition for testability of SPLs that is based on the ability to re-use test cases between products without a loss of fault detection effectiveness. I build on this idea to identify elements of the feature model that contribute positively and/or negatively towards SPL testability. Second, I provide a graph based testing approach called the FIG Basis Path method that selects products and features for testing based on a feature dependency graph. This method should increase our ability to re-use results of test cases across successive products in the family and reduce testing effort. I report the results of a case study involving several non-trivial SPLs and show that for these objects, the FIG Basis Path method is as effective as testing all products, but requires us to test no more than 24% of the products in the SPL.
Resumo:
Classical sampling methods can be used to estimate the mean of a finite or infinite population. Block kriging also estimates the mean, but of an infinite population in a continuous spatial domain. In this paper, I consider a finite population version of block kriging (FPBK) for plot-based sampling. The data are assumed to come from a spatial stochastic process. Minimizing mean-squared-prediction errors yields best linear unbiased predictions that are a finite population version of block kriging. FPBK has versions comparable to simple random sampling and stratified sampling, and includes the general linear model. This method has been tested for several years for moose surveys in Alaska, and an example is given where results are compared to stratified random sampling. In general, assuming a spatial model gives three main advantages over classical sampling: (1) FPBK is usually more precise than simple or stratified random sampling, (2) FPBK allows small area estimation, and (3) FPBK allows nonrandom sampling designs.
Resumo:
One problem with using component-based software development approach is that once software modules are reused over generations of products, they form legacy structures that can be challenging to understand, making validating these systems difficult. Therefore, tools and methodologies that enable engineers to see interactions of these software modules will enhance their ability to make these software systems more dependable. To address this need, we propose SimSight, a framework to capture dynamic call graphs in Simics, a widely adopted commercial full-system simulator. Simics is a software system that simulates complete computer systems. Thus, it performs nearly identical tasks to a real system but at a much lower speed while providing greater execution observability. We have implemented SimSight to generate dynamic call graphs of statically and dynamically linked functions in x86/Linux environment. A case study illustrates how we can use SimSight to identify sources of software errors. We then evaluate its performance using 12 integer programs from SPEC CPU2006 benchmark suite.