Masters of Science / Studies on snake competitive interactions have relatively been well documented globally, however, those examples tend to be dominated by non-African examples. Africa has a large and spectacular reptile diversity and yet robust and empirical studies on snake population ecology remain poorly understood or documented. Given the close phylogenetic relationship between the two species, as well as the remarkable similarities in overall appearance, morphology, reproductive biology, and most importantly geographic distribution, Psammophis crucifer and Psammophylax rhombeatus offered an ideal study system in which to ask questions related to interspecific competition and niche partitioning. Specifically I asked (1) whether broad scale geographic sympatry is facilitated by fine-scale allopatry through separation of space-use, and (2) whether the diets of the two species provided evidence of partitioning along the dietary niche. To answer these questions, I first quantified relative abundance of the two species at a fine scale, and secondly used existing dietary data to quantify dietary niche overlap. Even though P. rhombeatus was always more abundant in my sample, I found no evidence of space-use partitioning in this study, instead it showed a positive correlation in their abundance, and therefore suggesting space was not a limiting resource. Pianka niche overlap analysis showed significant differences in their feeding habits whereby P. rhombeatus had a broader diet which included mammals and birds, whereas P. crucifer predominantly fed on lizards and other snakes. In conclusion, my study suggests that across multiple geographic scales these two snakes use the same spatial resources and are able to co-exist by partitioning food resources. Lastly, my study serves to provoke more African studies of this nature with suitable candidate snake species.

A common type of problems that exist in both industrial and scientific spaces are optimization problems. These problems can be found in among other things manufacturing, pathfinding, network routing and more. Because of the wide area of application, optimization is well a studied area. One solution to these types of problems is the Ant Colony Optimization algorithm that has been around since 1991 and has undergone a lot of developments over the years. This algorithm draws inspiration from real ant colonies and their procedure for foraging. However, a common criticism of this algorithm is its poor scalability. To tackle the scalability problem this thesis will combine the concept of binary space partitioning with the Ant Colony Optimization algorithm. The goal is to examine the algorithms convergence times and lengths of the paths produced. The results are measured in intervals by calculating the best possible path found at every interval. The findings showed that given an unlimited execution time the original Ant Colony Optimization algorithm produced shorter paths. But when a limit on execution time was introduced and the problem sizes grew the performance began to favor the partitioned versions. These findings could be useful in areas where complex optimization problems need to be solved within a limited timeframe. / <p>The presentation took place via an online conference call using the software "Zoom"</p>

Denna läromedelsanalys syftar till att utifrån ett variationsteoretiskt perspektiv belysa vilka möjligheter en läromedelsserie i matematik erbjuder elever att utveckla en förståelse för stambråk. Studien utgår från sex kritiska aspekter av stambråk: areamodellen, linear measurement, inverse order relationship, stambråk som mängden av en helhet, partitioning och iterating. Utifrån ett variationsteoretiskt perspektiv med en deduktiv ansats har läromedlen analyserats genom en textanalys. Resultatet visar att samtliga kritiska aspekter av stambråk finns representerade i läromedlet. Samtidigt behandlas flertalet av dem i mindre utsträckning, vilket kan leda till en begränsad concept image av stambråk hos elever. Resultatet visar även att det vanligaste variationsmönstret i läromedlen är fusion, vilket innebär att elever behöver kunna urskilja flera kritiska aspekter av lärandeobjektet samtidigt. Detta försvårar möjligheten att tillägna sig förståelsen för stambråk. I resultatet framgår det också att areamodellen är den vanligast förekommande representationsformen i läromedelsserien. En konsekvens för undervisningen blir således att representations-former som bygger på linear measurement behöver få större plats inom ramen för den ordinarie undervisningen. Detta för att elever ska få en större förståelse för stambråk och en berikad concept image vilket i sin tur möjliggör förståelsen för mer avancerade matematiska principer. Sammanfattningsvis diskuteras att lärare behöver förhålla sig kritiskt till matematikläromedel samt vara medvetna om vilka möjligheter det erbjuder.

Niche partitioning is a major component in understanding community ecology and how ecologically similar species coexist. Temporal and spatial partitioning and differences in foraging strategy, including sensitivity to risk (variance), likely contribute to partitioning as well. Here, we approach this partitioning with fine resolution to investigate differences in overall strategy between two species of diurnal, orb-weaving spiders, Verrucosa arenata and Micrathena gracilis (Araneae: Araneidae), that share similar spatial positioning, temporal foraging window, and prey. Through field observation, we found that V. arenata individuals appear to increase spatial and temporal sampling to compensate for an overall risk-prone strategy that depends on the interception and active capture of rare, large prey. Conversely, M. gracilis individuals employ a risk-averse strategy relying on passive capture of small but abundant prey consumed alongside the orb. We have thus identified how differing risk-sensitive foraging strategies may contribute to niche partitioning between otherwise similar species.

