421 |
The Effects of Habitat Parameters on the Behavior, Ecology, and Conservation of the Udzungwa Red Colobus Monkey (Procolobus gordonorum)Steel, Ruth January 2012 (has links)
<p>A central theme in animal ecology is the study of the relationship between ecology and behavior. This dissertation demonstrates how ecological parameters, particularly food and weather variables, correlate with ranging, activity budget, and diet in Udzungwa red colobus monkeys (URC, <italic>Procolobus gordonorum</italic>), endemic to the Udzungwa Mountains, Tanzania. </p><p> From April 2009 - March 2010, four URC groups were habituated and studied in Mwanihana and Magombera Forests. During all-day follows, ranging, activity budget, and diet data were collected using GPS units and ten-minute scan samples of sustained activities. Food characteristics were assessed using transect and phenology surveys. Preliminary nutritional analyses were conducted on species-specific parts fed upon during October. I designed and employed novel methods for estimating ranging statistics which were compared with conventional methods.</p><p> Home range sizes were relatively small (8.8 - 20.8 ha). Home range size may relate to food species diversity and feeding selectivity for species-specific food parts. Variability in dietary composition was partly explained by plant phenology, forest composition, and selectivity differences among groups. URC primarily fed upon young leaves with higher fat content. Some non-nutritive items eaten may function as detoxifying agents. Data suggest that the URC dietary strategy involves nutrient balancing (i.e. maximizing energetic intake and nutrient acquisition while avoiding high concentrations of particular plant secondary compounds).</p><p> Mean daily travel distance (DTD) was 970 m, longer than in other red colobus taxa. DTD was shorter in October and November when temperatures were warmer and a high abundance of young growth became available. Young growth comprised the majority of all groups' diets in each sample period. When young growth abundances were highest, Magombera groups traveled shorter distances. One group's DTD did not differ seasonally and was significantly longer compared to other groups. This group may have traveled longer distances and spent less time resting in order to consume young growth in a habitat with lower young growth abundances. A correlation between time spent resting and temperature suggests behavioral prevention of hyperthermia. URC energetic strategies may involve balancing thermoregulation with maximizing energy intake. Conservation recommendations are discussed and include stricter forest protection.</p> / Dissertation
|
422 |
Routing and Efficient Evaluation Techniques for Multi-hop Mobile Wireless NetworksLee, Young-Jun 03 August 2005 (has links)
In this dissertation, routing protocols, load-balancing protocols, and efficient evaluation techniques for multi-hop mobile wireless networks are explored.
With the advancements made in wireless communication and computer technologies, a new type of mobile wireless network, known as a mobile ad hoc network (MANET), has drawn constant attention. In recent years, several routing protocols for MANETs have been proposed. However, there still remains the need for mechanisms for better scalability support with respect to network size, traffic volume, and mobility. To address this issue, a new method for multi-hop routing in MANETs called Dynamic NIx-Vector Routing (DNVR) is proposed. DNVR has several distinct features compared to other existing on-demand routing protocols, which lead to more stable routes and better scalability.
Currently, ad hoc routing protocols lack load-balancing capabilities. Therefore they often fail to provide good service quality, especially in the presence of a large volume of network traffic since the network load concentrates on some nodes, resulting in a highly congested environment. To address this issue, a novel load-balancing technique for ad hoc on-demand routing protocols is proposed. The new method is simple but very effective in achieving load balance and congestion alleviation. In addition, it operates in a completely distributed fashion.
To evaluate and verify wireless network protocols effectively, especially to test their scalability properties, scalable and efficient network simulation methods are required. Usually simulation of such large-scale wireless networks needs a long execution time and requires a large amount of computing resources such as powerful CPUs and memory. Traditionally, to cope with this problem, parallel network simulation techniques with parallel computing capabilities have been considered. This dissertation explores a different type of method, which is efficient and can be achieved with a sequential simulation, as well as a parallel and distributed technique for large-scale mobile wireless networks.
|
423 |
An Adaptive Simulated Annealing Method For Assembly Line Balancing And A Case StudyGuden, Huseyin 01 August 2006 (has links) (PDF)
Assembly line balancing problem is one of the most studied NP-Hard problems. NP-Hardness leads us to search for a good solution instead of the optimal solution especially for the big-size problems. Meta-heuristic algorithms are the search methods which are developed to find good solutions to the big-size and combinatorial problems. In this study, it is aimed at solving the multi-objective multi-model assembly line balancing problem of a company. A meta-heuristic algorithm is developed to solve the deterministic assembly line balancing problems. The algorithm developed is tested using the test problems in the literature and the the real life problem of the company as well. The results are analyzed and found to be promising and a solution is proposed for the firm.
|
424 |
Resource-aware Load Balancing System With Artificial Neural NetworksYildiz, Ali 01 September 2006 (has links) (PDF)
As the distributed systems becomes popular, efficient load balancing systems taking
better decisions must be designed. The most important reasons that necessitate load
balancing in a distributed system are the heterogeneous hosts having different com-
puting powers, external loads and the tasks running on different hosts but communi-
cating with each other. In this thesis, a load balancing approach, called RALBANN,
developed using graph partitioning and artificial neural networks (ANNs) is de-
scribed. The aim of RALBANN is to integrate the successful load balancing deci-
sions of graph partitioning algorithms with the efficient decision making mechanism
of ANNs. The results showed that using ANNs to make efficient load balancing can
be very beneficial. If trained enough, ANNs may load the balance as good as graph
partitioning algorithms more efficiently.
|
425 |
Linear Static Analysis Of Large Structural Models On Pc ClustersOzmen, Semih 01 July 2009 (has links) (PDF)
This research focuses on implementing and improving a parallel solution framework for
the linear static analysis of large structural models on PC clusters. The framework
consists of two separate programs where the first one is responsible from preparing data
for the parallel solution that involves partitioning, workload balancing, and equation
numbering. The second program is a fully parallel nite element program that utilizes
substructure based solution approach with direct solvers.
The first step of data preparation is partitioning the structure into substructures.
After creating the initial substructures, the estimated imbalance of the substructures
is adjusted by iteratively transferring nodes from the slower substructures to the faster
ones. Once the final substructures are created, the solution phase is initiated. Each
processor assembles its substructure' / s stiffness matrix and condenses it to the interfaces.
The interface equations are then solved in parallel with a block-cyclic dense
matrix solver. After computing the interface unknowns, each processor calculates the
internal displacements and element stresses or forces. Comparative tests were done to
demonstrate the performance of the solution framework.
|
426 |
Mixed-model Two-sided Assembly Line BalancingUcar, Emre 01 January 2010 (has links) (PDF)
In this study we focus on two-sided mixed-model assembly line balancing type-I
problem. There is a production target for a fixed time horizon and the objective is
to produce this amount with the minimum level of workforce. A mathematical
model is developed to solve this problem in an optimal manner. For large scale
problems, the mathematical model fails to give the optimal solution within
reasonable computational times. Thus, a heuristic approach based on threshold
accepting algorithm is presented. Both the mathematical model and the heuristic
approach are executed to solve several example problems from the literature and
a case study problem which is derived from the refrigerator production.
Computational experiments are carried out using both approaches. It is observed
that the heuristic procedure finds good solutions within very reasonable
computational times.
|
427 |
Routing algorithms for large scale wireless sensor networksNittala Venkata, Lakshmana Prasanth 17 February 2005 (has links)
Routing in sensor networks is a challenging issue due to inherent constraints such
as power, memory, and CPU processing capabilities. In this thesis, we assume an All
to All communication mode in an N × N grid sensor network. We explore routing
algorithms which load balance the network without compromising the shortest paths
constrain. We analyzed the Servetto method and studied two routing strategies,
namely Horizontal-Vertical routing and Zigzag routing. The problem is divided into
two scenarios, one being the static case (without failed nodes), and the other being the
dynamic case (with failed nodes). In static network case, we derived mathematical
formulae representing the maximum and minimum loads on a sensor grid, when
specific routing strategies are employed. We show improvement in performance in
load balancing of the grid by using Horizontal-Vertical method instead of the existing
Servetto method. In the dynamic network scenario, we compare the performance of
routing strategies with respect to probability of failure of nodes in the grid network.
We derived the formulae for the success-ratio, in specific strategies, when nodes fail
with a probability of p in a predefined source-destination pair communication. We
show that the Servetto method does not perform well in both scenarios. In addition,
Hybrid strategy proposed does not perform well compared to the studied strategies.
We support the derived formulae and the performance of the routing strategies with
extensive simulations.
|
428 |
Local adaptation to parasites and selection on major histocompatibility genes in ecologically divergent populations of three-spine stickleback (Gasterosteus aculeatus)Stutz, William Edward 25 September 2013 (has links)
As individuals and populations diverge ecologically, they become exposed to new parasites and pathogens with potentially harmful fitness consequences. Populations are therefore expected to evolve resistance, possibly at a cost of less resistance to parasites rarely encountered parasites. This trade-off in resistance should generate local adaptation to parasites in different habitats. In chapter one, I show how local adaptation can potentially evolve in response to variation in parasite exposure among eighteen ecologically variable populations of threespine stickleback (Gasterosteus aculeatus). Within populations infection appeared to reflect morphology/diet based exposure differences among individuals. Among populations, however, these patterns were absent or reversed, consistent with the evolution of local adaptation. In chapters two and three I set out to test whether variation major histocompatibility (MHC) genes can underly such local adaptation in stickleback. MHC genes are important components of vertebrate immunity; however, there is little direct empirical support for spatially divergent selection driving local adaptation on MHC loci in the wild. In chapter two I tested for the action of parasite mediated balancing and divergent selection on on MHC loci using naturally infected stickleback in three replicate lake-stream pairs. Despite consistent divergence in parasites and MHC alleles, lakes tended to show decreased parasite burdens with increased allelic richness (consistent with balancing selection), while streams showed some support for divergent selection between lake and stream types. In chapter three I use the same lake-stream pairs to investigate how divergent selection could instead be reflected in variation in the effects of individual MHC alleles among populations. When comparing parapatric populations experiencing gene flow, MHC alleles maintained at relatively high frequency in one population were more likely to be associated with reduced, rather than increased, parasite abundances in that population. Allopatric populations experiencing no gene flow showed no such general relationship between allele frequency and resistance. These results are only consistent with spatially divergent selection, and imply that gene flow and environmental heterogeneity can be important for maintaining MHC diversity. / text
|
429 |
Αλγόριθμοι εξισορρόπησης φόρτου σε p2p συστήματα και μετρικές απόδοσηςΜιχαήλ, Θεοφάνης-Αριστοφάνης 05 February 2015 (has links)
Πρόσφατα η ιντερνετική κοινότητα έστρεψε την προσοχή και το ενδιαφέρον της στα peer-to-peer συστήματα, όπου οι χρήστες προσφέρουν τους πόρους τους (αποθηκευτικό χώρο, υπολογιστικό χρόνο) και περιεχόμενο (αρχεία) στην διάθεση της κοινότητας. Οι χρήστες θεωρούνται ίσοι μεταξύ τους και ο καθένας συμμετέχει με διπλό ρόλο, τόσο σαν πελάτης, όσο και σαν εξυπηρετητής. Με αυτό τον τρόπο δημιουργούνται κοινότητες με αποκεντρωμένο έλεγχο, ευελιξία, σταθερότητα, κλιμάκωση, ανωνυμία κι αντοχή στην λογοκρισία. Ενώ όμως οι δυνατότητες αυτών των συστημάτων είναι ποικίλες, την μεγαλύτερη αποδοχή έχουν γνωρίσει τα συστήματα ανταλλαγής αρχείων όπως το Napster, Kazaa, Gnutella, eDonkey, BitTorrent. Το ενδιαφέρον των ερευνητών δεν έχει περιοριστεί μόνο στην ανταλλαγή δεδομένων μιας και η ανοιχτή φύση των peer-to-peer συστημάτων προσφέρει πολύ περισσότερες προκλήσεις.
Ένα ενδιαφέρον πεδίο έρευνας είναι αυτό των τεχνικών εξισορρόπησης φόρτου. Η έρευνα που διεξάγεται μπορεί να χωριστεί σε δύο κατηγορίες. Στην μια κατηγορία μπορούμε να εντάξουμε τεχνικές για την καλύτερη κατανομή των αντικειμένων στον χώρο ονομάτων για βελτιστοποιήσεις στην απόδοση της δρομολόγησης και αναζήτησης [Pastry, Tapestry, Chord]. Στην δεύτερη μπορούμε να εντάξουμε τεχνικές για την κατανομή αντιγράφων των αντικειμένων στους κόμβους του δικτύου, για βελτιστοποίηση του ρυθμού εξυπηρέτησης των χρηστών και της ποιότητας υπηρεσίας που τους προσφέρει το σύστημα, η οποία μπορεί άμεσα να συσχετιστεί με την διαθεσιμότητα.
Ενώ η δεύτερη κατηγορία μπορούμε να πούμε ότι φαίνεται να είναι πιο ενδιαφέρουσα από την σκοπιά του τελικού χρήστη, η έρευνα στον τομέα αυτό δεν φαίνεται να λαμβάνει υπόψη της έναν ρεαλιστικό υπολογισμό του κόστους εφαρμογής των προτεινομένων τεχνικών. Έτσι κάποιες εργασίες δεν υπολογίζουν καθόλου το κόστος δημιουργίας αντιγράφων, ενώ κάποιες άλλες το θεωρούν σταθερό και ανεξάρτητο από το μέγεθος των αντικειμένων και τη σύνδεση των δυο κόμβων μεταξύ των οποίων γίνεται η επικοινωνία. Κάποιες λιγότερο ή περισσότερο προχωρούν λίγο παραπέρα και ορίζουν το κόστος να είναι ανάλογο του απαιτούμενου αποθηκευτικού χώρου. Η διαφορά με την παρούσα εργασία είναι ότι δεν εμπεριέχουν την έννοια της εξισορρόπησης του φόρτου των κόμβων μεταξύ τους.
Σε αυτή την εργασία προσπαθήσαμε να καθορίσουμε ένα σύνολο μετρικών απόδοσης μέσα από ένα πλαίσιο εργασίας για έναν όσο το δυνατόν περισσότερο ρεαλιστικό τρόπο υπολογισμού τους. Για να το πετύχουμε αυτό, καταρχήν σχεδιάσαμε ένα p2p σύστημα διαμοίρασης αρχείων με αρχιτεκτονική που βασίζεται στην οργάνωση των κόμβων σε ομάδες, ενώ στη συνέχεια ορίζοντας την έννοια του φόρτου υλοποιήσαμε τεχνικές για την εξισορρόπησή του. Για την αξιολόγηση των τεχνικών, ορίστηκε ένα σύνολο μετρικών οι οποίες καταγράφουν την απόδοση του συστήματος τόσο από την οπτική γωνία του συστήματος (επιθυμητή η δίκαιη κατανομή του φόρτου και η βέλτιστη χρήση των πόρων όπως κυρίως η διαθέσιμη χωρητικότητα των συνδέσεων των κόμβων μεταξύ τους), όσο κι από την οπτική γωνία του χρήστη (καλύτερη «ποιότητα υπηρεσίας» με το ελάχιστο δυνατό κόστος).
Η πειραματική αξιολόγηση των τεχνικών έγινε μέσα σε ένα περιβάλλον προσομοίωσης, το οποίο υλοποιήθηκε από μηδενική βάση, έπειτα από μια μελέτη παρόμοιων συστημάτων. Τα κύρια χαρακτηριστικά του περιβάλλοντος αυτού είναι α) η επεκτασιμότητα κι ευχρηστία του, β) απλή και ρεαλιστική βάση προσομοίωσης, γ) ύπαρξη πληθώρας παραμέτρων της προσομοίωσης που δίνονται σαν είσοδος από τον χρήστη και δ) δυνατότητα προσομοίωσης μεγάλου μεγέθους συστημάτων. / Recently the internet community has focused its interest on peer-to-peer systems, where users contribute their resources (storage space, computation time) and content (documents, files) to the community. The users are considered equivalent, each one participating with a dual role, both as a client and server. The communities formed under this simple peer-to-peer paradigm are characterized by the decentralized control, robustness, stability, scaling, anonymity and resistance to censorship. While there are various potential application domains of peer-to-peer systems, depending on the type of shared resources, the file sharing systems, such as Napster, Kazaa, Gnutella, eDonkey, BitTorrent, has known the greater acceptance. The “open nature” of peer-to-peer systems offers a wider area of research interest and much more challenges than just content sharing; interesting research domains include infrastructure, collaboration, searching, routing, load balancing, security etc
Load balancing is a very interesting domain on such systems. The carried out research in this domain may be categorized in two categories. In the first, one can include techniques for better item distribution in the name space so as improvements in routing and searching can be accomplished [ref2 Pastry, Tapestry, Chord]. In the second, one can include techniques for items’ replicas placement to the network nodes, for improving the throughput and the Quality of Service provided to the users. The QoS can be straightforward related to the availability
While the second category seems to be more interesting from the user’s perspective, the research in this domain does not seem to take into account a realistic cost evaluation of the proposed techniques. Some research studies just ignore it, while some others consider it constant and irrelative to the objects’ size and the connection between the two nodes where the object transfer occurs. Some others (less) (or more) get a little further and define the cost to be proportional to the needed storage capacity. The difference with our study is that the previous studies do not comprise the notion of load balancing among users as well as evaluate the cost under different assumptions.
With our work we try to define a set of performance metrics through a framework based on a measurement as realistic as possible. To accomplish this, at first we designed a cluster based file sharing p2p system, then we defined the notion of load and finally implemented load balancing techniques. To evaluate these techniques we defined a set of metrics that record the system’s performance both from the system’s perspective (desirable the fair load distribution and the optimum use of resources like the available bandwidth of nodes’ connections) and the user’s (better “quality of service” with the least cost).
For the experimental evaluation of these techniques we developed from scratch a simulation environment, after we studied similar systems. The main characteristics of this simulator are a) extensibility and usability, b) simple and realistic simulation base, c) availability of plenty simulation parameters given as input from the user d) scalability to simulate large scale systems.
|
430 |
Lietuvos valstybinio socialinio draudimo biudžeto subalansavimo problema / Social insurance budget balancing problem in LithuaniaJasinskaitė, Irma 16 July 2014 (has links)
Bakalauro baigiamajame darbe nagrinėjama viešųjų finansų tema apie valstybinio socialinio draudimo biudžeto subalansavimo problemą. Valstybinis socialinis draudimas – viena iš svarbiausių socialinės apsaugos sistemos dalių, kuri apima beveik visus šalies gyventojus. Per šia sistemą valstybė vykdo svarbią savo funkciją – užtikrina gyventojų materialinę gerovę bei stengiasi mažinti socialinę atskirtį bei vadovaujasi solidarumo principu. Empirinėje dalyje išanalizuota, kad dėl kilusios ekonominės krizės 2008 metais, valstybinis socialinis draudimas stipriai nukentėjo, jo biudžetas tapo deficitinis – finansinis stabilumas pažeistas. „Sodra“ dėl įvairių ekonominių ir demografinių veiksnių įtakos nebepajėgia surinkti pakankamai įmokų į biudžetą. Darbo tikslas: Lietuvos valstybinio socialinio draudimo biudžeto subalansavimo analizė 2003-2014 metais. / Bachelor's thesis examines the topic of public finances of the state social insurance budget balancing problem. State social insurance - one of the most important parts of the social security system, which includes almost all of the country's population. Through this system, the State has an important function - ensuring the population's material wealth and trying to reduce social exclusion. Empirical part of the analysis, that originated the economic crisis in 2008, the state social insurance strongly affected by his budget went into deficit - the financial stability of the damage. "Social Insurance" for a variety of economic and demographic factors influence can no longer collect enough contributions to the budget. The aim of the Lithuanian state social insurance budget balancing analysis in 2003-2014.
|
Page generated in 0.0461 seconds