• Refine Query
  • Source
  • Publication year
  • to
  • Language
  • 6177
  • 1947
  • 1
  • Tagged with
  • 8125
  • 8125
  • 8125
  • 8064
  • 904
  • 830
  • 659
  • 626
  • 614
  • 560
  • 466
  • 400
  • 397
  • 335
  • 334
  • 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.
591

Automatic Management of Related Data Distribution Service Topics

Kazai, Gabriel January 2022 (has links)
A distributed system is a system that utilizes a network to communicate while usually being broken down into multiple software programs. Said programs generally have separate tasks, and a paradigm used in the manner above is publish-subscribe. However, to enable the publish-subscribe paradigm, DDS (Data Distribution Service) is utilized as a network middleware for said type of communication. This thesis proposes a suitable way to specify data variants to allow for code generation to automatically create topics of information and publish data based on said variants. Thus, making it easier for distributed systems developers to handle information variants. Succeeding in this task could provide developers with a tool that can be used to create data variants more cheaply and faster than doing it manually. I designed variant types to achieve the goal of the thesis, along with a specification describing said types. Lastly, along with the previously mentioned, a manual implementation of a working DDS system utilizing said variant types proved the functionality and evaluated the completed work. As the goal sought out, the thesis's result is a working method for a user to specify variants that would allow for automatic code generation, thus providing developers with a functional specification to utilize within the field.
592

En tillgängligare mobilwebb för personer med finmotoriska svårigheter

Westerlund, Frida, Eklund Dafteke, Tim January 2022 (has links)
Idag behöver varken offentliga eller privata aktörer tillämpa tillgänglighetsanpassningar på sina hemsidor när de besöks från smartmobilens webbläsare. Det finns inga krav på att vara inkluderande för människor med finmotoriska svårigheter eller rörelsenedsättningar som använder sin smartmobil för att nyttja internet. Majoriteten av alla människor i Sverige har tillgång till en smartmobil och trots bristande tillgänglighet är människor med funktionsnedsättningar oftare aktiva på sociala medier än människor utan funktionsnedsättningar. För att förhindra ett digitalt utanförskap behöver vi tillgänglighetsanpassa den digitala världen så att alla kan ta del av den. Därför har vi i vår studie utforskat möjligheten att främja digital tillgänglighet på en hemsida när den besöks från smartmobilens webbläsare genom att ersätta pekskärmen och externa hjälpmedel med en digital artefakt. Vi har tagit fram frågeställningarna \say{Hur kan mobilens sensorer, som är åtkomliga genom webbläsaren, underlätta interaktionen med hemsidor för människor som har finmotoriska svårigheter?} och \say{I vilken utsträckning kan mobilens sensorer användas för att imitera funktionaliteten hos en extern artefakt, som en kontaktstyrningsenhet?}. För att besvara dem har vi genomfört en nätnografisk studie, utvecklat en prototyp baserat på den nätnografiska studien och genom en användarstudie utvärderat prototypen. Vi kunde konstatera att smartmobilens sensorer är tillräckliga för att navigera en hemsida utan pekskärmen, men vi kunde inte säkerställa om vår artefakt underlättar för personer med rörelsenedsättningar. Vad som framgår av vår studie är att mer behöver göras för att tillgängliggöra hemsidor när de besöks från smartmobilens webbläsare och att smartmobilens sensorer kan användas som ett komplement till nuvarande standarder för digital tillgänglighet.
593

Behavioural analysis and signature-based detection of Slowloris

Ljunglin, Joakim January 2022 (has links)
It is important to efficiently and correctly be able to detect and classify network traffic, both legitimate and malicious. The slow rate category of DoS attacks makes this task especially hard, as the generated traffic resembles legitimate traffic. This thesis proposes a specialized packet signature for the slow DoS attack Slowloris, as a result of a traffic analysis comparing legitimate traffic and malicious Slowloris traffic. The analysis was performed through packet inspection with a network protocol analyzing tool. The proposed signature focuses on different data sizes of each packet and payload inspection, specifically assessing the beginnings and endings of the payload. To evaluate the signature, it was implemented as a detection tool which was then exposed to normal rate legitimate, slow rate legitimate and malicious traffic. The tool was evaluated by measuring its accuracy and false positive rate. Each evaluation consisted of 100,000 packets and was repeated 50 times, resulting in an evaluation set of five million packets. The tool achieved an average accuracy rate of 98,3% and a false positive rate of 0,0%.
594

A Composable and Extensible Environment for Equation-based Modeling and Simulation of Variable Structured Systems in Modelica

