lnu.sePublikationer
Ändra sökning
Avgränsa sökresultatet
1 - 25 av 25
RefereraExporteraLänk till träfflistan
Permanent länk
Referera
Referensformat
  • apa
  • harvard1
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Annat format
Fler format
Språk
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Annat språk
Fler språk
Utmatningsformat
  • html
  • text
  • asciidoc
  • rtf
Träffar per sida
  • 5
  • 10
  • 20
  • 50
  • 100
  • 250
Sortering
  • Standard (Relevans)
  • Författare A-Ö
  • Författare Ö-A
  • Titel A-Ö
  • Titel Ö-A
  • Publikationstyp A-Ö
  • Publikationstyp Ö-A
  • Äldst först
  • Nyast först
  • Skapad (Äldst först)
  • Skapad (Nyast först)
  • Senast uppdaterad (Äldst först)
  • Senast uppdaterad (Nyast först)
  • Disputationsdatum (tidigaste först)
  • Disputationsdatum (senaste först)
  • Standard (Relevans)
  • Författare A-Ö
  • Författare Ö-A
  • Titel A-Ö
  • Titel Ö-A
  • Publikationstyp A-Ö
  • Publikationstyp Ö-A
  • Äldst först
  • Nyast först
  • Skapad (Äldst först)
  • Skapad (Nyast först)
  • Senast uppdaterad (Äldst först)
  • Senast uppdaterad (Nyast först)
  • Disputationsdatum (tidigaste först)
  • Disputationsdatum (senaste först)
