• Refine Query
  • Source
  • Publication year
  • to
  • Language
  • 21
  • 10
  • 2
  • 2
  • 2
  • 1
  • Tagged with
  • 41
  • 41
  • 19
  • 19
  • 18
  • 18
  • 18
  • 17
  • 15
  • 9
  • 9
  • 9
  • 9
  • 8
  • 7
  • 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.
31

Optimization techniques for radio resource management in wireless communication networks

Weeraddana, P. C. (Pradeep Chathuranga) 22 November 2011 (has links)
Abstract The application of optimization techniques for resource management in wireless communication networks is considered in this thesis. It is understood that a wide variety of resource management problems of recent interest, including power/rate control, link scheduling, cross-layer control, network utility maximization, beamformer design of multiple-input multiple-output networks, and many others are directly or indirectly reliant on the general weighted sum-rate maximization (WSRMax) problem. Thus, in this dissertation a greater emphasis is placed on the WSRMax problem, which is known to be NP-hard. A general method, based on the branch and bound technique, is developed, which solves globally the nonconvex WSRMax problem with an optimality certificate. Efficient analytic bounding techniques are derived as well. More broadly, the proposed method is not restricted to WSRMax. It can also be used to maximize any system performance metric, which is Lipschitz continuous and increasing on signal-to-interference-plus-noise ratio. The method can be used to find the optimum performance of any network design method, which relies on WSRMax, and therefore it is also useful for evaluating the performance loss encountered by any heuristic algorithm. The considered link-interference model is general enough to accommodate a wide range of network topologies with various node capabilities, such as singlepacket transmission, multipacket transmission, simultaneous transmission and reception, and many others. Since global methods become slow in large-scale problems, fast local optimization methods for the WSRMax problem are also developed. First, a general multicommodity, multichannel wireless multihop network where all receivers perform singleuser detection is considered. Algorithms based on homotopy methods and complementary geometric programming are developed for WSRMax. They are able to exploit efficiently the available multichannel diversity. The proposed algorithm, based on homotopy methods, handles efficiently the self interference problem that arises when a node transmits and receives simultaneously in the same frequency band. This is very important, since the use of supplementary combinatorial constraints to prevent simultaneous transmissions and receptions of any node is circumvented. In addition, the algorithm together with the considered interference model, provide a mechanism for evaluating the gains when the network nodes employ self interference cancelation techniques with different degrees of accuracy. Next, a similar multicommodity wireless multihop network is considered, but all receivers perform multiuser detection. Solutions for the WSRMax problem are obtained by imposing additional constraints, such as that only one node can transmit to others at a time or that only one node can receive from others at a time. The WSRMax problem of downlink OFDMA systems is also considered. A fast algorithm based on primal decomposition techniques is developed to jointly optimize the multiuser subcarrier assignment and power allocation to maximize the weighted sum-rate (WSR). Numerical results show that the proposed algorithm converges faster than Lagrange relaxation based methods. Finally, a distributed algorithm for WSRMax is derived in multiple-input single-output multicell downlink systems. The proposed method is based on classical primal decomposition methods and subgradient methods. It does not rely on zero forcing beamforming or high signal-to-interference-plus-noise ratio approximation like many other distributed variants. The algorithm essentially involves coordinating many local subproblems (one for each base station) to resolve the inter-cell interference such that the WSR is maximized. The numerical results show that significant gains can be achieved by only a small amount of message passing between the coordinating base stations, though the global optimality of the solution cannot be guaranteed. / Tiivistelmä Tässä työssä tutkitaan optimointimenetelmien käyttöä resurssienhallintaan langattomissa tiedonsiirtoverkoissa. Monet ajankohtaiset resurssienhallintaongelmat, kuten esimerkiksi tehonsäätö, datanopeuden säätö, radiolinkkien ajastus, protokollakerrosten välinen optimointi, verkon hyötyfunktion maksimointi ja keilanmuodostus moniantenniverkoissa, liittyvät joko suoraan tai epäsuorasti painotetun summadatanopeuden maksimointiongelmaan (weighted sum-rate maximization, WSRMax). Tästä syystä tämä työ keskittyy erityisesti WSRMax-ongelmaan, joka on tunnetusti NP-kova. Työssä kehitetään yleinen branch and bound -tekniikkaan perustuva menetelmä, joka ratkaisee epäkonveksin WSRMax-ongelman globaalisti ja tuottaa todistuksen ratkaisun optimaalisuudesta. Työssä johdetaan myös tehokkaita analyyttisiä suorituskykyrajojen laskentatekniikoita. Ehdotetun menetelmän käyttö ei rajoitu vain WSRMax-ongelmaan, vaan sitä voidaan soveltaa minkä tahansa suorituskykymetriikan maksimointiin, kunhan se on Lipschitz-jatkuva ja kasvava signaali-häiriö-plus-kohinasuhteen funktiona. Menetelmää voidaan käyttää minkä tahansa WSRMax-ongelmaan perustuvan verkkosuunnittelumenetelmän optimaalisen suorituskyvyn määrittämiseen, ja siksi sitä voidaan hyödyntää myös minkä tahansa heuristisen algoritmin aiheuttaman suorituskykytappion arvioimiseen. Tutkittava linkki-häiriömalli on riittävän yleinen monien erilaisten verkkotopologioiden ja verkkosolmujen kyvykkyyksien mallintamiseen, kuten esimerkiksi yhden tai useamman datapaketin siirtoon sekä yhtäaikaiseen lähetykseen ja vastaanottoon. Koska globaalit menetelmät ovat hitaita suurien ongelmien ratkaisussa, työssä kehitetään WSRMax-ongelmalle myös nopeita paikallisia optimointimenetelmiä. Ensiksi käsitellään yleistä useaa eri yhteyspalvelua tukevaa monikanavaista langatonta monihyppyverkkoa, jossa kaikki vastaanottimet suorittavat yhden käyttäjän ilmaisun, ja kehitetään algoritmeja, joiden perustana ovat homotopiamenetelmät ja komplementaarinen geometrinen optimointi. Ne hyödyntävät tehokkaasti saatavilla olevan monikanavadiversiteetin. Esitetty homotopiamenetelmiin perustuva algoritmi käsittelee tehokkaasti itsehäiriöongelman, joka syntyy, kun laite lähettää ja vastaanottaa samanaikaisesti samalla taajuuskaistalla. Tämä on tärkeää, koska näin voidaan välttää lisäehtojen käyttö yhtäaikaisen lähetyksen ja vastaanoton estämiseksi. Lisäksi algoritmi yhdessä tutkittavan häiriömallin kanssa auttaa arvioimaan, paljonko etua saadaan, kun laitteet käyttävät itsehäiriön poistomenetelmiä erilaisilla tarkkuuksilla. Seuraavaksi tutkitaan vastaavaa langatonta monihyppyverkkoa, jossa kaikki vastaanottimet suorittavat monen käyttäjän ilmaisun. Ratkaisuja WSRMax-ongelmalle saadaan asettamalla lisäehtoja, kuten että vain yksi lähetin kerrallaan voi lähettää tai että vain yksi vastaanotin kerrallaan voi vastaanottaa. Edelleen tutkitaan WSRMax-ongelmaa laskevalla siirtotiellä OFDMA-järjestelmässä, ja johdetaan primaalihajotelmaan perustuva nopea algoritmi, joka yhteisoptimoi monen käyttäjän alikantoaalto- ja tehoallokaation maksimoiden painotetun summadatanopeuden. Numeeriset tulokset osoittavat, että esitetty algoritmi suppenee nopeammin kuin Lagrangen relaksaatioon perustuvat menetelmät. Lopuksi johdetaan hajautettu algoritmi WSRMax-ongelmalle monisoluisissa moniantennilähetystä käyttävissä järjestelmissä laskevaa siirtotietä varten. Esitetty menetelmä perustuu klassisiin primaalihajotelma- ja aligradienttimenetelmiin. Se ei turvaudu nollaanpakotus-keilanmuodostukseen tai korkean signaali-häiriö-plus-kohinasuhteen approksimaatioon, kuten monet muut hajautetut muunnelmat. Algoritmi koordinoi monta paikallista aliongelmaa (yhden kutakin tukiasemaa kohti) ratkaistakseen solujen välisen häiriön siten, että WSR maksimoituu. Numeeriset tulokset osoittavat, että merkittävää etua saadaan jo vähäisellä yhdessä toimivien tukiasemien välisellä viestinvaihdolla, vaikka globaalisti optimaalista ratkaisua ei voidakaan taata.
32