Tinnerholm, John January 2022 (has links)
Modeling and Simulation are usually used to solve real-world problems safely and efficiently by constructing digital models of Cyber-Physical Systems. The models can be simulated and analyzed with respect to requirements, and decisions about their design can be based on this analysis. In the latest years, the field of Modeling and Simulation has grown massively and is tackling systems with increased complexity. Thus, the process of modeling and simulating Cyber-Physical systems is becoming more and more complex. This increase requires modeling languages that can express systems with increasing complexity. Modelica is an open-standard declarative equation-based object-oriented language used to model various systems expressed using equations. Modelica tools can read the models, process them, and simulate them. However, the Modelica language and tools cannot express some concepts such as structural changes to the components or behavior of Cyber-Physical Systems during Simulation. In this thesis, we propose extensions of the Modelica language to support modeling so-called variable structure systems, that is, systems where the structure of the system varies during Simulation. The full Modelica language and the new extensions are supported by a novel composable programming environment framework called OpenModelica.jl written in the Julia language. The proposed Modelica language extensions can handle explicit and implicit modeling of variable structure systems by introducing new operators and, consequently, new semantics to the Modelica language. The explicit modeling is based on extensions that switch at runtime between continuous modes of operations with operators similar to the ones used in the specification of Modelica state-machines. The implicit modeling supports reconfiguration during runtime via recompilation. A Just-in-time compiler was implemented to handle the new semantics using the symbolic-numeric programming language Julia. We investigate the performance of our new framework and compare it with existing state-of-the-art Modelica tools on models with thousands of equations and variables. The results show that our extensions and proposed runtime framework is viable for simulating both usual Modelica models and models with variable structure systems. The conclusion is that the Modelica language can be extended further to support systems with variable structures with the addition of a few operators and JIT enhanced runtime system support. Based on the result of this thesis, we propose several directions for future work. / <p><strong>Funding agencies: </strong>This work has been supported by the Swedish Government in the ELLIIT project andby Vinnova in the ITEA3 EMBRACE project. Support has also been received from the Swedish Strategic Research foundation (SSF) in the LargeDyn project. The development of OpenModelica is supported by the Open Source Modelica Consortium.</p><p>ISBN has been corrected in the PDF-version. 2022-06-03</p><p></p>
595

Alternative variants of zero-knowledge proofs

Pass, Rafael January 2004 (has links)
No description available.
596

Correlating Local Weather Conditions with Cellular Network Performance Indicators / Korrelation av lokala väderförhållanden och prestanda för mobilnätverk

Jacobson, Olof January 2016 (has links)
In this thesis, the relationships between local weather and the performance of a cellular telecommunications network were investigated by means of data analysis. Models of the average daily cycles in the data were developed accounting for cyclic behaviour and seasonal trends. Several different analysis methods were then performed on data measuring deviations from these average cycles. The methods used were multiple linear regression, partial least squares regression, calculation of Spearman's correlation coefficients, and regression by artificial neural networks. Some of the results indicate that the number of calls being attempted in the network is related to the local weather conditions. Additionally, small indications were found that the percentage of failed calls in the network was related to the amount of precipitation. These findings could potentially be valuable for network operators. / I detta examensarbete undersöktes samband mellan lokala väderförhållanden och indikatorer på nätverksprestanda för ett mobilnätverk. Undersökningen genomfördes med hjälp av dataanalys. Modeller för den genomsnittliga dagliga variationen i de undersökta parametrarna utvecklades där hänsyn togs till cykliska trender och säsongsberoende. Ett flertal analysmetoder tillämpades sedan på data som mätte avvikelser från de genomsnittliga variationerna. Metoderna som användes var linjär regression, ’partial least squares’ regression, uträkning av Spearmans rangkorrelation, och regression med hjälp av artificiella neuronnät. Resultaten indikerade att antalet samtal som försökte kopplas upp i nätverket influerades av väderförhållandena. Dessutom kunde små indikationer urskiljas på att nederbörd påverkade andelen misslyckade samtalsuppkopplingar i nätverket. Resultaten kan potentiellt vara av värde för nätverksoperatörer.
597

Authoring visualizations of live musical performances: a lean development approach

Mendonça, Ismael January 2016 (has links)
No description available.
598

Evaluating recommendation systems for a sparse boolean dataset / Evaluering av rekommendationssystem för ett glest booleskt dataset

