- About
-
The Global ETD Search service is a free service for researchers
to find electronic theses and dissertations. This service is
provided by the
Networked Digital Library of Theses and Dissertations.
Our metadata is collected from universities around the world. If you manage a university/consortium/country archive and want to be added, details can be found on the NDLTD website.
Search results
Showing 1 to 3 of 3 (0.033 seconds)Spelling suggestions: "subject:"bid"" "subject:"bids""
| 1 |
Guía de acceso para BidiDirección de Gestión del Conocimiento 05 April 2021 (has links)
Proporciona los pasos y procedimientos para acceder al recurso Bidi.
|
| 2 |
Communications solution for refugee settlement : Investigation of nRF24L01+ modules for use in a communications networkEngquist, Martin, Bethdavid, Simon January 2018 (has links)
The main purpose of this thesis is to test a communications solution for the second to largest refugee settlement in the world, Bidi Bidi. A solution where it is possible to inform the refugees with necessary information, for example that the water at a specific location is currently contaminated or that food is provided at another location. The idea is to use nRF24L01+ modules which operate in the 2.4 GHz frequency band and send information through various ways. This includes turning LEDs' on and off, sending text Strings and streaming audio. The results showed that the modules are too unreliable for a refugee settlement. They also showed that it is not possible to send other types' of data while streaming audio, but there could be workarounds. It is clear that more knowledge and further investigations are needed.
|
| 3 |
Lineární algebraické modelování úloh s nepřesnými daty / Lineární algebraické modelování úloh s nepřesnými datyVasilík, Kamil January 2011 (has links)
In this thesis we consider problems Ax b arising from the discretization of ill-posed problems, where the right-hand side b is polluted by (unknown) noise. It was shown in [29] that under some natural assumptions, using the Golub-Kahan iterative bidiagonalization the noise level in the data can be estimated at a negligible cost. Such information can be further used in solving ill-posed problems. Here we suggest criteria for detecting the noise revealing iteration in the Golub-Kahan iterative bidiagonalization. We discuss the presence of noise of different colors. We study how the loss of orthogonality affects the noise revealing property of the bidiagonalization.
|
Page generated in 0.0391 seconds