Indoor positioning systems can be of a great help when trying to local- ize in an indoor environment. To be able to navigate, there is a need for an indoor map that to some degree represent the reality. This thesis aims to come up with a proof of concept of a system that maps rectan- gular objects onto a two dimensional map in an indoor environment. The maps will be drawn with the help of the position of a hand-held device that marks the corners of the objects. A problem that arises is that the error in the positioning can contribute to objects that have the same size and are aligned in reality can vary in size and be misaligned on the map. Another problem is that with the error in the position- ing, the position might end up within an existing object, which leads to a bad user experience. The problems were solved by developing a system, that given a map with objects mapped from the help of posi- tioning, can adjust the shape and positions of the objects based on the mean-values of multiple identical objects. To avoid positions within objects, a function was written that always checks if the positions is within an existing object and if that is the case, then move the correct the position to the closest position outside of the object. The final re- sult was a proof of concept of a system that can generate maps with mapped objects and users that can traverse the map with a good user experience. / Inomhuspositioneringssystem kan vara till stor hjälp när man vill lo- kalisera sig i en inomhusmiljö. För att kunna navigera sig så krävs det en inomhuskarta som i viss mån representerar verkligheten. Den- na avhandling ämnar att komma fram till en konceptvalidering för ett system som ska mappa upp rektangulära objekt på tvådimensio- nella kartor i en inomhusmiljö. Kartorna ritas upp med hjälp av po- sitionen från en handhållen enhet som markerar hörnen på objekten. Problem som uppstår då är att felet från positionen kan få objekt som är av samma storlek och uppställda på rad i verkligheten, att se oli- ka stora ut och vara placerade lite huller om buller på kartan. Ett an- nat problem är att positionen kan med det här felet i positioneringen, komma att befinna sig i ett existerande objekt, vilket leder till en dålig användarupplevelse. Problemen löstes genom att utveckla ett system, som utifrån en karta med objekt mappade med hjälp av positionering, kan justera objektens form och position baserat på medelvärdena av flertalet likadana objekt. För att undvika positioner innanför objekt så skrevs en funktion som hela tiden kollar om positionen befinner sig i något befintligt objekt och om så skulle vara fallet så korrigeras po- sitionen till närmsta position utanför objektet. Slutresultatet blev en konceptvalidering av ett system som kan generera kartor med mappa- de objekt och användare som kan traversera dessa kartor med en god användarupplevelse.

Combinatorial Group Testing (CGT) is a process of identifying faulty interactions (“errors”) within a particular set of items. Error Locating Arrays (ELAs) are combinatorial designs that can be built from Covering Arrays (CAs) to not only cover all errors in a system (each involving up to a certain number of items), but to locate and identify the errors as well. In this thesis, we survey known results for CGT, as well as CAs, ELAs, and some other types of related arrays. More importantly, we give several new results. First, we give a new algorithm that can be used to test a system in which each component (factor) has two options (values), and at most two errors are present. We show that, for systems with at most two errors, our algorithm improves upon a related algorithm by Mart´ınez et al. in terms of both robustness and efficiency. Second, we give the first adaptive CGT algorithm that can identify, among a given set of k items, all faulty interactions involving up to three items. We then compare it, performance-wise, to current-best nonadaptive method that can identify faulty interactions involving up to three items. We also give the first adaptive ELA-building algorithm that can identify all faulty interactions involving up to three items when safe values are known. Both of our new algorithms are generalizations of ones previously given by Mart´ınez et al. for identifying all faulty interactions involving up to two items.

Combinatorial Group Testing (CGT) is a process of identifying faulty interactions (“errors”) within a particular set of items. Error Locating Arrays (ELAs) are combinatorial designs that can be built from Covering Arrays (CAs) to not only cover all errors in a system (each involving up to a certain number of items), but to locate and identify the errors as well. In this thesis, we survey known results for CGT, as well as CAs, ELAs, and some other types of related arrays. More importantly, we give several new results. First, we give a new algorithm that can be used to test a system in which each component (factor) has two options (values), and at most two errors are present. We show that, for systems with at most two errors, our algorithm improves upon a related algorithm by Mart´ınez et al. in terms of both robustness and efficiency. Second, we give the first adaptive CGT algorithm that can identify, among a given set of k items, all faulty interactions involving up to three items. We then compare it, performance-wise, to current-best nonadaptive method that can identify faulty interactions involving up to three items. We also give the first adaptive ELA-building algorithm that can identify all faulty interactions involving up to three items when safe values are known. Both of our new algorithms are generalizations of ones previously given by Mart´ınez et al. for identifying all faulty interactions involving up to two items.

