No description available.

No description available.

Abstract Cognitive Radio (CR) improves the efficiency of spectrum utilization by allowing non- licensed users to utilize bands when not occupied by licensed users. In this thesis, we address several challenges currently limiting the wide use of cognitive radios. These challenges include identification of unoccupied bands, energy consumption and other technical challenges. Improved accuracy edge detection techniques are developed for CR to mitigate both noise and estimation error variance effects. Next, a reduced complexity Simplified DFT (SDFT) is proposed for use in CR. Then, a sub-Nyquist rate A to D converter is introduced to reduce energy consumption. Finally, a novel multi-resolution PSD estimation based on expectation-maximization algorithm is introduced that can obtain a more accurate PSD within a specified sensing time.

Based on the generating matrix to the Tribonacci sequence, the Tribonacci cat map is a discrete chaotic dynamical system, similar to Arnold's discrete cat map, but on three dimensional space. In this thesis, this new mapping is introduced and the properties of its matrix are presented. The main results of the investigation prove how the size of the domain of the map affects its period and explore the orbit lengths of non-trivial points. Different upper bounds to the map are studied and proved, and a conjecture based on numerical calculations is proposed. The Tribonacci cat map is used for applications such as 3D image encryption and colour encryption. In the latter case, the results provided by the mapping are compared to those from a generalised form of the map.

In this research,we study iterations of non-pleasantly ramified polynomials over fields of positive characteristic and subsequently, their lower ramification numbers. Of particular interest for this thesis are polynomials for which both the multiplicity and  the degree of its iterates grow exponentially. Specifically we consider the family  of polynomials such that given a positive integer k the family is given by P(z) = z(1 + z (3^k-1)/2 + z3^k-1). The cubic polynomial z + z2 + z3 is a special case of this family and is particularly interesting.

<p> The sales of deer licenses, one of the most important revenue sources for wildlife management at the Indiana Department of Natural Resources (IDNR), have been declining for a decade. To increase its funds, the agency is considering launching a new lifetime deer license, which would allow hunters to harvest deer (and possibly other species) each year for the rest of their lives in exchange for a large, up-front fee. The forward-looking nature of the decision to buy a lifetime license means hunters’ choice behavior is necessarily dynamic. We estimate a dynamic discrete choice model using data from a discrete choice experiment (DCE) to capture this forward-looking choice behavior and to estimate hunters’ preferences for different lifetime license designs. We find that our dynamic model better fits our data than a standard, static choice model. We also find that hunters prefer licenses that allow (i) harvest of antlered and antlerless deer to one that only allows harvest of antlerless deer and (ii) harvest of additional species beyond just deer. We use our model to estimate the price of lifetime licenses that maximizes IDNR revenues. This is the first study to estimate the value of lifetime deer hunting licenses using a dynamic approach. This dynamic approach can help improve the IDNR’s decision-making to maximize its revenue and stabilize wildlife management funds.  </p>

