liu.seSearch for publications in DiVA
Change search
Refine search result
1234567 1 - 50 of 2733
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.
    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)
  • 2.
    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)
  • 3.
    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)
  • 4.
    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.

  • 5.
    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.

  • 6.
    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.

  • 7.
    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.

  • 8.
    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.

  • 9.
    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.

  • 10.
    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.

  • 11.
    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.

  • 12.
    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
  • 13.
    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)
  • 14.
    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.

  • 15.
    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.

  • 16.
    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.

  • 17.
    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.

  • 18.
    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.

  • 19.
    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.

  • 20.
    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.

  • 21.
    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.

  • 22.
    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.

  • 23.
    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.

  • 24.
    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.

  • 25.
    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.

  • 26.
    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.

  • 27.
    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.

  • 28.
    Ahlstedt, Kristoffer
    et al.
    Linköping University, Department of Computer and Information Science.
    Annerwall, Lovisa
    Linköping University, Department of Computer and Information Science.
    Axelsson, Daniel
    Linköping University, Department of Computer and Information Science.
    Björklund, Samuel
    Linköping University, Department of Computer and Information Science.
    Cedenheim, Oliver
    Linköping University, Department of Computer and Information Science.
    Eriksson, Josefin
    Linköping University, Department of Computer and Information Science.
    Lehtonen, Jesper
    Linköping University, Department of Computer and Information Science.
    Lorentzon, Linn
    Linköping University, Department of Computer and Information Science.
    Olofsson, Gustaf
    Linköping University, Department of Computer and Information Science.
    BryggaHem – Development of an E-commerce Web Application with a Usability Focus2015Independent thesis Basic level (degree of Bachelor), 10 credits / 15 HE creditsStudent thesis
    Abstract [en]

    This thesis is part of a bachelor’s project conducted at Linköping University and addresses the development of an e-commerce web application with a usability focus. A market survey was conducted as part of the project to establish the orientation of the web application. Furthermore, the Scrum methodology is described and analyzed, and the team’s experiences of the project are documented. Research relevant to designing an application with high usability is detailed. Additionally the thesis addresses the tools and frameworks used during the development of the application, as well as ethical aspects of handling user information and selling products related to home-brewing of alcoholic beverages. The conclusion drawn from the project regarding the methodology is that Scrum is a viable methodology for this type of development work, although it requires small teams as well as previous experience of Scrum to yield high efficiency. The conclusion drawn from the project regarding usability is that it is achieved through a combination of variables that to a large extent is based on users’ distinct perceptions of the given application. 

  • 29.
    Ahlström, Martin
    Linköping University, Department of Computer and Information Science.
    User-centred redesign of a business systemusing the Star Life Cycle method2008Independent thesis Advanced level (degree of Master), 20 points / 30 hpStudent thesis
    Abstract [en]

    The purpose with this thesis was to study user activities in a business system, MediusFlow. The overall objective was to identify user related problems and to analyse which of the usability data gathering methods to use in the future development process of the company Medius.

    The outcome of this study indicated that a cognitive related user problem was the most important problem to solve. A Star Life Cycle method was preferred. Two low-fidelity prototypes were developed to exemplify an alternative design solution to the identified cognitive user problem. Furthermore, the two best methods to use when gathering user related requirements were heuristic evaluation and expert review.

    In addition a company specific Style Guide was created with generic guidelines as a foundation for development of future applications within Medius.

  • 30.
    Ahlström, Petter
    Linköping University, Department of Computer and Information Science, EISLAB - Economic Information Systems. Linköping University, The Institute of Technology.
    Affärsstrategier för seniorbostadsmarknaden2005Licentiate thesis, monograph (Other academic)
    Abstract [sv]

    Den demografiska utvecklingen i Sverige går mot en befolkningssammansättning med allt högre medelålder. Enligt svenska befolkningsprognoser kommer nästan var fjärde svensk år 2025 att vara över 65 år. Den äldre andelen av befolkningen utgör en välbeställd grupp med relativt stora realekonomiska tillgångar. Attitydundersökningar på morgondagens pensionärer talar för att denna grupp ställer högre krav på boendeutformning, kringservice, vård och omsorg än tidigare generationer. Flera studier visar på en ökad betalningsvilja och betalningsförmåga för alternativa service- och boendeformer. Samtidigt försöker olika marknadsaktörer att positionera ett produkt- och tjänsteutbud inom en bostadsmarknadens nischer, här definierad som seniorbostadsmarknaden. På seniorbostadsmarknaden har ett särskilt segment identifierats där utöver seniorboende även service-, vård- och omsorgsrelaterade kringtjänster bjuds ut. Mot den bakgrunden har avhandlingens problemställning formulerats enligt följande: vad skapar en stark marknadsposition för en aktör på seniorbostadsmarknaden med integrerad service, vård och omsorg?

    Utgångspunkten har varit ett sannolikt scenario där privata initiativ i allt större utsträckning kommer att bidra till framtida boendelösningar riktade till samhällets seniora och äldrebefolkningsgrupper. Syftet med avhandlingen har varit dels att identifiera de framgångsfaktorer som kan antas ligger till grund för en stark marknadsposition, dels att skapa en typologi över olika affärsstrategier. Genom en branschanalys har det i avhandlingen påvisats att seniorbostadsmarknaden är en nischmarknad med marginell omfattning. Avhandlingens empiriska undersökning har designats som en fältstudie. Fältstudien har i sin tur bl.a. genomförts i form av en förstudie och en intervjustudie. Intervjustudien ägde rum under hösten 2004 med platsbesök och intervjuer av verksamhetsföreträdare för elva utvalda fallstudieorganisationer. Utifrån ett antal i förhand uppställda kriterier har marknadsaktörernas framgångsfaktorer identifierats. Den bearbetnings- och analysmodell som konstruerats för detta syfte och som använts för att analysera fältstudiens empiri är baserad på studier inom strategiområdet. Modellen har bl.a. inspirerats av forskare som Miles & Snow (1978), Porter (1980) och Gupta & Govindarajan (1984). Vidare bygger den på antagandena om resursers och kompetensers betydelse för strategiformuleringen. Service management, och då särskilt tjänsters sammansättning, är ett annat område som beaktas. Analysmodellen har byggts upp kring fem dimensioner: omgivning, strategi, resurser, tjänstekoncept och konkurrens. De identifierade framgångsfaktorerna har baserats på intervjustudiens två mest framgångsrika aktörer. Resultatet har formulerats i ett antal strategiska vägval vilka kan sammanfattas i begreppen: differentiering, fokus, integration, samverkan, kontroll, verksamhetsutveckling, kärnkompetens och resurser. I avhandlingen påvisas att aktörer som bedriver framgångsrik verksamhet på seniorbostadsmarknaden till stora delar följer det Porter (1980) definierat som en differentieringsstrategi med fokus. Avhandlingen har också utmynnat i en affärsstrategisk typologi för seniorbostadsmarknaden. Dessa tentativa slutsatser har formulerats i fyra strategiska idealtyper: förvaltare, konceptbyggare, entreprenörer och idealister.

  • 31.
    Ahlström, Petter
    et al.
    Linköping University, The Institute of Technology. Linköping University, Department of Computer and Information Science, EISLAB - Economic Information Systems.
    Nilsson, Fredrik
    Linköping University, The Institute of Technology. Linköping University, Department of Computer and Information Science, EISLAB - Economic Information Systems.
    Affärsstrategier och seniorbostadsmarknaden2005In: Fastighetsnytt, ISSN 1104-8913, Vol. 12 nr 5, 36-37 p.Article in journal (Other (popular science, discussion, etc.))
    Abstract [sv]

      Artikeln beskriver några av resultaten från licentiatavhandlingen "Affärsstrategier för seniorbostadsmarknaden" av Petter Ahlström.      

  • 32.
    Ahmed, Ali
    Linköping University, Department of Computer and Information Science, Human-Centered systems. Linköping University, The Institute of Technology.
    A Systematic Literature Review of "Usability Inspection Methods"2013Independent thesis Advanced level (degree of Master (Two Years)), 20 credits / 30 HE creditsStudent thesis
    Abstract [en]

    Objective: Usability inspection methods are a class of usability evaluation methods, applied by usability evaluators to assess usability related aspects of different user interfaces. Different usability inspection methods are proposed so far to evaluate user interfaces in a better way. This systematic literature review summarized different usability evaluation methods, with more focus on two widely used inspection methods. The review also summarized the problems with these two methods and probable proposed solution to cope with these problems.

    Method: A systematic review method as described by Kitchenham [3] was followed to carry out this review. The identified problems in the review were structured in a form of questions. The search to find the relevant data that address the identified questions were conducted on the basis of planned search strategies. Papers were selected on the basis of inclusion and exclusion criteria in accordance with the quality checklist; followed by data extraction and synthesis strictly characterized by quality checklist, inclusion and exclusion criteria to attain better results.

    Results and discussion: Despite of its advantages there still exists many weaknesses in Heuristic evaluation (HE) and Cognitive walk-through (CW) methods. Different studies have highlighted different factors that may influence the results. Those factors include number of evaluators, evaluator’s perception and experience, time, environment, cost, indigenous design, the way method applied and acquired software.

    Conclusion: To get better evaluation results, it is best to use different techniques for usability evaluation of single software or optimize existing techniques.

  • 33.
    Ahmetspahic, Emir
    Linköping University, Department of Computer and Information Science.
    Distributed Computing in Peer-to-peer Networks2004Independent thesis Basic level (professional degree)Student thesis
    Abstract [en]

    Concepts like peer-to-peer networks and distributed computing are not new. They have been available in different forms for a long time. This thesis examines the possibility of merging these concepts. The assumption is that non-centralized peer-to-peer networks can be used for effective sharing of computing resources. While most peer-to-peer systems today concentrate on sharing of data in various forms, this thesis concentrates on sharing of clock cycles instead of files.

  • 34.
    Ahrenberg, Lars
    Linköping University, The Institute of Technology. Linköping University, Department of Computer and Information Science, NLPLAB - Natural Language Processing Laboratory.
    Codified Close Translation as a Standard for MT2005In: Conference of the European Association for Machine Translation,2005, Budapest: EAMT , 2005, 13- p.Conference paper (Refereed)
  • 35.
    Ahrenberg, Lars
    Linköping University, Department of Computer and Information Science, NLPLAB - Natural Language Processing Laboratory. Linköping University, The Institute of Technology.
    LinES: An English-Swedish Parallel Treebank2007In: Proceedings of 16th Nordic Conference of Computational Linguistics Nodalida,2007 / [ed] Joakim Nivre, Heiki-Jaan Kaalep, Kadri Muischnek, Mare Koit, Tartu, Estonia: University of Tartu , 2007, 270-273 p.Conference paper (Refereed)
    Abstract [en]

    This paper presents an English-Swedish Parallel Treebank, LinES, that is currently under development. LinES is intended as a resource for the study of variation in translation of common syntactic constructions from English to Swedish. For this reason, annotation in LinES is syntactically oriented, multi-level, complete and manually reviewed according to guidelines. Another aim of LinES is to support queries made in terms of types of translation shifts.

  • 36.
    Ahrenberg, Lars
    Linköping University, The Institute of Technology. Linköping University, Department of Computer and Information Science, NLPLAB - Natural Language Processing Laboratory.
    Searching Parallel Treebanks for Translation Relations2008In: Resourceful Language Technology: Festschrift in Honor of Anna Sågvall Hein, Uppsala: Acta Universitatis Upsaliensis , 2008, 1, 11-20 p.Chapter in book (Other academic)
    Abstract [en]

    As the first holder of the first chair in computational linguistics in Sweden, Anna Sågvall Hein has played a central role in the development of computational linguistics and language technology both in Sweden and on the international scene. Besides her valuable contributions to research, which include work on machine translation, syntactic parsing, grammar checking, word prediction, and corpus linguistics, she has been instrumental in establishing a national graduate school in language technology as well as an undergraduate program in language technology at Uppsala University. It is with great pleasure that we present her with this Festschrift to honor her lasting contributions to the field and to commemorate her retirement from the chair in computational linguistics at Uppsala University. The contributions to the Festschrift come from Anna’s friends and colleagues around the world and deal with many of the topics that are dear to her heart. A common theme in many of the articles, as well as in Anna’s own scientific work, is the design, development and use of adequate language technology resources, epitomized in the title Resourceful Language Technology.

  • 37.
    Ahrenberg, Lars
    et al.
    Linköping University, Department of Computer and Information Science, NLPLAB - Natural Language Processing Laboratory. Linköping University, The Institute of Technology.
    Andersson, Mikael
    Merkel, Magnus
    Linköping University, Department of Computer and Information Science, NLPLAB - Natural Language Processing Laboratory. Linköping University, The Institute of Technology.
    A System for Incremental and Interactive Word Linking2002In: In Third International Conference on Language Resources and Evaluation (LREC 2002), Las Palmas, 29-31 May 2002., European Language Resources Association (ELRA) , 2002, 485-490 p.Conference paper (Refereed)
    Abstract [en]

    Aligned parallel corpora constitute a critical information resource for a great number of linguistic and technological endeavors. Automatic sentence alignment has reached a level whereby large parallel documents can be fully aligned with the aid of interactive post-editing tools. Word alignment systems have not yet reached the same level of performance, but are good enough to support full word alignment if embedded in an interactive system. In this paper we describe a system for fast and accurate word alignment currently under development at our department, where the user can review and improve the output from an automatic system in an incremental fashion.

  • 38.
    Ahsan, Naveed
    et al.
    Linköping University, Department of Electrical Engineering, Electronic Devices. Linköping University, The Institute of Technology.
    Ouacha, Aziz
    Linköping University, Department of Electrical Engineering, Electronic Devices. Linköping University, The Institute of Technology.
    Dabrowski, Jerzy
    Linköping University, Department of Electrical Engineering, Electronic Devices. Linköping University, The Institute of Technology.
    Samuelsson, Carl
    Swedish Defence Research Agency (FOI), P.O. Box 1165, SE-581 11 Linköping, Sweden.
    Dual Band Tunable LNA for Flexible RF Front End2007In: Proceedings of the IEEE International Bhurban Conference on Applied Sciences & Technology (IBCAST 2007), January 8-11, 2007, Islamabad, Pakistan, IEEE Explore , 2007, 19-22 p.Conference paper (Refereed)
    Abstract [en]

    This paper presents a dual band LNA that can be switched between two bands (2.4 GHz & 5.2 GHz) for IEEE 802.1 la/b/g WLAN applications. The LNA is also tunable within each band and the tuning is incorporated by on-chip varactors. The test chip consists of two fully integrated narrow-band tunable LNAs along with SPDT switch. For power saving one LNA can be switched off. The technology process is 0.2 mum GaAs offered by OMMIC. The LNA can achieve a relatively good performance over the two bands as demonstrated by simulation. With a 3V supply, the LNA has a gain of 26.2 dB at 2.4 GHz and 21.8 dB at 5.2 GHz and the corresponding NF varies between 2.07 dB and 1.84 dB, respectively. The LNA has an IIP3 of -7 dBm at 2.4 GHz and -1.6 dBm at 5.2 GHz.

  • 39.
    Ahsan, Naveed
    et al.
    Linköping University, Department of Electrical Engineering, Electronic Devices. Linköping University, The Institute of Technology.
    Ouacha, Aziz
    Linköping University, Department of Electrical Engineering, Electronic Devices. Linköping University, The Institute of Technology.
    Samuelsson, Carl
    Swedish Defence Research Agency (FOI), P.O. Box 1165, SE-581 11 Linköping, Sweden.
    Boman, Tomas
    Swedish Defence Research Agency (FOI), P.O. Box 1165, SE-581 11 Linköping, Sweden.
    Applications of Programmable Microwave Function Array (PROMFA)2007In: Proceedings of the IEEE European Conference on Circuit Theory and Design (ECCTD 2007), August 26-30, 2007, Seville, Spain, IEEE , 2007, 164 -167 p.Conference paper (Refereed)
    Abstract [en]

    This paper describes the use of programmable microwave function array (PROMFA) for different microwave application. The PROMFA concept is based on an array of generic cells, in which a number of different functions can be realized. Each PROMFA cell is a four-port circuit, that can either be programmed independently or collectively according to a specific need. Specifically, the phase shift capability in a single PROMFA cell, useful for a new type of phase shifter design is discussed. The paper also presents the functionality of this new architecture as a beamforming network. As an example case an active corporate feed network and a tunable recursive filter is demonstrated. Simulated and measured results are presented.

  • 40.
    Ajma, Muhammad
    et al.
    Linköping University, Department of Electrical Engineering, Information Coding. Linköping University, The Institute of Technology.
    Furdek, Marija
    School of Information and Communication Technology, KTH Royal Institute of Technology, Stockholm, Sweden / Faculty of Electrical Engineering and Computing, Dept. of Telecommunications, University of Zagreb, Croatia.
    Monti, Paolo
    School of Information and Communication Technology, KTH Royal Institute of Technology, Stockholm, Sweden.
    Wosinska, Lena
    School of Information and Communication Technology, KTH Royal Institute of Technology, Stockholm, Sweden.
    Forchheimer, Robert
    Linköping University, Department of Electrical Engineering, Information Coding. Linköping University, The Institute of Technology.
    Dynamic provisioning utilizing redundant modules in elastic optical networks based on architecture on demand nodes2014In: European Conference on Optical Communication (ECOC), 2014, IEEE , 2014, 1-3 p.Conference paper (Refereed)
    Abstract [en]

    Survivable synthetic ROADMs are equipped with redundant switching modules to support failure recovery. The paper proposes a dynamic connection provisioning strategy which exploits these idle redundant modules to provision regular traffic resulting in a substantial improvement in the blocking performance.

  • 41.
    Ajmal, Muhammad
    et al.
    Linköping University, Department of Electrical Engineering, Information Coding. Linköping University, The Institute of Technology.
    Cavdar, Cicek
    Royal Institute of Technology, KTH, Stockholm, Sweden.
    Wosinska, Lena
    Royal Institute of Technology, KTH, Stockholm, Sweden.
    Forchheimer, Robert
    Linköping University, Department of Electrical Engineering, Information Coding. Linköping University, The Institute of Technology.
    Trading Quality of Transmission for Improved Blocking Performance in All-Optical Networks2013In: Asia Communications and Photonics Conference 2013, 2013, AF4E.5- p.Conference paper (Refereed)
    Abstract [en]

    We propose a connection provisioning strategy in dynamic all-optical networks, which exploit the possibility to allow a tolerable signal quality degradation during a small fraction of holding-time resulting in a significant improvement of blocking performance.

  • 42.
    Ajmal, Muhammad
    et al.
    Linköping University, Department of Electrical Engineering, Information Coding. Linköping University, The Institute of Technology.
    Furdek, Marija
    Royal Institute of Technology, KTH, Stockholm, Sweden / Dept. of Telecommunications, University of Zagreb, Croatia.
    Monti, Paolo
    Royal Institute of Technology, KTH, Stockholm, Sweden.
    Wosinska, Lena
    Royal Institute of Technology, KTH, Stockholm, Sweden.
    Forchheimer, Robert
    Linköping University, Department of Electrical Engineering, Information Coding. Linköping University, The Institute of Technology.
    An Optimization Model for Dynamic Bulk Provisioning in Elastic Optical Networks2014In: Asia Communications and Photonics Conference 2014, Optics Info Base, Optical Society of America, 2014, AF3E.6- p.Conference paper (Refereed)
    Abstract [en]

    We investigate benefits of setup-delay tolerance in elastic optical networks and propose an optimization model for dynamic and concurrent connection provisioning. Simulation shows that the proposed strategy offers significant improvement of the network blocking performance.

  • 43.
    Akhlaq, Faisal
    et al.
    Linköping University, Department of Computer and Information Science.
    Loganathan, Sumathi
    Linköping University, Department of Computer and Information Science.
    Assembler Generator and Cycle-Accurate Simulator Generator for NoGAP2010Independent thesis Advanced level (degree of Master (Two Years)), 20 credits / 30 HE creditsStudent thesis
    Abstract [en]

    System-on-Chip is increasingly built using ASIP(Application  Specific Instruction set Processor) due to the flexibility and efficiency obtained from ASIPs. NoGAP (Novel Generator of Accelerator and Processor framework) is an innovative approach for  ASIP design, which provides the advantage of both ADL (Architecture  Description Language) and HDL (Hardware Description Language) to the  designer.

    For the processors designed using NoGAP, software tools need to be automatically generated, to aid the  designer in programming and verifying the processor. As part of the master thesis work, we have developed two generators namely Assembler generator and Cycle-Accurate Simulator generator for NoGAP using C++. The Assembler generator automatically generates an assembler, which is used to convert the assembly code written by a programmer into relocatable binary code. The Cycle-Accurate Simulator generator automatically generates a cycle-accurate simulator to model the behavior of the designed processor. Both these generators are static, and can be used to generate the tools for any processor created using NoGAP.

    In this report, we have detailed the concepts behind the generators,and the implementation details of the generators. We have listed the results obtained from running assembler and cycle-accurate simulator on a test processor created using NoGAP.

  • 44.
    Akin, H. Levent
    et al.
    Bogazici University, Turkey.
    Ito, Nobuhiro
    Aichi Institute of Technology, Japan.
    Jacoff, Adam
    National Institute of Standards, USA.
    Kleiner, Alexander
    Linköping University, Department of Computer and Information Science, Artificial Intelligence and Intergrated Computer systems. Linköping University, The Institute of Technology.
    Pellenz, Johannes
    V&R Vision & Robotics GmbH, Germany.
    Visser, Arnoud
    University of Amsterdam, Holland.
    RoboCup Rescue Robot and Simulation Leagues2013In: The AI Magazine, ISSN 0738-4602, Vol. 34, no 1Article in journal (Refereed)
    Abstract [en]

    The RoboCup Rescue Robot and Simulation competitions have been held since 2000. The experience gained during these competitions has increased the maturity level of the field, which allowed deploying robots after real disasters (e.g. Fukushima Daiichi nuclear disaster). This article provides an overview of these competitions and highlights the state of the art and the lessons learned.

  • 45.
    Alansari, Hayder
    Linköping University, Department of Computer and Information Science.
    Clustered Data Management in Virtual Docker Networks Spanning Geo-Redundant Data Centers: A Performance Evaluation Study of Docker Networking2017Independent thesis Advanced level (degree of Master (Two Years)), 20 credits / 30 HE creditsStudent thesis
    Abstract [en]

    Software containers in general and Docker in particular is becoming more popular both in software development and deployment. Software containers are intended to be a lightweight virtualization that provides the isolation of virtual machines with a performance that is close to native. Docker does not only provide virtual isolation but also virtual networking to connect the isolated containers in the desired way. Many alternatives exist when it comes to the virtual networking provided by Docker such as Host, Macvlan, Bridge, and Overlay networks. Each of these networking solutions has its own advantages and disadvantages.

    One application that can be developed and deployed in software containers is data grid system. The purpose of this thesis is to measure the impact of various Docker networks on the performance of Oracle Coherence data grid system. Therefore, the performance metrics are measured and compared between native deployment and Docker built-in networking solutions. A scaled-down model of a data grid system is used along with benchmarking tools to measure the performance metrics.

    The obtained results show that changing the Docker networking has an impact on performance. In fact, some results suggested that some Docker networks can outperform native deployment. The conclusion of the thesis suggests that if performance is the only consideration, then Docker networks that showed high performance can be used. However, real applications require more aspects than performance such as security, availability, and simplicity. Therefore Docker network should be carefully selected based on the requirements of the application.

  • 46.
    Albinsson, Per-Anders
    et al.
    Swedish Defence Research Agency.
    Dahlbäck, Nils
    Linköping University, Department of Computer and Information Science, NLPLAB - Natural Language Processing Laboratory. Linköping University, The Institute of Technology.
    Morin, Magnus
    Linköping University, Department of Computer and Information Science, ASLAB - Application Systems Laboratory. Linköping University, The Institute of Technology.
    Coupling Models of Complexity and Models of Cognition in a Systems Design Process2003In: Proceedings of the Conference People in Control 2003 (PIC2003), November 4-6, 2003, Amsterdam, The Netherlands. 2003, 2003Conference paper (Refereed)
  • 47.
    Albinsson, Pär-Anders
    et al.
    FOI.
    Dahlbäck, Nils
    Linköping University, The Institute of Technology. Linköping University, Department of Computer and Information Science, NLPLAB - Natural Language Processing Laboratory.
    Morin, Magnus
    Visuell Systemteknik.
    Coupling Models of Complexity and Models of Cognition in a Systems Design Process2004Conference paper (Refereed)
  • 48.
    Alenljung, Beatrice
    Linköping University, Department of Computer and Information Science. Linköping University, The Institute of Technology.
    Decision-making in the requirements engineering process: a human-centered approach2005Licentiate thesis, monograph (Other academic)
    Abstract [en]

    Complex decision-making is a prominent aspect of requirements engineering and the need for improved decision support for requirements engineers has been identified by a number of authors. A first step toward better decision support in requirements engineering is to understand decision-makers- complex decision situations. To gain a holistic perspective of the decision situation from a decision-makers perspective, a decision situation framework has been created. The framework evolved through a literature analysis of decision support systems and decision-making theories. The decision situation of requirements engineers has been studied at Ericsson Microwave Systems and is described in this thesis. Aspects of decision situations are decision matters, decision-making activities, and decision processes. Another aspect of decision situations is the factors that affect the decision-maker. A number of interrelated factors have been identified. Each factor consists of problems and these are related to decision-making theories. The consequences of this for requirements engineering decision support, represented as a list that consists of desirable high-level characteristics, are also discussed.

  • 49.
    Alesand, Elias
    et al.
    Linköping University, Department of Computer and Information Science.
    Sterneling, Hanna
    Linköping University, Department of Computer and Information Science.
    A shoulder-surfing resistant graphical password system2017Independent thesis Basic level (degree of Bachelor), 10 credits / 15 HE creditsStudent thesis
    Abstract [en]

    The focus of this report is to discuss graphical password systems and how they can contribute to handle security problems that threaten authentication processes. One such threat is shoulder-surfing attacks, which are also reviewed in this report. Three already existing systems that are claimed to be shoulder-surfing resilient are described and a new proposed system is presented and evaluated through a user study. Moreover, the system is compared to the mentioned existing systems to further evaluate the usability, memorability and the time it takes to authenticate. The user study shows that test subjects are able to remember their chosen password one week after having registered and signed in once. It is also shown that the average time to sign in to the system after five minutes of practice is within a range of 3.30 to 5.70 seconds. The participants in the experiments gave the system an average score above 68 on the System Usability Scale, which is the score of an average system.

  • 50.
    Alexandersson, Henrik
    et al.
    Linköping University, Department of Computer and Information Science.
    Bouganim, Jakob
    Linköping University, Department of Computer and Information Science.
    Do Ruibin, Kevin
    Linköping University, Department of Computer and Information Science.
    Gunnarsson, Daniel
    Linköping University, Department of Computer and Information Science.
    Hyllienmark, Erik
    Linköping University, Department of Computer and Information Science.
    Karlsson, Anton
    Linköping University, Department of Computer and Information Science.
    Nathanaelsson, Sara
    Linköping University, Department of Computer and Information Science.
    Ringqvist, Hugo
    Linköping University, Department of Computer and Information Science.
    En studie kring utvecklingen av webbapplikationen HappyBox2017Independent thesis Basic level (degree of Bachelor), 12 credits / 18 HE creditsStudent thesis
    Abstract [en]

    The purpose of the report was to examine how an online store selling dinner kits could be designed and implemented to be usable in reference to navigability while inducing trust and encouraging customer engagement. A pre-study was used to determine the interest for the product among the target audience. Thenceforth a prototype was developed and the design of the web application was formed. An iterative process was used during the development of the application and through usability testing the elements of the scientific question was evaluated. The report presents and discusses the design of the web application and how it has been used to fulfill the purpose of the report. Technical solutions regarding the modeling of the web application are discussed and motivated. Finally, it is argued that feedback and distinct buttons make the application trustworthy and easy to navigate over. Conclusions about customer engagement were difficult to make.

1234567 1 - 50 of 2733
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