Change search
Refine search result
2345678 201 - 250 of 18220
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)
  • 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.
  • 201.
    Afzal, Zeeshan
    et al.
    Karlstad University, Faculty of Health, Science and Technology (starting 2013), Department of Mathematics and Computer Science.
    Lindskog, Stefan
    Karlstad University, Faculty of Economic Sciences, Communication and IT, Department of Computer Science. Karlstad University, Faculty of Health, Science and Technology (starting 2013).
    Multipath TCP IDS Evasion and Mitigation2015In: Information Security: 18th International Conference, ISC 2015, Trondheim, Norway, September 9-11, 2015, Proceedings, Springer, 2015, Vol. 9290, p. 265-282Conference paper (Refereed)
    Abstract [en]

    The existing network security infrastructure is not ready for future protocols such as Multipath TCP (MPTCP). The outcome is that middleboxes are configured to block such protocols. This paper studies the security risk that arises if future protocols are used over unaware infrastructures. In particular, the practicality and severity of cross-path fragmentation attacks utilizing MPTCP against the signature-matching capability of the Snort intrusion detection system (IDS) is investigated. Results reveal that the attack is realistic and opens the possibility to evade any signature-based IDS. To mitigate the attack, a solution is also proposed in the form of the MPTCP Linker tool. The work outlines the importance of MPTCP support in future network security middleboxes.

  • 202.
    Afzal, Zeeshan
    et al.
    Karlstad University, Faculty of Health, Science and Technology (starting 2013), Department of Mathematics and Computer Science (from 2013).
    Lindskog, Stefan
    Karlstad University, Faculty of Health, Science and Technology (starting 2013), Department of Mathematics and Computer Science (from 2013).
    Brunström, Anna
    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.
    Lidén, Anders
    Towards Multipath TCP Aware Security Technologies2016In: 2016 8th IFIP International Conference onNew Technologies, Mobility and Security (NTMS), New York: IEEE, 2016, p. 1-8Conference paper (Refereed)
    Abstract [en]

    Multipath TCP (MPTCP) is a proposed extension to TCP that enables a number of performance advantages that have not been offered before. While the protocol specification is close to being finalized, there still remain some unaddressed challenges regarding the deployment and security implications of the protocol. This work attempts to tackle some of these concerns by proposing and implementing MPTCP aware security services and deploying them inside a proof of concept MPTCP proxy. The aim is to enable hosts, even those without native MPTCP support, to securely benefit from the MPTCP performance advantages. Our evaluations show that the security services that are implemented enable proper intrusion detection and prevention to thwart potential attacks as well as threshold rules to prevent denial of service (DoS) attacks.

  • 203.
    Afzal, Zeeshan
    et al.
    Karlstad University, Faculty of Health, Science and Technology (starting 2013), Department of Mathematics and Computer Science.
    Lindskog, Stefan
    Karlstad University, Faculty of Economic Sciences, Communication and IT, Department of Computer Science. Karlstad University, Faculty of Health, Science and Technology (starting 2013).
    Lidén, Anders
    A Multipath TCP Proxy2015Conference paper (Refereed)
    Abstract [en]

    Multipath TCP (MPTCP) is an extension to traditionalTCP that enables a number of performance advantages,which were not offered before. While the protocol specificationis close to being finalized, there still remain some concernsregarding deployability and security. This paper describes theon going work to develop a solution that will facilitate thedeployment of MPTCP. The solution will not only allow non-MPTCP capable end-hosts to benefit from MPTCP performancegains, but also help ease the network security concerns that manymiddleboxes face due to the possibility of data stream beingfragmented across multiple subflows.

  • 204.
    Afzal, Zeeshan
    et al.
    Karlstad University, Faculty of Health, Science and Technology (starting 2013), Department of Mathematics and Computer Science.
    Rossebø, Judith
    Integrated Operations, ABB AS, Norway.
    Chowdhury, Mohammad
    Talha, Batool
    ABB Corporate Research, ABB AS, Norway.
    A Wireless Intrusion Detection System for 802.11 networks2016In: PROCEEDINGS OF THE 2016 IEEE INTERNATIONAL CONFERENCE ON WIRELESS COMMUNICATIONS, SIGNAL PROCESSING AND NETWORKING (WISPNET), IEEE conference proceedings, 2016, p. 828-834Conference paper (Refereed)
    Abstract [en]

    Wireless local area networks (WLANs) deployment is increasing rapidly. At the same time, WLANs have become an attractive target for many potential attackers. In spite of that, the de facto standard used to implement most WLANs (IEEE 802.11) has what appear to be residual vulnerabilities related to identity spoofing. In this paper, a pragmatic study of two common attacks on the standard is conducted. These attacks are then implemented on test beds to learn attack behavior. Finally, novel attack signatures and techniques to detect these attacks are devised and implemented in a proof of concept Wireless Intrusion Detection System (WIDS).

  • 205.
    Agapi, Mesodiakaki
    et al.
    Karlstad University, Faculty of Health, Science and Technology (starting 2013), Department of Mathematics and Computer Science (from 2013).
    Zola, Enrica
    Univ Politecn Cataluna, Dept Network Engn, Barcelona, Spain.
    Kassler, Andreas
    Karlstad University, Faculty of Health, Science and Technology (starting 2013), Department of Mathematics and Computer Science (from 2013).
    User Association in 5G Heterogeneous Networks with Mesh Millimeter Wave Backhaul Links2017In: 2017 IEEE 18th International Symposium on A World of Wireless, Mobile and Multimedia Networks (WoWMoM), IEEE, 2017Chapter in book (Other academic)
    Abstract [en]

    Fifth generation (5G) wireless networks will target at energy and spectrum efficient solutions to cope with the increasing demands in capacity and energy efficiency. To achieve this joint goal, dense networks of small cells (SCs) are expected to overlay the existing macro cells. In parallel, for the SC connection to the core network, a promising solution lies in a mesh network of high capacity millimeter wave backhaul (BH) links. In the considered 5G architecture, each SC is able to forward its BH traffic to the core network through alternative paths, thus offering high BIT network reliability. In this context, the joint problem of user association and HI routing becomes challenging. In this paper, we focus on this problem targeting at energy and spectrum efficient solutions. A low-complexity algorithm is proposed, which bases its user association and BIT routing decision i) on minimizing the spectrum resources to guarantee the user rate, so as to provide high spectrum efficiency, and ii) on minimizing both the access network and BH route power consumption to provide high energy efficiency. Our results show that our solution provides better trade-offs between energy and spectrum efficiency than the state-of-the-art in 3GPP scenarios.

  • 206.
    Agardh, Johannes
    et al.
    Blekinge Institute of Technology, Department of Human Work Science and Media Technology.
    Johansson, Martin
    Blekinge Institute of Technology, Department of Human Work Science and Media Technology.
    Pettersson, Mårten
    Blekinge Institute of Technology, Department of Human Work Science and Media Technology.
    Designing Future Interaction with Today's Technology1999Independent thesis Advanced level (degree of Master (One Year))Student thesis
    Abstract [en]

    Information Technology has an increasing part of our lives. In this thesis we will discuss how technology can relate to humans and human activity. We take our standing point in concepts like Calm Technology and Tacit Interaction and examine how these visions and concepts can be used in the process of designing an artifact for a real work practice. We have done work-place studies of truck-drivers and traffic leaders regarding how they find their way to the right addresses and design a truck navigation system that aims to suit the truck drivers work practice.

  • 207.
    Agelis, Sacki
    et al.
    Halmstad University, School of Information Science, Computer and Electrical Engineering (IDE), Halmstad Embedded and Intelligent Systems Research (EIS).
    Jonsson, Magnus
    Halmstad University, School of Information Science, Computer and Electrical Engineering (IDE), Halmstad Embedded and Intelligent Systems Research (EIS).
    Optoelectronic router with a reconfigurable shuffle network based on micro-optoelectromechanical systems2004In: Journal of Optical Networking, ISSN 1536-5379, Vol. 4, no 1, p. 1-10Article in journal (Refereed)
    Abstract [en]

    An optoelectronic router with a shuffle exchange network is presented and enhanced by the addition of micro-optoelectromechanical systems (MOEMS) in the network to add the ability to reconfigure the shuffle network. The MOEMS described here are fully connected any-to-any crossbar switches. The added reconfigurability provides the opportunity to adapt the system to different common application characteristics. Two representative application models are described: The first has symmetric properties, and the second has asymmetric properties. The router system is simulated with the specified applications and an analysis of the results is carried out. By use of MOEMS in the optical network, and thus reconfigurability, greater than 50% increased throughput performance and decreased average packet delay are obtained for the given application. Network congestion is avoided throughout the system if reconfigurability is used.

  • 208.
    Agerblad, Josefin
    et al.
    KTH, School of Computer Science and Communication (CSC).
    Andersen, Martin
    KTH, School of Computer Science and Communication (CSC).
    Provably Secure Pseudo-Random Generators 2013Independent thesis Basic level (degree of Bachelor), 10 credits / 15 HE creditsStudent thesis
    Abstract [en]

    This report is a literary study on provably secure pseudo-random generators. In the report we explain what provably secure pseudo-random generators are and what they are most commonly used for. We also discuss one-way functions which are closely related to our subject. Furthermore, two well-known generators are described and compared, one generator by Blum and Micali, and one by Blum, Blum and Shub. What we have concluded is that the x

    2 mod N generator by Blum, Blum and Shub seems to be the better one concerning speed, security and application areas. You will also be able to read about how the Blum-Blum-Shub generator can be implemented and why we believe that implementation is suitable.

  • 209.
    Aggestam, Lena
    University of Skövde, School of Humanities and Informatics. University of Skövde, The Informatics Research Centre.
    IT-supported knowledge repositories: Increasing their Usefulness by Supporting Knowledge Capture2008Doctoral thesis, monograph (Other academic)
    Abstract [en]

    Organizations use various resources to achieve business objectives, and for financial gain. In modern business, knowledge is a critical resource, and organizations cannot afford not to manage it. Knowledge Management (KM) aims to support learning and to create value for the organization. Based on three levels of inquiry (why, what, how), work presented in this thesis includes a synthesized view of the existing body of knowledge concerning KM and hence a holistic characterization of KM. This characterization reveals a strong dependency between KM and Learning Organization (LO). Neither of them can be successful without the other. We show that a KM project resulting in an IT-supported knowledge repository is a suitable way to start when the intention is to initiate KM work. Thus, our research focuses on ITsupported knowledge repositories.Large numbers of KM projects fail, and organizations lack support for their KM undertakings. These are the main problems that our research addresses. In order for an IT-supported knowledge repository to be successful, it must be used. Thus, the content of the repository is critical for success. Our work reveals that the process of capturing new knowledge is critical if the knowledge repository is to include relevant and updated knowledge. With the purpose of supporting the capture process, this thesis provides a detailed characterization of the capture process as well as guidance aiming to facilitate the implementation of the capture process in such a way that knowledge is continuously captured, also after the KM implementation project is completed. We argue that the continuous capture of new knowledge which can potentially be stored in the knowledge repository will, in the long term perspective, have a positive influence on the usefulness of the repository. This will most likely increase the number of users of the repository and accordingly increase the number of successful KM projects.All the work presented in this thesis is the result of a qualitative research process comprising a literature review and an empirical study that were carried out in parallel. The empirical study is a case study inspired by action research, which involved participation in the project Efficient Knowledge Management and Learning in Knowledge Intensive Organizations (EKLär).

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

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

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

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

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

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

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

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

  • 214.
    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, p. 32-37Conference 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.

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

  • 216.
    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, p. 405-408Conference 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.

  • 217.
    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, p. 503-523Article 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.

  • 218.
    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, p. 2992-3005Article 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.

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

  • 220.
    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
  • 221.
    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, p. 184-192Conference 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.

  • 222.
    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, p. 157-175Article 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.

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

  • 224.
    Agrawal, Vikas
    et al.
    IBM Research, , India.
    Archibald, Christopher
    Mississippi State University, Starkville, United States.
    Bhatt, Mehul
    University of Bremen, Bremen, Germany.
    Bui, Hung Hai
    Laboratory for Natural Language Understanding, Sunnyvale CA, United States.
    Cook, Diane J.
    Washington State University, Pullman WA, United States.
    Cortés, Juan
    University of Toulouse, Toulouse, France.
    Geib, Christopher W.
    Drexel University, Philadelphia PA, United States.
    Gogate, Vibhav
    Department of Computer Science, University of Texas, Dallas, United States.
    Guesgen, Hans W.
    Massey University, Palmerston North, New Zealand.
    Jannach, Dietmar
    Technical university Dortmund, Dortmund, Germany.
    Johanson, Michael
    University of Alberta, Edmonton, Canada.
    Kersting, Kristian
    Fraunhofer-Institut für Intelligente Analyse- und Informationssysteme (IAIS), Sankt Augustin, Germany; The University of Bonn, Bonn, Germany.
    Konidaris, George
    Massachusetts Institute of Technology (MIT), Cambridge MA, United States.
    Kotthoff, Lars
    INSIGHT Centre for Data Analytics, University College Cork, Ireland.
    Michalowski, Martin
    Adventium Labs, Minneapolis MN, United States.
    Natarajan, Sriraam
    Indiana University, Bloomington IN, United States.
    O’Sullivan, Barry
    INSIGHT Centre for Data Analytics, University College Cork, Ireland.
    Pickett, Marc
    Naval Research Laboratory, Washington DC, United States.
    Podobnik, Vedran
    Telecommunication Department of the Faculty of Electrical Engineering and Computing, University of Zagreb, Croatia.
    Poole, David
    Department of Computer Science, University of British Columbia, Vancouver, Canada.
    Shastri, Lokendra
    Infosys, , India.
    Shehu, Amarda
    George Mason University, Washington, United States.
    Sukthankar, Gita
    University of Central Florida, Orlando FL, United States.
    The AAAI-13 Conference Workshops2013In: The AI Magazine, ISSN 0738-4602, Vol. 34, no 4, p. 108-115Article in journal (Refereed)
    Abstract [en]

    The AAAI-13 Workshop Program, a part of the 27th AAAI Conference on Artificial Intelligence, was held Sunday and Monday, July 14-15, 2013, at the Hyatt Regency Bellevue Hotel in Bellevue, Washington, USA. The program included 12 workshops covering a wide range of topics in artificial intelligence, including Activity Context-Aware System Architectures (WS-13-05); Artificial Intelligence and Robotics Methods in Computational Biology (WS-13-06); Combining Constraint Solving with Mining and Learning (WS-13-07); Computer Poker and Imperfect Information (WS-13-08); Expanding the Boundaries of Health Informatics Using Artificial Intelligence (WS-13-09); Intelligent Robotic Systems (WS-13-10); Intelligent Techniques for Web Personalization and Recommendation (WS-13-11); Learning Rich Representations from Low-Level Sensors (WS-13-12); Plan, Activity,, and Intent Recognition (WS-13-13); Space, Time, and Ambient Intelligence (WS-13-14); Trading Agent Design and Analysis (WS-13-15); and Statistical Relational Artificial Intelligence (WS-13-16)

  • 225.
    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, p. 70-81Conference 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.

  • 226.
    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, p. 256-262Conference 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.

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

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

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

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

  • 231.
    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, p. 68-80Article 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.

  • 232.
    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, p. 47-54Conference 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.

  • 233. 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)
  • 234.
    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, p. 601-608Conference paper (Refereed)
  • 235.
    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)
  • 236.
    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, p. 149-161Conference paper (Refereed)
  • 237.
    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)
  • 238.
    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)
  • 239.
    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.

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

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

  • 242.
    Ahlberg, Ernst
    et al.
    Predictive Compound ADME & Safety, Drug Safety & Metabolism, AstraZeneca IMED Biotech Unit, Mölndal, Sweden.
    Winiwarter, Susanne
    Predictive Compound ADME & Safety, Drug Safety & Metabolism, AstraZeneca IMED Biotech Unit, Mölndal, Sweden.
    Boström, Henrik
    Department of Computer and Systems Sciences, Stockholm University, Sweden.
    Linusson, Henrik
    Department of Information Technology, University of Borås, Sweden.
    Löfström, Tuve
    Jönköping University, School of Engineering, JTH. Research area Computer Science and Informatics. Department of Information Technology, University of Borås, Sweden.
    Norinder, Ulf
    Swetox, Karolinska Institutet, Unit of Toxicology Sciences, Sweden.
    Johansson, Ulf
    Jönköping University, School of Engineering, JTH, Computer Science and Informatics. Jönköping University, School of Engineering, JTH. Research area Computer Science and Informatics. Department of Information Technology, University of Borås, Sweden.
    Engkvist, Ola
    External Sciences, Discovery Sciences, AstraZeneca IMED Biotech Unit, Mölndal, Sweden.
    Hammar, Oscar
    Quantitative Biology, Discovery Sciences, AstraZeneca IMED Biotech Unit, Mölndal, Sweden.
    Bendtsen, Claus
    Quantitative Biology, Discovery Sciences, AstraZeneca IMED Biotech Unit, Cambridge, UK.
    Carlsson, Lars
    Quantitative Biology, Discovery Sciences, AstraZeneca IMED Biotech Unit, Mölndal, Sweden.
    Using conformal prediction to prioritize compound synthesis in drug discovery2017In: Proceedings of Machine Learning Research: Volume 60: Conformal and Probabilistic Prediction and Applications, 13-16 June 2017, Stockholm, Sweden / [ed] Alex Gammerman, Vladimir Vovk, Zhiyuan Luo, and Harris Papadopoulos, 2017, p. 174-184Conference paper (Refereed)
    Abstract [en]

    The choice of how much money and resources to spend to understand certain problems is of high interest in many areas. This work illustrates how computational models can be more tightly coupled with experiments to generate decision data at lower cost without reducing the quality of the decision. Several different strategies are explored to illustrate the trade off between lowering costs and quality in decisions.

    AUC is used as a performance metric and the number of objects that can be learnt from is constrained. Some of the strategies described reach AUC values over 0.9 and outperforms strategies that are more random. The strategies that use conformal predictor p-values show varying results, although some are top performing.

    The application studied is taken from the drug discovery process. In the early stages of this process compounds, that potentially could become marketed drugs, are being routinely tested in experimental assays to understand the distribution and interactions in humans.

  • 243.
    Ahlberg, Ernst
    et al.
    Predictive Compound ADME & Safety, Drug Safety & Metabolism, AstraZeneca IMED Biotech Unit, Mölndal, Sweden.
    Winiwarter, Susanne
    Predictive Compound ADME & Safety, Drug Safety & Metabolism, AstraZeneca IMED Biotech Unit, Mölndal, Sweden.
    Boström, Henrik
    Department of Computer and Systems Sciences, Stockholm University, Sweden.
    Linusson, Henrik
    Department of Information Technology, University of Borås, Sweden.
    Löfström, Tuve
    Högskolan i Jönköping, JTH. Forskningsmiljö Datavetenskap och informatik.
    Norinder, Ulf
    Swetox, Karolinska Institutet, Unit of Toxicology Sciences, Sweden.
    Johansson, Ulf
    Högskolan i Jönköping, JTH, Datateknik och informatik.
    Engkvist, Ola
    External Sciences, Discovery Sciences, AstraZeneca IMED Biotech Unit, Mölndal, Sweden.
    Hammar, Oscar
    Quantitative Biology, Discovery Sciences, AstraZeneca IMED Biotech Unit, Mölndal, Sweden.
    Bendtsen, Claus
    Quantitative Biology, Discovery Sciences, AstraZeneca IMED Biotech Unit, Cambridge, UK.
    Carlsson, Lars
    Quantitative Biology, Discovery Sciences, AstraZeneca IMED Biotech Unit, Mölndal, Sweden.
    Using conformal prediction to prioritize compound synthesis in drug discovery2017In: Proceedings of Machine Learning Research: Volume 60: Conformal and Probabilistic Prediction and Applications, 13-16 June 2017, Stockholm, Sweden / [ed] Alex Gammerman, Vladimir Vovk, Zhiyuan Luo, and Harris Papadopoulos, 2017, p. 174-184Conference paper (Refereed)
    Abstract [en]

    The choice of how much money and resources to spend to understand certain problems is of high interest in many areas. This work illustrates how computational models can be more tightly coupled with experiments to generate decision data at lower cost without reducing the quality of the decision. Several different strategies are explored to illustrate the trade off between lowering costs and quality in decisions.

    AUC is used as a performance metric and the number of objects that can be learnt from is constrained. Some of the strategies described reach AUC values over 0.9 and outperforms strategies that are more random. The strategies that use conformal predictor p-values show varying results, although some are top performing.

    The application studied is taken from the drug discovery process. In the early stages of this process compounds, that potentially could become marketed drugs, are being routinely tested in experimental assays to understand the distribution and interactions in humans.

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

  • 245.
    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, p. 498-501Conference 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.

  • 246. 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, p. 93-98Conference paper (Refereed)
  • 247.
    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.

  • 248. 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, p. 52-56, article id 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.

  • 249.
    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, p. 52-56Article 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.

  • 250.
    Ahlgren, Bengt
    et al.
    RISE, Swedish ICT, SICS, Decisions, Networks and Analytics lab.
    Hurtig, Per
    Abrahamsson, Henrik
    RISE, Swedish ICT, SICS, Decisions, Networks and Analytics lab.
    Grinnemo, Karl-Johan
    Brunstrom, Anna
    Are MIRCC and Rate-based Congestion Control in ICN READY for Variable Link Capacity?2017Conference paper (Refereed)
    Abstract [en]

    Information-centric networking~(ICN) has been introduced as a potential future networking architecture. ICN promises an architecture that makes information independent from location, application, storage, and transportation. Still, it is not without challenges. Notably, there are several outstanding issues regarding congestion control: Since ICN is more or less oblivious to the location of information, it opens up for a single application flow to have several sources, something which blurs the notion of transport flows, and makes it very difficult to employ traditional end-to-end congestion control schemes in these networks. Instead, ICN networks often make use of hop-by-hop congestion control schemes. However, these schemes are also tainted with problems, e.g., several of the proposed ICN congestion controls assume fixed link capacities that are known beforehand. Since this seldom is the case, this paper evaluates the consequences in terms of latency, throughput, and link usage, variable link capacities have on a hop-by-hop congestion control scheme, such as the one employed by the Multipath-aware ICN Rate-based Congestion Control~(MIRCC). The evaluation was carried out in the OMNeT++ simulator, and demonstrates how seemingly small variations in link capacity significantly deteriorate both latency and throughput, and often result in inefficient network link usage.

2345678 201 - 250 of 18220
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