Change search
Refine search result
2345678 201 - 250 of 17069
CiteExportLink to result list
Permanent link
Cite
Citation style
  • apa
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • 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.
  • 201.
    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.

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

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

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

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

  • 206.
    Aghaee, Saeed
    Växjö University, Faculty of Mathematics/Science/Technology, School of Mathematics and Systems Engineering.
    Random Stream Cipher2007Independent thesis Basic level (degree of Bachelor), 10 credits / 15 HE creditsStudent thesis
    Abstract [en]

    Stream ciphers are counted as an important part of symmetric encryption method. Their basic idea comes from One-Time-Pad cipher using XOR operator on the plain text and the key to generate the cipher. The present work brings a new idea in symmetric encryption method, which inherits stream key generation idea from synchronous stream cipher and uses division instead of xoring. The Usage of division to combine the plain text with stream key gives numerous abilities to this method that the most important one is using random factors to produce the ciphers.

  • 207.
    Aghazadeh, Omid
    KTH, School of Computer Science and Communication (CSC).
    Object Segmentation using Spatial and Spatio-Temporal Features.2011Independent thesis Advanced level (degree of Master (Two Years)), 20 credits / 30 HE creditsStudent thesis
  • 208.
    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.

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

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

  • 211.
    Aguilar, Xavier
    et al.
    KTH, School of Computer Science and Communication (CSC), High Performance Computing and Visualization (HPCViz).
    Fuerlinger, Karl
    Laure, Erwin
    KTH, School of Computer Science and Communication (CSC), High Performance Computing and Visualization (HPCViz).
    Automatic On-Line Detection of MPI Application Structure with Event Flow Graphs2015In: EURO-PAR 2015: PARALLEL PROCESSING, Springer Berlin/Heidelberg, 2015, 70-81 p.Conference paper (Refereed)
    Abstract [en]

    The deployment of larger and larger HPC systems challenges the scalability of both applications and analysis tools. Performance analysis toolsets provide users with means to spot bottlenecks in their applications by either collecting aggregated statistics or generating loss-less time-stamped traces. While obtaining detailed trace information is the best method to examine the behavior of an application in detail, it is infeasible at extreme scales due to the huge volume of data generated. In this context, knowing the application structure, and particularly the nesting of loops in iterative applications is of great importance as it allows, among other things, to reduce the amount of data collected by focusing on important sections of the code. In this paper we demonstrate how the loop nesting structure of an MPI application can be extracted on-line from its event flow graph without the need of any explicit source code instrumentation. We show how this knowledge on the application structure can be used to compute postmortem statistics as well as to reduce the amount of redundant data collected. To that end, we present a usage scenario where this structure information is utilized on-line (while the application runs) to intelligently collect fine-grained data for only a few iterations of an application, considerably reducing the amount of data gathered.

  • 212.
    Aguilar, Xavier
    et al.
    KTH, School of Computer Science and Communication (CSC), Centres, Centre for High Performance Computing, PDC.
    Schliephake, Michael
    KTH, School of Computer Science and Communication (CSC), Centres, Centre for High Performance Computing, PDC.
    Vahtras, Olav
    KTH, School of Biotechnology (BIO), Theoretical Chemistry and Biology. KTH, School of Computer Science and Communication (CSC), Centres, Centre for High Performance Computing, PDC.
    Gimenez, Judit
    Barcelona Supercomputing Center, Universitat Politecnica de Catalunya, Barcelona, Spain.
    Laure, Erwin
    KTH, School of Computer Science and Communication (CSC), Centres, Centre for High Performance Computing, PDC.
    Scaling Dalton, a molecular electronic structure program2011In: Seventh International Conference on e-Science, e-Science 2011, 5-8 December 2011, Stockholm, Sweden, IEEE conference proceedings, 2011, 256-262 p.Conference paper (Refereed)
    Abstract [en]

    Dalton is a molecular electronic structure program featuring common methods of computational chemistry that are based on pure quantum mechanics (QM) as well as hybrid quantum mechanics/molecular mechanics (QM/MM). It is specialized and has a leading position in calculation of molecular properties with a large world-wide user community (over 2000 licenses issued). In this paper, we present a characterization and performance optimization of Dalton that increases the scalability and parallel efficiency of the application. We also propose asolution that helps to avoid the master/worker design of Daltonto become a performance bottleneck for larger process numbers and increase the parallel efficiency.

  • 213.
    Aguiño, Gonzalo Iglesias
    Karlstad University, Faculty of Economic Sciences, Communication and IT.
    Performance of VoIP strategies for hybrid Mobile Ad Hoc Networks2007Independent thesis Advanced level (degree of Magister), 20 points / 30 hpStudent thesis
    Abstract [en]

    Last decade, a lot of research has been done in wireless communication technologies. Mobile

    nodes such personal digital assistants (PDAs), notebooks and cell phones are nowadays used

    in human’s daily life.

    MANETs are networks consisting of two or more mobile nodes equipped with wireless

    communication and networking capabilities, but they don’t have any network centrilized

    infrastructure.

    In last few years, MANETs have been emerged to be an important researched subject in the

    field of wireless networking.

    MANETs are autonomous; however they can communicate with other external networks such

    the internet. They are linked to such external networks by mobile nodes acting as gateways.

    This kind of networks is known as hybrid MANETs.

    Voice over Internet Protocol (VoIP), is a technology that allows you to make voice calls using

    a Internet connection instead of a regular (or analog) phone line.

    The goal of this thesis is evaluate the performance of VoIP strategies for hybrid MANETs.

    Two different aspects are evaluated, the session establishment performance and the voice

    quality.

    Network Simulator 2 is used to run several simulations, two different applications are used to

    run voice simulations (Session Initiation Protocol and Exponential traffic generator). We

    evaluate two different cases for voice traffics, voice calls between two MANET nodes and

    voice calls between MANET nodes and external nodes.

    After running the simulations, there are some performance parameters which will reveal the

    results. The key findings of the simulations are: adding gateways, number of voice traffic

    flows and the number of hops between source and destinations. There are some interesting

    results which reveal for example, that adding gateways is not always beneficial.

  • 214.
    Agushi, Camrie
    Blekinge Institute of Technology, School of Engineering, Department of Systems and Software Engineering.
    Innovation inom Digital Rights Management2005Independent thesis Advanced level (degree of Master (One Year))Student thesis
    Abstract [en]

    The thesis deals with the topic of Digital Rights Management (DRM), more specifically the innovation trends within DRM. It is focused on three driving forces of DRM. Firstly, DRM technologies, secondly, DRM standards and thirdly, DRM interoperability. These driving forces are discussed and analyzed in order to explore innovation trends within DRM. In the end, a multi-facetted overview of today’s DRM context is formed. One conclusion is that the aspect of Intellectual Property Rights is considered to be an important indicator of the direction DRM innovation is heading.

  • 215. Agustí, Ramón
    et al.
    Fazekas, Péter
    Gómez Barquero, David
    Lindskog, Stefan
    Karlstad University, Faculty of Economic Sciences, Communication and IT, Department of Computer Science. Karlstad University, Faculty of Economic Sciences, Communication and IT, Centre for HumanIT.
    Oliver, Miquel
    Pérez-Romero, Jordi
    Tralli, Velio
    NEWCOM DR7.2: First report on common framework/models and activities in Department 72005Report (Refereed)
    Abstract [en]

    This deliverable provides a description of the framework identified for the collaborative activities between different partners in the context of NEWCOM department 7 on QoS provision in heterogeneous wireless networks. The considered models, assumptions and expected results are pointed out for each activity. The deliverable also includes a report on the means to achieve the integration between the different partners

  • 216. Agustí, Ramón
    et al.
    Fazekas, Péter
    Lindskog, Stefan
    Karlstad University, Faculty of Economic Sciences, Communication and IT, Department of Computer Science. Karlstad University, Faculty of Economic Sciences, Communication and IT, Centre for HumanIT.
    Oliver, Miquel
    Pérez-Romero, Jordi
    Studer Ferreira, Lucio
    Tralli, Velio
    NEWCOM DR7.4: Final Report on the activities carried out in Department 72007Report (Refereed)
    Abstract [en]

    This deliverable constitutes the final report of all the activities that carried out in the framework of the NEWCOM department 7. It contains a description of the main technical achievements for each one of the activities in which the department has been organised togehter with the list of indicators reflecting the degree of integration that has been achieved among the different partners

  • 217.
    Agélii Genlott, Annika
    et al.
    Örebro University, Örebro University School of Business.
    Grönlund, Åke
    Örebro University, Örebro University School of Business.
    Closing the gaps: Improving literacy and mathematics by ict-enhanced collaboration2016In: Computers and education, ISSN 0360-1315, E-ISSN 1873-782X, Vol. 99, 68-80 p.Article in journal (Refereed)
    Abstract [en]

    Literacy and mathematics are necessary skills that for different reasons unfortunately not everybody acquires sufficiently. In OECD countries there is also a gender gap; boys lag behind girls in literacy but often outperform girls in mathematics (OECD, 2012). ICT (Information and communication technologies) may contribute useful tools to address both these problems but in order to effectively create better educational conditions there is yet a need to develop effective methods that combine ICT with key factors for learning. This research contributes to this by measuring effects of the “Write to Learn” (WTL) method. WTL lets children from 1st grade use several ICT tools to write texts and subsequently discuss and refine them together with classmates and teachers using digital real-time formative feedback and assessment. The central learning factor addressed, in mathematics as well as in literacy, is the written communication allowing the learners to interact with peers and teachers. WTL draws on methods from socio-cultural theory, including continuous social interaction and written real-time formative feedback among peers, using shared electronic forums for collaboration, thereby providing social meaning and increased learning of literacy and mathematics, among both boys and girls.

    The study uses quantitative methods and two control groups, one using traditional method (no ICT) and one using technology individually (without integrated social interaction and formative feedback), to compare results from 502 students in grade 3 national tests in mathematics and literacy. WTL yields by far best results; higher average score both in literacy and mathematics, smaller gender gap, and significantly better results for the under-achievers. The ITU method performs worst, which shows that ICT use must be well integrated into the pedagogy to be useful.

  • 218. Ahammed, Farhan
    et al.
    Taheri, Javid
    The University of Sydney, Australia.
    Zomaya, Albert
    The University of Sydney, Sydney, Australia.
    Finding Lower Bounds of Localization with Noisy Measurements Using Genetic Algorithms2011Report (Refereed)
  • 219.
    Ahammed, Farhan
    et al.
    The University of Sydney, Australia.
    Taheri, Javid
    The University of Sydney, Australia.
    Zomaya, Albert
    The University of Sydney, Sydney, Australia.
    Finding lower bounds of localization with noisy measurements using genetic algorithms2011In: Proceedings of the first ACM international symposium on Design and analysis of intelligent vehicular networks and applications (DIVANet '11), Miami, Florida, USA: Association for Computing Machinery (ACM), 2011, 47-54 p.Conference paper (Refereed)
    Abstract [en]

    Vehicular Ad-Hoc Networks (VANETs) are wireless networks with mobile nodes (vehicles) which connect in an ad-hoc manner. Many vehicles use the Global Positioning System (GPS) to provide their locations. However the inaccuracy of GPS devices leads to some vehicles incorrectly assuming they are located at different positions and sometimes on different roads. VANETs can be used to increase the accuracy of each vehicle's computed location by allowing vehicles to share information regarding the measured distances to neighbouring vehicles. This paper looks at finding how much improvement can be made given the erroneous measurements present in the system. An evolutionary algorithm is used to evolve instances of parameters used by the VLOCI2 algorithm, also presented in this paper, to find instances which minimises the inaccuracy in computed locations. Simulation results show a definite improvement in location accuracy and lower bounds on how much improvement is possible is inferred.

  • 220.
    Ahammed, Farhan
    et al.
    The University of Sydney, Sydney, Australia.
    Taheri, Javid
    The University of Sydney, Australia.
    Zomaya, Albert
    The University of Sydney, Sydney, Australia.
    Using simulated annealing to find lower bounds of localization with noisy measurements2012In: 2012 IEEE 26th International Parallel and Distributed Processing Symposium Workshops & PhD Forum (IPDPSW), IEEE conference proceedings, 2012, 601-608 p.Conference paper (Refereed)
  • 221.
    Ahammed, Farhan
    et al.
    The University of Sydney, Australia.
    Taheri, Javid
    The University of Sydney, Australia.
    Zomaya, Albert
    The University of Sydney, Sydney, Australia.
    Ott, Max
    NICTA Australia Australian Technology Park.
    LICA: Improving Localization Given Noisy Data In GPS-Equipped VANETs Using Trilateration With Cluster Analysis2011Report (Refereed)
  • 222.
    Ahammed, Farhan
    et al.
    University of Sydney.
    Taheri, Javid
    The University of Sydney, Australia.
    Zomaya, Albert
    The University of Sydney, Sydney, Australia.
    Ott, Max
    NICTA.
    VLOCI: Using Distance Measurements to Improve the Accuracy of Location Coordinates in GPS-Equipped VANETs2012In: Mobile and Ubiquitous Systems: 7th International ICST Conference, MobiQuitous 2010, Sydney, Australia, December 6-9, 2010, Revised Selected Papers / [ed] Patrick Sénac, Max Ott, Aruna Seneviratne, Springer Berlin/Heidelberg, 2012, Vol. 73, 149-161 p.Conference paper (Refereed)
  • 223.
    Ahammed, Farhan
    et al.
    The University of Sydney, Australia.
    Taheri, Javid
    The University of Sydney, Australia.
    Zomaya, Albert
    The University of Sydney, Sydney, Australia.
    Ott, Max
    NICTA Australia Australian Technology Park.
    VLOCI2: An Iterative Method To Improve Location Coordinates In GPS-Equipped VANETs in Multiple Lanes2011Report (Refereed)
  • 224.
    Ahammed, Farhan
    et al.
    The University of Sydney, Australia.
    Taheri, Javid
    The University of Sydney, Australia.
    Zomaya, Albert
    The University of Sydney, Sydney, Australia.
    Ott, Max
    Australian Technology Park, Australia.
    VLOCI2: An Iterative Method To Improve Location Coordinates In GPS-Equipped VANETs in Multiple Lanes2011Report (Refereed)
  • 225.
    Ahl, Lars
    University of Skövde, Department of Computer Science.
    Intranät på Volvo: riktlinjer för informationsstruktur1998Independent thesis Basic level (degree of Bachelor)Student thesis
    Abstract [sv]

    Detta arbete har haft som målsättning att belysa och behandla möjligheter och problem vid utformande av informationsstrukturer i intranätsammanhang. Arbetet har genomförts i samarbete med Volvo Lastvagnar Komponenter i Skövde. En fallstudie har gjorts där Volvos intranät utvärderats. Dessutom har ett experiment genomförts där samband mellan katalog- och länkstruktur klargjorts. Undersökningens syfte är att uppnå en länkstruktur som tillåter användarna att utföra sitt arbete effektivt och att uppnå en katalogstruktur som inte är förändringsbenägen. Den insamlade informationen kan härledas från litteraturstudier, ett experiment, en webb-enkät och intervjuer. De slutsatser som dragits visar i stort på att katalogstrukturen i möjligaste mån bör kategoriseras utifrån informationsinnehåll och att flera länkstrukturer kan skapas och kategoriseras då både utifrån informationsinnehåll och enligt organisationsstruktur. Detta för att administratören inte skall behöva ändra informationsstrukturen när organisationen förändras och att användarna skall erhålla en informationsstruktur där information kan sökas och hämtas genom den länkstruktur som för tillfället är effektivast. I slutet av rapporten diskuteras ämnet allmänt och det framläggs riktlinjer för vad som bör betänkas då en informationsstruktur utformas.

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

  • 227.
    Ahl, Viggo
    Blekinge Institute of Technology, School of Engineering, Department of Systems and Software Engineering.
    An experimental comparison of five prioritization methods: Investigating ease of use, accuracy and scalability2005Independent thesis Advanced level (degree of Master (One Year))Student thesis
    Abstract [en]

    Requirements prioritization is an important part of developing the right product in the right time. There are different ideas about which method is the best to use when prioritizing requirements. This thesis takes a closer look at five different methods and then put them into an controlled experiment, in order to find out which of the methods that would be the best method to use. The experiment was designed to find out which method yields the most accurate result, the method’s ability to scale up to many more requirements, what time it took to prioritize with the method, and finally how easy the method was to use. These four criteria combined will indicate which method is more suitable, i.e. be the best method, to use in prioritizing of requirements. The chosen methods are the well-known analytic hierarchy process, the computer algorithm binary search tree, and from the ideas of extreme programming come planning game. The fourth method is an old but well used method, the 100 points method. The last method is a new method, which combines planning game with the analytic hierarchy process. Analysis of the data from the experiment indicates that the planning game combined with analytic hierarchy process could be a good candidate. However, the result from the experiment clearly indicates that the binary search tree yields accurate result, is able to scale up and was the easiest method to use. For these three reasons the binary search tree clearly is the better method to use for prioritizing requirements

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

  • 229.
    Ahlberg, Michael
    et al.
    KTH, School of Information and Communication Technology (ICT), Electronic, Computer and Software Systems, ECS.
    Vlassov, Vladimir
    KTH, School of Information and Communication Technology (ICT), Electronic, Computer and Software Systems, ECS.
    Yasui, Terumasa
    Advanced Technology Research and Development Center, Mitsubishi Electric Corporation, Amagasaki, Japan.
    Router placement in wireless sensor networks2006In: 2006 IEEE International Conference on Mobile Adhoc and Sensor Systems, Vols 1 and 2, IEEE , 2006, 498-501 p.Conference paper (Refereed)
    Abstract [en]

    In this paper we propose and evaluate algorithms for placement of routers in a wireless sensor network. There are two major requirements on router placement First, a placement must guarantee connectivity, i.e. every sensor must be able to communicate through routers with a predefined computer-connected gateway node. Second, a placement must provide robust communication in the case of router failures. This is achieved by placing redundant routers that increase the number of possible routes. Both requirements should be met by placing as few routers as possible. The proposed algorithms compute placement in an efficient and reasonably fast way.

  • 230. Ahlberg, Ragnar
    et al.
    Gustafsson, Bertil
    Uppsala University, Disciplinary Domain of Science and Technology, Mathematics and Computer Science, Department of Scientific Computing. Uppsala University, Disciplinary Domain of Science and Technology, Mathematics and Computer Science, Department of Information Technology, Numerical Analysis.
    A note on parallel algorithms for partial differential equations1984In: Parallel Computing: 83, Amsterdam, The Netherlands: Elsevier Science , 1984, 93-98 p.Conference paper (Refereed)
  • 231.
    Ahlbäck, Aron
    University of Skövde, School of Informatics.
    Tystnad talar: En utvärdering av ”think aloud” i spelbarhetstestning2016Independent thesis Basic level (degree of Bachelor), 20 credits / 30 HE creditsStudent thesis
    Abstract [sv]

    Detta arbete undersöker huruvida "think aloud"-tekniken som den används i användbarhetstestning är lämplig i samband med spelbarhetstestning samt hur uppmaningar att tänka högt påverkar en speltestares immersion i spelupplevelsen. Forskningsområdet valdes främst då tekniken think aloud rekommenderas till spelbarhetstestning från många håll utan vetenskaplig motivering. En frågeställning togs fram med denna bakgrund i åtanke. För att utvärdera frågeställningen genomfördes en kvantitativ undersökning där en serie respondenter fick spela en artefakt i form av en för ändamålet konstruerad nivå till spelet Rising Islands (Mindblown 2016) för att sedan fylla i en enkät som mätte deras upplevda nivå av "immersion". Hälften av respondenterna uppmanades att tänka högt under speltillfället, övriga respondenter genomförde spelsessionen utan störande moment. Gruppernas genomsnittliga enkätresultat ställdes mot varandra i ett T-test. Resultatet visade att uppmaningar att tänka högt inte hade någon märkbar inverkan på upplevd immersion, men vidare forskning är nödvändig då det finns osäkerheter i datamängden.

  • 232. Ahlgren, B.
    et al.
    Hidell, Markus
    KTH, School of Information and Communication Technology (ICT), Communication Systems, CoS, Network Systems Laboratory (NS Lab).
    Ngai, E. C. -H
    Internet of Things for Smart Cities: Interoperability and Open Data2016In: IEEE Internet Computing, ISSN 1089-7801, E-ISSN 1941-0131, Vol. 20, no 6, 52-56 p., 7781549Article in journal (Refereed)
    Abstract [en]

    The Internet of Things (IoT) has become a promising technology for addressing societal challenges by connecting smart devices and leveraging Big Data analytics to create smart cities worldwide. As the IoT scales up, it's important to provide interoperability among different devices. Yet current simple standard protocols lack sufficient openness and interoperability. IoT for smart cities needs to guarantee the accessibility of open data and cloud services to allow industries and citizens to develop new services and applications. Here, the authors provide a case study of the GreenIoT platform in Uppsala, Sweden, to demonstrate the idea of interoperability and open data for smart cities.

  • 233.
    Ahlgren, Bengt
    et al.
    RISE, Swedish ICT, SICS, Decisions, Networks and Analytics lab.
    Hidell, Markus
    Ngai, Edith
    Internet of Things for Smart Cities: Interoperability and Open Data2016In: IEEE Internet Computing, ISSN 1089-7801, E-ISSN 1941-0131, 52-56 p.Article in journal (Refereed)
    Abstract [en]

    The Internet of Things (IoT) for smart cities needs accessible open data and open systems, so that industries and citizens can develop new services and applications. As an example, the authors provide a case study of the GreenIoT platform in Uppsala, Sweden.

  • 234.
    Ahlgren, Bengt
    et al.
    RISE, Swedish ICT, SICS, Decisions, Networks and Analytics lab.
    Lindgren, Anders
    RISE, Swedish ICT, SICS, Decisions, Networks and Analytics lab.
    Wu, Yanqiu
    Demo: Experimental Feasibility Study of CCN-lite on Contiki Motes for IoT Data Streams2016In: ICN 2016: 3rd ACM Conference on Information-Centric Networking, 2016Conference paper (Refereed)
  • 235.
    Ahlgren, Hannes
    Växjö University, Faculty of Mathematics/Science/Technology, School of Mathematics and Systems Engineering.
    Graph visualization with OpenGL2005Independent thesis Basic level (degree of Bachelor), 10 credits / 15 HE creditsStudent thesis
    Abstract [en]

    Vizz3D is a 3D graphics code analysis tool, developed at Växjö University that optionally can use Java3D or OpenGL. However, initially Java3D was the only programming interface used. No other version was considered. Therefore the applications structure was built with the Java3D way of thought in mind. But code visualization with 3D graphics can be a demanding task for the computers processor and its graphics hardware and Java3D is known to be somewhat inefficient. So an OpenGL version was introduced.

    This thesis reflects on the work restructuring the application’s code to fit both versions within Vizz3D in a structured and object-oriented way. The thesis shows the efforts to be taken to make an existing ever evolving tool easily extendible to other API’s. Additional aspects of OpenGL specific implementations are discussed throughout the thesis.

  • 236.
    Ahlgren, Joel
    et al.
    KTH, School of Computer Science and Communication (CSC).
    Mikkola, Mattias
    KTH, School of Computer Science and Communication (CSC).
    Net Voting – Designing an Online Voting System.2011Independent thesis Advanced level (professional degree), 10 credits / 15 HE creditsStudent thesis
    Abstract [en]

    We are currently in a time where old routines and ways are being converted to more easily accessible, digital ways. You can perform your bank errands and interact with authorities through the Internet. While many of our societies functions already have undergone this transformation, our elections are still very manual. In our report we present what we think are the biggest obstacles to implementing a net voting system in Sweden, how to solve these issues and present a system which we feel would be a good start to designing The Ultimate Net Voting System. We touch upon areas like authenticating voters, protecting their right to anonymous voting in sending and storing votes and ways to protect against attacks against this system. In the end, we present an abstract level of a system design which could begin to fulfill all requirements to make net voting a feasible solution.

  • 237.
    Ahlgren, Joel
    et al.
    KTH, School of Computer Science and Communication (CSC), Media technology and interaction design.
    Mikkola, Mattias
    KTH, School of Computer Science and Communication (CSC), Media technology and interaction design.
    Net Voting – Designing an Online Voting System.2011Independent thesis Advanced level (professional degree), 10 credits / 15 HE creditsStudent thesis
    Abstract [en]

    We are currently in a time where old routines and ways are being converted to more easily accessible, digital ways. You can perform your bank errands and interact with authorities through the Internet. While many of our societies functions already have undergone this transformation, our elections are still very manual. In our report we present what we think are the biggest obstacles to implementing a net voting system in Sweden, how to solve these issues and present a system which we feel would be a good start to designing The Ultimate Net Voting System. We touch upon areas like authenticating voters, protecting their right to anonymous voting in sending and storing votes and ways to protect against attacks against this system. In the end, we present an abstract level of a system design which could begin to fulfill all requirements to make net voting a feasible solution.

  • 238.
    Ahlgren, Johan
    et al.
    Blekinge Institute of Technology, Department of Software Engineering and Computer Science.
    Karlsson, Robert
    Blekinge Institute of Technology, Department of Software Engineering and Computer Science.
    En studie av inbyggda brandväggar: Microsoft XP och Red Hat Linux2003Independent thesis Basic level (degree of Bachelor)Student thesis
    Abstract [sv]

    Detta kandidatarbete utreder hur väl två operativsystems inbyggda brandväggar fungerar i symbios med en användares vanligaste tjänsteutnyttjande på Internet, samt att se hur likartade de är i sitt skydd från hot. De två operativsystemen som vi utgick ifrån var Microsoft Windows XP samt Red Hat Linux 8.0. Den hypotes vi arbetat kring lyder enligt följande: De två inbyggda brandväggarna är i stort likartade rörande skydd från hot på Internet och uppfyller användarnas tjänsteutnyttjande. De metoder vi använt, för att svara på vår frågeställning, har delats upp i ett funktionalitetstest och ett säkerhetstest. I funktionalitetstestet provades de vanligaste Internettjänsterna med den inbyggda brandväggen och ifall det uppstod några komplikationer eller ej. De två inbyggda brandväggarna genom gick i säkerhetstestet skannings- och svaghetskontroll via ett flertal verktyg. Genom resultatet kan vi konstatera att de inbyggda brandväggarna klarar av de vanligaste tjänsterna på Internet, men att en skillnad föreligger hos dem vad gäller exponeringen ut mot Internet. Windows XP ligger helt osynligt utåt, medan Red Hats inbyggda brandvägg avslöjar en mängd information om värddatorn, som kan komma att användas i illvilliga syften. Slutsatsen blev att vi avslutningsvis falsifierade vår hypotes då de två inbyggda brandväggarna ej var jämlika i sitt skydd mot yttre hot på Internet.

  • 239.
    Ahlgren, Linus
    University of Skövde, Department of Computer Science.
    En objektorienterad, semistrukturerad databas för lagring av proteininformation2001Independent thesis Basic level (degree of Bachelor)Student thesis
    Abstract [en]

    Under det senaste årtiondet har molekylärbiologin genomgått stora förändringar. Genom utvecklingen av tekniker för DNA-sekvensiering har man kunnat utforska stora mängder information. Denna information lagras i biodatabaser som i många fall är länkade med varandra för att ge användaren ett bredare sökfält. SWISS-PROT är ett exempel på en sådan biodatabas som lagrar proteininformation.

    Användare som har mindre kunskap om databasens uppbyggnad och unika identifierare kan dock stöta på problem i form av en mängd sökresultat, där endast en mindre del är intressanta för användaren. Missförstånd och tvetydigheter kan också uppstå i länkade biodatabaser, då databaserna har olika uppbyggnad och definitioner på olika "byggstenar" i databasen.

    Arbetet i denna rapport ska därför fokusera på att skapa en databas för molekylärbiologidata som tar hand om dessa problem. För att kunna åstadkomma detta ska ett databashanteringssystem som har funktionaliteter som erbjuder lösningar till dessa problem användas. Den data, i form av proteininformation, som ska lagras hämtas från en SWISS-PROT-domän. I arbetet kommer databashanteringssystemet Lore att användas.

  • 240. Ahlgren, Per
    et al.
    Grönqvist, Leif
    Växjö University, Faculty of Mathematics/Science/Technology, School of Mathematics and Systems Engineering.
    Evaluation of retrieval effectiveness with incomplete relevance data: theoretical and experimental comparison of three measures2007In: International Journal of Information Processing & Management, Vol. In press, 14- p.Article in journal (Refereed)
    Abstract [en]

    The main reason for this work is to find an appropriate way to include multi-word units in a latent semantic vector model. This would be of great use since these models normally are defined in terms of words, which makes it impossible to search for many types of multi-word units when the model is used in information retrieval tasks. The paper presents a Swedish evaluation set based on synonym tests and an evaluation of vector models trained with different corpora and parameter settings, including a rather naive way to add bi- and trigrams to the models. The best results in the evaluation is actually obtained with both bi- and trigrams added. Our hope is that the results in a forthcoming evaluation in the document retrieval context, which is an important application for these models, still will be at least as good with the bi- and trigrams are added, as without.

  • 241. Ahlgren, Per
    et al.
    Grönqvist, Leif
    Växjö University, Faculty of Mathematics/Science/Technology, School of Mathematics and Systems Engineering.
    Measuring retrieval effectiveness with incomplete relevance data2006In: Current Research in Information Sciences and Technologies: Multidisciplinary approaches to global information systems (InSciT2006 proceedings), Open Institute of Knowledge , 2006, 74-78 p.Conference paper (Refereed)
  • 242. Ahlgren, Per
    et al.
    Grönqvist, Leif
    Växjö University, Faculty of Mathematics/Science/Technology, School of Mathematics and Systems Engineering.
    Retrieval evaluation with incomplete relevance data: A comparative study of three measures (poster abstract)2006In: Proceedings of the 15th ACM International Conference on Information and Knowledge Management (CIKM), ACM Press, New York, NY, USA , 2006, 872-873 p.Conference paper (Refereed)
  • 243.
    Ahlin, Daniel
    et al.
    Växjö University.
    Jartelius, Martin
    Växjö University.
    Tingdahl, Johanna
    Växjö University.
    Proxyserver för passiv informationssökning2005Independent thesis Basic level (degree of Bachelor), 20 credits / 30 HE creditsStudent thesis
    Abstract [en]

    In today’s society the average person is flooded by information from everywhere. This is in particular the case when using the Internet; consider for a moment the fact that a decent search engine at this moment scans 8 058 million homepages. For a user that repeatedly comes back to the same site, the case is often that they know what they are looking for. The problem is to isolate the important information from all the other information embedding it.

    We would like to state that we have found one possible solution to this problem, where the user himself can define what information he is looking for at a specific server, then scan the server when visiting it with his browser. The information is then saved and made easily accessible to the user, independent of what system he is using.

    Our solution is based on a proxy-server, through which the user makes his connections. The server is configurable as to what information to scan for and where, as well as in what format, the data should be saved. Our method with an independent proxyserver is not as efficient as including this support into a browser, but it is enough to give proof of the concept. For high-speed connections to a server on the same network as the user, it might be possible for a user to notice that it is slowing down the connection, but it’s a matter of fractions of a second, and surfing under normal conditions the user is very unlikely to be bothered by the proxy. The actual loss in performance is the time required to make a second TCP-connection for each call, as well as a slight loss of efficiency due to Java’s thread synchronization.

  • 244. Ahlkrona, Josefin
    et al.
    Lötstedt, Per
    Kirchner, Nina
    Stockholm University, Faculty of Science, Department of Physical Geography.
    Zwinger, Thomas
    Dynamically coupling the non-linear Stokes equations with the shallow ice approximation in glaciology: Description and first applications of the ISCAL method2016In: Journal of Computational Physics, ISSN 0021-9991, E-ISSN 1090-2716, Vol. 308, 1-19 p.Article in journal (Refereed)
    Abstract [en]

    We propose and implement a new method, called the Ice Sheet Coupled Approximation Levels (ISCAL) method, for simulation of ice sheet flow in large domains during long time-intervals. The method couples the full Stokes (FS) equations with the Shallow Ice Approximation (SIA). The part of the domain where SIA is applied is determined automatically and dynamically based on estimates of the modeling error. For a three dimensional model problem, ISCAL computes the solution substantially faster with a low reduction in accuracy compared to a monolithic FS. Furthermore, ISCAL is shown to be able to detect rapid dynamic changes in the flow. Three different error estimations are applied and compared. Finally, ISCAL is applied to the Greenland Ice Sheet on a quasi-uniform grid, proving ISCAL to be a potential valuable tool for the ice sheet modeling community.

  • 245.
    Ahlmén, Caroline
    University of Gävle. University of Gävle, Faculty of Engineering and Sustainable Development, Department of Industrial Development, IT and Land Management.
    Hemligheten bakom populära animerade karaktärer2010Independent thesis Basic level (degree of Bachelor), 10 credits / 15 HE creditsStudent thesis
    Abstract [sv]

    Vad gör en framgångsrik animerad karaktär? Homer Simpson, Svampbob Fyrkant och Eric Cartman kommer att analyseras och jämföras för att hitta vad som gör just dem så populära. Därefter kommer de psykologiska aspekterna att granskas. Varför tilltalar dessa karaktärer människor? Riktlinjer för hur man skapar en populär animerad karaktär kommer att utvecklas utifrån resultatet av utredningen.

  • 246.
    Ahlqvist, Oscar
    et al.
    KTH, School of Computer Science and Communication (CSC).
    Åkermark, Wilhelm
    KTH, School of Computer Science and Communication (CSC).
    Examining the Implications of Adding Sentiment Analysis when Clustering based on Party Affiliation through Twitter2017Independent thesis Basic level (degree of Bachelor), 10 credits / 15 HE creditsStudent thesis
    Abstract [en]

    Political discussion is very common and a popular statistic for the politically interested are the surveys determining people’s party affiliation. Today they are done manually but it would be beneficial if there was an automated method which could produce the same or similar results. On the social network Twitter there are a lot of users discussing politics, all from political leaders and representatives to just regular people with an interest for the subject. Because of that and also for its convenience when it comes to collecting data, Twitter has been used before in previous work to cluster political users based on what they are discussing. What has not been done before which this thesis contributes is clustering with sentiment analysis. In other terms, trying to cluster people based on what they are discussing but also if their opinion is positive or negative. What was noted in this work was that the part of clustering without sentiment analysis, that had been done in previous studies, was successfully replicated. However adding the sentiment analysis did not give the desired effect and only worsened the results.

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

  • 248.
    Ahlström, Catharina
    et al.
    Blekinge Institute of Technology, Department of Human Work Science and Media Technology.
    Fridensköld, Kristina
    Blekinge Institute of Technology, Department of Human Work Science and Media Technology.
    How to support and enhance communication: in a student software development project2002Independent thesis Basic level (degree of Bachelor)Student thesis
    Abstract [en]

    This report, in which we have put an emphasis on the word communication, is based on a student software development project conducted during spring 2002. We describe how the use of design tools plays a key role in supporting communication in group activities and to what extent communication can be supported and enhanced by tools such as mock-ups and metaphors in a group project. We also describe a design progress from initial sketches to a final mock-up of a GUI for a postcard demo application.

  • 249.
    Ahlström, Eric
    et al.
    Blekinge Institute of Technology, Faculty of Computing, Department of Creative Technologies.
    Holmqvist, Lucas
    Blekinge Institute of Technology, Faculty of Computing, Department of Creative Technologies.
    Goswami, Prashant
    Blekinge Institute of Technology, Faculty of Computing, Department of Creative Technologies.
    Comparing Traditional Key Frame and Hybrid Animation2017In: SCA '17 Proceedings of the ACM SIGGRAPH / Eurographics Symposium on Computer Animation, ACM Digital Library, 2017, nr. 20Conference paper (Refereed)
    Abstract [en]

    In this research the authors explore a hybrid approach which usesthe basic concept of key frame animation together with proceduralanimation to reduce the number of key frames needed for an animationclip. The two approaches are compared by conducting anexperiment where the participating subjects were asked to ratethem based on their visual appeal.

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

2345678 201 - 250 of 17069
CiteExportLink to result list
Permanent link
Cite
Citation style
  • apa
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • 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