Change search
Refine search result
1234567 1 - 50 of 18688
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.
  • 1.
    Aalto, Erik
    KTH, School of Computer Science and Communication (CSC).
    Learning Playlist Representations for Automatic Playlist Generation2015Independent thesis Advanced level (degree of Master (Two Years)), 20 credits / 30 HE creditsStudent thesis
    Abstract [en]

    Spotify is currently the worlds leading music streaming ser-vice. As the leader in music streaming the task of providing listeners with music recommendations is vital for Spotify. Listening to playlists is a popular way of consuming music, but traditional recommender systems tend to fo-cus on suggesting songs, albums or artists rather than pro-viding consumers with playlists generated for their needs.

    This thesis presents a scalable and generalizeable approach to music recommendation that performs song selection for the problem of playlist generation. The approach selects tracks related to a playlist theme by finding the charac-terizing variance for a seed playlist and projects candidate songs into the corresponding subspace. Quantitative re-sults shows that the model outperforms a baseline which is taking the full variance into account. By qualitative results the model is also shown to outperform professionally curated playlists in some cases.

  • 2.
    Aarno, Daniel
    KTH, School of Computer Science and Communication (CSC), Numerical Analysis and Computer Science, NADA.
    Intention recognition in human machine collaborative systems2007Licentiate thesis, monograph (Other scientific)
    Abstract [en]

    Robot systems have been used extensively during the last decades to provide automation solutions in a number of areas. The majority of the currently deployed automation systems are limited in that the tasks they can solve are required to be repetitive and predicable. One reason for this is the inability of today’s robot systems to understand and reason about the world. Therefore the robotics and artificial intelligence research communities have made significant research efforts to produce more intelligent machines. Although significant progress has been made towards achieving robots that can interact in a human environment there is currently no system that comes close to achieving the reasoning capabilities of humans.

    In order to reduce the complexity of the problem some researchers have proposed an alternative to creating fully autonomous robots capable of operating in human environments. The proposed alternative is to allow fusion of human and machine capabilities. For example, using teleoperation a human can operate at a remote site, which may not be accessible for the operator for a number of reasons, by issuing commands to a remote agent that will act as an extension of the operator’s body.

    Segmentation and recognition of operator generated motions can be used to provide appropriate assistance during task execution in teleoperative and human-machine collaborative settings. The assistance is usually provided in a virtual fixture framework where the level of compliance can be altered online in order to improve the performance in terms of execution time and overall precision. Acquiring, representing and modeling human skills are key research areas in teleoperation, programming-by-demonstration and human-machine collaborative settings. One of the common approaches is to divide the task that the operator is executing into several sub-tasks in order to provide manageable modeling.

    This thesis is focused on two aspects of human-machine collaborative systems. Classfication of an operator’s motion into a predefined state of a manipulation task and assistance during a manipulation task based on virtual fixtures. The particular applications considered consists of manipulation tasks where a human operator controls a robotic manipulator in a cooperative or teleoperative mode.

    A method for online task tracking using adaptive virtual fixtures is presented. Rather than executing a predefined plan, the operator has the ability to avoid unforeseen obstacles and deviate from the model. To allow this, the probability of following a certain trajectory sub-task) is estimated and used to automatically adjusts the compliance of a virtual fixture, thus providing an online decision of how to fixture the movement.

    A layered hidden Markov model is used to model human skills. A gestem classifier that classifies the operator’s motions into basic action-primitives, or gestemes, is evaluated. The gestem classifiers are then used in a layered hidden Markov model to model a simulated teleoperated task. The classification performance is evaluated with respect to noise, number of gestemes, type of the hidden Markov model and the available number of training sequences. The layered hidden Markov model is applied to data recorded during the execution of a trajectory-tracking task in 2D and 3D with a robotic manipulator in order to give qualitative as well as quantitative results for the proposed approach. The results indicate that the layered hidden Markov model is suitable for modeling teleoperative trajectory-tracking tasks and that the layered hidden Markov model is robust with respect to misclassifications in the underlying gestem classifiers.

  • 3.
    Aarno, Daniel
    et al.
    KTH, School of Computer Science and Communication (CSC), Computer Vision and Active Perception, CVAP. KTH, School of Computer Science and Communication (CSC), Centres, Centre for Autonomous Systems, CAS.
    Sommerfeld, Johan
    KTH, School of Computer Science and Communication (CSC), Computer Vision and Active Perception, CVAP. KTH, School of Computer Science and Communication (CSC), Centres, Centre for Autonomous Systems, CAS.
    Kragic, Danica
    KTH, School of Computer Science and Communication (CSC), Computer Vision and Active Perception, CVAP. KTH, School of Computer Science and Communication (CSC), Centres, Centre for Autonomous Systems, CAS.
    Pugeault, Nicolas
    Kalkan, Sinan
    Woergoetter, Florentin
    Krüger, Norbert
    Early reactive grasping with second order 3D feature relations2008In: Recent Progress In Robotics: Viable Robotic Service To Human / [ed] Lee, S; Suh, IH; Kim, MS, 2008, Vol. 370, p. 91-105Conference paper (Refereed)
    Abstract [en]

    One of the main challenges in the field of robotics is to make robots ubiquitous. To intelligently interact with the world, such robots need to understand the environment and situations around them and react appropriately, they need context-awareness. But how to equip robots with capabilities of gathering and interpreting the necessary information for novel tasks through interaction with the environment and by providing some minimal knowledge in advance? This has been a longterm question and one of the main drives in the field of cognitive system development. The main idea behind the work presented in this paper is that the robot should, like a human infant, learn about objects by interacting with them, forming representations of the objects and their categories that are grounded in its embodiment. For this purpose, we study an early learning of object grasping process where the agent, based on a set of innate reflexes and knowledge about its embodiment. We stress out that this is not the work on grasping, it is a system that interacts with the environment based on relations of 3D visual features generated trough a stereo vision system. We show how geometry, appearance and spatial relations between the features can guide early reactive grasping which can later on be used in a more purposive manner when interacting with the environment.

  • 4. Aarts, Fides
    et al.
    Jonsson, Bengt
    Uppsala University, Disciplinary Domain of Science and Technology, Mathematics and Computer Science, Department of Information Technology, Computer Systems.
    Uijen, Johan
    Generating Models of Infinite-State Communication Protocols Using Regular Inference with Abstraction2010In: Testing Software and Systems: ICTSS 2010, Berlin: Springer-Verlag , 2010, p. 188-204Conference paper (Refereed)
  • 5.
    Aarts, Marcel
    Mälardalen University, School of Innovation, Design and Engineering.
    Using Kinect to interact with presentation software2013Independent thesis Basic level (university diploma), 10 credits / 15 HE creditsStudent thesis
    Abstract [en]

    Imagination Studios is a company specialized in motion capturing and animation. Part of their daily business is working at trade shows where they have a booth to keep close contact with existing customers and also to find new ones. However, usually only two to three people will be working at the booth, and frequently, these people will be in meetings with potential customers. During a time like this, nobody is free to attend to other people checking out the booth. This can result in a potential loss of a new customer. This project seeks a way to alleviate that problem.The idea behind this project was to create an application that trade show visitors can interact with in a playful and innovative way while also giving them a feel of what Imagination Studios is all about while looking for information about the company. To do this it was decided to let users interact with the system by using a Microsoft Kinect. The Kinect allows for easy implementation of a user interface based on motion capturing while also being very cost effective. A new user interface was to be designed as well, without copying already existing solutions and without simply expanding a traditional UI with new elements. To achieve this several design sketches were made, and the most interesting ones were then turned into storyboards. These were then used to decide on the final design, which was then elaborated on by use of video sketches and a collage in Adobe Photoshop.Several tools were used during the actual implementation. For the actual visualization and graphical design, the Unreal Engine 3 in combination with UDK was decided upon. To connect Kinect and Unreal Engine 3, a third party addon called NIUI which makes use of the open source SDK OpenNI was used. For ease of debugging and programming in Unrealscript, the programming language used by the Unreal Engine 3, an addon for Microsoft Visual Studio 2010 called nFringe (Pixel Mine, Inc., 2010) was used.

  • 6. Aartsen, M. G.
    et al.
    Abbasi, R.
    Ackermann, M.
    Adams, J.
    Aguilar, J. A.
    Ahlers, M.
    Altmann, D.
    Arguelles, C.
    Auffenberg, J.
    Bai, X.
    Baker, M.
    Barwick, S. W.
    Baum, V.
    Bay, R.
    Beatty, J. J.
    Tjus, J. Becker
    Becker, K. -H
    BenZvi, S.
    Berghaus, P.
    Berley, D.
    Bernardini, E.
    Bernhard, A.
    Besson, D. Z.
    Binder, G.
    Bindig, D.
    Bissok, M.
    Blaufuss, E.
    Blumenthal, J.
    Boersma, David J.
    Uppsala University, Disciplinary Domain of Science and Technology, Physics, Department of Physics and Astronomy, High Energy Physics.
    Bohm, C.
    Bose, D.
    Boeser, S.
    Botner, Olga
    Uppsala University, Disciplinary Domain of Science and Technology, Physics, Department of Physics and Astronomy, High Energy Physics.
    Brayeur, L.
    Bretz, H. -P
    Brown, A. M.
    Bruijn, R.
    Casey, J.
    Casier, M.
    Chirkin, D.
    Christov, A.
    Christy, B.
    Clark, K.
    Classen, L.
    Clevermann, F.
    Coenders, S.
    Cohen, S.
    Cowen, D. F.
    Silva, A. H. Cruz
    Danninger, M.
    Daughhetee, J.
    Davis, J. C.
    Day, M.
    De Clercq, C.
    De Ridder, S.
    Desiati, P.
    de Vries, K. D.
    de With, M.
    DeYoung, T.
    Diaz-Velez, J. C.
    Dunkman, M.
    Eagan, R.
    Eberhardt, B.
    Eichmann, B.
    Eisch, J.
    Euler, S.
    Evenson, P. A.
    Fadiran, O.
    Fazely, A. R.
    Fedynitch, A.
    Feintzeig, J.
    Feusels, T.
    Filimonov, K.
    Finley, C.
    Fischer-Wasels, T.
    Flis, S.
    Franckowiak, A.
    Frantzen, K.
    Fuchs, T.
    Gaisser, T. K.
    Gallagher, J.
    Gerhardt, L.
    Gladstone, L.
    Glusenkamp, T.
    Goldschmidt, A.
    Golup, G.
    Gonzalez, J. G.
    Goodman, J. A.
    Gora, D.
    Grandmont, D. T.
    Grant, D.
    Gretskov, P.
    Groh, J. C.
    Gross, A.
    Ha, C.
    Ismail, A. Haj
    Hallen, P.
    Hallgren, Allan
    Uppsala University, Disciplinary Domain of Science and Technology, Physics, Department of Physics and Astronomy, High Energy Physics.
    Halzen, F.
    Hanson, K.
    Hebecker, D.
    Heereman, D.
    Heinen, D.
    Helbing, K.
    Hellauer, R.
    Hickford, S.
    Hill, G. C.
    Hoffman, K. D.
    Hoffmann, R.
    Homeier, A.
    Hoshina, K.
    Huang, F.
    Huelsnitz, W.
    Hulth, P. O.
    Hultqvist, K.
    Hussain, S.
    Ishihara, A.
    Jacobi, E.
    Jacobsen, J.
    Jagielski, K.
    Japaridze, G. S.
    Jero, K.
    Jlelati, O.
    Kaminsky, B.
    Kappes, A.
    Karg, T.
    Karle, A.
    Kauer, M.
    Kelley, J. L.
    Kiryluk, J.
    Klaes, J.
    Klein, S. R.
    Koehne, J. -H
    Kohnen, G.
    Kolanoski, H.
    Koepke, L.
    Kopper, C.
    Kopper, S.
    Koskinen, D. J.
    Kowalski, M.
    Krasberg, M.
    Kriesten, A.
    Krings, K.
    Kroll, G.
    Kunnen, J.
    Kurahashi, N.
    Kuwabara, T.
    Labare, M.
    Landsman, H.
    Larson, M. J.
    Lesiak-Bzdak, M.
    Leuermann, M.
    Leute, J.
    Luenemann, J.
    Macias, O.
    Madsen, J.
    Maggi, G.
    Maruyama, R.
    Mase, K.
    Matis, H. S.
    McNally, F.
    Meagher, K.
    Merck, M.
    Merino, G.
    Meures, T.
    Miarecki, S.
    Middell, E.
    Milke, N.
    Miller, J.
    Mohrmann, L.
    Montaruli, T.
    Morse, R.
    Nahnhauer, R.
    Naumann, U.
    Niederhausen, H.
    Nowicki, S. C.
    Nygren, D. R.
    Obertacke, A.
    Odrowski, S.
    Olivas, A.
    Omairat, A.
    O'Murchadha, A.
    Paul, L.
    Pepper, J. A.
    de los Heros, Carlos Perez
    Uppsala University, Disciplinary Domain of Science and Technology, Physics, Department of Physics and Astronomy, High Energy Physics.
    Pfendner, C.
    Pieloth, D.
    Pinat, E.
    Posselt, J.
    Price, P. B.
    Przybylski, G. T.
    Quinnan, M.
    Raedel, L.
    Rae, I.
    Rameez, M.
    Rawlins, K.
    Redl, P.
    Reimann, R.
    Resconi, E.
    Rhode, W.
    Ribordy, M.
    Richman, M.
    Riedel, B.
    Rodrigues, J. P.
    Rott, C.
    Ruhe, T.
    Ruzybayev, B.
    Ryckbosch, D.
    Saba, S. M.
    Sander, H. -G
    Santander, M.
    Sarkar, S.
    Schatto, K.
    Scheriau, F.
    Schmidt, T.
    Schmitz, M.
    Schoenen, S.
    Schoeneberg, S.
    Schoenwald, A.
    Schukraft, A.
    Schulte, L.
    Schultz, D.
    Schulz, O.
    Secke, D.
    Sestayo, Y.
    Seunarine, S.
    Shanidze, R.
    Sheremata, C.
    Smith, M. W. E.
    Soldin, D.
    Spiczak, G. M.
    Spiering, C.
    Stamatikos, M.
    Stanev, T.
    Stanisha, N. A.
    Stasik, A.
    Stezelberger, T.
    Stokstad, R. G.
    Stoessl, A.
    Strahler, E. A.
    Ström, Rickard
    Uppsala University, Disciplinary Domain of Science and Technology, Physics, Department of Physics and Astronomy, High Energy Physics.
    Strotjohann, N. L.
    Sullivan, G. W.
    Taavola, Henric
    Uppsala University, Disciplinary Domain of Science and Technology, Physics, Department of Physics and Astronomy, High Energy Physics.
    Taboada, I.
    Tamburro, A.
    Tepe, A.
    Ter-Antonyan, S.
    Tesic, G.
    Tilav, S.
    Toale, P. A.
    Tobin, M. N.
    Toscano, S.
    Tselengidou, M.
    Unger, E.
    Usner, M.
    Vallecorsa, S.
    van Eijndhoven, N.
    van Overloop, A.
    van Santen, J.
    Vehring, M.
    Voge, M.
    Vraeghe, M.
    Walck, C.
    Waldenmaier, T.
    Wallraff, M.
    Weaver, Ch.
    Wellons, M.
    Wendt, C.
    Westerhoff, S.
    Whitehorn, N.
    Wiebe, K.
    Wiebusch, C. H.
    Williams, D. R.
    Wissing, H.
    Wolf, M.
    Wood, T. R.
    Woschnagg, K.
    Xu, D. L.
    Xu, X. W.
    Yanez, J. P.
    Yodh, G.
    Yoshida, S.
    Zarzhitsky, P.
    Ziemann, J.
    Zierke, S.
    Zoll, M.
    The IceProd framework: Distributed data processing for the IceCube neutrino observatory2015In: Journal of Parallel and Distributed Computing, ISSN 0743-7315, E-ISSN 1096-0848, Vol. 75, p. 198-211Article in journal (Refereed)
    Abstract [en]

    IceCube is a one-gigaton instrument located at the geographic South Pole, designed to detect cosmic neutrinos, identify the particle nature of dark matter, and study high-energy neutrinos themselves. Simulation of the IceCube detector and processing of data require a significant amount of computational resources. This paper presents the first detailed description of IceProd, a lightweight distributed management system designed to meet these requirements. It is driven by a central database in order to manage mass production of simulations and analysis of data produced by the IceCube detector. IceProd runs as a separate layer on top of other middleware and can take advantage of a variety of computing resources, including grids and batch systems such as CREAM, HTCondor, and PBS. This is accomplished by a set of dedicated daemons that process job submission in a coordinated fashion through the use of middleware plugins that serve to abstract the details of job submission and job management from the framework. (C) 2014 Elsevier Inc. All rights reserved.

  • 7. Aasi, Parisa
    et al.
    Nunes, Ivan
    Rusu, Lazar
    Hodosi, Georg
    Does Organizational Culture Matter in IT Outsourcing Relationships?2015In: 2015 48TH HAWAII INTERNATIONAL CONFERENCE ON SYSTEM SCIENCES (HICSS), IEEE Computer Society, 2015, p. 4691-4699Conference paper (Refereed)
    Abstract [en]

    IT Outsourcing (ITO) is used widely by Multinational Companies (MNCs) as a sourcing strategy today. ITO relationship between service buyer and provider then becomes a crucial issue in achieving expected objectives. This research sheds light on the influence of organizational culture (OC) of the buyer company on its ITO relationship with the provider. More specifically, the influence that OC can have on four significant dimensions of trust, cooperation, communication and commitment in ITO is studied through a qualitative analysis. IT managers of six MNCs were interviewed which exposed the connection between OC and ITO relationship factors. An open communication culture, speed of adaption to change, receiving innovative solutions, flat or hierarchical structures and responsibility degree appeared as the most visible differences between OCs of MNCs influencing ITO relationships. The results can be used for improving the ITO by considering the influence of OC to gain more benefits from outsourcing.

  • 8.
    ABBAS, FAHEEM
    Blekinge Institute of Technology, Faculty of Computing, Department of Computer Science and Engineering.
    Intelligent Container Stacking System at Seaport Container Terminal2016Independent thesis Advanced level (degree of Master (One Year)), 10 credits / 15 HE creditsStudent thesis
    Abstract [en]

    Context: The workload at seaport container terminal is increasing gradually. We need to improve the performance of terminal to fulfill the demand. The key section of the container terminal is container stacking yard which is an integral part of the seaside and the landside. So its performance has the effects on both sides. The main problem in this area is unproductive moves of containers. However, we need a well-planned stacking area in order to increase the performance of terminal and maximum utilization of existing resources.

    Objectives: In this work, we have analyzed the existing container stacking system at Helsingborg seaport container terminal, Sweden, investigated the already provided solutions of the problem and find the best optimization technique to get the best possible solution. After this, suggest the solution, test the proposed solution and analyzed the simulation based results with respect to the desired solution.

    Methods: To identify the problem, methods and proposed solutions of the given problem in the domain of container stacking yard management, a literature review has been conducted by using some e-resources/databases. A GA with best parametric values is used to get the best optimize solution. A discrete event simulation model for container stacking in the yard has been build and integrated with genetic algorithm. A proposed mathematical model to show the dependency of cost minimization on the number of containers’ moves.

    Results: The GA has been achieved the high fitness value versus generations for 150 containers to storage at best location in a block with 3 tier levels and to minimize the unproductive moves in the yard. A comparison between Genetic Algorithm and Tabu Search has been made to verify that the GA has performed better than other algorithm or not. A simulation model with GA has been used to get the simulation based results and to show the container handling by using resources like AGVs, yard crane and delivery trucks and container stacking and retrieval system in the yard. The container stacking cost is directly proportional to the number of moves has been shown by the mathematical model.

    Conclusions: We have identified the key factor (unproductive moves) that is the base of other key factors (time & cost) and has an effect on the performance of the stacking yard and overall the whole seaport terminal. We have focused on this drawback of stacking system and proposed a solution that makes this system more efficient. Through this, we can save time and cost both. A Genetic Algorithm is a best approach to solve the unproductive moves problem in container stacking system.

  • 9.
    Abbas, Gulfam
    et al.
    Blekinge Institute of Technology, School of Computing.
    Asif, Naveed
    Blekinge Institute of Technology, School of Computing.
    Performance Tradeoffs in Software Transactional Memory2010Independent thesis Advanced level (degree of Master (Two Years))Student thesis
    Abstract [en]

    Transactional memory (TM), a new programming paradigm, is one of the latest approaches to write programs for next generation multicore and multiprocessor systems. TM is an alternative to lock-based programming. It is a promising solution to a hefty and mounting problem that programmers are facing in developing programs for Chip Multi-Processor (CMP) architectures by simplifying synchronization to shared data structures in a way that is scalable and compos-able. Software Transactional Memory (STM) a full software approach of TM systems can be defined as non-blocking synchronization mechanism where sequential objects are automatically converted into concurrent objects. In this thesis, we present performance comparison of four different STM implementations – RSTM of V. J. Marathe, et al., TL2 of D. Dice, et al., TinySTM of P. Felber, et al. and SwissTM of A. Dragojevic, et al. It helps us in deep understanding of potential tradeoffs involved. It further helps us in assessing, what are the design choices and configuration parameters that may provide better ways to build better and efficient STMs. In particular, suitability of an STM is analyzed against another STM. A literature study is carried out to sort out STM implementations for experimentation. An experiment is performed to measure performance tradeoffs between these STM implementations. The empirical evaluations done as part of this thesis conclude that SwissTM has significantly higher throughput than state-of-the-art STM implementations, namely RSTM, TL2, and TinySTM, as it outperforms consistently well while measuring execution time and aborts per commit parameters on STAMP benchmarks. The results taken in transaction retry rate measurements show that the performance of TL2 is better than RSTM, TinySTM and SwissTM.

  • 10.
    Abbas, Haider
    KTH, School of Information and Communication Technology (ICT), Electronic Systems.
    Options-Based Security-Oriented Framework for Addressing Uncerainty Issues in IT Security2010Doctoral thesis, monograph (Other academic)
    Abstract [en]

    Continuous development and innovation in Information Technology introduces novel configuration methods, software development tools and hardware components. This steady state of flux is very desirable as it improves productivity and the overall quality of life in societies. However, the same phenomenon also gives rise to unseen threats, vulnerabilities and security concerns that are becoming more critical with the passage of time. As an implication, technological progress strongly impacts organizations’ existing information security methods, policies and techniques, making obsolete existing security measures and mandating reevaluation, which results in an uncertain IT infrastructure. In order to address these critical concerns, an options-based reasoning borrowed from corporate finance is proposed and adapted for evaluation of security architecture and decision- making to handle them at organizational level. Options theory has provided significant guidance for uncertainty management in several domains, such as Oil & Gas, government R&D and IT security investment projects. We have applied options valuation technique in a different context to formalize optimal solutions in uncertain situations for three specific and identified uncertainty issues in IT security. In the research process, we formulated an adaptation model for expressing options theory in terms useful for IT security which provided knowledge to formulate and propose a framework for addressing uncertainty issues in information security. To validate the efficacy of this proposed framework, we have applied this approach to the SHS (Spridnings- och Hämtningssystem) and ESAM (E-Society) systems used in Sweden. As an ultimate objective of this research, we intend to develop a solution that is amenable to automation for the three main problem areas caused by technological uncertainty in information security: i) dynamically changing security requirements, ii) externalities caused by a security system, iii) obsoleteness of evaluation. The framework is general and capable of dealing with other uncertainty management issues and their solutions, but in this work we primarily deal with the three aforementioned uncertainty problems. The thesis presents an in-depth background and analysis study for a proposed options-based security-oriented framework with case studies for SHS and ESAM systems. It has also been assured that the framework formulation follows the guidelines from industry best practices criteria/metrics. We have also proposed how the whole process can be automated as the next step in development.

  • 11.
    Abbas, Haider
    KTH, School of Information and Communication Technology (ICT), Computer and Systems Sciences, DSV.
    Threats and Security Measures Involved in VoIP-Telephony2006Independent thesis Advanced level (degree of Master (One Year)), 30 credits / 45 HE creditsStudent thesis
  • 12.
    Abbas, Haider
    et al.
    KTH, School of Information and Communication Technology (ICT), Electronic, Computer and Software Systems, ECS.
    Sundkvist, Stefan
    KTH, School of Information and Communication Technology (ICT).
    Increasing the Performance of Crab Linux Router Simulation Package Using XEN2006In: IEEE International Conference on Industrial and Information Systems, Kandy, Sri Lanka, 2006, p. 459-462Conference paper (Refereed)
    Abstract [en]

    Nowadays hardware components are very expensive, especially if the prime purpose is to perform some routing related lab exercises. Physically connected network resources are required to get the desired results. Configuration of network resources in a lab exercise consumes much time of the students and scientists. The router simulation package Crab(1), based on KnoppW, Quagga' and User Mode Linux (UML) is designed for the students to facilitate them in performing lab exercises on a standalone computer where no real network equipment is needed. In addition to that it provides the facility of connection with the real network equipments. Crab also handles the pre configuration of different parts of the simulated networks like automatic IT addressing etc. This paper will describe the performance enhancing of Crab by replacing User Mode Linux virtual machine with XEN capable of providing ten virtual sessions concurrently using a standalone computer.

  • 13.
    Abbas, Haider
    et al.
    KTH, School of Information and Communication Technology (ICT), Electronic Systems.
    Yngström, Louise
    Hemani, Ahmed
    KTH, School of Information and Communication Technology (ICT), Electronic Systems.
    Empowering Security Evaluation of IT Products with Options Theory2009In: 30th IEEE Symposium on Security & Privacy, Oakland, USA, 2009Conference paper (Refereed)
  • 14.
    Abbas, Nadeem
    Linnaeus University, Faculty of Technology, Department of computer science and media technology (CM).
    Designing Self-Adaptive Software Systems with Reuse2018Doctoral thesis, comprehensive summary (Other academic)