In software engineering it is important to consider how a potential user experiences the system during usage. No software user will have a satisfying experience if they perceive the system as slow, unresponsive, unstable or hiding information. Additionally, if the system restricts the users to only having a limited set of actions, their experience will further degrade. In order to evaluate the effect these issues have on a user‟s perceived experience, a measure called Quality of Experience is applied. In this work the foremost objective was to improve how a user experienced a system suffering from the previously mentioned issues, when searching for large amounts of data. To achieve this objective the system was evaluated to identify the issues present and which issues were affecting the user perceived Quality of Experience the most. The evaluated system was a warehouse management system developed and maintained by Aptean AB‟s office in Hässleholm, Sweden. The system consisted of multiple clients and a server, sending data over a network. Evaluation of the system was in form of a case study analyzing its performance, together with a survey performed by Aptean staff to gain knowledge of how the system was experienced when searching for large amounts of data. From the results, three issues impacting Quality of Experience the most were identified: (1) interaction; limited set of actions during a search, (2) transparency; limited representation of search progress and received data, (3) execution time; search completion taking long time. After the system was analyzed, hypothesized technological solutions were implemented to resolve the identified issues. The first solution divided the data into multiple partitions, the second decreased data size sent over the network by applying compression and the third was a combination of the two technologies. Following the implementations, a final set of measurements together with the same survey was performed to compare the solutions based on their performance and improvement gained in perceived Quality of Experience. The most significant improvement in perceived Quality of Experience was achieved by the data partitioning solution. While the combination of solutions offered a slight further improvement, it was primarily thanks to data partitioning, making that technology a more suitable solution for the identified issues compared to compression which only slightly improved perceived Quality of Experience. When the data was partitioned, updates were sent more frequently and allowed the user not only a larger set of actions during a search but also improved the information available in the client regarding search progress and received data. While data partitioning did not improve the execution time it offered the user a first set of data quickly, not forcing the user to idly wait, making the user experience the system as fast. The results indicated that to increase the user‟s perceived Quality of Experience for systems with server-client communication, data partitioning offered several opportunities for improvement. / I programvaruteknik är det viktigt att överväga hur en potentiell användare upplever ett system vid användning. Ingen användare kommer att ha en tillfredsställande upplevelse om de uppfattar systemet som långsamt, icke responsivt, ostabilt eller döljande av information. Dessutom, om systemet binder användarna till ett begränsat antal möjliga handlingar, kommer deras upplevelse vidare försämras. För att utvärdera vilken påverkan dessa problem har på en användares upplevda kvalitet, används mätenheten Upplevd Tjänstekvalitet. I detta arbete var det huvudsakliga syftet att förbättra en användares upplevelse av ett system som led av de tidigare nämnda problemen vid sökning av större datamängder. För att uppnå detta syfte utvärderades systemet för att identifiera befintliga problem samt vilka som mest påverkade användares Upplevda Tjänstekvalitet. Systemet som utvärderades var en mjukvara för lagerhantering som utvecklades och underhölls av Aptean AB‟s kontor i Hässleholm, Sverige. Systemet bestod av flera klienter och en server som skickade data över ett nätverk. Systemet utvärderades med en fallstudie där prestandan anayserades tillsammans med en enkät utförd i samarbete med Apteans personal för att få insikt i hur systemet upplevdes vid sökningar av stora datamängder. Resultaten visade på tre problem som hade störst inverkan på den Upplevda Tjänstekvaliteten: (1) interaktion; begränsade antal möjliga handlingar under en sökning, (2) transparens; begränsad tillgång till information om sökningens progress samt den hämtade datan, (3) körningstid; slutförande av en sökning tog lång tid. Efter att systemet hade analyserats, implementerades hypotetiska teknologiska lösningar för att lösa de identifierade problemen. Den första lösningen delade in datan i ett flertal partitioner, den andra minskade datans storlek som skickades över nätverket genom att tillämpa komprimering och den tredje var en kombination av de två teknologierna. Efter implementationen utfördes en sista uppsättning mätningar tillsammans med enkäten för att jämföra lösningarna baserat på deras prestanda och förbättringar av Upplevd Tjänstekvalitet. Den mest signifikanta förbättringen av Upplevd Tjänstekvalitet kom från datapartitioneringslösningen. Trots att kombinationen av lösningar uppnådde en mindre vidare förbättring, var det primärt tack vare datapartitioneringen, vilket innebar att den teknologin var den mest passande lösningen till de identifierade problemen jämfört med komprimering, vilken visade på endast en liten förbättring av Upplevd Tjänstekvalitet. När data partitionerades kunde flera uppdateringar skickas och användaren tilläts ett större antal möjliga handlingar under en sökning, men också en förbättrad tillgång till information i klienten angående sökningens progress samt den hämtade datan. Trots att datapartitionering inte förbättrade körningstiden, kunde den erbjuda användaren en första mängd data snabbt utan att tvinga användaren att sysslolöst vänta, vilket gjorde att systemet upplevdes som snabbt. För att förbättra den Upplevda Tjänstekvaliteten för system med server-klient kommunikation visade resultaten att datapartitionering är en lösning som erbjöd flera möjligheter för förbättring.

