Ändra sökning
Avgränsa sökresultatet
45678910 301 - 350 av 47259
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.
  • 301.
    Aceto, Luca
    et al.
    ICE-TCS, School of Computer Science, Reykjavik University, Menntavegur 1, IS-101 Reykjavik, Iceland.
    Birgisson, Arnar
    Department of Computer Science and Engineering, Chalmers University of Technology, Sweden.
    Ingolfsdottir, Anna
    ICE-TCS, School of Computer Science, Reykjavik University, Menntavegur 1, IS-101 Reykjavik, Iceland.
    Mousavi, Mohammad Reza
    Department of Computer Science, Eindhoven University of Technology, P.O. Box 513, NL-5600 MB Eindhoven, Netherlands.
    Reniers, Michel A.
    Department of Computer Science, Eindhoven University of Technology, P.O. Box 513, NL-5600 MB Eindhoven, Netherlands.
    Rule Formats for Determinism and Idempotence2012Ingår i: Science of Computer Programming, ISSN 0167-6423, E-ISSN 1872-7964, Vol. 77, 889-907 s.Artikel i tidskrift (Refereegranskat)
    Abstract [en]

    Determinism is a semantic property of (a fragment of) a language that specifies that a program cannot evolve operationally in several different ways. Idempotence is a property of binary composition operators requiring that the composition of two identical specifications or programs will result in a piece of specification or program that is equivalent to the original components. In this paper, we propose (related) meta-theorems for guaranteeing the determinism and idempotence of binary operators. These meta-theorems are formulated in terms of syntactic templates for operational semantics, called rule formats. In order to obtain a powerful rule format for idempotence, we make use of the determinism of certain transition relations in the definition of the format for idempotence. We show the applicability of our formats by applying them to various operational semantics from the literature. © 2010 Elsevier B.V. All rights reserved.

  • 302.
    Aceto, Luca
    et al.
    School of Computer Science, Reykjavik University, Iceland.
    Birgisson, Arnar
    School of Computer Science, Reykjavik University, Iceland & Department of Computer Science and Engineering, Chalmers University of Technology, Sweden.
    Ingólfsdóttir, Anna
    School of Computer Science, Reykjavik University, Iceland.
    Mousavi, Mohammad Reza
    Department of Computer Science, TU/Eindhoven, Eindhoven, Netherlands.
    Decompositional Reasoning about the History of Parallel Processes2010Rapport (Övrigt vetenskapligt)
    Abstract [en]

    Decompositional reasoning aims at automatically decomposing a global property of a composite system into local properties of (possibly unknown) components. In concurrency theory, decompositional reasoning techniques date back to the seminal work of Larsen and Liu in the late 1980s and early 1990s. However, we are not aware of any such decomposition technique that applies to reasoning about the "past". In this paper, we address this problem and present a decomposition technique for Hennessy-Milner logic with past and its extension with recursively defined formulae. As a language for processes, we use a subset of Milner's CCS with parallel composition, non-deterministic choice, action prefixing and the inaction constant. We focus on developing decompositional reasoning techniques for parallel contexts in that language.

  • 303.
    Aceto, Luca
    et al.
    ICE-TCS, School of Computer Science, Reykjavik University, Menntavegur 1, IS 101 Reykjavik, Iceland.
    Cimini, Matteo
    ICE-TCS, School of Computer Science, Reykjavik University, Menntavegur 1, IS 101 Reykjavik, Iceland.
    Ingolfsdottir, Anna
    ICE-TCS, School of Computer Science, Reykjavik University, Menntavegur 1, IS 101 Reykjavik, Iceland.
    Mousavi, Mohammad Reza
    Department of Computer Science, Eindhoven University of Technology, P.O. Box 513, NL-5600 MB Eindhoven, Netherlands.
    Reniers, Michel A.
    Department of Mechanical Engineering, Eindhoven University of Technology, P.O. Box 513, NL-5600 MB Eindhoven, Netherlands.
    Rule Formats for Distributivity2012Ingår i: Theoretical Computer Science, ISSN 0304-3975, E-ISSN 1879-2294, Vol. 458, 1-28 s.Artikel i tidskrift (Refereegranskat)
    Abstract [en]

    This paper proposes rule formats for Structural Operational Semantics guaranteeing that certain binary operators are left distributive with respect to a set of binary operators. Examples of left-distributivity laws from the literature are shown to be instances of the provided formats. Some conditions ensuring the invalidity of the left-distributivity law are also offered. © 2012 Elsevier B.V. All rights reserved.

  • 304.
    Aceto, Luca
    et al.
    ICE-TCS, School of Computer Science, Reykjavik University, Menntavegur 1, IS 101 Reykjavik, Iceland.
    Cimini, Matteo
    ICE-TCS, School of Computer Science, Reykjavik University, Menntavegur 1, IS 101 Reykjavik, Iceland.
    Ingolfsdottir, Anna
    ICE-TCS, School of Computer Science, Reykjavik University, Menntavegur 1, IS 101 Reykjavik, Iceland.
    Mousavi, Mohammad Reza
    Department of Computer Science, Eindhoven University of Technology, P.O. Box 513, NL-5600 MB Eindhoven, Netherlands.
    Reniers, Michel A.
    Department of Computer Science, Eindhoven University of Technology, P.O. Box 513, NL-5600 MB Eindhoven, Netherlands.
    SOS Rule Formats for Zero and Unit Elements2011Ingår i: Theoretical Computer Science, ISSN 0304-3975, E-ISSN 1879-2294, Vol. 412, nr 28, 3045-3071 s.Artikel i tidskrift (Refereegranskat)
    Abstract [en]

    This paper proposes rule formats for Structural Operational Semantics guaranteeing that certain constants act as left or right unit/zero elements for a set of binary operators. Examples of left and right zero, as well as unit, elements from the literature are shown to fit the rule formats offered in this study. © 2011 Elsevier B.V. All rights reserved.

  • 305.
    Aceto, Luca
    et al.
    ICE-TCS, School of Computer Science, Reykjavik University, Reykjavik, Iceland.
    Cimini, Matteo
    ICE-TCS, School of Computer Science, Reykjavik University, Reykjavik, Iceland.
    Ingólfsdóttir, Anna
    ICE-TCS, School of Computer Science, Reykjavik University, Reykjavik, Iceland.
    Mousavi, Mohammad Reza
    Department of Computer Science, Eindhoven University of Technology, Eindhoven, The Netherlands.
    Reniers, Michael A.
    Department of Computer Science, Eindhoven University of Technology, Eindhoven, The Netherlands.
    On Rule Formats for Zero and Unit Elements2010Rapport (Övrigt vetenskapligt)
    Abstract [en]

    This paper proposes a rule format for Structural Operational Semantics guaranteeing that certain constants act as left or right zero elements for a set of binary operators. Our design approach is also applied to reformulate an earlier rule format for unit elements developed by some of the authors. Examples of left and right zero, as well as unit, elements from the literature are shown to be checkable using the provided formats.

  • 306.
    Aceto, Luca
    et al.
    ICE-TCS, School of Computer Science, Reykjavik University, Reykjavik, Iceland.
    Cimini, Matteo
    ICE-TCS, School of Computer Science, Reykjavik University, Reykjavik, Iceland.
    Ingólfsdóttir, Anna
    ICE-TCS, School of Computer Science, Reykjavik University, Reykjavik, Iceland.
    Mousavi, Mohammad Reza
    Department of Computer Science, Eindhoven University of Technology, Eindhoven, The Netherlands.
    Reniers, Michael A.
    Department of Mechanical Engineering, Eindhoven University of Technology, Eindhoven, The Netherlands.
    Rule Formats for Distributivity2010Rapport (Övrigt vetenskapligt)
    Abstract [en]

    This paper proposes rule formats for Structural Operational Semantics guaranteeing that certain binary operators are left distributive with respect to a set of binary operators. Examples of left-distributivity laws from the literature are shown to be instances of the provided formats.

  • 307.
    Aceto, Luca
    et al.
    School of Computer Science, Reykjavik University, Iceland.
    Cimini, Matteo
    School of Computer Science, Reykjavik University, Iceland.
    Ingólfsdóttir, Anna
    School of Computer Science, Reykjavik University, Iceland.
    Mousavi, Mohammad Reza
    Department of Computer Science, Eindhoven University of Technology, P.O. Box 513, NL-5600 MB Eindhoven, Netherlands.
    Reniers, Michel A.
    Department of Mechanical Engineering, Eindhoven University of Technology, P.O. Box 513, NL-5600 MB Eindhoven, Netherlands.
    Rule Formats for Distributivity2011Ingår i: Language and Automata Theory and Applications: 5th International Conference : Proceedings / [ed] Adrian Horia Dediu, Heidelberg: Springer Berlin/Heidelberg, 2011, Vol. 6638, 79-90 s.Konferensbidrag (Refereegranskat)
    Abstract [en]

    This paper proposes rule formats for Structural Operational Semantics guaranteeing that certain binary operators are left distributive with respect to a set of binary operators. Examples of left-distributivity laws from the literature are shown to be instances of the provided formats. © 2011 Springer-Verlag.

  • 308.
    Aceto, Luca
    et al.
    Reykjavík University, Kringlan 1, IS-103, Reykjavík, Iceland.
    Fokkink, Wan
    Vrije Universiteit Amsterdam, NL-1081HV, The Netherlands.
    Ingólfsdóttir, Anna
    Reykjavík University, Kringlan 1, IS-103, Reykjavík, Iceland.
    Mousavi, Mohammad Reza
    Eindhoven University of Technology, NL-5600MB Eindhoven, The Netherlands.
    Lifting non-finite axiomatizability results to extensions of process algebras2008Ingår i: Fifth Ifip International Conference On Theoretical Computer Science – Tcs 2008 / [ed] Ausiello, G, Karhumaki, J, Mauri, G, Ong, L, New York: Springer-Verlag New York, 2008, Vol. 273, 301-316 s.Konferensbidrag (Refereegranskat)
    Abstract [en]

    This paper presents a general technique for obtaining new results pertaining to the non-finite axiomatizability of behavioral semantics over process algebras from old ones. The proposed technique is based on a variation on the classic idea of reduction mappings. In this setting, such reductions are translations between languages that preserve sound (in)equations and (in)equational proofs over the source language, and reflect families of (in)equations responsible for the non-finite axiomatizability of the target language. The proposed technique is applied to obtain a number of new non-finite axiomatizability theorems in process algebra via reduction to Moller’s celebrated non-finite axiomatizability result for CCS. The limitations of the reduction technique are also studied.

  • 309.
    Aceto, Luca
    et al.
    ICE-TCS, School of Computer Science, Reykjavik University, Reykjavik, Iceland.
    Fokkink, Wan J.
    Department of Computer Science, Vrije Universiteit Amsterdam, Amsterdam, The Netherlands.
    Ingólfsdóttir, Anna
    ICE-TCS, School of Computer Science, Reykjavik University, Reykjavik, Iceland.
    Mousavi, Mohammad Reza
    Department of Computer Science, Eindhoven University of Technology, Eindhoven, The Netherlands.
    Lifting non-finite axiomatizability results to extensions of process algebras2008Rapport (Övrigt vetenskapligt)
  • 310.
    Aceto, Luca
    et al.
    ICE-TCS, School of Computer Science, Reykjavik University, Reykjavik, Iceland.
    Goriac, Eugen-Ioan
    ICE-TCS, School of Computer Science, Reykjavik University, Reykjavik, Iceland.
    Ingolfsdottir, Anna
    ICE-TCS, School of Computer Science, Reykjavik University, Reykjavik, Iceland.
    Mousavi, Mohammad Reza
    Högskolan i Halmstad, Sektionen för Informationsvetenskap, Data– och Elektroteknik (IDE), Halmstad Embedded and Intelligent Systems Research (EIS), Centrum för forskning om inbyggda system (CERES).
    Reniers, Michel A.
    Department of Mechanical Engineering, Eindhoven University of Technology, Eindhoven, The Netherlands.
    Exploiting Algebraic Laws to Improve Mechanized Axiomatizations2013Ingår i: Algebra and Coalgebra in Computer Science: 5th International Conference, Calco 2013, Warsaw, Poland, September 2013, Proceedings, Berlin: Springer Berlin/Heidelberg, 2013, 36-50 s.Konferensbidrag (Refereegranskat)
    Abstract [en]

    In the field of structural operational semantics (SOS), there have been several proposals both for syntactic rule formats guaranteeing the validity of algebraic laws, and for algorithms for automatically generating ground-complete axiomatizations. However, there has been no synergy between these two types of results. This paper takes the first steps in marrying these two areas of research in the meta-theory of SOS and shows that taking algebraic laws into account in the mechanical generation of axiomatizations results in simpler axiomatizations. The proposed theory is applied to a paradigmatic example from the literature, showing that, in this case, the generated axiomatization coincides with a classic hand-crafted one. © 2013 Springer-Verlag Berlin Heidelberg.

  • 311.
    Aceto, Luca
    et al.
    School of Computer Science, Reykjavík University, Kringlan 1, 103 Reykjavík, Iceland.
    Ingólfsdóttir, A.
    School of Computer Science, Reykjavík University, Kringlan 1, 103 Reykjavík, Iceland.
    Mousavi, Mohammad Reza
    Department of Computer Science, Eindhoven University of Technology, 5600 MB Eindhoven, Netherlands.
    Reniers, M. A.
    Algebraic properties for free!2009Ingår i: Bulletin of the European Association for Theoretical Computer Science, ISSN 0252-9742, Vol. 99, 81-103 s.Artikel i tidskrift (Refereegranskat)
    Abstract [en]

    Algebraic properties specify some natural properties of programming and specification constructs. This paper provides an overview of techniques to guarantee or generate algebraic properties of language constructs by investigating the syntactic shape of the deduction rules defining their operational semantics.

  • 312.
    Aceto, Luca
    et al.
    Department of Computer Science, Reykjavík University, Kringlan 1, IS-103, Reykjavík, Iceland.
    Ingólfsdóttir, Anna
    Department of Computer Science, Reykjavík University, Kringlan 1, IS-103, Reykjavík, Iceland.
    Mousavi, Mohammad Reza
    Department of Computer Science, Reykjavík University, Kringlan 1, IS-103, Reykjavík, Iceland.
    Impossibility results for the equational theory of timed CCS2007Ingår i: Algebra and Coalgebra in Computer Science: Second International Conference, CALCO 2007, Bergen, Norway, August 20-24, 2007. Proceedings, Berlin: Springer Berlin/Heidelberg, 2007, Vol. 4624, 80-95 s.Konferensbidrag (Refereegranskat)
    Abstract [en]

    We study the equational theory of Timed CCS as proposed by Wang Yi in CONCUR'90. Common to Wang Yi's paper, we particularly focus on a class of linearly-ordered time domains exemplified by the positive real or rational numbers. We show that, even when the set of basic actions is a singleton, there are parallel Timed CCS processes that do not have any sequential equivalent and thus improve on the Gap Theorem for Timed CCS presented by Godskesen and Larsen in FSTTCS'92. Furthermore, we show that timed bisimilarity is not finitely based both for single-sorted and two-sorted presentations of Timed CCS. We further strengthen this result by showing that, unlike in some other process algebras, adding the untimed or the timed left-merge operator to the syntax and semantics of Timed CCS does not solve the axiomatizability problem.

  • 313.
    Aceto, Luca
    et al.
    ICE-TCS, School of Computer Science, Reykjavik University Kringlan 1, IS-103 Reykjavik, Iceland.
    Ingólfsdóttir, Anna
    ICE-TCS, School of Computer Science, Reykjavik University Kringlan 1, IS-103 Reykjavik, Iceland.
    Mousavi, Mohammad Reza
    Department of Computer Science, Eindhoven University of Technology P.O. Box 513, NL-5600 MB Ei ndhoven, The Netherlands.
    Reniers, Michel A.
    Department of Computer Science, Eindhoven University of Technology P.O. Box 513, NL-5600 MB Ei ndhoven, The Netherlands.
    A rule format for unit elements2010Ingår i: SOFSEM 2010: Theory and Practice of Computer Science: Proceedings / [ed] VanLeeuwen, J, Muscholl, A, Peleg, D, Pokorny, J, Rumpe, B, Berlin: Springer Berlin/Heidelberg, 2010, Vol. 5901, 141-152 s.Konferensbidrag (Refereegranskat)
    Abstract [en]

    This paper offers a meta-theorem for languages with a Structural Operational Semantics (SOS) in the style of Plotkin. Namely, it proposes a generic rule format for SOS guaranteeing that certain constants act as left- or right-unit elements for a set of binary operators. We show the generality of our format by applying it to a wide range of operators from the literature on process calculi.

  • 314.
    Aceto, Luca
    et al.
    ICE-TCS, School of Computer Science, Reykjavik University, Reykjavik, Iceland.
    Ingólfsdóttir, Anna
    ICE-TCS, School of Computer Science, Reykjavik University, Reykjavik, Iceland.
    Mousavi, Mohammad Reza
    Department of Computer Science, Eindhoven University of Technology, Eindhoven, The Netherlands.
    Reniers, Michel A.
    Department of Computer Science, Eindhoven University of Technology, Eindhoven, The Netherlands.
    A Rule Format for Unit Elements2009Rapport (Övrigt vetenskapligt)
    Abstract [en]

    This paper offers a meta-theorem for languages with a Structural Operational Semantics (SOS) in the style of Plotkin. Namely, it proposes a generic rule format for SOS guaranteeing that certain constants act as left- or right-unit elements for a set of binary operators. We show the generality of our format by applying it to a wide range of operators from the literature on process calculi.

  • 315. Aceto, Luca
    et al.
    Longo, GiuseppeVictor, BjörnUppsala universitet, Teknisk-naturvetenskapliga vetenskapsområdet, Matematisk-datavetenskapliga sektionen, Institutionen för informationsteknologi, Datalogi.
    The difference between concurrent and sequential computation2003Samlingsverk (redaktörskap) (Övrig (populärvetenskap, debatt, mm))
  • 316.
    Aceto, Luca
    et al.
    Reykjavik University, Reykjavik, Iceland.
    Mousavi, Mohammad RezaEindhoven University of Technology, Eindhoven, The Netherlands.
    Proceedings First International Workshop on Process Algebra and Coordination2011Proceedings (redaktörskap) (Övrigt vetenskapligt)
    Abstract [en]

    Process algebra provides abstract and rigorous means for studying communicating concurrent systems. Coordination languages also provide abstract means for the specifying and programming communication of components. Hence, the two fields seem to have very much in common and the link between these two research areas have been established formally by means of several translations, mainly from coordination languages to process algebras. There have also been proposals of process algebras whose communication policy is inspired by the one underlying coordination languages. The aim of this workshop was to push the state of the art in the study of the connections between process algebra and coordination languages by bringing together experts as well as young researchers from the two fields to communicate their ideas and findings. It includes both contributed and invited papers that have been presented during the one day meeting on Process Algebra and Coordination (PACO 2011) which took place on June 9, 2011 in Reykjavik, Iceland.

  • 317. Aceto, Luca
    et al.
    Victor, BjörnUppsala universitet, Teknisk-naturvetenskapliga vetenskapsområdet, Matematisk-datavetenskapliga sektionen, Institutionen för informationsteknologi, Datalogi.
    EXPRESS'00: 7th International Workshop on Expressiveness in Concurrency2000Konferensmeddelanden, proceedings (Övrigt vetenskapligt)
  • 318.
    Acharya, Jaldeep
    et al.
    KTH, Skolan för datavetenskap och kommunikation (CSC).
    Fröberg, Ludvig
    KTH, Skolan för datavetenskap och kommunikation (CSC).
    A comparison of interfaces in choice driven games: Investigating possible future applications of NLIs in choice driven games by comparing a menu- based interface with an NLI in a text-based game2016Självständigt arbete på grundnivå (kandidatexamen), 10 poäng / 15 hpStudentuppsats (Examensarbete)
    Abstract [en]

    Natural language processing has for a long time been a field of research and has been regarded as a thing of the future. Due to its complexity it stopped being featured in computer games in the early 2000s. It has however had a recent revival as a consequence of advancements made in speech recognition, making the possible applications of natural language processing much larger. One market that hasn’t seen much in the way of natural language interfaces recently is that of computer games. This report covers the basics of natural language processing needed to implement two versions of a simple text-based adventure game, one with a menu-based interface and one with a natural lan- guage interface. These were then played by a test group from which usability statistics were gathered to determine if it is likely that NLP will find its way back in to choice driven games in the future.

    The results showed that even though the menu-based interface has a faster rate of progression, the NLI version of the game was perceived as more enjoyable by users with experience in gaming. The reason being that the NLI al- lowed for more thinking on the user’s part and therefore the game presented a greater challenge, something that is perceived as attractive by users with experience in com- puter games. Also the measured usability was roughly the same for both interfaces while it was feared that it would be much lower for NLIs. Therefore, the conclusion was that it is highly plausible that NLI will find its way back into the gaming world, since it adds a new dimension to adventure games, which is something that attracts users. However, this is given that NLP development continues in the same fast pace as it is today, making it possible to implement a more accurate NLI. 

  • 319.
    Acharya, Mod Nath
    et al.
    Blekinge Tekniska Högskola, Sektionen för datavetenskap och kommunikation.
    Aslam, Nazam
    Blekinge Tekniska Högskola, Sektionen för datavetenskap och kommunikation.
    Coordination in Global Software Development: Challenges, associated threats, and mitigating practices2012Självständigt arbete på avancerad nivå (masterexamen)Studentuppsats (Examensarbete)
    Abstract [en]

    Global Software Development (GSD) is an emerging trend in today's software world in which teams are geographically dispersed, either in close proximity or globally. GSD provides certain advantages to development companies like low development cost, access to cheap and skilled labour etc. This type of development is noted as a more risky and challenging as compared to projects developed with teams under same roof. Inherently the nature of GSD projects are cooperative in which many software developers work on a common project, share information and coordinate activities. Coordination is a fundamental part of software development. GSD comprises different types of development systems i.e. insourcing, outsourcing, nearshoring, or farshoring, whatever the types of development systems selected by a company there exist the challenges to coordination. Therefore the knowledge of potential challenges, associated threats to coordination and practices to mitigate them plays a vital role for running a successful global project.

  • 320.
    Acharya, Soam
    et al.
    Cornell University, Ithaca.
    Smith, Brian P
    Cornell University, Ithaca.
    Parnes, Peter
    Luleå tekniska universitet, Institutionen för system- och rymdteknik, Datavetenskap.
    Characterizing user access to videos on the World Wide Web1999Ingår i: Multimedia computing and networking 2000 / [ed] Klara Nahrstedt, Bellingham, Wash: SPIE - International Society for Optical Engineering, 1999, 130-141 s.Konferensbidrag (Refereegranskat)
    Abstract [en]

    Despite evidence of rising popularity of video on the web (or VOW), little is known about how users access video. However, such a characterization can greatly benefit the design of multimedia systems such as web video proxies and VOW servers. Hence, this paper presents an analysis of trace data obtained from an ongoing VOW experiment in Lulea University of Technology, Sweden. This experiment is unique as video material is distributed over a high bandwidth network allowing users to make access decisions without the network being a major factor. Our analysis revealed a number of interesting discoveries regarding user VOW access. For example, accesses display high temporal locality: several requests for the same video title often occur within a short time span. Accesses also exhibited spatial locality of reference whereby a small number of machines accounted for a large number of overall requests. Another finding was a browsing pattern where users preview the initial portion of a video to find out if they are interested. If they like it, they continue watching, otherwise they halt it. This pattern suggests that caching the first several minutes of video data should prove effective. Lastly, the analysis shows that, contrary to previous studies, ranking of video titles by popularity did not fit a Zipfian distribution.

  • 321.
    Acheampong, Faustina
    Högskolan i Jönköping, Internationella Handelshögskolan, IHH, Informatik.
    Development of Web-based Health Care Services in Swedish County Councils: Strategies, Usage and Challenges2010Självständigt arbete på avancerad nivå (masterexamen), 20 poäng / 30 hpStudentuppsats (Examensarbete)
    Abstract [en]

    eHealth has been adopted by many countries across the globe in response to cut down cost and improve the quality of life. Sweden has been engaged in providing web-based health care services for its citizens for the past decade and county councils have the responsibility to develop them. The main aim of this thesis is to present answers to the following research questions:What strategies (formal and informal) guide the development of web-based health care services provided by the Swedish county councils?What barriers exist in relation to the development and usage of web-based health care services provided by the county councils from the viewpoint of their IT leaders?From the perspective of IT leaders in the county councils and in their capacity to develop, manage and monitor their organizations‘ website content, which web-based health care services are mostly accessed by users and what age group utilize the services most?The thesis is an exploratory research conducted through a survey based on a mail questionnaire that was posted to all 21 county councils in Sweden with 18 councils responding. The results show that all county councils have formally adopted the National eHealth Strategy to guide the development of web-based health care services and some have other informal strategies as well. Technological barriers, resistance to use the web-based services and changing business process to integrate ICTs have been identified by IT leaders as major challenges that impede the development of web-based health care services in Swedish county councils. Swedish citizens more frequently access prescription renewal and booking and cancellation of appointments than other available web-based health care services which depicts a trend towards the use of advanced interactive services than basic information seeking, and people in the ages of 46 to 55 have been identified as the frequent users of web-based health care services according to IT leaders from the county councils.

  • 322.
    Acheampong, Faustina
    et al.
    Högskolan i Jönköping, Internationella Handelshögskolan, IHH, Informatik.
    Vimarlund, Vivian
    Högskolan i Jönköping, Internationella Handelshögskolan, IHH, Informatik. Högskolan i Jönköping, Internationella Handelshögskolan, IHH, Centre for Information Technology and Information Systems (CenITIS).
    Business models for telemedicine services: A literature review2015Ingår i: Health Systems, ISSN 2047-6965, E-ISSN 2047-6973, Vol. 4, nr 3, 189-203 s.Artikel i tidskrift (Refereegranskat)
    Abstract [en]

    Telemedicine has been acknowledged to improve the quality of healthcare. However, many telemedicine services fail beyond the pilot phase. A literature review on business model components for telemedicine services was conducted. Based on specified inclusion criteria, 22 publications were included in the review. To facilitate the analysis of literature, a business model framework with value as its central focus was proposed. Improvement in quality, efficiency and accessibility of care were identified to be the outcomes of telemedicine, with patients and healthcare personnel being the main users of the services, which are delivered through home, institutional and community-based care. Patients, health providers, vendors, payers and government agencies are actors involved in the delivery of telemedicine services, which require investments in resources like videoconferencing technologies, home monitoring devices and other IT infrastructure. Subscriptions, reimbursements and pay-per-use revenue streams were identified as feasible for commercializing telemedicine services.

  • 323.
    Acheampong, Faustina
    et al.
    Högskolan i Jönköping, Internationella Handelshögskolan, IHH, Informatik.
    Vimarlund, Vivian
    Högskolan i Jönköping, Internationella Handelshögskolan, IHH, Informatik.
    Effects of a Home-based Monitoring Device on Innovation in Healthcare Delivery: A Pilot Study2013Ingår i: Information Systems and Technology for Organizations in a Networked Society / [ed] Tomayess Issa, Pedro Isaias and Piet Kommers, Hershey, PA, USA: IGI Global, 2013, 316-334 s.Kapitel i bok, del av antologi (Refereegranskat)
    Abstract [en]

    Information technology has been suggested to improve patient health outcomes and reduce the burden of care. In this study, we explored the effects of collaborative innovation between caregivers and patients on healthcare delivery as a consequence of the use of an IT-based device by patients with atrial fibrillation. Two cardiologists and two nurses were interviewed while questionnaires were mailed to 75 patients querying them about the use of a home-based ECG for remote monitoring. Findings indicated that the caregivers considered the device to enhance the quality of clinical decision-making. Patients found the device to be useful and felt more involved in their own care. However, the introduction of the device presented work overload for the caregivers. Thus, the facilitation of timely diagnostics and decision-making were not realized. IT is an enabler through which innovation in healthcare delivery can be realized, but it must be integrated into work practices to realize potential benefits.

  • 324.
    Achichi, Manel
    et al.
    LIRMM/University of Montpellier, France.
    Cheatham, Michelle
    Wright State University, USA.
    Dragisic, Zlatan
    Linköpings universitet, Institutionen för datavetenskap, Databas och informationsteknik. Linköpings universitet, Tekniska högskolan.
    Euzenat, Jerome
    INRIA & Univ. Grenoble Alpes, Grenoble, France.
    Faria, Daniel
    Instituto Gulbenkian de Ciencia, Lisbon, Portugal.
    Ferrara, Alfio
    Universita degli studi di Milano, Italy.
    Flouris, Giorgos
    Institute of Computer Science-FORTH, Heraklion, Greece.
    Fundulaki, Irini
    Institute of Computer Science-FORTH, Heraklion, Greece.
    Harrow, Ian
    Pistoia Alliance Inc., USA.
    Ivanova, Valentina
    Linköpings universitet, Institutionen för datavetenskap, Databas och informationsteknik. Linköpings universitet, Tekniska högskolan.
    Jiménez-Ruiz, Ernesto
    University of Oslo, Norway and University of Oxford, UK.
    Kuss, Elena
    University of Mannheim, Germany.
    Lambrix, Patrick
    Linköpings universitet, Institutionen för datavetenskap, Databas och informationsteknik. Linköpings universitet, Tekniska högskolan.
    Leopold, Henrik
    Vrije Universiteit Amsterdam, The Netherlands.
    Li, Huanyu
    Linköpings universitet, Institutionen för datavetenskap, Databas och informationsteknik. Linköpings universitet, Tekniska fakulteten.
    Meilicke, Christian
    University of Mannheim, Germany.
    Montanelli, Stefano
    Universita degli studi di Milano, Italy.
    Pesquita, Catia
    Universidade de Lisboa, Portugal.
    Saveta, Tzanina
    Institute of Computer Science-FORTH, Heraklion, Greece.
    Shvaiko, Pavel
    TasLab, Informatica Trentina, Trento, Italy.
    Splendiani, Andrea
    Novartis Institutes for Biomedical Research, Basel, Switzerland.
    Stuckenschmidt, Heiner
    University of Mannheim, Germany.
    Todorov, Konstantin
    LIRMM/University of Montpellier, France.
    Trojahn, Cassia
    IRIT & Universit ́ e Toulouse II, Toulouse, France.
    Zamazal, Ondřej
    University of Economics, Prague, Czech Republic.
    Results of the Ontology Alignment Evaluation Initiative 20162016Ingår i: Proceedings of the 11th International Workshop on Ontology Matching, Aachen, Germany: CEUR Workshop Proceedings , 2016, 73-129 s.Konferensbidrag (Refereegranskat)
  • 325. Achilleos, Antonis
    et al.
    Lampis, Michael
    City University of New York.
    Mitsou, Valia
    Parameterized Modal Satisfiability2010Ingår i: ICALP 2010, Bordeaux, France, July 6-10, 2010, Proceedings, Part II, 2010, 369-380 s.Konferensbidrag (Refereegranskat)
    Abstract [en]

    We investigate the parameterized computational complexity of the satisfiability problem for modal logic and attempt to pinpoint relevant structural parameters which cause the problem’s combinatorial explosion, beyond the number of propositional variables v. To this end we study the modality depth, a natural measure which has appeared in the literature, and show that, even though modal satisfiability parameterized by v and the modality depth is FPT, the running time’s dependence on the parameters is a tower of exponentials (unless P=NP). To overcome this limitation we propose possible alternative parameters, namely diamond dimension and modal width. We show fixed-parameter tractability results using these measures where the exponential dependence on the parameters is much milder (doubly and singly exponential respectively) than in the case of modality depth thus leading to FPT algorithms for modal satisfiability with much more reasonable running times. We also give lower bound arguments which prove that our algorithms cannot be improved significantly unless the Exponential Time Hypothesis fails.

  • 326. Achilleos, Antonis
    et al.
    Lampis, Michail
    City University of New York.
    Mitsou, Valia
    Parameterized Modal Satisfiability2012Ingår i: Algorithmica, ISSN 0178-4617, E-ISSN 1432-0541, Vol. 64, nr 1, 38-55 s.Artikel i tidskrift (Refereegranskat)
    Abstract [en]

    We investigate the parameterized computational complexity of the satisfiability problem for modal logic and attempt to pinpoint relevant structural parameters which cause the problem’s combinatorial explosion, beyond the number of propositional variables v. To this end we study the modality depth, a natural measure which has appeared in the literature, and show that, even though modal satisfiability parameterized by v and the modality depth is FPT, the running time’s dependence on the parameters is a tower of exponentials (unless P=NP). To overcome this limitation we propose pos- sible alternative parameters, namely diamond dimension and modal width. We show fixed-parameter tractability results using these measures where the exponential dependence on the parameters is much milder (doubly and singly exponential respectively) than in the case of modality depth thus leading to FPT algorithms for modal satisfiability with much more reasonable running times. We also give lower bound arguments which prove that our algorithms cannot be improved significantly unless the Exponential Time Hypothesis fails.

  • 327.
    Achu, Denis
    Linköpings universitet, Institutionen för datavetenskap.
    Application of Gis in Temporal and Spatial Analyses of Dengue Fever Outbreak: Case of Rio de Janeiro, Brazil2009Självständigt arbete på avancerad nivå (masterexamen), 20 poäng / 30 hpStudentuppsats
    Abstract [en]

    Since Dengue fever (DF) and its related forms, Dengue Hemorrhagic fever (DHF) and Dengue Shock Syndrome (DSS) have become important health concerns worldwide, it is also imperative to develop methods which will help in the analysis of the incidences. Dengue fever cases are growing in number as it also invades widely, affecting larger number of countries and crossing climatic boundaries. Considering that the disease as of now has neither an effective vaccine nor a cure, monitoring in order to prevent or control is the resorted alternative. GIS and its related technologies offer a wealth of interesting capabilities towards achieving this goal.

    The intention of this study was to develop methods to describe dengue fever outbreaks taking Rio de Janeiro, Brazil as a case study. Careful study of Census data with appropriate attributes was made to find out their potential influence on dengue fever incidence in the various regions or census districts. Dengue incidence data from year 2000 to year 2008 reported by the municipal secretariat of Rio was used to extract the necessary census districts. Base map files in MapInfo format were converted to shape files.  Using ArcGIS it was possible to merge the dengue fever incidence data with the available base map file of the City of Rio according to corresponding census districts. Choropleth maps were then created using different attributes from which patterns and trends could be used to describe the characteristic of the outbreak with respect to the socio-economic conditions. Incidence data were also plotted in Excel to see temporal variations. Cluster analysis were performed with the Moran I technique on critical periods and years of dengue outbreak. Using the square root of dengue incidence from January to April 2002 and 2008, inverse distance was selected as the conceptualised spatial relationship, Euclidean distance as the distance method. More detailed analyses were then done on the selected critical years of dengue outbreak, (years 2002 and 2008), to investigate the influence of socio-economic variables on dengue incidence per census district.

     

    Dengue incidence rate appeared to be higher during the rainy and warmer months between December and May. Outbreaks of dengue occurred in years 2002 and 2008 over the study period of year 2000 to 2008. Some factors included in the census data were influential in the dengue prevalence according to districts. Satisfactory results can be achieved by using this strategy as a quick method for assessing potential dengue attack, spread and possible enabling conditions. The method has the advantage where there is limited access to field work, less financial means for acquisition of data and other vital resources.

    A number of difficulties were encountered during the study however and leaves areas where further work can be done for improvements. More variables would be required in order to make a complete and comprehensive description of influential conditions and factors.  There is still a gap in the analytical tools required for multi-dimensional investigations as the ones encountered in this study.  It is vital to integrate ‘GPS’ and ‘Remote Sensing’ in order to obtain a variety of up-to-date data with higher resolution.

     

  • 328.
    Acin, Medya
    et al.
    KTH, Skolan för datavetenskap och kommunikation (CSC).
    Stansvik, Elvis
    KTH, Skolan för datavetenskap och kommunikation (CSC).
    Improving Player Engagement inTetris Through EDR Monitoring2013Självständigt arbete på grundnivå (kandidatexamen), 10 poäng / 15 hpStudentuppsats (Examensarbete)
    Abstract [sv]

    I utformningen av datorspel är man ofta intresserad av att väcka känslor av

    engagemang, njutning och utmaning hos spelaren. Ett sätt att göra detta är

    att dynamiskt justera svårigheten i spelet. Detta har traditionellt gjorts genom

    att man låter svårigheten baseras på spelarens prestation. Under senare år har

    dock intresset ökat för tekniker där man låter svårigheten variera baserat på

    fysiologiska signaler från spelaren. I detta kandidatexamensprojekt har vi studerat

    effekten av att låta signalerna från en sensor för elektrodermal aktivitet

    (EDA) utgöra indatan till en algoritm för anpassning av spelsvårighet och jämfört

    detta med den traditionella prestandabaserade svårighetsanpassningen. Vi

    utvecklade två Tetrisspel, ett EDA-kontrollerat och ett prestandakontrollerat,

    och lät deltagare spela båda versionerna. Varje spelsession åtföljdes av en enkät.

    Vårt resultat visar att, trots att deltagarna rapporterade en ökad känsla av

    engagemang och utmaning när de spelade EDA-versionen, så krävs ytterligare

    forskning för att EDA ska kunna anses användbart i detta sammanhang.

  • 329.
    Ackfjärd, Rickard
    et al.
    Örebro universitet, Handelshögskolan vid Örebro Universitet.
    Karlsson, Mattias
    Örebro universitet, Handelshögskolan vid Örebro Universitet.
    Förslag till ett nytt ramverk för utvärdering och utveckling av ARP-poisoning-skydd2016Självständigt arbete på grundnivå (kandidatexamen), 10 poäng / 15 hpStudentuppsats (Examensarbete)
  • 330.
    Ackland, Patrik
    KTH, Skolan för datavetenskap och kommunikation (CSC).
    Fast and Scalable Static Analysis using Deterministic Concurrency2017Självständigt arbete på avancerad nivå (masterexamen), 20 poäng / 30 hpStudentuppsats (Examensarbete)
    Abstract [sv]

    Detta examensarbete presenterar en algoritm för att lösa en klass av problem i statisk analys känd som Interprocedural Finite Distribute Subset problem.  Algoritmen, IFDS-RA, är en implementation av IFDS algoritmen som är utvecklad för att lösa denna typ av problem. IFDS-RA använder sig av Reactive Async som är en deterministisk programmeringsmodell för samtida exekvering av program.  Prestendan evalueras genom att mäta exekveringstid för tre stycken taint analyser med en till åtta processorkärnor och jämförs med state-of-the-art implementationen Heros. Resultaten visar att IFDS-RA presterar bättre än Heros när de använder sig av flera processorkärnor samt att Heros inte använder sig av flera processorkärnor även om de finns tillgängliga.

  • 331. Acx, A. G.
    et al.
    Berg, M
    Karlsson, M
    Lindström, M
    Pettersson, Stefan
    Mittuniversitetet, Fakulteten för naturvetenskap, teknik och medier, Institutionen för informationsteknologi och medier.
    Slanina, P
    Zander, J
    Radio Resource Management2000Ingår i: Third generation mobile communication systems, Boston, Mass: Artech House, 2000, 386- s.Kapitel i bok, del av antologi (Övrigt vetenskapligt)
  • 332.
    Adaba, Godfried Bakiyem
    et al.
    Birkbeck, University of London, , Department of Computer Science and Information Systems.
    Rusu, Lazar
    Stockholms universitet, Samhällsvetenskapliga fakulteten, Institutionen för data- och systemvetenskap.
    E-trade Facilitation in Ghana: a Capability Approach Perspective2014Ingår i: Electronic Journal of Information Systems in Developing Countries, ISSN 1681-4835, E-ISSN 1681-4835, Vol. 63, nr 5, 1-13 s.Artikel i tidskrift (Refereegranskat)
  • 333. Adaba, Godfried Bakiyem
    et al.
    Rusu, Lazar
    Stockholms universitet, Samhällsvetenskapliga fakulteten, Institutionen för data- och systemvetenskap.
    ICT-based trade facilitation and the MDGs: a case study of a public–private partnership in Ghana2014Ingår i: ICTs and the Millennium Development Goals: a United Nations Perspective, Springer, 2014, nr 2013, 223-235 s.Kapitel i bok, del av antologi (Övrigt vetenskapligt)
    Abstract [en]

    The strategic and innovative deployment and use of information and communication technologies (ICT) is important to development and the attainment of the millennium development goals (MDGs). Previous studies have suggested that ICT-based trade facilitation promotes development through better integration into global markets. Through an interpretive case study, this chapter explores an ICTbased initiative to connect members of the trading community in Ghana on an electronic data interchange (EDI) platform. More specifi cally, it explored the contributions of the initiative to effi cient trade facilitation and discusses the broader mplications for achieving the MDGs in Ghana. The research confi rms that the initiative has improved operational effi ciency at Ghana’s ports and borders. Furthermore, it has enabled effi cient and reliable collection of duties and taxes. The findings reinforce the view that government support and private sector expertise and funding are important factors in ICT-based e-government solutions in developing countries. The chapter contends that ICT-based trade facilitation can make a significant contribution to the attainment of the MDGs in Ghana.

  • 334. Adaba, Godfried Bakiyem
    et al.
    Rusu, Lazar
    Stockholms universitet, Samhällsvetenskapliga fakulteten, Institutionen för data- och systemvetenskap.
    IT Governance Practices in a Public Organization in Ghana2014Ingår i: International Journal of Innovation in the Digital Economy, ISSN 1947-8305, E-ISSN 1947-8313, Vol. 5, nr 2, 14-23 s.Artikel i tidskrift (Refereegranskat)
    Abstract [en]

    The strategic importance of information technology (IT) in today's organizations and dependence on IT to support e-government strategies has increased the interest in IT Governance (ITG) in public sector organizations. From this perspective, this paper examines ITG practices in a public organization in Ghana (that has a responsibility to mobilize revenue for national development) in order to gain an insight into IT governance structures, processes and relational mechanisms and understand how this contributes to adding value through IT. The findings have revealed that this public organization has a centralized approach to IT governance, with inadequate board involvement concerning how IT investments can bring value and improve organizational performance. Furthermore, there are no IT steering and strategy committees to oversee IT governance as best practice requires.

  • 335.
    Adaba, Godfried Bakiyem
    et al.
    Stockholms universitet, Samhällsvetenskapliga fakulteten, Institutionen för data- och systemvetenskap.
    Rusu, Lazar
    Stockholms universitet, Samhällsvetenskapliga fakulteten, Institutionen för data- och systemvetenskap.
    El Mekawy, Mohamed Sobih Aly
    Stockholms universitet, Samhällsvetenskapliga fakulteten, Institutionen för data- och systemvetenskap.
    Business-IT Alignment in Trade Facilitation: A Case Study2010Ingår i: Organizational, Business, and Technological Aspects of the Knowledge Society / [ed] Lytras, M.D.; Ordonez De Pablos, P.; Ziderman, A.; Roulstone, A.; Maurer, H.; Imber, J.B., Berlin Heidelberg: Springer-Verlag , 2010, Vol. 112, 146- s.Konferensbidrag (Övrigt vetenskapligt)
    Abstract [en]

    In the information age, no organization can thrive without harnessing the power of IT. The effective deployment of IT to achieve business goals and gain competitive advantage requires the alignment of business and IT strategies of organizations. Using the Strategic Alignment Maturity model, this paper evaluates strategic alignment maturity of Customs Excise Preventive service, a frontline public organization charged with trade facilitation in Ghana. Strategic alignment maturity is at level 3; which implies the existence of an established process to leverage IT for efficiency and effectiveness. Efforts are required to strengthen alignment and fully harness the potential of IT to facilitate trade in Ghana.

  • 336.
    Adam, Elena Daniela
    Högskolan i Jönköping, Internationella Handelshögskolan, IHH, Informatik.
    Knowledge management cloud-based solutions in small enterprises2015Självständigt arbete på avancerad nivå (masterexamen), 30 poäng / 45 hpStudentuppsats (Examensarbete)
    Abstract [en]

    Purpose – The aim of this study is to determine if adopting cloud-based knowledge management is a viable way forward for small enterprises and to investigate what are the main factors that might facilitate or inhibit these companies to adopt such solutions.Design/Methodology/Approach - In order to understand the main factors that could influence the adoption of a cloud-based knowledge management solution in small enterprises, I used a qualitative research approach, based on four semi-structured interviews with four small companies from Romania.Findings – The results of the study suggest that implementing knowledge management in the cloud is particularly beneficial for small enterprises, as a lower investment in IT infra-structure can create a competitive advantage and help them implement knowledge man-agement activities as a strategic resource. Moreover, the study suggests that relative ad-vantage, compatibility and technology readiness will influence companies in moving their knowledge to the cloud. Also, the study reveals that companies which did not adopt such a solution had already established systems for managing knowledge and failed to realize its benefits, it was not perceived as needed, they had a low level of awareness or cited security and uncertainty reasons.

  • 337.
    Adamala, Szymon
    et al.
    Blekinge Tekniska Högskola, Sektionen för management.
    Cidrin, Linus
    Blekinge Tekniska Högskola, Sektionen för management.
    Key Success Factors in Business Intelligence2011Självständigt arbete på avancerad nivå (magisterexamen)Studentuppsats (Examensarbete)
    Abstract [en]

    Business Intelligence can bring critical capabilities to an organization, but the implementation of such capabilities is often plagued with problems and issues. Why is it that certain projects fail, while others succeed? The theoretical problem and the aim of this thesis is to identify the factors that are present in successful Business Intelligence projects and organize them into a framework of critical success factors. A survey was conducted during the spring of 2011 to collect primary data on Business Intelligence projects. It was directed to a number of different professionals operating in the Business Intelligence field in large enterprises, primarily located in Poland and primarily vendors, but given the similarity of Business Intelligence initiatives across countries and increasing globalization of large enterprises, the conclusions from this thesis may well have relevance and be applicable for projects conducted in other countries. Findings confirm that Business Intelligence projects are wrestling with both technological and nontechnological problems, but the non-technological problems are found to be harder to solve as well as more time consuming than their technological counterparts. The thesis also shows that critical success factors for Business Intelligence projects are different from success factors for IS projects in general and Business Intelligences projects have critical success factors that are unique to the subject matter. Major differences can be predominately found in the non-technological factors, such as the presence of a specific business need to be addressed by the project and a clear vision to guide the project. Results show that successful projects have specific factors present more frequently than nonsuccessful. Such factors with great differences are the type of project funding, business value provided by each iteration of the project and the alignment of the project to a strategic vision for Business Intelligence. Furthermore, the thesis provides a framework of critical success factors that, according to the results of the study, explains 61% of variability of success of projects. Given these findings, managers responsible for introducing Business Intelligence capabilities should focus on a number of non-technological factors to increase the likelihood of project success. Areas which should be given special attention are: making sure that the Business Intelligence solution is built with end users in mind, that the Business Intelligence solution is closely tied to company‟s strategic vision and that the project is properly scoped and prioritized to concentrate on best opportunities first. Keywords: Critical Success Factors, Business Intelligence, Enterprise Data Warehouse Projects, Success Factors Framework, Risk Management

  • 338.
    Adamou, Sofia
    et al.
    Linnéuniversitetet, Fakulteten för teknik (FTK), Institutionen för informatik (IK).
    Ntoka, Lamprini
    Linnéuniversitetet, Fakulteten för teknik (FTK), Institutionen för informatik (IK).
    The impact of Digital Technologies on Academic Libraries: a study in Greece2017Självständigt arbete på avancerad nivå (masterexamen), 80 poäng / 120 hpStudentuppsats (Examensarbete)
    Abstract [en]

    Purpose: This study explores both library users’ and librarians’ experiences, benefits, and challenges depending on the implementation of digital technologies in academic libraries. The research has been taken place in two Greek academic libraries; In the Panteion University Library and in the Central Library of T.E.I. of Athens.Approach: Two research questions were developed for this research to be conducted and a sample size of 55 respondents (39 library users and 16 librarians) of the Panteion University Library and Central Library of T.E.I. of Athens, was evaluated.Findings: From the findings of the study, it was concluded that the general perception of both library users and librarians towards digital material and E-resources and services of the Panteion University Library and Central Library of T.E.I. of Athens, is satisfactory. Library users were satisfied with the convenience of digital material, the availability of E-resources provided by both academic libraries such as World Wide Web, WIFI, and online databases. They were not satisfied with library technology (i.e., computers) and library staff. Besides, results showed that services such as e-mail and Open Public Access Catalogue were used more often. Librarians were less satisfied with the digital library system, the limited personnel, and the financial funds for academic libraries in general.Implication: The results of this research have implications in the stakeholders of an academic library including the institutional management, the library administration, the librarians, the library users, the researchers, the community at large, and others.Value: This paper identifies critical issues related to the utilization of digital technologies and digital material; their benefits and challenges faced by librarians and library users as well as their effective operation from academic libraries in this information age.

  • 339.
    Adamov, Alexander
    et al.
    Kharkiv Natl Univ Radio Elect, NioGuard Secur Lab, Kharkov, Kharkiv Oblast, Ukraine..
    Carlsson, Anders
    Blekinge Tekniska Högskola, Fakulteten för datavetenskaper, Institutionen för kommunikationssystem.
    A Sandboxing Method to Protect Cloud Cyberspace2015Ingår i: PROCEEDINGS OF 2015 IEEE EAST-WEST DESIGN & TEST SYMPOSIUM (EWDTS), IEEE Communications Society, 2015Konferensbidrag (Refereegranskat)
    Abstract [en]

    This paper addresses the problem of protecting cloud environments against targeted attacks, which have become a popular mean of gaining access to organization's confidential information and resources of cloud providers. Only in 2015 eleven targeted attacks have been discovered by Kaspersky Lab. One of them - Duqu2 - successfully attacked the Lab itself. In this context, security researchers show rising concern about protecting corporate networks and cloud infrastructure used by large organizations against such type of attacks. This article describes a possibility to apply a sandboxing method within a cloud environment to enforce security perimeter of the cloud.

  • 340.
    Adams, Allison
    Uppsala universitet, Humanistisk-samhällsvetenskapliga vetenskapsområdet, Språkvetenskapliga fakulteten, Institutionen för lingvistik och filologi.
    Dependency Parsing and Dialogue Systems: an investigation of dependency parsing for commercial application2017Självständigt arbete på avancerad nivå (masterexamen), 20 poäng / 30 hpStudentuppsats (Examensarbete)
    Abstract [en]

    In this thesis, we investigate dependency parsing for commercial application, namely for future integration in a dialogue system. To do this, we conduct several experiments on dialogue data to assess parser performance on this domain, and to improve this performance over a baseline. This work makes the following contributions: first, the creation and manual annotation of a gold-standard data set for dialogue data; second, a thorough error analysis of the data set, comparing neural network parsing to traditional parsing methods on this domain; and finally, various domain adaptation experiments show how parsing on this data set can be improved over a baseline.  We further show that dialogue data is characterized by questions in particular, and suggest a method for improving overall parsing on these constructions. 

  • 341. Adams, Liz
    et al.
    Börstler, Jürgen
    What It's Like to Participate in an ITiCSE Working Group2011Ingår i: ACM SIGCSE Bulletin, Vol. 43, nr 1Artikel i tidskrift (Övrigt vetenskapligt)
  • 342. Adams, R.
    et al.
    Fincher, S.
    Pears, A.
    Börstler, Jürgen
    Umeå universitet, Institutionen för datavetenskap.
    Bousted, J.
    Dalenius, P.
    Eken, G.
    Heyer, T.
    Jacobsson, A.
    Lindberg, V.
    Molin, B.
    Moström, J.-E.
    Umeå universitet, Institutionen för datavetenskap.
    Wiggberg, M.
    What is the Word for Engineering in Swedish: Swedish Students' Conceptions of their Discipline2007Rapport (Övrigt vetenskapligt)
  • 343. Adams, Robin
    et al.
    Fincher, Sally
    Pears, Arnold
    Börstler, Jürgen
    Boustedt, Jonas
    Högskolan i Gävle, Institutionen för matematik, natur- och datavetenskap, Ämnesavdelningen för datavetenskap.
    Dalenius, Peter
    Eken, Gunilla
    Heyer, Tim
    Jacobsson, Andreas
    Lindberg, Vanja
    Molin, Bengt
    Moström, Jan-Erik
    Wiggberg, Mattias
    What is the word for 'Engineering' in Swedish: Swedish students conceptions of their discipline2007Rapport (Övrigt vetenskapligt)
    Abstract [en]

    Engineering education in Sweden – as in the rest of the world – is experiencing a decline in student interest. There are concerns about the ways in which students think about engineering education, why they join an academic programme in engineering, and why they persist in their studies. In this context the aims of the Nationellt ämnesdidaktiskt Centrum för Teknikutbildning i Studenternas Sammanhang project (CeTUSS) is to investigate the student experience and to identify and support a continuing network of interested researchers, as well as in building capacity for disciplinary pedagogic investigation.

    The Stepping Stones project brings together these interests in a multi-researcher, multi-institutional study that investigates how tudents and academic staff perceive engineering in Sweden and in Swedish education. The first results of that project are reported here. As this study is situated uniquely in Swedish education, it allows for exploration of “a Swedish perspective” on conceptions of engineering. The Stepping Stones project was based on a model of research capacity-building previously instantiated in the USA and Australia (Fincher & Tenenberg, 2006).

  • 344. Adams, Robin
    et al.
    Fischer, Sally
    Pears, Arnold
    Börstler, Jürgen
    Boustedt, Jonas
    Dalenius, Peter
    Eken, Gunilla
    Heyer, Tim
    Jacobsson, Andreas
    Lindberg, Vanja
    Molin, Bemgt
    Moström, Jan-Erik
    Wiggberg, Mattias
    What is the Word for "Engineering" in Swedisch: Swedish Students Conceptions of their Discipline2007Rapport (Refereegranskat)
  • 345.
    Adamsson, Gustav
    Linköpings universitet, Institutionen för systemteknik, Informationskodning. Linköpings universitet, Tekniska fakulteten.
    Fast and Approximate Text Rendering Using Distance Fields2015Självständigt arbete på avancerad nivå (magisterexamen), 20 poäng / 30 hpStudentuppsats (Examensarbete)
    Abstract [en]

    Distance field text rendering has many advantages compared to most other text renderingsolutions. Two of the advantages are the possibility  to scale the glyphs without losing the crisp edge and less memory consumption. A drawback with distance field text renderingcan be high distance field generation time. The solution for fast distance field text renderingin this thesis generates the distance fields by drawing distance gradients locally over the outlines of the glyphs. This method is much faster than the old exact methods for generating distance fields that often includes multiple passes over the whole image.

    Using the solution for text rendering proposed in this thesis results in good looking text that is generated on the fly. The distance fields are generated on a mobile device in less than 10 ms for most of the glyphs in good quality which is less than the time between two frames.

  • 346.
    Adamsson, Marcus
    et al.
    KTH, Skolan för datavetenskap och kommunikation (CSC).
    Vorkapic, Aleksandar
    KTH, Skolan för datavetenskap och kommunikation (CSC).
    A comparison study of Kd-tree, Vp-tree and Octree for storing neuronal morphology data with respect to performance2016Självständigt arbete på grundnivå (kandidatexamen), 10 poäng / 15 hpStudentuppsats (Examensarbete)
    Abstract [sv]

    I denna rapport har vi undersökt prestanda av tre datastrukturer, Vptree, Kdtree och Octree, för lagring av neurala morfologidata. Två naiva liststrukturer implementerades, för att kunna jämföras med tre datastrukturer. Prestanda mättes med olika storlekar av neurala nätverket och med olika typer av testfall. En jämförelse med fokus på cachemissar, genomsnittlig söktid och minnesanvändning utfördes. Dessutom, samlade mätningarna kvantitativ data om varje datastruktur. Resultatet visade signifikant skillnad i prestanda mellan de implementerade datastrukturerna. Det konstaterades att Vptree är bättre för sökning i mindre populationer av neuroner samt för sökning av specifika noder i större populationer, medan Kdtree är bättre för volymsökning i större populationer. Octree hade högst medelsöktid och minnesanvändning.

  • 347.
    Adamsson, Tim
    Karlstads universitet, Fakulteten för humaniora och samhällsvetenskap (from 2013), Handelshögskolan.
    Kravrekommendation: En undersökning för kravrekommendationer för Nya Intranätets forum på Karlstad Universitet2014Självständigt arbete på grundnivå (kandidatexamen), 10 poäng / 15 hpStudentuppsats (Examensarbete)
  • 348. Adawi, T.
    et al.
    Burden, Håkan
    RISE., Swedish ICT, Viktoria.
    Olsson, D.
    Mattiasson, R.
    zCharacterizing Software Engineering Students' Discussions during Peer Instruction: Opportunities for Learning and Implications for Teaching2016Ingår i: International Journal of Engineering ,Science and Innovative Technology, ISSN 0949-149X, E-ISSN 2277-3754, Vol. 32, nr 2B, 927-936 s.Artikel i tidskrift (Refereegranskat)
    Abstract [en]

    Peer instruction is a method for activating students during lectures, which has gained a considerable amount of attention in higher education due to claims of dramatic improvement in learning gains. The purpose of this qualitative research study is to investigate what types of discussions engineering students engage in during a peer instruction session and what learning possibilities that are enabled by these different types of discussions. We observed twelve students during six separate and simulated peer instruction sessions and the students were interviewed individually after the sessions.Ananalysis of the data revealed that the students engaged in three qualitatively different types of discussions: affirmative discussions, motivating discussions, and argumentative discussions. We characterize these different types of discussions in terms of the number of alternative answers the students discuss, the extent to which they draw on prior knowledge and experiences, as well as the fundamental difference between an explanation and an argument. A good opportunity for learning is opened up when students are aspiring to find the truth, not simply being satisfied with what they believe to be true. We conclude that students do not always engage in discussions that support their learning in the best way, and we discuss implications for using peer instruction as a teaching method. © 2016 TEMPUS Publications.

  • 349. Adawi, Tom
    et al.
    Berglund, Anders
    Uppsala universitet, Teknisk-naturvetenskapliga vetenskapsområdet, Matematisk-datavetenskapliga sektionen, Institutionen för informationsteknologi.
    Ingerman, Åke
    Booth, Shirley
    On context in phenomenographic research on understanding heat and temperate2002Ingår i: EARLI, Bi-annual Symposium, Fribourg, Switzerland, 2002Konferensbidrag (Refereegranskat)
    Abstract [en]

    Starting from an empirical study of lay adults' understanding of heatand temperature, we distinguish between different meanings of "context" inphenomenographic research. To confuse the variation in ways of experiencingthe context(s) of the study with the variation in ways of experiencing thephenomenon of study is to risk losing fundamental insights. We discuss contextas experienced and as interwoven with the experience of the phenomenon, andanalyse its significance in two dimensions: (1) the stage of the research project:formulating the question, collecting data, analysing data and deploying results;and (2) "who is experiencing" the context: the individual, the collective, or theresearcher. The arguments are illustrated from the empirical study.

  • 350.
    Adborn, Mats
    Mittuniversitetet, Fakulteten för naturvetenskap, teknik och medier, Institutionen för informationsteknologi och medier.
    Visualisering av datastrukturer: Utveckling av ett tolkningsverktyg2013Självständigt arbete på grundnivå (kandidatexamen), 10 poäng / 15 hpStudentuppsats (Examensarbete)
    Abstract [sv]

    Tolking och tillgodogörande av datastrukturer, organiserad information ochprogramkodsfiler förekommer frekvent i arbete med mjukvaruutveckling. Dennainformation är lagrad i textbaserad form och dess förståelse kräver stornoggrannhet och tidsinvestering från utvecklarens sida. I syfte att försöka förenklaprocessen beskriver detta examensarbete utvecklingen av en prototyp till ettverktygsprogram, vilket automatiserar tolkning av XML-data och källkodsfiler förprogrammeringsspråken C och C++. Programmet skapar och presenterar sedanen visuell graf av den undersökta strukturen. Algoritmen klarar av att presenteragodtyckligt stora XML-filer samt ett begränsat antal samtidigt inlästakällkodsfiler. Effekterna på tolkningens tidsåtgång och dess tillförlitlighet harutvärderats i en undersökning bland studenter inom mjukvaruutveckling.Resultatet visade på en viss mätbar ökning i antalet korrekta slutsatser somanvändaren drog efter att ha studerat datasammanhanget grafiskt jämfört meddess ursprungliga textform. Tidsåtgången mättes inte mer noggrant än subjektivthos användarna, av vilka en övervägande andel ansåg att tiden förkortades medden grafiska representationen till deras hjälp. Examensarbetet visar attanvändandet av detta eller motsvarande verktyg kan öka tillgodogörandet avdatastrukturer genom att både höja graden av tillförlitligheten hos dennainformation och samtidigt minska tidsåtgången. Däremot är den kvantifierbaravinsten av dessa resultat inte statistiskt säkerställd till en högre grad.

45678910 301 - 350 av 47259
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