Bezpečnost technických systémů / Safety of technological systems

Jiříček, Petr January 2009 (has links)
The work deals with the safety of technological systems and can be divided into two main thematic units. The attention in the first theoretic unit is paid to aspects that affect the safety of technological systems during their technical life. It describes, together with elementary norms and acts solving the products safety, the most important principles for creating and analysing the safety. It clarifies the origin of company’s risk management, part of its quality management, mentions the faults in which products can be found and also describes the failures which have the biggest effect on these faults and of course on the safety too. Attention is further paid to the reliability analysis, as the tool that helps to create the products safety in the pre-manufacturing phase and also to technical diagnostic, as the tool to keep the safety in after-manufacturing phase. The second practical unit arithmetically analyses the safety of two high-voltage transformers. For that it was used the database of real operation numerical values that were gained during diagnostic investigations on these transformers. In addition it describes mentioned diagnostics methods and gives the new procedure for analyse of transformers’ safety by criteria matrix and weighted sum approach. The main contribution of the work can be considered the checkout and the evaluation of this procedure for use in elaboration of high-voltage transformers diagnostic values for analyzing their safety.
33

Ranking System for IoT Industry Platform

Mukherjee, Somshree January 2016 (has links)
The Internet of Things (IoT) has seen a huge growth spurt in the last few years which has resulted in the need for more standardised IoT technology. Because of this, numerous IoT platforms have sprung up that offer a variety of features and use different technologies which may not necessarily be compliant with each other or with other technologies. Companies that wish to enter theIoT market are in constant need to find the most suitable IoT platform for their business and have a certain set of requirements that need to be fulfilled by the IoT platforms in order for the application to be fully functional. The problem that this thesis project is trying to address is a standardised procedure for selecting the IoT platforms. The project aims to suggest a list of requirements derived from the available IoT architecture models, that must be followed by IoT applications in general, and a subset of these requirements may be specified by the companies as essentials for their application. This thesis project also aims at development of a Web platform to automate this process, by listing the requirements on this website and allowing companies to input their choices,and accordingly show them the list of IoT platforms that comply with their input requirements. A simple Weighted Sum Model is used to rank the search result in order to prioritise the IoT platforms in order of the features that they provide. This thesis project also infers the best IoT architectural model available based on a comparative study of three major IoT architectures with respect to the requirements proposed. Hence the project concludes that this Web platform will ease the process of searching for the right IoT platform andthe companies can therefore make an informed decision about the kind of IoT platform that they should use, thereby reducing their time spent on market research and hence their time-to-market.
34