Failed fuel refers to the breach in the fuel-clad of an irradiated fuel assembly in a nuclear reactor. Neutron detection or gamma detection is commonly used in Failed Fuel Detection and Locating (FFDL) system to monitor the activity of the coolant. Though these methods offer specific advantages under different conditions of the coolant, providing both types of detectors in FFDL system is impractical. This limitation is the motivation for the detector system developed in the present work. In the present work, effort has been made for realising a detector system for simultaneous measurement of neutron and gamma activity of the coolant, thus offering a two-parameter basis for failed fuel detection. NE213 liquid scintillator was chosen for this work as it has good detection capability for both neutrons and gammas. Additionally, the neutrons and gammas interacting with NE213 detector can be separated based on pulse shape discrimination. The work reported in this thesis includes fabrication details and different steps followed in assembling the NE213 detector. Details of experimental set-up developed for pulse height analysis and pulse shape analysis are covered. Results of experiments carried out to study the response of the NE213 detector to gamma and neutron sources using pulse height analyser are presented. The absolute gamma efficiency and relative gamma efficiency of NE213 detector are calculated. Neutron–gamma separation capability of NE213 detector based pulse shape analysis system is reported. Application of the developed detector system to analyse the coolant activity in FFDL system in a reactor is described. Response of the detector is compared with the existing FFDL system at different power levels of the reactor. Since failed fuel is a rare event, it was simulated using neutron and gamma sources. Pulse shape analysis spectra obtained under simulated failed fuel condition are presented.

內容感知的應用在今日已經變的越來越熱門，而位置資訊的可知也因此衍生出許多研究的議題。這篇論文提出了一套精準的室內無線網路系統名為Precise Indoor Location System (PILS)。大部分擁有良好定位精準度的定位系統都必須在事情花費許多的人力在收集大量的訊號上面，使得定位系統的變的不實用與需求過多的人力資源。在這篇論文裡，我們將目標放在減少在建置訊號地圖上的人力資源耗費並且保持住定位系統的精準度在一個可以接受的範圍。我們也提出了在資料收集上、訊號內插上、以及位置估計上的模型。另外我們也考慮了一連串連續訊號的相關度來提高準確度。無線網路訊號傳遞的特性也是我們研究的一部份，大小範圍的遮蔽包含在我們所研究的訊號傳遞現象裡面。最後我們提出了一套學習的模型來調整我們的訊號地圖，以改進因為測量數目的減少所造成的精準度下降。 / Context-aware applications become more and more popular in today’s life. Location-aware information derives a lot of research issues. This thesis presents a precise indoor RF-based WLAN (IEEE 802.11) locating system named Precise Indoor Locating System (PILS). Most proposed location systems acquire well location estimation results but consume high level of manual efforts to collect huge amount of signal data. As a consequence, the system becomes impractical and manpower-wasted. In this thesis, we aim to reduce the manual efforts in constructing radio map and maintain high accuracy in our system. We propose the models for data calibration, interpolating, and location estimation in PILS. In the data calibration and location estimation models, we consider the autocorrelation of signal samples to enhance accuracy. Large scale and small scale fading are involved in the wireless channel propagation model. We also propose a learning model to adjust radio map for improving the accuracy down caused by calibrated data reduction.