Let <img src="http://www.diva-portal.org/cgi-bin/mimetex.cgi?%5Cmathbb%7BP%7D%20=%20(%5Cmathbb%7BP%7D,%20%5Cpreceq)" data-classname="equation_inline" data-title="" /> be a finite poset (partially ordered set) with cardinality <img src="http://www.diva-portal.org/cgi-bin/mimetex.cgi?n" data-classname="equation_inline" data-title="" />. A linear extension of <img src="http://www.diva-portal.org/cgi-bin/mimetex.cgi?%5Cmathbb%7BP%7D" data-classname="equation_inline" data-title="" /> is an order-preserving bijection <img src="http://www.diva-portal.org/cgi-bin/mimetex.cgi?%5Csigma" data-classname="equation_inline" data-title="" />: <img src="http://www.diva-portal.org/cgi-bin/mimetex.cgi?%5Cmathbb%7BP%7D%20%5Crightarrow%20%5Bn%5D" data-classname="equation_inline" data-title="" />, that is, if <img src="http://www.diva-portal.org/cgi-bin/mimetex.cgi?x%20%5Cpreceq%20y" data-classname="equation_inline" data-title="" /> in <img src="http://www.diva-portal.org/cgi-bin/mimetex.cgi?%5Cmathbb%7BP%7D" data-classname="equation_inline" data-title="" /> then <img src="http://www.diva-portal.org/cgi-bin/mimetex.cgi?%5Csigma(x)%20%5Cle%20%5Csigma(y)" data-classname="equation_inline" data-title="" />. We define the poset probability <img src="http://www.diva-portal.org/cgi-bin/mimetex.cgi?P(%5Calpha%20%5Cpreceq%20%5Cbeta)" data-classname="equation_inline" data-title="" /> as the proportion of linear extensions where <img src="http://www.diva-portal.org/cgi-bin/mimetex.cgi?%5Csigma(%5Calpha)%20%5Cle%20%5Csigma(%5Cbeta)" data-classname="equation_inline" data-title="" />. We are primarily interested in <img src="http://www.diva-portal.org/cgi-bin/mimetex.cgi?P(%5Calpha%20%5Cpreceq%20%5Cbeta)" data-classname="equation_inline" data-title="" /> for incomparable elements <img src="http://www.diva-portal.org/cgi-bin/mimetex.cgi?%5Calpha%20%5Cparallel%20%5Cbeta" data-classname="equation" data-title="" />. The probability has significance in areas such as information theory. Let <img src="http://www.diva-portal.org/cgi-bin/mimetex.cgi?e(%5Cmathbb%7BP%7D)" data-classname="equation_inline" data-title="" /> denote the total number of linear extensions of <img src="http://www.diva-portal.org/cgi-bin/mimetex.cgi?%5Cmathbb%7BP%7D" data-classname="equation_inline" data-title="" />. We prove that the poset probability can be evaluated as <img src="http://www.diva-portal.org/cgi-bin/mimetex.cgi?P(%5Calpha%20%5Cpreceq%20%5Cbeta)%20=%20%5Cfrac%7B%20%5Csum_%7BT%20%5Cin%20B(%5Calpha,%5Cbeta)%7D%20e(T)%20e(%5Cmathbb%7BP%7D%20%5Csetminus%20(T%20%5Ccup%20%5C%7B%5Calpha%5C%7D))%7D%7Be(%5Cmathbb%7BP%7D)%7D" data-classname="equation" data-title="" /> where <img src="http://www.diva-portal.org/cgi-bin/mimetex.cgi?B(%5Calpha,%5Cbeta)" data-classname="equation_inline" data-title="" /> is the set of order ideals of <img src="http://www.diva-portal.org/cgi-bin/mimetex.cgi?%5Cmathbb%7BP%7D" data-classname="equation_inline" data-title="" /> without <img src="http://www.diva-portal.org/cgi-bin/mimetex.cgi?%5Calpha" data-classname="equation" data-title="" /> or <img src="http://www.diva-portal.org/cgi-bin/mimetex.cgi?%5Cbeta" data-classname="equation" data-title="" />, where we can add <img src="http://www.diva-portal.org/cgi-bin/mimetex.cgi?%5Calpha" data-classname="equation_inline" data-title="" /> to get a new order ideal of <img src="http://www.diva-portal.org/cgi-bin/mimetex.cgi?%5Cmathbb%7BP%7D" data-classname="equation_inline" data-title="" />. The practicality of the preceding formula is explored and we show that <img src="http://www.diva-portal.org/cgi-bin/mimetex.cgi?T%20%5Cin%20B(%5Calpha,%5Cbeta)%20%5CLeftrightarrow%20%5Cleft%5C%7B%20x%20%7C%20x%20%5Cprec%20%5Calpha%20%5Cright%5C%7D%20%5Csubseteq%20T%20%5Ctext%7B%20and%20%7D%20T%20%5Ctext%7B%20order%20ideal%20of%20%7D%0A%5Cleft%5C%7B%20x%20%7C%20%5Calpha%20%5Cnot%20%5Cpreceq%20x,%5C%20%5Cbeta%20%5Cnot%20%5Cpreceq%20x%7D" data-classname="equation" /> The formula is particularly useful for certain classes of posets such as partition posets which are examined in further detail. We apply the formula to prove that, for all partition posets of shape <img src="http://www.diva-portal.org/cgi-bin/mimetex.cgi?%5Bn,n%5D" data-classname="equation_inline" data-title="" />, the probability obeys <img src="http://www.diva-portal.org/cgi-bin/mimetex.cgi?P((2,a)%20%5Cpreceq%20(1,a+1))%20=%20%5Cfrac%7B%20C_a%20C_%7Bn-a%7D%7D%20%7BC_n%7D" data-classname="equation" data-title="" /> where <img src="http://www.diva-portal.org/cgi-bin/mimetex.cgi?C_n" data-classname="equation_inline" data-title="" /> is the nth Catalan number and <img src="http://www.diva-portal.org/cgi-bin/mimetex.cgi?a%20%3C%20n" data-classname="equation_inline" data-title="" />. We also explore how Monte Carlo methods can be used to estimate <img src="http://www.diva-portal.org/cgi-bin/mimetex.cgi?P(%5Calpha%20%5Cpreceq%20%5Cbeta)" data-classname="equation_inline" data-title="" />.