Optimizing dense wireless networks of MIMO links

Cortes-Pena, Luis Miguel 27 August 2014 (has links)
Wireless communication systems have exploded in popularity over the past few decades. Due to their popularity, the demand for higher data rates by the users, and the high cost of wireless spectrum, wireless providers are actively seeking ways to improve the spectral efficiency of their networks. One promising technique to improve spectral efficiency is to equip the wireless devices with multiple antennas. If both the transmitter and receiver of a link are equipped with multiple antennas, they form a multiple-input multiple-output (MIMO) link. The multiple antennas at the nodes provide degrees-of-freedom that can be used for either sending multiple streams of data simultaneously (a technique known as spatial multiplexing), or for suppressing interference through linear combining, but not both. Due to this trade-off, careful allocation of how many streams each link should carry is important to ensure that each node has enough degrees-of-freedom available to suppress the interference and support its desired streams. How the streams are sent and received and how interference is suppressed is ultimately determined by the beamforming weights at the transmitters and the combining weights at the receivers. Determining these weights is, however, made difficult by their inherent interdependency. Our focus is on unplanned and/or dense single-hop networks, such as WLANs and femtocells, where each single-hop network is composed of an access point serving several associated clients. The objective of this research is to design algorithms for maximizing the performance of dense single-hop wireless networks of MIMO links. We address the problems of determining which links to schedule together at each time slot, how many streams to allocate to each link (if any), and the beamforming and combining weights that support those streams. This dissertation describes four key contributions as follows: - We classify any interference suppression technique as either unilateral interference suppression or bilateral interference suppression. We show that a simple bilateral interference suppression approach outperforms all known unilateral interference suppression approaches, even after searching for the best unilateral solution. - We propose an algorithm based on bilateral interference suppression whose goal is to maximize the sum rate of a set of interfering MIMO links by jointly optimizing which subset of transmitters should transmit, the number of streams for each transmitter (if any), and the beamforming and combining weights that support those streams. - We propose a framework for optimizing dense single-hop wireless networks. The framework implements techniques to address several practical issues that arise when implementing interference suppression, such as the overhead of performing channel measurements and communicating channel state information, the overhead of computing the beamforming and combining weights, and the overhead of cooperation between the access points. - We derive the optimal scheduler that maximizes the sum rate subject to proportional fairness. Simulations in ns-3 show that the framework, using the optimal scheduler, increases the proportionally fair aggregate goodput by up to 165% as compared to the aggregate goodput of 802.11n for the case of four interfering single-hop wireless networks with two clients each.
35

