Ändra sökning
Avgränsa sökresultatet
927928929930931932933 46451 - 46500 av 47882
RefereraExporteraLänk till träfflistan
Permanent länk
Referera
Referensformat
  • apa
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Annat format
Fler format
Språk
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Annat språk
Fler språk
Utmatningsformat
  • html
  • text
  • asciidoc
  • rtf
Träffar per sida
  • 5
  • 10
  • 20
  • 50
  • 100
  • 250
Sortering
  • Standard (Relevans)
  • Författare A-Ö
  • Författare Ö-A
  • Titel A-Ö
  • Titel Ö-A
  • Publikationstyp A-Ö
  • Publikationstyp Ö-A
  • Äldst först
  • Nyast först
  • Skapad (Äldst först)
  • Skapad (Nyast först)
  • Senast uppdaterad (Äldst först)
  • Senast uppdaterad (Nyast först)
  • Standard (Relevans)
  • Författare A-Ö
  • Författare Ö-A
  • Titel A-Ö
  • Titel Ö-A
  • Publikationstyp A-Ö
  • Publikationstyp Ö-A
  • Äldst först
  • Nyast först
  • Skapad (Äldst först)
  • Skapad (Nyast först)
  • Senast uppdaterad (Äldst först)
  • Senast uppdaterad (Nyast först)