Markera
Maxantalet träffar du kan exportera från sökgränssnittet är 250. Vid större uttag använd dig av utsökningar.
  • 1.
    Aspernäs, Andreas
    et al.
    Linnéuniversitetet, Fakulteten för teknik (FTK), Institutionen för datavetenskap (DV).
    Nensén, Mattias
    Linnéuniversitetet, Fakulteten för teknik (FTK), Institutionen för datavetenskap (DV).
    Container Hosts as Virtual Machines: A performance study2016Självständigt arbete på grundnivå (kandidatexamen), 10 poäng / 15 hpStudentuppsats (Examensarbete)
    Abstract [en]

    Virtualization is a technique used to abstract the operating system from the hardware. The primary gains of virtualization is increased server consolidation, leading to greater hardware utilization and infrastructure manageability. Another technology that can be used to achieve similar goals is containerization. Containerization is an operating-system level virtualization technique which allows applications to run in partial isolation on the same hardware. Containerized applications share the same Linux kernel but run in packaged containers which includes just enough binaries and libraries for the application to function. In recent years it has become more common to see hardware virtualization beneath the container host operating systems. An upcoming technology to further this development is VMware’s vSphere Integrated Containers which aims to integrate management of Linux Containers with the vSphere (a hardware virtualization platform by VMware) management interface. With these technologies as background we set out to measure the impact of hardware virtualization on Linux Container performance by running a suite of macro-benchmarks on a LAMP-application stack. We perform the macro-benchmarks on three different operating systems (CentOS, CoreOS and Photon OS) in order to see if the choice of container host affects the performance. Our results show a decrease in performance when comparing a hardware virtualized container host to a container hosts running directly on the hardware. However, the impact on containerized application performance can vary depending on the actual application, the choice of operating system and even the type of operation performed. It is therefore important to consider these three items before implementing container hosts as virtual machines.

  • 2.
    Borgman, Isabelle
    Linnéuniversitetet, Fakulteten för teknik (FTK), Institutionen för medieteknik (ME).
    Scan me – Ökad säkerhet med multifactor authentication: En undersökning om effekten vid ökad säkerhet i digitala identifierare2016Självständigt arbete på grundnivå (kandidatexamen), 10 poäng / 15 hpStudentuppsats (Examensarbete)
    Abstract [sv]

    Följande kandidatuppsats undersöker en applikation utifrån tre faktorer: säkerhet, användbarhet och funktionalitet. Arbetet tar fram en prototyp på en identifieringsapplikation som använder sig av QR-koder för att identifiera personer. Identifieringsprocessen är tänkt att fungera i t.ex. en insläppningskö på en pub. QR-koden finns i gästens mobil och dörrvakten använder den framtagna prototypen på en surfplatta eller smartphone för att scanna av gästens QR-kod. Syftet är att undersöka hur användbarheten och funktionaliteten påverkas i en applikation när det läggs till en faktor för att öka säkerheten. Detta undersöks genom ett användartest där 8 testpersoner får testa den framtagna prototypen och ge kommentarer både utifrån en gästs och en dörrvakts perspektiv.

    Resultaten visar på att användbarheten dras ner något i samband med att säkerheten ökar. Identifiering med hjälp av QR-läsaren tar ungefär 4 sekunder längre än vad det gör att identifiera med den vanliga metoden, d.v.s jämföra ett ID-kort med ett medlemskort. Funktionaliteten ökar i systemet eftersom att det läggs till funktionalitet för att scanna av en QR-kod och jämföra informationen ur den med en databas. Prototypen som har tagits fram i denna kandidatuppsats har utvecklingsmöjligheter och kan användas i andra sammanhang och i andra miljöer; prototypen skulle exempelvis fungera lika bra i ett affärssammanhang där affären kan ersätta sina fysiska medlemskort med en QR-kod och en avläsare för att ge sina kunder förmåner.

  • 3.
    Calvo, Adrián
    Linnéuniversitetet, Fakulteten för teknik (FTK), Institutionen för datavetenskap (DV).
    Using the IBM WatsonTM Dialog Service for Assisting Parallel Programming2016Självständigt arbete på grundnivå (kandidatexamen), 10 poäng / 15 hpStudentuppsats (Examensarbete)
    Abstract [en]

    IBM Watson is on the verge of becoming a milestone in computer science as it is using a new technology that relies on cognitive systems. IBM Watson is able to understand questions in natural language and give proper answers. The use of cognitive computing in parallel programming is an open research issue. Therefore, the objective of this project is to investigate how IBM Watson can help in parallel programming by using the Dialog Service. In order to answer our research question an application has been built based on the IBM Watson Dialog Service and a survey has been carried out. The results of our research demonstrate that the developed application offers valuable answers to the questions asked by a programmer and the survey reveals that students would be interested in using it.

  • 4.
    El-Ahmad, Adham
    Linnéuniversitetet, Fakulteten för teknik (FTK), Institutionen för datavetenskap (DV).
    A Study on the Relation between Software Quality & Test Quantity2016Självständigt arbete på grundnivå (kandidatexamen), 10 poäng / 15 hpStudentuppsats (Examensarbete)
    Abstract [en]

    Testing is an essential phase of software development process. It helps to ensure the quality of the software by finding bugs, errors, and defects that may occur during the development or the deployment of the system. IT companies and field workers, spend a lot of efforts on testing a software. However, how far should testers go with testing? In this research, we study 80 open source real world projects, and explore how much testing code has been written in those projects, in comparison with production code. We also try to find if there is any relation between different project factors, such as: project size, number of contributors and the amount of testing that has been done in those projects. We also give some recommendations to help field workers determine the amount of testing needed for a software.

  • 5.
    Eneman, Rasmus
    Linnéuniversitetet, Fakulteten för teknik (FTK), Institutionen för datavetenskap (DV).
    Improving load time of SPAs: An evaluation of three performance techniques2016Självständigt arbete på grundnivå (kandidatexamen), 10 poäng / 15 hpStudentuppsats (Examensarbete)
    Abstract [en]

    The code size of single page web applications are constantly growing which do have an negative effect on the load time. Previous research have shown that load time are important to users and that a slow application will lose potential customers even before it has loaded. In this paper three architecturally far-reaching techniques are measured to see how they can improve the load time and help to decide if an application should be built with one or more of the tested techniques which are HTTP2 push, Code Splitting and Isomorphism. The experiment shows that Isomorphism can provide a big improvement for the time to first paint and that Code Splitting can be a useful technique for large code bases on mobile phones.

  • 6.
    Griffith, Ioseff
    Linnéuniversitetet, Fakulteten för teknik (FTK), Institutionen för datavetenskap (DV).
    Generation, evaluation, and optimisation of procedural 2D tile-based maps in turn-based tactical video games2016Självständigt arbete på grundnivå (kandidatexamen), 10 poäng / 15 hpStudentuppsats (Examensarbete)
    Abstract [en]

    In modern times, procedural content generation sees frequent use in video games, producing anything from graphics to maps and quests. This study focuses on how these techniques can be used to produce forest maps for tactical role-playing games, and how this is applied in particular to Starshard, one such game. The main points addressed are how well the forestry growth simulation algorithm previously implemented in Starshard compares to algorithms based on other popular techniques, how to utilise evaluation and optimisation to produce correct and strategically interesting maps without human interference, and whether or not players can easily perceive a difference between procedural maps and maps designed by humans. With high demand for new algorithms to automate content generation in order to help smaller teams of developers and maintain interest in content post release, there is much value in delving further into less frequently explored aspects such as tile-based maps or player perception of procedural content. In order to answer the research problems, a controlled experiment comparing four forestry generation algorithms was performed, in addition to a study of literature to implement evaluation and optimisation algorithms, and a survey to gauge player reactions to the produced maps. Ultimately, the growth simulation proves to be more successful than alternative algorithms in reducing number of errors in maps. In addition, the results of the survey showed that while players are capable of reliably picking out human created maps, their ratings for procedurally generated maps were not much lower than these and they could frequently mistake procedural maps as being produced by humans.

  • 7.
    Hauch, Manuel David
    Linnéuniversitetet, Fakulteten för teknik (FTK), Institutionen för datavetenskap (DV).
    Using Geographic Location for Optimal Service Selection2016Självständigt arbete på grundnivå (kandidatexamen), 10 poäng / 15 hpStudentuppsats (Examensarbete)
    Abstract [en]

    Nowadays, a multitude of functionally equal web services are available. By thisbroad offer, the need of a service recommendation based on non-functional characteristics(e.g. price, response time, availability) is increasing. The static ServiceLevel Agreements (SLAs) of service providers cannot suffice this need. SLAs arenot reliable enough, due to the fact that they do not cover the dynamic performanceand quality changes of services during their lifetime. This bachelor’s thesis waswritten within a research project of the Linnaeus University in Sweden and the KarlsruheUniversity of Applied Science in Germany. The goal of this research projectis to eliminate the issues as described above. For this reason, a framework for anoptimized service selection was developed. Instead of using the static SLAs, measurementsof each service call are taken. On the basis of the measurements and therequirements of the consumer, the framework then provides an automated best-fitservice selection.

    The purpose of this thesis is to involve the geographic location of each serviceconsumer in the automated service selection. Therefore, a mobile app was developedto get a sufficient amount of real world test data. This app measures service calls andadditionally records the geographic location of the user. Based on the geographiclocation, the collected measurement data then were grouped into regions. Thereby,it could be shown that the geographic location of the user can be used to improve theoptimal service selection.

  • 8.
    Håkansson, Jesper
    et al.
    Linnéuniversitetet, Fakulteten för teknik (FTK), Institutionen för datavetenskap (DV).
    Badran, Sherief
    Linnéuniversitetet, Fakulteten för teknik (FTK), Institutionen för datavetenskap (DV).
    Evaluating cyclomatic complexity on functional JavaScript2016Självständigt arbete på grundnivå (kandidatexamen), 10 poäng / 15 hpStudentuppsats (Examensarbete)
    Abstract [en]

    Bugs in software is a very common problem, code reviews can help to catch

    bugs early on and detect which code is the most complex and may introduce

    bugs but when the code base is very large it can be costly to review all the

    code. Cyclomatic complexity can be used to give an indication of how complex

    the system source code is and help the developers to select which code they

    should review. But when measuring cyclomatic complexity on code written

    according to the functional paradigm, McCabe’s formula will not be sufficient

    since it is a formula most suitable for imperative code. Therefore we are

    making adaptations to a formula suited for pure functional languages in order

    to fit functional JavaScript. We are using an inductive empirical quantitative

    measurement method to calculate cyclomatic complexity on a directed graph

    implementation in order to define adaptations for functional JavaScript. Our

    results show a working adapted version of the formula. We have measured on

    a graph implemented in Haskell and on a corresponding functional JavaScript

    version which results in a cyclomatic complexity difference at only 0.375.

  • 9.
    Johansson, Anders
    et al.
    Linnéuniversitetet, Fakulteten för teknik (FTK), Institutionen för datavetenskap (DV).
    Wassbjer, Robin
    Linnéuniversitetet, Fakulteten för teknik (FTK), Institutionen för datavetenskap (DV).
    Windows 10 för inbyggda system: En undersökning av Windows 10 IoT Enterprise2016Självständigt arbete på grundnivå (kandidatexamen), 10 poäng / 15 hpStudentuppsats (Examensarbete)
    Abstract [sv]

    Microsoft lanserade Windows 10 i mitten av 2015. Windows 10 är en serie operativ-system med flera versioner anpassade för många olika användningsområden. Windows 10 IoT Enterprise är en av versionerna inriktade på olika typer av inbyggda system. Vid anpassning utefter miljö kan delar av operativsystemet därför låsas ned och begränsas. För konfiguration av Windows 10 finns både gamla och nya verktyg tillgängliga.

    I detta projekt görs en undersökning av nedlåsnings- och anpassningsmöjligheter, samt konfigurationsverktyg med fokus på Windows 10 IoT Enterprise. De verktyg som har använts är Microsofts helt nya Windows Imaging and Configuration Designer, men även det lite äldre Windows System Image Manager. Med och utan hjälp av dessa verktyg har flera konfigurationsmöjligheter undersökts. Detta inkluderar bl.a. användar- och applikationsbegränsningar, branding (mjukvarumässig produktmärk-ning), och utseendeanpassningar. Utöver detta behandlas även framtagandet av färdig-konfigurerade Windows-avbildningar ytligt.

    Projektet har bestått av åtskilliga tester, främst baserade på Microsofts egna dokumentation. Majoriteten av de möjligheter och konfigurationer som har undersökts har visat sig fungerande och någorlunda lättanvända. En fungerande funktion har endast bedömts som sådan om denna uppfyller de beskrivningar Microsoft själva har givit ut. Detta utan att för den sakens skull förstöra andra delar av systemet. I slutändan beskriver resultaten till stor del funktioner som finns och fungerar, men inte i vilka praktiska scenarier dessa lämpar sig för användning. Vid konfiguration av större nedlåsningsfunktioner uppvisar Windows ICD problem. Ytterligare problem som också har noterats berör bl.a. möjligheterna för profilkopiering och generalisering i Windows 10.

  • 10.
    Johansson, Sandra
    Linnéuniversitetet, Fakulteten för teknik (FTK), Institutionen för medieteknik (ME).
    Användbar navigering i mobila gränssnitt: En studie med fokus på faktorer som kan underlätta navigeringenför oerfarna användare av mobila applikationer2016Självständigt arbete på grundnivå (kandidatexamen), 180 hpStudentuppsats (Examensarbete)
    Abstract [en]

    This study examines the factors that can facilitate navigation pattern forinexperienced users of mobile applications for the creation of a mobilegraphical interface. In this study, the navigation is created with the help ofclick surfaces in the graphical interface, which can cause usability problemson small screens.A qualitative study has been made and two methods used are Card Sortingand user testing that included interviews and observations. The Card Sortingmethod allowed users to organize and structure the contents of the system ina way that seemed appropriate for them. How the users chose to structure thecontents was then helpful when the system was created. Interviews andobservations were then made with the users while they tested the system.This was done with five test persons four times during the course ofdevelopment to have the users involved in the development process.The results of this studie are presented with different methods of how tocreate useful navigation in mobile interfaces. A prototype for a payroll andtime reporting system was created based on the literature search and based onthe results of the survey user testing.This study shows that it is difficult to make a mobile website useful to allthose who will use it, but to implement certain aids can increase the usabilityfor many users. The study conducted in this work shows that some importantfactors in the creation of mobile applications is to use large clicks surfaces,use the full screen, and to constantly give users feedback.

  • 11.
    Karlberg, Pär
    Linnéuniversitetet, Fakulteten för teknik (FTK), Institutionen för medieteknik (ME).
    Usability Analysis of 3D Touch Technology in the Context of Mobile Gaming2016Självständigt arbete på grundnivå (kandidatexamen), 10 poäng / 15 hpStudentuppsats (Examensarbete)
    Abstract [en]

    This study researched users' ability to control the new input technology known as 3D Touch that is a pressure detection implemented in the new generations of iPhone. The purpose of this study was to research users ability to control the technology in a context of mobile gaming. An application was created to test participants' ability to match and control the pressure of 3D Touch at different forces. The result was then analysed and used to create an endless runner game included with the 3D Touch technology. The game was used in a usability test to investigate the user experience of the 3D Touch technology in a real gaming situation. The experimental results indicated that users have more difficulty to control the pressure of 3D Touch at higher forces. It also indicated that more stressful game situations can make it even harder to control the force of 3D Touch. 

  • 12.
    Karlsson, Emil
    et al.
    Linnéuniversitetet, Fakulteten för teknik (FTK), Institutionen för datavetenskap (DV).
    Edberg, Mikael
    Linnéuniversitetet, Fakulteten för teknik (FTK), Institutionen för datavetenskap (DV).
    Skrapa försäljningssidor på nätet: Ett ramverk för webskrapningsrobotar2016Självständigt arbete på grundnivå (kandidatexamen), 10 poäng / 15 hpStudentuppsats (Examensarbete)
    Abstract [sv]

    På internet finns det idag ett stort utbud av försäljningswebbsidor där det hela tiden inkommer nya annonser. Vi ser att det finns ett behov av ett verktyg som övervakar de här webbsidorna dygnet runt för att se hur mycket som säljs och vad som säljs. Att skapa ett program som övervakar webbsidor är tidskrävande, därför har vi skapat ett ramverk som underlättar skapandet av webbskrapare som är fokuserade på att listbaserade försäljningswebbsidor på nätet. Det finns flera olika ramverk för webbskrapning, men det finns väldigt få som endast är fokuserade på den här typen av webbsidor.

  • 13.
    Lagerkrants, Eleonor
    et al.
    Linnéuniversitetet, Fakulteten för teknik (FTK), Institutionen för datavetenskap (DV).
    Holmström, Jesper
    Linnéuniversitetet, Fakulteten för teknik (FTK), Institutionen för datavetenskap (DV).
    Using machine learning to classify news articles2016Självständigt arbete på grundnivå (kandidatexamen), 10 poäng / 15 hpStudentuppsats (Examensarbete)
    Abstract [en]

    In today’s society a large portion of the worlds population get their news on electronicdevices. This opens up the possibility to enhance their reading experience bypersonalizing news for the readers based on their previous preferences. We have conductedan experiment to find out how accurately a Naïve Bayes classifier can selectarticles that a user might find interesting. Our experiments was done on two userswho read and classified 200 articles as interesting or not interesting. Those articleswere divided into four datasets with the sizes 50, 100, 150 and 200. We used a NaïveBayes classifier with 16 different settings configurations to classify the articles intotwo categories. From these experiments we could find several settings configurationsthat showed good results. One settings configuration was chosen as a good generalsetting for this kind of problem. We found that for datasets with a size larger than 50there were no significant increase in classification confidence.

  • 14.
    Larsson, Gustav
    Linnéuniversitetet, Fakulteten för teknik (FTK), Institutionen för medieteknik (ME).
    En jämförande studie om direkt och indirekt vägledning i plattformsspel: Introduktion till spelmekanik2016Självständigt arbete på grundnivå (kandidatexamen), 10 poäng / 15 hpStudentuppsats (Examensarbete)
    Abstract [sv]

    I den här jämförande studien undersöks skillnaden mellan direkt och indirekt vägledning till spelmekanik i plattformsspel för PC. Detta för att ta reda på hur de olika introduktionerna påverkar spelarnas prestation i ett tidigt skede av spelet. Undersökningens syfte är att utröna vilken form av vägledning, mellan direkt och indirekt, som ger nya spelare bäst förutsättningar att lära sig ny spelmekanik snabbt och att tidigt etablera kompetens om användning av spelmekaniken.

    För att undersöka vilken typ av vägledning som är mest effektiv vid introduktion av spelmekanik i plattformsspel har fyra plattformsspel analyserats. Dessa spel har legat till grund för skapandet av två prototyper där den ena prototypen ger en direkt vägledning till spelmekanik och den andra ger en indirekt vägledning till spelmekanik. De två prototyperna används för att samla in data som i sin tur analyserats. Insamling av data har skett via ett webbaserat användartest där 26 personer deltagit varav 13 personer spelat prototypen som ger en direkt vägledning och 13 personer har spelat prototypen som ger en indirekt vägledning.

    För att bedöma spelarnas prestation mellan de olika prototyperna har två analyser utförts, prestationen bedöms i kompetens som spelarna etablerar i form av användning av spelmekaniken samt hur lång tid det tar för spelaren att använda spelmekaniken första gången. I den ena analysen undersöks tiden som spelarna från de båda prototyperna tagit på sig för att utföra olika mekaniker i spelet. I den andra analysen har spelarnas interaktion med spelet legat till grund för en bedömning av hur effektiva spelarna har varit under spelsessionen i form av etablerad kompetens om spelmekanikerna. De båda analyserna har sammanställts för att tillsammans bilda en uppskattning av spelarnas prestation i förhållande till varandra.

    Utifrån de analyser som utförts på insamlade data har spelare som fått en indirekt vägledning till spelmekanik presterat bättre i högre grad än spelare som fått en direkt vägledning till spelmekanik. Resultatet visar på att de spelmekaniker som används i testerna varit mindre komplexa och att spelare som fått en direkt vägledning presterat sämre tidsmässigt.

  • 15.
    Legaspi Ramos, Xurxo
    Linnéuniversitetet, Fakulteten för teknik (FTK), Institutionen för datavetenskap (DV).
    Scraping Dynamic Websites for Economical Data: A Framework Approach2016Självständigt arbete på grundnivå (kandidatexamen), 10 poäng / 15 hpStudentuppsats (Examensarbete)
    Abstract [en]

    Internet is a source of live data that is constantly updating with data of almost anyfield we can imagine. Having tools that can automatically detect these updates andcan select that information that we are interested in are becoming of utmost importancenowadays. That is the reason why through this thesis we will focus on someeconomic websites, studying their structures and identifying a common type of websitein this field: Dynamic Websites. Even when there are many tools that allow toextract information from the internet, not many tackle these kind of websites. Forthis reason we will study and implement some tools that allow the developers to addressthese pages from a different perspective.

  • 16.
    Magnusson, Erik
    et al.
    Linnéuniversitetet, Fakulteten för teknik (FTK), Institutionen för datavetenskap (DV).
    Grenmyr, David
    An Investigation of Data Flow Patterns Impact on Maintainability When Implementing Additional Functionality2016Självständigt arbete på grundnivå (kandidatexamen), 10 poäng / 15 hpStudentuppsats (Examensarbete)
    Abstract [en]

    JavaScript is breaking ground with the wave of new client-side frameworks. However, there are some key differences between some of them. One major distinction is the data flow pattern they applying. As of now, there are two predominant patterns used on client side frameworks, the Two-way data flow pattern and the Unidirectional data flow pattern.

    In this research, an empirical experiment was conducted to test the data flow patterns impact on maintainability. The scope of maintainability of this research is defined by a set of metrics: Amount of lines code, an amount of files and amount of dependencies. By analyzing the results, a conclusion could not be made to prove that the data flow patterns does affect maintainability, using this research method. 

  • 17.
    Marinis Artelaris, Spyridon
    Linnéuniversitetet, Fakulteten för teknik (FTK), Institutionen för datavetenskap (DV).
    Performance evaluation of routing protocols for Wireless Mesh Networks2016Självständigt arbete på grundnivå (kandidatexamen), 10 poäng / 15 hpStudentuppsats (Examensarbete)
    Abstract [en]

    Wireless Mesh Networks provide an organisation or a community with the means to extend or create a network independent of infrastructure. However, the network’s dynamic topology along with the fact that devices in the network might be mobile and move randomly, brings tolight various kind of problems on the network, with the most common being the routing. In this report, the problem of routing is examined in terms of throughput, routing overhead, end-to-end delay and packet delivery ratio on two chosen algorithms, namely the Dynamic MANET On-demand (DYMO) and the Better Approach To Mobile Adhoc Networking (B.A.T.M.A.N.). Furthermore, this thesis examines also a Transmission Control Protocol (TCP) connection and compares it against several TCP congestion control mechanisms, two of which, were implemented, namely TCP-Illinois and TCP-FIT, to address the effects that different TCP congestion mechanisms have on an ad-hoc network, when reliable connections are needed. The results show that DYMO is more stable, performs good overall and has the lowest routing overhead, however in a situation with limited mobility or no mobility (as in high mobility they perform poorly) proactive protocols like B.A.T.M.A.N. are worthy protocols, should the extra penalty of routing overhead in the network traffic is not causing any problems. Furthermore, regarding the TCP results, it was observed that TCP congestion algorithms designed specifically for Wireless networks, do offer better performance and should be considered, when designing an ad-hoc network.

  • 18.
    Massalin, Carina
    Linnéuniversitetet, Fakulteten för teknik (FTK), Institutionen för medieteknik (ME).
    Bildsortering med histogram: Ett verktyg för att stödja fotografer i sitt arbetsflöde vid urval av bilder genom att använda statistisk bildbehandling.2016Självständigt arbete på grundnivå (kandidatexamen), 10 poäng / 15 hpStudentuppsats (Examensarbete)
    Abstract [sv]

    Sedan den digitala kameran kom, har det blivit allt vanligare att fotografer har en stor mängd bilder att gå igenom efter varje fotograferingstillfälle. Även om det finns program som kan hjälpa till att få en överblick och hålla reda på bilder, är det fortfarande en uppgift som tar tid och kan kännas tråkigt. Den här uppsatsen undersöker hur fotografens arbetsflöde ser ut kring bildsortering och urval av bilder, detta för att tillämpa en prototyp som förbättrar processen. Prototypen har utvecklats med hjälp av statistisk bildbehandling, i form av histogram för bildjämförelse och implementerat sortering av bilder efter histogramlikhet, en teknik som kan utveckla en fotografs arbetsflöde och ge dem en helt ny insikt i urvalet av sina bilder.

  • 19.
    Nazli, Bilgic
    et al.
    Linnéuniversitetet, Fakulteten för teknik (FTK), Institutionen för datavetenskap (DV).
    Vulgari, Sofia Kiriaki
    Linnéuniversitetet, Fakulteten för teknik (FTK), Institutionen för datavetenskap (DV).
    Comparison of Two Eye Trackers for the Visualization of Eye Tracking Data in Node-Link Diagrams2016Självständigt arbete på grundnivå (kandidatexamen), 10 poäng / 15 hpStudentuppsats (Examensarbete)
    Abstract [en]

    The usage of eye trackers is becoming more and more popular in the field of information visualization. In this project two eye trackers, The Eye Tribe nd Mirametrix S2, are used to obtain eye tracking data for visualizations. It is planned to use the eye trackers with OnGraX, a network visualization system, where they will provide data for the implementation of visualizations, specifically, heatmaps. OnGraX already uses heatmaps to show regions in a network that have been in the viewport of the user. One aim of this thesis will be the comparison between the two eye trackers, and if the use of eye tracking data gives better results thatn the already existing viewport-based approach. At the same time, we provide the foundation for adaptive visualizations with OnGraX. Our research problem is also of interest for visualization in general, because it will help to improve and develop eye tracking technology in this context. To support the outcome of our implementation, we carried out a user study. As a result, we concluded that one of the two eye trackers appears to have more capabilities than the other, and that using the eye tracking data is a more preferred way of depicting the heatmaps on OnGraX.    

  • 20.
    Rong, Huan
    Linnéuniversitetet, Fakulteten för teknik (FTK), Institutionen för datavetenskap (DV).
    Evaluation of the Android Third-party stores: Specifically on the risks of Androidapplication2016Självständigt arbete på grundnivå (kandidatexamen), 10 poäng / 15 hpStudentuppsats (Examensarbete)
    Abstract [en]

    Android is an open source mobile operating system contributed by Google. In general,

    Google Play is the most secure place to download the mobile applications for

    Android system. [1] Products from this website are surely safe promised by Google

    Company. But there are many other third-party app stores around the world offering

    similar software. One incentive for them is that the security policy on different platforms

    varies a lot, and Android developers are free to distribute apps in any intended

    ways, which leads to a certain risk in the assorted stores such as malware. Therefore,

    it is crucial to know which application store can be trusted from the various app

    stores. [2]

    To support our research, a tool named APK Safety Test is developed to compare

    the APK files from different application stores with the version on Google Play. In

    this study, nine stores around the world are chosen and 20 various applications from

    them are checked in real-time by using the tool.

    From this research, people can learn the different risk how can be detected. Furthermore,

    this paper analyzes the result of risks how to affect the applications.

    Keywords: Android application, Android Stores, APK files, Risk

  • 21.
    Russ, Ricardo
    Linnéuniversitetet, Fakulteten för teknik (FTK), Institutionen för datavetenskap (DV).
    Service Level Achievments - Test Data for Optimal Service Selection2016Självständigt arbete på grundnivå (kandidatexamen), 10 poäng / 15 hpStudentuppsats (Examensarbete)
    Abstract [en]

    This bachelor’s thesis was written in the context of a joint research group, which developed a framework for finding and providing the best-fit web service for a user. The problem of the research group lays in testing their developed framework sufficiently. The framework can either be tested with test data produced by real web services which costs money or by generated test data based on a simulation of web service behavior. The second attempt has been developed within this scientific paper in the form of a test data generator. The generator simulates a web service request by defining internal services, whereas each service has an own internal graph which considers the structure of a service. A service can be atomic or can be compose of other services that are called in a specific manner (sequential, loop, conditional). The generation of the test data is done by randomly going through the services which result in variable response times, since the graph structure changes every time the system has been initialized. The implementation process displayed problems which have not been solved within the time frame. Those problems are displaying interesting challenges for the dynamical generation of random graphs. Those challenges should be targeted in further research.

  • 22.
    Steczko, Jan
    Linnéuniversitetet, Fakulteten för teknik (FTK), Institutionen för datavetenskap (DV).
    Analysis of companies’ experience with cross-platform development compared to native development for mobile devices2016Självständigt arbete på grundnivå (kandidatexamen), 10 poäng / 15 hpStudentuppsats (Examensarbete)
    Abstract [en]

    Today, there are a handful of different platforms for mobile phones. Writing an application natively for each mobile operating system is time consuming and expensive. This situation has created a need for using cross-platform frameworks, that allow programmers to create an application once and run it on all platforms. The problem is that it is not certain whether cross-platform apps can fully replace native ones, or if by using cross-platform tools some desired qualities are lost. Investigating this issue would allow to find out which one of these two application development methods is better, or in which situation it is better to choose one over the other. Such knowledge would allow to decrease development time and costs. Companies that create mobile applications on a daily basis have expertise in this area. Thus, thirteen interviews were done with thirteen distinct businesses in order to research this problem. The results showed that native development produces higher quality applications, but there are some situations where it might be better to use cross-platform frameworks. 

  • 23.
    Sun, Ang
    Linnéuniversitetet, Fakulteten för teknik (FTK), Institutionen för datavetenskap (DV).
    Comparison of Java Persistence Layer Technologies2016Självständigt arbete på grundnivå (kandidatexamen), 10 poäng / 15 hpStudentuppsats (Examensarbete)
    Abstract [en]

    As data and data structures grown more complex in computing, the task of storing and accessing such data efficiently also becomes more complex. Object-oriented programming languages such as Java have popularized the practice of using class-based objects and created the challenge of persisting these complex objects to storage systems such as databases which only store simple scalar values. This paper seeks to explore and compare a selected num-ber of popular persistence solutions for the Java language in their use and per-formance. This is done through researching, implementing and performance testing the chosen candidates. Through these steps we have found that while more abstracted solutions provided easier implementation and usage, these positives come with the disadvantages of generally slower performance. We also discovered that while many persistence frameworks provide features that minimize the amount of code required for implementation, they suffer from performance issues such as the N+1 query issue if not configured or utilized correctly.

  • 24.
    Tasim, Taner
    Linnéuniversitetet, Fakulteten för teknik (FTK), Institutionen för datavetenskap (DV).
    A general framework for scraping newspaper websites2016Självständigt arbete på grundnivå (kandidatexamen), 10 poäng / 15 hpStudentuppsats (Examensarbete)
    Abstract [en]

    Data streaming nowadays is one of the most used approaches used by websites and applications to supply the end user with the latest articles and news. As a lot of news websites and companies are founded every day, such data centers must be flexible and it must be easy to introduce a new website to keep track of. The main goal of this project is to investigate two frameworks where implementing a robot for given website should take some acceptable amount of time. It is really challenging task, first of all it aims optimizing of a framework which means to put less efforts on something and have the same result and one another thing is that it will be used by professors and students at the end so quality and robustness play big role here. In order to overcome this challenge two different types of news websites were investigated and through this process the approximately time to implement a single robot was extracted. Having in mind the time spent to implement a single robot, the new frameworks were implemented with the goal to spend less time to implement a new web robot. The results are two general frameworks for two different types of websites, where implementing a robot does not take so much efforts and time. The implementation time of a new robot was reduced from 18 hours to approximately 4 hours.

  • 25.
    Yasser, Almodhi
    Linnéuniversitetet, Fakulteten för teknik (FTK), Institutionen för datavetenskap (DV).
    Classifying Receipts and Invoices in Visma Mobile Scanner2016Självständigt arbete på grundnivå (kandidatexamen), 20 poäng / 30 hpStudentuppsats (Examensarbete)
    Abstract [en]

    This paper presents a study on classifying receipts and invoices using Machine Learning. Furthermore, Naïve Bayes Algorithm and the advantages of using it will be discussed.  With information gathered from theory and previous research, I will show how to classify images into a receipt or an invoice. Also, it includes pre-processing images using a variety of pre-processing methods and text extraction using Optical Character Recognition (OCR). Moreover, the necessity of pre-processing images to reach a higher accuracy will be discussed. A result shows a comparison between Tesseract OCR engine and FineReader OCR engine. After embracing much knowledge from theory and discussion, the results showed that combining FineReader OCR engine and Machine Learning is increasing the accuracy of the image classification.

1 - 25 av 25
RefereraExporteraLänk till träfflistan
Permanent länk
Referera
Referensformat
  • apa
  • harvard1
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Annat format
Fler format
Språk
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Annat språk
Fler språk
Utmatningsformat
  • html
  • text
  • asciidoc
  • rtf