Aplicação dos mecanismos de locomoção do tipo Jansen em cadeiras de rodas / Application of the locomotion mechanisms type Jansen in wheelchairs

Borges, José Salviano 09 March 2016 (has links)
Submitted by JÚLIO HEBER SILVA (julioheber@yahoo.com.br) on 2017-06-21T18:17:08Z No. of bitstreams: 2 Dissertação - José Salviano Borges - 2016.pdf: 59885367 bytes, checksum: 3df4277939769ca93ed44eee88f1bf84 (MD5) license_rdf: 0 bytes, checksum: d41d8cd98f00b204e9800998ecf8427e (MD5) / Approved for entry into archive by Cláudia Bueno (claudiamoura18@gmail.com) on 2017-07-07T19:56:31Z (GMT) No. of bitstreams: 2 Dissertação - José Salviano Borges - 2016.pdf: 59885367 bytes, checksum: 3df4277939769ca93ed44eee88f1bf84 (MD5) license_rdf: 0 bytes, checksum: d41d8cd98f00b204e9800998ecf8427e (MD5) / Made available in DSpace on 2017-07-07T19:56:31Z (GMT). No. of bitstreams: 2 Dissertação - José Salviano Borges - 2016.pdf: 59885367 bytes, checksum: 3df4277939769ca93ed44eee88f1bf84 (MD5) license_rdf: 0 bytes, checksum: d41d8cd98f00b204e9800998ecf8427e (MD5) Previous issue date: 2016-03-09 / Fundação de Amparo à Pesquisa do Estado de Goiás - FAPEG / To enlarge the active participation of individuals with disabilities in society, some mechanisms have been developed, such as crustches and wheelchairs. Wheelchairs are widely used, either temporarily or even permanently, allowing greater mobility and independence of the individual. However, the same is subject to the physical limitations of the wheels, requiring regular and hard grouynd to ensure bettermobility. Thus, some studies have suggested repacing the wheels on the legs, since the same part of the evolutionary process allows many terrestrial animals and viable movement to the wheels. The mechanisms with legs given the name of mobile machines. Among the most famous mobile machines are developed by the dutch phisicist Theo Jansen, called by Strandbeest. This study evaluates the repacement of the wheels of wheelchairs, for legs, trying to extend its use in less regular land. Also shown is the pattern of locomotion strcture developed by Jansen and the development of the Jansen similar structure using multiobjective optimizationmethods in order to ensure a new optimum configuration, and obtain a prototype proposed to be coupled in a conventional wheelchair. During the work it is proposed the method of wighted sumwith Pareto, this method related to onedimensionalyzation objectives. It also presents a brief comparison with two other methods –Weihted Sumand Pareto Ordination. / Para ampliar a participação ativa de indivíduos com deficiência na sociedade, alguns mecanismos foram desenvolvidos, como muletas e cadeiras de rodas. As cadeiras de rodas são bastante utilizadas, seja temporariamente ou até mesmo permanentemente, permitindo uma maior mobilidade e independência do indivíduo. Contudo, a mesma encontra-se sujeita às limitações físicas das rodas, necessitando de terrenos regulares e rígidos para garantir uma melhor locomoção. Assim, alguns estudos sugeriram a substituição das rodas por pernas, uma vez que as mesmas fazem parte do processo evolutivo demuitos animais terrestres e permite movimentos inviáveis para as rodas. Os mecanismos dotados de pernas receberam o nome de máquinas móveis. Dentre as máquinas móveis mais famosas encontram-se as desenvolvidas pelo físico holandês Theo Jansen, denominadas por Strandbeest. Este trabalho avalia a substituição das rodas das cadeiras de rodas por pernas, procurando ampliar a sua utilização em terrenos menos regulares. É apresentado também o modelo da estrutura de locomoção desenvolvida por Jansen, além do desenvolvimento de uma estrutura similar à de Jansen, utilizando métodos de otimização multiobjetivo com o intuito de se garantir uma nova configuração ótima, obtendo uma proposta de protótipo a ser acoplado em uma cadeira de rodas convencional. Durante o trabalho propõe-se o método da Soma Ponderada com Pareto, método este relacionado à unidimensionalização de objetivos. Apresenta-se também uma breve comparação com outros dois métodos - Soma Ponderada e Ordenação de Pareto.
36

