liu.seSök publikationer i DiVA
Ändra sökning
Avgränsa sökresultatet
1234567 51 - 100 av 429
RefereraExporteraLänk till träfflistan
Permanent länk
Referera
Referensformat
  • apa
  • harvard1
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • oxford
  • 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.
  • 51.
    Bergström, Anton
    et al.
    Linköpings universitet, Institutionen för datavetenskap.
    Dackner, Gustav
    Linköpings universitet, Institutionen för datavetenskap.
    Frank, Erik
    Linköpings universitet, Institutionen för datavetenskap.
    Olsson, Konrad
    Linköpings universitet, Institutionen för datavetenskap.
    Sjövall, Emil
    Linköpings universitet, Institutionen för datavetenskap.
    Sundqvist, Anton
    Linköpings universitet, Institutionen för datavetenskap.
    Wiksten, Elin
    Linköpings universitet, Institutionen för datavetenskap.
    Utveckling av webbapplikationen Folkbolaget: En e-handel med användbarhet i fokus2017Självständigt arbete på grundnivå (kandidatexamen), 12 poäng / 18 hpStudentuppsats (Examensarbete)
    Abstract [sv]

    Mikrobryggerier som brygger folköl kämpar idag med att nå ut med sina produkter till marknaden. Då e-handeln i Sverige växer kraftigt och befinner sig i en positiv trend skulle ett sätt att förbättra tillgängligheten till marknaden för mikrobryggerier vara att distribuera och marknadsföra hantverksfolköl via en webbapplikation. För att framgångsrikt lansera en sådan lösning och attrahera en stabil kundbas krävs att tilltänkta kunder finner den användbar. Denna rapport redogör för utvecklingsprocessen av en användbar webbapplikation ur ett navigerbarhets-, läsbarhets- och responsivitetsperspektiv. Rapporten tar stöd i teori baserad på vetenskaplig forskning om användbarhet i form av: navigerbarhet, läsbarhet och responsivitet. Programmeringsspråken Python och Flask har använts för serversidan. För klientsidan har HTML, CSS och Bootstrap använts. Vidare har JavaScript-biblioteket jQuery använts för kommunikation mellan klient- och serversidan. Efter utvecklingsfasen utvärderades webbapplikationen med hjälp av användartester. Utifrån presenterad teori och genomförda tester dras slutsatsen att webbapplikationen är användbar. Detta uppnås genom att användaren oavsett var på hemsidan den befinner sig kan navigera sig vidare till önskad del av webbapplikationen med maximalt tre klick. Färger, ikoner, textstorlek och typsnitt har valts så att innehållet är läsbart och slutligen har implementationen av CSS och Bootstrap gjort webbapplikationen responsiv.

  • 52.
    Berntsen, Eirik
    et al.
    University of Bergen, Norway.
    Babic, Ankica
    Linköpings universitet, Institutionen för medicinsk teknik. Linköpings universitet, Tekniska högskolan. Univeristy of Bergen, Norway.
    Information System for Postmarket Surveillance of Total Joint Prostheses2015Ingår i: 16th Nordic-Baltic Conference on Biomedical Engineering / [ed] Henrik Mindedal ; Mikael Persson, Springer, 2015, s. 24-27Konferensbidrag (Refereegranskat)
    Abstract [en]

    Storage, integration and presentation of clinical data is an important aspect of any modern medical research. The Biomaterials research group at the Haukeland University Hospital uses both their own locally generated clinical data and external registry data to examine explanted joint implants. As a solution to this challenge, a system prototype was developed that would enable further integration of these information systems into a multi-user environment.

    The system allows importing registry data and matching it with local data, viewing and editing of this information and exporting the integrated data for further statistical analysis. An evaluation consisting of both user testing and heuristic evaluation was carried out and generated constructive feedback.

    The prototype demonstrates the feasibility of combining these data sources in a single database and the future possibility of exposing parts of this information to external users through a web application.

    Future integration of external sources could improve the information management of biobank data for postmarket surveillance of medical devices.

  • 53.
    Berntsen, Eirik
    et al.
    University of Bergen, Norway.
    Babic, Ankica
    Linköpings universitet, Institutionen för medicinsk teknik. Linköpings universitet, Tekniska högskolan. Univeristy of Bergen, Norway.
    Information System for Postmarket Surveillance of Total Joint Prostheses2015Ingår i: 16th Nordic-Baltic Conference on Biomedical Engineering / [ed] Henrik Mindedal ; Mikael Persson, Springer, 2015, s. 24-27Konferensbidrag (Refereegranskat)
    Abstract [en]

    Storage, integration and presentation of clinical data is an important aspect of any modern medical research. The Biomaterials research group at the Haukeland University Hospital uses both their own locally generated clinical data and external registry data to examine explanted joint implants. As a solution to this challenge, a system prototype was developed that would enable further integration of these information systems into a multi-user environment.

    The system allows importing registry data and matching it with local data, viewing and editing of this information and exporting the integrated data for further statistical analysis. An evaluation consisting of both user testing and heuristic evaluation was carried out and generated constructive feedback.

    The prototype demonstrates the feasibility of combining these data sources in a single database and the future possibility of exposing parts of this information to external users through a web application.

    Future integration of external sources could improve the information management of biobank data for postmarket surveillance of medical devices.

  • 54.
    Bertils, Joakim
    Linköpings universitet, Institutionen för datavetenskap, Programvara och system.
    Implementation of Principal Component Analysis For Use in Anomaly Detection Using CUDA2019Självständigt arbete på avancerad nivå (masterexamen), 20 poäng / 30 hpStudentuppsats (Examensarbete)
    Abstract [en]

    As more and more systems are connected, a large benefit is found in being able to find and predict problems in the monitored process. By analyzing the data in real time, feedback can be generated to the operators or the process allowing the process to correct itself. This thesis implements and evaluates three CUDA GPU implementations of the principal component analysis used for dimensionality reduction of multivariate data sets running in real time to explore the trade-offs of the algorithm implementations in terms of speed, energy and accuracy. The GPU implementations are compared to reference implementations on the CPU. The study finds that the covariance based method is the fastest of the implementations for the tested configurations, but the iterative NIPALS implementation has some interesting optimization opportunities that are explored. For large enough data sets, speedup compared to the 8 virtual core CPU of around 100 is obtained for the GPU implementations, making the GPU implementations an option to investigate for problems requiring real time computation of principal components.

  • 55.
    Birksjö, Marcus
    Linköpings universitet, Institutionen för datavetenskap, Programvara och system.
    Event-based diagnostics in heavy-duty vehicles2016Självständigt arbete på avancerad nivå (masterexamen), 20 poäng / 30 hpStudentuppsats (Examensarbete)
    Abstract [en]

    The integration of small computer units in vehicles has made new and more complex functionalitypossible within the vehicle industry. To verify that the functionality is working and to troubleshoot it when a fault is detected requires a set of diagnostic services. Due to the increasing complexity of the functionality the diagnostic services need to extract more data to be able to diagnose the functionality. This causes an increased network load which soon threatens to become too high for some of the current networks. New ways to diagnose functionality in vehicles are therefore needed.

    The aim of this thesis was to investigate the need for an event-based service within the domain of vehicle diagnostics as well as presenting a recommendation of how sucha service should be designed. The thesis also aimed at eliciting obstacles and pitfalls connected with the implementation of the service in the current software architecture in heavy duty vehicles.

    An industrial case study was performed at the Swedish company Scania to elicit the potential need, problems and limitations with an event-based service for vehicle diagnostics. First a set of experts representing different domains within vehicle diagnostics were interviewed to investigate the need and potential of the service for different use cases. Requirements were elicited and compared with the service ResponseOnEvent defined inthe ISO standard 14229-1:2013. A decision was then made to diverge from the standard inorder to increase the number of fulfilled requirements and flexibility of the service. A new proprietary service was therefore created and evaluated through a proof of concept wherea prototype of the service was implemented in one client and one server control unit. A final recommendation was then given suggesting how to implement an event-based service and how to solve the found problems.

    The elicitation of the need for an event-based service resulted a confirmed need in three different domains and 23 different requirements which the service ResponseOnEvent was compared against. The service failed to meet all the requirements and therefore a proprietary service was designed. The prototype implementation of the proprietary service showed on multiple difficulties connected to the realization of an event-based service in the current architecture. One of the biggest was the fact that diagnostic services was assumed to always have a one-to-one relation between request and response, which an event-based service would not have. Different workarounds were discovered and assessed. Another problem was the linking between an event triggered response message and the triggercondition. It was concluded that some restrictions would have to be made to facilitatethe process of linking a response to its trigger condition. Non-determinism was another problem, since there were no guarantees that an event would not trigger too often causinga bus overload. In the final recommendation there are suggestions of how to solve these problems and some suggested areas for further research.

    The thesis confirms the need for a new way to diagnose vehicle functionality due to their increased complexity and the limited bandwidth of some of today’s in-vehicle networks. The event-based service ResponseOnEvent offers a good alternative but might lacksome key functionality. Therefore it might be valuable to consider a proprietary service instead. Due to its nature, an event-based service might require a restructuring of thesystem architecture and limitations in the hardware might limit the usability and flexibilityof the service.

    Keywords: event-based service, Response on Event, ECU, Vehicle Diagnostics, UDS,KWP.

  • 56.
    Bjelkenstedt, Alf
    Linköpings universitet, Institutionen för datavetenskap, Programvara och system. Linköpings universitet, Tekniska högskolan.
    Web-Based Drawing Tool in GWT with Usability Testing and Usability Evaluation2014Självständigt arbete på avancerad nivå (masterexamen), 20 poäng / 30 hpStudentuppsats (Examensarbete)
    Abstract [en]

    On behalf of Inspectera HK AB in Norrköping a web-based drawing tool has been developed in Java, mainlywith the library Google Web Toolkit (GWT). The purpose of this tool is to facilitate both the staff's at Inspecteraand their client's work with different types of drawings such as blueprints for pest control, fire protection andespecially drawings of the company's e-service of self-checks. Besides developing the drawing tool usabilitytesting and a usability evaluation has been performed.

  • 57.
    Björck, Joel
    et al.
    Linköpings universitet, Institutionen för datavetenskap. Linköpings universitet, Tekniska högskolan.
    Ek, Johanna
    Linköpings universitet, Institutionen för datavetenskap. Linköpings universitet, Tekniska högskolan.
    Ekberg, Isac
    Linköpings universitet, Institutionen för datavetenskap. Linköpings universitet, Tekniska högskolan.
    Gunnarsson, Emil
    Linköpings universitet, Institutionen för datavetenskap. Linköpings universitet, Tekniska högskolan.
    Lietha, Mikael
    Linköpings universitet, Institutionen för datavetenskap. Linköpings universitet, Tekniska högskolan.
    Teneberg, Gustaf
    Linköpings universitet, Institutionen för datavetenskap. Linköpings universitet, Tekniska högskolan.
    Wulfcrona, Mikael
    Linköpings universitet, Institutionen för datavetenskap. Linköpings universitet, Tekniska högskolan.
    Öhrn, Rasmus
    Linköpings universitet, Institutionen för datavetenskap. Linköpings universitet, Tekniska högskolan.
    Studentbåge: utvecklandet av en webbapplikation för cykelförsäljning2014Självständigt arbete på grundnivå (kandidatexamen), 10,5 poäng / 16 hpStudentuppsats (Examensarbete)
    Abstract [sv]

    Syftet med följande rapport är att beskriva erfarenheterna med designen och implementationen av en webbapplikation för e-handel. Arbetet genomfördes som en del av ett kandidatarbete, inom civilingenjörsprogrammet Industriell ekonomi vid Linköpings tekniska högskola, av ett team bestående av åtta studenter.

    Utgångspunkten för kandidatarbetet, som beskrivs i den här rapporten, var att teamet blev kontrakterat av en fiktiv kund (kursledningen) att skapa en handelsplats för cyklar. Då projektet bedrevs i utbildningssyfte hade kunden vissa krav på hur webbapplikationen skulle skapas både vad gäller slutgiltig funktionalitet och arbetsmetodik. Projektarbetet omfattade 18 högskolepoäng och sträckte sig över fem månader.

    Ur de specifikationer som kunden gav arbetade teamet fram en vision. Då cykeln är en integrerad del av studentlivet så beslutade teamet att skapa en handelsplats som de själva skulle vilja använda. Med utgångspunkt i teammedlemmarnas erfarenhet om cykelhandel i linköpingsområdet skapades konceptet Studentbåge med följande vision:

    ”Studentbåge; en köp- och säljplats för cyklar på nätet med låga barriärer för både köpare och säljare”

    Teamets erfarenheter som studenter var att cykelköp i stor utsträckning sker på andrahandsmarknaden men att det bland de befintliga tjänsterna saknades en aktör som erbjöd en tjänst som fokuserade på cyklar i närområdet. Teamets vision för en webbapplikation som uppfyllde det behovet inkluderade en rad funktioner för att fylla det uppfattade behovet. Möjligheten för användare att ladda upp cykelannonser var central då den tilltänkta affärsmodellen byggde på att användarna betalar för att lägga upp en annons. Då publicering av annonser och betalning av dessa kräver att användaruppgifter registreras så var även en inloggningsfunktion ett nödvändigt inslag i webbapplikationens design. För att användare skulle kunna hitta cyklar de var intresserade av så var även en sökfunktion del av visionen.

  • 58.
    Björnander, Daniel
    et al.
    Linköpings universitet, Institutionen för datavetenskap.
    Gezelius, Måns
    Linköpings universitet, Institutionen för datavetenskap.
    Gustafsson, Emil
    Linköpings universitet, Institutionen för datavetenskap.
    Leow, Raymond
    Linköpings universitet, Institutionen för datavetenskap.
    Lidstedt, Joakim
    Linköpings universitet, Institutionen för datavetenskap.
    Noring, Ludvig
    Linköpings universitet, Institutionen för datavetenskap.
    Petersson, Nils
    Linköpings universitet, Institutionen för datavetenskap.
    Pålsson, Jonatan
    Linköpings universitet, Institutionen för datavetenskap.
    Ångman, Mikael
    Linköpings universitet, Institutionen för datavetenskap.
    Utveckling inom Augmented Reality med Unity2016Självständigt arbete på grundnivå (kandidatexamen), 10 poäng / 15 hpStudentuppsats (Examensarbete)
    Abstract [sv]

    Syftet med den här rapporten är att behandla frågeställningar utifrån projektet, vars mål är att utveckla ett Augmented Reality-ramverk för att skapa värde för en kund, BioOptico.

    Punkter som programmeringsmiljön Unitys lämplighet vid utveckling av mobila AR-applikationer, hur BioVision kan implementeras så att det ger värde för BioOptico, vilka erfarenheter som kan dokumenteras efter arbetet med projektet och vilket stöd SEMAT Kernel ALPHA ger för det här projektet behandlas i den här rapporten.

    För att besvara dessa frågor används verktygen Unity och SEMAT Kernel ALPHA state cards under utvecklingen av BioVision. Genom agil utveckling och framtagning av tidiga prototyper undersöks vilka implementationssätt som ger värde för BioOptico och vilken dokumentation av erfarenheter som kan vara intressant för framtida projekt.

    Som resultat dokumenteras de områden där Unity lämpar sig väl för utveckling av mobila AR-applikationer, vilka de viktigaste beståndsdelarna var för hur BioVision implementerades så att det ger värde för BioOptico och vilka erfarenheter och vilket stöd som ges av utveckling av BioVision respektive användning av SEMAT Kernel ALPHA:s.

    Som slutsats ses Unity som en lämplig utvecklingsmiljö för utveckling av AR-applikationer, medan SEMAT Kernel ALPHA kan vara användbart, dock överflödigt, vid utveckling av BioVision. De viktigaste lärdomarna att ta med sig från projektet är att planera, utveckla och dokumentera i god tid. Slutligen dras slutsatsen om att strukturen på projektet och inte bara produkten som skapas spelar en stor roll för hur applikationen kan ge värde för BioOptico.

  • 59.
    Blagojevic, Nebojsa
    et al.
    Linköpings universitet, Institutionen för ekonomisk och industriell utveckling. Linköpings universitet, Tekniska högskolan.
    Bohlers, Johanna
    Linköpings universitet, Institutionen för ekonomisk och industriell utveckling. Linköpings universitet, Tekniska högskolan.
    Realisering av affärssytemets nytoeffekter: En studie om påverkansfaktorer under postimplementeringen2012Självständigt arbete på avancerad nivå (masterexamen), 20 poäng / 30 hpStudentuppsats (Examensarbete)
    Abstract [sv]

    Det finns många fördelar att hämta ur ett affärssystem, men både vid den initiala implementeringen och den fortsatta utvecklingen av ett företags affärssystem uppkommer problem. För att realisera fördelar i så stor grad som möjligt krävs det att företag agerar på ett fördelaktigt sätt för att överkomma hindrena. Tidigare forskning har behandlat hur företag bör agera under den initiala implementeringen medan denna rapports syfte är att identifiera viktiga områden som påverkar företags möjligheter att realiserat ytterligare fördelar under det fortsatta utvecklingen av affärssystemet, så kallat postimplementeringen.

    Med hjälp av en litteraturstudie, innefattande affärssystemets livscykel, nyttoeffekter och kritiska områden för realiseringen av nyttoeffekter vid implementering av affärssystem, samt en intervjustudie med totalt elva företag och en implementeringskonsult, där två företag intervjuades djupare, har slutsatser dragits. Resultatet tyder på att det ramverk för kritiska påverkansfaktorer som är presenterade i litteraturen och gäller hela affärssystemets livscykel i stora drag även är tillämpbart på postimplementeringsfasen. Däremot har det identifierats ett par områden, ej specifikt behandlade i litteraturen, som anses har en påverkan på hur väl företag lyckas med att hantera de kritiska dimensionerna: dessa är intressenternas förhandlingskraft och företagets storlek.

    Utifrån denna analys har dimensionerna ledning och organisation benämnts till förutsättare och dimensionerna projekt och system till förenklare, där de förutsättande dimensionerna anses ha större påverkande kraft på realiseringen av nyttoeffekter under postimplementeringen. De förenklande dimensionerna däremot kräver en avvägning mellan resurser och nytta från företagets sida. Denna avvägning är beroende av den företagsspecifika situationen samt företagets förmåga att hantera de förutsättande dimensionerna. 

  • 60.
    Blazevic, Denis Ivan
    et al.
    Linköpings universitet, Institutionen för datavetenskap, Interaktiva och kognitiva system.
    Jansson, Magnus
    Linköpings universitet, Institutionen för datavetenskap, Interaktiva och kognitiva system.
    Improving the flexibility of DPDK Service Cores2019Självständigt arbete på grundnivå (kandidatexamen), 10,5 poäng / 16 hpStudentuppsats (Examensarbete)
    Abstract [en]

    Data Plane Development Kit is a highly used library for creating network applications that can be run on all hardware. Data Plane Development Kit has a component called Service Cores, which allows the main applications to create services that will run independently. These services are manually mapped to specific CPU cores, and are scheduled in a round-robin method. Because of the manual mapping, and the scheduling, the different load for each service can impact the start time for each service. By having services not run when supposed to, the throughput will degrade. In this thesis, we investigate and try to solve the issue by implementing a basic load balancer into the Service Core component. Our results show that an basic load balancer, that will balance upon reaching a CPU upper threshold, will increase the throughput of services while decreasing the delay between each service run.

  • 61.
    Blom, Lillemor
    Linköpings universitet, Institutionen för datavetenskap, Programvara och system.
    Impact of light on augmented reality: Evaluating how different light conditions affect the performance of Microsoft HoloLens 3D applications2018Självständigt arbete på grundnivå (högskoleexamen), 10,5 poäng / 16 hpStudentuppsats (Examensarbete)
    Abstract [en]

    Microsoft HoloLens is a headmounted augmented reality system providing users the ability to experience three-dimensional virtual content. This could be used in applications aimed at industry where users could use augmented reality to easily access information and receive instructions. For this to be suitable for industry, the system must be robust. One property of robustness was chosen for this thesis: system performance in conditions of different levels of light. A prototype implementing a use case for future industry was developed, as well as two additional smaller applications to facilitate experiments. Experiments were performed to investigate how different light levels affects the functionality in a 3D holographic application running on HoloLens and how the visibility of virtual content was affected in conditions with bright and heterogeneous backgrounds. The results showed that the functionality of the holographic application was not significantly affected except in very dark conditions, and that bright and messy backgrounds pose a problem to hologram visibility.

  • 62.
    Blomkvist, Johan
    et al.
    Linköpings universitet, Institutionen för datavetenskap, Interaktiva och kognitiva system. Linköpings universitet, Tekniska fakulteten.
    Clatworthy, Simon
    Linköpings universitet.
    Holmlid, Stefan
    Linköpings universitet, Institutionen för datavetenskap, Interaktiva och kognitiva system. Linköpings universitet, Tekniska fakulteten.
    Ways of seeing the design material of service2016Ingår i: Service Design Geographies. Proceedings of the ServDes.2016 Conference / [ed] Nicola Morelli, Amalia de Götzen, Francesco Grani, Linköping: Linköping University Electronic Press, 2016, Vol. 125, s. 1-13Konferensbidrag (Refereegranskat)
    Abstract [en]

    This paper makes a contribution to the current conceptualisation of service as a design material from three different perspectives. We use definitions of the term material, the connection with service logic and the techniques that service designers use to discuss ways to understand service from a design perspective. Service designers have tools for working with components, things, locations, actions, procedures, interactions and experiences at their disposal. Service designers work with a meta-material for the most part, which is a material representation of the services they are (re-)designing. Unlike fields where the material is worked into a finished form, the material of service design traverses between the concrete and the abstract throughout the design process.

  • 63.
    Blomkvist, Johan
    et al.
    Linköpings universitet, Institutionen för datavetenskap, Interaktiva och kognitiva system. Linköpings universitet, Tekniska fakulteten.
    Fjuk, Annita
    Linköpings universitet.
    Sayapina, Vasilisa
    Linköpings universitet.
    Low threshold service design: desktop walkthrough2016Ingår i: Service design geographies: Proceedings of the ServDes.2016 Conference / [ed] Nicola Morelli, Amalia de Götzen, Francesco Grani, Linköping: Linköping University Electronic Press, 2016, s. 154-166Konferensbidrag (Refereegranskat)
    Abstract [en]

    This paper introduces the first academic characterisation of the desktop walkthrough technique. Desktop walkthrough is considered here as a service design technique using a collaboratively built miniature environment to construct knowledge about a specific service. It is further examined as a technique for rapidly exploring and designing a service concept. The analytical lens of the paper is outlined from socio-cultural theories on human development where any human action is developed from, and emulated by, social interactions and the intellectual and physical artefacts herein. The analysis shows that desktop walkthrough enabled teams to design a holistic service journey with low threshold usage, and provided a means for exploring and designing the complexity of customer journeys and the backstage organizational processes.

  • 64.
    Blomkvist, Johan
    et al.
    Linköpings universitet, Institutionen för datavetenskap, Interaktiva och kognitiva system. Linköpings universitet, Tekniska fakulteten.
    Overkamp, Tim
    Linköpings universitet, Institutionen för datavetenskap, Interaktiva och kognitiva system. Linköpings universitet, Tekniska fakulteten.
    Holmlid, Stefan
    Linköpings universitet, Institutionen för datavetenskap, Interaktiva och kognitiva system. Linköpings universitet, Tekniska fakulteten.
    Research in the first four service design and innovation (ServDes) conferences2016Ingår i: Service design geographies: Proceedings of the ServDes.2016 Conference / [ed] Nicola Morelli, Amalia de Götzen, Francesco Grani, Linköping: Linköping University Electronic Press, 2016, s. 167-179Konferensbidrag (Refereegranskat)
    Abstract [en]

    In this paper we take a closer look at the papers published during the first four Service design and innovation (ServDes) conferences and sources that the authors of those papers have referenced. The analysis uses the academic search engine Scopus and the references found in the conferences’ Proceedings. In total 206 authors have contributed to the 105 research papers presented at ServDes, and 53% of all ServDes papers have been referenced at a later ServDes. ServDes authors are informed by research published mainly after 1999 (79,2%), primarily within the fields of Business, Computer Science and Engineering. We also look at what authors publish their research at ServDes and the percentage of self-referencing (27%) as well as within-conference referencing (2,4% of references) to examine the progression within the field through the research published at ServDes.

  • 65.
    Bock, Alexander
    et al.
    Linköpings universitet, Institutionen för teknik och naturvetenskap, Medie- och Informationsteknik. Linköpings universitet, Tekniska fakulteten.
    Mays, M. Leila
    NASA Goddard Space Flight Center, Greenbelt, MD, USA.
    Rastaetter, Lutz
    NASA Goddard Space Flight Center, Greenbelt, MD, USA.
    Ynnerman, Anders
    Linköpings universitet, Institutionen för teknik och naturvetenskap, Medie- och Informationsteknik. Linköpings universitet, Tekniska fakulteten. Linköpings universitet, Centrum för medicinsk bildvetenskap och visualisering, CMIV.
    Ropinski, Timo
    Linköpings universitet, Institutionen för teknik och naturvetenskap, Medie- och Informationsteknik. Linköpings universitet, Tekniska fakulteten.
    VCMass: A Framework for Verification of Coronal Mass Ejection Ensemble Simulations2014Konferensbidrag (Refereegranskat)
    Abstract [en]

    Supporting the growing field of space weather forecasting, we propose a framework to analyze ensemble simulations of coronal mass ejections. As the current simulation technique requires manual input, uncertainty is introduced into the simulation pipeline which leads to inaccurate predictions. Using our system, the analyst can compare ensemble members against ground truth data (arrival time and geo-effectivity) as well as information derived from satellite imagery. The simulations can be compared on a global basis, based on time-resolved quality measures, and as a 3D volumetric rendering with embedded satellite imagery in a multi-view setup. This flexible framework provides the expert with the tools to increase the knowledge about the, as of yet not fully understood, principles behind the formation of coronal mass ejections.

  • 66.
    Bodirsky, Manuel
    et al.
    Technical University of Dresden, Germany.
    Jonsson, Peter
    Linköpings universitet, Institutionen för datavetenskap, Programvara och system. Linköpings universitet, Tekniska fakulteten.
    A Model-Theoretic View on Qualitative Constraint Reasoning2017Ingår i: The journal of artificial intelligence research, ISSN 1076-9757, E-ISSN 1943-5037, Vol. 58, s. 339-385Artikel i tidskrift (Refereegranskat)
    Abstract [en]

    Qualitative reasoning formalisms are an active research topic in artificial intelligence. In this survey we present a model-theoretic perspective on qualitative constraint reasoning and explain some of the basic concepts and results in an accessible way. In particular, we discuss the significance of omega-categoricity for qualitative reasoning, of primitive positive interpretations for complexity analysis, and of Datalog as a unifying language for describing local consistency algorithms.

  • 67.
    Boeira, Felipe
    et al.
    Linköpings universitet, Institutionen för datavetenskap, Programvara och system. Linköpings universitet, Tekniska fakulteten.
    Asplund, Mikael
    Linköpings universitet, Institutionen för datavetenskap, Programvara och system. Linköpings universitet, Tekniska fakulteten.
    Barcellos, Marinho P.
    Univ Fed Rio Grande do Sul, Brazil.
    Mitigating Position Falsification Attacks in Vehicular Platooning2018Ingår i: 2018 IEEE VEHICULAR NETWORKING CONFERENCE (VNC), IEEE , 2018Konferensbidrag (Refereegranskat)
    Abstract [en]

    As connected vehicles are envisioned to provide novel intelligent transportation systems, cyberattacks and security schemes are becoming an increasing concern. Several studies have shown that algorithms that make use of location information from other vehicles, such as vehicular platoon controllers, are vulnerable to message falsification attacks. Moreover, the ability for an attacking vehicle to appear as several vehicles through a so-called Sybil attack can significantly increase the severity of the attack. In this paper, we investigate how these attacks can be detected using Vouch location proof scheme (by identifying false location messages) and propose several reaction strategies to mitigate them. We also show through simulation that it is possible to prevent collisions by reacting appropriately to the false beacons in time while not reacting to false positives coming from the detector.

  • 68.
    Boeira, Felipe
    et al.
    Linköpings universitet, Institutionen för datavetenskap, Programvara och system. Linköpings universitet, Tekniska fakulteten. Univ Fed Rio Grande do Sul, Brazil; Halmstad Univ, Sweden.
    Barcellos, Marinho P.
    Univ Fed Rio Grande do Sul, Brazil.
    de Freitas, Edison P.
    Univ Fed Rio Grande do Sul, Brazil.
    Vinel, Alexey
    Halmstad Univ, Sweden.
    Asplund, Mikael
    Linköpings universitet, Institutionen för datavetenskap, Programvara och system. Linköpings universitet, Tekniska fakulteten.
    Effects of Colluding Sybil Nodes in Message Falsification Attacks for Vehicular Platooning2017Ingår i: 2017 IEEE VEHICULAR NETWORKING CONFERENCE (VNC), IEEE , 2017, s. 53-60Konferensbidrag (Refereegranskat)
    Abstract [en]

    This paper studies the impact of vulnerabilities associated with the Sybil attack (through falsification of multiple identities) and message falsification in vehicular platooning. Platooning employs Inter-Vehicular Communication (IVC) to control a group of vehicles. It uses broadcast information such as acceleration, position, and velocity to operate a longitudinal control law. Cooperation among vehicles allows platoons to reduce fuel consumption and risks associated with driver mistakes. In spite of these benefits, the use of network communication to control vehicles exposes a relevant attack surface that can be exploited by malicious actors. To carry out this study, we evaluate five scenarios to quantify the potential impact of such attacks, identifying how platoons behave under varying Sybil attack conditions and what are the associated safety risks. This research also presents the use of location hijacking attack. In this attack, innocent vehicles that are not part of a platoon are used as a way to create trust bond between the false identities and the physical vehicles. We demonstrate that the ability to create false identities increases the effectiveness of message falsification attacks by making them easier to deploy and harder to detect in time.

  • 69.
    Boije, Niklas
    et al.
    Linköpings universitet, Institutionen för datavetenskap, Programvara och system.
    Borg, Kristoffer
    Linköpings universitet, Institutionen för datavetenskap, Programvara och system.
    Semi-automatic code-to-code transformer for Java: Transformation of library calls2016Självständigt arbete på avancerad nivå (masterexamen), 300 hpStudentuppsats (Examensarbete)
    Abstract [en]

    Having the ability to perform large automatic software changes in a code base gives new possibilities for software restructuring and cost savings. The possibility of replacing software libraries in a semi-automatic way has been studied. String metrics are used to find equivalents between two libraries by looking at class- and method names. Rules based on the equivalents are then used to describe how to apply the transformation to the code base. Using the abstract syntax tree, locations for replacements are found and transformations are performed. After the transformations have been performed, an evaluation of the saved effort of doing the replacement automatically versus manually is made. It shows that a large part of the cost can be saved. An additional evaluation calculating the maintenance cost saved annually by changing libraries is also performed in order to prove the claim that an exchange can reduce the annual cost for the project.

  • 70.
    Bolin, Mårten
    et al.
    Linköpings universitet, Institutionen för datavetenskap.
    Dietmann, Andreas
    Linköpings universitet, Institutionen för datavetenskap.
    Granat, Elvin
    Linköpings universitet, Institutionen för datavetenskap.
    Jönsson, Emelie
    Linköpings universitet, Institutionen för datavetenskap.
    Modigh, Edvin
    Linköpings universitet, Institutionen för datavetenskap.
    Olausson, Erik
    Linköpings universitet, Institutionen för datavetenskap.
    Pettersson, Ellinor
    Linköpings universitet, Institutionen för datavetenskap.
    Sidén, Erik
    Linköpings universitet, Institutionen för datavetenskap.
    Att utveckla en trovärdig och användbar webbapplikation: Spacefinder - Framtagning av en webbapplikation för uthyrning av förråd och andra förvaringsutrymmen.2017Självständigt arbete på grundnivå (kandidatexamen), 12 poäng / 18 hpStudentuppsats (Examensarbete)
    Abstract [sv]

    Denna rapports syfte är att med stöd i teori och praktisk kunskap utveckla en webbapplikation för att besvara den aktuella frågeställningen, ”Hur kan en e-butik för annonsplatser designas för att den ska anses trovärdig hos besökarna och vara användbar med avseende på navigerbarhet, innehållets relevans och läsbarhet?”. En litteraturstudie genomfördes och teori sammanställdes för att utgöra en grund för utvecklingen. Arbetsgången följde relevanta teorier och webbapplikationen byggdes med moderna tekniska lösningar. Den slutgiltiga produkten tillhandahåller relevanta funktioner och tillämpningar som sedan testades av ett antal externa testare varpå en enkätundersökning fick besvaras. Utifrån denna data kunde sedan slutsatsen dras att webbapplikationen uppfyllde de krav som ställts för att med grund i teori anses vara en användbar, navigerbar och trovärdig webbapplikation. Den ursprungliga frågeställningen kan således besvaras med denna rapports teori, metod och implementation.

  • 71.
    Bordoloi, Unmesh
    et al.
    Linköpings universitet, Institutionen för datavetenskap, ESLAB - Laboratoriet för inbyggda system. Linköpings universitet, Tekniska högskolan.
    Rezine, Ahmed
    Linköpings universitet, Institutionen för datavetenskap, ESLAB - Laboratoriet för inbyggda system. Linköpings universitet, Tekniska högskolan.
    Software Model Checking for GPGPU Programs, Towards a Verification Tool2011Rapport (Övrigt vetenskapligt)
    Abstract [en]

    The tremendous computing power GPUs are capable of makes of them the epicenter of an unprecedented attention for applications other than graphics and gaming. Apart from the highly parallel nature of the programs to be run on GPUs, the sought after gain in computing power is only achieved with low level tuning at threads level and is therefore veryerror prone. In fact the level of intricacy involved when writing such programs is already a problem and will become a major bottleneck in spreading the technology.

    Only very recent and rare works started looking into using formal methods for helping GPU programmers avoiding errors like data races, incorrect synchronizations or assertions violations. These are at their infancy and directly import techniques adapted for other (sequential) systems with simple approximations for concurrency. Besides that, theonly help we are aware of right now takes a concrete input and explores a tiny portion of the possible thread scheduling looking for such errors. This easily misses common errors and makes of GPU programming a nightmare task. There is therefore still a lot of work to do in order to come up with helpful and scalable tools for today's and tomorrow's GPGPU software.

    We state in this paper our intention in building in Linköping a agship verication tool that will take CUDA code and track and report, with minimal assistance from the programmer, errors like data races, incorrect synchronizations or assertions violations. In order to achieve this ambitious and vital goal for the widespread of GPU programming, webuild on our experience using and implementing CUDA and GPU code and on our latest work in the verication of multicore and concurrent programs. In fact, GPU programs like those written in CUDA are suitable for verication as they typically neither manipulate pointer arithmetics nor allowrecursion. This restricts the focus to concurrency and array manipulation, combined with intra and inter procedural analysis. To give a avor of where we start from, we report on our experiments in automatically verifying two synchronization algorithms that appeared in a recent paper proposing effiient barriers for inter-block synchronization. Unlike any other verication approach for GPU programs,we can show that the algorithms neither deadlock nor violate the barrier condition regardless of the number of threads. We also capture bugs in case basic relations are violated between the number of blocks and the number of threads per block.

  • 72.
    Borisenko, Konstantin
    et al.
    St Petersburg Electrotech University of LETI, Russia.
    Rukavitsyn, Andrey
    St Petersburg Electrotech University of LETI, Russia.
    Gurtov, Andrei
    Linköpings universitet, Institutionen för datavetenskap, Databas och informationsteknik. Linköpings universitet, Tekniska fakulteten. ITMO University, Russia.
    Shorov, Andrey
    St Petersburg Electrotech University of LETI, Russia.
    Detecting the Origin of DDoS Attacks in OpenStack Cloud Platform Using Data Mining Techniques2016Ingår i: Internet of Things, Smart Spaces, and Next Generation Networks and Systems, NEW2AN 2016/uSMART 2016, SPRINGER INT PUBLISHING AG , 2016, Vol. 9870, s. 303-315Konferensbidrag (Refereegranskat)
    Abstract [en]

    The paper presents the results of the design and implementation of detection system against DDoS attacks for OpenStack cloud computing platform. Proposed system uses data mining techniques to detect malicious traffic. Formal models of detecting components are described. To train data mining models real legitimate traffic was combined with modelled malicious one. Paper presents results of detecting the origin of DDoS attacks on cloud instances.

  • 73.
    Boudjadar, Abdeldjalil
    et al.
    Computer Science, Aalborg University, Denmark.
    David, Alexandre
    Computer Science, Aalborg University, Denmark.
    Hyun Kim, Jin
    Computer Science, Aalborg University, Denmark.
    Larsen, Kim G.
    Computer Science, Aalborg University, Denmark.
    Mikučionis, Marius
    Computer Science, Aalborg University, Denmark.
    Nyman, Ulrik
    Computer Science, Aalborg University, Denmark.
    Skou, Arne
    Computer Science, Aalborg University, Denmark.
    Statistical and exact schedulability analysis of hierarchical scheduling systems2016Ingår i: Science of Computer Programming, ISSN 0167-6423, E-ISSN 1872-7964, Vol. 127, s. 103-130Artikel i tidskrift (Refereegranskat)
    Abstract [en]

    This paper contains two contributions: 1) A development methodology involving two techniques to enhance the resource utilization and 2) a new generic multi-core resource model for hierarchical scheduling systems.

    As the first contribution, we propose a two-stage development methodology relying on the adjustment of timing attributes in the detailed models during the design stage. We use a lightweight method (statistical model checking) for design exploration, easily assuring high confidence in the correctness of the models. Once a satisfactory design has been found, it can be proved schedulable using the computation costly method (symbolic model checking). In order to analyze a hierarchical scheduling system compositionally, we introduce the notion of a stochastic supplier modeling the supply of resources from each component to its child components in the hierarchy. We specifically investigate two different techniques to widen the set of provably schedulable systems: 1) a new supplier model; 2) restricting the potential task offsets.

    We also provide a way to estimate the minimum resource supply (budget) that a component is required to provide. In contrast to analytical methods, we prove non-schedulable cases via concrete counterexamples. By having richer and more detailed scheduling models this framework, has the potential to prove the schedulability of more systems.

    As the second contribution, we introduce a generic resource model for multi-core hierarchical scheduling systems, and show how it can be instantiated for classical resource models: Periodic Resource Models (PRM) and Explicit Deadline Periodic (EDP) resource models. The generic multi-core resource model is presented in the context of a compositional model-based approach for schedulability analysis of hierarchical scheduling systems.

    The multi-core framework presented in this paper is an extension of the single-core framework used for the analysis in the rest of the paper.

  • 74.
    Boudjadar, Abdeldjalil
    et al.
    Linköpings universitet, Institutionen för datavetenskap, Programvara och system. Linköpings universitet, Tekniska fakulteten.
    Dingel, Juergen
    Queen's University, Canada.
    Madzar, Boris
    Queen's University, Canada.
    Hyun Kim, Jin
    INRIA Rennes, France.
    Compositional Predictability Analysis of Mixed Critical Real Time Systems2016Ingår i: FORMAL TECHNIQUES FOR SAFETY-CRITICAL SYSTEMS, (FTSCS 2015) / [ed] Artho and P.C. Olveczky, Springer, 2016, Vol. 596, s. 69-84Konferensbidrag (Refereegranskat)
    Abstract [en]

    This paper introduces a compositional framework for analyzing the predictability of component-based embedded real-time systems. The framework utilizes automated analysis of tasks and communication architdepicts the structureectures to provide insight on the schedulability and data flow. The communicating tasks are gathered within components, making the system architecture hierarchical. The system model is given by a set of Parameterized Stopwatch Automata modeling the behavior and dependency of tasks, while we use Uppaal to analyze the predictability. Thanks to the Uppaal language, our model-based framework allows expressive modeling of the behavior. Moreover, our reconfigurable framework is customizable and scalable due to the compositional analysis. The analysis time and cost benefits of our framework are discussed through an avionic case study.

  • 75.
    Boudjadar, Jalil
    et al.
    Linköpings universitet, Institutionen för datavetenskap, Programvara och system. Linköpings universitet, Tekniska fakulteten.
    Hyun Kin, Jin
    University of Pennsylvania, USA.
    Nadjm-Tehrani, Simin
    Linköpings universitet, Institutionen för datavetenskap, Programvara och system. Linköpings universitet, Tekniska fakulteten.
    Performance-aware Scheduling of Multicore Time-critical Systems2016Ingår i: / [ed] IEEE, IEEE, 2016, s. 105-114Konferensbidrag (Refereegranskat)
    Abstract [en]

    Despite attractiveness of multicore processors for embedded systems, the potential performance gains need to be studied in the context of real-time task scheduling and memory interference. This paper explores performance-aware schedula-bility of multicore systems by evaluating the performance when changing scheduling policies (as design parameters). The modelbased framework we build enables analyzing the performance of multicore time-critical systems using processor-centric and memory-centric scheduling policies. The system architecture we consider consists of a set of cores with a local cache and sharing the cache level L2 and main memory (DRAM). The metrics we use to compare the performance achieved by different configurations of a system are: 1) utilization of the cores; and 2) the maximum delay per access request to shared cache and DRAM. Our framework, realized using UPPAAL, can be viewed as an engineering tool to be used during design stages to identify the scheduling policies that provide better performance for a given system while maintaining system schedulability. As a proof of concept, we analyze and compare 2 different cases studies.

  • 76.
    Bragazzi Ihrén, Maximilian
    et al.
    Linköpings universitet, Institutionen för datavetenskap, Programvara och system.
    Ingbrant Björs, Henrik
    Linköpings universitet, Institutionen för datavetenskap, Programvara och system.
    Visualizing atmospheric data on a mobile platform2017Självständigt arbete på grundnivå (kandidatexamen), 10,5 poäng / 16 hpStudentuppsats (Examensarbete)
    Abstract [en]

    Weather data is important for almost everyone today. Thedaily weather report, home thermometers, and a lot of otherthings affect our every day life. In order to develop betterand more efficient equipment, tools and algorithms, thepeople working with this data need to be able to access it inan easily accessible and easy to read format. In thisresearch, methods of visualizing data on mobile platformsare evaluated based on what researchers in the field wants,since their respective fields might want to use very specificvisualizations. The implementability of these visualizationsare then evaluated, based on the implementations madethroughout this paper. The results show that the researchersknow what they want, and that what they want isimplementable on mobile platforms given some limitationscaused by performance.

  • 77.
    Braun, Robert
    et al.
    Linköpings universitet, Institutionen för ekonomisk och industriell utveckling, Fluida och mekatroniska system. Linköpings universitet, Tekniska högskolan.
    Krus, Petter
    Linköpings universitet, Institutionen för ekonomisk och industriell utveckling, Fluida och mekatroniska system. Linköpings universitet, Tekniska högskolan.
    An Explicit Method for Decoupled Distributed Solvers in an Equation-Based Modelling Language2014Ingår i: Proceedings of the 6th International Workshop on Equation-Based Object-Oriented Modeling Languages and Tools / [ed] David Broman & Peter Pepper, New York: Association for Computing Machinery (ACM), 2014, s. 57-64Konferensbidrag (Refereegranskat)
    Abstract [en]

    The Modelica language offers an intuitive way to create object-oriented models. This makes it natural also to use an object-oriented solver, where each sub-model solves its own equations. Doing so is possible only if sub-models can be made independent from the rest of the model. One way to achieve this is to use distributed solvers by separating sub-models with transmission line elements. This offers robust and predictable simulations, simplified model debugging and natural parallelism. It also makes it possible to use different time steps and solver algorithms in different parts of the model to achieve an optimal trade-off between performance and accuracy. The suggested method has been implemented in the Hopsan simulation environment. Different modelling techniques for taking advantage of the distributed solver approach are explained. Finally, three example models are used to demonstrate the method.

  • 78.
    Buffoni, Lena
    et al.
    Linköpings universitet, Institutionen för datavetenskap, Programvara och system. Linköpings universitet, Tekniska fakulteten.
    Pop, AdrianLinköpings universitet, Institutionen för datavetenskap, Programvara och system. Linköpings universitet, Tekniska fakulteten.Thiele, BernhardLinköpings universitet, Institutionen för datavetenskap, Programvara och system. Linköpings universitet, Tekniska fakulteten.
    Proceedings of the 56th Conference on Simulation and Modelling (SIMS 56): October, 7-9, 2015, Linköping University, Sweden2015Proceedings (redaktörskap) (Refereegranskat)
    Abstract [en]

    Welcome

    The 56th Conference on Simulation and Modelling will be held in Linköping, Sweden. Linköping is one of Sweden’s fastest growing cities. The population is constantly increasing and will soon surpass 150 000 inhabitants. It is currently Sweden’s fifth largest city and a part of the expansive region Twin Cities of Sweden. Linköping has long been characterized by world-class high technology in the fields of aviation, IT and the environment. There is a strong force of innovation especially in Mjärdevi Science Park—one of Europe’s leading technology parks, and at the highly ranked university, which stands for excellence and entrepreneurship.

    SIMS is the Scandinavian Simulation Society with members from the five Nordic countries Denmark, Finland, Norway, Sweden and Iceland. The SIMS history goes back to 1959. The goal of SIMS is to further the science and practice of modeling and simulation in all application areas and be a Scandinavian forum for information interchange among modeling and simulation professionals and non-professionals in Denmark, Finland, Norway and Sweden as well as a channel for information exchange between the Scandinavian modeling and simulation community and the international modeling and simulation communities.

    The ambition of the SIMS is to bring the field of modeling and simulation technology to a variety of application fields from energy extraction to building and automotive industries, resulting in more sustainable and ecological systems and reducing energy consumption and waste production. The scientific program includes technical sessions with submitted and invited papers and will cover broad aspects of simulation, modeling and optimization.

    The focus of the conference is split evenly between papers on simulation and optimization in a variety of applied contexts spanning domains such as oil extraction, automotive and building industries and more methodological papers on tools and technologies for simulation and modeling.

    This year we wanted to emphasize the importance of reducing the gap between state of the art methodologies and tools and industrial applications. To this end a number of invited talks, papers and tutorials were centered on tools and methodologies for successful modeling in an industrial context.

    The format of the conference is somewhat changed compared to previous years. This year we have dedicated a half-day before the traditional two-day conference to tutorials, with 3 tutorials presenting stateof- the-art simulation tools.

    Conference highlights:

    • 4 Keynote speeches
    • 40 papers in 2 parallel tracks
    • 3 tutorials
    • Electronic proceedings including all papers and some associated Modelica libraries and models

    Finally, we want to acknowledge the support we received from the conference board and program committee as well as from the SIMS board. Special thanks to our colleagues at this year’s organizers at Linköping University, especially to Åsa Kärrman, and Tina Malmström from Grand Travel Group. The support from the conference sponsors is gratefully acknowledged. Last but not least, thanks to all authors, keynote speakers, and presenters for their contributions to this conference. We wish all participants an enjoyable and inspiring conference.

    Linköping, September 1, 2015

    Lena Buffoni, Adrian Pop and Bernhard Thiele

  • 79.
    Buhaiu, Andrei
    Linköpings universitet, Institutionen för datavetenskap, Programvara och system. Linköpings universitet, Tekniska högskolan.
    Radio Frequency Remote Control Unit with Gyro and Accelerometer2013Självständigt arbete på avancerad nivå (masterexamen), 20 poäng / 30 hpStudentuppsats (Examensarbete)
    Abstract [en]

    Today digital TV receivers (Set-Top-Boxes) are mainly controlled by IR-based remote control units (RCUs). With new services emerging in thereceivers where better browsing and pointing abilities are desirable (VODservices, Web services, games etc), one solution is a new type of RF remotecontrol. An RF RCU has a number of advantages, e.g. when in range, ithas 100% reliable transmission, it is not sensitive to direction, and it doesnot require a free way to the receiver (i.e. it allows the receiver to be hiddenbehind the TV-set or in a cabinet).

  • 80.
    Bylin, Henrik
    Linköpings universitet, Institutionen för datavetenskap, Interaktiva och kognitiva system. Linköpings universitet, Tekniska högskolan.
    Migration process evaluation and design2013Självständigt arbete på avancerad nivå (masterexamen), 20 poäng / 30 hpStudentuppsats (Examensarbete)
    Abstract [en]

    Many organizations find themselves at one time in a situation where oneof their IT systems has to be replaced with another system. The new system has to get access to the legacy data in order to function. This thesis examines a migration case where the company Medius has made a new version of their product Mediusflow that has a completely new data model. The problem is then how to migrate data from the old to thenew version. The thesis first examines different data migration processes to find one suitable for the specific case. Then a prototype migration solution is developed using the chosen process to show that the migration can be done. In the end conclusions are drawn from the experiences gained during the thesis to what key factors are important for successful data migrations.

  • 81.
    Bångerius, Sebastian
    et al.
    Linköpings universitet, Institutionen för datavetenskap.
    Fröberg, Felix
    Linköpings universitet, Institutionen för datavetenskap.
    Functional testing of an Android application2016Självständigt arbete på grundnivå (kandidatexamen), 10,5 poäng / 16 hpStudentuppsats (Examensarbete)
    Abstract [en]

    Testing is an important step in the software development process in order to increase the reliability of the software. There are a number of different methods available to test software that use different approaches to find errors, all with different requirements and possible results. In this thesis we have performed a series of tests on our own mobile application developed for the Android platform. The thesis starts with a theory section in which most of the important terms for software testing are described. Afterwards our own application and test cases are presented. The results of our tests along with our experiences are reviewed and compared to existing studies and literature in the field of testing. The test cases have helped us find a number of faults in our source code that we had not found before. We have discovered that automated testing for Android is a field where there are a lot of good tools, although these are not often used in practice. We believe the app development process could be improved greatly by regularly putting the software through automated testing systems.

  • 82.
    Cao, Son Thanh
    et al.
    Vinh University, Nghe An, Vietnam .
    Nguyen, Linh Anh
    University of Warsaw, Poland; VNU University of Engineering and Technology, Hanoi, Vietnam.
    Szalas, Andrzej
    Linköpings universitet, Institutionen för datavetenskap, Artificiell intelligens och integrerade datorsystem. Linköpings universitet, Tekniska högskolan. University of Warsaw, Poland.
    WORL: a nonmonotonic rule language for the semantic web2014Ingår i: Vietnam Journal of Computer Science, ISSN 2196-8888, Vol. 1, nr 1, s. 57-69Artikel i tidskrift (Refereegranskat)
    Abstract [en]

    We develop a new Web ontology rule language, called WORL, which combines a variant of OWL 2 RL with eDatalog ¬ . We allow additional features like negation, the minimal number restriction and unary external checkable predicates to occur at the left-hand side of concept inclusion axioms. Some restrictions are adopted to guarantee a translation into eDatalog ¬ . We also develop the well-founded semantics and the stable model semantics for WORL as well as the standard semantics for stratified WORL (SWORL) via translation into eDatalog ¬ . Both WORL with respect to the well-founded semantics and SWORL with respect to the standard semantics have PTime data complexity. In contrast to the existing combined formalisms, in WORL and SWORL negation in concept inclusion axioms is interpreted using nonmonotonic semantics.

  • 83.
    Carlsson, Niklas
    et al.
    Linköpings universitet, Institutionen för datavetenskap, Databas och informationsteknik. Linköpings universitet, Tekniska fakulteten.
    Eager, Derek
    University of Saskatchewan, Canada.
    Ephemeral Content Popularity at the Edge and Implications for On-Demand Caching2017Ingår i: IEEE Transactions on Parallel and Distributed Systems, ISSN 1045-9219, E-ISSN 1558-2183, Vol. 28, nr 6, s. 1621-1634Artikel i tidskrift (Refereegranskat)
    Abstract [en]

    The ephemeral content popularity seen with many content delivery applications can make indiscriminate on-demand caching in edge networks highly inefficient, since many of the content items that are added to the cache will not be requested again from that network. In this paper, we address the problem of designing and evaluating more selective edge-network caching policies. The need for such policies is demonstrated through an analysis of a dataset recording YouTube video requests from users on an edge network over a 20-month period. We then develop a novel workload modelling approach for such applications and apply it to study the performance of alternative edge caching policies, including indiscriminate caching and cache on kth request for different k. The latter policies are found able to greatly reduce the fraction of the requested items that are inserted into the cache, at the cost of only modest increases in cache miss rate. Finally, we quantify and explore the potential room for improvement from use of other possible predictors of further requests. We find that although room for substantial improvement exists when comparing performance to that of a perfect "oracle" policy, such improvements are unlikely to be achievable in practice.

  • 84.
    Cederbom, Martin
    Linköpings universitet, Institutionen för datavetenskap. Linköpings universitet, Tekniska fakulteten.
    Improving software configuration management across multiple Microsoft Dynamics AX 2009 applications2015Självständigt arbete på avancerad nivå (masterexamen), 20 poäng / 30 hpStudentuppsats (Examensarbete)
    Abstract [en]

    When working with software development in Microsoft Dynamics AX 2009 applications as an independent solution vendor (ISV) with more than a few products in the portfolio, the number of applications/installations to support the processes tends to be vast. Annata and To-Increase are both ISVs and face this situation; To-Increase for example has about 50 environments for one single version of Dynamics AX. Change is inevitable in the software industry, regardless if the need originates from new features, bug fixes or change requests from customers; it requires modifications to existing products. Uncontrolled changes to the products must be avoided and any modifications should be introduced without affecting existing functionality. This thesis investigates how two ISVs work with Dynamics AX and the existing tool Development Center and suggests improvements to the Software Configuration Management. The most beneficial change suggested is to create a single repository within the existing tool across the applications.

  • 85.
    Chandhar, Prabhu
    et al.
    Chandhar Res Labs, India.
    Larsson, Erik G
    Linköpings universitet, Institutionen för systemteknik, Kommunikationssystem. Linköpings universitet, Tekniska fakulteten.
    Massive MIMO for Connectivity With Drones: Case Studies and Future Directions2019Ingår i: IEEE Access, E-ISSN 2169-3536, Vol. 7, s. 94676-94691Artikel i tidskrift (Refereegranskat)
    Abstract [en]

    Unmanned aerial vehicles (UAVs), also known as drones, are proliferating. Applications, such as surveillance, disaster management, and drone racing, place high requirements on the communication with the drones in terms of throughput, reliability, and latency. The existing wireless technologies, notably Wi-Fi, that are currently used for drone connectivity are limited to short ranges and low-mobility situations. New, scalable technology is needed to meet future demands on long connectivity ranges, support for fast-moving drones, and the possibility to simultaneously communicate with entire swarms of drones. Massive multiple-input and multiple-output (MIMO), the main technology component of emerging 5G standards, has the potential to meet these requirements.

  • 86.
    Chandhar, Prabhu
    et al.
    Linköpings universitet, Institutionen för systemteknik, Kommunikationssystem. Linköpings universitet, Tekniska fakulteten.
    Sekhar Das, Suvra
    Indian Institute Technology, India.
    Multi-Objective Framework for Dynamic Optimization of OFDMA Cellular Systems2016Ingår i: IEEE Access, E-ISSN 2169-3536, Vol. 4, s. 1889-1914Artikel i tidskrift (Refereegranskat)
    Abstract [en]

    Green cellular networking has become an important research area in recent years due to environmental and economical concerns. Switching OFF underutilized base stations (BSs) during oFF-peak traffic load conditions is a promising approach to reduce energy consumption in cellular networks. In practice, during initial cell planning, the BS locations and radio access network (RAN) parameters (BS transmit power, antenna height, and antenna tilt) are optimized to meet the basic system design requirements, such as coverage, capacity, overlap, quality of service (QoS), and so on. As these metrics are tightly coupled with each other due to co-channel interference, switching OFF certain BSs may affect the system requirements. Therefore, identifying a subset of large number of BSs, which are to be put into the sleep mode, is a challenging dynamic optimization problem. In this paper, we develop a multi-objective framework for dynamic optimization framework for orthogonal frequency division multiple access-based cellular systems. The objective is to identify the appropriate set of active sectors and RAN parameters that maximize coverage and area spectral efficiency, while minimizing overlap and area power consumption without violating the QoS requirements for a given traffic demand density. The objective functions and constraints are obtained using appropriate analytical models, which capture the traffic characteristics, propagation characteristics (path-loss, shadowing, and small-scale fading), as well as load condition in neighboring cells. A low-complexity evolutionary algorithm is used for identifying the global Pareto optimal solutions at a faster convergence rate. The inter-relationships between the system objectives are studied, and the guidelines are provided to find an appropriate network configuration that provides the best achievable tradeoffs. The results show that using the proposed framework, significant amount of energy saving can be achieved and with a low computational complexity while maintaining good tradeoffs among the other objectives.

  • 87.
    Chattopadhyay, Sudipta
    et al.
    Singapore Univ Technol and Design, Singapore.
    Beck, Moritz
    Saarland Univ, Germany.
    Rezine, Ahmed
    Linköpings universitet, Institutionen för datavetenskap, Programvara och system. Linköpings universitet, Tekniska fakulteten.
    Zeller, Andreas
    Saarland Univ, Germany.
    Quantifying the Information Leakage in Cache Attacks via Symbolic Execution2019Ingår i: ACM Transactions on Embedded Computing Systems, ISSN 1539-9087, E-ISSN 1558-3465, Vol. 18, nr 1, artikel-id 7Artikel i tidskrift (Refereegranskat)
    Abstract [en]

    Cache attacks allow attackers to infer the properties of a secret execution by observing cache hits and misses. But how much information can actually leak through such attacks? For a given program, a cache model, and an input, our CHALICE framework leverages symbolic execution to compute the amount of information that can possibly leak through cache attacks. At the core of CHALICE is a novel approach to quantify information leakage that can highlight critical cache side-channel leakage on arbitrary binary code. In our evaluation on real-world programs from OpenSSL and Linux GDK libraries, CHALICE effectively quantifies information leakage: For an AES-128 implementation on Linux, for instance, CHALICE finds that a cache attack can leak as much as 127 out of 128 bits of the encryption key.

  • 88.
    Chen, Bolin
    et al.
    Univ Sheffield, England.
    Pappas, Nikolaos
    Linköpings universitet, Institutionen för teknik och naturvetenskap, Kommunikations- och transportsystem. Linköpings universitet, Tekniska fakulteten.
    Chen, Zheng
    Linköpings universitet, Institutionen för systemteknik, Kommunikationssystem. Linköpings universitet, Tekniska fakulteten.
    Yuan, Di
    Linköpings universitet, Institutionen för teknik och naturvetenskap, Kommunikations- och transportsystem. Linköpings universitet, Tekniska fakulteten.
    Zhang, Jie
    Univ Sheffield, England.
    Throughput and Delay Analysis of LWA With Bursty Traffic and Randomized Flow Splitting2019Ingår i: IEEE Access, E-ISSN 2169-3536, Vol. 7, s. 24667-24678Artikel i tidskrift (Refereegranskat)
    Abstract [en]

    We investigate the effect of bursty traffic in a long term evolution (LTE) and Wi-Fi aggregation (LWA)-enabled network. The LTE base station routes packets of the same IP flow through the LIE and Wi-Fi links independently. We motivate the use of superposition coding at the LWA-mode Wi-Fi access point (AP) so that it can serve LWA users and Wi-Fi users simultaneously. A random access protocol is applied in such system, which allows the native-mode AP to access the channel with probabilities that depend on the queue size of the LWA-mode AP to avoid impeding the performance of the LWA-enabled network. We analyze the throughput of the native Wi-Fi network and the delay experienced by the LWA users, accounting for the native-mode AP access probability, the traffic flow splitting between LTE and Wi-Fi, and the operating mode of the LWA user with both LIE and Wi-Fi interfaces. Our results show some fundamental tradeoffs in the throughput and delay behavior of LWA-enabled networks, which provide meaningful insight into the operation of such aggregated systems.

  • 89.
    Cheng, Sijin
    Linköpings universitet, Institutionen för datavetenskap, Interaktiva och kognitiva system.
    Relevance feedback-based optimization of search queries for Patents2019Självständigt arbete på avancerad nivå (masterexamen), 40 poäng / 60 hpStudentuppsats (Examensarbete)
    Abstract [en]

    In this project, we design a search query optimization system based on the user’s relevance feedback by generating customized query strings for existing patent alerts. Firstly, the Rocchio algorithm is used to generate a search string by analyzing the characteristics of related patents and unrelated patents. Then the collaborative filtering recommendation algorithm is used to rank the query results, which considering the previous relevance feedback and patent features, instead of only considering the similarity between query and patents as the traditional method.

    In order to further explore the performance of the optimization system, we design and conduct a series of evaluation experiments regarding TF-IDF as a baseline method. Experiments show that, with the use of generated search strings, the proportion of unrelated patents in search results is significantly reduced over time. In 4 months, the precision of the retrieved results is optimized from 53.5% to 72%. What’s more, the rank performance of the method we proposed is better than the baseline method. In terms of precision, top10 of recommendation algorithm is about 5 percentage points higher than the baseline method, and top20 is about 7.5% higher. It can be concluded that the approach we proposed can effectively optimize patent search results by learning relevance feedback.

  • 90.
    Cottin, Victor
    Linköpings universitet, Institutionen för datavetenskap. Linköpings universitet, Tekniska högskolan.
    Utveckling av en iPhone-app med back-end i .NET2011Självständigt arbete på grundnivå (kandidatexamen), 10,5 poäng / 16 hpStudentuppsats (Examensarbete)
    Abstract [sv]

    Under sommaren 2011 utvecklade jag en iPhone applikation för tidrapportering åt Cygate AB. Denna rapport beskriver min arbetsprocess samt diskuterar och motiverar de tekniska lösningar som valts.

  • 91.
    Coulombel, Sylvain
    Linköpings universitet, Institutionen för datavetenskap. Linköpings universitet, Tekniska högskolan. Compiègne University Of Technology (UTC).
    Exploration of NoSQL technologies for managing hotel reservations2014Självständigt arbete på avancerad nivå (magisterexamen), 20 poäng / 30 hpStudentuppsats (Examensarbete)
    Abstract [en]

    During this project NoSQL technologies for Hotel IT have been evaluated. It has been determined that among NoSQL technologies, document database fits the best this use-case.

    Couchbase and MongoDB, the two main documents stores have been evaluated, their similarities and differences have been highlighted. This reveals that document-oriented features were more developed in MongoDB than Couchbase, this has a direct impact on search of reservations functionality. However Couchbase offers a better way to replicate data across two remote data centers. As one of the goals was to provide a powerful search functionality, it has been decided to use MongoDB as a database for this project.

    A proof of concept has been developed, it enables to search reservations by property code, guest name, check-in date and check-out date using a REST/JSON interface and confirms that MongoDB could work for storing hotel reservations in terms of functionality.

    Then different experiments have been conducted on this system such as throughput and response time using specific hotel reservation search query and data set. The results we got reached our targets. We also performed a scalability test, using MongoDB sharding functionalities to distribute data across several machines (shards) using different strategies (shard keys) so as to provide configuration recommendations. Our main finding was that it was not necessary to always distribute the database. Then if "sharding" is needed, distributing the data according to the property code will make the database go faster, because queries will be sent directly to the good machine(s) in the cluster and thus avoid "scatter-gather" query.

    Finally some search optimizations have been proposed, and in particular how an advanced search by names could be implemented with MongoDB. 

  • 92.
    Cuello, Rosandra
    Linköpings universitet, Institutionen för datavetenskap. Linköpings universitet, Tekniska högskolan.
    Providing Support for the Movidius Myriad1 Platform in the SkePU Skeleton Programming Framework2014Självständigt arbete på avancerad nivå (masterexamen), 20 poäng / 30 hpStudentuppsats (Examensarbete)
    Abstract [en]

    The Movidius Myriad1 Platform is a multicore embedded platform primed to offer high performance and power efficiency for computer vision applications in mobile devices. The challenges of programming multicore environments are well known and skeleton programming offers a high-level programming alternative for parallel computing, intended to hide the complexities of the system from the programmer. The SkePU Skeleton Programming Framework includes backend implementations for CPU and GPU systems and it has the capacity to support more platforms by extending its backend implementations. With this master thesis project we aim to extend the SkePU Skeleton Programming Framework to provide support for execution in the Movidius Myriad1 embedded platform. Our SkePU backend for Myriad1 consists on a set of macros and functions to compose the different elements of a Myriad1 application, data communication structures to exchange data between the host systems and Myriad1, and a helper script and auxiliary files to generate a Myriad1 application.Evaluation and testing demonstrate that our backend is usable, however further optimizations are needed to obtain good performance that would make it practical to use in real life applications, particularly when it comes to data communication. As part of this project, we have outlined some improvements that could be applied to obtain better performance overall in the future, addressing the issues found with the methods of data communication.

  • 93.
    Dahlberg, Tobias
    Linköpings universitet, Institutionen för datavetenskap, Databas och informationsteknik. Linköpings universitet, Tekniska högskolan.
    Distributed Storage and Processing of Image Data2012Självständigt arbete på avancerad nivå (masterexamen), 20 poäng / 30 hpStudentuppsats (Examensarbete)
    Abstract [en]

    Systems operating in a medical environment need to maintain high standards regarding availability and performance. Large amounts of images are stored and studied to determine what is wrong with a patient. This puts hard requirements on the storage of the images. In this thesis, ways of incorporating distributed storage into a medical system are explored. Products, inspired by the success of Google, Amazon and others, are experimented with and compared to the current storage solutions. Several “non-relational databases” (NoSQL) are investigated for storing medically relevant metadata of images, while a set of distributed file systems are considered for storing the actual images. Distributed processing of the stored data is investigated by using Hadoop MapReduce to generate a useful model of the images' metadata.

  • 94.
    Danelljan, Martin
    et al.
    Linköpings universitet, Institutionen för systemteknik, Datorseende. Linköpings universitet, Tekniska högskolan.
    Häger, Gustav
    Linköpings universitet, Institutionen för systemteknik, Datorseende. Linköpings universitet, Tekniska högskolan.
    Khan, Fahad
    Linköpings universitet, Institutionen för systemteknik, Datorseende. Linköpings universitet, Tekniska högskolan.
    Felsberg, Michael
    Linköpings universitet, Institutionen för systemteknik, Datorseende. Linköpings universitet, Tekniska högskolan.
    Accurate Scale Estimation for Robust Visual Tracking2014Ingår i: Proceedings of the British Machine Vision Conference 2014 / [ed] Michel Valstar, Andrew French and Tony Pridmore, BMVA Press , 2014Konferensbidrag (Refereegranskat)
    Abstract [en]

    Robust scale estimation is a challenging problem in visual object tracking. Most existing methods fail to handle large scale variations in complex image sequences. This paper presents a novel approach for robust scale estimation in a tracking-by-detection framework. The proposed approach works by learning discriminative correlation filters based on a scale pyramid representation. We learn separate filters for translation and scale estimation, and show that this improves the performance compared to an exhaustive scale search. Our scale estimation approach is generic as it can be incorporated into any tracking method with no inherent scale estimation.

    Experiments are performed on 28 benchmark sequences with significant scale variations. Our results show that the proposed approach significantly improves the performance by 18.8 % in median distance precision compared to our baseline. Finally, we provide both quantitative and qualitative comparison of our approach with state-of-the-art trackers in literature. The proposed method is shown to outperform the best existing tracker by 16.6 % in median distance precision, while operating at real-time.

  • 95.
    DASH, ASSMITRA
    Linköpings universitet, Institutionen för datavetenskap, Programvara och system. Linköpings universitet, Tekniska högskolan.
    Minimizing Test Time through Test FlowOptimization in 3D-SICs2013Självständigt arbete på avancerad nivå (masterexamen), 20 poäng / 30 hpStudentuppsats (Examensarbete)
    Abstract [en]

    3D stacked ICs (3D-SICs) with multiple dies interconnected by through-silicon-vias(TSVs) are considered as a technology driver and proven to have overwhelming advantagesover traditional ICs with a single die in a package in terms of performance, powerconsumption and silicon overhead. However, these “super chips” bring new challengesto the process of IC manufacturing; among which, testing 3D-SICs is the major andmost complex issue to deal with. In traditional ICs, tests can usually be performedat two stages (test instances), namely: a wafer sort and a package test. Whereas for3D-SICs, tests can be performed after each stacking event where a new die is stackedover a partial stack. This expands the set of available test instances. A combination ofselected test instances where a test is performed (active test instance) is known as a testflow. Test time is a major contributor to the total test cost. Test time changes with theselected test flow. Therefore, choosing a cost effective test flow which will minimizesthe test time is absolutely essential.This thesis focuses on finding an optimal test flow which minimizes the test timefor a given 3D-SIC. A mathematical model has been developed to evaluate the test timeof any test flow. Then a heuristic has been proposed for finding a near optimal test flowwhich minimizes the test time. The performance of this approach in terms of computationtime and efficiency has been compared against the minimum test time obtainedby exhaustive search. The heuristic gives good results compared to exhaustive searchwith much lesser computation time.

  • 96.
    Dastgeer, Usman
    Linköpings universitet, Institutionen för datavetenskap, Programvara och system. Linköpings universitet, Tekniska högskolan.
    Performance-aware Component Composition for GPU-based systems2014Doktorsavhandling, monografi (Övrigt vetenskapligt)
    Abstract [en]

    This thesis addresses issues associated with efficiently programming modern heterogeneous GPU-based systems, containing multicore CPUs and one or more programmable Graphics Processing Units (GPUs). We use ideas from component-based programming to address programming, performance and portability issues of these heterogeneous systems. Specifically, we present three approaches that all use the idea of having multiple implementations for each computation; performance is achieved/retained either a) by selecting a suitable implementation for each computation on a given platform or b) by dividing the computation work across different implementations running on CPU and GPU devices in parallel.

    In the first approach, we work on a skeleton programming library (SkePU) that provides high-level abstraction while making intelligent  implementation selection decisions underneath either before or during the actual program execution. In the second approach, we develop a composition tool that parses extra information (metadata) from XML files, makes certain decisions online, and, in the end, generates code for making the final decisions at runtime. The third approach is a framework that uses source-code annotations and program analysis to generate code for the runtime library to make the selection decision at runtime. With a generic performance modeling API alongside program analysis capabilities, it supports online tuning as well as complex program transformations.

    These approaches differ in terms of genericity, intrusiveness, capabilities and knowledge about the program source-code; however, they all demonstrate usefulness of component programming techniques for programming GPU-based systems. With experimental evaluation, we demonstrate how all three approaches, although different in their own way, provide good performance on different GPU-based systems for a variety of applications.

  • 97.
    Dastgeer, Usman
    et al.
    Linköpings universitet, Institutionen för datavetenskap, Programvara och system. Linköpings universitet, Tekniska högskolan.
    Kessler, Christoph
    Linköpings universitet, Institutionen för datavetenskap, Programvara och system. Linköpings universitet, Tekniska högskolan.
    A performance-portable generic component for 2D convolution computations on GPU-based systems2011Ingår i: Fourth Swedish Workshop on Multi-Core Computing MCC-2011: November 23-25, 2011, Linköping University, Linköping, Sweden / [ed] Christoph Kessler, Linköping: Linköping University , 2011, Vol. S. 39-44, s. 39-44Konferensbidrag (Övrigt vetenskapligt)
    Abstract [en]

    In this paper, we describe our work on providing a generic yet optimized GPU (CUDA/OpenCL) implementation for the 2D MapOverlap skeleton. We explain our implementation with the help  of a 2D convolutilution application, implemented using the newly deveioped skeleton.

  • 98.
    Di Orio, Giovanni
    et al.
    Dept. of Electrotechnical Engineering CTS – UNINOVA, Portugal.
    Rocha, Andre
    Dept. of Electrotechnical Engineering CTS – UNINOVA, Portugal.
    Ribeiro, Luis
    Linköpings universitet, Institutionen för ekonomisk och industriell utveckling, Industriell Produktion. Linköpings universitet, Tekniska fakulteten.
    Barata, Jose
    Dept. of Electrotechnical Engineering CTS – UNINOVA, Portugal.
    The PRIME Semantic Language: Plug and Produce in Standard- based Manufacturing Production Systems2015Ingår i: Proceedings of the Flexible Automation and Intelligent Manufacturing Conference, 2015Konferensbidrag (Övrigt vetenskapligt)
    Abstract [en]

    Nowadays manufacturing production systems are becoming more and more responsive in order to succeed in ahighly unstable environment. The capability of a production system to effectively and efficiently adapt and evolveto face the changing requirements – imposed by volatile and dynamic global markets – is a necessary conditionto enable manufacturing enterprises to be agile. Since the agility of a manufacturing enterprise is always limitedby the agility of its own building blocks than it needs to be spread over the whole enterprise including the operationand information technologies (OT/IT). Turning to production systems, one of the significant challenges isrepresented by the possibility to provide easy and rapid (re-)configuration of their internal components and/orprocesses. Innovative technologies and paradigms have been explored during the years that combined with theincreasing advancement in manufacturing technologies enable the implementation of the “plug and produce”paradigm. The “plug and produce” paradigm is the foundation of any agile production system, since to be agile itis inevitably required to reduce the installation and (re-)engineering activities time – changing/adapting the systemto new requirements – while promoting configuration rather than programming. Therefore, the “plug andproduce” paradigm is a necessary but not sufficient condition for implementing agile production systems. Modernproduction systems are typically known for their plethora of heterogeneous component/equipment. In this complexscenario, the implementation of the “plug and produce” paradigm implies the existence of a well-definedontological model to support components/equipment abstraction with the objective to allow interactions,collaboration and knowledge sharing between them. The PRIME semantic language specifies the semanticstructure for the knowledge models and overall system communication language.

  • 99.
    Dogan, Haci
    Linköpings universitet, Institutionen för datavetenskap, Interaktiva och kognitiva system. Linköpings universitet, Tekniska högskolan.
    Case Study of Development of a Web Community With ASP.NET MVC 52014Självständigt arbete på avancerad nivå (magisterexamen), 20 poäng / 30 hpStudentuppsats (Examensarbete)
    Abstract [en]

    This thesis is a qualitative study, case study, of development of a social web application for Wallyfy. The development framework and architectural choices were Microsoft’s ASP.NET with MVC architecture. By utilizing the case study methodology this thesis tries to give an understanding of the phenomena, project development with the chosen tools, in a natural environment.

    It is noticed that unforeseen variables might affect the development project and the maintainability of the application over time. This case study shows that the chosen development framework and the architecture enables system developers to meet future changes and demands.

    This thesis also shows that case study research methodology is a good tool to study a real life phenomena in its natural environment in software engineering. The case study research is a very wide area of research methodology that can be used out of several different perspectives, therefore it is necessary to have a clear view of perspective for the research.

  • 100.
    Doherty, Patrick
    et al.
    Linköpings universitet, Institutionen för datavetenskap, Artificiell intelligens och integrerade datorsystem. Linköpings universitet, Tekniska högskolan.
    Szalas, Andrzej
    Linköpings universitet, Institutionen för datavetenskap, Artificiell intelligens och integrerade datorsystem. Linköpings universitet, Tekniska högskolan.
    Stability, Supportedness, Minimality and Kleene Answer Set Programs2015Ingår i: Advances in Knowledge Representation, Logic Programming, and Abstract Argumentation: Essays Dedicated to Gerhard Brewka on the Occasion of His 60th Birthday / [ed] Thomas Eiter, Hannes Strass, Mirosław Truszczynski, Stefan Woltran, Springer, 2015, s. 125-140Kapitel i bok, del av antologi (Refereegranskat)
    Abstract [en]

    Answer Set Programming is a widely known knowledge representation framework based on the logic programming paradigm that has been extensively studied in the past decades. The semantic framework for Answer Set Programs is based on the use of stable model semantics. There are two characteristics intrinsically associated with the construction of stable models for answer set programs. Any member of an answer set is supported through facts and chains of rules and those members are in the answer set only if generated minimally in such a manner. These two characteristics, supportedness and minimality, provide the essence of stable models. Additionally, answer sets are implicitly partial and that partiality provides epistemic overtones to the interpretation of disjunctiver ules and default negation. This paper is intended to shed light on these characteristics by defining a semantic framework for answer set programming based on an extended first-order Kleene logic with weak and strong negation. Additionally, a definition of strongly supported models is introduced, separate from the minimality assumption explicit in stable models. This is used to both clarify and generate alternative semantic interpretations for answer set programs with disjunctive rules in addition to answer set programs with constraint rules. An algorithm is provided for computing supported models and comparative complexity results between strongly supported and stable model generation are provided.

1234567 51 - 100 av 429
RefereraExporteraLänk till träfflistan
Permanent länk
Referera
Referensformat
  • apa
  • harvard1
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • oxford
  • 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