Ändra sökning
Avgränsa sökresultatet
6789101112 401 - 450 av 50637
RefereraExporteraLänk till träfflistan
Permanent länk
Referera
Referensformat
  • apa
  • 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.
  • 401.
    Adolfsson, John
    Högskolan i Skövde, Institutionen för kommunikation och information.
    Pattern Parameterization with Granules in Ship Movements: Describing identifying aspects of movement patterns with varying levels of granularity2010Självständigt arbete på grundnivå (kandidatexamen), 20 poäng / 30 hpStudentuppsats (Examensarbete)
    Abstract [en]

    This report aims to explore a possible transparent alternative to the black box approach of machine learning in identifying a ship’s type from simple movement data, consisting of a set of coordinates with timestamps. This is achieved by an application that converts the set of coordinates to vectors and assigns them various traits, such as turn radius, speed and distance traveled, and then identifying the correlation between collections of different values of these traits, called granules, and different ship types. The results show a definite connection between certain kinds of granules and certain ship types and lay the foundation for building a more well defined syntax for ship identification.

  • 402.
    Adolfsson, Klas
    Linköpings universitet, Institutionen för systemteknik.
    TCP performance in an EGPRS system2003Självständigt arbete på avancerad nivå (magisterexamen), 20 poäng / 30 hpStudentuppsats
    Abstract [en]

    The most widely used protocol for providing reliable service and congestion control in the Internet is the Transmission Control Protocol (TCP). When the Internet is moving towards more use in mobile applications it is getting more important to know how TCP works for this purpose.

    One of the technologies used for mobile Internet is the Enhanced General Packet Radio Service (EGPRS) extension to the popular GSM system. This thesis presents a low-level analysis of TCP performance in an EGPRS system and an overview of existing TCP, GSM and EGPRS technologies.

    The bottleneck in an EGPRS system is the wireless link – the connection between the mobile phone and the GSM base station. The data transfer over the wireless link is mainly managed by the complex RLC/MAC protocol.

    In this thesis, simulations were made to identify some problems with running TCP and RLC/MAC together. The simulations were made using existing EGPRS testing software together with a new TCP module. The simulation software is also briefly described in the thesis.

    Additionaly, some suggestions are given in order to enhance performance, both by changing the EGPRS system and by modifying the TCP algorithms and parameters.

  • 403.
    Adolfsson, Sofie
    Linköpings universitet, Institutionen för datavetenskap.
    ’The Big Five of Teamwork’ i en flygtrafikledningsdomän: En observationsstudie på Arlanda ATCC2018Självständigt arbete på grundnivå (kandidatexamen), 12 poäng / 18 hpStudentuppsats (Examensarbete)
    Abstract [sv]

    Idag är många branscher beroende av ett gediget teamwork. Det finns dock ett behov av objektiva mätsystem för teamwork och därför har detta projekt som syfte att skapa och testa ett observationsprotokoll utifrån den teoretiska modellen ’The Big Five of Teamwork’ framtagen av Salas, Sims & Burke (2005). Observationsprotokollet användes för att observera teamwork mellan två flygledare på Arlanda ATCC. Därefter fick flygledarna svara på en enkät för att bidra med subjektiva aspekter från modellen. Totalt genomfördes 15 stycken strukturerade observationer. Resultatet visade att det är möjligt att skatta teamwork på flygledare med hjälp av ett observationsprotokoll baserat på sex av åtta komponenter, där inte teamorientering och gemensam mental modell ingick. Komponenterna visade sig vara mer än bara ett observerbart beteende och enbart observationer frambringar inte en rättvis bild över komponenten. Resultatet visade också på att flygledarna själva upplever samtliga komponenter som en del av arbetet. Observationerna visade att samarbetet kunde se olika ut och skilja sig från team till team, och att flygledarna anpassar sig efter varandras behov. 

  • 404.
    Adolfsson, Victor
    Blekinge Tekniska Högskola, Institutionen för ekonomi och samhällsvetenskap.
    Säkerhetskapital En del av det Intellektuella Kapitalet2002Självständigt arbete på grundnivå (kandidatexamen)Studentuppsats (Examensarbete)
    Abstract [sv]

    Det saknas metoder att mäta informationssäkerhet inom företag och företagets tillgångar har förändrats från ett fokus på maskiner och råvaror till kunskap (intellektuellt kapital). Rapporten utforskar om det finns delar av företags intellektuella kapital som beskyddar företagets tillgångar och processer. Detta kapital kallas säkerhetskapital. Hur skulle företags informationssäkerhet kunna tydliggöras genom dess intellektuella kapital och hur kan begrepp inom informationssäkerhet och företagsvärdering hänga samman? Syftet med uppsatsen är att öka förståelsen hur informationssäkerhet är relaterat till intellektuellt kapital. Rapporten bygger på litteraturstudier om intellektuellt kapital och informationssäkerhet. Data har samlats in från dels börsnoterade företags årsredovisningar och dels från pressreleaser och börsinformation. Denna information har sedan analyserats både kvantitativt och kvalitativt och begreppet säkerhetskapital har växt fram. Teorier om företagsvärdering, intellektuellt kapital, risk management och informationssäkerhet presenteras och blir den referensram i vilket begreppet säkerhetskapital sätts i sitt sammanhang. Begreppet säkerhetskapital presenteras i form av modeller och situationer vari olika perspektiv på säkerhetskapital analyseras och utvärderas. Slutsatserna är främst i form av modeller och beskrivningar av hur man kan se på säkerhetskapital i förhållande till intellektuellt kapital och andra begrepp. Området är komplext men delar av resultaten (som är på en hög abstraktionsnivå) kan användas för att värdera andra typer av immateriella tillgångar.

  • 405.
    Adolfsson, Victor
    Blekinge Tekniska Högskola, Institutionen för programvaruteknik och datavetenskap.
    The State of the Art in Distributed Mobile Robotics2001Självständigt arbete på avancerad nivå (magisterexamen)Studentuppsats (Examensarbete)
    Abstract [sv]

    Uppsatsen är en brett spektrum på vilken forskning som pågår rörande distribuerad mobil robotik, dvs hur många robotar kan samverka för att lösa uppgifter.

  • 406.
    Adomnita, Alexandr
    Högskolan i Jönköping, Internationella Handelshögskolan, IHH, Informatik.
    Balancing walled garden and open platform approaches for the Internet of Things: A case study of Husqvarna Group2016Självständigt arbete på avancerad nivå (masterexamen), 20 poäng / 30 hpStudentuppsats (Examensarbete)
    Abstract [en]

    The term “Internet of Things” (IoT) was first introduced by a technology pioneer Kevin Ashton in 1999.Although the term is relatively new, the idea of making networks and computers communicate in order totrack and manage devices has been around for many years. As of now IoT is a rising topic in technicalcommunity. Some specialists are anticipating that by 2025 there will be around 100 billion connected IoTdevices with a worldwide economic impact of more than $11 trillion. On the other hand, Internet of Thingsemerges significant challenges. Currently the organization around world use two main approaches whenentering the IoT market. First one is an open platform and is represented by interoperability andcollaboration with devices from different vendors. Second one is a closed platform, or a “walled garden”approach. A “walled garden” approach is characterized by building “fences” around the user. In other words,the service provider has control over applications, content and media and also restricts the non-approvedcontent to reach the customer. Therefore, the research set out to explore these approaches and show thebenefits and limits they can have on an organization. The research was conducted in collaboration with aSwedish manufacturer of outdoor power products called Husqvarna Group. In order to fully acknowledgethe organization’s approach, 4 interviews were conducted with managers, back end developers andconsultants hired by Husqvarna Group. From the findings, some things should be taken in consideration.First, IoT involves big data being collected, therefore security and privacy are crucial when developingdevices and systems. Second, it is essential for an organization to have the same views when taking a newdirection. Third, when discussing Internet of Things, it means that things connect, devices to sensors,sensor to gateways and gateways to system. And there shouldn’t be a delimitation from a vendor to another.Therefore, open platform approach is seen as the way to diversity and innovation.

  • 407.
    ADORF, JULIUS
    KTH, Skolan för datavetenskap och kommunikation (CSC).
    Motion Segmentation of RGB-D Videosvia Trajectory Clustering2014Självständigt arbete på avancerad nivå (masterexamen), 20 poäng / 30 hpStudentuppsats (Examensarbete)
    Abstract [en]

    Motion segmentation of RGB-D videos can be a first step towards object reconstruction in dynamic scenes. The objective in this thesis is to end an ecient motion segmentation method that can deal with a moving camera. To this end, we adopt a feature-based approach where keypoints in the images are tracked over time. The variation in the observed pairwise 3-d distances is used to determine which of the points move similarly. We then employ spectral clusteringto group trajectories into clusters with similar motion, thereby obtaining a sparse segmentation of the dynamic objectsin the scene. The results on twenty scenes from real world datasets and simulations show that while the method needs more sophistication to segment all of them, several dynamic scenes have been successfully segmented at a processing speed of multiple frames per second.

  • 408. Adrian, K.
    et al.
    Chocron, P.
    Confalonieri, R.
    Ferrer, X.
    Giraldez-Cru, J.
    KTH, Skolan för datavetenskap och kommunikation (CSC), Teoretisk datalogi, TCS.
    Link prediction in evolutionary graphs the case study of the CCIA network2016Ingår i: 19th International Conference of the Catalan Association for Artificial Intelligence, CCIA 2016, IOS Press, 2016, s. 187-196Konferensbidrag (Refereegranskat)
    Abstract [en]

    Studying the prediction of new links in evolutionary networks is a captivating question that has received the interest of different disciplines. Link prediction allows to extract missing information and evaluate network dynamics. Some algorithms that tackle this problem with good performances are based on the sociability index, a measure of node interactions over time. In this paper, we present a case study of this predictor in the evolutionary graph that represents the CCIA co-authorship network from 2005 to 2015. Moreover, we present a generalized version of this sociability index, that takes into account the time in which such interactions occur. We show that this new index outperforms existing predictors. Finally, we use it in order to predict new co-authorships for CCIA 2016.

  • 409.
    Adriansson, Eva
    Linnéuniversitetet, Fakultetsnämnden för naturvetenskap och teknik, Institutionen för datavetenskap, fysik och matematik, DFM.
    Kommunal verksamhetsprocess efter införandet av en e-tjänst: Informationsflöde och informationshantering sett ur ett Lean-perspektiv2011Självständigt arbete på avancerad nivå (magisterexamen), 10 poäng / 15 hpStudentuppsats (Examensarbete)
    Abstract [sv]

    Trots de svenska medborgarnas ökande krav på digital självservice via e-tjänster, går införande trögt hos kommunerna. En anledning är den relativt låga kunskap som finns i området. Främst vad gäller avancerade e-tjänster som förutom att öka medborgarnas tillgänglighet, insyn och delaktighet i sina offentliga ärenden, även ska minska den administrativa hanteringen för att istället låta mer av resurserna gå till kärnverksamheten. I den här kvalitativa fallstudien studerades hur en kommunal verksamhetsprocess utvecklas vid införandet av en e-tjänst. Hur slöseri kan identifieras i processen informationshantering och informationsflöde och hur dessa förändrats efter att e-tjänsten införts. Resultatet baserades på material från intervjuer och analyserades utifrån Leans kategorier av slöseri och teorin om Microsystem. Resultatet visade att slöseri som uppstår i informationshantering och informationsflöde mellan enheter eller microsystem kunde identifieras om alla microsystem kartlägger processen tillsammans. Mycket slöseri hade tagits bort i utvecklingsarbetet och lett till en smidigare och troligtvis mer effektiv process. Ett antagande men som även bekräftades av personalens upplevelser från testförsöken. Processutvecklingen tillsammans med e-tjänsten har säkerställt delar av processflödet där antalet informationsöverföringar blivit färre och på så sätt troligtvis även minskat risken för att missförstånd och felhantering ska uppstå av informationshanteringen.

  • 410.
    Adrup, Joakim
    et al.
    KTH, Skolan för datavetenskap och kommunikation (CSC).
    Skogström, Charlotte
    KTH, Skolan för datavetenskap och kommunikation (CSC).
    Effekterna av spelmekanismerna ledartavlor, serier och certifikat på det dagliga stegantalet hos högskolestuderande studenter2016Självständigt arbete på grundnivå (kandidatexamen), 10 poäng / 15 hpStudentuppsats (Examensarbete)
    Abstract [sv]

    Spelifiering börjar bli ett vedertaget begrepp, speciellt inom forskningsområden såsom MDI (Människa-datorinteraktion). I den här uppsatsen diskuteras och jämförs tre olika spelmekanismer genom det dagliga stegantalet. Spelmekanismerna är ledartavlor, serier och certifikat. Studien tillämpar kvantitativa och kvalitativa metoder för att undersöka hur de ovannämnda spelmekanismerna påverkar det dagliga stegantalet hos studenter som studerar på en högskolenivå.

    Av studien framgår att spelifiering är att föredra när det gäller medvetenhet och nöje, men att spelifiering ej får störa de grundläggande funktionerna hos den ursprungliga produkten. Tvärtom bör spelmekanismer användas för att stödja produktens befintliga funktioner, och inte enbart för att göra produkten mer underhållande och motiverande. Den generella konklusionen av all insamlad kvantitativ data är att spelifiering inte influerar det dagliga stegantalet.

    Slutligen diskuterar artikeln vilka faktorer som bör implementeras för att spelifiering ska verka i motiverande syfte. Artikeln diskuterar även hur spelutvecklare kan nyttja speldesign för att skapa intressanta och engagerande applikationer.

  • 411.
    Adzemovic, Haris
    et al.
    KTH, Skolan för datavetenskap och kommunikation (CSC).
    Sandor, Alexander
    KTH, Skolan för datavetenskap och kommunikation (CSC).
    Comparison of user and item-based collaborative filtering on sparse data2017Självständigt arbete på grundnivå (kandidatexamen), 10 poäng / 15 hpStudentuppsats (Examensarbete)
    Abstract [sv]

    Idag används rekommendationssystem extensivt inom flera områden för att hjälpa användare och konsumenter i deras val. Amazon rekommenderar böcker baserat på vad du tittat på och köpt, Netflix presenterar serier och filmer du antagligen kommer gilla baserat på interaktioner med plattformen och Facebook visar personaliserad, riktad reklam för varje enskild användare baserat på tidigare surfvanor. Dessa system är baserade på delade likheter och det finns flera sätt att utveckla och modellera dessa på. I denna rapport jämförs två metoder, användar- och objektbaserad filtrering i k nearest neighbours system. Metoderna jämförs på hur mycket de avviker från det sanna svaret när de försöker förutse användarbetyg på filmer baserat på gles data. Studien visade att man ej kan peka ut någon metod som objektivt bättre utan att val av metod bör baseras på datasetet.

  • 412.
    Aerts, Arend
    et al.
    Control Systems Technology Group, Eindhoven University of Technology, Eindhoven, The Netherlands.
    Mousavi, Mohammad Reza
    Högskolan i Halmstad, Akademin för informationsteknologi, Halmstad Embedded and Intelligent Systems Research (EIS), Centrum för forskning om inbyggda system (CERES).
    Reniers, Michel A.
    Control Systems Technology Group, Eindhoven University of Technology, Eindhoven, The Netherlands.
    A Tool Prototype for Model-Based Testing of Cyber-Physical Systems2015Ingår i: Theoretical Aspects of Computing – ICTAC 2015: 12th International Colloquium Cali, Colombia, October 29–31, 2015, Proceedings / [ed] Martin Leucker, Camilo Rueda, and Frank D. Valencia, Cham: Springer, 2015, Vol. 9399, s. 563-572Konferensbidrag (Refereegranskat)
    Abstract [en]

    We report on a tool prototype for model-based testing of cyber-physical systems. Our starting point is a hybrid-system model specified in a domain-specific language called Acumen. Our prototype tool is implemented in Matlab and covers three stages of model-based testing, namely, test-case generation, test-case execution, and conformance analysis. We have applied our implementation to a number of typical examples of cyber-physical systems in order to analyze its applicability. In this paper, we report on the result of applying the prototype tool on a DC-DC boost converter. © Springer International Publishing Switzerland 2015

  • 413.
    Aerts, Arend
    et al.
    Eindhoven University of Technology, Eindhoven, The Netherlands.
    Reniers, Michel A.
    Eindhoven University of Technology, Eindhoven, The Netherlands.
    Mousavi, Mohammad Reza
    Högskolan i Halmstad, Akademin för informationsteknologi, Halmstad Embedded and Intelligent Systems Research (EIS), Centrum för forskning om inbyggda system (CERES).
    Model-Based Testing of Cyber-Physical Systems2016Ingår i: Cyber-Physical Systems: Foundations, Principles and Applications / [ed] H. Song, D.B. Rawat, S. Jeschke, and Ch. Brecher, Saint Louis: Elsevier, 2016, s. 287-304Kapitel i bok, del av antologi (Refereegranskat)
    Abstract [en]

    Cyber-physical systems (CPSs) are the result of the integration of connected computer systems with the physical world. They feature complex interactions that go beyond traditional communication schemes and protocols in computer systems. One distinguished feature of such complex interactions is the tight coupling between discrete and continuous interactions, captured by hybrid system models.

    Due to the complexity of CPSs, providing rigorous and model-based analysis methods and tools for verifying correctness of such systems is of the utmost importance. Model-based testing (MBT) is one such verification technique that can be used for checking the conformance of an implementation of a system to its specification (model).

    In this chapter, we first review the main concepts and techniques in MBT. Subsequently, we review the most common modeling formalisms for CPSs, with focus on hybrid system models. Subsequently, we provide a brief overview of conformance relations and conformance testing techniques for CPSs. © 2017 Elsevier Inc. All rights reserved.

  • 414.
    af Sandeberg, Jonas
    KTH, Skolan för datavetenskap och kommunikation (CSC).
    Riksdagsval via Internet – Ett system för säkra val via Internet i Sverige.2012Självständigt arbete på avancerad nivå (yrkesexamen), 10 poäng / 15 hpStudentuppsats (Examensarbete)
    Abstract [sv]

    I denna uppsats designas ett system för val via Internet i Sverige. För att göra detta undersöks först hur dagens system för val i Sverige ser ut. Därefter undersöks vilka tekniker som kan användas för att bygga ett sådant system. Slutligen undersöks system som redan använts för val via Internet i andra länder. Utifrån resultatet i undersökningarna designas sedan ett system för val via Internet i Sverige. Designen tar hänsyn till alla säkerhetskrav för demokratiska val. Uppsatsen visar på att det är möjligt att designa ett system för val via Internet i Sverige samt att införandet av ett sådant system bör öka valdeltagandet.

  • 415.
    af Sandeberg, Jonas
    KTH, Skolan för informations- och kommunikationsteknik (ICT).
    Speeding Up Value at Risk Calculations Using Accelerators2014Självständigt arbete på avancerad nivå (masterexamen), 20 poäng / 30 hpStudentuppsats (Examensarbete)
    Abstract [sv]

    Att beräkna Value at Risk (VaR) kan vara tidskrävande. Därför är det instressant att finna möjligheter att parallelisera och snabba upp dessa beräkningar för att förbättra prestandan. Men vilken hårdvara är bäst lämpad för dessa beräkningar?

    Detta arbete syftar till att för ett system skrivet i Java hitta vilken typ av beräkningsenhet som ger optimal prestanda vid scenariobaserade VaR beräkningar. Först gjordes en teoretisk undersökning av CPUn, GPUn och en coprocessor. Flera versioner av en parallel VaR algoritm implementeras för en CPU, GPU och en coprocessor där resultaten från undersökningen utnyttjas.

    Prestandan samt enkelheten att programmera varje version utvärderas och analyseras. De utförda prestanda testerna visar att vinnaren vad gäller prestanda är CPUn för den valda VaR algoritmen och de testade problemstorlekarna.

  • 416.
    Afanasov, Mikhail
    et al.
    Politecnico di Milano, Italy.
    Iavorskii, Aleksandr
    John Wiley & Sons Inc, Russia.
    Mottola, Luca
    RISE - Research Institutes of Sweden, ICT, SICS. Politecnico di Milano, Italy.
    Programming Support for Time-sensitive Adaptation in Cyberphysical Systems2018Ingår i: ACM SIGBED Review, Vol. 14, nr 4, s. 27-32Artikel i tidskrift (Refereegranskat)
    Abstract [en]

    Cyberphysical systems (CPS) integrate embedded sensors,actuators, and computing elements for controlling physicalprocesses. Due to the intimate interactions with thesurrounding environment, CPS software must continuouslyadapt to changing conditions. Enacting adaptation decisionsis often subject to strict time requirements to ensure controlstability, while CPS software must operate within the tightresource constraints that characterize CPS platforms. Developersare typically left without dedicated programmingsupport to cope with these aspects. This results in either toneglect functional or timing issues that may potentially ariseor to invest significant efforts to implement hand-crafted solutions.We provide programming constructs that allow developersto simplify the specification of adaptive processingand to rely on well-defined time semantics. Our evaluationshows that using these constructs simplifies implementationswhile reducing developers’ effort, at the price of a modestmemory and processing overhead.

  • 417.
    Afanasov, Mikhail
    et al.
    Politecnico di Milano, Italy.
    Mottola, Luca
    RISE - Research Institutes of Sweden, ICT, SICS. Politecnico di Milano, Italy.
    Ghezzi, Carlo
    Politecnico di Milano, Italy.
    Software Adaptation in Wireless Sensor Networks2018Ingår i: ACM Transactions on Autonomous and Adaptive Systems, Vol. 12, nr 4, s. 1-29Artikel i tidskrift (Refereegranskat)
    Abstract [en]

    We present design concepts, programming constructs, and automatic verification techniques to support thedevelopment of adaptive Wireless Sensor Network (WSN) software. WSNs operate at the interface betweenthe physical world and the computing machine, and are hence exposed to unpredictable environment dynamics.WSN software must adapt to these dynamics to maintain dependable and efficient operation. Whilesignificant literature exists on the necessary adaptation logic, developers are left without proper support inmaterializing such a logic in a running system. Our work fills this gap with three key contributions: i) designconcepts help developers organize the necessary adaptive functionality and understand their relations,ii) dedicated programming constructs simplify the implementations, iii) custom verification techniques allowdevelopers to check the correctness of their design before deployment. We implement dedicated toolsupport to tie the three contributions, facilitating their practical application. Our evaluation considers representativeWSN applications to analyze code metrics, synthetic simulations, and cycle-accurate emulationof popular WSN platforms. The results indicate that our work is effective in simplifying the developmentof adaptive WSN software; for example, implementations are provably easier to test and to maintain, therun-time overhead of our dedicated programming construct is negligible, and our verification techniquesreturn results in a matter of seconds.

  • 418.
    Afkham, Heydar Maboudi
    et al.
    KTH, Skolan för datavetenskap och kommunikation (CSC), Datorseende och robotik, CVAP.
    Ek, Carl Henrik
    KTH, Skolan för datavetenskap och kommunikation (CSC), Datorseende och robotik, CVAP.
    Carlsson, Stefan
    KTH, Skolan för datavetenskap och kommunikation (CSC), Datorseende och robotik, CVAP.
    Initialization framework for latent variable models2014Ingår i: ICPRAM 2014 - Proceedings of the 3rd International Conference on Pattern Recognition Applications and Methods, 2014, s. 227-232Konferensbidrag (Refereegranskat)
    Abstract [en]

    In this paper, we discuss the properties of a class of latent variable models that assumes each labeled sample is associated with set of different features, with no prior knowledge of which feature is the most relevant feature to be used. Deformable-Part Models (DPM) can be seen as good example of such models. While Latent SVM framework (LSVM) has proven to be an efficient tool for solving these models, we will argue that the solution found by this tool is very sensitive to the initialization. To decrease this dependency, we propose a novel clustering procedure, for these problems, to find cluster centers that are shared by several sample sets while ignoring the rest of the cluster centers. As we will show, these cluster centers will provide a robust initialization for the LSVM framework.

  • 419.
    Afkham, Heydar Maboudi
    et al.
    KTH, Skolan för datavetenskap och kommunikation (CSC).
    Qiu, Xuanbin
    KTH, Skolan för datavetenskap och kommunikation (CSC).
    The, Matthew
    KTH, Skolan för bioteknologi (BIO), Genteknologi. KTH, Centra, Science for Life Laboratory, SciLifeLab.
    Käll, Lukas
    KTH, Centra, Science for Life Laboratory, SciLifeLab.
    Uncertainty estimation of predictions of peptides' chromatographic retention times in shotgun proteomics2017Ingår i: Bioinformatics, ISSN 1367-4803, E-ISSN 1367-4811, Vol. 33, nr 4, s. 508-513Artikel i tidskrift (Refereegranskat)
    Abstract [en]

    Motivation: Liquid chromatography is frequently used as a means to reduce the complexity of peptide-mixtures in shotgun proteomics. For such systems, the time when a peptide is released from a chromatography column and registered in the mass spectrometer is referred to as the peptide's retention time. Using heuristics or machine learning techniques, previous studies have demonstrated that it is possible to predict the retention time of a peptide from its amino acid sequence. In this paper, we are applying Gaussian Process Regression to the feature representation of a previously described predictor ELUDE. Using this framework, we demonstrate that it is possible to estimate the uncertainty of the prediction made by the model. Here we show how this uncertainty relates to the actual error of the prediction. Results: In our experiments, we observe a strong correlation between the estimated uncertainty provided by Gaussian Process Regression and the actual prediction error. This relation provides us with new means for assessment of the predictions. We demonstrate how a subset of the peptides can be selected with lower prediction error compared to the whole set. We also demonstrate how such predicted standard deviations can be used for designing adaptive windowing strategies.

  • 420.
    Afram, Gabriel
    Mittuniversitetet, Fakulteten för naturvetenskap, teknik och medier, Avdelningen för informationssystem och -teknologi.
    Genomsökning av filsystem för att hitta personuppgifter: Med Linear chain conditional random field och Regular expression2018Självständigt arbete på grundnivå (kandidatexamen), 10 poäng / 15 hpStudentuppsats (Examensarbete)
    Abstract [sv]

    Den nya lagen General data protection regulation (GDPR) började gälla för alla företag inom Europeiska unionen efter den 25 maj. Detta innebär att det blir strängare lagkrav för företag som på något sätt lagrar personuppgifter. Målet med detta projekt är därför att underlätta för företag att uppfylla de nya lagkraven. Detta genom att skapa ett verktyg som söker igenom filsystem och visuellt visar användaren i ett grafiskt användargränssnitt vilka filer som innehåller personuppgifter. Verktyget använder Named Entity Recognition med algoritmen Linear Chain Conditional Random Field som är en typ av ”supervised” learning metod inom maskininlärning. Denna algoritm används för att hitta namn och adresser i filer. De olika modellerna tränas med olika parametrar och träningen sker med hjälp av biblioteket Stanford NER i Java. Modellerna testas genom en testfil som innehåller 45 000 ord där modellerna själva får förutspå alla klasser till orden i filen. Modellerna jämförs sedan med varandra med hjälp av mätvärdena precision, recall och F-score för att hitta den bästa modellen. Verktyget använder även Regular expression för att hitta e- mails, IP-nummer och personnummer. Resultatet på den slutgiltiga maskininlärnings modellen visar att den inte hittar alla namn och adresser men att det är något som kan förbättras genom att öka träningsdata. Detta är dock något som kräver en kraftfullare dator än den som användes i detta projekt. En undersökning på hur det svenska språket är uppbyggt skulle även också behöva göras för att använda de lämpligaste parametrarna vid träningen av modellen.

  • 421.
    Afram, Rabi
    Högskolan på Gotland, Institutionen för speldesign, teknik och lärande.
    Puzzle Design in Adventure Games2013Självständigt arbete på grundnivå (kandidatexamen), 10 poäng / 15 hpStudentuppsats (Examensarbete)
    Abstract [en]

    This thesis investigates the level of difficulty of puzzles in the adventure games and the implications thereof. The thesis contains an in-depth background, and a brief history about the genre. It brings up the main problem of the genre and looks into both the cause and effect that follows. To support this process, an analysis has been made of design documents and a survey was issued on the subject of adventure game puzzles.

  • 422. Afrasiabi, R.
    et al.
    Soderberg, L. M.
    Joensson, H. N.
    Björk, Per
    RISE., Swedish ICT, Acreo.
    Svahn, H. A.
    Linnros, J.
    Integration of a droplet-based microfluidic system and silicon nanoribbon FET sensor2016Ingår i: Micromachines, ISSN 2072-666X, E-ISSN 2072-666X, Vol. 7, nr 8, artikel-id 134Artikel i tidskrift (Refereegranskat)
    Abstract [en]

    We present a novel microfluidic system that integrates droplet microfluidics with a silicon nanoribbon field-effect transistor (SiNR FET), and utilize this integrated system to sense differences in pH. The device allows for selective droplet transfer to a continuous water phase, actuated by dielectrophoresis, and subsequent detection of the pH level in the retrieved droplets by SiNR FETs on an electrical sensor chip. The integrated microfluidic system demonstrates a label-free detection method for droplet microfluidics, presenting an alternative to optical fluorescence detection. In this work, we were able to differentiate between droplet trains of one pH-unit difference. The pH-based detection method in our integrated system has the potential to be utilized in the detection of biochemical reactions that induce a pH-shift in the droplets.

  • 423. Africano, Diana
    et al.
    Clark, Brendon
    RISE, Swedish ICT, Interactive Institute. Design Research Unit.
    Design för kulturell mångfald2006Ingår i: Västerbotten (Umeå. 1920), Västerbotten (Umeå. 1920) , 2006, 10, s. 36-39Kapitel i bok, del av antologi (Övrigt vetenskapligt)
  • 424.
    Afrim, Cerimi
    et al.
    Högskolan i Halmstad, Sektionen för Informationsvetenskap, Data– och Elektroteknik (IDE).
    Norén, Joakim
    Högskolan i Halmstad, Sektionen för Informationsvetenskap, Data– och Elektroteknik (IDE).
    Motåtgärder vid IT-forensisk liveanalys2011Självständigt arbete på grundnivå (kandidatexamen), 10 poäng / 15 hpStudentuppsats (Examensarbete)
    Abstract [sv]

    Liveanalys är ett begrepp som i detta arbete innebär att man undersöker ett datorsystem under tiden det är igång. Detta kan göras av flera skäl, t.ex. när det är risk för att kryptering finns på systemet vilket kan aktiveras när det stängs ner. Annars är det vanligt om man vill undersöka nätverkskopplingar, aktiva processer eller andra företeelser som kan vara volatila, dvs. försvinner när systemet stängs ner. Detta arbete kommer att ha fokus på motåtgärder vid forensisk liveanalys och redogöra för olika metoder och strategier som kan användas för dessa motåtgärder. Vi har bland annat skrivit ett program som automatiskt stänger ner systemet när man sätter i ett USB-minne eller annan media. Dessa media är oftast de man har sina forensiska program på när man ska göra en liveanalys. Andra viktiga element i arbetet är användning av kryptering, tidstämplar och sabotagekod för att försvåra liveanalysen. Vår analys i ämnet visar att det är relativt enkelt att förhindra att en liveanalys kan utföras på ett tillförlitligt sätt.

  • 425.
    Afroze, Tonima
    et al.
    KTH, Skolan för teknik och hälsa (STH).
    Rosén Gardell, Moa
    KTH, Skolan för teknik och hälsa (STH).
    Algorithm Construction for Efficient Scheduling of Advanced Health Care at Home2015Självständigt arbete på avancerad nivå (masterexamen), 20 poäng / 30 hpStudentuppsats (Examensarbete)
    Abstract [sv]

    Barn som får avancerad sjukvård hemma istället för på sjukhus tillfrisknar ofta snabbare och risken för vårdrelaterade infektioner minskar. Barnen och deras familjer blir mer välmående av att få vistas i sin hemmiljö. På Astrid Lingrens barnsjukhus i Stockholm erbjuds avancerad hemsjukvård av avdelningen Sjukhusansluten Avancerad Barnsjukvård i Hemmet (SABH). För att schemalägga när patienterna ska besökas av sjukvårdspersonalen behöver många olika faktorer beaktas, detta sker idag helt manuellt. Den manuella schemaläggningen utgör en naturlig begränsning av SABHs patientkapacitet. Denna uppsats syftar till att effektivisera schemaläggningsprocessen hos SABH genom att föreslå en automatiserad lösning som hanterar koordinering av personal och resurser och dem förändringar som behöver göras i schemat under dagen, för att få bort schemaläggningsprocessen som ett hinder mot ökad patientkapacitet. Krav på schemaläggningen identifieras i diskussion med SABH och genom att studera litteratur kring liknande områden där schemaläggning lösts automatiserat. Vi formulerar schemaläggningen som ett datologiskt problem och analyserar det med utgångspunkt i teoretisk datalogi. Vi visar att problemet är NP-svårt och därför inte kan förväntas lösas optimalt inom rimlig tid. Vår lösning approximerar istället fram ett rimligt svar, där fokus hos algoritmen är att patienterna ska besökas de tider de behöver, personalens restider ska vara så korta som möjligt samtidigt som arbetsbördan hos personalen ska vara så lika fördelad som möjligt och patienterna ska, i den mån det är möjligt, få vård av samma personal. Med en girig algoritm konstrueras ett initialt schema som uppfyller de grundläggande kraven, detta schema förbättras med lokalsökning, simulated annealing och tabusökning. En exakt lösning framställs för uppdatering av schemat. Algoritmen för att lägga ett dagligt schema (utan uppdateringar) implementerades och testades med riktigt data från SABH. Vår algoritm visade sig vara effektiv, men för att kunna göra hela schemaläggningsprocessen effektiv behöver den integreras med journalsystemet.

  • 426.
    Afshar, Sara
    Mälardalens högskola, Akademin för innovation, design och teknik, Inbyggda system.
    Lock-Based Resource Sharing in Real-Time Multiprocessor Platforms2014Licentiatavhandling, sammanläggning (Övrigt vetenskapligt)
    Abstract [en]

    Embedded systems are typically resource constrained, i.e., resources such as processors, I/O devices, shared buffers or shared memory can be limited for tasks in the system. Therefore, techniques that enable an efficient usage of such resources are of great importance.

    In the industry, typically large and complex software systems are divided into smaller parts (applications) where each part is developed independently. Migration towards multiprocessor platforms has become inevitable from an industrial perspective. Due to such migration and to efficient use of system resources, these applications eventually may be integrated on a shared multiprocessor platform. In order to facilitate the integration phase of the applications on a shared platform, the timing and resource requirements of each application can be provided in an interface when the application is developed. The system integrator can benefit from such provided information in the interface of each application to ease the integration process. In this thesis, we have provided the resource and timing requirements of each application in their interfaces for applications that may need several processors to be allocated on when they are developed.

    Although many scheduling techniques have been studied for multiprocessor systems, these techniques are usually based on the assumption that tasks are independent, i.e. do not share resources other than the processors. This assumption is typically not true. In this thesis, we provide an extension to such systems to handle sharing of resources other than processor among tasks. Two traditional approaches exist for multiprocessor systems to schedule tasks on processors. A recent scheduling approach for multiprocessors has combined the two traditional approaches and achieved a hybrid more efficient approach compared to the two previous one. Due to the complex nature of this scheduling approach the conventional approaches for resource sharing could not be used straight forwardly. In this thesis, we have modified resource sharing approaches such that they can be used in such hybrid scheduling systems. A second concern is that enabling resource sharing in the systems can cause unpredictable delays and variations in response time of tasks which can degrade system performance. Therefore, it is of great significance to improve the resource handling techniques to reduce the effect of imposed delays caused by resource sharing in a multiprocessor platform. In this thesis we have proposed alternative techniques for resource handling that can improve system performance for special setups.

  • 427.
    Afshar, Sara
    et al.
    Mälardalens högskola, Akademin för innovation, design och teknik, Inbyggda system.
    Behnam, Moris
    Mälardalens högskola, Akademin för innovation, design och teknik, Inbyggda system.
    Bril, R. J.
    Technische Universiteit Eindhoven, Eindhoven, Netherlands .
    Nolte, Thomas
    Mälardalens högskola, Akademin för innovation, design och teknik, Inbyggda system.
    Flexible spin-lock model for resource sharing in multiprocessor real-time systems2014Ingår i: Proc. IEEE Int. Symp. Ind. Embedded Syst., SIES, 2014, s. 41-51Konferensbidrag (Refereegranskat)
    Abstract [en]

    Various approaches can be utilized upon resource locking for mutually exclusive resource access in multiprocessor platforms. So far two conventional approaches exist for dealing with tasks that are blocked on a global resource in a multi-processor platform. Either the blocked task performs a busy wait, i.e. spins, at the highest priority level until the resource is released, or it is suspended. Although both approaches provide mutually exclusive access to resources, they can introduce long blocking delays to tasks, which may be unacceptable for many industrial applications. In this paper, we propose a general spin-based model for resource sharing in multiprocessor platforms in which the priority of the blocked tasks during spinning can be selected arbitrarily. Moreover, we provide the analysis for two selected spin-lock priorities and we show by means of a general comparison as well as specific examples that these solutions may provide a better performance for higher priority tasks.

  • 428.
    Afshar, Sara
    et al.
    Mälardalens högskola, Akademin för innovation, design och teknik, Inbyggda system.
    Behnam, Moris
    Mälardalens högskola, Akademin för innovation, design och teknik, Inbyggda system.
    Bril, Reinder J.
    Mälardalens högskola, Akademin för innovation, design och teknik, Inbyggda system. Technische Universiteit Eindhoven, Eindhoven, Netherlands.
    Nolte, Thomas
    Mälardalens högskola, Akademin för innovation, design och teknik, Inbyggda system.
    Resource Sharing Under Global Scheduling with Partial Processor Bandwidth2015Ingår i: 2015 10th IEEE International Symposium on Industrial Embedded Systems, SIES 2015 - Proceedings, 2015, s. 195-206Konferensbidrag (Refereegranskat)
    Abstract [en]

    Resource efficient approaches are of great importance for resource constrained embedded systems. In this paper, we present an approach targeting systems where tasks of a critical application are partitioned on a multi-core platform and by using resource reservation techniques, the remaining bandwidth capacity on each core is utilized for one or a set of non-critical application(s). To provide a resource efficient solution and to exploit the potential parallelism of the extra applications on the multi-core processor, global scheduling is used to schedule the tasks of the non-critical applications. Recently a specific instantiation of such a system has been studied where tasks do not share resources other than the processor. In this paper, we enable semaphore-based resource sharing among tasks within critical and non-critical applications using a suspension-based synchronization protocol. Tasks of non-critical applications have partial access to the processor bandwidth. The paper provides the systems schedulability analysis where blocking due to resource sharing is bounded. Further, we perform experimental evaluations under balanced and unbalanced allocation of tasks of a critical application to cores.

  • 429.
    Afshar, Sara
    et al.
    Mälardalens högskola, Akademin för innovation, design och teknik, Inbyggda system.
    Behnam, Moris
    Mälardalens högskola, Akademin för innovation, design och teknik, Inbyggda system.
    J. Bril, Reinder
    Mälardalens högskola, Akademin för innovation, design och teknik, Inbyggda system.
    Nolte, Thomas
    Mälardalens högskola, Akademin för innovation, design och teknik, Inbyggda system.
    Per Processor Spin-Lock Priority for Partitioned Multiprocessor Real-Time Systems2014Rapport (Övrigt vetenskapligt)
    Abstract [en]

    Two traditional approaches exist for a task that is blocked on a global resource; a task either performs a non-preemptive busy wait, i.e., spins, or suspends and releases the processor. Previously, we have shown that both approaches can be viewed as spinning either at the highest priority HP or at the lowest priority on the processor LP, respectively. Based on this view, previously we have generalized a task's blocking behavioral model, as spinning at any arbitrary priority level. In this paper, we focus on a particular class of spin-lock protocols from the introduced flexible spin-lock model where spinning is performed at a priority equal to or higher than the highest local ceiling of the global resources accessed on a processor referred to as CP spin-lock approach. In this paper, we assume that all tasks of a specific processor are spinning on the same priority level. Given this class and assumption, we show that there exists a spin-lock protocol in this range that dominates the classic spin-lock protocol which tasks spin on highest priority level (HP). However we show that this new approach is incomparable with the CP spin-lock approach. Moreover, we show that there may exist an intermediate spin-lock approach between the priority used by CP spin-lock approach and the new introduced spin-lock approach that can make a task set schedulable when those two cannot. We provide an extensive evaluation results comparing the HP, CP and the new proposed approach.

  • 430.
    Afshar, Sara
    et al.
    Mälardalens högskola, Akademin för innovation, design och teknik, Inbyggda system.
    Behnam, Moris
    Mälardalens högskola, Akademin för innovation, design och teknik, Inbyggda system.
    J. Bril, Reinder
    Mälardalens högskola, Akademin för innovation, design och teknik, Inbyggda system.
    Nolte, Thomas
    Mälardalens högskola, Akademin för innovation, design och teknik, Inbyggda system.
    Per Processor Spin-Lock Priority for Partitioned Multiprocessor Real-Time SystemsIngår i: Leibniz Transactions on Embedded Systems, ISSN 2199-2002Artikel i tidskrift (Övrigt vetenskapligt)
    Abstract [en]

    Two traditional approaches exist for a task that is blocked on a global resource; a task either performs a non-preemptive busy wait, i.e., spins, or suspends and releases the processor. Previously, we have shown that both approaches can be viewed as spinning either at the highest priority HP or at the lowest priority on the processor LP, respectively. Based on this view, previously we have generalized a task's blocking behavioral model, as spinning at any arbitrary priority level. In this paper, we focus on a particular class of spin-lock protocols from the introduced flexible spin-lock model where spinning is performed at a priority equal to or higher than the highest local ceiling of the global resources accessed on a processor referred to as CP spin-lock approach. In this paper, we assume that all tasks of a specific processor are spinning on the same priority level. Given this class and assumption, we show that there exists a spin-lock protocol in this range that dominates the classic spin-lock protocol which tasks spin on highest priority level (HP). However we show that this new approach is incomparable with the CP spin-lock approach. Moreover, we show that there may exist an intermediate spin-lock approach between the priority used by CP spin-lock approach and the new introduced spin-lock approach that can make a task set schedulable when those two cannot. We provide an extensive evaluation results comparing the HP, CP and the new proposed approach.

  • 431.
    Aftab, Obaid
    et al.
    Uppsala universitet, Medicinska och farmaceutiska vetenskapsområdet, Medicinska fakulteten, Institutionen för medicinska vetenskaper, Cancerfarmakologi och beräkningsmedicin.
    Fryknäs, Mårten
    Uppsala universitet, Medicinska och farmaceutiska vetenskapsområdet, Medicinska fakulteten, Institutionen för medicinska vetenskaper, Cancerfarmakologi och beräkningsmedicin.
    Hammerling, Ulf
    Uppsala universitet, Medicinska och farmaceutiska vetenskapsområdet, Medicinska fakulteten, Institutionen för medicinska vetenskaper, Cancerfarmakologi och beräkningsmedicin.
    Larsson, Rolf
    Uppsala universitet, Medicinska och farmaceutiska vetenskapsområdet, Medicinska fakulteten, Institutionen för medicinska vetenskaper, Cancerfarmakologi och beräkningsmedicin.
    Gustafsson, Mats
    Uppsala universitet, Medicinska och farmaceutiska vetenskapsområdet, Medicinska fakulteten, Institutionen för medicinska vetenskaper, Cancerfarmakologi och beräkningsmedicin.
    Detection of cell aggregation and altered cell viability by automated label-free video microscopy: A promising alternative to endpoint viability assays in high throughput screening2015Ingår i: Journal of Biomolecular Screening, ISSN 1087-0571, E-ISSN 1552-454X, Vol. 20, nr 3, s. 372-381Artikel i tidskrift (Refereegranskat)
    Abstract [en]

    Automated phase-contrast video microscopy now makes it feasible to monitor a high-throughput (HT) screening experiment in a 384-well microtiter plate format by collecting one time-lapse video per well. Being a very cost-effective and label-free monitoring method, its potential as an alternative to cell viability assays was evaluated. Three simple morphology feature extraction and comparison algorithms were developed and implemented for analysis of differentially time-evolving morphologies (DTEMs) monitored in phase-contrast microscopy videos. The most promising layout, pixel histogram hierarchy comparison (PHHC), was able to detect several compounds that did not induce any significant change in cell viability, but made the cell population appear as spheroidal cell aggregates. According to recent reports, all these compounds seem to be involved in inhibition of platelet-derived growth factor receptor (PDGFR) signaling. Thus, automated quantification of DTEM (AQDTEM) holds strong promise as an alternative or complement to viability assays in HT in vitro screening of chemical compounds.

  • 432.
    Aftab, Obaid
    et al.
    Uppsala universitet, Medicinska och farmaceutiska vetenskapsområdet, Medicinska fakulteten, Institutionen för medicinska vetenskaper, Cancerfarmakologi och beräkningsmedicin.
    Fryknäs, Mårten
    Uppsala universitet, Medicinska och farmaceutiska vetenskapsområdet, Medicinska fakulteten, Institutionen för medicinska vetenskaper, Cancerfarmakologi och beräkningsmedicin.
    Hassan, Saadia
    Uppsala universitet, Medicinska och farmaceutiska vetenskapsområdet, Medicinska fakulteten, Institutionen för medicinska vetenskaper, Cancerfarmakologi och beräkningsmedicin.
    Nygren, Peter
    Uppsala universitet, Medicinska och farmaceutiska vetenskapsområdet, Medicinska fakulteten, Institutionen för radiologi, onkologi och strålningsvetenskap, Enheten för onkologi.
    Larsson, Rolf
    Uppsala universitet, Medicinska och farmaceutiska vetenskapsområdet, Medicinska fakulteten, Institutionen för medicinska vetenskaper, Cancerfarmakologi och beräkningsmedicin.
    Hammerling, Ulf
    Uppsala universitet, Medicinska och farmaceutiska vetenskapsområdet, Medicinska fakulteten, Institutionen för medicinska vetenskaper, Cancerfarmakologi och beräkningsmedicin.
    Gustafsson, Mats
    Uppsala universitet, Medicinska och farmaceutiska vetenskapsområdet, Medicinska fakulteten, Institutionen för medicinska vetenskaper, Cancerfarmakologi och beräkningsmedicin.
    Label free quantification of time evolving morphologies using time-lapse video microscopy enables identity control of cell lines and discovery of chemically induced differential activity in iso-genic cell line pairs2015Ingår i: Chemometrics and Intelligent Laboratory Systems, ISSN 0169-7439, E-ISSN 1873-3239, Vol. 141, s. 24-32Artikel i tidskrift (Refereegranskat)
    Abstract [en]

    Label free time-lapse video microscopy based monitoring of time evolving cell population morphology has potential to offer a simple and cost effective method for identity control of cell lines. Such morphology monitoring also has potential to offer discovery of chemically induced differential changes between pairs of cell lines of interest, for example where one in a pair of cell lines is normal/sensitive and the other malignant/resistant. A new simple algorithm, pixel histogram hierarchy comparison (PHHC), for comparison of time evolving morphologies (TEM) in phase contrast time-lapse microscopy movies was applied to a set of 10 different cell lines and three different iso-genic colon cancer cell line pairs, each pair being genetically identical except for a single mutation. PHHC quantifies differences in morphology by comparing pixel histogram intensities at six different resolutions. Unsupervised clustering and machine learning based classification methods were found to accurately identify cell lines, including their respective iso-genic variants, through time-evolving morphology. Using this experimental setting, drugs with differential activity in iso-genic cell line pairs were likewise identified. Thus, this is a cost effective and expedient alternative to conventional molecular profiling techniques and might be useful as part of the quality control in research incorporating cell line models, e.g. in any cell/tumor biology or toxicology project involving drug/agent differential activity in pairs of cell line models.

  • 433.
    Aftarczuk, Kamila
    Blekinge Tekniska Högskola, Sektionen för teknik, Avdelningen för programvarusystem.
    Evaluation of selected data mining algorithms implemented in Medical Decision Support Systems2007Självständigt arbete på avancerad nivå (magisterexamen)Studentuppsats (Examensarbete)
    Abstract [en]

    The goal of this master’s thesis is to identify and evaluate data mining algorithms which are commonly implemented in modern Medical Decision Support Systems (MDSS). They are used in various healthcare units all over the world. These institutions store large amounts of medical data. This data may contain relevant medical information hidden in various patterns buried among the records. Within the research several popular MDSS’s are analyzed in order to determine the most common data mining algorithms utilized by them. Three algorithms have been identified: Naïve Bayes, Multilayer Perceptron and C4.5. Prior to the very analyses the algorithms are calibrated. Several testing configurations are tested in order to determine the best setting for the algorithms. Afterwards, an ultimate comparison of the algorithms orders them with respect to their performance. The evaluation is based on a set of performance metrics. The analyses are conducted in WEKA on five UCI medical datasets: breast cancer, hepatitis, heart disease, dermatology disease, diabetes. The analyses have shown that it is very difficult to name a single data mining algorithm to be the most suitable for the medical data. The results gained for the algorithms were very similar. However, the final evaluation of the outcomes allowed singling out the Naïve Bayes to be the best classifier for the given domain. It was followed by the Multilayer Perceptron and the C4.5.

  • 434.
    Afyounian, Ebrahim
    Linnéuniversitetet, Fakulteten för teknik (FTK), Institutionen för informatik (IK).
    Information and Communication Technologies in Support of Remembering: A Postphenomenological Study2014Självständigt arbete på avancerad nivå (masterexamen), 20 poäng / 30 hpStudentuppsats (Examensarbete)
    Abstract [en]

    This thesis aimed to study the everyday use of ICT-enabled memory aids in order to understand and to describe the technological mediations that are brought by them (i.e. how they shape/mediate experiences and actions of their users). To do this, a post-phenomenological approach was appropriated. Postphenomenology is a modified, hybrid phenomenology that tries to overcome the limitations of phenomenology. As for theoretical framework, ‘Technological Mediation’ was adopted to conduct the study. Technological Mediation as a theory provides concepts suitable for explorations of the phenomenon of human-technology relation.

    It was believed that this specific choice of approach and theoretical framework would provide a new way of exploring the use of concrete technologies in everyday life of human beings and the implications that this use might have on humans’ lives. The study was conducted in the city of Växjö, Sweden. Data was collected by conducting twelve face-to-face semi-structured interviews. Collected data was, then, analyzed by applying the concepts within the theoretical framework – Technological Mediation - to them.

    The results of this study provided a list of ICT-enabled devices and services that participants were using in their everyday life in order to support their memory such as: calendars, alarms, notes, bookmarks, etc. Furthermore, this study resulted in a detailed description of how these devices and services shaped/mediated the experiences and the actions of their users. 

  • 435.
    Afzal, Muhammad
    Högskolan i Jönköping, Tekniska Högskolan, JTH, Data- och elektroteknik.
    Modelling temporal aspects of healthcare processes with Ontologies2010Självständigt arbete på avancerad nivå (masterexamen), 20 poäng / 30 hpStudentuppsats (Examensarbete)
    Abstract [en]

    This thesis represents the ontological model for the Time Aspects for a Healthcare Organization. It provides information about activities which take place at different interval of time at Ryhov Hospital. These activities are series of actions which may be happen in predefined sequence and at predefined times or may be happen at any time in a General ward or in Emergency ward of a Ryhov Hospital.

    For achieving above mentioned objective, our supervisor conducts a workshop at the start of thesis. In this workshop, the domain experts explain the main idea of ward activities. From this workshop; the author got a lot of knowledge about activities and time aspects. After this, the author start literature review for achieving valuable knowledge about ward activities, time aspects and also methodology steps which are essentials for ontological model. After developing ontological model for Time Aspects, our supervisor also conducts a second workshop. In this workshop, the author presents the model for evaluation purpose.

  • 436. Afzal, Wasif
    Lessons from applying experimentation in software engineering prediction systems2008Konferensbidrag (Refereegranskat)
    Abstract [en]

    Within software engineering prediction systems, experiments are undertaken primarliy to investigate relationships and to measure/compare models' accuracy. This paper discusses our experience and presents useful lessons/guidelines in experimenting with software engineering prediction systems. For this purpose, we use a typical software engineering experimentation process as a baseline. We found that the typical software engineering experimentation process in software engineering is supportive in developing prediction systems and have highlighted issues more central to the domain of software engineering prediction systems.

  • 437.
    Afzal, Wasif
    Blekinge Tekniska Högskola, Sektionen för teknik, Avdelningen för programvarusystem.
    Metrics in Software Test Planning and Test Design Processes2007Självständigt arbete på avancerad nivå (magisterexamen)Studentuppsats (Examensarbete)
    Abstract [en]

    Software metrics plays an important role in measuring attributes that are critical to the success of a software project. Measurement of these attributes helps to make the characteristics and relationships between the attributes clearer. This in turn supports informed decision making. The field of software engineering is affected by infrequent, incomplete and inconsistent measurements. Software testing is an integral part of software development, providing opportunities for measurement of process attributes. The measurement of software testing process attributes enables the management to have better insight in to the software testing process. The aim of this thesis is to investigate the metric support for software test planning and test design processes. The study comprises of an extensive literature study and follows a methodical approach. This approach consists of two steps. The first step comprises of analyzing key phases in software testing life cycle, inputs required for starting the software test planning and design processes and metrics indicating the end of software test planning and test design processes. After establishing a basic understanding of the related concepts, the second step identifies the attributes of software test planning and test design processes including metric support for each of the identified attributes. The results of the literature survey showed that there are a number of different measurable attributes for software test planning and test design processes. The study partitioned these attributes in multiple categories for software test planning and test design processes. For each of these attributes, different existing measurements are studied. A consolidation of these measurements is presented in this thesis which is intended to provide an opportunity for management to consider improvement in these processes.

  • 438. Afzal, Wasif
    Search-based approaches to software fault prediction and software testing2009Licentiatavhandling, sammanläggning (Övrigt vetenskapligt)
    Abstract [en]

    Software verification and validation activities are essential for software quality but also constitute a large part of software development costs. Therefore efficient and cost-effective software verification and validation activities are both a priority and a necessity considering the pressure to decrease time-to-market and intense competition faced by many, if not all, companies today. It is then perhaps not unexpected that decisions related to software quality, when to stop testing, testing schedule and testing resource allocation needs to be as accurate as possible. This thesis investigates the application of search-based techniques within two activities of software verification and validation: Software fault prediction and software testing for non-functional system properties. Software fault prediction modeling can provide support for making important decisions as outlined above. In this thesis we empirically evaluate symbolic regression using genetic programming (a search-based technique) as a potential method for software fault predictions. Using data sets from both industrial and open-source software, the strengths and weaknesses of applying symbolic regression in genetic programming are evaluated against competitive techniques. In addition to software fault prediction this thesis also consolidates available research into predictive modeling of other attributes by applying symbolic regression in genetic programming, thus presenting a broader perspective. As an extension to the application of search-based techniques within software verification and validation this thesis further investigates the extent of application of search-based techniques for testing non-functional system properties. Based on the research findings in this thesis it can be concluded that applying symbolic regression in genetic programming may be a viable technique for software fault prediction. We additionally seek literature evidence where other search-based techniques are applied for testing of non-functional system properties, hence contributing towards the growing application of search-based techniques in diverse activities within software verification and validation.

  • 439. Afzal, Wasif
    Search-Based Prediction of Software Quality: Evaluations and Comparisons2011Doktorsavhandling, sammanläggning (Övrigt vetenskapligt)
    Abstract [en]

    Software verification and validation (V&V) activities are critical for achieving software quality; however, these activities also constitute a large part of the costs when developing software. Therefore efficient and effective software V&V activities are both a priority and a necessity considering the pressure to decrease time-to-market and the intense competition faced by many, if not all, companies today. It is then perhaps not unexpected that decisions that affects software quality, e.g., how to allocate testing resources, develop testing schedules and to decide when to stop testing, needs to be as stable and accurate as possible. The objective of this thesis is to investigate how search-based techniques can support decision-making and help control variation in software V&V activities, thereby indirectly improving software quality. Several themes in providing this support are investigated: predicting reliability of future software versions based on fault history; fault prediction to improve test phase efficiency; assignment of resources to fixing faults; and distinguishing fault-prone software modules from non-faulty ones. A common element in these investigations is the use of search-based techniques, often also called metaheuristic techniques, for supporting the V&V decision-making processes. Search-based techniques are promising since, as many problems in real world, software V&V can be formulated as optimization problems where near optimal solutions are often good enough. Moreover, these techniques are general optimization solutions that can potentially be applied across a larger variety of decision-making situations than other existing alternatives. Apart from presenting the current state of the art, in the form of a systematic literature review, and doing comparative evaluations of a variety of metaheuristic techniques on large-scale projects (both industrial and open-source), this thesis also presents methodological investigations using search-based techniques that are relevant to the task of software quality measurement and prediction. The results of applying search-based techniques in large-scale projects, while investigating a variety of research themes, show that they consistently give competitive results in comparison with existing techniques. Based on the research findings, we conclude that search-based techniques are viable techniques to use in supporting the decision-making processes within software V&V activities. The accuracy and consistency of these techniques make them important tools when developing future decision-support for effective management of software V&V activities.

  • 440. Afzal, Wasif
    Using faults-slip-through metric as a predictor of fault-proneness2010Konferensbidrag (Refereegranskat)
    Abstract [en]

    The majority of software faults are present in small number of modules, therefore accurate prediction of fault-prone modules helps improve software quality by focusing testing efforts on a subset of modules. This paper evaluates the use of the faults-slip-through (FST) metric as a potential predictor of fault-prone modules. Rather than predicting the fault-prone modules for the complete test phase, the prediction is done at the specific test levels of integration and system test. We applied eight classification techniques to the task of identifying fault-prone modules, representing a variety of approaches, including a standard statistical technique for classification (logistic regression), tree-structured classifiers (C4.5 and random forests), a Bayesian technique (Na\"{i}ve Bayes), machine-learning techniques (support vector machines and back-propagation artificial neural networks) and search-based techniques (genetic programming and artificial immune recognition systems) on FST data collected from two large industrial projects from the telecommunication domain. \emph{Results:} Using area under the receiver operating characteristic (ROC) curve and the location of (PF, PD) pairs in the ROC space, GP showed impressive results in comparison with other techniques for predicting fault-prone modules at both integration and system test levels. The use of faults-slip-through metric in general provided good prediction results at the two test levels. The accuracy of GP is statistically significant in comparison with majority of the techniques for predicting fault-prone modules at integration and system test levels. (ii) Faults-slip-through metric has the potential to be a generally useful predictor of fault-proneness at integration and system test levels.

  • 441.
    Afzal, Wasif
    et al.
    Mälardalens högskola, Akademin för innovation, design och teknik, Inbyggda system.
    Bruneliere, H.
    IMT Atlantique – LS2N (CNRS) – ARMINES, France.
    Di Ruscio, D.
    Università degli Studi dell'Aquila - DISIM | Center of Excellence DEWS, Italy.
    Sadovykh, A.
    Softeam, France.
    Mazzini, S.
    Intecs, Italy.
    Cariou, E.
    Université de Pau et des Pays de l'Adour, LIUPPA, France.
    Truscan, D.
    Åbo Akademi University, Finland.
    Cabot, J.
    ICREA, Spain.
    Gómez, A.
    Internet Interdisciplinary Institute (IN3), Universitat Oberta de Catalunya (UOC), Spain.
    Gorroñogoitia, J.
    ATOS, Spain.
    Pomante, L.
    Università degli Studi dell'Aquila - DISIM | Center of Excellence DEWS, Italy.
    Smrz, P.
    Brno University of Technology, Czech Republic.
    The MegaM@Rt2 ECSEL project: MegaModelling at Runtime – Scalable model-based framework for continuous development and runtime validation of complex systems2018Ingår i: Microprocessors and microsystems, ISSN 0141-9331, E-ISSN 1872-9436, Vol. 61, s. 86-95Artikel i tidskrift (Refereegranskat)
    Abstract [en]

    A major challenge for the European electronic industry is to enhance productivity by ensuring quality of development, integration and maintenance while reducing the associated costs. Model-Driven Engineering (MDE) principles and techniques have already shown promising capabilities, but they still need to scale up to support real-world scenarios implied by the full deployment and use of complex electronic components and systems. Moreover, maintaining efficient traceability, integration, and communication between two fundamental system life cycle phases (design time and runtime) is another challenge requiring the scalability of MDE. This paper presents an overview of the ECSEL 1 project entitled “MegaModelling at runtime – Scalable model-based framework for continuous development and runtime validation of complex systems” (MegaM@Rt2), whose aim is to address the above mentioned challenges facing MDE. Driven by both large and small industrial enterprises, with the support of research partners and technology providers, MegaM@Rt2 aims to deliver a framework of tools and methods for: 1) system engineering/design and continuous development, 2) related runtime analysis and 3) global models and traceability management. Diverse industrial use cases (covering strategic domains such as aeronautics, railway, construction and telecommunications) will integrate and demonstrate the validity of the MegaM@Rt2 solution. This paper provides an overview of the MegaM@Rt2 project with respect to its approach, mission, objectives as well as to its implementation details. It further introduces the consortium as well as describes the work packages and few already produced deliverables.

  • 442.
    Afzal, Wasif
    et al.
    Mälardalens högskola, Akademin för innovation, design och teknik, Inbyggda system.
    Caporuscio, M.
    Linnaeus University, Sweden.
    Conboy, H.
    University of Massachusetts Amherst, MA, United States.
    Di Marco, A.
    University of l'Aquila, Italy.
    Duchien, D. L.
    University of Lille, France.
    Pérez, D.
    University of British Columbia, Canada.
    Seceleanu, C.
    Kyushu University, Japan.
    Shahbazian, A.
    University of California, Berkeley, CA, United States.
    Spalazzese, R.
    Microsoft, WA, United States.
    Tivoli, M.
    Florida State University, FL, United States.
    Vasilescu, B.
    University College Dublin and Lero, Ireland.
    Washizaki, H
    Mälardalens högskola.
    Weyns, D.
    University of Southern California, CA, United States.
    Pasquale, L.
    Malmö University, Sweden.
    Nistor, A.
    Malmö University, Sweden.
    Muşlu, K.
    Waseda University, Japan.
    Kamei, Y.
    Waseda University, Japan.
    Hanam, Q.
    Carnegie Mellon University, PA, United States.
    Ying, A. T. T.
    Katholieke Universiteit Leuven, Belgium.
    Program committee for icse 2018 posters track2018Ingår i: Proceedings / International Conference of Software Engineering, ISSN 0270-5257, E-ISSN 1558-1225, Vol. Part F137351Artikel i tidskrift (Refereegranskat)
  • 443. Afzal, Wasif
    et al.
    Ghazi, Ahmad Nauman
    Blekinge Tekniska Högskola, Fakulteten för datavetenskaper, Institutionen för programvaruteknik.
    Itkonen, Juha
    Torkar, Richard
    Blekinge Tekniska Högskola, Fakulteten för datavetenskaper, Institutionen för programvaruteknik.
    Andrews, Anneliese
    Bhatti, Khurram
    An experiment on the effectiveness and efficiency of exploratory testing2015Ingår i: Empirical Software Engineering, ISSN 1382-3256, Vol. 20, nr 3, s. 844-878Artikel i tidskrift (Refereegranskat)
    Abstract [en]

    The exploratory testing (ET) approach is commonly applied in industry, but lacks scientific research. The scientific community needs quantitative results on the performance of ET taken from realistic experimental settings. The objective of this paper is to quantify the effectiveness and efficiency of ET vs. testing with documented test cases (test case based testing, TCT). We performed four controlled experiments where a total of 24 practitioners and 46 students performed manual functional testing using ET and TCT. We measured the number of identified defects in the 90-minute testing sessions, the detection difficulty, severity and types of the detected defects, and the number of false defect reports. The results show that ET found a significantly greater number of defects. ET also found significantly more defects of varying levels of difficulty, types and severity levels. However, the two testing approaches did not differ significantly in terms of the number of false defect reports submitted. We conclude that ET was more efficient than TCT in our experiment. ET was also more effective than TCT when detection difficulty, type of defects and severity levels are considered. The two approaches are comparable when it comes to the number of false defect reports submitted.

  • 444.
    Afzal, Wasif
    et al.
    Mälardalens högskola, Akademin för innovation, design och teknik, Inbyggda system.
    Ghazi, Nauman
    Blekinge Institute of Technolog.
    Itkonen, Juha
    Aalto University, Espoo, Finland.
    Torkar, Richard
    Chalmers University of Technology.
    Andrews, Anneliese
    University of Denver, USA.
    Bhatti, Khurram
    Blekinge Institute of Technolog.
    An experiment on the effectiveness and efficiency of exploratory testing2015Ingår i: Journal of Empirical Software Engineering, ISSN 1382-3256, E-ISSN 1573-7616, Vol. 20, nr 3, s. 844-878Artikel i tidskrift (Refereegranskat)
    Abstract [en]

    The exploratory testing (ET) approach is commonly applied in industry, but lacks scientific research. The scientific community needs quantitative results on the performance of ET taken from realistic experimental settings. The objective of this paper is to quantify the effectiveness and efficiency of ET vs. testing with documented test cases (test case based testing, TCT). We performed four controlled experiments where a total of 24 practitioners and 46 students performed manual functional testing using ET and TCT. We measured the number of identified defects in the 90-minute testing sessions, the detection difficulty, severity and types of the detected defects, and the number of false defect reports. The results show that ET found a significantly greater number of defects. ET also found significantly more defects of varying levels of difficulty, types and severity levels. However, the two testing approaches did not differ significantly in terms of the number of false defect reports submitted. We conclude that ET was more efficient than TCT in our experiment. ET was also more effective than TCT when detection difficulty, type of defects and severity levels are considered. The two approaches are comparable when it comes to the number of false defect reports submitted.

  • 445. Afzal, Wasif
    et al.
    Torkar, Richard
    A Comparative Evaluation of Using Genetic Programming for Predicting Fault Count Data2008Konferensbidrag (Refereegranskat)
    Abstract [en]

    There have been a number of software reliability growth models (SRGMs) proposed in literature. Due to several reasons, such as violation of models' assumptions and complexity of models, the practitioners face difficulties in knowing which models to apply in practice. This paper presents a comparative evaluation of traditional models and use of genetic programming (GP) for modeling software reliability growth based on weekly fault count data of three different industrial projects. The motivation of using a GP approach is its ability to evolve a model based entirely on prior data without the need of making underlying assumptions. The results show the strengths of using GP for predicting fault count data.

  • 446.
    Afzal, Wasif
    et al.
    Blekinge Tekniska Högskola, Sektionen för teknik, Avdelningen för programvarusystem.
    Torkar, Richard
    Blekinge Tekniska Högskola, Sektionen för teknik, Avdelningen för programvarusystem.
    Incorporating Metrics in an Organizational Test Strategy2008Konferensbidrag (Refereegranskat)
    Abstract [en]

    An organizational level test strategy needs to incorporate metrics to make the testing activities visible and available to process improvements. The majority of testing measurements that are done are based on faults found in the test execution phase. In contrast, this paper investigates metrics to support software test planning and test design processes. We have assembled metrics in these two process types to support management in carrying out evidence-based test process improvements and to incorporate suitable metrics as part of an organization level test strategy. The study is composed of two steps. The first step creates a relevant context by analyzing key phases in the software testing lifecycle, while the second step identifies the attributes of software test planning and test design processes along with metric(s) support for each of the identified attributes.

  • 447. Afzal, Wasif
    et al.
    Torkar, Richard
    On the application of genetic programming for software engineering predictive modeling: A systematic review2011Ingår i: Expert Systems with Applications, ISSN 0957-4174 , Vol. 38, nr 9, s. 11984-11997Artikel, forskningsöversikt (Refereegranskat)
    Abstract [en]

    The objective of this paper is to investigate the evidence for symbolic regression using genetic programming (GP) being an effective method for prediction and estimation in software engineering, when compared with regression/machine learning models and other comparison groups (including comparisons with different improvements over the standard GP algorithm). We performed a systematic review of literature that compared genetic programming models with comparative techniques based on different independent project variables. A total of 23 primary studies were obtained after searching different information sources in the time span 1995-2008. The results of the review show that symbolic regression using genetic programming has been applied in three domains within software engineering predictive modeling: (i) Software quality classification (eight primary studies). (ii) Software cost/effort/size estimation (seven primary studies). (iii) Software fault prediction/software reliability growth modeling (eight primary studies). While there is evidence in support of using genetic programming for software quality classification, software fault prediction and software reliability growth modeling: the results are inconclusive for software cost/effort/size estimation.

  • 448. Afzal, Wasif
    et al.
    Torkar, Richard
    Suitability of Genetic Programming for Software Reliability Growth Modeling2008Konferensbidrag (Refereegranskat)
    Abstract [en]

    Genetic programming (GP) has been found to be effective in finding a model that fits the given data points without making any assumptions about the model structure. This makes GP a reasonable choice for software reliability growth modeling. This paper discusses the suitability of using GP for software reliability growth modeling and highlights the mechanisms that enable GP to progressively search for fitter solutions.

  • 449. Afzal, Wasif
    et al.
    Torkar, Richard
    Blekinge Tekniska Högskola, Fakulteten för datavetenskaper, Institutionen för programvaruteknik.
    Towards benchmarking feature subset selection methods for software fault prediction2016Ingår i: Studies in Computational Intelligence, Springer, 2016, 617, Vol. 617, s. 33-58Kapitel i bok, del av antologi (Refereegranskat)
    Abstract [en]

    Despite the general acceptance that software engineering datasets often contain noisy, irrelevant or redundant variables, very few benchmark studies of feature subset selection (FSS) methods on real-life data from software projects have been conducted. This paper provides an empirical comparison of state-of-the-art FSS methods: information gain attribute ranking (IG); Relief (RLF); principal component analysis (PCA); correlation-based feature selection (CFS); consistencybased subset evaluation (CNS); wrapper subset evaluation (WRP); and an evolutionary computation method, genetic programming (GP), on five fault prediction datasets from the PROMISE data repository. For all the datasets, the area under the receiver operating characteristic curve—the AUC value averaged over 10-fold cross-validation runs—was calculated for each FSS method-dataset combination before and after FSS. Two diverse learning algorithms, C4.5 and naïve Bayes (NB) are used to test the attribute sets given by each FSS method. The results show that although there are no statistically significant differences between the AUC values for the different FSS methods for both C4.5 and NB, a smaller set of FSS methods (IG, RLF, GP) consistently select fewer attributes without degrading classification accuracy. We conclude that in general, FSS is beneficial as it helps improve classification accuracy of NB and C4.5. There is no single best FSS method for all datasets but IG, RLF and GP consistently select fewer attributes without degrading classification accuracy within statistically significant boundaries. © Springer International Publishing Switzerland 2016.

  • 450.
    Afzal, Wasif
    et al.
    Mälardalens högskola, Akademin för innovation, design och teknik, Inbyggda system. Bahria University, Islamabad, Pakistan .
    Torkar, Richard
    Blekinge Institute of Technology, Karlskrona, Sweden; Chalmers University of Technology, Sweden.
    Towards benchmarking feature subset selection methods for software fault prediction2016Ingår i: Computational Intelligence and Quantitative Software Engineering / [ed] Witold Pedrycz, Giancarlo Succi and Alberto Sillitti, Springer-Verlag , 2016, s. 33-58Kapitel i bok, del av antologi (Övrigt vetenskapligt)
    Abstract [en]

    Despite the general acceptance that software engineering datasets often contain noisy, irrele- vant or redundant variables, very few benchmark studies of feature subset selection (FSS) methods on real-life data from software projects have been conducted. This paper provides an empirical comparison of state-of-the-art FSS methods: information gain attribute ranking (IG); Relief (RLF); principal com- ponent analysis (PCA); correlation-based feature selection (CFS); consistency-based subset evaluation (CNS); wrapper subset evaluation (WRP); and an evolutionary computation method, genetic program- ming (GP), on five fault prediction datasets from the PROMISE data repository. For all the datasets, the area under the receiver operating characteristic curve—the AUC value averaged over 10-fold cross- validation runs—was calculated for each FSS method-dataset combination before and after FSS. Two diverse learning algorithms, C4.5 and na ??ve Bayes (NB) are used to test the attribute sets given by each FSS method. The results show that although there are no statistically significant differences between the AUC values for the different FSS methods for both C4.5 and NB, a smaller set of FSS methods (IG, RLF, GP) consistently select fewer attributes without degrading classification accuracy. We conclude that in general, FSS is beneficial as it helps improve classification accuracy of NB and C4.5. There is no single best FSS method for all datasets but IG, RLF and GP consistently select fewer attributes without degrading classification accuracy within statistically significant boundaries.

6789101112 401 - 450 av 50637
RefereraExporteraLänk till träfflistan
Permanent länk
Referera
Referensformat
  • apa
  • 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