Coordinated multi-antenna techniques for cellular networks:Pilot signaling and decentralized optimization in TDD mode

Komulainen, P. (Petri) 19 November 2013 (has links)
Abstract This thesis concentrates on the design and evaluation of spatial user multiplexing methods via linear transmit-receive processing for wireless cellular multi-user multiple-input multiple-output (MIMO) communication systems operating in the time-division duplexing (TDD) mode. The main focus is on the acquisition of effective channel state information (CSI) that facilitates decentralized processing so that the network nodes – base stations (BS) and user terminals (UT), each employing an arbitrary number of antenna elements – are able to locally participate in the network adaptation. The proposed methods rely on the uplink-downlink channel reciprocity and spatially precoded over-the-air pilot signaling. Considering (single-cell) multi-user MIMO systems, coordinated zero-forcing transmit-receive processing schemes for the uplink (UL) are proposed. The BS computes the transmission parameters in a centralized manner and employs downlink (DL) pilot signals to convey the information of the beamformers to be used by the UTs. When coexisting with the DL zero-forcing, the precoded DL demodulation pilots can be reused for UL beam allocation, and the precoded UL demodulation pilots are reused in turn for partial channel sounding (CS). As a result, only the precoded pilot symbols are needed in both UL and DL. Moreover, a concept for reducing the number of the required orthogonal UL CS pilot resources is presented. Based on their DL channel knowledge, the multi-antenna UTs form fewer pilot beams by spatial precoding than conventionally needed when transmitting antenna-specific pilots. In the context of DL zero-forcing, when taking into account the CSI estimation error at the BS, the overhead reduction turns out to improve robustness and increase the average system capacity. Considering multi-cell multi-user MIMO systems, decentralized coordinated DL beamforming strategies based on weighted sum rate (WSR) maximization are proposed. An optimization framework where the WSR maximization is carried out via weighted sum mean-squared-error minimization is utilized, and the approach is generalized by employing antenna-specific transmit power constraints. The iterative processing consists of optimization steps that are run locally by the BSs. In one novel strategy, the coordinating cells update their transmit precoders and receivers one cell at a time, which guarantees monotonic convergence of the network-wide problem. The strategy employs separate uplink CS and busy burst pilot signaling to reveal the effective channels of the UTs to the neighboring BSs. In another novel strategy, the monotonic convergence is sacrificed to devise a faster scheme where the BSs are allowed to optimize their variables in parallel based on just the CS responses and additional low-rate backhaul information exchange. The numerical results demonstrate that WSR maximization has the desirable property that spatial user scheduling is carried out implicitly. Finally, methods for UL CS overhead reduction are presented, and the effect of CSI uncertainty is addressed. / Tiivistelmä Tämä väitöskirja keskittyy lineaarisella lähetys- ja vastaanottoprosessoinnilla toteutettavien tilajakomonikäyttömenetelmien suunnitteluun ja arviointiin langattomissa moniantennisissa solukkoverkoissa, jotka hyödyntävät aikajakodupleksointia (TDD). Erityisesti tarkastellaan efektiivisen kanavatiedon hankintaa, joka mahdollistaa hajautetun prosessoinnin siten että verkkoelementit – tukiasemat ja terminaalit, jotka kukin hyödyntävät useaa antennielementtiä – voivat osallistua paikallisesti verkon adaptaatioon. Esitetyt menetelmät perustuvat ylä- ja alalinkin kanavien resiprookkisuuteen ja tilatasossa esikoodattuun opetus- eli pilottisignalointiin ilmarajapinnan yli. Yksisoluisille monikäyttäjä- ja moniantennijärjestelmille esitetään ylälinkin koordinoituja nollaanpakottavia lähetys- ja vastaanottomenetelmiä. Tukiasema laskee lähetysparametrit keskitetysti ja käyttää pilottisignaaleja kertomaan millaista lähetyskeilanmuodostusta terminaalien tulee käyttää. Alalinkin nollaanpakotuksen yhteydessä esikoodattuja demodulaatiopilotteja voidaan uudelleenkäyttää ylälinkin lähetyskeilojen allokointiin, ja esikoodattuja ylälinkin demodulaatiopilotteja uudelleenkäytetään puolestaan osittaiseen kanavan luotaukseen (sounding). Näin ollen molempiin suuntiin tarvitaan vain esikoodatut pilotit. Lisäksi työssä esitetään menetelmä ylälinkin luotauspilottiresurssitarpeen vähentämiseksi. Kanavatietoon perustuen moniantenniset terminaalit muodostavat tilatasossa esikoodattuja pilottilähetyskeiloja, joita tarvitaan vähemmän kuin perinteisiä antennikohtaisia pilotteja. Kun otetaan huomioon kanavanestimointivirhe tukiasemassa, resurssiensäästömenetelmä parantaa häiriösietoisuutta ja nostaa järjestelmän keskimääräistä kapasiteettia alalinkin nollaanpakotuksen yhteydessä. Monisoluisille monikäyttäjä- ja moniantennijärjestelmille esitetään hajautettuja koordinoituja alalinkin keilanmuodostusstrategioita, jotka perustuvat painotetun summadatanopeuden (WSR) maksimointiin. Valitussa optimointikehyksessä WSR:n maksimointi toteutetaan painotetun summaneliövirheen minimoinnin kautta, ja työssä menettelytapa yleistetään antennikohtaisten lähetystehorajoitusten tapaukseen. Iteratiivinen prosessointi koostuu optimointiaskelista, jotka tukiasemat paikallisesti suorittavat. Yhdessä esitetyssä strategiassa yhteistoiminnalliset solut päivittävät lähettimensä ja vastaanottimensa yksi solu kerrallaan, mikä takaa verkonlaajuisen ongelmanratkaisun monotonisen konvergenssin. Tämä strategia käyttää erillisiä ylälinkin luotaussignaaleja sekä varattu-signaaleja ilmaistakseen terminaalien efektiiviset kanavat naapuritukiasemille. Toisessa strategiassa monotoninen konvergenssi uhrataan ja kehitetään nopeammin adaptoituva menetelmä, jossa tukiasemat saavat optimoida muuttujansa rinnakkain, perustuen vain luotaussignaaleihin ja tukiasemien väliseen informaationvaihtoon. Numeeriset tulokset osoittavat, että WSR:n maksimointi toteuttaa aktiivisten käyttäjien valinnan tilatasossa implisiittisesti. Lopuksi esitetään menetelmiä luotauspilottiresurssitarpeen vähentämiseksi ja käsitellään kanavatiedon epävarmuuden vaikutusta.
37