Today’s society requires that transformation of information is done effectively and correctly. In other words, the received message must correspond to the message being sent. There are a lot of decoding methods to locate and correct errors. The main purpose in this degree project is to study one of these methods based on the Euclidean algorithm. Thereafter an example will be illustrated showing how the method is used when decoding a three - error correcting BCH code. To begin with, fundamental concepts about coding theory are introduced. Secondly, linear codes, cyclic codes and BCH codes - in that specific order - are explained before advancing to the decoding process. The results show that correcting one or two errors is relatively simple, but when three or more errors occur it becomes much more complicated. In that case, a specific method is required. / Dagens samhälle kräver att informationsöverföring sker på ett effektivt och korrekt sätt, det vill säga att den information som når mottagaren motsvarar den som skickades från början. Det finns många avkodningsmetoder för att lokalisera och rätta fel. Syftet i denna uppsats är att studera en av dessa, en som baseras på Euklides algoritm och därefter illustrera ett exempel på hur metoden används vid avkodning av en tre - rättande BCH - kod. Först ges en presentation av grunderna inom kodningsteorin. Sedan introduceras linjära koder, cykliska koder och BCH - koder i nämnd ordning, för att till sist presentera avkodningsprocessen. Det visar sig att det är relativt enkelt att rätta ett eller två fel, men när tre eller fler fel uppstår blir det betydligt mer komplicerat. Då krävs någon speciell metod.

Nous nous demandons dans ce travail de quelle manière "quand" modifie l'interprétation qui serait faite d'une séquence de propositions P. Q ou Q. P lorsqu'il préfixe P. Après avoir souligné les problèmes que cette question soulevé dans plusieurs études fondatrices en sémantique temporelle, nous apportons des arguments pour défendre la théorie, admise par plusieurs auteurs, selon laquelle "quand P" est un adverbial de localisation temporelle. Nous montrons que les propriétés discursives de P, souvent traitée dans la littérature comme une proposition présupposée, s'expliquent par cette seule contrainte : "quand" impose de traiter cette proposition comme la description d'un repère temporel utilisé dans l'interprétation de Q. Nous montrons en outre que la théorie selon laquelle "quand P" désigne un repère temporel permet de rendre compte des contraintes qui pèsent sur les relations chronologiques pouvant s'établir entre les événements eP et eQ des deux propositions. En particulier, nous avançons que l'inférence d'une relation de succession immédiate entre eP et eQ reflète l'une des relations qui peuvent s'établir entre le référent d'un adverbial de localisation et l'événement qu'il localise : le référent de l'adverbial sert de borne initiale à l'intervalle d'occurrence de l'événement. Enfin, nous étudions la manière dont la description d'éventualité et le marqueur temporel accueillis par P contribuent à la sémantique de l'adverbial "quand P". Nous précisons les propriétés quantificationnelles et temporelles conférées au référent de "quand P" par les différents temps du français et expliquons par ces propriétés les contraintes de cooccurrence qui pèsent sur l'emploi des temps dans P et Q. / In this work, we adress the following question: how does "quand" change the interpretation that may be made of a sequence of clauses P. Q or Q. P when it prefixes P? After highlighting the problems that this matter raises in several pioneering studies in temporal semantics, we provide arguments to defend the theory E accepted by several authors E that quand P is a temporal locating adverbial. We show that the discourse properties of P, which is often treated in the literature as a presupposed proposition, is explained by the following single constraint: "quand" demands to treat this clause as the description of a time mark to be used in the interpretation of Q. We further show that the theory that "quand P" designates a time mark accounts for the constraints on the temporal relations that can be established between eP and eQ, the events of both clauses. In particular, we argue that the inference that eQ immediately follows eP reflects one of the relations that can be established between the referent of a temporal locating adverbial and the event it locates: the referent of the adverbial provides an initial bound to the interval of occurrence of the event. Finally, we study how the event description and the tense of P contribute to the semantics of the adverbial "quand P". We specify the quantificational and temporal properties imparted to the referent of quand P by the different tenses of French and explain these properties by co-occurrence constraints that impact the use of tenses in P and Q.

Combinatorial Group Testing (CGT) is a process of identifying faulty interactions (“errors”) within a particular set of items. Error Locating Arrays (ELAs) are combinatorial designs that can be built from Covering Arrays (CAs) to not only cover all errors in a system (each involving up to a certain number of items), but to locate and identify the errors as well. In this thesis, we survey known results for CGT, as well as CAs, ELAs, and some other types of related arrays. More importantly, we give several new results. First, we give a new algorithm that can be used to test a system in which each component (factor) has two options (values), and at most two errors are present. We show that, for systems with at most two errors, our algorithm improves upon a related algorithm by Mart´ınez et al. in terms of both robustness and efficiency. Second, we give the first adaptive CGT algorithm that can identify, among a given set of k items, all faulty interactions involving up to three items. We then compare it, performance-wise, to current-best nonadaptive method that can identify faulty interactions involving up to three items. We also give the first adaptive ELA-building algorithm that can identify all faulty interactions involving up to three items when safe values are known. Both of our new algorithms are generalizations of ones previously given by Mart´ınez et al. for identifying all faulty interactions involving up to two items.