Task allocation, and task switching have an important effect on the efficiency of distributed, locally controlled systems such as social insect colonies. Both efficiency and workload distribution are global features of the system which are not directly accessible to workers and can only be sampled locally by an individual in a distributed system. To investigate how the cost of task switching affects global performance we use social wasp societies as a metaphor to construct a simple model system with four interconnected tasks. Our goal is not the accurate description of the behavior of a given species, but to seek general conclusions on the effect of noise and time delay on a behavior that is partitioned into subtasks. In our model a nest structure needs to be constructed by the cooperation of individuals that carry out different tasks: builders, pulp and water foragers, and individuals storing water. We report a simulation study based on a model using delay-differential equations to analyze the trade-off between task switching costs and keeping a high degree of adaptivity in a dynamic, noisy environment. Combining the methods of time-delayed equations and stochastic processes we are able to represent the influence of swarm size and task switching sensitivity. We find that the system is stable for reasonable choices of parameters but shows oscillations for extreme choices of parameters and we find that the system is resilient to perturbations. We identify a trade-off between reaching equilibria of high performance and having short transients.

Auditors must assess their clients' ability to function as a going concern for at least the year following the financial statement date. The audit profession has been severely criticized for failure to 'blow the whistle' in numerous highly visible bankruptcies that occurred shortly after unmodified audit opinions were issued. Financial distress indicators examined in this study are one mechanism for making such assessments. This study measures and compares the predictive accuracy of an easily implemented two-variable bankruptcy model originally developed using recursive partitioning on an equally proportioned data set of 202 firms. In this study, we test the predictive accuracy of this model, as well as previously developed logit and neural network models, using a realistically proportioned set of 14,212 firms' financial data covering the period 1981-1990. The previously developed recursive partitioning model had an overall accuracy for all firms ranging from 95 to 97% which outperformed both the logit model at 93 to 94% and the neural network model at 86 to 91%. The recursive partitioning model predicted the bankrupt firms with 33-58% accuracy. A sensitivity analysis of recursive partitioning cutting points indicated that a newly specified model could achieve an all firm and a bankrupt firm predictive accuracy of approximately 85%. Auditors will be interested in the Type I and Type II error tradeoffs revealed in a detailed sensitivity table for this easily implemented model.

Task allocation, and task switching have an important effect on the efficiency of distributed, locally controlled systems such as social insect colonies. Both efficiency and workload distribution are global features of the system which are not directly accessible to workers and can only be sampled locally by an individual in a distributed system. To investigate how the cost of task switching affects global performance we use social wasp societies as a metaphor to construct a simple model system with four interconnected tasks. Our goal is not the accurate description of the behavior of a given species, but to seek general conclusions on the effect of noise and time delay on a behavior that is partitioned into subtasks. In our model a nest structure needs to be constructed by the cooperation of individuals that carry out different tasks: builders, pulp and water foragers, and individuals storing water. We report a simulation study based on a model using delay-differential equations to analyze the trade-off between task switching costs and keeping a high degree of adaptivity in a dynamic, noisy environment. Combining the methods of time-delayed equations and stochastic processes we are able to represent the influence of swarm size and task switching sensitivity. We find that the system is stable for reasonable choices of parameters but shows oscillations for extreme choices of parameters and we find that the system is resilient to perturbations. We identify a trade-off between reaching equilibria of high performance and having short transients.

Covering arrays for words of length (Formula presented.) over a (Formula presented.) -letter alphabet are (Formula presented.) arrays with entries from the alphabet so that for each choice of (Formula presented.) columns, each of the (Formula presented.) (Formula presented.) -letter words appears at least once among the rows of the selected columns. We study two schemes in which all words are not considered to be different. In the first case known as partitioning hash families, words are equivalent if they induce the same partition of a (Formula presented.) element set. In the second case, words of the same weight are equivalent. In both cases, we produce logarithmic upper bounds on the minimum size (Formula presented.) of a covering array. Definitive results for (Formula presented.), as well as general results, are provided.

Guilds of species that share ecological similarities or recent ancestors are often the basis of studies concerning habitat partitioning. An interesting result of many of these studies is that means of partitioning in one area of sympatry may be different from those in disjunct areas of overlap. Here, we quantified the differences in habitat preference of two forest thrushes in the southern Appalachian Mountains. The Hermit Thrush (Catharus guttatus) has recently expanded its breeding range south along the spine of the Appalachians into the spruce-fir forests of Virginia, North Carolina, and Tennessee. There, it shares breeding habitat with the congeneric Veery (C. fuscescens), previously the only forest thrush breeding in this area. We used several multivariate analyses of habitat variables within both species' territories to understand how these species partition the available habitat and to test if these means of partitioning are similar to those found by other studies. We calculated the niche overlap to be 0.248, indicating that the habitat structures preferred by these two species are highly distinct. Hermit Thrushes generally preferred forest with a high degree of canopy closure, high percent coverage of leaf litter, and low percent cover below 3.0 m. Veery territories generally had a high percent of cover between 0.5 and 3.0 m (i.e., the shrub layer) and less canopy closure than the Hermit Thrush plots. Our data suggest that the Hermit Thrush is expanding south because it is attracted to the maturing of the spruce forests in this region.