Markera
Maxantalet träffar du kan exportera från sökgränssnittet är 250. Vid större uttag använd dig av utsökningar.
  • 46451. Yi, Choong-ho
    et al.
    Johannesson, C.
    Beyond Goal Representation: Checking Goal-Satisfaction by Temporal Reasoning with Business Processes1999Konferensbidrag (Refereegranskat)
  • 46452.
    Yi, Lirong
    Mittuniversitetet, Fakulteten för naturvetenskap, teknik och medier, Avdelningen för informationssystem och -teknologi.
    Evaluation and Implementation of a Secure Zero Configuration IoT System2017Självständigt arbete på grundnivå (kandidatexamen), 10 poäng / 15 hpStudentuppsats (Examensarbete)
    Abstract [en]

    The Internet of Things (IoT) comprises a large number of heterogeneous devices. It is forecasted that up to 50 billion devices will be connected to the Internet by 2020. All of them have to be configured. Due to the heterogeneity of devices and the enormous increasing number of devices, manual configuration becomes more and more complex and inefficient. Zero configuration is put forward to solve this problem, which makes device configured automatically without additional manual involvement. Besides that, there are many security threats we want to avoid in the future. These security problems include unauthenticated nodes accessing to IoT data, denial of service, lack of confidentiality, malicious attack from hackers and so on. This paper studies the characteristics of IoT firstly and then highlights the implementation of zero configuration and security to IoT. This paper describes the underlying features of zero configuration and primary requirements of security, as well as finds some related mature technologies, based on that proposes a concise solution – combining the Bonjour and many security approaches for implementation of a secure zero IoT system. In addition, this solution is implemented in a small environment scenario of IoT, a smart home. All the programs are in Java language. Evaluation and conclusion are done in final phase.

  • 46453.
    Yi, Wang
    Uppsala universitet, Teknisk-naturvetenskapliga vetenskapsområdet, Matematisk-datavetenskapliga sektionen, Institutionen för informationsteknologi, Datorteknik.
    Multicore embedded systems: The timing problem and possible solutions2010Ingår i: Formal Methods and Software Engineering, Berlin: Springer-Verlag , 2010, 22-23 s.Konferensbidrag (Refereegranskat)
  • 46454.
    Yichong, Zhou
    et al.
    Högskolan i Halmstad, Sektionen för Informationsvetenskap, Data– och Elektroteknik (IDE).
    Chenxi, Zhang
    Högskolan i Halmstad, Sektionen för Informationsvetenskap, Data– och Elektroteknik (IDE).
    A database design for IDE2014Självständigt arbete på grundnivå (kandidatexamen), 10 poäng / 15 hpStudentuppsats (Examensarbete)
    Abstract [en]

    The thesis is the culmination of an academic degree and an important steppingstone for the student on the way to employment. Academic and industrial institutionsrely on thesis students to explore research directions that may otherwise beoverlooked. Consequently, an efficient process for connecting students withsupervisors and relevant, viable thesis proposals is crucial for students, for academiaas well as for the industry. A database can serve as the basis of a software applicationto facilitate such a process. Support for tackling concerns such as data persistence,redundancy and security, which are challenges in most application designs, is built into common database systems. In this work, we investigate how a database system canbe leveraged as the foundation for an application that connects students with thesisproposals and supervisors.

  • 46455. Yilmaz, Natalie
    et al.
    Stirna, Janis
    Stockholms universitet, Samhällsvetenskapliga fakulteten, Institutionen för data- och systemvetenskap.
    Factors Influencing Productization of Enterprise Modeling: A Qualitative Inquiry into the Scandinavian Strand of Methods and Tools2015Ingår i: The Practice of Enterprise Modeling, 8th IFIP WG 8.1. Working Conference, PoEM 2015, Valencia, Spain, November 10–12, 2015, Springer , 2015Konferensbidrag (Refereegranskat)
    Abstract [en]

    Enterprise Modeling (EM) methods and tools have been developed and successfully used for more than two decades yet their adoption in organizations is mostly ad hoc. Only a few EM methods and tools have become successful products despite being theoretically sound and having certain success in application in practice. This grounded theory inquiry ponders on what factors influence the successful productization of EM methods and tools. Among the factors discussed are EM maturity gap, method and tool development process, application context, marketing and sales aspects, as well as product aspects.

  • 46456.
    Yilmaz, Oya
    KTH, Skolan för informations- och kommunikationsteknik (ICT), Kommunikationssystem, CoS.
    Access Selection in Multi-Access Cellular and WLAN Networks2005Självständigt arbete på avancerad nivå (masterexamen), 20 poäng / 30 hpStudentuppsats (Examensarbete)
    Abstract [en]

    To meet the requirements of future data-rich applications and terminals with improved multimedia,  future wireless networks are expected to combine multiple access technologies.  When several radio access technologies are available, the assignment and the handover of  users among these technologies become fundamental problems. The solutions have a major  impact on the system performance as well as on the architecture of future networks. This  thesis focuses on access selection criteria in combined wide area coverage cellular and local  area coverage Wireless LAN networks. More specifically, involvement of traffic load information  on top of signal quality information during selection process is studied. A rough  but wide-ranging theory for what gains may be expected in different scenarios is first derived  through qualitative reasoning. Then, to verify the theory, a number of different signal  quality based and both signal quality and load based access selection algorithms are evaluated  in terms of achievable bitrate characteristics and system capacity via simulations. The  algorithms are compared for a set of different user behavior scenarios. Results indicate that  in scenarios with high traffic load concentrated to the hotspots or cellular access technologies  offering bitrates in the same order as WLANs, principles taking signal quality and traffic  load into account can provide gains around 20% both in capacity and in achievable bitrates.  In scenarios with more evenly distributed traffic or WLAN bitrates exceeding those of  cellular, smaller gains are achieved,

  • 46457.
    Yim, Man Yi
    et al.
    University of Hong Kong, Hong Kong.
    Kumar, Arvind
    Bernstein Center Freiburg, University of Freiburg, Germany .
    Aertsen, Ad
    Rotter, Stefan
    Impact of correlated inputs to neurons: modeling observations from in vivo intracellular recordings2014Ingår i: Journal of Computational Neuroscience, ISSN 0929-5313, E-ISSN 1573-6873, Vol. 37, nr 2, 293-304 s.Artikel i tidskrift (Refereegranskat)
    Abstract [en]

    In vivo recordings in rat somatosensory cortex suggest that excitatory and inhibitory inputs are often correlated during spontaneous and sensory-evoked activity. Using a computational approach, we study how the interplay of input correlations and timing observed in experiments controls the spiking probability of single neurons. Several correlation-based mechanisms are identified, which can effectively switch a neuron on and off. In addition, we investigate the transfer of input correlation to output correlation in pairs of neurons, at the spike train and the membrane potential levels, by considering spike-driving and non-spike-driving inputs separately. In particular, we propose a plausible explanation for the in vivo finding that membrane potentials in neighboring neurons are correlated, but the spike-triggered averages of membrane potentials preceding a spike are not: Neighboring neurons possibly receive an ongoing bombardment of correlated subthreshold background inputs, and occasionally uncorrelated spike-driving inputs.

  • 46458.
    Yin, Chengjiu
    et al.
    Kyushu University, Japan.
    Hirokawa, Sachio
    Kyushu University, Japan.
    Yau, Jane
    Department of Computer Science, Malmö University.
    Hashimoto, Kiyota
    Osaka Prefecture University, Japan.
    Tabata, Yoshiyuki
    Nakatoh, Tetsuya
    Research Trends with Cross Tabulation Search Engine2013Ingår i: International Journal of Distance Education Technologies, ISSN 1539-3100, E-ISSN 1539-3119, Vol. 11, nr 1, 31-44 s.Artikel i tidskrift (Refereegranskat)
    Abstract [en]

    To help researchers in building a knowledge foundation of their research fields which could be a time-consuming process, the authors have developed a Cross Tabulation Search Engine (CTSE). Its purpose is to assist researchers in 1) conducting research surveys, 2) efficiently and effectively retrieving information (such as important researchers, research groups, keywords), and also 3) providing analytical information relating to past and current research trends in a particular field. Their CTSE system employs data-processing technologies and emphasizes the use of a “Learn by Searching” learning strategy to support students to analyze such research trends. To show the effectiveness of CTSE, a pilot experiment has been conducted, where participants were assigned to do research survey tasks and then answer a questionnaire regarding the effectiveness and usability of the system. The results showed that the system has been helpful to students in conducting research surveys, and the research trend transitions that our system presented were effective for producing research trend surveys. Moreover, the results showed that most students had favorable attitudes toward the usage and usability of the system, and those students were satisfied in gaining more know ledge in a particular research field in a short period.

  • 46459. Yin, D.
    et al.
    Chen, B.
    Huang, Z.
    Lin, Xin
    KTH, Skolan för arkitektur och samhällsbyggnad (ABE), Samhällsplanering och miljö, Geoinformatik (stängd 20110301). Peking University,China.
    Fang, Y.
    Utility based query dissemination in spatial data grid2007Ingår i: Proceedings of the 6th International Conference on Grid and Cooperative Computing, GCC 2007, IEEE Computer Society, 2007, 574-581 s.Konferensbidrag (Refereegranskat)
    Abstract [en]

    Spatial Information Grid is an ideal infrastructure to handle the data-intensive and computing-intensive geo-spatial processing. In order that each agency could ad hoc connect to this computing environment and make autonomous decision, we build a Geospatial Data Grid in peer-to-peer way. The query processor module in each peer can decompose the user's query into sub-queries that executed in different nodes. One problem in the parallel spatial join query optimization is how to determine an appropriate node group to disseminate the sub-queries. Especially, if there is more than one node sharing the same area of interest, there is a dilemma: on the one hand, the task scheduler tends to decompose this query into sub-queries and disseminate them to as many as possible nodes so that they could process the user's query in parallel; on the other hand, recruiting too many nodes will also bring in overhead in repetitive computing, redundant data transmission, and the result merging. Based on the study of trade-off between increasing parallelism and reducing redundancy using the Utility Theory in economics, we put forward a fast node selection algorithm for the parallel spatial join query dissemination. The test in our system shows this strategy could balance the above two conflict demands and is appropriate for use in Data Grid.

  • 46460.
    Yin, Hang
    Mälardalens högskola, Akademin för innovation, design och teknik, Inbyggda system.
    Introducing Mode Switch in Component-Based Software Development2015Doktorsavhandling, monografi (Övrigt vetenskapligt)
    Abstract [en]

    Self-adaptivity, characterized by the ability to dynamically adjust behavior at runtime, is a growing trend in the evolution of modern embedded systems. While self-adaptive systems tend to be flexible and autonomous, self-adaptivity may inevitably complicate software design, test and analysis. A strategy for taming the growing software complexity of self-adaptive systems is to partition system behaviors into different operational modes specified at design time. Such a multi-mode system can change behavior by switching between modes at runtime under certain circumstances. Multi-mode systems can benefit from a complementary approach to the software development of complex systems: Component-Based Software Engineering (CBSE), which fosters reuse of independently developed software components. However, the state-of-the-art component-based development of multi-mode systems does not take full advantage of CBSE, as reuse of modes at component level is barely addressed. Modes are often treated as system properties, while mode switches are handled by a global mode manager. This centralized mode management entails global information of all components, whereas the global information may be inaccessible in component-based systems. Another potential problem is that a single mode manager does not scale well, particularly at design time,  for a large number of components and modes.

     

    In this thesis we propose a distributed solution to the component-based development of multi-mode systems, aiming for a more efficient and scalable mode management. Our goal is to fully incorporate modes in software component reuse, supporting reuse of multi-mode components, i.e., components able to run in multiple modes. We have developed a generic framework, the Mode-Switch Logic (MSL), which not only supports reuse of multi-mode components but also provides runtime mechanisms for handling mode switch. MSL includes three fundamental elements: (1) a mode-aware component model with the formal specification of reusable multi-mode software components; (2) a mode mapping mechanism for the seamless composition of multi-mode components; and (3) a mode-switch runtime mechanism which is executed by each component in isolation from its functional execution and coordinates the mode switches of different components without the need of global mode information. The mode-switch runtime mechanism has been verified by model checking in conjunction with mathematical proofs. We also provide a mode-switch timing analysis for the runtime mechanism to respect real-time requirements.

     

    MSL is dedicated to the mode aspect of a system irrespective of component execution semantics, thus independent of the choice of component models. We have integrated MSL in the ProCom component model with the extension of support for reuse of multi-mode components and distributed mode-switch handling. Although the distributed mode-switch handling of MSL is more flexible and scalable than the conventional centralized approach, when components are deployed on a single hardware platform and global mode information is available, centralized mode-switch handling is more efficient in terms of runtime overhead and mode-switch time. Hence, MSL is supplemented with a mode transformation technique to enhance runtime mode-switch efficiency by converting the distributed mechanism to a centralized mechanism. MSL together with the mode transformation technique has been implemented in a prototype tool where one can build multi-mode systems by reusing multi-mode components. The applicability of MSL is demonstrated in two proof-of-concept case studies.

  • 46461.
    Yin, Hang
    Mälardalens högskola, Akademin för innovation, design och teknik.
    Mode switch for component-based multi-mode systems2012Licentiatavhandling, monografi (Övrigt vetenskapligt)
    Abstract [en]

    Component-based software engineering is becoming a prominent solution to the development of complex embedded systems. Since it allows a system to be built by reusable and independently developed components, component-based development substantially facilitates the development of a complex embedded system and allows its complexity to be better managed. Meanwhile, partitioning system behavior into multiple operational modes is also an effective approach to reducing system complexity. Combining the component-based approach with the multi-mode approach, we get a component-based multi-mode system, for which a key issue is its mode switch handling. The mode switch of such a system corresponds to the joint mode switches of many hierarchically organized components. Such a mode switch is not trivial as it amounts to coordinate the mode switches of different components that are independently developed.

    Since most existing approaches to mode switch handling assume that mode switch is a global event of the entire system, they cannot be easily applied to component-based multi-mode systems where both the mode switch of the system and each individual component must be considered, and where components cannot be assumed to have global knowledge of the system. In this thesis, we present a mechanism---the Mode Switch Logic (MSL)---which provides an effective solution to mode switch in component-based multi-mode systems. MSL enables a multi-mode system to be developed in a component-based manner, including (1) a mode-aware component model proposed to suit the multi-mode context; (2) a mode mapping mechanism for the seamless composition of multi-mode components and their mode switch guidance; (3) a mode switch runtime mechanism which coordinates the mode switches of all related components so that the mode switch can be correctly and efficiently performed at the system level; and (4) a timing analysis for mode switches realized by MSL. All the essential elements of MSL are additionally demonstrated by a case study.

  • 46462.
    Yin, Lihua
    et al.
    State Key Laboratory of Information Security, Institute of Information Engineering, Chinese Academy of Sciences, Beijing, .
    Guo, Yunchuan
    State Key Laboratory of Information Security, Institute of Information Engineering, Chinese Academy of Sciences, Beijing.
    Li, Fenghua
    State Key Laboratory of Information Security, Institute of Information Engineering, Chinese Academy of Sciences, Beijing.
    Sun, Yanwei
    State Key Laboratory of Information Security, Institute of Information Engineering, Chinese Academy of Sciences, Beijing .
    Qian, Junyan
    Guangxi Key Laboratory of Trusted Software, Guilin University of Electronic Technology, Guilin.
    Vasilakos, Athanasios
    Luleå tekniska universitet, Institutionen för system- och rymdteknik, Datavetenskap.
    A game-theoretic approach to advertisement dissemination in ephemeral networks2017Ingår i: World wide web (Bussum), ISSN 1386-145X, E-ISSN 1573-1413Artikel i tidskrift (Refereegranskat)
    Abstract [en]

    In ephemeral networks, disseminating advertisements faces two dilemmatic problems: on the one hand, disseminators own the limited resources and have privacy concerns, thus, often preferring to avoid disseminating advertisements without enough incentives; Even if advertisements are disseminated, their dissemination accuracy is lower. On the other hand, false advertisements may flood in ephemeral networks if too many incentives but no punishments are given. Thus, it is a challenge to design an effective scheme to guarantee rational disseminators have sufficient impetus to forward true advertisements to the interested consumers and report false advertisements, despite facing the limitation of resources and the risk of privacy leakage. To solve this problem, in this paper, a bargaining-based scheme is proposed to motive disseminators to forward the true advertisements to the interested node and a semi-grim policy is designed for punishing the disseminators who releases and disseminates false advertisements. Acknowledging the assumption of incomplete information, a repeated dissemination game is proposed to help disseminators to decide whether to forward advertisements or report false advertisements. Simulation results demonstrate that our scheme not only provides disseminators a strong impetus to disseminate the advertisements with higher dissemination accuracy, but also effectively prevents disseminators from forwarding false advertisements.

  • 46463.
    Yin, Zekun
    et al.
    Shandong University, Jinan.
    Lan, Haidong
    Shandong University, Jinan.
    Tan, Guanming
    Institute of Computing Technology, Chinese Academy of Sciences.
    Lu, Mian
    Huawei Singapore Research Centre.
    Vasilakos, Athanasios
    Luleå tekniska universitet, Institutionen för system- och rymdteknik, Datavetenskap.
    Liu, Weiguo
    Shandong University, Jinan.
    Computing Platforms for Big Biological Data Analytics: Perspectives and Challenges2017Ingår i: Computational and structural biotechnology journal, E-ISSN 2001-0370, Vol. 15, 403-411 s.Artikel i tidskrift (Refereegranskat)
    Abstract [en]

    The last decade has witnessed an explosion in the amount of available biological sequence data, due to the rapid progress of high-throughput sequencing projects. However, the biological data amount is becoming so great that traditional data analysis platforms and methods can no longer meet the need to rapidly perform data analysis tasks in life sciences. As a result, both biologists and computer scientists are facing the challenge of gaining a profound insight into the deepest biological functions from big biological data. This in turn requires massive computational resources. Therefore, high performance computing (HPC) platforms are highly needed as well as efficient and scalable algorithms that can take advantage of these platforms. In this paper, we survey the state-of-the-art HPC platforms for big biological data analytics. We first list the characteristics of big biological data and popular computing platforms. Then we provide a taxonomy of different biological data analysis applications and a survey of the way they have been mapped onto various computing platforms. After that, we present a case study to compare the efficiency of different computing platforms for handling the classical biological sequence alignment problem. At last we discuss the open issues in big biological data analytics.

  • 46464.
    Ying, PuLe
    et al.
    Blekinge Tekniska Högskola, Fakulteten för datavetenskaper, Institutionen för programvaruteknik.
    Fan, LingZhi
    Blekinge Tekniska Högskola, Fakulteten för datavetenskaper, Institutionen för programvaruteknik.
    Methods For Test Case Prioritization Based On Test Case Execution History2017Självständigt arbete på avancerad nivå (masterexamen), 20 poäng / 30 hpStudentuppsats (Examensarbete)
    Abstract [en]

    Motivation: Test case prioritization can prioritize test cases, optimize the test execution, save time and cost. There are many different methods for test case prioritization, test case prioritization method based on test case execution history is one kind of them. Based on the test case execution history, it’s easier to increase the rate of fault detection, hence we want to do a study about test case prioritization methods based on the test case execution history. Meanwhile, executing the feasible methods to compare the effectiveness of them. For the motivation of the thesis may be regarded as an example for experiencing approach for comparing test case prioritizations based on test case execution history, or as a study case for identifying the suitable methods to use and help improve the effectiveness of the testing process.

    Objectives: The aim of this thesis is to look for a suitable test case prioritization method that can support risk based testing, in which test case execution history is employed as the key criterion of evaluation. For this research, there are three main objectives. First, explore and summarize methods of test case prioritization based on test case history. Next, identify what are differences among the test case prioritization methods. Finally, execute the methods which we selected, and compare the effectiveness of methods.

    Methods: To achieve the first and the second study objectives, a systematic literature review has been conducted using Kitchenham guidelines. To achieve the third study objective, an experiment was conducted following Wohlin guidelines.

    Results: In our thesis: 1) We conducted a systematic literature review and selected 15 relevant literatures. We extracted data of the literatures and then we synthesized the data. We found that the methods have different kinds of inputs, test levels, maturity levels, validation and "automated testing or manual testing". 2) We selected two feasible methods from those 15 literatures, Method 1 is Adaptive test-case prioritization and Method 2 is Similarity-based test quality metric. We executed the methods within 17 test suites. Comparing the result of two methods and non-prioritization, the mean Average Percentage of Defects Found (APFD) of Adaptive test-case prioritization execution result (86.9%) is significantly higher than non-prioritization (51.5%) and Similarity-based test quality metric (47.5%), it means that the Adaptive test-case prioritization has higher effectiveness.

    Conclusion: In our thesis, existing test case prioritization methods based on test case execution history are extracted and listed out through systematic literature review. The summary of them and the description of differences can be available in the thesis. The 15 relevant literatures and the synthesized data may be as a guideline for relevant software researchers or testers. We did the statistical test for the experimental result, we can see two different test case prioritization methods have different effectiveness.

  • 46465.
    Yip, Eugene
    et al.
    University of Auckland.
    Kuo, Matthew M Y
    University of Auckland.
    Roop, Partha S
    University of Auckland.
    Broman, David
    University of California, Berkeley and Linköping University.
    Relaxing the Synchronous Approach for Mixed-Criticality Systems2014Ingår i: Proceedings of the 20th IEEE Real-Time and Embedded Technology and Application Symposium (RTAS), IEEE conference proceedings, 2014, 89-100 s.Konferensbidrag (Refereegranskat)
    Abstract [en]

    Synchronous languages are widely used to design safety-critical embedded systems. These languages are based on the synchrony hypothesis, asserting that all tasks must complete instantaneously at each logical time step. This assertion is, however, unsuitable for the design of mixed-criticality systems, where some tasks can tolerate missed deadlines. This paper proposes a novel extension to the synchronous approach for supporting three levels of task criticality: life, mission, and non-critical. We achieve this by relaxing the synchrony hypothesis to allow tasks that can tolerate bounded or unbounded deadline misses. We address the issue of task communication between multi-rate, mixed-criticality tasks, and propose a deterministic lossless communication model. To maximize system utilization, we present a hybrid static and dynamic scheduling approach that executes schedulable tasks during slack time. Extensive benchmarking shows that our approach can schedule up to 15% more task sets and achieve an average of 5.38% better system utilization than the Early-Release EDF (ER-EDF) approach. Tasks are scheduled fairer under our approach and achieve consistently higher execution frequencies, but require more preemptions.

  • 46466.
    Yip, Kitty
    Linnéuniversitetet, Fakultetsnämnden för naturvetenskap och teknik, Institutionen för datavetenskap, fysik och matematik, DFM.
    Exploring Barriers to Knowledge Sharing: A Case Study of a Virtual Community of Practice in a Swedish Multinational Corporation2011Självständigt arbete på grundnivå (kandidatexamen), 10 poäng / 15 hpStudentuppsats (Examensarbete)
    Abstract [en]

    This thesis reports on the results of a quantitative study of various barriers to knowledge sharing in a virtual community of practice within Sigma Kudos, a Swedish multinational organization. The study was undertaken to investigate the under-utilization of a virtual "teamroom". Members' views showed that the biggest barrier involved the way in which people chose to share their knowledge; the respondents preferred sharing knowledge in their existing face-to-face networks. Face-to-face sharing mainly seemed to occur between individuals who had a common ground and shared experiences, and between individuals who were in convenient proximity to each other. Time constraints in combination with perceived lack of intranet site structure implied a redundancy of the teamroom as yet another internal site. Another prominent set of barriers that emerged from the findings was related to aspects of uncertainty and unfamiliarity with the teamroom. Additionally, survey comments revealed the use of teamroom features to be a barrier. To enable co-evolved knowledge structures to occur via the community, it is necessary for management to understand face-to-face sharing behavior in terms of implicit and tacit knowledge. It is vital to change the perception of teamroom sharing as an extra task requiring more time. Moreover, the teamroom needs to be distinguished in context of the greater intranet structure, as well as when it comes to the different sections of the community itself. To foster knowledge sharing in the teamroom, it is also important to define and communicate the strategic meaning of it.

  • 46467.
    Yiran, Zhou
    et al.
    Blekinge Tekniska Högskola, Fakulteten för datavetenskaper, Institutionen för programvaruteknik.
    Yilei, Liu
    Blekinge Tekniska Högskola, Fakulteten för datavetenskaper, Institutionen för programvaruteknik.
    The Challenges and Mitigation Strategies of Using DevOps during Software Development2017Självständigt arbete på avancerad nivå (masterexamen), 20 poäng / 30 hpStudentuppsats (Examensarbete)
  • 46468.
    Yli-Luoma, Petti
    et al.
    University of Oulu, Finland.
    Naeve, Ambjörn
    KTH, Skolan för datavetenskap och kommunikation (CSC), Medieteknik och grafisk produktion, Media.
    Towards a semantic e-learning theory by using a modelling approach2006Ingår i: British Journal of Educational Technology, ISSN 0007-1013, E-ISSN 1467-8535, Vol. 37, nr 3, 445-459 s.Artikel i tidskrift (Refereegranskat)
    Abstract [en]

    In the present study, a semantic perspective on e-learning theory is advanced and a modelling approach is used. This modelling approach towards the new learning theory is based on the four SECI phases of knowledge conversion: Socialisation, Externalisation, Combination and Internalisation, introduced by Nonaka in 1994, and involving two levels of knowledge-tacit and explicit. In the Socialisation phase, the teacher-student interaction activates the exploratory learning behaviour. This phase is emotionally and socially loaded. The Externalisation phase is partly emotional but a cognitive dimension is also needed, which requires creativity. This phase works optimally if it is collaborative in nature. In the Combination phase, an ability for hypothetical-deductive thinking is needed for the modelling approach. During the Internalisation phase, the learning process requires that students engage in seeking to understand and explain natural phenomena, which further demands testing of the theoretical concepts.

  • 46469.
    Yngman, Gunnar
    Uppsala universitet, Medicinska och farmaceutiska vetenskapsområdet, Farmaceutiska fakulteten, Institutionen för farmaceutisk biovetenskap.
    Individualization of fixed-dose combination regimens: Methodology and application to pediatric tuberculosis2015Självständigt arbete på avancerad nivå (masterexamen), 20 poäng / 30 hpStudentuppsats (Examensarbete)
    Abstract [en]

    Introduction: No Fixed-Dose Combination (FDC) formulations currently exist for pediatric tuberculosis (TB) treatment. Earlier work implemented, in the software NONMEM, a rational method for optimizing design and individualization of pediatric anti-TB FDC formulations based on patient body weight, but issues with parameter estimation, dosage strata heterogeneity and representative pharmacokinetics remained.

    Aim: To further develop the rational model-based methodology aiding the selection of appropriate FDC formulation designs and dosage regimens, in pediatric TB treatment.

    Materials and Methods: Optimization of the method with respect to the estimation of body weight breakpoints was sought. Heterogeneity of dosage groups with respect to treatment efficiency was sought to be improved. Recently published pediatric pharmacokinetic parameters were implemented and the model translated to MATLAB, where also the performance was evaluated by stochastic estimation and graphical visualization.

    Results: A logistic function was found better suited as an approximation of breakpoints. None of the estimation methods implemented in NONMEM were more suitable than the originally used FO method. Homogenization of dosage group treatment efficiency could not be solved. MATLAB translation was successful but required stochastic estimations and highlighted high densities of local minima. Representative pharmacokinetics were successfully implemented.

    Conclusions: NONMEM was found suboptimal for the task due to problems with discontinuities and heterogeneity, but a stepwise method with representative pharmacokinetics were successfully implemented. MATLAB showed more promise in the search for a method also addressing the heterogeneity issue.

  • 46470.
    Yngman, Johan
    et al.
    Linköpings universitet, Institutionen för datavetenskap. Linköpings universitet, Tekniska högskolan.
    Westergren, Emil
    Linköpings universitet, Institutionen för datavetenskap. Linköpings universitet, Tekniska högskolan.
    Advanced Real­Time sound techniques for Virtual Reality headsets2014Självständigt arbete på avancerad nivå (masterexamen), 20 poäng / 30 hpStudentuppsats (Examensarbete)
    Abstract [en]

    Virtual reality headsets, like the Oculus Rift, uses visual tricks to enhance the feeling of immersion in virtual reality applications. This thesis explores the possibilities of creating an immersive sound experience to go along with the visuals. A sound propagation model designed for real-time simulations is presented along with techniques to implement binaural synthesis. The thesis includes an implementation of a 3D cube world written in C# using OpenGL for graphics and FMOD for sound. The implementation is evaluated in the context of realism and possible improvements and optimizations are suggested.

  • 46471.
    Yngström, Louise
    KTH, Tidigare Institutioner, Data- och systemvetenskap, DSV. Stockholm University, Sweden.
    An holistic approach to an international doctoral program2004Ingår i: Information security management, education and privacy: IFIP 18th World Computer Congress : TC11 19th International Information Security Workshops, 22-27 August 2004, Toulouse, France, Springer-Verlag New York, 2004, 117-132 s.Konferensbidrag (Refereegranskat)
    Abstract [en]

    The paper discusses forms and structures for an international doctoral program with specialization in information security and information assurance based on an analysis of international educational efforts in the area 1995-2003. The presentation underlines the need for holistic approaches to the IT security area and presents, as an example, the Systemic-Holistic Approach, SHA.

  • 46472.
    Yngström, Louise
    KTH, Skolan för informations- och kommunikationsteknik (ICT), Data- och systemvetenskap, DSV.
    Can we tune information security management into meeting corporate governance needs?: (invited paper)2005Ingår i: SECURITY MANAGEMENT, INTEGRITY, AND INTERNAL CONTROL IN INFORMATION SYSTEMS / [ed] Dowland, P; Furnell, S; Thuraisingham, B; Wang, XS, 2005, Vol. 193, 237-245 s.Konferensbidrag (Refereegranskat)
    Abstract [en]

    This paper intends to stimulate discussion, research and new points-of-action for IS/IT security management from the background of corporate governance, contemporary debates of how to express observable consequences of IT and IT security, and of didactic issues. It is concluded that empirical research within IT security management is rare as compared to theoretical approaches but needed in order to have IS/IT security management on par with general management.

  • 46473.
    Yngström, Louise
    et al.
    Stockholms universitet, Samhällsvetenskapliga fakulteten, Institutionen för data- och systemvetenskap.
    Abbas, Haider
    Hemani, Ahmed
    Magnusson, Christer
    Stockholms universitet, Samhällsvetenskapliga fakulteten, Institutionen för data- och systemvetenskap.
    A Structured approach for Internalizing Externalities Caused by IT Security Mechanisms2010Ingår i: 2nd Int. Workshop on Education Technology and Computer Science, 2010Konferensbidrag (Refereegranskat)
  • 46474.
    Yngström, Louise
    et al.
    Stockholms universitet, Samhällsvetenskapliga fakulteten, Institutionen för data- och systemvetenskap.
    Kowalski, Stewart
    Stockholms universitet, Samhällsvetenskapliga fakulteten, Institutionen för data- och systemvetenskap.
    Barabanov, Rostyslav
    Stockholm University, Social Sciences, DSV.
    Information Security Metrics: Research Directions2011Övrigt (Övrig (populärvetenskap, debatt, mm))
    Abstract [sv]

    Analys av framkomlig forskningsinriktning inom säkerhetsmetriker baserad på state-of-the-art inom området.

  • 46475.
    Yngve, Simon
    Högskolan i Skövde, Institutionen för kommunikation och information.
    Evolutionär algoritm för schemaläggning av kontinuerligt skiftarbete: Schemaläggning med ergonomiska riktlinjer2010Självständigt arbete på grundnivå (kandidatexamen), 20 poäng / 30 hpStudentuppsats (Examensarbete)
    Abstract [sv]

    Många organisationer har ett behov av bemanning hela dygnet alla dagar i veckan. Personal vid sådana organisationer organiseras i arbetslag som enligt ett arbetsschema löser av varandra under dygnets gång. Beroende på hur dessa arbetsscheman utformas kan de få en negativ inverkan på personalens hälsa. Den här rapporten handlar om utvecklandet av en algoritm som genererar arbetsscheman med ergonomiska riktlinjer, det vill säga arbetsscheman som utformats på ett sådant sätt att negativa effekter på personalens hälsa undviks. Algoritmen som utvecklas baseras på optimeringsalgoritmen Squeaky Wheel Optimization. Resultatet av arbetet visar att arbetsscheman som genererats av algoritmen är av sådan hög kvalité att de skulle kunna appliceras praktiskt hos en organisation som har ett bemanningsbehov hela dygnet alla dagar i veckan. Tack vare algoritmens generella karaktär kan algoritmen användas som ett verktyg för schemagenerering hos en stor mängd företag.

  • 46476.
    Yngvesson, Jimmie
    Linnéuniversitetet, Fakultetsnämnden för naturvetenskap och teknik, Institutionen för datavetenskap, fysik och matematik, DFM.
    Till  framtida utvecklare2011Självständigt arbete på grundnivå (högskoleexamen), 10 poäng / 15 hpStudentuppsats (Examensarbete)
  • 46477.
    Ynnerman, Anders
    et al.
    Linköpings universitet, Institutionen för teknik och naturvetenskap, Medie- och Informationsteknik. Linköpings universitet, Tekniska fakulteten. Linköpings universitet, Centrum för medicinsk bildvetenskap och visualisering, CMIV. Norrkoping Visualizat Centre C, Sweden.
    Rydell, Thomas
    Interspectral AB, Sweden; Interact Institute Swedish ICT, Sweden.
    Antoine, Daniel
    British Museum, England; UCL, England.
    Hughes, David
    Interspectral AB, Sweden; Interact Institute Swedish ICT, Sweden.
    Persson, Anders
    Linköpings universitet, Institutionen för medicin och hälsa, Avdelningen för radiologiska vetenskaper. Linköpings universitet, Medicinska fakulteten. Region Östergötland, Diagnostikcentrum, Röntgenkliniken i Linköping. Linköpings universitet, Centrum för medicinsk bildvetenskap och visualisering, CMIV.
    Ljung, Patric
    Linköpings universitet, Institutionen för teknik och naturvetenskap, Medie- och Informationsteknik. Linköpings universitet, Tekniska fakulteten. Norrkoping Visualizat Centre C, Sweden.
    Interactive Visualization of 3D Scanned Mummies at Public Venues2016Ingår i: Communications of the ACM, ISSN 0001-0782, E-ISSN 1557-7317, Vol. 59, nr 12, 72-81 s.Artikel i tidskrift (Refereegranskat)
    Abstract [en]

    BY COMBINING VISUALIZATION techniques with interactive multi-touch tables and intuitive user interfaces, visitors to museums and science centers can conduct self-guided tours of large volumetric image data. In an interactive learning experience, visitors become the explorers of otherwise invisible interiors of unique artifacts and subjects. Here, we take as our starting point the state of the art in scanning technologies, then discuss the latest research on high-quality interactive volume rendering and how it can be tailored to meet the specific demands

  • 46478.
    Ynnerman, Anders
    et al.
    Linköpings universitet, Institutionen för teknik och naturvetenskap, Medie- och Informationsteknik. Linköpings universitet, Tekniska fakulteten. Linköpings universitet, Centrum för medicinsk bildvetenskap och visualisering, CMIV.
    Rydell, Thomas
    Persson, Anders
    Linköpings universitet, Institutionen för medicin och hälsa, Avdelningen för radiologiska vetenskaper. Linköpings universitet, Medicinska fakulteten. Linköpings universitet, Centrum för medicinsk bildvetenskap och visualisering, CMIV. Östergötlands Läns Landsting, Diagnostikcentrum, Röntgenkliniken i Linköping.
    Ernvik, Aron
    Forsell, Camilla
    Linköpings universitet, Institutionen för teknik och naturvetenskap, Medie- och Informationsteknik. Linköpings universitet, Tekniska fakulteten.
    Ljung, Patric
    Linköpings universitet, Institutionen för teknik och naturvetenskap, Medie- och Informationsteknik. Linköpings universitet, Tekniska fakulteten.
    Lundström, Claes
    Linköpings universitet, Institutionen för teknik och naturvetenskap, Medie- och Informationsteknik. Linköpings universitet, Tekniska fakulteten. Linköpings universitet, Centrum för medicinsk bildvetenskap och visualisering, CMIV.
    Multi-Touch Table System for Medical Visualization2015Ingår i: Eurographics 2015: Dirk Bartz Prize, Eurographics - European Association for Computer Graphics, 2015Konferensbidrag (Övrigt vetenskapligt)
    Abstract [en]

    Medical imaging plays a central role in a vast range of healthcare practices. While the usefulness of 3D visualizations is well known, the adoption of such technology has previously been limited in many medical areas. This paper, awarded the Dirk Bartz Prize for Visual Computing in Medicine 2015, describes the development of a medical multi-touch visualization table that successfully has reached its aim to bring 3D visualization to a wider clinical audience. The descriptions summarize the targeted clinical scenarios, the key characteristics of the system, and the user feedback obtained.

  • 46479. Yoeli, Michael
    et al.
    Pehrson, Björn
    RISE., Swedish ICT, SICS.
    Behavior-Preserving Reductions of Communicating System Nets1986Rapport (Refereegranskat)
    Abstract [en]

    Among the various methods for the modeling of distributed systems that currently are available, the process algebra CCS and Petri nets with extensions are of particular interest. CCS contains the useful concept of synchronized communication. While the theory of CCS is based on a single concept of behavioral equivalence, a variety of such concepts could be incorporated into net theory. Particularly, a clear distinction can be made between the interleaving of concurrent actions and true concurrency. Net theory also provides a suitable basis for the investigation of structural proprties (eg. liveness). Furthermore, various reduction techniques applicable to nets compare favorably with the algebraic analysis methods of CCS. In view of these arguments, a CCS-oriented extension of the Petri net concept, called Communication System Nets, CS-nets, is introduced which incorporates a conditional action feature. Various behavior-preserving reduction techniques are demonstrated along with the applicability of CS-Nets to the specification and verification of distributed systems.

  • 46480.
    Yogarajah, Pratheepan
    et al.
    School of Computing and Intelligent Systems, University of Ulster, UK.
    Condell, Joan
    School of Computing and Intelligent Systems, University of Ulster, UK.
    Curran, Kevin
    School of Computing and Intelligent Systems, University of Ulster, UK.
    Cheddad, Abbas
    Umeå universitet, Medicinska fakulteten, Umeå centrum för molekylär medicin (UCMM).
    McKevit, Paul
    School of Computing and Intelligent Systems, University of Ulster, UK.
    An Improved Self-embedding Algorithm: Digital Content Protection against Compression Attacks in Digital Watermarking2010Ingår i: Image Processing and Communications Challenges 2 / [ed] Ryszard S. Choraś, Springer Berlin/Heidelberg, 2010, 59-66 s.Kapitel i bok, del av antologi (Övrigt vetenskapligt)
    Abstract [en]

    Lossy compression attacks in digital watermarking are one of the major issues in digital watermarking. Cheddad et al. proposed a robust secured self-embedding method which is resistant to a certain amount of JPEG compression. Our experimental results show that the self-embedding method is resistant to JPEG compression attacks and not resistant to other lossy compression attacks such as Block Truncation Coding (BTC) and Singular Value Decomposition (SVD). Therefore we improved Cheddad et al's. method to give better protection against BTC and SVD compression attacks.

  • 46481.
    Yoo, Sam
    et al.
    Linnéuniversitetet, Fakulteten för teknik (FTK), Institutionen för informatik (IK).
    Naef, Petter
    Linnéuniversitetet, Fakulteten för teknik (FTK), Institutionen för informatik (IK).
    Agila Business Intelligence System: Kritiska framgångsfaktorer2014Självständigt arbete på avancerad nivå (magisterexamen), 10 poäng / 15 hpStudentuppsats (Examensarbete)
    Abstract [sv]

    Agila Business Intelligence System (ABIS) är en relativt ny och komplex typ av informationssystem, som kännetecknas av förkortade utvecklingstider, genom att exempelvis införa mer självbetjäning i de analytiska systemen, för att kunna möta ett behov av att analysera omvärldsfaktorer, som förändras i en allt snabbare takt. Eftersom ABIS är ett nytt och relativt outforskat område, finns ett behov av att utforska detta område. IT-investeringar är alltför ofta olönsamma och finns ett intresse av att visa på vad som bidrar till ett framgångsrikt införande av ett ABIS och på vilket sätt.

    Syftet med denna fallstudie var att identifiera högt rankade och gemensamma faktorer baserat på de kritiska framgångsfaktorer som belagts av tidigare forskning inom ABIS, beskriva hur dessa bidragit till ett framgångsrikt införande samt utröna skillnader och/eller likheter mellan hur dessa faktorer verkar ur kund- respektive leverantörsperspektiv.

    Som underlag för denna studie användes framför allt tidigare forskning kring kritiska framgångsfaktorer för Business Intelligence System. Speciellt en modell som utvecklades 2010 av Yeoh och Koronios användes som utgångspunkt för att lista de potentiella faktorer, som skulle beaktas av denna studie.

    Denna undersökning genomfördes som en fallstudie med hjälp av ett företag, som både levererar konsulttjänster och ABIS. En Delphipanel användes för att sortera fram framgångsfaktorer, som sedan studerades närmare genom semistrukturerade intervjuer för hur dessa kritiska framgångsfaktorer bidragit till ett framgångsrikt införande av ABIS från dels ett kundperspektiv, dels ett leverantörsperspektiv.

    De två faktorer som rankades högt och samtidigt delades av samtliga respondenter var:

    • affärsvision och planer
    • datakvalitet och dataintegritet

    Kundperspektivet var det styrande och leverantörens roll var ordentligt förstå kundens perspektiv, för att på så sätt framgångsrikt införa ABIS. Affärsvision och planer var av betydelse för att koppla införande till kundens målsättningar. Datakvalitet och dataintegritet var den mest betydelsefull faktorn utifrån den resursfördelningen skedde inom ett införandeprojekt för ABIS.

  • 46482. Yoo, Y.
    et al.
    Henfridsson, Ola
    RISE., Swedish ICT, Viktoria.
    Lyytinen, K.
    The new organizing logic of digital innovation: An agenda for information systems research2010Ingår i: Information systems research, ISSN 1047-7047, E-ISSN 1526-5536, Vol. 21, nr 4, 724-735 s.Artikel i tidskrift (Refereegranskat)
    Abstract [en]

    In this essay, we argue that pervasive digitization gives birth to a new type of product architecture: the layered modular architecture. The layered modular architecture extends the modular architecture of physical products by incorporating four loosely coupled layers of devices, networks, services, and contents created by digital technology. We posit that this new architecture instigates profound changes in the ways that firms organize for innovation in the future. We develop (1) a conceptual framework to describe the emerging organizing logic of digital innovation and (2) an information systems research agenda for digital strategy and the creation and management of corporate information technology infrastructures. © 2010 INFORMS.

  • 46483. Yosef, Nir
    et al.
    Käll, Lukas
    KTH, Skolan för bioteknologi (BIO), Genteknologi.
    From sequence to structure to networks2008Ingår i: Genome Biology, ISSN 1465-6906, E-ISSN 1474-760X, Vol. 9, nr 11Artikel i tidskrift (Refereegranskat)
    Abstract [en]

    A report on the 7th European Conference on Computational Biology (ECCB), Cagliari, Italy, 22-26 September 2008.

  • 46484. Yoshida, Motoharu
    et al.
    Fransén, Erik
    KTH, Skolan för datavetenskap och kommunikation (CSC), Beräkningsbiologi, CB.
    Hasselmo, Michael E.
    mGluR-dependent persistent firing in entorhinal cortex layer III neurons2008Ingår i: European Journal of Neuroscience, ISSN 0953-816X, E-ISSN 1460-9568, Vol. 28, nr 6, 1116-1126 s.Artikel i tidskrift (Refereegranskat)
    Abstract [en]

    Persistent firing is believed to be a crucial mechanism for memory function including working memory. Recent in vivo and in vitro findings suggest an involvement of metabotropic glutamate receptors (mGluRs) in persistent firing. Using whole-cell patch-recording techniques in a rat entorhinal cortex (EC) slice preparation, we tested whether EC layer III neurons display persistent firing due to mGluR activation, independently of cholinergic activation. Stimulation of the angular bundle drove persistent firing in 90% of the cells in the absence of a cholinergic agonist. The persistent firing was typically stable for > 4.5 min at which point persistent firing was terminated by the experimenter. The average frequency of the persistent firing was 2.1 Hz, ranging from 0.4 to 5.5 Hz. This persistent firing was observed even in the presence of atropine (2 mu M), suggesting that the persistent firing can occur independent of cholinergic activation. Furthermore, ionotropic glutamate and GABAergic synaptic blockers (2 mm kynurenic acid, 100 mu M picrotoxin and 1 mu M CGP55845) did not block the persistent firing. On the other hand, blockers of group I mGluRs (100 mu M LY367385 and 20 mu M MPEP) completely blocked or suppressed the persistent firing. An agonist of group I mGluRs (20 mu M DHPG) greatly enhanced the persistent firing induced by current injection. These results indicate that persistent firing can be driven through group I mGluRs in entorhinal layer III neurons, suggesting that glutamatergic synaptic input alone could enable postsynaptic neurons to hold input signals in the form of persistent firing.

  • 46485. Yoshimatsu, K
    et al.
    Reimhult, K
    Krozer, A
    RISE., Swedish ICT, Acreo.
    Mosbach, K
    Sode, K
    Ye, L
    Uniform molecularly imprinted microspheres nanoparticles prepared by precipitation polymerization2007Ingår i: Analytica Chimica Acta, ISSN 0003-2670, E-ISSN 1873-4324, Vol. 584, nr 1, 112-121 s.Artikel i tidskrift (Refereegranskat)
  • 46486.
    You, Ilsun
    et al.
    Korean Bible University, School of Information Science, Seoul.
    Andersson, Karl
    Luleå tekniska universitet, Institutionen för system- och rymdteknik, Datavetenskap. Luleå tekniska universitet, Institutionen för system- och rymdteknik, CDT.
    Yang, Laurance T.
    Department of Computer Science, St. Francis Xavier University, Antigonish.
    Special Issue on Mobility and Intelligence Management Technologies for Wireless and Mobile Networks2014Ingår i: Wireless personal communications, ISSN 0929-6212, E-ISSN 1572-834X, Vol. 76, nr 4, 657-660 s.Artikel i tidskrift (Refereegranskat)
  • 46487.
    You, Yantian
    KTH, Skolan för informations- och kommunikationsteknik (ICT).
    Sparsity Analysis of Deep Learning Models and Corresponding Accelerator Design on FPGA2016Självständigt arbete på grundnivå (yrkesexamen), 10 poäng / 15 hpStudentuppsats (Examensarbete)
    Abstract [en]

    Machine learning has achieved great success in recent years, especially the deep learning algorithms based on Artificial Neural Network. However, high performance and large memories are needed for these models , which makes them not suitable for IoT device, as IoT devices have limited performance and should be low cost and less energy-consuming. Therefore, it is necessary to optimize the deep learning models to accommodate the resource-constrained IoT devices.

    This thesis is to seek for a possible solution of optimizing the ANN models to fit into the IoT devices and provide a hardware implementation of the ANN accelerator on FPGA. The contribution of this thesis mainly lies in two aspects: 1). analyze the sparsity in the two mainstream deep learning models – DBN and CNN. The DBN model consists of two hidden layers with Restricted Boltzmann Machines while the CNN model consists of 2 convolutional layers and 2 sub-sampling layer. Experiments have been done on the MNIST data set with the sparsity of 75%. The ratio of the multiplications resulting in near-zero values has been tested. 2). FPGA implementation of an ANN accelerator. This thesis designed a hardware accelerator for the inference process in ANN models on FPGA (Stratix IV: EP4SGX530KH40C2). The main part of hardware design is the processing array consists of 256 Multiply-Accumulators array, which can conduct multiply-accumulate operations of 256 synaptic connections simultaneously. 16-bit fixed point computation is used to reduce the hardware complexity, thus saving power and area.

    Based on the evaluation results, it is found that the ratio of the multiplications under the threshold of 2-5 is 75% for CNN with ReLU activation function, and is 83% for DBN with sigmoid activation function, respectively. Therefore, there still exists large space for complex ANN models to be optimized if the sparsity of data is fully utilized. Meanwhile, the implemented hardware accelerator is verified to provide correct results through 16-bit fixed point computation, which can be used as a hardware testing platform for evaluating the ANN models.

  • 46488.
    Younan, Karam
    Högskolan i Skövde, Institutionen för informationsteknologi.
    Smarttelefonsäkerhet: En studie kring studenters användning av inbyggda säkerhetsfunktioner i smarta telefoner2016Självständigt arbete på grundnivå (kandidatexamen), 15 poäng / 22,5 hpStudentuppsats (Examensarbete)
    Abstract [en]

    Smartphones combine telephony services with data services in a single device. In 2007, Apple released a new generation of phones run by iOS operating system, called iPhones. Android phones were developed by Google and were released the following year. Smartphones use has increased a lot and they have become one of the most common devices that are being used in most of companies nowadays. The concept BYOD stands for Bring Your Own Device, means that employees may use their own smartphones at work. This makes using the built-in security features in smartphones particularly important, not only to protect employees’ private information but also to protect their corporate information. Early research has shown that threats and attacks have also increased on smartphones. Hackers have focused their attacks on smartphones more than before. And have created mobile-based viruses, malware and spyware that target vulnerable smartphones. Smartphone users nowadays do not have much control of their smartphones security according to previous researches. However, smartphones manufacturers constantly add new built-in security features with each new version of operating system to protect them from various threats. Smartphone manufacturers may use the acquired final data to improve their products’ security and increase the use of mobile built-in security features.

    The current study researches students’ interaction and use of the built-in security features available in smartphones run by both Android and iOS operating systems. The study does not divide students into smaller groups; it rather focuses on all students as one group. Although this study was conducted in the University of Skovde in Sweden, its conclusion can be applied to a bigger population regardless of location. Today's students are tomorrow’s employees and managers who will have the responsibility to protect their companies’ proprietary and sensitive information. Therefore, it is critical that they understand and implement all up-to-date procedures to protect their smartphones and their companies.

    A quantitative study is conducted through a survey in order to reach as many participants as possible. Lime Survey tool is utilized to create surveys and to gather data. Statistics and diagrams are also used to demonstrate results to readers. A total of 201 participants completed the entire study, 134 participants answered the Android survey and 67 answered the iOS survey.

    The current survey results have shown, through a model that converts participants’ answers into a flow chart, that the use of the built-in security features varies among participating students. The use of these built-in security features was low in general. More than half of all participants do not use certain functions at all. The general low use of the built-in security features can be attributed to many reasons. This survey showed that the main reason of that was the lack of participants’ knowledge of these built-in security features. Several solutions exist for this lack of knowledge of participants, but they do not fall within the scope of this study therefore not discussed herein.

  • 46489.
    Younas, Irfan
    et al.
    KTH, Skolan för informations- och kommunikationsteknik (ICT), Kommunikation: Infrastruktur och tjänster, Programvaru- och datorsystem, SCS.
    Ayani, Rassul
    KTH, Skolan för informations- och kommunikationsteknik (ICT), Kommunikation: Infrastruktur och tjänster, Programvaru- och datorsystem, SCS.
    Schubert, Johan
    Swedish Defence Research Agency, Stockholm, Sweden.
    Using Genetic Algorithms for investigating specific regions of the solution space2011Ingår i: Proceedings of the 2011 African Conference on Software Engineering and Applied Computing (ACSEAC 2011), 2011Konferensbidrag (Refereegranskat)
    Abstract [en]

    In many practical cases decision makers are interested to understand the whole solution space, including possible outliers. By outlier we mean there is a solution that is theoretically possible, though with very low probability that it occurs. In many combinatorial problems, this is a very challenging task. During the past decade, the Data Farming community has done substantial work on developing methods and techniques for better understanding of the solution space. The data farming community has also looked at the design of experiments and used Latin hypercube (LH) techniques for this purpose. The LH is proven to be one of the important sampling methods for selecting a representative subset of the input space. In this paper, we consider a company X that wants to outsource m subprojects of a given project P. We assume that there are n potential subcontractors for each subproject. Thus, there will be n^m ways to assign the subprojects to the potential subcontractors. The project manager is interested to find those assignments that complete the project within a given time and a given cost frame. An exhaustive examination of all assignments is not feasible, if m and n are big numbers. We propose an objective-based genetic algorithm (GA) for finding the set of assignments that are mapped onto a given subset of the solution space. It means, as opposed to the design of experiment techniques, we start from the solution space and try to find the combinations of the input parameter values that can lead to a specific region of the solution space. By some numerical examples, we show how our GA identifies the set of such feasible assignments.

  • 46490.
    Younas, Irfan
    et al.
    KTH, Skolan för informations- och kommunikationsteknik (ICT), Programvaruteknik och Datorsystem, SCS.
    Ayani, Rassul
    KTH, Skolan för informations- och kommunikationsteknik (ICT), Programvaruteknik och Datorsystem, SCS.
    Schubert, Johan
    Swedish Defense Research Agency (FOI).
    Asadi, Hirad
    Swedish Defense Research Agency (FOI).
    Using genetic algorithms in effects-based planning2013Ingår i: Proceedings of the 2013 IEEE International Conference on Systems, Man, and Cybernetics (SMC), IEEE Computer Society, 2013, 438-443 s.Konferensbidrag (Refereegranskat)
    Abstract [en]

    In this paper, we propose a genetic algorithm-based method for evaluation of operational plans within effects-based planning. We formulate the effects-based planning problem as a bi-objective optimization problem, in which the distance from the initial state to the current state (g) and the distance from the current state to the desired end state (h) are minimized. To solve the problem, we adopt Non-dominated Sorting Genetic Algorithm-II (NSGA-II). Considering an expeditionary operation scenario, we simulate a subset of possible plans and present the decision maker with a set of promising plans which are capable of approaching the desired end state efficiently. In order to discuss the efficiency and effectiveness of the algorithm, we compare the results of NSGA-II with the results of A*. The computational results show that NSGA-II is much more efficient than A* with regard to g. On the other hand A* is a little more effective with regard to h.

  • 46491.
    Younas, Irfan
    et al.
    KTH, Skolan för informations- och kommunikationsteknik (ICT), Programvaruteknik och Datorsystem, SCS.
    Kamrani, Farzad
    Swedish Defence Research Agency, Stockholm, Sweden.
    Ayani, Rassul
    KTH, Skolan för informations- och kommunikationsteknik (ICT), Programvaruteknik och Datorsystem, SCS.
    Optimization of assignment of tasks to teams using multi-objective metaheuristics2013Ingår i: GECCO 2013 - Proceedings of the 2013 Genetic and Evolutionary Computation Conference Companion, Association for Computing Machinery (ACM), 2013, 103-104 s.Konferensbidrag (Refereegranskat)
    Abstract [en]

    A highly interesting but not thoroughly addressed optimization problem is a variation of the Assignment Problem (AP) where tasks are assigned to groups of collaborating agents (teams). In this paper, we address this class of AP as a bi-objective optimization problem, in which the cost is minimized and the quality is maximized. To solve the model, we adopt Non-dominated Sorting Genetic Algorithm-II (NSGAII) and Strength Pareto Evolutionary Algorithm 2 (SPEA2). We conduct several experiments on problems with varying sizes to compare the NSGA-II and SPEA2 algorithms.

  • 46492.
    Younas, Irfan
    et al.
    KTH, Skolan för informations- och kommunikationsteknik (ICT), Programvaruteknik och Datorsystem, SCS.
    Kamrani, Farzad
    Swedish Defense Research Agency (FOI).
    Moradi, Farshad
    Swedish Defense Research Agency (FOI).
    Ayani, Rassul
    KTH, Skolan för informations- och kommunikationsteknik (ICT), Programvaruteknik och Datorsystem, SCS.
    Schubert, Johan
    Swedish Defense Research Agency (FOI).
    Håkansson, Anne
    KTH, Skolan för informations- och kommunikationsteknik (ICT), Programvaruteknik och Datorsystem, SCS.
    Solving Battalion Rescheduling Problem Using Multi-objective Genetic Algorithms2013Ingår i: Asiasim 2013: 13th International Conference on Systems Simulation. Proceedings, Singapore, November 6-8, 2013., Springer Berlin/Heidelberg, 2013, 93-104 s.Konferensbidrag (Refereegranskat)
    Abstract [en]

    In this paper, we consider the problem of rescheduling human resources in a battalion where new activities are assigned to the battalion by higher headquarters, requiring modification of an existing original schedule. The problem is modeled as a multi-criteria optimization problem with three objectives: (i) maximizing the number of tasks that are performed, (ii) minimizing the number of high-priority tasks that are missed, and (iii) minimizing the difference between the original schedule and the modified one. In order to solve the optimization model, we adopt Non-dominated Sorting Genetic Algorithm-II (NSGA-II). The accuracy of NSGA-II in this context is verified by considering a small-sized problem where it is easy to verify solutions. Furthermore, we consider a realistic problem instance for a battalion with 400 agents and 66 tasks in the initial schedule. We present the computational result of rescheduling when unpredictable activities emerge.

  • 46493.
    Younas, Irfan
    et al.
    KTH, Skolan för informations- och kommunikationsteknik (ICT), Programvaruteknik och Datorsystem, SCS.
    Kamrani, Farzad
    Swedish Defence Research Agency, Stockholm, Sweden.
    Schulte, Christian
    KTH, Skolan för informations- och kommunikationsteknik (ICT), Programvaruteknik och Datorsystem, SCS.
    Ayani, Rassul
    KTH, Skolan för informations- och kommunikationsteknik (ICT), Programvaruteknik och Datorsystem, SCS.
    Efficient Genetic Algorithms for Optimal Assignment of Tasks to Teamsof AgentsManuskript (preprint) (Övrigt vetenskapligt)
    Abstract [en]

    The problem of optimally assigning agents (resources) to a given set oftasks is known as the Assignment Problem (AP). The classical AP and manyof its variations have been discussed extensively in the literature. In thispaper, we present a specific class of Assignment Problems (APs) in which eachtask is assigned to a group of collaborating agents. In this AP, collaborationof all agents is required to perform the task and an agent cannot individuallydo it.

    We present a mathematical model for this type of AP and use GeneticAlgorithm (GA) to solve the model, since there are no known polynomial timealgorithms for this class of APs. We show that for larger instances of the problem,the GA with one-point crossover operator cannot efficiently find nearoptimalsolutions. In general, the efficiency of the GA depends on the choiceof genetic operators (selection, crossover, mutation) and associated parameters.In order to design an efficient GA for finding near optimal assignment oftasks to collaborative teams, we focus on construction of crossover operators.We compare and analyze the efficiency of several well-known crossover operatorssuch as one-point, two-point, three-point, position-based and order-basedcrossover operators. We suggest modifications to these operators by addinga shuffled repair list to them and show that their efficiency is enhanced forsolving the presented AP. Furthermore, we introduce two new crossover operators,team-based and team-based shuffled list crossover operators, whichsolve large-scale models of our AP efficiently.

  • 46494.
    Younas, Irfan
    et al.
    KTH, Skolan för informations- och kommunikationsteknik (ICT), Kommunikation: Infrastruktur och tjänster (Stängd 20120101), Programvaru- och datorsystem, SCS (Stängd 20120101).
    Kamrani, Farzad
    KTH, Skolan för informations- och kommunikationsteknik (ICT), Kommunikation: Infrastruktur och tjänster (Stängd 20120101), Programvaru- och datorsystem, SCS (Stängd 20120101).
    Schulte, Christian
    KTH, Skolan för informations- och kommunikationsteknik (ICT), Kommunikation: Infrastruktur och tjänster (Stängd 20120101), Programvaru- och datorsystem, SCS (Stängd 20120101).
    Ayani, Rassul
    KTH, Skolan för informations- och kommunikationsteknik (ICT), Kommunikation: Infrastruktur och tjänster (Stängd 20120101), Programvaru- och datorsystem, SCS (Stängd 20120101).
    Optimization of Task Assignment to Collaborating Agents2011Ingår i: IEEE SSCI 2011 - Symposium Series on Computational Intelligence - CISched 2011, Paris, France: IEEE Computational Intelligence Society , 2011, 17-24 s.Konferensbidrag (Refereegranskat)
    Abstract [en]

    The classic task assignment problem (AP) assigns m agents to n tasks, where each task is assigned to exactly one agent. This problem and many of its variations, including the case where a task is assigned to a group of agents working independently, have been discussed extensively in the literature. We consider a specific class of task assignment problems where each task is assigned to a group of collaborating agents that work as a team. Thus, changing one of the group members may have a vital impact on the output of the group. We assume that each agent has a set of capabilities and each task has certain requirements. The objective is to assign agents to teams such that the gain is maximized.

    We suggest a Genetic Algorithm (GA) for finding a near optimal solution to this class of task assignment problems. To the best of our knowledge, this class of APs has not been considered in the literature, probably due to the difficulty of evaluating the performance of a team of agents. Recently, we have developed a formal method for measuring performance of a team which is used in this paper to formulate the objective function of our GA. We analyze the quality of the obtained solution by comparing the result of our GA with (a) the exact solution of some smaller problems, and (b) with the results of the exact solution of specific cases that can be obtained by the Hungarian algorithm. We provide experimental results on efficiency, stability, robustness and scalability of the solution obtained by our GA.

  • 46495.
    Younas, Muhammad
    Högskolan i Halmstad, Sektionen för Informationsvetenskap, Data– och Elektroteknik (IDE).
    A comparative analysis of Cisco Performance Routing (PfR) and other performance enhancing techniques - Cisco QoS and Path Control2011Självständigt arbete på avancerad nivå (magisterexamen), 15 poäng / 22,5 hpStudentuppsats (Examensarbete)
    Abstract [en]

    Eleven years ago Cisco introduced three types of applications on the same converged network and named it AVVID (Architecture for Voice, Video and Integrated Data). In spite of the initial interest and hype surrounding AVVID, the feature was and still is unable to confront problems such as: data priority, load balancing and network congestion. The work in this report addressed these issues within the network. Different Cisco Internetwork Operating System (IOS) methods: routing protocols, Cisco IOS QoS (including LLQ, LFI and Header Compression), Path Control and Cisco Performance Routing (PfR) were all tested to see which feature would work best at enhancing network performance.

    A practical network was created in which these features were carefully implemented one after another. In every step, the results were observed and recorded and if necessary repeated in order to check their validity. The results for RTT (Round Trip Time) and MOS (Mean Opinion Score) showed that in comparison to Path Control and Cisco IOS QoS (Quality of Service) mechanisms, Cisco PfR was able to generate routes on the fly during times of network congestion. This cannot be achieved with the use of Cisco QoS and Path Control which makes Cisco Performance Routing a far more superior feature. Although the focus of the work was VoIP (Voice over Internet Protocol) data, it is possible to construct a network with any application as Cisco PfR is able to reroute data. Cisco PfR is an easily accessible IOS feature which, once implemented, requires very little updating and maintenance.

  • 46496.
    Young, Kristie L.
    et al.
    Monash University.
    Rudin-Brown, Christina M.
    Monash University.
    Patten, Christopher
    Statens väg- och transportforskningsinstitut, Samhälle, miljö och transporter, SAMT, Mobilitet, aktörer och planering, MAP.
    Ceci, Ruggero
    Trafikverket.
    Lenné, Michael G.
    Monash University.
    Effects of phone type on driving and eye glance behaviour while text-messaging2014Ingår i: Safety Science, ISSN 0925-7535, E-ISSN 1879-1042, Vol. 68, 47-54 s.Artikel i tidskrift (Refereegranskat)
    Abstract [en]

    This study examined whether phone interface - touch screen keyboard vs. numeric keypad - moderates the impact of sending and receiving text messages on simulated driving performance and eye glance behaviour. The high visual-manual demands of text messaging are known to degrade driving performance and these effects may be exacerbated by the absence of tactile cues when using a touch screen phone. Twenty-four participants (25-50. years) sent and received text messages on either a touch screen or numeric keypad phone while driving a simulated freeway environment. As expected, compared to baseline, receiving and particularly sending text messages led to decrements in speed monitoring, decreased the amount of time spent looking at the forward roadway by up to 29%, and increased subjective workload. The performance degradations observed were similar across the numeric keypad and touch screen keyboard phones. Future research should further investigate the possible moderating effects of phone interface type on distraction using longer text message tasks and under more challenging driving conditions.

  • 46497.
    Yousef, Andy
    et al.
    KTH, Skolan för datavetenskap och kommunikation (CSC).
    Lansner, Erik
    KTH, Skolan för datavetenskap och kommunikation (CSC).
    Detektion av “troll” i Twitterflöden med hjälp av klusteralgoritm: Metod för att detektera personer som sprider desinformation2016Självständigt arbete på grundnivå (kandidatexamen), 10 poäng / 15 hpStudentuppsats (Examensarbete)
    Abstract [sv]

    Sociala medier har alltid varit en plats där personer kan diskutera fritt om sina åsikter och dela nyheter med många. Lätt spridning av nyheter från alla hörn i världen kan komma vara användbart för att ha möjlighet att få opartiska nyheter. Även om det finns klara fördelar med exempelvis Twitter så kan det vara problematiskt med falska och uppgjorda nyheter. Ryktesspridning eller uppgjorda nyheter förekommer i stor utsträckning fortfarande, här testas metod(er) för att upptäcka vilka som kan tänkas sprida desinformation, så kallade ’trolls’. För att kunna upptäcka trolls i Twitter undersöks några attributer som tidigare använts för att detektera spammare. Problem uppstår då det inte finns några fastställda troll att jämföra med. Datasamling från Twitter utfördes och analyserats, genom att klustra data med viktiga attribut som skulle indikera på förekomst av trolls som exempelvis antalet tweets varje dag eller hur ofta det retweetas. Men klustringen ger inte 100% indikation på att det finns trolls utan att det skulle kunna öka sannolikheten att hitta trolls i ett kluster där en typisk twitterkonto har hög andel retweets eller följare genom vänner. Slutsatsen blev att metoden kan inte hitta trolls på egen hand men kan hjälpa till att isolera användare med specifika beteenden som kan vara mer eller mindre troll-lika.

  • 46498.
    Yousef, Paul
    Linköpings universitet, Institutionen för systemteknik.
    GSM-Security: A Survey and Evaluation of the Current Situation2004Självständigt arbete på grundnivå (yrkesexamen)Studentuppsats
    Abstract [en]

    The Global System for Mobile Communications (GSM) is the most widely used cellular technology in the world. Approximately 800 million people around the world are using GSM for different purposes, but mostly for voice communication and SMS. For GSM, like many other widely used systems, security is crucial. The security involves mechanisms used to protect the different shareholders, like subscribers and service providers. The aspects of security that this report covers are mainly anonymity, authentication and confidentiality.

    The important aspects of the system that need protection are described, along with the implementation of mechanisms used for the protection. It appears that many of the very valuable aspects of GSM can be attacked.

    The anonymity of a GSM user is compromised resulting in the attacker being able to observe the time, rate, length, sources or destinations of e g calls. Even tracking a subscriber’s movements becomes possible. However, a passive attack is not sufficient to perform these attacks. The attacker needs to mount an active attack using equipment offering base station functionality.

    Authentication is a crucial aspect of a wireless communication system due to the nature of the medium used, i e the radio link that is available to every one and not only the legitimate entities. Even the authentication mechanisms are attacked. It is possible to clone a subscription either by having physical access to the smart card or over the air interface. Cloning a subscription over the air requires base station functionality.

    The most obvious threat against communication systems is eavesdropping on conversations. The privacy of GSM conversations is protected using some version of the A5 algorithm. There are several impressive cryptanalytical attacks against these algorithms, that break the encryption and make it possible to eavesdrop in real-time. Most of these algorithms require, however, extensive computation power and unrealistic quantities of known plaintext, which make it difficult to use them in practice. Difficulties using cryptanalytical attacks to break the confidentiality of GSM calls does not mean that conversations are well protected. Loopholes in the protocols used in GSM make it possible for an outsider, with access to sufficient equipment, to eavesdrop on conversations in real-time.

    In the presence of these threats and vulnerabilities it is justified to wonder whether GSM provides sufficient security for users with very valuable information to communicate. These users may be military organisations, senior management personnel in large companies etc. GSM’s current security model does note provide sufficient protection for these entities. An additional layer of security should be added to the current security model.

  • 46499.
    Yousefi Mojir, Kayvan
    Linköpings universitet, Institutionen för ekonomisk och industriell utveckling, Informatik. Linköpings universitet, Filosofiska fakulteten.
    New Forms of Collaboration in Emergency Response Systems: A framework for participatory design of information systems2016Licentiatavhandling, sammanläggning (Övrigt vetenskapligt)
    Abstract [sv]

    Ett responssystem (Eng: emergency response system) är vanligtvis ansvarigt för att rädda liv och minska skador på miljö och infrastruktur i små, frekventa olyckor eller storskaliga händelser, kriser och katastrofer. Den pågående globala finanskrisen, brist på professionella resurser och nedskärningar inom den offentliga sektorn samtidigt som förväntningarna från allmänheten ökar är några av de aktuella utmaningar som responssystemet står inför. Samtidigt har globala händelser i form av storskaliga katastrofer som tsunamis, stormar och skogsbränder intensifierats och terrorattacker, och krig i Mellanöstern lett till ökade migrationsströmmar, vilket också ökat trycket inom offentlig sektor. Därför är responsaktörer ofta under extrem press och behöver söka hjälp från och samarbeta med andra resurser i samhället för att bli mer effektiva. Ett sätt att hantera utmaningarna är en framväxande trend i responssystemen i Sverige och internationellt att skapa nya samverkansformer, t.ex. tvärsektoriell samverkan, att involvera medborgare i e-förvaltning, och att involvera frivilliga. Både forskning och praktik har börjat visa på vissa fördelar med att organisera responssystemen på nya sätt. Men trots fördelarna medför också de nya samverkansformerna och de breda, heterogena aktörsgrupper som deltar i dessa olika utmaningar. Juridiska frågor, oklara ansvarsförhållanden, svårigheter att kategorisera arbetsuppgifter, oklarheter i jobbförsäkringar, variation i utbildning och bakgrund hos aktörer och svårigheter att identifiera olika aktörers specifika behov av till exempel informationssystem (IS) är några exempel. Därmed blir analysen av samverkan alltmer komplex och bör inkludera många aspekter. Alltför rudimentära analyser kan leda till otillräckliga resultat i relaterade projekt och IS-utveckling och på sikt kan detta leda till mindre effektivt samarbete mellan aktörerna. Nya former av samverkan måste därför analyseras och förstås noggrant, generellt och i varje visst sammanhang, i syfte att utveckla dem och att stödja aktörerna med effektiva IS.

    I denna licentiatavhandling utvecklas och presenteras ett ramverk för att analysera nya samverkansformer i responssystemet. Den ger också ett inledande förslag på hur man kan tillämpa ramverket med särskilt fokus på ISutveckling. Avhandlingen utgörs av en kvalitativ studie baserad på tre samverkansformer i det svenska responssystemet: sambruk av resurser mellan olika samhällssektorer, att involvera civila frivilliga i räddningsinsatser och samlokalisering av responsaktörer. Ramverket innefattar femton dimensioner: Typ /roll, attityd, utbildning, bakgrund, uppgift och ansvar, tillgänglighet, händelsetyp, kommunikationsmetoder, informationsteknologi, utrustning, organisationsstruktur, ledarskap, kostnad / nytta, arbetsmiljö, policy och juridik. Socio-teknisk systemteori och deltagande design principer tillämpades för att ramverket skulle bli specifikt applicerbart för IS-utveckling. Ramverket kan användas generellt för att analysera nya samverkansformer i responssystemet för att förstå dess olika aspekter och utmaningar, såsom aktörers uppgifter, relevanta lagar, ledarskap och organisatoriska faktorer, som annars riskerar att förbises i analysprocessen. När det gäller ISutveckling kan ramverket bidra till organisationsanalys och behovsanalys i deltagande design av IS för responssystem, t.ex. genom att hjälpa till att identifiera nyckelaktörer och involvera dem i utvecklingsprocesser.

    Ramverket testades först vid en studie av samlokalisering vid Trygghetens Hus och visade på flera potentiella fördelar när det gäller att identifiera och involvera aktörer i utvecklingsprocessen. Ramverket fungerade som ett stöd för att identifiera respondenter och utveckla mallar för intervjuer, observationer och en Future Workshop i de tidiga faserna av deltagande design för att söka täcka alla relevanta aspekter av samverkan. Det verkade också som att ramverket sparade tid och resurser. Därför argumenteras det för att ramverket kan ge liknande fördelar i liknande fall men för att kunna uttala sig mer säkert om detta krävs ytterligare tester och tillämpningar med flera fallstudier. En standardiserad och utvecklad version av ramverket kan ha potential att tillämpas på andra sammanhang inom den offentliga sektorn, såsom e-förvaltning där nya samverkansformer är i fokus. Ett sådant ramverk kan också bidra till att lösa mer generella problem med deltagande design, såsom brist på formalisering, och därmed bidra till att göra ansatsen mer praktisk och tillämpbar i komplexa systemutvecklingskontexter. I nästa steg kommer ramverket användas som en utgångspunkt och ett stöd för att analysera och utveckla IS stöd för sambruk av resurser och tvärsektoriell samverkan mellan aktörer i projektet. ”Effektivt gemensamt bruk av kommunala resurser för ökad säkerhet och trygghet" (ESKORT) i Norrköpings kommun.

  • 46500.
    Yousefi Mojir, Kayvan
    et al.
    Linköpings universitet, Institutionen för ekonomisk och industriell utveckling, Informatik. Linköpings universitet, Filosofiska fakulteten.
    Pilemalm, Sofie
    Linköpings universitet, Institutionen för ekonomisk och industriell utveckling, Informatik. Linköpings universitet, Filosofiska fakulteten.
    Actor-centred emergency response systems: a framework for needs analysis and information systems development2016Ingår i: International Journal of Emergency Management, ISSN 1471-4825, E-ISSN 1741-5071, Vol. 12, nr 4, 403-434 s.Artikel i tidskrift (Refereegranskat)
    Abstract [en]

     A new trend in emergency response systems (ERS) is to create new forms of collaboration, for example, by involving new resources in response operations, in order to compensate for the limited number of professional resources. However, the fact that the new resources may come from different organisational contexts and social sectors creates new challenges which directly affect information systems development for these resources. This study presents a framework including 15 dimensions to analyse the new forms of collaboration. Socio-technical system theory and participatory design approaches are applied to make the framework applicable in the information systems field. The framework might also address general problems such as the lack of formalisation and difficulties in identifying relevant stakeholders in participatory design. A comparison with international research showed a potential to adapt the framework to ERSs in other countries or even to other parts of the public sector that are undergoing similar changes.

927928929930931932933 46451 - 46500 av 47882
RefereraExporteraLänk till träfflistan
Permanent länk
Referera
Referensformat
  • apa
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Annat format
Fler format
Språk
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Annat språk
Fler språk
Utmatningsformat
  • html
  • text
  • asciidoc
  • rtf