Heatmap Visualization of Neural Frequency Data / Visualisering av neural frekvensdata som värmekarta

Roa Rodríguez, Rodrigo, Lundin, Robert January 2016 (has links)
Complex spatial relationships and patterns in multivariate data are relatively simple to identify visually but di cult to detect computation- ally. For this reason, Anivis, an interactive tool for visual exploration of multivariate quantitative pure serial periodic data was developed. The data has four dimensions depth, laterality, frequency and time. The data was visualized as an animated heatmap, by mapping depth and laterality to coordinates in a pixel grid and frequency to color. Transfer functions were devised to map a single variable to color through parametric curves. Anivis implemented heatmap generation through both weighted sum and deconvolution for comparison reasons. Deconvolution exhibited a to have better theoretical and practical performance. In addition to the heatmap visualization a scatter-plot was added in order to visualize the causal relationships between data points and high value areas in the heatmap visualization. Performance and applicability of the tool were tested and verified on experimental data from the Karolinksa Institute’s Department of Neuroscience. / Komplexa spatiala mo ̈nster och fo ̈rh ̊allanden i multivariat data a ̈r rel- ativt sv ̊ara att identifiera via bera ̈kningar men simpla att identifiera vi- suellt. Att visualisera data fo ̈r denna typ av data-analys anva ̈nds ofta i m ̊anga olika typer av fa ̈lt. Detta motiverade utvecklingen av Anivis; ett interaktivt verktyg fo ̈r visuell utforskning av multivariat kvantitativ data av neural aktivitet. Anivis anva ̈nder sig av dataset baserade p ̊a experi- mentell data fr ̊an en forskningsgrupp p ̊a Karolinska Institutets Institution fo ̈r Neurovetenskap. Dessa fyrdimensionella dataset best ̊ar av ma ̈tningar fr ̊an neuroner i form av deras position, aktivitet i form av frekvens och tidpunkt. Denna data anva ̈nds fo ̈r att generera en animerad heatmap, da ̈r neuroners frekvensva ̈rden visas i form av f ̈arg. Frekvensva ̈rdena om- vandlades till fa ̈rgva ̈rden via ̈overg ̊angsfunktioner som kopplar numeriska va ̈rden till fa ̈rgva ̈rden via parametriserade kurvor. Anivis lyckades imple- mentera tv ̊a olika metoder f ̈or att generera heatmap, viktade summor och dekonvolution. Dessa tv ̊a metoder ja ̈mfo ̈rdes med varandra, varav dekon- volution visade sig vara den teoretiskt och praktiskt e↵ektivaste meto- den. Utvecklingen av Anivis visade a ̈ven behovet fo ̈r ett punktdiagram fo ̈r att visualisera f ̈orh ̊allandet mellan ma ̈tta frekvensv ̈arden och spatial frekvensfo ̈rdelning i heatmappen.
38

