liu.seSearch for publications in DiVA
Change search
Refine search result
45678910 301 - 350 of 6951
CiteExportLink to result list
Permanent link
Cite
Citation style
  • apa
  • 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)
  • Disputation date (earliest first)
  • Disputation date (latest 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)
  • Disputation date (earliest first)
  • Disputation date (latest 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.
  • 301.
    Andersson, Olov
    et al.
    Linköping University, Department of Computer and Information Science, Artificial Intelligence and Integrated Computer Systems. Linköping University, Faculty of Science & Engineering.
    Wzorek, Mariusz
    Linköping University, Department of Computer and Information Science, Artificial Intelligence and Integrated Computer Systems. Linköping University, Faculty of Science & Engineering.
    Doherty, Patrick
    Linköping University, Department of Computer and Information Science, Artificial Intelligence and Integrated Computer Systems. Linköping University, Faculty of Science & Engineering.
    Deep Learning Quadcopter Control via Risk-Aware Active Learning2017In: Proceedings of The Thirty-first AAAI Conference on Artificial Intelligence (AAAI) / [ed] Satinder Singh and Shaul Markovitch, AAAI Press, 2017, Vol. 5, p. 3812-3818Conference paper (Refereed)
    Abstract [en]

    Modern optimization-based approaches to control increasingly allow automatic generation of complex behavior from only a model and an objective. Recent years has seen growing interest in fast solvers to also allow real-time operation on robots, but the computational cost of such trajectory optimization remains prohibitive for many applications. In this paper we examine a novel deep neural network approximation and validate it on a safe navigation problem with a real nano-quadcopter. As the risk of costly failures is a major concern with real robots, we propose a risk-aware resampling technique. Contrary to prior work this active learning approach is easy to use with existing solvers for trajectory optimization, as well as deep learning. We demonstrate the efficacy of the approach on a difficult collision avoidance problem with non-cooperative moving obstacles. Our findings indicate that the resulting neural network approximations are least 50 times faster than the trajectory optimizer while still satisfying the safety requirements. We demonstrate the potential of the approach by implementing a synthesized deep neural network policy on the nano-quadcopter microcontroller.

  • 302.
    Andersson, Olov
    et al.
    Linköping University, Department of Computer and Information Science, Artificial Intelligence and Integrated Computer Systems. Linköping University, Faculty of Science & Engineering.
    Wzorek, Mariusz
    Linköping University, Department of Computer and Information Science, Artificial Intelligence and Integrated Computer Systems. Linköping University, Faculty of Science & Engineering.
    Rudol, Piotr
    Linköping University, Department of Computer and Information Science, Artificial Intelligence and Integrated Computer Systems. Linköping University, Faculty of Science & Engineering.
    Doherty, Patrick
    Linköping University, Department of Computer and Information Science, Artificial Intelligence and Integrated Computer Systems. Linköping University, Faculty of Science & Engineering.
    Model-Predictive Control with Stochastic Collision Avoidance using Bayesian Policy Optimization2016In: IEEE International Conference on Robotics and Automation (ICRA), 2016, Institute of Electrical and Electronics Engineers (IEEE), 2016, p. 4597-4604Conference paper (Refereed)
    Abstract [en]

    Robots are increasingly expected to move out of the controlled environment of research labs and into populated streets and workplaces. Collision avoidance in such cluttered and dynamic environments is of increasing importance as robots gain more autonomy. However, efficient avoidance is fundamentally difficult since computing safe trajectories may require considering both dynamics and uncertainty. While heuristics are often used in practice, we take a holistic stochastic trajectory optimization perspective that merges both collision avoidance and control. We examine dynamic obstacles moving without prior coordination, like pedestrians or vehicles. We find that common stochastic simplifications lead to poor approximations when obstacle behavior is difficult to predict. We instead compute efficient approximations by drawing upon techniques from machine learning. We propose to combine policy search with model-predictive control. This allows us to use recent fast constrained model-predictive control solvers, while gaining the stochastic properties of policy-based methods. We exploit recent advances in Bayesian optimization to efficiently solve the resulting probabilistically-constrained policy optimization problems. Finally, we present a real-time implementation of an obstacle avoiding controller for a quadcopter. We demonstrate the results in simulation as well as with real flight experiments.

  • 303.
    Andersson, Patrik
    et al.
    Linköping University, Department of Computer and Information Science. Linköping University, Faculty of Science & Engineering.
    Berntsen, David
    Linköping University, Department of Computer and Information Science. Linköping University, Faculty of Science & Engineering.
    Hultqvist, Tobias
    Linköping University, Department of Computer and Information Science. Linköping University, Faculty of Science & Engineering.
    Post, Jesper
    Linköping University, Faculty of Science & Engineering. Linköping University, Department of Computer and Information Science.
    Schlyter, Fredrik
    Linköping University, Faculty of Science & Engineering. Linköping University, Department of Computer and Information Science.
    Sibelius Parmbäck, Sebastian
    Linköping University, Faculty of Science & Engineering. Linköping University, Department of Computer and Information Science.
    Therén, Oskar
    Linköping University, Faculty of Science & Engineering. Linköping University, Department of Computer and Information Science.
    Iterativ utveckling av en adaptiv bildvisare för mobila plattformar2015Independent thesis Basic level (degree of Bachelor), 10 credits / 15 HE creditsStudent thesis
    Abstract [sv]

    Detta dokument behandlar ett kandidatarbete gjort av sju datateknikstudenter från Tekniska högskolan vid Linköpings universitet. Arbetet gick ut på att utveckla en webbapplikation för att visa bilder. Målet med webbapplikationen var inledningsvis vagt, den skulle visa bilder, ha någon metod för att ta reda på vilka bilder användaren gillade och sedan basera vilka bilder som skulle visas nästa gång på vilka som hade gillats.

    Dokumentet innehåller också ett kapitel om de erfarenheter och lärdomar gruppen har fått från projektet. Det innehåller även ett appendix med kapitel skrivna av gruppens medlemmar som behandlar olika ämnen relevanta till arbetet.

    Download full text (pdf)
    fulltext
  • 304.
    Andersson, Per
    Linköping University, Department of Computer and Information Science.
    Design och utvärdering av en självbetjänings-terminal för mammografiundersökningar – en fallstudie2010Independent thesis Advanced level (degree of Master (Two Years)), 20 credits / 30 HE creditsStudent thesis
    Abstract [sv]

    Självbetjäningsterminaler tar över efter traditionella kassor och receptioner på allt fler platser i dagens samhälle. Vare sig du ska handla möbler på IKEA, låna böcker från biblioteket eller besiktiga bilen är sannolikheten stor att du stöter på en terminal. Dess användare anser många gånger att självbetjäningen är snabbare än och effektivare än dess traditionella motsvarighet, medan motståndarna anser att en maskin aldrig kan ersätta den personliga service en människa ger.

    Den här rapporten försöker dels besvara frågan om en självbetjäningsterminal tillför något positivt för personal respektive patienter på en mammografiklinik, och dels redogör den för de problem patienterna upplevde medan de använde terminalen.

    De patienter som rör sig på en mammografiklinik är i allmänhet äldre kvinnor med väldigt varierande förutsättningar vad det gäller datorvana. För att få så stort antal testpatienter som möjligt under utvärderingsperioden, stängdes klinikens ordinarie reception ner och samtliga patienter blev istället hänvisade till en av två självbetjäningsterminaler. Totalt användes terminalerna av 425 kvinnor i åldrarna 21 – 83 år, där medelåldern låg på knappt 54 år.

    Utvärderingen visar att patienternas största problem i allmänhet var att först och främst hitta terminalen, och därefter att förstå att de skulle trycka på terminalens pekskärm för att interagera med den. När patienterna väl har klarat sig över den tröskeln går resten av processen smidigt för de flesta, även om det förekommer undantag från den regeln.

    Personalen som arbetar på kliniken var till en början väldigt skeptiska till terminalernas intåg, men under utvärderingsperioderna upptäcktes flera fördelar jämfört med en traditionell reception. En del av uppgifterna som utförs i receptionen kan i dagsläget inte utföras av en terminal. Terminalerna kan därför inte ersätta receptionen, utan snarare fungera som ett komplement och en avlastning.

    Download full text (pdf)
    FULLTEXT01
  • 305.
    Andersson, Per
    et al.
    n/a.
    Kuchcinski, Krzysztof
    n/a.
    Nordberg, Klas
    Linköping University, Department of Electrical Engineering, Computer Vision. Linköping University, The Institute of Technology.
    Doherty, Patrick
    Linköping University, Department of Computer and Information Science, KPLAB - Knowledge Processing Lab. Linköping University, The Institute of Technology.
    Integrating a computational model and a run time system for image processing on a UAV2002In: Euromicro Symposium on Digital System Design (DSD), 2002, p. 102-109Conference paper (Refereed)
    Abstract [en]

    Recently substantial research has been devoted to Unmanned Aerial Vehicles (UAVs). One of a UAV's most demanding subsystem is vision. The vision subsystem must dynamically combine different algorithms as the UAVs goal and surrounding change. To fully utilize the available hardware, a run time system must be able to vary the quality and the size of regions the algorithms are applied to, as the number of image processing tasks changes. To allow this the run time system and the underlying computational model must be integrated. In this paper we present a computational model suitable for integration with a run time system. The computational model is called Image Processing Data Flow Graph (IP-DFG). IP-DFG has been developed for modeling of complex image processing algorithms. IP-DFG is based on data flow graphs, but has been extended with hierarchy and new rules for token consumption, which makes the computational model more flexible and more suitable for human interaction. In this paper we also show that IP-DFGs are suitable for modelling expressions, including data dependent decisions and iterations, which are common in complex image processing algorithms.

    Download full text (pdf)
    FULLTEXT01
  • 306.
    Andersson, Peter
    Linköping University, Department of Computer and Information Science, CASL - Cognitive Autonomous Systems Laboratory. Linköping University, The Institute of Technology.
    Hazard: a Framework Towards Connecting Artificial Intelligence and Robotics2005In: IJCAI Workshop on Reasoning, Representation and Learning in Computer Games, 2005Conference paper (Refereed)
  • 307.
    Andersson, Peter
    Linköping University, The Institute of Technology. Linköping University, Department of Computer and Information Science, CASL - Cognitive Autonomous Systems Laboratory.
    Hazard: A Framework Towards Connecting Artificial Intelligence and Robotics2005In: Proceedings of the 1st International Workshop on Multi-Agent Robotic Systems (MARS), Barcelona: INSTICC PRESS , 2005, p. 171-Conference paper (Refereed)
  • 308.
    Andersson, Peter
    Linköping University, Department of Computer and Information Science.
    Implementation of website for cognitive behavioural therapy using the development framework Symfony2010Independent thesis Basic level (university diploma), 10 credits / 15 HE creditsStudent thesis
    Abstract [en]

    This report follows the process of developing a website for cognitive behavioural therapy using the web development framework Symfony. The purpose was to find out if it is appropriate to use Symfony to ease development and maintenance of a website for therapy. For this to be true the framework had to be able to help create a website that was secure, user-friendly and easy to maintain.

    The website was developed using several features of the framework including database abstraction, automatic code generation and URL-rewriting. A plugin was used to enhance the security by adding a complete solution for user authentication. The website was tested by using built-in test functionality of the framework that could run test on functions or emulating a browser visiting the website.

    During the development the framework was tested and evaluated. The worst drawback turned out to be Symfonys steep learning curve, its security solution that only worked if the website was installed correctly and its slow loading time. Except those faults the framework performed well and was easy to use ones the initial learning time was over.

     

    Download full text (pdf)
    FULLTEXT01
  • 309.
    Andersson, Petronella
    Linköping University, Department of Computer and Information Science.
    När en höna har en räv bakom örat: reaktioner på interaktiva agenter när visuellt och verbalt uttryck inte passar ihop2002Independent thesis Advanced level (degree of Magister)Student thesis
    Abstract [sv]

    Syftet med denna studie är att ta reda på hur användare påverkas av gränssnittsagenter vars personlighet inte passar ihop med det visuella intryck de ger. Gränssnittsagenterna bestod i den här studien av en räv och en höna och de har testats på användare i ett deklarationssammanhang. Personligheten uttrycktes genom vad agenterna sade, och detta visades på datorskärmen i form av text i pratbubblor. Agenterna har manipulerats så att de vid hälften av betingelserna fått byta personlighet med varandra, alltså att hönan har presenterats med rävens personlighet och tvärt om. En kontrollgrupp har genomfört uppgiften utan att någon agent varit närvarande på skärmen. Efter genomförd deklaration har användarna fått fylla i en enkät där de ombetts uppskatta olika aspekter av agentens beteende. Försöket har avslutats med en intervju.

    Resultatet visar att närvaron av en agent påverkade användarens upplevelse av att deklarera. Agentens utseende och agentens personlighet var för sig påverkade olika aspekter av användarensupplevelse av till exempel tillit och attraktionsvärde. Dock kunde inga tydliga skillnader konstateras när agentens personlighet inte passade ihop med det visuella intryck agenten gav.

    Download full text (pdf)
    FULLTEXT01
  • 310.
    Andersson, Rikard
    et al.
    Linköping University, Department of Computer and Information Science.
    Emberg, Johan
    Linköping University, Department of Computer and Information Science.
    Hazell, Sofie
    Linköping University, Department of Computer and Information Science.
    Laestander, Hjalmar
    Linköping University, Department of Computer and Information Science.
    Norberg, Gustaf
    Linköping University, Department of Computer and Information Science.
    Elmfeldt Rönnmark, Maximilian
    Linköping University, Department of Computer and Information Science.
    Buciuto Sundelin, Bruno
    Linköping University, Department of Computer and Information Science.
    Törngren, Erik
    Linköping University, Department of Computer and Information Science.
    Heat n' Eat: Utvecklingen av en användbar e-butik med fokus på navigerbarhet2017Independent thesis Basic level (degree of Bachelor), 12 credits / 18 HE creditsStudent thesis
    Abstract [en]

    Students today lack both time and money. At the same time e-commerce is increasing, and especially food sales over the internet. This report aims to explore the possibilities of a service that offers students a simple alternative for high quality food within their budget in the form of a web application. Students at Campus Valla expressed the need for such a service through a market research. The study was conducted by researching theories regarding usability and navigability. Students as a group often lack time and are used to getting fast and clear information; this is ensured by good navigability. After the researching of theories, several user tests were conducted on the targeted group. The result following this was the development of the web application Heat n' Eat. In order to achieve good navigability, the application was implemented with a simple layout, focusing on the products. A final user test showed that the application could be considered usable with focus on navigability.

    Download full text (pdf)
    fulltext
  • 311.
    Andersson, Robin
    Linköping University, Department of Computer and Information Science.
    Implementation av ett kunskapsbas system för rough set theory med kvantitativa mätningar2004Independent thesis Basic level (professional degree)Student thesis
    Abstract [en]

    This thesis presents the implementation of a knowledge base system for rough sets [Paw92]within the logic programming framework. The combination of rough set theory with logic programming is a novel approach. The presented implementation serves as a prototype system for the ideas presented in [VDM03a, VDM03b]. The system is available at "http://www.ida.liu.se/rkbs".

    The presented language for describing knowledge in the rough knowledge base caters for implicit definition of rough sets by combining different regions (e.g. upper approximation, lower approximation, boundary) of other defined rough sets. The rough knowledge base system also provides methods for querying the knowledge base and methods for computing quantitative measures.

    We test the implemented system on a medium sized application example to illustrate the usefulness of the system and the incorporated language. We also provide performance measurements of the system.

    Download full text (pdf)
    FULLTEXT01
  • 312.
    Andersson, Robin
    Linköping University, Department of Computer and Information Science, Human-Centered systems.
    Utveckling av tvådimensionellt online-spel i kategorin action-strategi för smartphones med fokus på spelupplevelse och prestanda2017Independent thesis Advanced level (degree of Master (Two Years)), 20 credits / 30 HE creditsStudent thesis
    Abstract [sv]

    Vid utveckling av spel till smartphones så krävs ofta flera olika implementationer för olika plattformar. Men det finns olika spelmotorer och ramverk till olika programspråk som kan kompilera samma kod till flera olika mobila plattformar. Kivy är ett sådant ramverk för programspråket Python.

    I detta arbete användes prototypdriven utveckling i Kivy för att försöka höja spelupplevelsen av ett tvådimensionellt online-spel i kategorin action-strategi som tidigare fanns implementerat i GameMaker. Olika tekniker för att öka prestandan för spelet testades också. Det visade sig att med den bästa kombinationen av de tekniker som testades så blev prestandan med hög last cirka 29 bilder/s. Användarbarheten, spelbarheten och ljud-estetiken av spelet ökades medan nöjet och den personliga tillfredställelsen från spelet minskade. Totalt sett blev spelupplevelsen i stort sätt oförändrad.

    Download full text (pdf)
    fulltext
  • 313. Andersson, Robin
    et al.
    Vitoria, Aida
    Linköping University, Department of Science and Technology, Visual Information Technology and Applications (VITA). Linköping University, The Institute of Technology.
    Maluszynski, Jan
    Linköping University, The Institute of Technology. Linköping University, Department of Computer and Information Science, TCSLAB - Theoretical Computer Science Laboratory.
    Komorowski, Henryk Jan
    RoSy: A Rough Knowledge Base System2005In: Rough Sets, Fuzzy Sets, Data Mining, and Granular-Soft Computing,2005, Berlin: Springer , 2005, p. 48-Conference paper (Refereed)
  • 314.
    Andersson, Samuel
    et al.
    Linköping University, Department of Computer and Information Science. Linköping University, The Institute of Technology.
    Ekberg, Björn
    Linköping University, Department of Computer and Information Science. Linköping University, The Institute of Technology.
    Prestandaoptimering av spelet Go Supernova2013Independent thesis Basic level (degree of Bachelor), 10 credits / 15 HE creditsStudent thesis
    Abstract [sv]

    Som underlag för den här rapporten använder vi oss av vårtspel Go Supernova. Det är skrivet i Java med hjälp avramverket LibGDX. Vi har undersökt hur man kan optimeraspelet för att kunna hantera så många objekt som möjligt menändå hålla ett bra spelflöde utan att förstöra den vision vihade när vi skapade spelet från första början. Vi har kommitfram till att ljusmotorn box2dlights använder sig av mycketprocessorkraft och användningen av den behövde justeras föratt tillfredsställa våra krav. Vi kommer även att tala omdesignval av spelets interna delar som gjorde att vi kundeundvika prestandaförluster.

    Download full text (pdf)
    rapport
  • 315.
    Andersson, Sara
    Linköping University, Department of Computer and Information Science.
    Data Transformation Portal2010Independent thesis Advanced level (degree of Master (Two Years)), 20 credits / 30 HE creditsStudent thesis
    Abstract [en]

    The purpose with this report is to present the findings from the thesis work performed at Ipendo Systems. The goal was to develop a methodological support for the migration process and implement a web portal for migration of data.

    When a company acquires a new application to perhaps replace a legacy system, or to improve their efficiency and there by their competitiveness, the company’s data need to be transferred into the new application. The process of transfer the data from a source to a target is called data migration. Because the source and target systems probably have a somewhat different architecture some transformation to the data has to be made.

    The thesis is divided in two parts, a theoretical part where I learned about data migration and developed a methodological support for data migration projects. The second part of the thesis work was practical designed and I developed a data transformation portal.

    Data migrations are often a somewhat forgotten activity in a project. It is sometimes carried out without a proper plan or structure. To bring some structure to this important process I developed a methodological support. The methodological support is made like a guide for how to conduct data migration projects. The purpose of the methodological support is to make data migrations more visible as an own project and add more structure to it. The methodological support is divided into five phases. The five phases are planning, analysis, design, implementation and validation. Every step has its own milestones and deliverables so the support could be used as a sort of checklist during the project.

    have also developed a web portal in SharePoint. The purpose with a data transformation portal is to gather all data migration to one common area without a third-party migration tool and minimize the technical complexity associated with data migration projects. I have developed two modules for the portal. The first module concerns migration from an Excel document to a SharePoint list. The second module handles upload of documents to a SharePoint document library. The portal has functionality like data mapping, validation and setting of metadata. Migration of data is a specific process, depending of the type of data that should be migrated it requires a somewhat different approach. A data transformation portal which can visually monitor, filter, transform and import various types of data to and from various data sources would facilitate the migration process.

    Download full text (pdf)
    FULLTEXT01
  • 316.
    Andersson, Sebastian
    Linköping University, Department of Computer and Information Science.
    Semantisk spegling: En implementation för att synliggöra semantiska relationer i tvåspråkiga data2004Independent thesis Advanced level (degree of Magister)Student thesis
    Abstract [sv]

    Semantiska teorier inom traditionell lingvistik har i huvudsak fokuserat på relationen mellan ord och de egenskaper eller objekt som ordet står för. Dessa teorier har sällan varit empiriskt grundade utan resultatet av enskilda teoretikers tankemödor som exemplifierats med ett fåtal ord. För användning inom översättning eller maskinöversättning kan ett ords betydelse istället definieras utifrån dess relation till andra språk. Översättning av text lämnar dessutom analyserbart material efter sig i form av originaltext och översättning som öppnar möjlighet för empiriskt grundade semantiska relationer. En metod för att försöka hitta enspråkiga semantiska relationer utifrån tvåspråkiga översättningsdata är semantisk spegling. Genom att utnyttja att ord är tvetydiga på olika sätt i källspråk och målspråk kan semantiska relationer mellan ord i källspråket hittas utifrån relationen till målspråket. I denna uppsats har semantisk spegling implementerats och applicerats på tvåspråkiga (svenska ochengelska) ordboksdata. Eftersom de enspråkiga relationerna i semantisk spegling tas fram utifrån ett annat språk har detta utnyttjats i arbetet för att även ta fram tvåspråkiga semantiska relationer. Resultatet har jämförts med befintliga synonymlexikon, utvärderats kvalitativt samt jämförts med ursprungsdata. Resultaten är av varierande kvalitet men visar ändå på potential hos metoden och möjlighet att använda resultatet som lexikal resurs inom till exempel lexikografi

    Download full text (pdf)
    FULLTEXT01
  • 317.
    Andersson, Simon
    Linköping University, Department of Computer and Information Science, Software and Systems. Linköping University, The Institute of Technology.
    Energy Consumption of 3G Transmissions for Instant Messaging on Mobile Devices2013Independent thesis Basic level (degree of Bachelor), 10,5 credits / 16 HE creditsStudent thesis
    Abstract [en]

    A recent surge in the usage of instant messaging (IM) applications on mobile devices has brought the energy efficiency of those applications into the light. We are entering an era where IM applications are changing the message communication on mobile devices, beginning to overtake SMS messages and even phone calls in some cases. Smartphones experience a tremendous increase of data transmissions through wireless interfaces. As illustrated in this work, today's IM applications differ vastly in energy consumption when using the third generation (3G) cellular communication. This thesis focuses on studying the 3G transmission energy footprint of IM applications at the handset level. The energy cost of a common feature used in IM applications that informs that the user is currently typing a response ('typing notify'), is evaluated. The feature is shown to incur a great increase in energy cost compared to the base chat function, ranging from an increase of 43 % to 117 %. The work also proposes a bundle technique that aggregates chat messages over time reducing the energy consumption at the cost of delay for the user. The results show that the bundle technique can save up to 47 % in energy consumption while still keeping the chat function. For the evaluation, conversations collected from a popular IM application are used.

    Download full text (pdf)
    fulltext
  • 318.
    Andersson, Sofie
    Linköping University, Department of Computer and Information Science.
    Kvalitativa skillnader mellan olika grupper av utvärderare i en användbarhetsinspektion.2010Independent thesis Basic level (degree of Bachelor), 10 credits / 15 HE creditsStudent thesis
    Abstract [sv]

    Denna studie syftar till att undersöka om det framkommer kvalitativa skillnader i de förväntade användbarhetsproblem som kommenteras på av olika grupper av utvärderare i en användbarhetsinspektion. Metoden som används för användbarhetsinspektionen är heuristik utvärdering, dock utan en sedvanlig problembedömning. De olika utvärderargrupperna som har undersökts är användbarhetsexperter och utvecklare. Den heuristiska utvärderingen har utförts på ett system utvecklat för att medborgare i Sverige ska kunna ansöka om tjänster hos socialtjänsten, administrera sina ärenden och kontakta socialtjänsten. Utvärderarna har innan utvärderingen påbörjats informerats om användargrupper, användarscenarion och Nielsens tio heuristiker. Kommentarerna kring användbarhetsproblem har analyserats för att undersöka om de två grupperna av utvärderare fokuserar på olika aspekter i systemet, om de hittar olika slags användbarhetsproblem och om de tar olika användargruppers perspektiv i utvärderingen. Resultatet som har funnits är att utvärderarna till stor del fokuserar på olika delar av systemet. Det finns också en tendens till att grupperna hittar olika slags användbarhetsproblem i form av allvarlighetsgrad och de tar till stor del olika användargruppers perspektiv vid utvärderingen.

    Download full text (pdf)
    FULLTEXT01
  • 319.
    Andersson, Tim
    Linköping University, Department of Computer and Information Science, Human-Centered systems. Linköping University, The Institute of Technology.
    Bluetooth Low Energy and Smartphones for Proximity-Based Automatic Door Locks2014Independent thesis Basic level (degree of Bachelor), 10,5 credits / 16 HE creditsStudent thesis
    Abstract [en]

    Bluetooth Low Energy is becoming increasingly popular in mobile applications due to the possibility of using it for proximity data. Proximity can be estimated by measuring the strength of the Bluetooth signal, and actions can then be performed based on a user's proximity to a certain location or object. One of the most interesting applications of proximity information is automating common tasks; this paper evaluates Bluetooth Low Energy in the context of using smartphones to automatically unlock a door when a user approaches the door. Measurements were performed to determine signal strength reliability, energy consumption and connection latency. The results show that Bluetooth Low Energy is a suitable technology for proximity-based door locks despite the large variance in signal strength.

    Download full text (pdf)
    Bluetooth Low Energy and Smartphones for Proximity-Based Automatic Door Locks
  • 320.
    Andersson, Tim
    et al.
    Linköping University, Department of Computer and Information Science. Linköping University, The Institute of Technology.
    Arnesson, Gustav
    Linköping University, Department of Computer and Information Science. Linköping University, The Institute of Technology.
    Brengdahl, Pontus
    Linköping University, Department of Computer and Information Science. Linköping University, The Institute of Technology.
    Ekelund, Anna
    Linköping University, Department of Computer and Information Science. Linköping University, The Institute of Technology.
    Kallström, Claes
    Linköping University, Department of Computer and Information Science. Linköping University, The Institute of Technology.
    Olsson, Kalle
    Linköping University, Department of Computer and Information Science. Linköping University, The Institute of Technology.
    Thudén, Julia
    Linköping University, Department of Computer and Information Science. Linköping University, The Institute of Technology.
    Wallvik, Erik
    Linköping University, Department of Computer and Information Science. Linköping University, The Institute of Technology.
    Experiences from the Development of a Webshop Using Scrum Methodology2014Independent thesis Basic level (degree of Bachelor), 12 credits / 18 HE creditsStudent thesis
    Abstract [en]

    This is a report concerning the software development project Eldflugan, a system developed by eight students at Linköping University. It addresses experience from developing a web-based e-commerce using Scrum, an agile development method, which was used throughout the project. The teams work, how Scrum was applied with both advantages and disadvantages is being lifted. Different development environments have been used due to separate issues and opportunities, which is described. The database management systems, MySQL, and the local version, SQLite, are discussed as well as AJAX and PJAX, tools for giving the users a better and faster experience. To prepare Eldflugan for entering the e-commerce market, a marketing plan including environmental scanning, a SWOT analysis and a STP, has been made. Ethical aspects such as legal, use and handling of personal information and how it is communicated are also being addressed. Finally the report discusses product weaknesses, future opportunities, implementation difficulties and how those could have been prevented. It was found that Scrum is best used when it is utilized fully and a risk analysis can prevent unexpected problems to surface. 

    Download full text (pdf)
    Experiences from the Development of a Webshop Using Scrum Methodology
  • 321.
    Andersson, Titus
    et al.
    Linköping University, Department of Computer and Information Science.
    Byström, Markus
    Linköping University, Department of Computer and Information Science.
    Engstam, Karl
    Linköping University, Department of Computer and Information Science.
    Hedlund, Carl
    Linköping University, Department of Computer and Information Science.
    Larsson, Gustav
    Linköping University, Department of Computer and Information Science.
    Nordborg, Oskar
    Linköping University, Department of Computer and Information Science.
    Saeby, Christian
    Linköping University, Department of Computer and Information Science.
    Wahlstedt, Joel
    Linköping University, Department of Computer and Information Science.
    Utvecklingen av webbapplikationen Coffify med fokus på användbarhet2017Independent thesis Basic level (degree of Bachelor), 12 credits / 18 HE creditsStudent thesis
    Abstract [en]

    E-commerce have gotten more common the past years, and it is of great importance that sellers can offer a useable platform on the internet. During the startup-process of this project, multiple coffee roasters were contacted and they were positive to the idea of a webshop application that can help them reach more customers. During the development of the application, the main focus was usability, which is thought to be achieved by navigability, clarity and simplicity. The process started with a product backlog and a prototype which made the base for the development. Evaluation of the web application was made through user testing and acceptance testing. The work resulted in a web application that, according to user tests, proved to be passable in usability through the listed aspects. However, in the end, the question formulation could not be fully answered, since exactly which specific elements and factors that added navigability, clarity and simplicity to the web application could not be identified.

    Download full text (pdf)
    fulltext
  • 322.
    Andersson, Torbjörn
    et al.
    Linköping University, Department of Management and Engineering, Machine Design. Linköping University, The Institute of Technology.
    Warell, Anders
    Division of Industrial Design, Dept of Design Sciences, Lund University,.
    Holmlid, Stefan
    Linköping University, Department of Computer and Information Science, Human-Centered systems. Linköping University, The Institute of Technology.
    Ölvander, Johan
    Linköping University, Department of Management and Engineering, Machine Design. Linköping University, The Institute of Technology.
    Desirability in the development of In-Car Infotainment Systems2011In: Workshop: User Experience in Cars / [ed] David Wilfinger, 2011Conference paper (Other academic)
    Abstract [en]

    This paper describes a workflow for designing experiences whileinteracting with an advanced driver assistant system. Future driver assistancesystems that utilize sensors and Car2X-communication in order to detect threatsin the car environment can help the driver to avoid collisions. To increase theacceptance of such a system, the interaction between the driver and the systemshould be able to generate positive experiences. To generate those experiences,a story-based design workflow was used. Concepts created with this workflowshould be able to address specific psychological needs of the driver. Theimplementation of this workflow revealed different schemes of positiveexperiences during driver interaction in critical situations.

  • 323.
    Andersson, Viktor
    et al.
    Linköping University, Department of Computer and Information Science. Linköping University, The Institute of Technology.
    Berg, Emil
    Linköping University, Department of Computer and Information Science. Linköping University, The Institute of Technology.
    Bergsten, Emanuel
    Linköping University, Department of Computer and Information Science. Linköping University, The Institute of Technology.
    Classon, Johan
    Linköping University, Department of Computer and Information Science. Linköping University, The Institute of Technology.
    Fredriksson, Tony
    Linköping University, Department of Computer and Information Science. Linköping University, The Institute of Technology.
    Halldén, Max
    Linköping University, Department of Computer and Information Science. Linköping University, The Institute of Technology.
    Ljungberg, Niklas
    Linköping University, Department of Computer and Information Science. Linköping University, The Institute of Technology.
    Övervakningsfunktion för en mätplattform för mätning i bil – erfarenhetsrapport från kandidatprojekt i programvaruutveckling2014Independent thesis Basic level (degree of Bachelor), 10 credits / 15 HE creditsStudent thesis
    Abstract [sv]

    Denna rapport innehåller de samlade erfarenheterna från ett produktutvecklingsprojekt i kursen TDDD77 vid Linköpings universitet. Projektets mål var att skapa en applikation för att visualisera mätdata från en specialutrustad bil på en surfplatta. Detta var önskvärt då det inte fanns något sätt att se om någon sensor slutade fungera mitt i ett test. Projektet delades upp i en förstudie följd av tre iterationer, där en färdig produkt presenterades på en teknisk mässa i slutet av iteration 3.

    Resultaten visar att Essence Kernel Alpha States kunde användas som en hälsokontroll för projektet, men då de kunde ses som rätt vaga och lämnade rum för tolkning passade det bäst som ett komplement till exempelvis milstolpar.

    Att använda Google Protocol Buffers sågs som ett viktigt tekniskt val tillsammans med uppdelningen av klienten i front- och back-end. Protobuf underlättade kommunikationen mellan server och klient som annars krävt ett nyskapat protokoll.

    Uppdelningen av front- och back-end underlättade inte bara resursfördelningen vid utveckling utan även vid felsökning då det i många fall blev lättare att se precis var felet uppkom. Back-ends uppbyggnad gjorde även att den går att återanvända vid eventuell utveckling till flertalet plattformar.

    Den arbetsprocess som följdes ses som en hybrid mellan agila metoder och vattenfallsmodellen.

    Mycket erfarenhet finns att hämta från projektet, bland annat hur krav kan ändras och hur en prototyp kan styra mjukvaruutvecklingen åt rätt håll.

    På grund av att surfplattan distraherar användaren under körning av bil har designen utgått från att minimera interaktionen som krävs med surfplattan under mätning.

    Download full text (pdf)
    fulltext
  • 324.
    Andin, Karl
    et al.
    Linköping University, Department of Computer and Information Science, Human-Centered systems. Linköping University, The Institute of Technology.
    Ahl, Andreas
    Linköping University, Department of Computer and Information Science, Human-Centered systems. Linköping University, The Institute of Technology.
    Mobile application for speech quality measurement2012Independent thesis Basic level (degree of Bachelor), 10,5 credits / 16 HE creditsStudent thesis
    Abstract [en]

    This report describes a bachelor thesis in computer science performed at the system department within the product development unit for GSM (Global System for Mobile communication) at Ericsson in Linköping.GSM can be considered a mature technology but it is still updated with new features on a regular basis. This requires that the technology also continuously is being tested. One technique that is used to perform quality tests is called PESQ (Perceptual Evaluation of Speech Quality). PESQ is a standardized algorithm to perform speech quality tests; it gives a score based on how a human would percept speech quality.The purpose of this thesis was to enhance the speech quality analysis process used when testing the GSM network. One goal was to analyze if it was possible to record and inject sound into a phone call and verify the possibility to execute the PESQ algorithm using a smartphone. Another goal was to develop a smartphone application to perform the described tasks.In order to do so an application for Android was developed. The development process included an investigation whether the Android platform supplies the functionality required. The investiga-tion showed that no general solution for recording and injecting audio into a phone call could be found. Recording was possible on some smartphones, but the characteristics of the recorded audio were not as desired. No solution for injecting audio into a phone call could be found for any of the tested smartphones.However, even though no solution for recording and injecting was found, an application was developed. The application was decided to be more of a proof of concept on how an application of this kind would work. It would also be a good foundation for future development. Suggested future work in order to integrate the application into the existing testing environment is to find alternative solutions for recording and injecting, maybe with the help of smartphone manu-facturers.

    Download full text (pdf)
    fulltext
  • 325.
    Andreasson, Daniel
    Linköping University, Department of Computer and Information Science, ESLAB - Embedded Systems Laboratory. Linköping University, The Institute of Technology.
    Slack-time aware dynamic routing schemes for on-chip networks2007Licentiate thesis, monograph (Other academic)
    Abstract [en]

    Network-on-Chip (NoC) is a new on-chip communication paradigm for future IP-core based System-on-Chip (SoC), designed to remove a number of limitations of today-s on-chip interconnect solutions. A Nointerconnects cores by means of a packet switched micro-network, which improves scalability and reusability, resulting in a shorter time to market. A typical NoC will be running many applications concurrently, which results in shared network capacity between different kinds of traffic flows. Due to the diverse characteristic of applications, some traffic flows will require real-time communication guarantees while others are tolerant to even some loss of data. In order to provide different levels of Quality-of-Service (QoS) for traffic flows, the communication traffic is separated into different service classes. Traffic in NoC is typically classified into two service classes: the guaranteed throughput (GT) and the best-effort (BE) service class. The GT class offers strict QoS guarantees by setting up a virtual path with reserved bandwidth between the source (GT-producer) and destination (GT-consumer), called a GT-path. The BE class offers no strict QoS guarantees, but tries to efficiently use any network capacity which may become available from the GT traffic. The GT traffic may not fully utilize its bandwidth reservation if its communication volume varies, leading to time intervals where there is no GT traffic using the bandwidth reservation. These intervals are referred to as slack-time. If the slack can not be used this leads to unnecessarily reduced performance of BE traffic, since a part of the available network capacity becomes blocked. This thesis deals with methods to efficiently use the slack-time for BE traffic. The contributions include three new dynamic schemes for slack distribution in NoC. First, a scheme to inform the routers of a GT-path about available slack is evaluated. The GT-producer plans its traffic using a special playout buffer and issues control packets containing the actual amount of slack-time available. The results show that this scheme leads to decreased latency, jitter and packet drops for BE traffic. Secondly, an extension to this scheme is evaluated, where slack is distributed among multiple GT-paths (slack distribution in space). This opens up the possibility to balance the QoS of BE traffic flows which overlap with the GT-paths. Thirdly, a scheme to distribute slack among the links of a GT-path (slack distribution in time) is proposed. In this approach, arriving GT-packets, at a certain router along the GT-path, can wait for a maximum defined amount of time. During this time, any waiting BE traffic in the buffers can be forwarded over the GT-path. The results confirm that this is especially important during high BE-traffic load, where this technique decreases the jitter of BE traffic considerably.    

  • 326. Order onlineBuy this publication >>
    Andrei, Alexandru
    Linköping University, Department of Computer and Information Science, ESLAB - Embedded Systems Laboratory. Linköping University, The Institute of Technology.
    Energy Efficient and Predictable Design of Real-Time Embedded Systems2007Doctoral thesis, monograph (Other academic)
    Abstract [en]

    This thesis addresses several issues related to the design and optimization of embedded systems. In particular, in the context of time-constrained embedded systems, the thesis investigates two problems: the minimization of the energy consumption and the implementation of predictable applications on multiprocessor system-on-chip platforms.

    Power consumption is one of the most limiting factors in electronic systems today. Two techniques that have been shown to reduce the power consumption effectively are dynamic voltage selection and adaptive body biasing. The reduction is achieved by dynamically adjusting the voltage and performance settings according to the application needs. Energy minimization is addressed using both offline and online optimization approaches. Offline, we solve optimally the combined supply voltage and body bias selection problem for multiprocessor systems with imposed time constraints, explicitly taking into account the transition overheads implied by changing voltage levels. The voltage selection technique is applied not only to processors, but also to buses with repeaters and fat wires. We investigate the continuous voltage selection as well as its discrete counterpart. While the above mentioned methods minimize the active energy, we propose an approach that combines voltage selection and processor shutdown in order to optimize the total energy.

    In order to take full advantage of slack that arises from variations in the execution time, it is important to recalculate the voltage and performance settings during run-time, i.e., online. However, voltage scaling is computationally expensive, and, thus, performed at runtime, significantly hampers the possible energy savings. To overcome the online complexity, we propose a quasi-static voltage scaling scheme, with a constant online time complexity O(1). This allows to increase the exploitable slack as well as to avoid the energy dissipated due to online recalculation of the voltage settings.

    Worst-case execution time (WCET) analysis and, in general, the predictability of real-time applications implemented on multiprocessor systems has been addressed only in very restrictive and particular contexts. One important aspect that makes the analysis difficult is the estimation of the system’s communication behavior. The traffic on the bus does not solely originate from data transfers due to data dependencies between tasks, but is also affected by memory transfers as result of cache misses. As opposed to the analysis performed for a single processor system, where the cache miss penalty is constant, in a multiprocessor system each cache miss has a variable penalty, depending on the bus contention. This affects the tasks’ WCET which, however, is needed in order to perform system scheduling. At the same time, the WCET depends on the system schedule due to the bus interference. In this context, we propose, an approach to worst-case execution time analysis and system scheduling for real-time applications implemented on multiprocessor SoC architectures.

    Download full text (pdf)
    FULLTEXT01
    Download (pdf)
    COVER01
  • 327.
    Andrei, Alexandru
    et al.
    Linköping University, Department of Computer and Information Science, ESLAB - Embedded Systems Laboratory. Linköping University, The Institute of Technology.
    Eles, Petru Ion
    Linköping University, Department of Computer and Information Science, ESLAB - Embedded Systems Laboratory. Linköping University, The Institute of Technology.
    Jovanovic, Olivera
    University of Dortmund.
    Schmitz, Marcus
    Robert Bosch GmbH, Stuttgart.
    Ogniewski, Jens
    Linköping University, Department of Electrical Engineering. 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.
    Quasi-Static Voltage Scaling for Energy Minimization with Time Constraints2011In: IEEE Transactions on Very Large Scale Integration (vlsi) Systems, ISSN 1063-8210, E-ISSN 1557-9999, ISSN 1063-8210, Vol. 19, no 1, p. 10-23Article in journal (Refereed)
    Abstract [en]

    Supply voltage scaling and adaptive body-biasing are important techniques that help to reduce the energy dissipation of embedded systems. This is achieved by dynamically adjusting the voltage and performance settings according to the application needs. In order to take full advantage of slack that arises from variations in the execution time, it is important to recalculate the voltage (performance) settings during runtime, i.e., online. However, optimal voltage scaling algorithms are computationally expensive, and thus, if used online, significantly hamper the possible energy savings. To overcome the online complexity, we propose a quasi-static voltage scaling scheme, with a constant online time complexity O(1). This allows to increase the exploitable slack as well as to avoid the energy dissipated due to online recalculation of the voltage settings.

    Download full text (pdf)
    FULLTEXT01
  • 328.
    Andrei, Alexandru
    et al.
    Linköping University, Department of Computer and Information Science, ESLAB - Embedded Systems Laboratory. Linköping University, The Institute of Technology.
    Eles, Petru Ion
    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.
    Rosén, Jakob
    Linköping University, Department of Computer and Information Science, ESLAB - Embedded Systems Laboratory. Linköping University, The Institute of Technology.
    Predictable Implementation of Real-Time Applications on Multiprocessor Systems on Chip2008In: VLSI Design, 2008. VLSID 2008, IEEE Computer Society, 2008, p. 103-110Conference paper (Refereed)
    Abstract [en]

    Worst-case execution time (WCET) analysis and, in general, the predictability of real-time applications implemented on multiprocessor systems has been addressed only in very restrictive and particular contexts. One important aspect that makes the analysis difficult is the estimation of the system-s communication behavior. The traffic on the bus does not solely originate from data transfers due to data dependencies between tasks, but is also affected by memory transfers as result of cache misses. As opposed to the analysis performed for a single processor system, where the cache miss penalty is constant, in a multiprocessor system each cache miss has a variable penalty, depending on the bus contention. This affects the tasks- WCET which, however, is needed in order to perform system scheduling. At the same time, the WCET depends on the system schedule due to the bus interference. In this context, we propose, for the first time, an approach to worst-case execution time analysis and system scheduling for real-time applications implemented on multiprocessor SoC architectures.

  • 329.
    Andrei, Alexandru
    et al.
    Linköping University, The Institute of Technology. Linköping University, Department of Computer and Information Science, ESLAB - Embedded Systems Laboratory.
    Eles, Petru Ion
    Linköping University, The Institute of Technology. Linköping University, Department of Computer and Information Science, ESLAB - Embedded Systems Laboratory.
    Peng, Zebo
    Linköping University, The Institute of Technology. Linköping University, Department of Computer and Information Science, ESLAB - Embedded Systems Laboratory.
    Schmitz, Marcus
    Diesel Systems for Commercial Vehicles Robert Bosch GmbH, Germany.
    Al-Hashimi, Bashir
    Computer Engineering Dept. Southampton University, UK.
    Voltage Selection for Time-Constrained Multiprocessor Systems on Chip2007In: Designing Embedded Processors: A Low Power Perspective / [ed] Jörg Henkel, Sri Parameswaran, Dordrecht: Springer , 2007, p. 259-286Chapter in book (Other academic)
    Abstract [en]

    As we embrace the world of personal, portable, and perplexingly complex digital systems, it has befallen upon the bewildered designer to take advantage of the available transistors to produce a system which is small, fast, cheap and correct, yet possesses increased functionality. Increasingly, these systems have to consume little energy.

    Designers are increasingly turning towards small processors, which are low power, and customize these processors both in software and hardware to achieve their objectives of a low power system, which is verified, and has short design turnaround times. Designing Embedded Processors examines the many ways in which processor based systems are designed to allow low power devices.

    It looks at processor design methods, memory optimization, dynamic voltage scaling methods, compiler methods, and multi processor methods. Each section has an introductory chapter to give a breadth view, and have a few specialist chapters in the area to give a deeper perspective. The book provides a good starting point to engineers in the area, and to research students embarking upon the exciting area of embedded systems and architectures.

  • 330.
    Andrei, Alexandru
    et al.
    Linköping University, The Institute of Technology. Linköping University, Department of Computer and Information Science, ESLAB - Embedded Systems Laboratory.
    Eles, Petru Ion
    Linköping University, The Institute of Technology. Linköping University, Department of Computer and Information Science, ESLAB - Embedded Systems Laboratory.
    Peng, Zebo
    Linköping University, The Institute of Technology. Linköping University, Department of Computer and Information Science, ESLAB - Embedded Systems Laboratory.
    Schmitz, M.T.
    Diesel Systems for Commercial Vehicles, Robert Bosch GmbH, Stuttgart 70469, Germany.
    Al, Hashimi B.M.
    Al Hashimi, B.M., IEEE, Computer Engineering Department, Southampton University, Southampton, SO 17 1BJ, United Kingdom.
    Energy optimization of multiprocessor systems on chip by voltage selection2007In: IEEE Transactions on Very Large Scale Integration (vlsi) Systems, ISSN 1063-8210, E-ISSN 1557-9999, Vol. 15, no 3, p. 262-275Article in journal (Refereed)
    Abstract [en]

    Dynamic voltage selection and adaptive body biasing have been shown to reduce dynamic and leakage power consumption effectively. In this paper, we optimally solve the combined supply voltage and body bias selection problem for multiprocessor systems with imposed time constraints, explicitly taking into account the transition overheads implied by changing voltage levels. Both energy and time overheads are considered. The voltage selection technique achieves energy efficiency by simultaneously scaling the supply and body bias voltages in the case of processors and buses with repeaters, while energy efficiency on fat wires is achieved through dynamic voltage swing scaling. We investigate the continuous voltage selection as well as its discrete counterpart, and we prove strong NP-hardness in the discrete case. Furthermore, the continuous voltage selection problem is solved using nonlinear programming with polynomial time complexity, while for the discrete problem, we use mixed integer linear programming and a polynomial time heuristic. We propose an approach that combines voltage selection and processor shutdown in order to optimize the total energy. © 2007 IEEE.

  • 331.
    Andrei, Alexandru
    et al.
    Linköping University, The Institute of Technology. Linköping University, Department of Computer and Information Science, ESLAB - Embedded Systems Laboratory.
    Schmitz, Marcus
    IDA Linköpings Universitet.
    Eles, Petru Ion
    Linköping University, The Institute of Technology. Linköping University, Department of Computer and Information Science, ESLAB - Embedded Systems Laboratory.
    Peng, Zebo
    Linköping University, The Institute of Technology. Linköping University, Department of Computer and Information Science, ESLAB - Embedded Systems Laboratory.
    Al Hashimi, Bashir M.
    Dept. of Electronics and Computer Science University of Southampton.
    Overhead-Conscious Voltage Selection for Dynamic and Leakage Energy Reduction of Time-Constrained Systems2004In: Design, Automation and Test in Europe DATE 2004,2004, Paris, France: IEEE Computer Society Press , 2004, p. 518-Conference paper (Refereed)
    Abstract [en]

    Dynamic voltage scaling and adaptive body biasing have been shown to reduce dynamic and leakage power consumption effectively. In this paper, we optimally solve the combined supply voltage and body bias selection problem for multi-processor systems with imposed time constraints, explicitly taking into account the transition overheads implied by changing voltage levels. Both energy and time overheads are considered. We investigate the continuous voltage scaling as well as its discrete counterpart, and we prove NP-hardness in the discrete case. Furthermore, the continuous voltage scaling problem is formulated and solved using nonlinear programming with polynomial time complexity, while for the discrete problem we use mixed integer linear programming. Extensive experiments, conducted on several benchmarks and a real-life example, are used to validate the approaches.

  • 332.
    Andrei, Alexandru
    et al.
    Linköping University, The Institute of Technology. Linköping University, Department of Computer and Information Science, ESLAB - Embedded Systems Laboratory.
    Schmitz, Marcus
    Dept. of Electronics and Computer Science University of Southampton.
    Eles, Petru Ion
    Linköping University, The Institute of Technology. Linköping University, Department of Computer and Information Science, ESLAB - Embedded Systems Laboratory.
    Peng, Zebo
    Linköping University, The Institute of Technology. Linköping University, Department of Computer and Information Science, ESLAB - Embedded Systems Laboratory.
    Al Hashimi, Bashir M.
    Dept. of Electronics and Computer Science University of Southampton.
    Overhead-Conscious Voltage Selection for Dynamic and Leakage Energy Reduction of Time-Constrained Systems2005In: IEE Proceedings - Computers and digital Techniques, ISSN 1350-2387, E-ISSN 1359-7027, Vol. 152, no 01, p. 28-38Article in journal (Refereed)
    Abstract [en]

    Dynamic voltage scaling and adaptive body biasing have been shown to reduce dynamic and leakage power consumption effectively. In this paper, we optimally solve the combined supply voltage and body bias selection problem for multi-processor systems with imposed time constraints, explicitly taking into account the transition overheads implied by changing voltage levels. Both energy and time overheads are considered. We investigate the continuous voltage scaling as well as its discrete counterpart, and we prove NP-hardness in the discrete case. Furthermore, the continuous voltage scaling problemis formulated and solved using nonlinear programming with polynomial time complexity, while for the discrete problem we use mixed integer linear programming. Extensive experiments, conducted on several benchmarks and a real-life example, are used to validate the approaches.

  • 333.
    Andrei, Alexandru
    et al.
    Linköping University, The Institute of Technology. Linköping University, Department of Computer and Information Science, ESLAB - Embedded Systems Laboratory.
    Schmitz, Marcus
    Dept. of Electronics and Computer Science University of Southampton.
    Eles, Petru Ion
    Linköping University, The Institute of Technology. Linköping University, Department of Computer and Information Science, ESLAB - Embedded Systems Laboratory.
    Peng, Zebo
    Linköping University, The Institute of Technology. Linköping University, Department of Computer and Information Science, ESLAB - Embedded Systems Laboratory.
    Al Hashimi, Bashir M.
    Dept. of Electronics and Computer Science University of Southampton.
    Quasi-Static Voltage Scaling for Energy Minimization with Time Constraints2005In: Design Automation and Test in Europe Conference DATE 2005,2005, Munich, Germany: IEEE Computer Society Press , 2005, p. 514-Conference paper (Refereed)
  • 334.
    Andrei, Alexandru
    et al.
    Linköping University, The Institute of Technology. Linköping University, Department of Computer and Information Science, ESLAB - Embedded Systems Laboratory.
    Schmitz, Marcus
    IDA Linköpings Universitet.
    Eles, Petru Ion
    Linköping University, The Institute of Technology. Linköping University, Department of Computer and Information Science, ESLAB - Embedded Systems Laboratory.
    Peng, Zebo
    Linköping University, The Institute of Technology. Linköping University, Department of Computer and Information Science, ESLAB - Embedded Systems Laboratory.
    Al Hashimi, Bashir M.
    Dept. of Electronics and Computer Science University of Southampton.
    Simultaneous Communication and Processor Voltage Scaling for Dynamic and Leakage Energy Reduction in Time-Constrained Systems2004In: International Conference on Computer Aided Design ICCAD 2004,2004, San Jose, USA: IEEE Computer Society Press , 2004, p. 362-Conference paper (Refereed)
    Abstract [en]

    In this paper, we propose a new technique for the combined voltage scaling of processors and communication links, taking into account dynamic as well as leakage power consumption. The voltage scaling technique achieves energy efficiency by simultaneously scaling the supply and body bias voltages in the case of processors and buses with repeaters, while energy efficiency on fat wires is achieved through dynamic voltage swing scaling. We also introduce a set of accurate communication models for the energy estimation of voltage scalable embedded systems. In particular, we demonstrate that voltage scaling of bus repeaters and dynamic adaption of the voltage swing on fat wires can significantly influence the system's energy consumption. Experimental results, conducted on numerous generated benchmarks and a real-life example, demonstrate that substantial energy savings can be achieved with the proposed techniques.

  • 335.
    Andrzejewski, Jakub
    Linköping University, Department of Computer and Information Science.
    Designing a User Interface for Smartphones. A Balance Between the Pragmatic and the Hedonic Dimension of Usability: A Case Study2004Independent thesis Basic level (university diploma), 20 credits / 30 HE creditsStudent thesis
    Abstract [en]

    Recent research in the usability engineering field tends to emphasize, somewhat neglected, the need of incorporating the joy-of-use factor (the hedonic dimension of usability) into the design of user interfaces. However such design decisions have to be applied with care and proper modesty as they may diminish the product’s overall quality of use. Notions of pleasure and joy are non-task related and partially incompatible with pragmatic usability qualities hence achieving a proper balance is essential.

    The thesis explores the question of how to establish a balance between pragmatic and hedonic dimensions of usability and whether it is possible to design a user interface which is both highly usable and enjoyable.

    In order to address these questions a case study was performed, which required further development of an existing prototype, the Zenterio Halfpipe Desktop; an innovative, patented, cross-platform user interface. To achieve high product usability, principles of Human-Computer Interaction and User-Centered Design were applied.

    The results of the study suggest that ensuring a high level of both aspects of usability: the pragmatic values (such as simplicity or controllability) as well as the hedonic values (such as originality or innovativeness), can result in a product which is perceived as highly usable and fun-to-use. The practical application of involving the joy-of-use factor shows a significant increase in the perceived software appeal.

    Finally, shortcomings and limitations of the study are discussed followed by future work proposals.

    Download full text (pdf)
    FULLTEXT01
  • 336.
    André, Johannes
    Linköping University, Department of Computer and Information Science.
    Mötesplatser och odling i framtidens städer2018Independent thesis Basic level (degree of Bachelor), 12 credits / 18 HE creditsStudent thesis
    Abstract [sv]

    Detta är ett examensarbete av undersökande karaktär för att se i vilken riktning man kan gå när man utformar mötesplatser i det offentliga rummet i nya stadsdelar. Utgångspunkten för detta arbete är den nya stadsdelen Ebbepark som håller på att byggas i Linköping i Östergötland. I Ebbepark kommer människor båda att bo och jobba. I studien undersöks om det finns några gemensamma nämnare mellan dessa två grupper (boende och anställda på företag i Linköping) och hur de idag träffar andra människor i sin närhet. Vad som även undersöks är hur de tänker kring hur dessa mötesplatser skulle kunna utformas och vad man skulle kunna göra på en sådan mötesplats. De två undersökta grupperna får även möjligheten att reflektera över om urbana odlingar skulle kunna vara ett inslag i dessa mötesplatser och vad de tror att urbana odlingar skulle kunna bidra med för dem. Från resultaten av den enkätundersökning som har genomförts har det visat sig att det inte återfinns någon signifikant skillnad på någon av frågorna mellan de två olika grupperna i studien. Att det inte finns någon signifikant skillnad mellan grupperna leder till att man enklare kan se i vilken riktning som mötesplatserna kan utformas. Detta kan man då göra genom att studera medelvärden för respektive kvantitativ fråga i enkäten. Det blir även intressant att studera de identifierade teman från en tematisk analys på den kvalitativa delen av enkäten. Detta för att erhålla en djupare förståelse för hur respektive enskild individ resonerar. Från de kvantitativa resultaten ser man att deltagarna överlag ställer sig positivt till växter i närheten av där de jobbar och bor. Det framkommer även att det redan finns några mötesplatser där deltagarna jobbar respektive bor men att de skulle kunna tänka sig fler. Vidare anser de att det finns en poäng med att boende och de arbetande i samma område beblandas och umgås med varandra. Från den tematiska analysen framkom att en mötesplats för de tillfrågade försöksdeltagarna antingen var en plats där man bara kunde vara, umgås och prata med andra människor. Det andra identifierade temat var att man på en mötesplats samlas kring någon form av aktivitet. Dessa två identifierade teman pekar antingen på lågintensiva eller högintensiva mötesplatser. När man vidare studerar fler av de teman som uppkom i analysen så träffades människor ofta i samband med måltider. När de tillfrågades vad man kunde göra på en mötesplats så menade flera personer att de ville prata med andra människor och ville gärna fika. Detta är mer i linje med de lågintensiva mötesplatserna där man inte behöver träffas kring en given aktivitet. Denna kandidatuppsats är ett examensarbete som har genomförts tillsammans med Vissheim och Sankt Kors Fastighets AB. Vissheim är ett nystartat företag som har tagit fram en lösning för autonom odling. Sankt Kors är det företag som driver byggnationen av den nya stadsdelen Ebbepark i Linköping, Östergötland.

    Download full text (pdf)
    fulltext
  • 337.
    Andréasson, Dan
    et al.
    Linköping University, Department of Computer and Information Science, Software and Systems. Linköping University, Faculty of Science & Engineering.
    Morja, Daniel
    Linköping University, Department of Computer and Information Science. Linköping University, Faculty of Science & Engineering.
    Rekonstruktion och optimering av laddningstid för en webbsida i Ruby on Rails2015Independent thesis Basic level (degree of Bachelor), 10,5 credits / 16 HE creditsStudent thesis
    Abstract [sv]

    Många verksamheter representeras idag på internet i omodern stil vilket kan påverka besökarens uppfattning om verksamheten negativt. I detta arbete har en webbsida rekonstruerats. Webbsidan tillhör en förening med verksamhet inom gaming och esport. Rekonstruktionen är till för att ge besökare en klar bild av vad föreningens huvudverksamhet är och för att integrera streamingtjänsten Twitch för att ge besökare ytterligare en anledning att återbesöka sidan. Dessutom har laddningstiden för startsidan optimerats för att ge bättre besökupplevelse. Med hjälp av Redis och metoden Eager loading visar arbetet hur man kan sänka laddningstiden på en webbsida.

    Download full text (pdf)
    fulltext
  • 338.
    André-Jönsson, Henrik
    Linköping University, Department of Computer and Information Science. Linköping University, The Institute of Technology.
    Indexing strategies for time series data2002Doctoral thesis, monograph (Other academic)
    Abstract [en]

    Traditionally, databases have stored textual data and have been used to store administrative information. The computers used. and more specifically the storage available, have been neither large enough nor fast enough to allow databases to be used for more technical applications. In recent years these two bottlenecks have started to di sappear and there is an increasing interest in using databases to store non-textual data like sensor measurements or other types of process-related data. In a database a sequence of sensor measurements can be represented as a time series. The database can then be queried to find, for instance, subsequences, extrema points, or the points in time at which the time series had a specific value. To make this search efficient, indexing methods are required. Finding appropriate indexing methods is the focus of this thesis.

    There are two major problems with existing time series indexing strategies: the size of the index structures and the lack of general indexing strategies that are application independent. These problems have been thoroughly researched and solved in the case of text indexing files. We have examined the extent to which text indexing methods can be used for indexing time series.

    A method for transforming time series into text sequences has been investigated. An investigation was then made on how text indexing methods can be applied on these text sequences. We have examined two well known text indexing methods: the signature files and the B-tree. A study has been made on how these methods can be modified so that they can be used to index time series. We have also developed two new index structures, the signature tree and paged trie structures. For each index structure we have constructed cost and size models. resulting in comparisons between the different approaches.

    Our tests indicate that the indexing method we have developed. together with the B-tree structure. produces good results. It is possible to search for and find sub-sequences of very large time series efficiently.

    The thesis also discusses what future issues will have to be investigated for these techniques to be usable in a control system relying on time-series indexing to identify control modes.

  • 339.
    André-Jönsson, Henrik
    Linköping University, Department of Computer and Information Science. Linköping University, The Institute of Technology.
    Indexing time-series data using text indexing methods1999Licentiate thesis, monograph (Other academic)
  • 340.
    Andrén, Stina
    Linköping University, Department of Computer and Information Science.
    What is the Lega?: Exploring the use of a movement-based interactive artifact in an art exhibition2011Independent thesis Advanced level (degree of Master (One Year)), 20 credits / 30 HE creditsStudent thesis
    Abstract [en]

    This thesis explores the use of an interactive artifact designed to let friends physically share their experiences with each other in an art exhibition. The device, called “the Lega” is a research prototype designed with an interest in bodily interaction and visitors' interactions in museum environments. The Lega is a handheld device which has an ovoid shape that fits in the palm of a user's hand. By moving and touching the Lega in different ways the users can create tactile traces of their experiences that can be received by their friends.The thesis presents results from a qualitative analysis of material from a user observation conducted with the Lega at the Vårsalongen exhibition at Liljevalchs in the spring 2010. The analysis investigates how the visitors used the Lega in experiencing the art and to express themselves as well as their social behavior around the Lega, and how the Lega became a part of their art hall visit. Findings on different ways that users create an understanding of and finds meaning in an ambiguous artifact are presented, as well as different ways users use the body to establish a relationship with the artifact. Among these findings are those of users inventing a language of movements to express themselves with the Lega and users who mimic art pieces with the Lega.

    Download full text (pdf)
    What is the Lega?
  • 341.
    Angelsmark, Ola
    Linköping University, The Institute of Technology. Linköping University, Department of Computer and Information Science, TCSLAB - Theoretical Computer Science Laboratory.
    Constraints, adjunctions and (Co)algebras2000In: Electronical Notes in Theoretical Computer Science, ISSN 1571-0661, E-ISSN 1571-0661, Vol. 33Conference paper (Other academic)
    Abstract [en]

    The connection between constraints and universal algebra has been looked at in, e.g., Jeavons, Cohen and Pearson, 1998, and has given interesting results. Since the connection between universal algebra and category theory is so obvious, we will in this paper investigate if the usage of category theory has any impact on the results and/or reasoning and if anything can be gained from this approach. We construct categories of problem instances and of solutions to these, and, via an adjunction between these categories, note that the algebras give us a way of describing 'minimality of a problem,' while the coalgebras give a criterion for deciding if a given set of solutions can be expressed by a constraint problem of a given arity. Another pair of categories, of sets of relations and of sets of operations on a fixed set, is defined, and this time the algebras we get give an indication of the 'expressive power' of a set of constraint types, while the coalgebras tell us about the computational complexity of the corresponding constraint problem. © 2000 Published by Elsevier Science B.V.

  • 342.
    Angelsmark, Ola
    Linköping University, The Institute of Technology. Linköping University, Department of Computer and Information Science, TCSLAB - Theoretical Computer Science Laboratory.
    Constraints, Adjunctions and (Co)algebras2000In: Coalgebraic Methods in Computer Science CMCS-2000,2000, Science Direct , 2000, p. 3-12Conference paper (Refereed)
    Abstract [en]

    The connection between constraints and universal algebra has been looked at in, e.g Jeavons, Cohen and Pearson, 1998, and has given interesting results. Since the connection between universal algebra and category theory is so obvious, we will in this paper investigate if the usage of category theory has any impact on the results and/or reasoning and if anything can be gained from this approach. We construct categories of problem instances and of solutions to these, and, via an adjunction between these categories, note that the algebras give us a way of describing 'minimality of a problem,' while the coalgebras give a criterion for deciding if a given set of solutions can be expressed by a constraint problem of a given arity. Another pair of categories, of sets of relations and of sets of operations on a fixed set, is defined, and this time the algebras we get give an indication of the 'expressive power' of a set of constraint types, while the coalgebras tell us about the computational complexity of the corresponding constraint problem.

  • 343. Order onlineBuy this publication >>
    Angelsmark, Ola
    Linköping University, Department of Computer and Information Science, TCSLAB - Theoretical Computer Science Laboratory. Linköping University, The Institute of Technology.
    Constructing Algorithms for Constraint Satisfaction and Related Problems: Methods and Applications2005Doctoral thesis, monograph (Other academic)
    Abstract [en]

    In this thesis, we will discuss the construction of algorithms for solving Constraint Satisfaction Problems (CSPs), and describe two new ways of approaching them. Both approaches are based on the idea that it is sometimes faster to solve a large number of restricted problems than a single, large, problem. One of the strong points of these methods is that the intuition behind them is fairly simple, which is a definite advantage over many techniques currently in use.

    The first method, the covering method, can be described as follows: We want to solve a CSP with n variables, each having a domain with d elements. We have access to an algorithm which solves problems where the domain has size e < d, and we want to cover the original problem using a number of restricted instances, in such a way that the solution set is preserved. There are two ways of doing this, depending on the amount of work we are willing to invest; either we construct an explicit covering and end up with a deterministic algorithm for the problem, or we use a probabilistic reasoning and end up with a probabilistic algorithm.

    The second method, called the partitioning method, relaxes the demand on the underlying algorithm. Instead of having a single algorithm for solving problems with domain less than d, we allow an arbitrary number of them, each solving the problem for a different domain size. Thus by splitting, or partitioning, the domain of the large problem, we again solve a large number of smaller problems before arriving at a solution.

    Armed with these new techniques, we study a number of different problems; the decision problems (d, l)-CSP and k-Colourability, together with their counting counterparts, as well as the optimisation problems Max Ind CSP, Max Value CSP, Max CSP, and Max Hamming CSP. Among the results, we find a very fast, polynomial space algorithm for determining k-colourability of graphs.

    Download full text (pdf)
    FULLTEXT01
  • 344.
    Angelsmark, Ola
    Linköping University, The Institute of Technology. Linköping University, Department of Computer and Information Science, TCSLAB - Theoretical Computer Science Laboratory.
    Partitioning based algorithms for some colouring problems2005In: Proceedings of the Joint Annual Workshop of {ERCIM/CoLogNet} on Constraint Solving and Constraint Logic Programming,2005, ERCIM , 2005, p. 28-42Conference paper (Refereed)
  • 345.
    Angelsmark, Ola
    et al.
    Linköping University, The Institute of Technology. Linköping University, Department of Computer and Information Science, TCSLAB - Theoretical Computer Science Laboratory.
    Dahllöf, Vilhelm
    Linköping University, The Institute of Technology. Linköping University, Department of Computer and Information Science, TCSLAB - Theoretical Computer Science Laboratory.
    Jonsson, Peter
    Linköping University, The Institute of Technology. Linköping University, Department of Computer and Information Science, TCSLAB - Theoretical Computer Science Laboratory.
    Finite Domain Constraint Satisfaction Using Quantum Computation2002In: Mathematical Foundations of Computer Science, 27th International Symposium MFCS-2002,2002, Heidelberg: Springer Verlag , 2002, p. 93-Conference paper (Refereed)
    Abstract [en]

    We present a quantum algorithm for finite domain constraint solving, where the constraints have arity 2. It is complete and runs in time, where d is size of the domain of the variables and n the number of variables. For the case of d=3 we provide a method to obtain an upper time bound of . Also for d=5 the upper bound has been improved. Using this method in a slightly different way we can decide 3-colourability in O(1.2185^n) time.

  • 346.
    Angelsmark, Ola
    et al.
    Linköping University, Department of Computer and Information Science, TCSLAB - Theoretical Computer Science Laboratory. Linköping University, The Institute of Technology.
    Jonsson, Peter
    Linköping University, Department of Computer and Information Science, TCSLAB - Theoretical Computer Science Laboratory. Linköping University, The Institute of Technology.
    Improved algorithms for counting solutions in constraint satisfaction problems2003In: Principles and Practice of Constraint Programming, 9th International Conference CP 2003,2003, Springer, 2003, Vol. 2833, p. 81-95Conference paper (Refereed)
    Abstract [en]

    Counting the number of solutions to CSP instances has vast applications in several areas ranging from statistical physics to artificial intelligence. We provide a new algorithm for counting the number of solutions to binary CSP s which has a time complexity ranging from O ((d/4 . alpha(4))(n)) to O((alpha + alpha(5) + [d/4 - 1] . alpha(4))(n)) (where alpha approximate to 1.2561) depending on the domain size d greater than or equal to 3. This is substantially faster than previous algorithms, especially for small d. We also provide an algorithm for counting k-colourings in graphs and its running time ranges from O ([log(2) k](n)) to O ([log(2) k + 1](n)) depending on k greater than or equal to 4. Previously, only an O(1.8171(n)) time algorithm for counting 3-colourings were known, and we improve this upper bound to O(1.7879(n)).

  • 347.
    Angelsmark, Ola
    et al.
    Linköping University, The Institute of Technology. Linköping University, Department of Computer and Information Science, TCSLAB - Theoretical Computer Science Laboratory.
    Jonsson, Peter
    Linköping University, The Institute of Technology. Linköping University, Department of Computer and Information Science, TCSLAB - Theoretical Computer Science Laboratory.
    Linusson, Svante
    Linköping University, The Institute of Technology. Linköping University, Department of Mathematics, Applied Mathematics.
    Thapper, Johan
    Linköping University, The Institute of Technology. Linköping University, Department of Mathematics, Applied Mathematics.
    Determining the Number of Solutions to Binary CSP Instances2002In: Principles and Practice of Constraint Programming, 8th International Conference CP-2002,2002, Heidelberg: Springer Verlag , 2002, p. 327-Conference paper (Refereed)
    Abstract [en]

    Counting the number of solutions to CSP instances has applications in several areas, ranging from statistical physics to artificial intelligence. We give an algorithm for counting the number of solutions to binary CSPs, which works by transforming the problem into a number of 2-SAT instances, where the total number of solutions to these instances is the same as those of the original problem. The algorithm consists of two main cases, depending on whether the domain size d is even, in which case the algorithm runs in O(1.3247^n*(d/2)^n) time, or odd, in which case it runs in O(1.3247^n*((d^2+d+2)/4)^(n/2)) if d=4*k+1, and O(1.3247^n*((d^2+d)/4)^(n/2)) if d=4*k+3. We also give an algorithm for counting the number of possible 3-colourings of a given graph, which runs in O(1.8171^n), an improvement over our general algorithm gained by using problem specific knowledge. 

  • 348.
    Angelsmark, Ola
    et al.
    Linköping University, The Institute of Technology. Linköping University, Department of Computer and Information Science, TCSLAB - Theoretical Computer Science Laboratory.
    Thapper, Johan
    Linköping University, The Institute of Technology. Linköping University, Department of Mathematics, Applied Mathematics.
    A Microstructure Based Approach to Constraint Satisfaction Optimisation Problems2005In: The 18th International FLAIRS Conference,2005, Menlo Park, CA, USA: AAAI Press , 2005, p. 155-Conference paper (Refereed)
    Abstract [en]

    We study two constraint satisfaction optimisation problems: The Max Value problem for CSPs, which, somewhat simplified, aims at maximising the sum of the (weighted) variable values in the solution, and the Max Ind problem, where the goal is to find a satisfiable subinstance of the original instance containing as many variables as possible. Both problems are NP-hard to approximate within n^(1-e), e>0, where n is the number of variables in the problems, which implies that it is of interest to find exact algorithms. By exploiting properties of the microstructure, we construct algorithms for solving instances of these problems with small domain sizes, and then, using a probabilistic reasoning, we show how to get algorithms for more general versions of the problems. The resulting algorithms have running times of O((0.585d)^n) for Max Value (d,2)-CSP, and O((0.503d)^n) for MaxInd (d,2)-CSP. Both algorithms represent the best known theoretical bounds for their respective problem, and, more importantly, the methods used are applicable to a wide range of optimisation problems. 

  • 349.
    Angelsmark, Ola
    et al.
    Linköping University, The Institute of Technology. Linköping University, Department of Computer and Information Science, TCSLAB - Theoretical Computer Science Laboratory.
    Thapper, Johan
    Linköping University, The Institute of Technology. Linköping University, Department of Computer and Information Science, TCSLAB - Theoretical Computer Science Laboratory.
    Algorithms for the maximum hamming distance problem2006In: Recent Advances in Constraints: Joint ERCIM/CoLogNET International Workshop on Constraint Solving and Constraint Logic Programming, CSCLP 2005, Uppsala, Sweden, June 20-22, 2005, Revised Selected and Invited Papers / [ed] Boi V. Faltings, Adrian Petcu, François Fages and Francesca Rossi, Springer Berlin/Heidelberg, 2006, Vol. 3419, p. 128-141Chapter in book (Refereed)
    Abstract [en]

    This book constitutes the thoroughly refereed and extended post-proceedings of the Joint ERCIM/CoLogNet International Workshop on Constraint Solving and Constraint Logic Programming, CSCLP 2005, held in Uppsala, Sweden in June 2005.

    Besides papers taken from the workshop, others are submitted in response to an open call for papers after the workshop.

    The 12 revised full papers presented were carefully reviewed and selected for inclusion in the book. The papers are organized in topical sections on global constraints, search and heuristics, language and implementation issues, and modeling

  • 350.
    Angelsmark, Ola
    et al.
    Linköping University, Department of Computer and Information Science, TCSLAB - Theoretical Computer Science Laboratory. Linköping University, The Institute of Technology.
    Thapper, Johan
    Linköping University, Department of Mathematics, Applied Mathematics. Linköping University, The Institute of Technology.
    Algorithms for the Maximum Hamming Distance Problem2006In: Recent Advances in Constraints: Joint ERCIM/CoLogNet International Workshop on Constraint Solving and Constraint Logic Programming, CSCLP 2004, Lausanne, Switzerland, June 23-25, 2004, Revised Selected and Invited Papers / [ed] Boi V. Faltings, Adrian Petcu, François Fages and Francesca Rossi, Springer Berlin/Heidelberg, 2006, p. 128-141Chapter in book (Refereed)
    Abstract [en]

    This book constitutes the thoroughly refereed and extended post-proceedings of the Joint ERCIM/CoLogNet International Workshop on Constraint Solving and Constraint Logic Programming, CSCLP 2005, held in Uppsala, Sweden in June 2005.

    Besides papers taken from the workshop, others are submitted in response to an open call for papers after the workshop.

    The 12 revised full papers presented were carefully reviewed and selected for inclusion in the book. The papers are organized in topical sections on global constraints, search and heuristics, language and implementation issues, and modeling.

45678910 301 - 350 of 6951
CiteExportLink to result list
Permanent link
Cite
Citation style
  • apa
  • 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