In partial differential equations (PDEs), conserved quantities like mass and momentum are fundamental to understanding the behavior of the described physical systems. The preservation of conserved quantities is essential when using numerical schemes to approximate solutions of corresponding PDEs. If the discrete solutions obtained through these schemes fail to preserve the conserved quantities, they may be physically meaningless and unreliable. Previous approaches focused on checking conservation in PDEs and numerical schemes, but they did not give adequate attention to systematically handling parameters. This is a crucial aspect because many PDEs and numerical schemes have parameters that need to be dealt with systematically. Here, we investigate if the discrete analog of a conserved quantity is preserved under the solution induced by a parametric finite difference method. In this thesis, we modify and enhance a pre-existing algorithm to effectively and reliably deduce conserved quantities in the context of parametric schemes, using the concept of comprehensive Groebner systems. The main contribution of this work is the development of a versatile algorithm capable of handling various parametric explicit and implicit schemes, higher-order derivatives, and multiple spatial dimensions. The algorithm’s effectiveness and efficiency are demonstrated through examples and applications. In particular, we illustrate the process of selecting an appropriate numerical scheme among a family of potential discretization for a given PDE.

This thesis presents the work of a master degree project in mechatronics by two students from The Royal Institute of Technology. The project was carried out during spring 2017 in collaboration with Bosch Rexroth Mellansel as part of their desire to improve their operations. It is also in line with the Bosch Groups ambition to lead the development within Industry 4.0. The aim was to investigate the information need on a discrete manufacturing process and how radio-frequency identification (RFID) can be used to cover that need. The background research was made with qualitative methods using a literature review on relevant areas and a case study of Bosch Rexroth Mellansel. A discrete event simulation was created to confirm the possibilities of an RFID tracking system. It acted as a target for what the developed demonstrator should fulfil and was realised through a system of four wireless nodes connected in a mesh network. The plant in Mellansel partially implemented a Bosch standardised RFID system in parallel with the development of the demonstrator, which enabled a comparison of the two systems. The results show that from a tag event, which gives information on what, where and when, it is possible to, in real time, analyse and visualise valuable key performance indicators for a production process. It is also possible to use the data to automate transactions in an enterprise resource system which removes non-value adding activities from an operator while also ensuring consistency in the reporting procedure. The results indicate that benefits can be achieved. However, this requires further quantitative analysis before it can be fully confirmed and be used to push the development of Industry 4.0 forward. / Denna rapport presenterar ett examensarbete inom mekatronik av två studenter från Kungliga Tekniska Högskolan. Projektet genomfördes under våren 2017 i samarbete med Bosch Rexroth Mellansel som en del av deras strävan att förbättra sin verksamhet. Det ligger också i linje med Bosch koncernens ambition att leda utvecklingen inom Industri 4.0. Syftet var att undersöka informationsbehovet hos en diskret tillverkningsprocess och hur radio-frequency identification (RFID) kan användas för att täcka detta behov. Bakgrundsstudien gjordes med kvalitativa metoder som litteraturstudie inom relevanta områden och en fallstudie av en produktionsprocess inom Bosch Rexroth Mellansel. En simulering av produktionsprocessen skapades för att bekräfta möjligheterna av att använda ett RFID system för spårning av objekt. Den fungerade som ett mål för vad den utvecklade demonstratorn skulle uppfylla och realiserades genom en prototyp bestående av fyra trådlösa noder samlade i ett mesh nätverk. Parallellt med utvecklingen av demonstratorn gemomförde fabriken i Mellansel en del-implementering av en Bosch-standardiserad RFID lösning, vilket möjliggjorde en jämförelse av de två systemen. Resultaten visar att det från en avläsning av en tag, som ger information om vad, var och när, så är möjligt att i realtid analysera och visualisera värdefulla nyckeltal för en produktionsprocess. Det är också möjligt att använda data för att automatisera transaktioner i ett affärssystem som tar bort icke värdeskapande aktiviteter för operatören och samtidigt säkerställer en standardiserad rapporteringsprocess. Resultaten visar att fördelar kan uppnås men kräver ytterligare kvantitativ analys innan de kan bekräftas till fullo och användas för att driva utvecklingen av Industri 4.0 framåt.

No description available.