Active Structural Acoustic Control of Clamped and Ribbed Plates

Johnson, William Richard 12 December 2013 (has links) (PDF)
A control metric, the weighted sum of spatial gradients (WSSG), has been developed for use in active structural acoustic control (ASAC). Previous development of WSSG [1] showed that it was an effective control metric on simply supported plates, while being simpler to measure than other control metrics, such as volume velocity. The purpose of the current work is to demonstrate that the previous research can be generalized to plates with a wider variety of boundary conditions and on less ideal plates. Two classes of plates have been considered: clamped flat plates, and ribbed plates. On clamped flat plates an analytical model has been developed for use in WSSG that assumes the mode shapes are the product of clamped-clamped beam mode shapes. The boundary condition specific weights for use in WSSG have been derived from this formulation and provide a relatively uniform measurement field, as in the case of the simply supported plate. Using this control metric, control of radiated sound power has been simulated. The results show that WSSG provides comparable control to volume velocity on the clamped plate. Results also show, through random placement of the sensors on the plate, that similar control can be achieved regardless of sensor location. This demonstrates that WSSG is an effective control metric on a variety of boundary conditions. Ribbed plates were considered because of their wide use in aircraft and ships. In this case, a finite-element model of the plate has been used to obtain the displacement field on the plate under a variety of boundary conditions. Due to the discretized model involved, a numerical, as opposed to analytical, formulation for WSSG has been developed. Simulations using this model show that ASAC can be performed effectively on ribbed plates. In particular WSSG was found to perform comparable to or better than volume velocity on all boundary conditions examined. The sensor insensitivity property was found to hold within each section (divided by the ribs) of the plate, a slightly modified form of the flat plate insensitivity property where the plates have been shown to be relatively insensitive to sensor location over the entire surface of the plate. Improved control at natural frequencies can be achieved by applying a second control force. This confirms that ASAC is a viable option for the control of radiated sound power on non-ideal physical systems similar to ribbed plates.
39

User Experience Influenced Model for Comparing Application Development Tools