Daniels, Jonas January 2016 (has links)
Recommendation systems is an area within machine learning that has become increasingly relevant with the expansion of the daily usage of technology. The most popular approaches when making a recommendation system are collaborative filtering and content-based. Collaborative filtering also contains two major sub approaches memory-based and model-based. This thesis will explore both content-based and collaborative filtering to use as a recommendation system on a sparse boolean dataset. For the content-based filtering approach term frequency-inverse document frequency algorithm was implemented. As a memory-based approach K-nearest neighbours method was conducted. For the model-based approach two different algorithms were implemented, singular value decomposition and alter least square. To evaluate, a cross-approach evaluator was used by looking at the recommendations as a search, a search that the users were not aware of. Key values such as the number of test users who could received a recommendation, time consumption, F1 score (precision and recall) and the dataset size were used to compare the methods and reach conclusions.  The finding of the study was that collaborative filtering was the most accurate choice when it comes to sparse datasets. The implemented algorithm for the model-based collaborative filtering that performed most accurate was Singular value decomposition without any regularization against overfitting. A further step of this thesis would be to evaluate the different methods in an online environment with active users, giving feedback in real time. / Rekommendationssystem är ett område inom maskininlärning som har blivit allt vanligare i och med expansionen av den dagliga användningen av teknik. Det mest populära metoder när du gör ett rekommendationssystemet, “collaborative filtering” och “content-based filtering”. Collaborative filtering innehåller också två sub kategorier, “memory-based” och “model-based”. Denna avhandling kommer att undersöka både “content-based” och “collaborative filtering” för användning som ett rekommendationssystem för ett glest boolesk dataset. Som “content-based” strategi implementerades term frekvens omvänd dokument frekvens (TF-IDF) algoritmen. Som en “memory-based” strategi implementerades K-närmast grannarna (K-NN) metoden. För “model-based” angripsättet implementerades två olika algoritmer, singulärvärdesuppdelning (SVD) och altenerande minsta kvadrat metoden (ALS). För att kunna utvärdera metoderna mot varandra sågs rekommendationer som en sökning, en sökning som användarna inte var medvetna om att det gjort. Viktiga värden som antalet testanvändare som kunde fått en rekommendation, tidsåtgång, “F1 score” (precision och recall) och dataset storlek användes för att jämföra det olika metoderna och dra slutsatser. Resultatet av studien visar att “collaborative filtering” var den högst presterande när det gäller en gles datamängd. Den implementerade algoritmen för “model-based collaborative filtering“ som visat sig vara den mest exakta var SVD utan reglering mot “overfitting”. En framtida påbyggnad av denna rapport är att utvärdera olika metoder i en online-miljö med aktiva användare som kan ge respons i realtid.
599

Automatic Subcellular Protein Localization Using Deep Neural Networks / Automatisk proteinlokalisering på subcellulär nivå med hjälp av djupa neurala nätverk

Winsnes, Casper January 2016 (has links)
Protein localization is an important part in understanding the functionality of a protein. The current method of localizing proteins is to manually annotate microscopy images. This thesis investigates the feasibility of using deep artificial neural networks to automatically classify subcellular protein locations based on immunoflourescent images. We investigate the applicability in both single-label and multi-label classification, as well as cross cell line classification. We show that deep single-label neural networks can be used for protein localization with up to 73% accuracy. We also show the potential of deep multi-label neural networks for protein localization and cross cell line classification but conclude that more research is needed before we can say for certain that the method is applicable.
600

Jämförelse av maskininlärningsmetoder för att förutspå aktieprisrörelser / Comparison of machine learning methods used to predict stock price movements

Lindblad, Johan January 2015 (has links)
Att förutspå aktiepriser är något som undersökts i hundra- tals år och kan användas som grund för investeringsbeslut. Under senare år har maskininlärning applicerats på detta problem vilket gjort att ett flertal metoder föreslagits och den elektroniska handelns införande har gjort att högupp- löst data med nanosekundsprecision blivit tillgänglig. I den- na rapport presenteras resultat av en jämförande studie av klassificeringsmetoder som föreslagits för att förutspå ak- tieprisernas rörelser. Högupplöst data för fyra olika aktier från Stockholmsbörsen har använts för att jämföra tre olika metoder. Resultaten visar att det på grund av datas fördelning är svårt att uppnå ett tillfredsställande resultat. Priserna rör sig relativt sett mer sällan när högupplöst data används, vilket gör att ett fåtal felklassificeringar kan göra modellen otillräcklig. Skillnaderna mellan metodernas resultat anty- der dock att valet av indikatorer har stor betydelse och för vidare forskning kan det vara relevant att undersöka såväl innehåll i indata som metoder för att hantera den ojämna fördelningen. Vidare har en litteraturstudie genomförts för att un- dersöka den elektroniska handels bakgrund, syfte och på- verkan. Även om detta inte tycks ha varit det ursprungliga syftet i alla fall verkar den elektroniska handeln ha lett till mer effektiva marknader med lägre transaktionskostnader. / The prediction of stock prices has been attempted for hun- dreds of years and can be used for making investment deci- sions. In later years machine learning has been appliced to this problem, leading to the proposal of several dif- ferent methods. Furthermore, the recent introduction of electronic market places has made available high-resolution data with nanosecond precision. This report presents the results of a study comparing classification methods that have been proposed for predicting the movement of stock prices. High-resolution data from four different stocks on the Stockholm Stock Exchange has been used to compare three different methods. The results show that the distribution of the data makes it difficult to reach a satisfying result. Prices move rela- tively more rarely when high-resolution data is used, mak- ing even a few misclassifications significant. However, the differences between the methods’ results suggest that the choice of indicators is of great importance and for future research it may be relevant looking at both the content of input data and methods of handling the skewed distribu- tion. Furthermore, a literature review has been performed re- searching the electronic trading’s background, purpose and effects. Although it may not have been the intended pur- pose it seems that electronic trading has made the markets more efficient and transaction costs lower.

Page generated in 0.1053 seconds