In this thesis, I constrain rupture scenarios of active crustal faults in the southern Strait of Georgia and Boundary Bay in order to assess their tsunamigenic potential. The NW-SE-trending Drayton Harbor, Birch Bay, and Sandy Point faults had been previously identified on the southern side of Boundary Bay from aeromagnetic, LiDAR, and paleoseismic data; all show evidence of abrupt vertical Holocene displacements. South of Boundary Bay, the E-W-trending Skipjack Island fault zone was recently mapped on the basis of multibeam sonar imagery and seismic reflection data, with evidence for Holocene offsets of the seafloor and subsurface sediments. In addition, the Fraser River Delta fault had been hypothesized on the basis of a line of pockmarks and fluid seeps. Since these faults have only been recently mapped and identified as active, there is little information available on their structure, rupture style, and past large earthquakes. This makes it difficult to constrain rupture models to predict how fault slip could displace the seafloor during a large earthquake, for input to tsunami models. I analyzed relocated earthquake hypocentres, earthquake mechanisms, bathymetry, topography, and aeromagnetic, seismic reflection, and magnetotelluric data, to constrain the location, strike, dip, and rupture width of each fault. Correlations between datasets enabled mapping of northwestward extensions of the Sandy Point and Birch Bay faults, as well as delineating the previously unmapped Fraser River Delta fault. These offshore faults appear to be associated with infilled basement valleys in the subsurface, perhaps due to differential glacial erosion of weakened fault zone material. The Drayton Harbor fault could not be definitively mapped across Boundary Bay, so was excluded from the rupture modelling. Rupture styles were constrained using a combination of earthquake mechanisms, stress orientations, other evidence of regional compression, and vertical paleoseismic offsets. Where possible, paleoseismic displacements in past earthquakes were used to constrain the amount of fault slip for scenario earthquakes; empirical relations between fault slip and fault length or area were used to estimate displacements for the Skipjack Island and Fraser River Delta faults. The Birch Bay, Sandy Point, Skipjack Island, and Fraser River Delta faults all pose a significant tsunami risk to communities surrounding the southern Strait of Georgia and Boundary Bay. Considering both the originally mapped and extended lengths, the Birch Bay and Sandy Point faults could rupture in reverse-faulting earthquakes up to Mw 6.7-7.4 and 6.8-7.5, respectively, with seafloor uplift up to 2-2.5 m triggering damaging tsunami waves (up to at least 2.5 m) that could arrive onshore with little to no warning after the shaking begins. Similarly, the Fraser River Delta fault could host reverse or dextral-reverse slip earthquakes up to Mw 7.0-7.6, with seafloor uplift of 0.6-3.5 m. Ruptures on the Skipjack Island fault would likely have a larger strike-slip component; earthquakes of Mw 6.9-7.3 produce modelled seafloor uplift of 0.5-1.9 m. These results suggest that large tsunamigenic earthquakes on crustal faults in the southern Strait of Georgia should be included in future seismic and tsunami hazard assessments on both sides of the international border. / Graduate

Today’s most widely used tracking solutions for consumers involve the Global Positioning System (GPS) which meets most needs when it comes to rough estimation of location. GPS however is limited in accuracy with a horizontal error of around 5 meters and cannot be used in the areas where the satellites cannot provide a strong enough signal e.g. indoor areas or near mountains and other sources of blockage. Ultra-wideband (UWB) abolishes these two issues, providing an accuracy at centimeter level and works great in indoor areas. This thesis dives into the theory behind tracking devices with UWB and includes an implementation of the tracking as well as covers noteworthy issues, shortcomings, and future work. The app that is developed within this thesis runs on Android mobile devices and can locate and track another Android mobile device running the same app. Results were clear that the concept works, but more filtering needs to be done in order to remove the remaining noise.