Mileikowsky, Celine, Porling, Sebastian January 2020 (has links)
There are many possible tools to develop mobile applications with. Choosing a development tool is done by considering many different factors, and the choice is currently done, in many cases, arbitrarily. For this project, a decision model is designed to ease the process of choosing a development tool. A survey was conducted to examine how people using different smartphone platforms discover and download applications. 94 responses were collected, showing that approximately 50% of Android-users found mobile applications by using search engines or browsers. The corresponding number was approximately 30% for iOS-users. A usability test was conducted to discover the differences in user experience between Progressive Web Applications and native applications. 18 usability tests were conducted comparing the same product developed as a Progressive Web Application and a native application. A majority of the participants had a technical background. Both Android and iOS devices were included in the tests. The results indicated that end-users notice when an application is not natively developed. The effect on the user experience is combined with other technical differences and applied to the decision model. This model was designed to predict if a native application, a Progressive Web Application or a React Native application is the most favourable to develop for a specific scenario. The final model could, according to consultants at the stakeholder Slagkryssaren AB, with good accuracy predict when the different development tools should be used. The model could be used as a discussion tool in the first stages of the development process of an application. / Det finns många möjliga verktyg för att utveckla mobila applikationer. Valet av utvecklingsverktyg görs genom att överväga många olika faktorer, och görs idag i många fall högst godtyckligt. För det här projektet designades en beslutsmodell som förenklar processen av att välja ett utecklingsverktyg. En undersökning gjordes för att undersöka hur användare av olika smartphone- plattformar upptäcker och laddar ner applikationer. 94 svar samlades, svaren visade att ungefär 50% av Android-användare hittade mobila applikationer genom internetsökningar eller webbläsare. Denna siffran var ungefär 30% för iOS-användare. Ett användarbarhetstest utfördes för att finna skillnader i användarupplevelse mellan progressiva webbapplikationer och native-applikationer. En majoritet av deltagarna hade en teknisk bakgrund. Både Android- och iOS-enheter testades. Resultatet tydde på att slutanvändare la märke till när en applikation inte utvecklades som en native-applikation. Effekten på användarvänligheten, kombinerat med tekniska skillnader mellan verktygen, tillämpades på beslutsmodellen. Modellen designades för att förutse om en native-applikation, en progressiva webbapplikation eller en React Native- applikation är mest fördelaktig att utveckla i ett specifikt scenario. Den slutgiltiga modellen kunde, enligt konsulter på uppdragsgivaren Slagkryssaren AB, med god precision avgöra när de olika utvecklingsverktygen bör nyttjas. Modellens användning blev som ett diskussionsverktyg i de första stadierna av processen med att välja utvecklingsvektyg.
40

Estimação de parâmetros de sinais gerados por sistemas lineares invariantes no tempo / Estimation of parameters of signals generated by time invariant linear systems

Agnaldo da Conceição Esquincalha 30 April 2009 (has links)
Fundação Carlos Chagas Filho de Amparo a Pesquisa do Estado do Rio de Janeiro / Nesta dissertação é apresentado um estudo sobre a recuperação de sinais modelados por somas ponderadas de exponenciais complexas. Para tal, são introduzidos conceitos elementares em teoria de sinais e sistemas, em particular, os sistemas lineares invariantes no tempo, SLITs, que podem ser representados matematicamente por equações diferenciais, ou equações de diferenças, para sinais analógicos ou digitais, respectivamente. Equações deste tipo apresentam como solução somas ponderadas de exponenciais complexas, e assim fica estabelecida a relação entre os sistemas de tipo SLIT e o modelo em estudo. Além disso, são apresentadas duas combinações de métodos utilizadas na recuperação dos parâmetros dos sinais: métodos de Prony e mínimos quadrados, e métodos de Kung e mínimos quadrados, onde os métodos de Prony e Kung recuperam os expoentes das exponenciais e o método dos mínimos quadrados recupera os coeficientes lineares do modelo. Finalmente, são realizadas cinco simulações de recuperação de sinais, sendo a última, uma aplicação na área de modelos de qualidade de água. / A study on the recovery of signals modeled by weighted sums of complex exponentials complex is presented. For this, basic concepts of signals and systems theory are introduced. In particular, the linear time invariant systems (LTI Systems) are considered, which can be mathematically represented by differential equations or difference equations, respectively, for analog or digital signals. The solution of these types of equations is given by a weighted sum of complex exponentials, so the relationship between the LTI Systems and the model of study is established. Furthermore, two combinations of methods are used to recover the parameters of the signals: Prony and least squares methods, and Kung and least squares methods, where Prony and Kung methods are used to recover the exponents of the exponentials and the least square method is used to recover the linear coefficients of the model. Finally, five simulations are performed for the recovery of signals, the last one being an application in the area of water quality models.

Page generated in 0.0358 seconds