liu.seSearch for publications in DiVA
Change search
Refine search result
1234567 1 - 50 of 5517
CiteExportLink to result list
Permanent link
Cite
Citation style
  • apa
  • harvard1
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • oxford
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf
Rows per page
  • 5
  • 10
  • 20
  • 50
  • 100
  • 250
Sort
  • Standard (Relevance)
  • Author A-Ö
  • Author Ö-A
  • Title A-Ö
  • Title Ö-A
  • Publication type A-Ö
  • Publication type Ö-A
  • Issued (Oldest first)
  • Issued (Newest first)
  • Created (Oldest first)
  • Created (Newest first)
  • Last updated (Oldest first)
  • Last updated (Newest first)
  • Standard (Relevance)
  • Author A-Ö
  • Author Ö-A
  • Title A-Ö
  • Title Ö-A
  • Publication type A-Ö
  • Publication type Ö-A
  • Issued (Oldest first)
  • Issued (Newest first)
  • Created (Oldest first)
  • Created (Newest first)
  • Last updated (Oldest first)
  • Last updated (Newest first)
Select
The maximal number of hits you can export is 250. When you want to export more records please use the 'Create feeds' function.
  • 1.
    Abadir Guirgis, Georg
    Linköping University, Department of Computer and Information Science.
    Lärarperspektiv på riskutbildningen för motorcyklister2011Independent thesis Basic level (degree of Bachelor), 12 credits / 18 HE creditsStudent thesis
    Abstract [sv]

    Under det senaste decenniet har det i Sverige blivit allt populärare att åka motorcykel. Enobligatorisk riskutbildning för behörighet A och A1 infördes från och med den 1 november2009. Då riskutbildningen är ny har få utvärderingar gjorts.Denna studie utvärderar riskutbildningen för motorcyklister utifrån trafikskolläraresperspektiv. Målet har varit att sammanställa synpunkter och erfarenheter från lärarna påutbildningen. Ett ytterligare mål har varit att undersöka trafikskollärarnas upplevda effekter avutbildningen på elevers trafikbeteende. Sex semistrukturerade intervjuer med trafikskolläraresamt en observationsstudie på olika trafikskolor genomfördes. Utöver detta genomfördesdeltagande observation av en fortbildning där 15 trafikskollärare deltog. Resultatet frånstudien visar att lärarna anser att behovet av riskutbildningen är stort och attimplementationen av den nya riskutbildningen gått bra. Förutom att elever efter utbildningenrefererar till den, vilket enligt lärarna indikerar att de tagit till sig vad som sagts, märks det nui större utsträckning än tidigare att elever kör lugnare och tänker sig mer för i vissasituationer. Detta påtalades vara ett klart önskvärt resultat.

  • 2.
    Abadir Guirgis, Georg
    Linköping University, Department of Computer and Information Science. Linköping University, Faculty of Arts and Sciences.
    Mindre energi och rätt tid: Utvärdering av utbildning och träning för lokförare i energieffektiv körning – en simulatorstudie2013Independent thesis Advanced level (degree of Master (Two Years)), 20 credits / 30 HE creditsStudent thesis
    Abstract [en]

    During the 80’s, the first train simulator was introduced in Swedish train driver education and is still the only full scale simulator being used to educate train drivers in Sweden. The reason for this seems to be a lack of educational and economic motives for an expanded usage of simulators within education and training. Energy savings within the railway domain, i.e. energy-efficient driving, is currently a topic for all train operators in Sweden. Some operators already educate their drivers in energy efficient driving and tests of energy efficiency in real traffic has shown a potential energy saving of 16 %, after drivers have completed a theoretical education in energy-efficient driving. Because there were some uncertainties in the data from the tests carried out in real traffic, where conditions and experimental procedures varied between the drivers and it also turned out that education and access to a support system while driving resulted in a small saving in energy (13 %) there was a need to examine the potential savings under controlled conditions. Therefore, a study was conducted using a train simulator. In the simulator, the researcher has full control over the data and conditions are the same for all drivers. The simulator used in the study was developed by VTI (Swedish National Road and Transport Research Institute) and modeled after an X50 Regina. The purpose of this study was to investigate whether the same theoretical education in energy-efficient driving, in combination with simulator training under ideal conditions, could contribute to the same, or better energy saving compared to the results of the tests from real traffic. Furthermore, the effect of feedback during training with regard to energy savings was also investigated. 24 train driver students were divided into three groups with 8 students in each. Two of these groups completed two sessions (reference and test session) with theoretical education and simulator training between the sessions. The last group (control group) completed two sessions (reference and test session) without education and training between the sessions. The two groups that were given theoretical education conducted their simulator training under two different conditions, where one group trained with feedback (energy consumption and rail gradient) and the other group trained without feedback. It turns out that a theoretical education in energy efficient driving, combined with 30 minutes of simulator training, resulted in a total saving of about 24 % energy for both groups. Also, considering that the control group improved their energy consumption by simply driving the simulator two times (8 % total energy saving), the energy saving was almost equal to the result of the tests in real traffic. Since the results were equal even though the conditions differed, there is reason to investigate how different driving conditions affect the outcome. There is also a need to better understand why education in combination with a support system resulted in a lower energy saving than for those who were only given education during the tests in real traffic, and also why feedback during training in the simulator did not give a detectable effect. Basically, there are many reasons to further investigate how to design simulator training and support systems for train drivers. In addition to the energy savings, the results showed that drivers improved their arrival times i.e. arrive more accurate in relation to the time table. The results suggest that there is great potential for train simulators in the Swedish train driver education, both for training and for evaluating the effects of the training.

  • 3.
    Abbas, Muhammad Hassan
    et al.
    Linköping University, Department of Computer and Information Science.
    Khan, Mati-ur-Rehman
    Linköping University, Department of Computer and Information Science.
    Correlational Analysis of Drivers Personality Traits and Styles in a Distributed Simulated Driving Environment2007Independent thesis Basic level (professional degree), 20 credits / 30 HE creditsStudent thesis
    Abstract [en]

    In this thesis report we conducted research study on driver's behavior in T-Intersections using simulated environment. This report describes and discusses correlation analysis of driver's personality traits and style while driving at T-Intersections.

    The experiments were performed on multi user driving simulator under controlled settings, at Linköping University. A total of forty-eight people participated in the study and were divided into groups of four, all driving in the same simulated world.

    During the experiments participants were asked to fill a series of well-known self-report questionnaires. We evaluated questionnaires to get the insight in driver's personality traits and driving style. The self-report questionnaires consist of Schwartz's configural model of 10 values types and NEO-five factor inventory. Also driver's behavior was studied with the help of questionnaires based on driver's behavior, style, conflict avoidance, time horizon and tolerance of uncertainty. Then these 10 Schwartz's values are correlated with the other questionnaires to give the detail insight of the driving habits and personality traits of the drivers.

  • 4.
    Abbas, Qaisar
    et al.
    Uppsala universitet, Avdelningen för teknisk databehandling.
    Nordström, Jan
    Uppsala universitet, Avdelningen för teknisk databehandling.
    Weak versus Strong No-Slip Boundary Conditions for the Navier-Stokes Equations2008In: Proc. 6th South African Conference on Computational and Applied Mechanics, South African Association for Theoretical and Applied Mechanics , 2008, 52-62 p.Conference paper (Other academic)
  • 5.
    Abbas, Qaisar
    et al.
    Uppsala universitet, Avdelningen för teknisk databehandling.
    Nordström, Jan
    Uppsala universitet, Avdelningen för teknisk databehandling.
    Weak versus strong no-slip boundary conditions for the Navier-Stokes equations2010In: Engineering Applications of Computational Fluid Mechanics, ISSN 1994-2060, Vol. 4, 29-38 p.Article in journal (Refereed)
  • 6.
    Abbas, Qaisar
    et al.
    Uppsala universitet, Avdelningen för teknisk databehandling.
    van der Weide, Edwin
    Nordström, Jan
    Uppsala universitet, Avdelningen för teknisk databehandling.
    Accurate and stable calculations involving shocks using a new hybrid scheme2009In: Proc. 19th AIAA CFD Conference, AIAA , 2009Conference paper (Refereed)
  • 7.
    Abdolmajid Ahmad, Bookan
    Linköping University, Department of Computer and Information Science. Linköping University, The Institute of Technology.
    Programmering av generativ konst i C# .Net2014Independent thesis Basic level (degree of Bachelor), 180 HE creditsStudent thesis
    Abstract [sv]

    Detta examensarbete utfördes på IDA (Institutionen för datavetenskap) vid Linköpings universitet. 

    Syftet med det här examensarbetet var att utveckla ett program som skulle skapa förutsättningar för generativ konst med hjälp av MyPaint som är ett digitalt rit/målarverktyg. Metoden gick ut på att registrera vad användaren skapat för komponenter, dvs. musinteraktioner och kortkommandon, och därefter använda dem algoritmiskt.

    Examensarbetet resulterades i ett program (SharpArt), som fångar musinteraktioner samt simulerar tangentbordstryckningar (kortkommandon) från och till Mypaint, vilket i sin tur skapar komponenter som används algoritmiskt. Programmet kan även positionera objektet på canvasen enligt det önskade koordinatvärdet.

  • 8.
    Abdulahad, Bassam
    et al.
    Linköping University, Department of Computer and Information Science.
    Lounis, Georgios
    Linköping University, Department of Computer and Information Science.
    A user interface for the ontology merging tool SAMBO2004Independent thesis Basic level (professional degree)Student thesis
    Abstract [en]

    Ontologies have become an important tool for representing data in a structured manner. Merging ontologies allows for the creation of ontologies that later can be composed into larger ontologies as well as for recognizing patterns and similarities between ontologies. Ontologies are being used nowadays in many areas, including bioinformatics. In this thesis, we present a desktop version of SAMBO, a system for merging ontologies that are represented in the languages OWL and DAML+OIL. The system has been developed in the programming language JAVA with JDK (Java Development Kit) 1.4.2. The user can open a file locally or from the network and can merge ontologies using suggestions generated by the SAMBO algorithm. SAMBO provides a user-friendly graphical interface, which guides the user through the merging process.

  • 9.
    Abdulla, Parosh Aziz
    et al.
    Department of Information Technology, Uppsala University, Sweden.
    Atig, Mohamed Faouzi
    Department of Information Technology, Uppsala University, Sweden.
    Chen, Yu-Fang
    Institute of Information Science, Academia Sinica, Taiwan.
    Holik, Lukas
    Faculty of Information Technology, Brno University of Technology, Czech Republic.
    Rezine, Ahmed
    Linköping University, Department of Computer and Information Science, Software and Systems. Linköping University, The Institute of Technology.
    Rümmer, Philipp
    Department of Information Technology, Uppsala University, Sweden.
    Stenman, Jari
    Department of Information Technology, Uppsala University, Sweden.
    String Constraints for Verification2014In: 26th International Conference on Computer Aided Verification (CAV 2014), Vienna, Austria, Jul. 9-12, 2014., Springer, 2014, 150-166 p.Conference paper (Refereed)
    Abstract [en]

    We present a decision procedure for a logic that combines (i) word equations over string variables denoting words of arbitrary lengths, together with (ii) constraints on the length of words, and on (iii) the regular languages to which words belong. Decidability of this general logic is still open. Our procedure is sound for the general logic, and a decision procedure for a particularly rich fragment that restricts the form in which word equations are written. In contrast to many existing procedures, our method does not make assumptions about the maximum length of words. We have developed a prototypical implementation of our decision procedure, and integrated it into a CEGAR-based model checker for the analysis of programs encoded as Horn clauses. Our tool is able to automatically establish the correctness of several programs that are beyond the reach of existing methods.

  • 10.
    Abdulla, Parosh Aziz
    et al.
    Uppsala University, Sweden.
    Atig, Mohamed Faouzi
    Uppsala University, Sweden.
    Chen, Yu-Fang
    Academia Sinica, Taiwan.
    Leonardsson, Carl
    Uppsala University, Sweden.
    Rezine, Ahmed
    Linköping University, Department of Computer and Information Science, Software and Systems. Linköping University, The Institute of Technology.
    Automatic fence insertion in integer programs via predicate abstraction2012In: Static Analysis: 19th International Symposium, SAS 2012, Deauville, France, September 11-13, 2012. Proceedings / [ed] Antoine Miné, David Schmidt, Springer Berlin/Heidelberg, 2012, 164-180 p.Conference paper (Refereed)
    Abstract [en]

    We propose an automatic fence insertion and verification framework for concurrent programs running under relaxed memory. Unlike previous approaches to this problem, which allow only variables of finite domain, we target programs with (unbounded) integer variables. The problem is difficult because it has two different sources of infiniteness: unbounded store buffers and unbounded integer variables. Our framework consists of three main components: (1) a finite abstraction technique for the store buffers, (2) a finite abstraction technique for the integer variables, and (3) a counterexample guided abstraction refinement loop of the model obtained from the combination of the two abstraction techniques. We have implemented a prototype based on the framework and run it successfully on all standard benchmarks together with several challenging examples that are beyond the applicability of existing methods.

  • 11.
    Abdulla, Parosh Aziz
    et al.
    Uppsala University, Sweden.
    Atig, Mohamed Faouzi
    Uppsala University, Sweden.
    Chen, Yu-Fang
    Academia Sinica, Taiwan.
    Leonardsson, Carl
    Uppsala University, Sweden.
    Rezine, Ahmed
    Linköping University, Department of Computer and Information Science, ESLAB - Embedded Systems Laboratory. Linköping University, The Institute of Technology.
    Counter-Example Guided Fence Insertion under TSO2012In: TACAS 2012, 2012Conference paper (Refereed)
    Abstract [en]

    We give a sound and complete fence insertion procedure for concurrentfinite-state programs running under the classical TSO memory model. Thismodel allows “write to read” relaxation corresponding to the addition of an unboundedstore buffer between each processor and the main memory. We introducea novel machine model, called the Single-Buffer (SB) semantics, and show thatthe reachability problem for a program under TSO can be reduced to the reachabilityproblem under SB. We present a simple and effective backward reachabilityanalysis algorithm for the latter, and propose a counter-example guided fence insertionprocedure. The procedure is augmented by a placement constraint thatallows the user to choose places inside the program where fences may be inserted.For a given placement constraint, we automatically infer all minimal setsof fences that ensure correctness. We have implemented a prototype and run itsuccessfully on all standard benchmarks together with several challenging examplesthat are beyond the applicability of existing methods.

  • 12.
    Abdulla, Parosh Aziz
    et al.
    Uppsala University, Sweden.
    Atig, Mohamed Faouzi
    Uppsala University, Sweden.
    Chen, Yu-Fang
    Academia Sinica, Taiwan.
    Leonardsson, Carl
    Uppsala University, Sweden.
    Rezine, Ahmed
    Linköping University, Department of Computer and Information Science, Software and Systems. Linköping University, The Institute of Technology.
    Memorax, a Precise and Sound Tool for Automatic Fence Insertion under TSO2013In: Tools and Algorithms for the Construction and Analysis of Systems: 19th International Conference, TACAS 2013, Held as Part of the European Joint Conferences on Theory and Practice of Software, ETAPS 2013, Rome, Italy, March 16-24, 2013. Proceedings, Springer Berlin/Heidelberg, 2013, 530-536 p.Conference paper (Refereed)
    Abstract [en]

    We introduce MEMORAX, a tool for the verification of control state reachability (i.e., safety properties) of concurrent programs manipulating finite range and integer variables and running on top of weak memory models. The verification task is non-trivial as it involves exploring state spaces of arbitrary or even infinite sizes. Even for programs that only manipulate finite range variables, the sizes of the store buffers could grow unboundedly, and hence the state spaces that need to be explored could be of infinite size. In addition, MEMORAX in- corporates an interpolation based CEGAR loop to make possible the verification of control state reachability for concurrent programs involving integer variables. The reachability procedure is used to automatically compute possible memory fence placements that guarantee the unreachability of bad control states under TSO. In fact, for programs only involving finite range variables and running on TSO, the fence insertion functionality is complete, i.e., it will find all minimal sets of memory fence placements (minimal in the sense that removing any fence would result in the reachability of the bad control states). This makes MEMORAX the first freely available, open source, push-button verification and fence insertion tool for programs running under TSO with integer variables.

  • 13.
    Abdulla, Parosh Aziz
    et al.
    Uppsala University.
    Atig, Mohammed Faouzi
    Uppsala University.
    Ganjei, Zeinab
    Linköping University, Department of Computer and Information Science, Software and Systems. Linköping University, Faculty of Science & Engineering.
    Rezine, Ahmed
    Linköping University, Department of Computer and Information Science, Software and Systems. Linköping University, The Institute of Technology.
    Zhu, Yunyun
    Uppsala University.
    Verification of Cache Coherence Protocols wrt. Trace Filters2015Conference paper (Refereed)
    Abstract [en]

    We address the problem of parameterized verification of cache coherence protocols for hardware accelerated transactional memories. In this setting, transactional memories leverage on the versioning capabilities of the underlying cache coherence protocol. The length of the transactions, their number, and the number of manipulated variables (i.e., cache lines) are parameters of the verification problem. Caches in such systems are finite-state automata communicating via broadcasts and shared variables. We augment our system with filters that restrict the set of possible executable traces according to existing conflict resolution policies. We show that the verification of coherence for parameterized cache protocols with filters can be reduced to systems with only a finite number of cache lines. For verification, we show how to account for the effect of the adopted filters in a symbolic backward reachability algorithm based on the framework of constrained monotonic abstraction. We have implemented our method and used it to verify transactional memory coherence protocols with respect to different conflict resolution policies.

  • 14.
    Abdulla, Parosh Aziz
    et al.
    Uppsala University, Sweden.
    Dwarkadas, Sandhya
    University of Rochester, U.S.A..
    Rezine, Ahmed
    Linköping University, Department of Computer and Information Science, Software and Systems. Linköping University, The Institute of Technology.
    Shriraman, Arrvindh
    Simon Fraser University, Canada.
    Zhu, Yunyun
    Uppsala University, Sweden.
    Verifying Safety and Liveness for the FlexTM Hybrid Transactional Memory2013In: Design, Automation & Test in Europe (DATE 2013), Grenoble, France, March 18-22, 2013., IEEE , 2013, 785-790 p.Conference paper (Refereed)
    Abstract [en]

    We consider the verification of safety (strict se- rializability and abort consistency) and liveness (obstruction and livelock freedom) for the hybrid transactional memory framework FLEXTM. This framework allows for flexible imple- mentations of transactional memories based on an adaptation of the MESI coherence protocol. FLEXTM allows for both eager and lazy conflict resolution strategies. Like in the case of Software Transactional Memories, the verification problem is not trivial as the number of concurrent transactions, their size, and the number of accessed shared variables cannot be a priori bounded. This complexity is exacerbated by aspects that are specific to hardware and hybrid transactional memories. Our work takes into account intricate behaviours such as cache line based conflict detection, false sharing, invisible reads or non-transactional instructions. We carry out the first automatic verification of a hybrid transactional memory and establish, by adopting a small model approach, challenging properties such as strict serializability, abort consistency, and obstruction freedom for both an eager and a lazy conflict resolution strategies. We also detect an example that refutes livelock freedom. To achieve this, our prototype tool makes use the latest antichain based techniques to handle systems with tens of thousands of states.

  • 15.
    Abdulla, Parosh Aziz
    et al.
    Uppsala University.
    Haziza, Frédéric
    Uppsala University.
    Holik, Lukas
    Brno University of Technology, Czech Republic.
    Jonsson, Bengt
    Uppsala University.
    Rezine, Ahmed
    Linköping University, Department of Computer and Information Science, Software and Systems. Linköping University, The Institute of Technology.
    An Integrated Specification and Verification Technique for Highly Concurrent Data Structures2013In: The 19th International Conference on Tools and Algorithms for the Construction and Analysis of Systems (TACAS 2013), Rome, Italy, March 16-24, 2013., 2013Conference paper (Refereed)
    Abstract [en]

    We present a technique for automatically verifying safety properties of concurrent programs, in particular programs which rely on subtle dependencies of local states of different threads, such as lock-free implementations of stacks and queues in an environment without garbage collection. Our technique addresses the joint challenges of infinite-state specifications, an unbounded number of threads, and an unbounded heap managed by explicit memory allocation. Our technique builds on the automata-theoretic approach to model checking, in which a specification is given by an automaton that observes the execution of a program and accepts executions that violate the intended specification.We extend this approach by allowing specifications to be given by a class of infinite-state automata. We show how such automata can be used to specify queues, stacks, and other data structures, by extending a data-independence argument. For verification, we develop a shape analysis, which tracks correlations between pairs of threads, and a novel abstraction to make the analysis practical. We have implemented our method and used it to verify programs, some of which have not been verified by any other automatic method before.

  • 16.
    Abdullah Jan, Mirza
    et al.
    Linköping University, Department of Electrical Engineering.
    Ahsan, Mahmododfateh
    Linköping University, Department of Electrical Engineering.
    Multi-View Video Transmission over the Internet2010Independent thesis Advanced level (degree of Master (Two Years)), 30 credits / 45 HE creditsStudent thesis
    Abstract [en]

    3D television using multiple views rendering is receiving increasing interest. In this technology a number of video sequences are transmitted simultaneously and provides a larger view of the scene or stereoscopic viewing experience. With two views stereoscopic rendition is possible. Nowadays 3D displays are available that are capable of displaying several views simultaneously and the user is able to see different views by moving his head.

    The thesis work aims at implementing a demonstration system with a number of simultaneous views. The system will include two cameras, computers at both the transmitting and receiving end and a multi-view display. Besides setting up the hardware, the main task is to implement software so that the transmission can be done over an IP-network.

    This thesis report includes an overview and experiences of similar published systems, the implementation of real time video, its compression, encoding, and transmission over the internet with the help of socket programming and finally the multi-view display in 3D format.  This report also describes the design considerations more precisely regarding the video coding and network protocols.

  • 17.
    Abrahamsson, Björn
    Linköping University, Department of Electrical Engineering.
    Architectures for Multiplication in Galois Rings2004Independent thesis Basic level (professional degree)Student thesis
    Abstract [en]

    This thesis investigates architectures for multiplying elements in Galois rings of the size 4^m, where m is an integer.

    The main question is whether known architectures for multiplying in Galois fields can be used for Galois rings also, with small modifications, and the answer to that question is that they can.

    Different representations for elements in Galois rings are also explored, and the performance of multipliers for the different representations is investigated.

  • 18.
    Abrahamsson, David
    Linköping University, Department of Computer and Information Science.
    Security Enhanced Firmware Update Procedures in Embedded Systems2008Independent thesis Advanced level (degree of Master (Two Years)), 20 credits / 30 HE creditsStudent thesis
    Abstract [en]

    Many embedded systems are complex, and it is often required that the firmware in these systems are updatable by the end-user. For economical and confidentiality reasons, it is important that these systems only accept firmware approved by the firmware producer.

    This thesis work focuses on creating a security enhanced firmware update procedure that is suitable for use in embedded systems. The common elements of embedded systems are described and various candidate algorithms are compared as candidates for firmware verification. Patents are used as a base for the proposal of a security enhanced update procedure. We also use attack trees to perform a threat analysis on an update procedure.

    The results are a threat analysis of a home office router and the proposal of an update procedure. The update procedure will only accept approved firmware and prevents reversion to old, vulnerable, firmware versions. The firmware verification is performed using the hash function SHA-224 and the digital signature algorithm RSA with a key length of 2048. The selection of algorithms and key lengths mitigates the threat of brute-force and cryptanalysis attacks on the verification algorithms and is believed to be secure through 2030.

  • 19.
    Abrahamsson, Lars
    Linköping University, Department of Electrical Engineering.
    A portal based system for indoor environs2006Independent thesis Basic level (professional degree), 20 points / 30 hpStudent thesis
    Abstract [en]

    The purpose of this thesis is to document the development of the graphics part of an extremely pluggable game engine/lab environment for a course in advanced game programming. This thesis is one out of five, and concerns indoor, realtime computer 3D graphics. It covers state-of-the-art techniques such as GLSL - the OpenGL Shading Language - and more well known techniques such as portal based rendering.

  • 20.
    Abrahamsson, Marcus
    Linköping University, Department of Computer and Information Science, Database and information techniques. Linköping University, The Institute of Technology.
    A platform for third-party applications on the web2013Independent thesis Basic level (degree of Bachelor), 10,5 credits / 16 HE creditsStudent thesis
    Abstract [en]

    A trend seen on the web today is to create a platform where externally developed applications can run inside some kind of main application. This is often done by providing an API to access data and business logic of your service and a sandbox environment in which third-party applications can run. By providing this, it is made possible for external developers to come up with new ideas based on your service. Some good examples on this are Spotify Apps, Apps on Facebook and SalesForce.com.

    Ipendo Systems AB is a company that develops a web platform for intellectual properties. Currently most things on this platform are developed by developers at Ipendo Systems AB. Some interest has though risen to enable external developers to create applications that will in some way run inside the main platform.

    In this thesis an analysis of already existing solutions has been done. These solutions were Spotify Apps and Apps on Facebook. The two have different approaches on how to enable third-party applications to run inside their own service. Facebook’s solution builds mainly on iframe embedded web pages where data access is provided through a web API. Spotify on the other hand hosts the third-party applications themselves but the applications may only consist of HTML5, CSS3 and JavaScript.

    In addition to the analysis a prototype was developed. The purpose of the prototype was to show possible ways to enable third-party applications to run inside your own service. Two solutions showing this were developed. The first one was based on Facebook’s approach with iframing of external web pages. The second was a slightly modified version of Spotify’s solution with only client-side code hosted by the main application. To safely embed the client side code in the main application a sandboxing tool for JavaScript called Caja was used.

    Of the two versions implemented in the prototype was the Iframe solution considered more ready to be utilized in a production environment than Caja. Caja could be seen as an interesting technique for the future but might not be ready to use today. The reason behind this conclusion was that Caja decreased the performance of the written JavaScript as well as adding complexity while developing the third-party applications.

  • 21.
    Abrahamsson, Peder
    Linköping University, Department of Computer and Information Science.
    Mer lättläst: Påbyggnad av ett automatiskt omskrivningsverktyg till lätt svenska2011Independent thesis Basic level (degree of Bachelor), 12 credits / 18 HE creditsStudent thesis
    Abstract [sv]

    Det svenska språket ska finnas tillgängligt för alla som bor och verkar i Sverige. Därförär det viktigt att det finns lättlästa alternativ för dem som har svårighet att läsa svensktext. Detta arbete bygger vidare på att visa att det är möjligt att skapa ett automatisktomskrivningsprogram som gör texter mer lättlästa. Till grund för arbetet liggerCogFLUX som är ett verktyg för automatisk omskrivning till lätt svenska. CogFLUXinnehåller funktioner för att syntaktiskt skriva om texter till mer lättläst svenska.Omskrivningarna görs med hjälp av omskrivningsregler framtagna i ett tidigare projekt.I detta arbete implementeras ytterligare omskrivningsregler och även en ny modul förhantering av synonymer. Med dessa nya regler och modulen ska arbetet undersöka omdet är det är möjligt att skapa system som ger en mer lättläst text enligt etableradeläsbarhetsmått som LIX, OVIX och Nominalkvot. Omskrivningsreglerna ochsynonymhanteraren testas på tre olika texter med en total lägnd på ungefär hundra tusenord. Arbetet visar att det går att sänka både LIX-värdet och Nominalkvoten signifikantmed hjälp av omskrivningsregler och synonymhanterare. Arbetet visar även att det finnsfler saker kvar att göra för att framställa ett riktigt bra program för automatiskomskrivning till lätt svenska.

  • 22.
    Abrahamsson, Robin
    et al.
    Linköping University, Department of Computer and Information Science, Software and Systems.
    Berntsen, David
    Linköping University, Department of Computer and Information Science, Software and Systems.
    Comparing modifiability of React Native and two native codebases2017Independent thesis Advanced level (degree of Master (Two Years)), 20 credits / 30 HE creditsStudent thesis
    Abstract [en]

    Creating native mobile application on multiple platforms generate a lot of duplicate code. This thesis has evaluated if the code quality attribute modifiability improves when migrating to React Native. One Android and one iOS codebase existed for an application and a third codebase was developed with React Native. The measurements of the codebases were based on the SQMMA-model. The metrics for the model were collected with static analyzers created specifically for this project. The results created consists of graphs that show the modifiability for some specific components over time and graphs that show the stability of the platforms. These graphs show that when measuring code metrics on applications over time it is better to do this on a large codebase that has been developed for some time. When calculating a modifiability value the sum of the metrics and the average value of the metrics between files should be used and it is shown that the React Native platform seems to be more stable than native.

  • 23.
    Abu Baker, Mohamed
    Linköping University, Department of Computer and Information Science, PELAB - Programming Environment Laboratory.
    Agile Prototyping: A combination of different approaches into one main process2009Independent thesis Advanced level (degree of Master (Two Years)), 20 credits / 30 HE creditsStudent thesis
    Abstract [en]

    Software prototyping is considered to be one of the most important tools that are used by software engineersnowadays to be able to understand the customer’s requirements, and develop software products that are efficient,reliable, and acceptable economically. Software engineers can choose any of the available prototyping approaches tobe used, based on the software that they intend to develop and how fast they would like to go during the softwaredevelopment. But generally speaking all prototyping approaches are aimed to help the engineers to understand thecustomer’s true needs, examine different software solutions and quality aspect, verification activities…etc, that mightaffect the quality of the software underdevelopment, as well as avoiding any potential development risks.A combination of several prototyping approaches, and brainstorming techniques which have fulfilled the aim of theknowledge extraction approach, have resulted in developing a prototyping approach that the engineers will use todevelop one and only one throwaway prototype to extract more knowledge than expected, in order to improve thequality of the software underdevelopment by spending more time studying it from different points of view.The knowledge extraction approach, then, was applied to the developed prototyping approach in which thedeveloped model was treated as software prototype, in order to gain more knowledge out of it. This activity hasresulted in several points of view, and improvements that were implemented to the developed model and as a resultAgile Prototyping AP, was developed. AP integrated more development approaches to the first developedprototyping model, such as: agile, documentation, software configuration management, and fractional factorialdesign, in which the main aim of developing one, and only one prototype, to help the engineers gaining moreknowledge, and reducing effort, time, and cost of development was accomplished but still developing softwareproducts with satisfying quality is done by developing an evolutionary prototyping and building throwawayprototypes on top of it.

  • 24.
    Abugessaisa, Imad
    Linköping University, Department of Computer and Information Science, GIS - Geographical Information Science Group. Linköping University, The Institute of Technology.
    Analytical tools and information-sharing methods supporting road safety organizations2008Doctoral thesis, comprehensive summary (Other academic)
    Abstract [en]

    A prerequisite for improving road safety are reliable and consistent sources of information about traffic and accidents, which will help assess the prevailing situation and give a good indication of their severity. In many countries there is under-reporting of road accidents, deaths and injuries, no collection of data at all, or low quality of information. Potential knowledge is hidden, due to the large accumulation of traffic and accident data. This limits the investigative tasks of road safety experts and thus decreases the utilization of databases. All these factors can have serious effects on the analysis of the road safety situation, as well as on the results of the analyses.

    This dissertation presents a three-tiered conceptual model to support the sharing of road safety–related information and a set of applications and analysis tools. The overall aim of the research is to build and maintain an information-sharing platform, and to construct mechanisms that can support road safety professionals and researchers in their efforts to prevent road accidents. GLOBESAFE is a platform for information sharing among road safety organizations in different countries developed during this research.

    Several approaches were used, First, requirement elicitation methods were used to identify the exact requirements of the platform. This helped in developing a conceptual model, a common vocabulary, a set of applications, and various access modes to the system. The implementation of the requirements was based on iterative prototyping. Usability methods were introduced to evaluate the users’ interaction satisfaction with the system and the various tools. Second, a system-thinking approach and a technology acceptance model were used in the study of the Swedish traffic data acquisition system. Finally, visual data mining methods were introduced as a novel approach to discovering hidden knowledge and relationships in road traffic and accident databases. The results from these studies have been reported in several scientific articles.

    List of papers
    1. Ontological Approach to Modeling Information Systems
    Open this publication in new window or tab >>Ontological Approach to Modeling Information Systems
    2004 (English)In: Proceedings of the Fourth International Conference on Computer and information Technology (Cit'04), 14–16 September, Wuhan, China: IEEE Computer Society, Washington, DC, 2004, 1122-1127 p.Conference paper, Published paper (Other academic)
    Abstract [en]

    In recent years, the use of formal tools in information system modeling and development represents a potential area of research in computer science. In 1967, the term ontology appeared for the first time in computer science literature as S. H. Mealy introduced it as a basic foundation in data modeling. The main objective of this paper is to discuss the concept of ontology (from a philosophical perspective) as it was used to bridge the gap between philosophy and information systems science, and to investigate ontology types that can be found during ontological investigation and the methods used in the investigation process. The secondary objective of this paper is to study different design and engineering approaches of ontology as well as development environments that are used to create and edit ontologies.

    Keyword
    Ontology, Conceptual Model
    National Category
    Engineering and Technology
    Identifiers
    urn:nbn:se:liu:diva-13184 (URN)10.1109/CIT.2004.1357345 (DOI)
    Available from: 2008-04-28 Created: 2008-04-28 Last updated: 2009-04-21
    2. Benchmarking Road Safety Situations Using OGC Model of Portrayal Workflow
    Open this publication in new window or tab >>Benchmarking Road Safety Situations Using OGC Model of Portrayal Workflow
    2005 (English)In: Proceedings of the 13th International Conference on Geoinformatics (GeoInformatics’5), 17-19 August, Toronto, Canada: Ryerson University, 2005Conference paper, Published paper (Other academic)
    Keyword
    road safety, benchmarking, OGC model
    National Category
    Engineering and Technology
    Identifiers
    urn:nbn:se:liu:diva-13185 (URN)
    Available from: 2008-04-28 Created: 2008-04-28 Last updated: 2009-04-21
    3. Map as Interface for Shared Information: A Study of Design Principles and User Interaction Satisfaction
    Open this publication in new window or tab >>Map as Interface for Shared Information: A Study of Design Principles and User Interaction Satisfaction
    2006 (English)In: IADIS International Conference WWW/Internet 2006: Murcia, Spain, 2006, 377-384 p.Conference paper, Published paper (Refereed)
    Keyword
    Maps, shared information, design priciples, user satisfaction
    National Category
    Engineering and Technology
    Identifiers
    urn:nbn:se:liu:diva-13186 (URN)972-8924-19-4 (ISBN)
    Available from: 2008-04-28 Created: 2008-04-28 Last updated: 2009-02-05Bibliographically approved
    4. GLOBESAFE: A Platform for Information-Sharing Among Road Safety Organizations
    Open this publication in new window or tab >>GLOBESAFE: A Platform for Information-Sharing Among Road Safety Organizations
    2007 (English)In: IFIP-W.G. 9th International Conference on Social Implications of Computers in Developing Countries: May 2007, São Paulo, Brazil, 2007, 1-10 p.Conference paper, Published paper (Refereed)
    Keyword
    information sharing, road safety
    National Category
    Engineering and Technology
    Identifiers
    urn:nbn:se:liu:diva-13187 (URN)
    Available from: 2008-04-28 Created: 2008-04-28 Last updated: 2009-04-23Bibliographically approved
    5. A Systemic View on Swedish Traffic Accident Data Acquisition System
    Open this publication in new window or tab >>A Systemic View on Swedish Traffic Accident Data Acquisition System
    2007 (English)In: Proceedings of the 14th International Conference on Road Safety on Four Continents (RS4C), 14-16 November, Bangkok, Thailand, Sweden: VTI , 2007, 1-12 p.Conference paper, Published paper (Refereed)
    Abstract [en]

    This paper presents work in progress to study information sharing among road safety organizations. The focus is to study accident data acquisition system. In 2002, Swedish Road Transport authority (SRT) has accepted STRADA as accident reporting system to be used by the police all over Sweden. Such system is vital for coordinating, maintaining and auditing road safety in the country. Normally road accidents are reported by the police or by Emergency unit at the hospital. However more than 50% of the hospitals in Sweden didn’t use the system which decrease the utilization of the system and reduce the quality of the information that demanded. By using system thinking approach in this study we try to see why such situation is occurred and how changes can be introduced and handle to overcome such problem. Interviews conducted with focus group and different users of the system. To investigate the issues related to the acceptance of the system we use Technology Acceptance Model (TAM). We recommend getting the user involved in the life cycle of the STRADA and also the developers could use enabling system to overcome problems in related to system usability and complexity. Also we suggest the use of iterative development to govern the life cycle.

    Place, publisher, year, edition, pages
    Sweden: VTI, 2007
    Keyword
    STRADA Information sharing Road accidents recording system
    National Category
    Engineering and Technology
    Identifiers
    urn:nbn:se:liu:diva-13188 (URN)
    Available from: 2008-04-28 Created: 2008-04-28 Last updated: 2009-04-23Bibliographically approved
    6. Knowledge Discovery in Road Accidents Database Integration of Visual and Automatic Data Mining Methods
    Open this publication in new window or tab >>Knowledge Discovery in Road Accidents Database Integration of Visual and Automatic Data Mining Methods
    2008 (English)In: International Journal of Public Information Systems, ISSN 1653-4360, Vol. 1, 59-85 p.Article in journal (Refereed) Published
    Abstract [en]

    Road accident statistics are collected and used by a large number of users and this can result in a huge volume of data which requires to be explored in order to ascertain the hidden knowledge. Potential knowledge may be hidden because of the accumulation of data, which limits the exploration task for the road safety expert and, hence, reduces the utilization of the database. In order to assist in solving these problems, this paper explores Automatic and Visual Data Mining (VDM) methods. The main purpose is to study VDM methods and their applicability to knowledge discovery in a road accident databases. The basic feature of VDM is to involve the user in the exploration process. VDM uses direct interactive methods to allow the user to obtain an insight into and recognize different patterns in the dataset. In this paper, I apply a range of methods and techniques, including a paradigm for VDM, exploratory data analysis, and clustering methods, such as K-means algorithms, hierarchical agglomerative clustering (HAC), classification trees, and self-organized-maps (SOM). These methods assist in integrating VDM with automatic data mining algorithms. Open source VDM tools offering visualization techniques were used. The first contribution of this paper lies in the area of discovering clusters and different relationships (such as the relationship between socioeconomic indicators and fatalities, traffic risk and population, personal risk and car per capita, etc.) in the road safety database. The methods used were very useful and valuable for detecting clusters of countries that share similar traffic situations. The second contribution was the exploratory data analysis where the user can explore the contents and the structure of the data set at an early stage of the analysis. This is supported by the filtering components of VDM. This assists expert users with a strong background in traffic safety analysis to be able to intimate assumptions and hypotheses concerning future situations. The third contribution involved interactive explorations based on brushing and linking methods; this novel approach assists both the experienced and inexperienced users to detect and recognize interesting patterns in the available database. The results obtained showed that this approach offers a better understanding of the contents of road safety databases, with respect to current statistical techniques and approaches used for analyzing road safety situations.

    Keyword
    Visual data mining, K-Means, HAC, SOM, InfoVis, IRTAD, GLOBESAFE
    National Category
    Engineering and Technology
    Identifiers
    urn:nbn:se:liu:diva-13189 (URN)
    Available from: 2008-04-28 Created: 2008-04-28 Last updated: 2009-01-26
  • 25.
    Achichi, Manel
    et al.
    LIRMM/University of Montpellier, France.
    Cheatham, Michelle
    Wright State University, USA.
    Dragisic, Zlatan
    Linköping University, Department of Computer and Information Science, Database and information techniques. Linköping University, The Institute of Technology.
    Euzenat, Jerome
    INRIA & Univ. Grenoble Alpes, Grenoble, France.
    Faria, Daniel
    Instituto Gulbenkian de Ciencia, Lisbon, Portugal.
    Ferrara, Alfio
    Universita degli studi di Milano, Italy.
    Flouris, Giorgos
    Institute of Computer Science-FORTH, Heraklion, Greece.
    Fundulaki, Irini
    Institute of Computer Science-FORTH, Heraklion, Greece.
    Harrow, Ian
    Pistoia Alliance Inc., USA.
    Ivanova, Valentina
    Linköping University, Department of Computer and Information Science, Database and information techniques. Linköping University, The Institute of Technology.
    Jiménez-Ruiz, Ernesto
    University of Oslo, Norway and University of Oxford, UK.
    Kuss, Elena
    University of Mannheim, Germany.
    Lambrix, Patrick
    Linköping University, Department of Computer and Information Science, Database and information techniques. Linköping University, The Institute of Technology.
    Leopold, Henrik
    Vrije Universiteit Amsterdam, The Netherlands.
    Li, Huanyu
    Linköping University, Department of Computer and Information Science, Database and information techniques. Linköping University, Faculty of Science & Engineering.
    Meilicke, Christian
    University of Mannheim, Germany.
    Montanelli, Stefano
    Universita degli studi di Milano, Italy.
    Pesquita, Catia
    Universidade de Lisboa, Portugal.
    Saveta, Tzanina
    Institute of Computer Science-FORTH, Heraklion, Greece.
    Shvaiko, Pavel
    TasLab, Informatica Trentina, Trento, Italy.
    Splendiani, Andrea
    Novartis Institutes for Biomedical Research, Basel, Switzerland.
    Stuckenschmidt, Heiner
    University of Mannheim, Germany.
    Todorov, Konstantin
    LIRMM/University of Montpellier, France.
    Trojahn, Cassia
    IRIT & Universit ́ e Toulouse II, Toulouse, France.
    Zamazal, Ondřej
    University of Economics, Prague, Czech Republic.
    Results of the Ontology Alignment Evaluation Initiative 20162016In: Proceedings of the 11th International Workshop on Ontology Matching, Aachen, Germany: CEUR Workshop Proceedings , 2016, 73-129 p.Conference paper (Refereed)
  • 26.
    Achu, Denis
    Linköping University, Department of Computer and Information Science.
    Application of Gis in Temporal and Spatial Analyses of Dengue Fever Outbreak: Case of Rio de Janeiro, Brazil2009Independent thesis Advanced level (degree of Master (Two Years)), 20 credits / 30 HE creditsStudent thesis
    Abstract [en]

    Since Dengue fever (DF) and its related forms, Dengue Hemorrhagic fever (DHF) and Dengue Shock Syndrome (DSS) have become important health concerns worldwide, it is also imperative to develop methods which will help in the analysis of the incidences. Dengue fever cases are growing in number as it also invades widely, affecting larger number of countries and crossing climatic boundaries. Considering that the disease as of now has neither an effective vaccine nor a cure, monitoring in order to prevent or control is the resorted alternative. GIS and its related technologies offer a wealth of interesting capabilities towards achieving this goal.

    The intention of this study was to develop methods to describe dengue fever outbreaks taking Rio de Janeiro, Brazil as a case study. Careful study of Census data with appropriate attributes was made to find out their potential influence on dengue fever incidence in the various regions or census districts. Dengue incidence data from year 2000 to year 2008 reported by the municipal secretariat of Rio was used to extract the necessary census districts. Base map files in MapInfo format were converted to shape files.  Using ArcGIS it was possible to merge the dengue fever incidence data with the available base map file of the City of Rio according to corresponding census districts. Choropleth maps were then created using different attributes from which patterns and trends could be used to describe the characteristic of the outbreak with respect to the socio-economic conditions. Incidence data were also plotted in Excel to see temporal variations. Cluster analysis were performed with the Moran I technique on critical periods and years of dengue outbreak. Using the square root of dengue incidence from January to April 2002 and 2008, inverse distance was selected as the conceptualised spatial relationship, Euclidean distance as the distance method. More detailed analyses were then done on the selected critical years of dengue outbreak, (years 2002 and 2008), to investigate the influence of socio-economic variables on dengue incidence per census district.

     

    Dengue incidence rate appeared to be higher during the rainy and warmer months between December and May. Outbreaks of dengue occurred in years 2002 and 2008 over the study period of year 2000 to 2008. Some factors included in the census data were influential in the dengue prevalence according to districts. Satisfactory results can be achieved by using this strategy as a quick method for assessing potential dengue attack, spread and possible enabling conditions. The method has the advantage where there is limited access to field work, less financial means for acquisition of data and other vital resources.

    A number of difficulties were encountered during the study however and leaves areas where further work can be done for improvements. More variables would be required in order to make a complete and comprehensive description of influential conditions and factors.  There is still a gap in the analytical tools required for multi-dimensional investigations as the ones encountered in this study.  It is vital to integrate ‘GPS’ and ‘Remote Sensing’ in order to obtain a variety of up-to-date data with higher resolution.

     

  • 27.
    Adamsson, Gustav
    Linköping University, Department of Electrical Engineering, Information Coding. Linköping University, Faculty of Science & Engineering.
    Fast and Approximate Text Rendering Using Distance Fields2015Independent thesis Advanced level (degree of Master (One Year)), 20 credits / 30 HE creditsStudent thesis
    Abstract [en]

    Distance field text rendering has many advantages compared to most other text renderingsolutions. Two of the advantages are the possibility  to scale the glyphs without losing the crisp edge and less memory consumption. A drawback with distance field text renderingcan be high distance field generation time. The solution for fast distance field text renderingin this thesis generates the distance fields by drawing distance gradients locally over the outlines of the glyphs. This method is much faster than the old exact methods for generating distance fields that often includes multiple passes over the whole image.

    Using the solution for text rendering proposed in this thesis results in good looking text that is generated on the fly. The distance fields are generated on a mobile device in less than 10 ms for most of the glyphs in good quality which is less than the time between two frames.

  • 28.
    Adelöf, Anna
    et al.
    Fackspråk och informatik, Regler och tillstånd, Socialstyrelsen.
    Lindberg, Christina
    Fackspråk och informatik, Regler och tillstånd, Socialstyrelsen.
    Barlow, Lotti
    Fackspråk och informatik, Regler och tillstånd, Socialstyrelsen.
    Gerdin, Ulla
    Fackspråk och informatik, Regler och tillstånd, Socialstyrelsen.
    Bränd Persson, Kristina
    Fackspråk och informatik, Regler och tillstånd, Socialstyrelsen.
    Ericsson, Erika
    Fackspråk och informatik, Regler och tillstånd, Socialstyrelsen.
    Testi, Stefano
    Fackspråk och informatik, Regler och tillstånd, Socialstyrelsen.
    Nyström, Mikael
    Linköping University, Department of Biomedical Engineering, Medical Informatics. Linköping University, The Institute of Technology.
    Förvaltning av SNOMED CT som en del i det nationella fackspråket för vård och omsorg2011Report (Other (popular science, discussion, etc.))
    Abstract [sv]

    Förvaltningsrapporten fokuserar på Snomed CT, eftersom det redan i dag finns rutiner för förvaltningar av termbanken och nationella hälsorelaterade klassifikationer. Ett särskilt utvecklingsarbete kommer att krävas för dessa delar.

    Rapporten tar upp syfte och mål med förvaltningen. Utöver det redogör rapporten för vilka konkreta ansvarsområden som ingår i förvaltningen av Snomed CT. Målet för förvaltningen är att Socialstyrelsen regelbundet ska kunna tillhandahålla en kontrollerad och uppdaterad release av Snomed CT. Det skulle möjliggöra användning inom vård och omsorg. Rapporten tar även upp behovet av kompetens, utbildning och finansiella resurser.

  • 29.
    Adlercreutz, Anna
    et al.
    Linköping University, Department of Computer and Information Science.
    Ahlstedt, Oskar
    Linköping University, Department of Computer and Information Science.
    Bengtsson, Linnéa
    Linköping University, Department of Computer and Information Science.
    Månsson, Andreas
    Linköping University, Department of Computer and Information Science.
    Romell, Gustaf
    Linköping University, Department of Computer and Information Science.
    Stigson, Isak
    Linköping University, Department of Computer and Information Science.
    Sund, Tobias
    Linköping University, Department of Computer and Information Science.
    Wedlund, Lisa
    Linköping University, Department of Computer and Information Science.
    En praktisk studie kring utvecklingen av webbapplikationen Studentlunchen2015Independent thesis Basic level (degree of Bachelor), 12 credits / 18 HE creditsStudent thesis
    Abstract [en]

    This report declares the experiences and results arrived from the development process around the e-shop Studentlunchen. Studentlunchen is a web application to be used by students to order lunch during weekdays. In order to make Studentlunchen as user friendly and intuitive as possible the e-shop has been developed with focus on functionality and an attractive design. In the report there is a technical description regarding the web application together with a discussion concerning the developed solutions. Furthermore the report discusses and evaluates the working process Scrum and how it has been used. As a result of complying with the Scrum methodology to deliver working functionality after every sprint, focus has been directed towards achieving this instead of implementing many features that isn’t fully completed. With thorough development of the initial prototype, the basic idea of the design and functionality surrounding Studentlunchen could be kept throughout the development process. This was one of the great contributors to the projects overall success and helped the team achieve the goal to make a user-friendly web application.

  • 30.
    Adnan, Muhammad
    Linköping University, Department of Computer and Information Science, Human-Centered systems. Linköping University, The Institute of Technology.
    Usability Evaluation of Smart Phone Application Store2015Independent thesis Advanced level (degree of Master (Two Years)), 20 credits / 30 HE creditsStudent thesis
    Abstract [en]

    In this study, the usability of smart phone application store app is evaluated. The study was performed on different smart phone operating systems. Data about usability was gathered through surveys and think aloud based experiment. Anova analysis was also performed on data to identify significant issues. A lot of smartphone users reported issues with installing, locating and searching about apps. Many users had issues with uninstalling of apps and navigating the search results when looking for apps. The smartphone operating system and the app store does not provide seamless navigation and alot of content is not tailored for smart phone users.

  • 31.
    Adok, Claudia
    Linköping University, Department of Computer and Information Science. Linköping University, Faculty of Science & Engineering.
    Retrieval of Cloud Top Pressure2016Independent thesis Advanced level (degree of Master (Two Years)), 20 credits / 30 HE creditsStudent thesis
    Abstract [en]

    In this thesis the predictive models the multilayer perceptron and random forest are evaluated to predict cloud top pressure. The dataset used in this thesis contains brightness temperatures, reflectances and other useful variables to determine the cloud top pressure from the Advanced Very High Resolution Radiometer (AVHRR) instrument on the two satellites NOAA-17 and NOAA-18 during the time period 2006-2009. The dataset also contains numerical weather prediction (NWP) variables calculated using mathematical models. In the dataset there are also observed cloud top pressure and cloud top height estimates from the more accurate instrument on the Cloud-Aerosol Lidar and Infrared Pathfinder Satellite Observation (CALIPSO) satellite. The predicted cloud top pressure is converted into an interpolated cloud top height. The predicted pressure and interpolated height are then evaluated against the more accurate and observed cloud top pressure and cloud top height from the instrument on the satellite CALIPSO.

    The predictive models have been performed on the data using different sampling strategies to take into account the performance of individual cloud classes prevalent in the data. The multilayer perceptron is performed using both the original response cloud top pressure and a log transformed repsonse to avoid negative values as output which is prevalent when using the original response. Results show that overall the random forest model performs better than the multilayer perceptron in terms of root mean squared error and mean absolute error.

  • 32.
    Adolfsson, Klas
    Linköping University, Department of Electrical Engineering.
    TCP performance in an EGPRS system2003Independent thesis Advanced level (degree of Magister), 20 points / 30 hpStudent thesis
    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.

  • 33.
    Aghaee Ghaleshahi, Nima
    et al.
    Linköping University, Department of Computer and Information Science, ESLAB - Embedded Systems Laboratory. Linköping University, Department of Computer and Information Science, Software and Systems. Linköping University, The Institute of Technology.
    Peng, Zebo
    Linköping University, Department of Computer and Information Science, ESLAB - Embedded Systems Laboratory. Linköping University, Department of Computer and Information Science, Software and Systems. Linköping University, The Institute of Technology.
    Eles, Petru
    Linköping University, Department of Computer and Information Science, ESLAB - Embedded Systems Laboratory. Linköping University, Department of Computer and Information Science, Software and Systems. Linköping University, The Institute of Technology.
    An Efficient Temperature-Gradient Based Burn-In Technique for 3D Stacked ICs2014In: Design, Automation and Test in Europe Conference and Exhibition (DATE), 2014, IEEE conference proceedings, 2014Conference paper (Refereed)
    Abstract [en]

    Burn-in is usually carried out with high temperature and elevated voltage. Since some of the early-life failures depend not only on high temperature but also on temperature gradients, simply raising up the temperature of an IC is not sufficient to detect them. This is especially true for 3D stacked ICs, since they have usually very large temperature gradients. The efficient detection of these early-life failures requires that specific temperature gradients are enforced as a part of the burn-in process. This paper presents an efficient method to do so by applying high power stimuli to the cores of the IC under burn-in through the test access mechanism. Therefore, no external heating equipment is required. The scheduling of the heating and cooling intervals to achieve the required temperature gradients is based on thermal simulations and is guided by functions derived from a set of thermal equations. Experimental results demonstrate the efficiency of the proposed method.

  • 34.
    Aghaee Ghaleshahi, Nima
    et al.
    Linköping University, Department of Computer and Information Science, Software and Systems. Linköping University, Faculty of Science & Engineering.
    Peng, Zebo
    Linköping University, Department of Computer and Information Science, Software and Systems. Linköping University, Faculty of Science & Engineering.
    Eles, Petru
    Linköping University, Department of Computer and Information Science, Software and Systems. Linköping University, Faculty of Science & Engineering.
    Efficient Test Application for Rapid Multi-Temperature Testing2015In: Proceedings of the 25th edition on Great Lakes Symposium on VLSI, Association for Computing Machinery (ACM), 2015, 3-8 p.Conference paper (Other academic)
    Abstract [en]

    Different defects may manifest themselves at different temperatures. Therefore, the tests that target such temperature-dependent defects must be applied at different temperatures appropriate for detecting them. Such multi-temperature testing scheme applies tests at different required temperatures. It is known that a test's power dissipation depends on the previously applied test. Therefore, the same set of tests when organized differently dissipates different amounts of power. The technique proposed in this paper organizes the tests efficiently so that the resulted power levels lead to the required temperatures. Consequently a rapid multi-temperature testing is achieved. Experimental studies demonstrate the efficiency of the proposed technique.

  • 35.
    Aghaee Ghaleshahi, Nima
    et al.
    Linköping University, Department of Computer and Information Science, Software and Systems. Linköping University, The Institute of Technology.
    Peng, Zebo
    Linköping University, Department of Computer and Information Science, Software and Systems. Linköping University, The Institute of Technology.
    Eles, Petru
    Linköping University, Department of Computer and Information Science, Software and Systems. Linköping University, The Institute of Technology.
    Process-variation and Temperature Aware SoC Test Scheduling Technique2013In: Journal of electronic testing, ISSN 0923-8174, E-ISSN 1573-0727, Vol. 29, no 4, 499-520 p.Article in journal (Refereed)
    Abstract [en]

    High temperature and process variation are undesirable phenomena affecting modern Systems-on-Chip (SoC). High temperature is a well-known issue, in particular during test, and should be taken care of in the test process. Modern SoCs are affected by large process variation and therefore experience large and time-variant temperature deviations. A traditional test schedule which ignores these deviations will be suboptimal in terms of speed or thermal-safety. This paper presents an adaptive test scheduling method which acts in response to the temperature deviations in order to improve the test speed and thermal safety. The method consists of an offline phase and an online phase. In the offline phase a schedule tree is constructed and in the online phase the appropriate path in the schedule tree is traversed based on temperature sensor readings. The proposed technique is designed to keep the online phase very simple by shifting the complexity into the offline phase. In order to efficiently produce high-quality schedules, an optimization heuristic which utilizes a dedicated thermal simulation is developed. Experiments are performed on a number of SoCs including the ITC'02 benchmarks and the experimental results demonstrate that the proposed technique significantly improves the cost of the test in comparison with the best existing test scheduling method.

  • 36.
    Aghaee Ghaleshahi, Nima
    et al.
    Linköping University, Department of Computer and Information Science, ESLAB - Embedded Systems Laboratory. Linköping University, The Institute of Technology.
    Peng, Zebo
    Linköping University, Department of Computer and Information Science, ESLAB - Embedded Systems Laboratory. Linköping University, The Institute of Technology.
    Eles, Petru
    Linköping University, Department of Computer and Information Science, ESLAB - Embedded Systems Laboratory. Linköping University, The Institute of Technology.
    Process-Variation and Temperature Aware SoC Test Scheduling Using Particle Swarm Optimization2011In: The 6th IEEE International Design and Test Workshop (IDT'11), Beirut, Lebanon, December 11–14, 2011., IEEE , 2011Conference paper (Refereed)
    Abstract [en]

    High working temperature and process variation are undesirable effects for modern systems-on-chip. It is well recognized that the high temperature should be taken care of during the test process. Since large process variations induce rapid and large temperature deviations, traditional static test schedules are suboptimal in terms of speed and/or thermalsafety. A solution to this problem is to use an adaptive test schedule which addresses the temperature deviations by reacting to them. We propose an adaptive method that consists of a computationally intense offline-phase and a very simple onlinephase. In the offline-phase, a near optimal schedule tree is constructed and in the online-phase, based on the temperature sensor readings, an appropriate path in the schedule tree is traversed. In this paper, particle swarm optimization is introduced into the offline-phase and the implications are studied. Experimental results demonstrate the advantage of the proposed method.

  • 37.
    Aghaee Ghaleshahi, Nima
    et al.
    Linköping University, Department of Computer and Information Science, ESLAB - Embedded Systems Laboratory. Linköping University, Department of Computer and Information Science, Software and Systems. Linköping University, The Institute of Technology.
    Peng, Zebo
    Linköping University, Department of Computer and Information Science, ESLAB - Embedded Systems Laboratory. Linköping University, Department of Computer and Information Science, Software and Systems. Linköping University, The Institute of Technology.
    Eles, Petru
    Linköping University, Department of Computer and Information Science, ESLAB - Embedded Systems Laboratory. Linköping University, Department of Computer and Information Science, Software and Systems. Linköping University, The Institute of Technology.
    Process-Variation Aware Multi-temperature Test Scheduling2014In: 27th International Conference on VLSI Design and 13th International Conference on Embedded Systems, IEEE conference proceedings, 2014, 32-37 p.Conference paper (Refereed)
    Abstract [en]

    Chips manufactured with deep sub micron technologies are prone to large process variation and temperature-dependent defects. In order to provide high test efficiency, the tests for temperature-dependent defects should be applied at appropriate temperature ranges. Existing static scheduling techniques achieve these specified temperatures by scheduling the tests, specially developed heating sequences, and cooling intervals together. Because of the temperature uncertainty induced by process variation, a static test schedule is not capable of applying the tests at intended temperatures in an efficient manner. As a result the test cost will be very high. In this paper, an adaptive test scheduling method is introduced that utilizes on-chip temperature sensors in order to adapt the test schedule to the actual temperatures. The proposed method generates a low cost schedule tree based on the variation statistics and thermal simulations in the design phase. During the test, a chip selects an appropriate schedule dynamically based on temperature sensor readings. A 23% decrease in the likelihood that tests are not applied at the intended temperatures is observed in the experimental studies in addition to 20% reduction in test application time.

  • 38.
    Aghaee Ghaleshahi, Nima
    et al.
    Linköping University, Department of Computer and Information Science, ESLAB - Embedded Systems Laboratory. Linköping University, Department of Computer and Information Science, Software and Systems. Linköping University, The Institute of Technology.
    Peng, Zebo
    Linköping University, Department of Computer and Information Science, ESLAB - Embedded Systems Laboratory. Linköping University, Department of Computer and Information Science, Software and Systems. Linköping University, The Institute of Technology.
    Eles, Petru
    Linköping University, Department of Computer and Information Science, ESLAB - Embedded Systems Laboratory. Linköping University, Department of Computer and Information Science, Software and Systems. Linköping University, The Institute of Technology.
    Temperature-Gradient Based Burn-In for 3D Stacked ICs2013In: The 12th Swedish System-on-Chip Conference (SSoCC 2013), Ystad, Sweden, May 6-7, 2013 (not reviewed, not printed)., 2013Conference paper (Other academic)
    Abstract [en]

    3D Stacked IC fabrication, using Through-Silicon-Vias, is a promising technology for future integrated circuits. However, large temperature gradients may exacerbate early-life-failures to the extent that the commercialization of 3D Stacked ICs is challenged. The effective detection of these early-life-failures requires that burn-in is performed when the IC’s temperatures comply with the thermal maps that properly specify the temperature gradients. In this paper, two methods that efficiently generate and maintain the specified thermal maps are proposed. The thermal maps are achieved by applying heating and cooling intervals to the chips under test through test access mechanisms. Therefore, no external heating system is required. The scheduling of the heating and cooling intervals is based on thermal simulations. The schedule generation is guided by functions that are derived from the temperature equations. Experimental results demonstrate the efficiency of the proposed method.

  • 39.
    Aghaee Ghaleshahi, Nima
    et al.
    Linköping University, Department of Computer and Information Science, ESLAB - Embedded Systems Laboratory. Linköping University, Department of Computer and Information Science, Software and Systems. Linköping University, The Institute of Technology.
    Peng, Zebo
    Linköping University, Department of Computer and Information Science, ESLAB - Embedded Systems Laboratory. Linköping University, Department of Computer and Information Science, Software and Systems. Linköping University, The Institute of Technology.
    Eles, Petru
    Linköping University, Department of Computer and Information Science, ESLAB - Embedded Systems Laboratory. Linköping University, Department of Computer and Information Science, Software and Systems. Linköping University, The Institute of Technology.
    Temperature-Gradient Based Test Scheduling for 3D Stacked ICs2013In: 2013 IEEE International Conference on Electronics, Circuits, and Systems, IEEE conference proceedings, 2013, 405-408 p.Conference paper (Refereed)
    Abstract [en]

    Defects that are dependent on temperature-gradients (e.g., delay-faults) introduce a challenge for achieving an effective test process, in particular for 3D ICs. Testing for such defects must be performed when the proper temperature gradients are enforced on the IC, otherwise these defects may escape the test. In this paper, a technique that efficiently heats up the IC during test so that it complies with the specified temperature gradients is proposed. The specified temperature gradients are achieved by applying heating sequences to the cores of the IC under test trough test access mechanism; thus no external heating mechanism is required. The scheduling of the test and heating sequences is based on thermal simulations. The schedule generation is guided by functions derived from the IC's temperature equation. Experimental results demonstrate that the proposed technique offers considerable test time savings.

  • 40.
    Aghaee, Nima
    et al.
    Linköping University, Department of Computer and Information Science, ESLAB - Embedded Systems Laboratory. Linköping University, Faculty of Science & Engineering.
    Peng, Zebo
    Linköping University, Department of Computer and Information Science, ESLAB - Embedded Systems Laboratory. Linköping University, Faculty of Science & Engineering.
    Eles, Petru
    Linköping University, Department of Computer and Information Science, ESLAB - Embedded Systems Laboratory. Linköping University, Faculty of Science & Engineering.
    A Test-Ordering Based Temperature-Cycling Acceleration Technique for 3D Stacked ICs2015In: Journal of electronic testing, ISSN 0923-8174, E-ISSN 1573-0727, ISSN 0923-8174, Vol. 31, no 5, 503-523 p.Article in journal (Refereed)
    Abstract [en]

    n a modern three-dimensional integrated circuit (3D IC), vertically stacked dies are interconnected using through silicon vias. 3D ICs are subject to undesirable temperature-cycling phenomena such as through silicon via protrusion as well as void formation and growth. These cycling effects that occur during early life result in opens, resistive opens, and stress induced carrier mobility reduction. Consequently these early-life failures lead to products that fail shortly after the start of their use. Artificially-accelerated temperature cycling, before the manufacturing test, helps to detect such early-life failures that are otherwise undetectable. A test-ordering based temperature-cycling acceleration technique is introduced in this paper that integrates a temperature-cycling acceleration procedure with pre-, mid-, and post-bond tests for 3D ICs. Moreover, it reduces the need for costly temperature chamber based temperature-cycling acceleration methods. All these result in a reduction in the overall test costs. The proposed method is a test-ordering and schedule based solution that enforces the required temperature cycling effect and simultaneously performs the tests whenever appropriate. Experimental results demonstrate the efficiency of the proposed technique.

  • 41.
    Aghaee, Nima
    et al.
    Linköping University, Department of Computer and Information Science, Software and Systems. Linköping University, Faculty of Science & Engineering.
    Peng, Zebo
    Linköping University, Department of Computer and Information Science, Software and Systems. Linköping University, Faculty of Science & Engineering.
    Eles, Petru
    Linköping University, Department of Computer and Information Science, Software and Systems. Linköping University, Faculty of Science & Engineering.
    Temperature-Gradient-Based Burn-In and Test Scheduling for 3-D Stacked ICs2015In: IEEE Transactions on Very Large Scale Integration (vlsi) Systems, ISSN 1063-8210, E-ISSN 1557-9999, Vol. 23, no 12, 2992-3005 p.Article in journal (Refereed)
    Abstract [en]

    Large temperature gradients exacerbate various types of defects including early-life failures and delay faults. Efficient detection of these defects requires that burn-in and test for delay faults, respectively, are performed when temperature gradients with proper magnitudes are enforced on an Integrated Circuit (IC). This issue is much more important for 3-D stacked ICs (3-D SICs) compared with 2-D ICs because of the larger temperature gradients in 3-D SICs. In this paper, two methods to efficiently enforce the specified temperature gradients on the IC, for burn-in and delay-fault test, are proposed. The specified temperature gradients are enforced by applying high-power stimuli to the cores of the IC under test through the test access mechanism. Therefore, no external heating mechanism is required. The tests, high power stimuli, and cooling intervals are scheduled together based on temperature simulations so that the desired temperature gradients are rapidly enforced. The schedule generation is guided by functions derived from a set of thermal equations. The experimental results demonstrate the efficiency of the proposed methods.

  • 42.
    Aghighi, Meysam
    et al.
    Linköping University, Department of Computer and Information Science, Software and Systems. Linköping University, Faculty of Science & Engineering.
    Bäckström, Christer
    Linköping University, Department of Computer and Information Science, Software and Systems. Linköping University, Faculty of Science & Engineering.
    Jonsson, Peter
    Linköping University, Department of Computer and Information Science, Software and Systems. Linköping University, Faculty of Science & Engineering.
    Ståhlberg, Simon
    Linköping University, Department of Computer and Information Science, Software and Systems. Linköping University, Faculty of Science & Engineering.
    Analysing Approximability and Heuristics in Planning Using the Exponential-Time Hypothesis2016In: ECAI 2016: 22ND EUROPEAN CONFERENCE ON ARTIFICIAL INTELLIGENCE, IOS Press, 2016, Vol. 285, 184-192 p.Conference paper (Refereed)
    Abstract [en]

    Cost-optimal planning has become a very well-studied topic within planning. Needless to say, cost-optimal planning has proven to be computationally hard both theoretically and in practice. Since cost-optimal planning is an optimisation problem, it is natural to analyse it from an approximation point of view. Even though such studies may be valuable in themselves, additional motivation is provided by the fact that there is a very close link between approximability and the performance of heuristics used in heuristic search. The aim of this paper is to analyse approximability (and indirectly the performance of heuristics) with respect to lower time bounds. That is, we are not content by merely classifying problems into complexity classes - we also study their time complexity. This is achieved by replacing standard complexity-theoretic assumptions (such as P not equal NP) with the exponential time hypothesis (ETH). This enables us to analyse, for instance, the performance of the h(+) heuristic and obtain general trade-off results that correlate approximability bounds with bounds on time complexity.

  • 43.
    Aghighi, Meysam
    et al.
    Linköping University, Department of Computer and Information Science, Software and Systems. Linköping University, Faculty of Science & Engineering.
    Bäckström, Christer
    Linköping University, Department of Computer and Information Science, Software and Systems. Linköping University, Faculty of Science & Engineering.
    Jonsson, Peter
    Linköping University, Department of Computer and Information Science, Software and Systems. Linköping University, Faculty of Science & Engineering.
    Ståhlberg, Simon
    Linköping University, Department of Computer and Information Science, Software and Systems. Linköping University, Faculty of Science & Engineering.
    Refining complexity analyses in planning by exploiting the exponential time hypothesis2016In: Annals of Mathematics and Artificial Intelligence, ISSN 1012-2443, E-ISSN 1573-7470, Vol. 78, no 2, 157-175 p.Article in journal (Refereed)
    Abstract [en]

    The use of computational complexity in planning, and in AI in general, has always been a disputed topic. A major problem with ordinary worst-case analyses is that they do not provide any quantitative information: they do not tell us much about the running time of concrete algorithms, nor do they tell us much about the running time of optimal algorithms. We address problems like this by presenting results based on the exponential time hypothesis (ETH), which is a widely accepted hypothesis concerning the time complexity of 3-SAT. By using this approach, we provide, for instance, almost matching upper and lower bounds onthe time complexity of propositional planning.

  • 44.
    Aghighi, Meysam
    et al.
    Linköping University, Department of Computer and Information Science, Software and Systems. Linköping University, The Institute of Technology.
    Jonsson, Peter
    Linköping University, Department of Computer and Information Science, Software and Systems. Linköping University, The Institute of Technology.
    Oversubscription planning: Complexity and compilability2014In: Proceedings of the Twenty-Eighth AAAI Conference on Artificial Intelligence, AI Access Foundation , 2014, Vol. 3, 2221-2227 p.Conference paper (Refereed)
    Abstract [en]

    Many real-world planning problems are oversubscription problems where all goals are not simultaneously achievable and the planner needs to find a feasible subset. We present complexity results for the so-called partial satisfaction and net benefit problems under various restrictions; this extends previous work by van den Briel et al. Our results reveal strong connections between these problems and with classical planning. We also present a method for efficiently compiling oversubscription problems into the ordinary plan existence problem; this can be viewed as a continuation of earlier work by Keyder and Geffner.

  • 45.
    Aghili, Mohammed
    Linköping University, Department of Computer and Information Science.
    Jämförelse av aggregeringswebbdelar i MOSS 20072010Independent thesis Advanced level (degree of Master (Two Years)), 20 credits / 30 HE creditsStudent thesis
    Abstract [sv]

    En typisk funktion på startsidan till många webbportaler är den webbdel som presenterar exempelvis desenaste blogginläggen, nyheterna eller händelserna som har lagts till på webbplatsen. Dessa funktioner ärkända som aggreggeringswebbdelar. Eftersom startsidan är den sida som besöks mest jämfört med alla andrawebbsidor i portalen innebär det i sin tur att denna funktion utnyttjas väldigt ofta.Detta arbete syftar till att finna ett antal olika metoder som kan användas för att uppnå denna funktion ochatt ta reda på hur väl dessa webbdelar presterar.Denna rapport presenterar både de olika metoder som fanns och resultaten på en systematisk testning avdessa. Resultaten av testerna presenteras på ett överskådligt sätt.Slutligen dras slutsatser angående resultaten. Resultaten förespråkar inte en specifik metod, den metod somlämpar sig bäst för varje enskild sammanhang avgörs till största del av andra faktorer såsom frekvens avbesökare eller ändringar på innehållet som metoden söker igenom.

  • 46.
    Ahl, Linda
    Linköping University, Department of Computer and Information Science.
    Hur fungerar datorer?: En fallstudie av att utveckla pedagogisk multimedia för ett datorhistoriskt museum.2004Independent thesis Basic level (professional degree)Student thesis
    Abstract [sv]

    Få människor vet hur datorer fungerar, vilka komponenter de är uppbyggda av och hur dessa samverkar. I detta examensarbete har en prototyp till en multimediepresentation utvecklats. Presentationen kommer att placeras på ett datorhistoriskt museum och dess syfte kommer där att vara att hjälpa människor förstå hur datorer fungerar. Prototypen är baserad på bilder och enklare animationer som förklarar samverkan och funktion hos de olika datorkomponenterna, bland annat genom att visa scenarier som många människor troligtvis känner igen från sin vardag.

    Målet med arbetet har varit att inskaffa kunskap kring hur multimedia kan användas för att illustrera tekniska processer, samt kunskap kring hur multimediepresentationer skall utveck-las. Därför har en systemutvecklingsmetod tagits fram som är anpassad till denna typ av system och som använts vid utvecklingen av prototypen.

    Systemutvecklingsmetoden är av iterativ modell, eftersom det visat sig att ett iterativt arbetssätt är att föredra framför ett linjärt vid multimedieutveckling. Detta beror på att det i denna typ av arbete där det till en början oftast är oklart vilka krav och önskemål som finns på slutprodukten är svårt att gå enkelriktat genom utvecklingsprocessen, d v s att göra ett steg helt färdigt innan nästa påbörjas.

    När det gäller multimedia är en slutsats att det med fördel kan användas för att visa och förklara tekniska förlopp och att det verkar vara ett användbart hjälpmedel inom utbildning och museiverksamhet.

  • 47.
    Ahlberg, Gustav
    Linköping University, Department of Computer and Information Science, Database and information techniques. Linköping University, The Institute of Technology.
    Generating web applications containing XSS and CSRF vulnerabilities2014Independent thesis Advanced level (degree of Master (Two Years)), 20 credits / 30 HE creditsStudent thesis
    Abstract [en]

    Most of the people in the industrial world are using several web applications every day. Many of those web applications contain vulnerabilities that can allow attackers to steal sensitive data from the web application's users. One way to detect these vulnerabilities is to have a penetration tester examine the web application. A common way to train penetration testers to find vulnerabilities is to challenge them with realistic web applications that contain vulnerabilities. The penetration tester's assignment is to try to locate and exploit the vulnerabilities in the web application. Training on the same web application twice will not provide any new challenges to the penetration tester, because the penetration tester already knows how to exploit all the vulnerabilities in the web application. Therefore, a vast number of web applications and variants of web applications are needed to train on.

    This thesis describes a tool designed and developed to automatically generate vulnerable web applications. First a web application is prepared, so that the tool can generate a vulnerable version of the web application. The tool injects Cross Site Scripting (XSS) and Cross Site Request Forgery (CSRF) vulnerabilities in prepared web applications. Different variations of the same vulnerability can also be injected, so that different methods are needed to exploit the vulnerability depending on the variation. A purpose of the tool is that it should generate web applications which shall be used to train penetration testers, and some of the vulnerabilities the tool can inject, cannot be detected by current free web application vulnerability scanners, and would thus need to be detected by a penetration tester.

    To inject the vulnerabilities, the tool uses abstract syntax trees and taint analysis to detect where vulnerabilities can be injected in the prepared web applications.

    Tests confirm that web application vulnerability scanners cannot find all the vulnerabilities on the web applications which have been generated by the tool.

  • 48.
    Ahlberg, Jörgen
    et al.
    Linköping University, Department of Electrical Engineering, Computer Vision. Linköping University, Faculty of Science & Engineering.
    Arsic, Dejan
    Munich University of Technology, Germany.
    Ganchev, Todor
    University of Patras, Greece.
    Linderhed, Anna
    FOI Swedish Defence Research Agency.
    Menezes, Paolo
    University of Coimbra, Portugal.
    Ntalampiras, Stavros
    University of Patras, Greece.
    Olma, Tadeusz
    MARAC S.A., Greece.
    Potamitis, Ilyas
    Technological Educational Institute of Crete, Greece.
    Ros, Julien
    Probayes SAS, France.
    Prometheus: Prediction and interpretation of human behaviour based on probabilistic structures and heterogeneous sensors2008Conference paper (Refereed)
    Abstract [en]

    The on-going EU funded project Prometheus (FP7-214901) aims at establishing a general framework which links fundamental sensing tasks to automated cognition processes enabling interpretation and short-term prediction of individual and collective human behaviours in unrestricted environments as well as complex human interactions. To achieve the aforementioned goals, the Prometheus consortium works on the following core scientific and technological objectives:

    1. sensor modeling and information fusion from multiple, heterogeneous perceptual modalities;

    2. modeling, localization, and tracking of multiple people;

    3. modeling, recognition, and short-term prediction of continuous complex human behavior.

  • 49.
    Ahlberg, Jörgen
    et al.
    Linköping University, Department of Electrical Engineering, Information Coding. Linköping University, Department of Electrical Engineering, Computer Vision. Linköping University, Faculty of Science & Engineering. Termisk Systemteknik AB, Linköping, Sweden.
    Berg, Amanda
    Linköping University, Department of Electrical Engineering, Computer Vision. Linköping University, Faculty of Science & Engineering. Termisk Systemteknik AB, Linköping, Sweden.
    Evaluating Template Rescaling in Short-Term Single-Object Tracking2015Conference paper (Refereed)
    Abstract [en]

    In recent years, short-term single-object tracking has emerged has a popular research topic, as it constitutes the core of more general tracking systems. Many such tracking methods are based on matching a part of the image with a template that is learnt online and represented by, for example, a correlation filter or a distribution field. In order for such a tracker to be able to not only find the position, but also the scale, of the tracked object in the next frame, some kind of scale estimation step is needed. This step is sometimes separate from the position estimation step, but is nevertheless jointly evaluated in de facto benchmarks. However, for practical as well as scientific reasons, the scale estimation step should be evaluated separately – for example,theremightincertainsituationsbeothermethodsmore suitable for the task. In this paper, we describe an evaluation method for scale estimation in template-based short-term single-object tracking, and evaluate two state-of-the-art tracking methods where estimation of scale and position are separable.

  • 50.
    Ahlberg, Jörgen
    et al.
    Swedish Defence Research Agency (FOI), Linköping, Sweden.
    Dornaika, Fadi
    Linköping University, Department of Electrical Engineering, Image Coding. Linköping University, The Institute of Technology.
    Efficient active appearance model for real-time head and facial feature tracking2003In: Analysis and Modeling of Faces and Gestures, 2003. AMFG 2003. IEEE International Workshop on, IEEE conference proceedings, 2003, 173-180 p.Conference paper (Refereed)
    Abstract [en]

    We address the 3D tracking of pose and animation of the human face in monocular image sequences using active appearance models. The classical appearance-based tracking suffers from two disadvantages: (i) the estimated out-of-plane motions are not very accurate, and (ii) the convergence of the optimization process to desired minima is not guaranteed. We aim at designing an efficient active appearance model, which is able to cope with the above disadvantages by retaining the strengths of feature-based and featureless tracking methodologies. For each frame, the adaptation is split into two consecutive stages. In the first stage, the 3D head pose is recovered using robust statistics and a measure of consistency with a statistical model of a face texture. In the second stage, the local motion associated with some facial features is recovered using the concept of the active appearance model search. Tracking experiments and method comparison demonstrate the robustness and out-performance of the developed framework.

1234567 1 - 50 of 5517
CiteExportLink to result list
Permanent link
Cite
Citation style
  • apa
  • harvard1
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • oxford
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf