Ändra sökning
Avgränsa sökresultatet
45678910 301 - 350 av 49405
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)
  • Disputationsdatum (tidigaste först)
  • Disputationsdatum (senaste 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)
  • Disputationsdatum (tidigaste först)
  • Disputationsdatum (senaste 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.
    Abrahamyan, Lilit
    et al.
    University of Amsterdam.
    Schaap, Jorrit A.
    Hoekstra, Alfons G.
    Shamonin, Denis
    M.A.Box, Frieke
    Van der Geest, Rob J.
    H.C. Reiber, Johan
    M.A. Sloot, Peter
    A Problem Solving Environment for Image-Based Computational Hemodynamics2005Konferensbidrag (Refereegranskat)
    Abstract [en]

    We introduce a complete problem solving environment designed for pulsatile flows in 3D complex geometries, especially arteries. Three-dimensional images from arteries, obtained from e.g. Magnetic Resonance Imaging, are segmented to obtain a geometrical description of the arteries of interest. This segmented artery is prepared for blood flow simulations in a 3D editing tool, allowing to define in- and outlets, to filter and crop part of the artery, to add certain structures ( e.g. a by-pass, or stents ), and to generate computational meshes as input to the blood flow simulators. Using dedicated fluid flow solvers the time dependent blood flow in the artery during one systole is computed. The resulting flow, pressure and shear stress fields are then analyzed using a number of visualization techniques. The whole environment can be operated from a desktop virtual reality system, and is embedded in a Grid computing environment.

  • 302.
    Abrate, Matteo
    et al.
    CNR Natl Res Council, Inst Informat & Telemat, I-56124 Pisa, Italy.
    Bacciu, Clara
    CNR Natl Res Council, Inst Informat & Telemat, I-56124 Pisa, Italy.
    Hast, Anders
    Uppsala universitet, Teknisk-naturvetenskapliga vetenskapsområdet, Matematisk-datavetenskapliga sektionen, Institutionen för informationsteknologi, Avdelningen för visuell information och interaktion. Uppsala universitet, Teknisk-naturvetenskapliga vetenskapsområdet, Matematisk-datavetenskapliga sektionen, Institutionen för informationsteknologi, Bildanalys och människa-datorinteraktion. CNR Natl Res Council, Inst Informat & Telemat, I-56124 Pisa, Italy.
    Marchetti, Andrea
    CNR Natl Res Council, Inst Informat & Telemat, I-56124 Pisa, Italy.
    Minutoli, Salvatore
    CNR Natl Res Council, Inst Informat & Telemat, I-56124 Pisa, Italy.
    Tesconi, Maurizio
    CNR Natl Res Council, Inst Informat & Telemat, I-56124 Pisa, Italy.
    Geomemories - A Platform for Visualizing Historical, Environmental and Geospatial Changes of the Italian Landscape2013Ingår i: ISPRS International Journal of Geo-Information. Special issue: Geospatial Monitoring and Modelling of Environmental Change, ISSN 2220-9964, Vol. 2, nr 2, s. 432-455Artikel i tidskrift (Refereegranskat)
    Abstract [en]

    The GeoMemories project aims at publishing on the Web and digitally preserving historical aerial photographs that are currently stored in physical form within the archives of the Aerofototeca Nazionale in Rome. We describe a system, available at http://www.geomemories.org, that lets users visualize the evolution of the Italian landscape throughout the last century. The Web portal allows comparison of recent satellite imagery with several layers of historical maps, obtained from the aerial photos through a complex workflow that merges them together. We present several case studies carried out in collaboration with geologists, historians and archaeologists, that illustrate the great potential of our system in different research fields. Experiments and advances in image processing technologies are envisaged as a key factor in solving the inherent issue of vast amounts of manual work, from georeferencing to mosaicking to analysis.

  • 303.
    Abreu, Rodrigo
    et al.
    KTH, Skolan för datavetenskap och kommunikation (CSC), Numerisk analys, NA (stängd 2012-06-30).
    Jansson, Niclas
    KTH, Skolan för datavetenskap och kommunikation (CSC), Numerisk analys, NA (stängd 2012-06-30).
    Hoffman, Johan
    KTH, Skolan för datavetenskap och kommunikation (CSC), Numerisk analys, NA (stängd 2012-06-30).
    Adaptive computation of aeroacoustic sources for a rudimentary landing gear using lighthill's analogy2011Ingår i: 17th AIAA/CEAS AeroacousticsConference 2011: 32nd AIAA Aeroacoustics Conference, 2011Konferensbidrag (Refereegranskat)
    Abstract [en]

    We present our simulation results for the benchmark problem of the ow past a Rudimentary Landing Gear (RLG) using a General Galerkin (G2) nite element method, also referred to as Adaptive DNS/LES. In G2 no explicit subgrid model is used, instead the compuational mesh is adaptively re ned with respect to an a posteriori error es-timate of a quantity of interest in the computation, in this case the drag force on the RLG. Turbulent boundary layers are modeled using a simple wall layer model with the shear stress at walls proportional to the skin friction, which here is assumed to be small and, therefore, can be approximated by zero skin friction. We compare our results with experimental data and other state of the art computations, where we nd good agreement in sound pressure levels, surface velocities and ow separation. We also compare with detailed surface pressure experimental data where we nd largely good agreement, apart from some local dierences for which we discuss possible explanations.

  • 304.
    Abrishambaf, Reza
    et al.
    Department of Engineering Technology, Miami University, Hamilton, OH.
    Bal, Mert
    Department of Engineering Technology, Miami University, Hamilton, OH.
    Vyatkin, Valeriy
    Luleå tekniska universitet, Institutionen för system- och rymdteknik, Datavetenskap.
    Distributed home automation system based on IEC61499 function blocks and wireless sensor networks2017Ingår i: Proceedings of the IEEE International Conference on Industrial Technology, Piscataway, NJ: Institute of Electrical and Electronics Engineers (IEEE), 2017, s. 1354-1359, artikel-id 7915561Konferensbidrag (Refereegranskat)
    Abstract [en]

    In this paper, a distributed home automation system will be demonstrated. Traditional systems are based on a central controller where all the decisions are made. The proposed control architecture is a solution to overcome the problems such as the lack of flexibility and re-configurability that most of the conventional systems have. This has been achieved by employing a method based on the new IEC 61499 function block standard, which is proposed for distributed control systems. This paper also proposes a wireless sensor network as the system infrastructure in addition to the function blocks in order to implement the Internet-of-Things technology into the area of home automation as a solution for distributed monitoring and control. The proposed system has been implemented in both Cyber (nxtControl) and Physical (Contiki-OS) level to show the applicability of the solution

  • 305. Abu Bakar, Sakhinah
    et al.
    Taheri, Javid
    The University of Sydney, Australia.
    Zomaya, Albert
    The University of Sydney, Sydney, Australia.
    Characterization of essential proteins in proteins interaction networks2013Ingår i: Journal of Quality Measurement and Analysis, ISSN 1823-5670, Vol. 9, nr 2, s. 11-26Artikel i tidskrift (Refereegranskat)
  • 306.
    Abu Baker, Mohamed
    Linköpings universitet, Institutionen för datavetenskap, PELAB - Laboratoriet för programmeringsomgivningar.
    Agile Prototyping: A combination of different approaches into one main process2009Självständigt arbete på avancerad nivå (masterexamen), 20 poäng / 30 hpStudentuppsats (Examensarbete)
    Abstract [en]

    Software prototyping is considered to be one of the most important tools that are used by software engineersnowadays to be able to understand the customer’s requirements, and develop software products that are efficient,reliable, and acceptable economically. Software engineers can choose any of the available prototyping approaches tobe used, based on the software that they intend to develop and how fast they would like to go during the softwaredevelopment. But generally speaking all prototyping approaches are aimed to help the engineers to understand thecustomer’s true needs, examine different software solutions and quality aspect, verification activities…etc, that mightaffect the quality of the software underdevelopment, as well as avoiding any potential development risks.A combination of several prototyping approaches, and brainstorming techniques which have fulfilled the aim of theknowledge extraction approach, have resulted in developing a prototyping approach that the engineers will use todevelop one and only one throwaway prototype to extract more knowledge than expected, in order to improve thequality of the software underdevelopment by spending more time studying it from different points of view.The knowledge extraction approach, then, was applied to the developed prototyping approach in which thedeveloped model was treated as software prototype, in order to gain more knowledge out of it. This activity hasresulted in several points of view, and improvements that were implemented to the developed model and as a resultAgile Prototyping AP, was developed. AP integrated more development approaches to the first developedprototyping model, such as: agile, documentation, software configuration management, and fractional factorialdesign, in which the main aim of developing one, and only one prototype, to help the engineers gaining moreknowledge, and reducing effort, time, and cost of development was accomplished but still developing softwareproducts with satisfying quality is done by developing an evolutionary prototyping and building throwawayprototypes on top of it.

  • 307.
    Abu Khousa, Eman
    et al.
    UAE University, Al Ain, United Arab Emirates.
    Atif, Yacine
    Högskolan i Skövde, Institutionen för informationsteknologi. Högskolan i Skövde, Forskningscentrum för Informationsteknologi.
    Social network analysis to influence career development2017Ingår i: Journal of Ambient Intelligence and Humanized Computing, ISSN 1868-5137, E-ISSN 1868-5145Artikel i tidskrift (Refereegranskat)
    Abstract [en]

    Social network analysis techniques have shown a potential for influencing gradu-ates to meet industry needs. In this paper, we propose a social-web driven solutions to bridge formal education and industry needs. The proposed career development frame-work utilizes social network analytics, influence diffusion algorithms and persuasive technology models along three phases: (1) career readiness to measure and visualize the general cognitive dispositions required for a successful career in the 21st Century, (2) career prediction to persuade future graduates into a desired career path by clustering learners whose career prospects are deemed similar, into a community of practice; and (3) career development to drive growth within a social network structure where social network analytics and persuasive techniques are applied to incite the adoption of desired career behaviors. The process starts by discovering behavioral features to create a cognitive profile and diagnose individual deficiencies. Then, we develop a fuzzy clustering algorithm that predicts similar patterns with controlled constraint-violations to construct a social structure for collaborative cognitive attainment. This social framework facilitates the deployment of novel influence diffusion approaches, whereby we propose a reciprocal-weighted similarity function and a triadic clo-sure approach. In doing so, we investigate contemporary social network analytics to maximize influence diffusion across a synthesized social network. The outcome of this social computing approach leads to a persuasive model that supports behavioral changes and developments. The performance results obtained from both analytical and experi-mental evaluations validate our data-driven strategy for persuasive behavioral change.

  • 308.
    Abu Khousa, Eman
    et al.
    UAE University, United Arab Emirates.
    Atif, Yacine
    UAE University, United Arab Emirates.
    Mohammad M., Masud
    UAE University, United Arab Emirates.
    A social learning analytics approach to cognitive apprenticeship2015Ingår i: Smart Learning Environments, ISSN 2196-7091, Vol. 2, nr 14Artikel i tidskrift (Refereegranskat)
    Abstract [en]

    The need for graduates who are immediately prepared for employment has been widely advocated over the last decade to narrow the notorious gap between industry and higher education. Current instructional methods in formal higher education claim to deliver career-ready graduates, yet industry managers argue their imminent workforce needs are not completely met. From the candidates view, formal academic path is well defined through standard curricula, but their career path and supporting professional competencies are not confidently asserted. In this paper, we adopt a data analytics approach combined with contemporary social computing techniques to measure, instil, and track the development of professional competences of learners in higher education. We propose to augment higher-education systems with a virtual learning environment made-up of three major successive layers: (1) career readiness, to assert general professional dispositions, (2) career prediction to identify and nurture confidence in a targeted domain of employment, and (3) a career development process to raise the skills that are relevant to the predicted profession. We analyze self-declared career readiness data as well as standard individual learner profiles which include career interests and domain-related qualifications. Using these combinations of data sources, we categorize learners into Communities of Practice (CoPs), within which learners thrive collaboratively to build further their career readiness and assert their professional confidence. Towards these perspectives, we use a judicious clustering algorithm that utilizes a fuzzy-logic objective function which addresses issues pertaining to overlapping domains of career interests. Our proposed Fuzzy Pairwise-constraints K-Means (FCKM) algorithm is validated empirically using a two-dimensional synthetic dataset. The experimental results show improved performance of our clustering approach compared to baseline methods.

  • 309.
    Abu Nijmeh, Jonas
    et al.
    KTH, Skolan för datavetenskap och kommunikation (CSC).
    Catalan Canales, Diego
    KTH, Skolan för datavetenskap och kommunikation (CSC).
    Prokrastinering i form av medieanvändning: En jämförelsestudie kring kön och sysselsättning2017Självständigt arbete på grundnivå (kandidatexamen), 10 poäng / 15 hpStudentuppsats (Examensarbete)
    Abstract [sv]

    Prokrastinering har sedan länge varit ett problem som många möter. Vare sig det handlar om skolarbete, träning eller något annat har de flesta individer upplevt att de medvetet skjutit upp en uppgift till ett senare tillfälle. Detta fenomen har under senare tid integrerats i vårt samhälle på ett oftast negativt vis. I vårt mediecentrerade samhälle blir vi allt mer uppkopplade och nuförtiden har nästan hela Sveriges befolkning tillgång till internet. Tekniken har medfört många möjligheter men har även öppnat upp för nya sätt att prokrastinera.

    Denna studie ämnade undersöka prokrastinering i form av medieanvändning hos en stor målgrupp bestående av folk i alla åldrar. Vi ämnade att ta reda på eventuella skillnader i prokrastineringsvanor mellan könen men också bland yrkesarbetande och studerande. Tidigare forskning har redan visat att prokrastinering skiljer sig med ålder och sysselsättning. Mot bakgrund av detta söker vi att besvara frågan: Vilka medier använder personer när de prokrastinerar samt på vilka tekniska plattformar sker detta? För att besvara denna forskningsfråga utförde vi en förstudie på en mindre grupp för att få ett bättre förstånd för vilka frågor som var relevanta i sammanhanget. Denna förstudie låg sedan till grund för en enkätstudie med 91 deltagare.

    Resultatet visade tydliga skillnader mellan både män och kvinnor och mellan studerande och yrkesarbetande. Skillnader gällande både medieanvändning och prokrastineringsvanor kunde ses där vissa skillnader var mer märkbara än andra. Resultatet bekräftar tidigare studier i flera aspekter och ger oss en viss insikt om hur olika prokrastineringsvanor kan se ut.

  • 310.
    Abualhana, Munther
    et al.
    Blekinge Tekniska Högskola, Sektionen för datavetenskap och kommunikation.
    Tariq, Ubaid
    Blekinge Tekniska Högskola, Sektionen för datavetenskap och kommunikation.
    Improving QoE over IPTV using FEC and Retransmission2009Självständigt arbete på avancerad nivå (masterexamen)Studentuppsats (Examensarbete)
    Abstract [en]

    IPTV (Internet Protocol Television), a new and modern concept of emerging technologies with focus on providing cutting edge high-resolution television, broadcast, and other fascinating services, is now easily available with only requirement of high-speed internet. Everytime a new technology is made local, it faces tremendous problems whether from technological point of view to enhance the performance or when it comes down to satisfy the customers. This cutting edge technology has provided researchers to embark and play with different tools to provide better quality while focusing on existing tools. Our target in dissertation is to provide a few interesting facets of IPTV and come up with a concept of introducing an imaginary cache that can re-collect the packets travelling from streaming server to the end user. In the access node this cache would be fixed and then on the basis of certain pre-assumed research work we can conclude how quick retransmission can take place when the end user responds back using RTCP protocol and asks for the retransmission of corrupted/lost packets. In the last section, we plot our scenario of streaming server on one side and client, end user on the other end and make assumption on the basis of throughput, response time and traffic.

  • 311.
    Abugessaisa, Imad
    Linköpings universitet, Institutionen för datavetenskap, GIS - Geografiska informationssystem. Linköpings universitet, Tekniska högskolan.
    Analytical tools and information-sharing methods supporting road safety organizations2008Doktorsavhandling, sammanläggning (Övrigt vetenskapligt)
    Abstract [en]

    A prerequisite for improving road safety are reliable and consistent sources of information about traffic and accidents, which will help assess the prevailing situation and give a good indication of their severity. In many countries there is under-reporting of road accidents, deaths and injuries, no collection of data at all, or low quality of information. Potential knowledge is hidden, due to the large accumulation of traffic and accident data. This limits the investigative tasks of road safety experts and thus decreases the utilization of databases. All these factors can have serious effects on the analysis of the road safety situation, as well as on the results of the analyses.

    This dissertation presents a three-tiered conceptual model to support the sharing of road safety–related information and a set of applications and analysis tools. The overall aim of the research is to build and maintain an information-sharing platform, and to construct mechanisms that can support road safety professionals and researchers in their efforts to prevent road accidents. GLOBESAFE is a platform for information sharing among road safety organizations in different countries developed during this research.

    Several approaches were used, First, requirement elicitation methods were used to identify the exact requirements of the platform. This helped in developing a conceptual model, a common vocabulary, a set of applications, and various access modes to the system. The implementation of the requirements was based on iterative prototyping. Usability methods were introduced to evaluate the users’ interaction satisfaction with the system and the various tools. Second, a system-thinking approach and a technology acceptance model were used in the study of the Swedish traffic data acquisition system. Finally, visual data mining methods were introduced as a novel approach to discovering hidden knowledge and relationships in road traffic and accident databases. The results from these studies have been reported in several scientific articles.

  • 312.
    Abu-Sheikh, Khalil
    Blekinge Tekniska Högskola, Sektionen för teknik, Avdelningen för programvarusystem.
    Reviewing and Evaluating Techniques for Modeling and Analyzing Security Requirements2007Självständigt arbete på avancerad nivå (magisterexamen)Studentuppsats (Examensarbete)
    Abstract [en]

    The software engineering community recognized the importance of addressing security requirements with other functional requirements from the beginning of the software development life cycle. Therefore, there are some techniques that have been developed to achieve this goal. Thus, we conducted a theoretical study that focuses on reviewing and evaluating some of the techniques that are used to model and analyze security requirements. Thus, the Abuse Cases, Misuse Cases, Data Sensitivity and Threat Analyses, Strategic Modeling, and Attack Trees techniques are investigated in detail to understand and highlight the similarities and differences between them. We found that using these techniques, in general, help requirements engineer to specify more detailed security requirements. Also, all of these techniques cover the concepts of security but in different levels. In addition, the existence of different techniques provides a variety of levels for modeling and analyzing security requirements. This helps requirements engineer to decide which technique to use in order to address security issues for the system under investigation. Finally, we found that using only one of these techniques will not be suitable enough to satisfy the security requirements of the system under investigation. Consequently, we consider that it would be beneficial to combine the Abuse Cases or Misuse Cases techniques with the Attack Trees technique or to combine the Strategic Modeling and Attack Trees techniques together in order to model and analyze security requirements of the system under investigation. The concentration on using the Attack Trees technique is due to the reusability of the produced attack trees, also this technique helps in covering a wide range of attacks, thus covering security concepts as well as security requirements in a proper way.

  • 313.
    Aceto, L.
    et al.
    School of Computer Science, Reykjavik University, Iceland.
    Birgisson, A.
    Department of Computer Science and Engineering, Chalmers University of Technology, Sweden.
    Ingolfsdottir, A.
    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 Processes2011Ingår i: Fundamentals of software engineering: revised selected papers, Heidelberg: Springer Berlin/Heidelberg, 2011, Vol. 4171, s. 32-47Konferensbidrag (Refereegranskat)
    Abstract [en]

    This paper presents a decomposition technique for Hennessy-Milner logic with past and its extension with recursively defined formulae. In order to highlight the main ideas and technical tools, processes are described using a subset of CCS with parallel composition, nondeterministic choice, action prefixing and the inaction constant. The study focuses on developing decompositional reasoning techniques for parallel contexts in that language. © 2012 Springer-Verlag.

  • 314.
    Aceto, L.
    et al.
    School of Computer Science, Reykjavík University, Kringlan 1, 103 Reykjavík, Iceland.
    Fokkink, W. J.
    Department of Computer Science, Vrije Universiteit Amsterdam, 1081 HV Amsterdam, Netherlands.
    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.
    Lifting non-finite axiomatizability results to extensions of process algebras2010Ingår i: Acta Informatica, ISSN 0001-5903, E-ISSN 1432-0525, Vol. 47, nr 3, s. 147-177Artikel i tidskrift (Refereegranskat)
    Abstract [en]

    This paper presents a general technique for obtaining new results pertaining to the non-finite axiomatizability of behavioural (pre)congruences 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 provability 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. In particular, it is shown that prebisimilarity is not finitely based over CCS with the divergent process Ω, but that this result cannot be proved by a reduction to the non-finite axiomatizability of CCS modulo bisimilarity. This negative result is the inspiration for the development of a sharpened reduction method that is powerful enough to show that prebisimilarity is not finitely based over CCS with the divergent process Ω. © 2010 Springer-Verlag.

  • 315.
    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, s. 889-907Artikel 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.

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

  • 317.
    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, s. 1-28Artikel 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.

  • 318.
    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, s. 3045-3071Artikel 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.

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

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

  • 321.
    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, s. 79-90Konferensbidrag (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.

  • 322.
    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, s. 301-316Konferensbidrag (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.

  • 323.
    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)
  • 324.
    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, s. 36-50Konferensbidrag (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.

  • 325.
    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, s. 81-103Artikel 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.

  • 326.
    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, s. 80-95Konferensbidrag (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.

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

  • 328.
    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, s. 141-152Konferensbidrag (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.

  • 329. 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))
  • 330.
    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.

  • 331. 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)
  • 332.
    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. 

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

  • 334.
    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, s. 130-141Konferensbidrag (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.

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

  • 336.
    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, s. 189-203Artikel 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.

  • 337.
    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, s. 316-334Kapitel 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.

  • 338.
    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 and University 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.
    Jimenez-Ruiz, Ernesto
    University of Oslo, Norway.
    Kolthoff, Kristian
    University of Mannheim, Germany.
    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, Netherlands.
    Li, Huanyu
    Linköpings universitet, Institutionen för datavetenskap, Databas och informationsteknik. Linköpings universitet, Tekniska fakulteten.
    Meilicke, Christian
    University of Mannheim, Germany.
    Mohammadi, Majid
    Technical University of Delft, Netherlands.
    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
    Informatica Trentina, Trento, Italy.
    Splendiani, Andrea
    Pistoia Alliance Inc., USA.
    Stuckenschmidt, Heiner
    University of Mannheim, Germany.
    Thieblin, Elodie
    IRIT and Universite Toulouse II, Toulouse, France.
    Todorov, Konstantin
    LIRMM/University of Montpellier, France.
    Trojahn, Cassia
    IRIT and Universite Toulouse II, Toulouse, France.
    Zamazal, Ondrej
    University of Economics, Prague, Czech Republic.
    Results of the Ontology Alignment Evaluation Initiative 20172017Ingår i: Proceedings of the 12th International Workshop on Ontology Matching co-located with the 16th International Semantic Web Conference (ISWC 2017) / [ed] Pavel Shvaiko, Jerome Euzenat, Ernesto Jimenez-Ruiz, Michelle Cheatham, Oktie Hassanzadeh, Aachen, Germany: CEUR Workshop Proceedings , 2017, s. 61-113Konferensbidrag (Refereegranskat)
  • 339.
    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, s. 73-129Konferensbidrag (Refereegranskat)
  • 340.
    Achilleos, Achilleas
    et al.
    Frederick University, Cyprus.
    Mettouris, Christos
    University of Cyprus, Cyprus.
    Yeratziotis, Alexandros
    University of Cyprus, Cyprus.
    Papadopoulos, George
    University of Cyprus, Cyprus.
    Pllana, Sabri
    Linnéuniversitetet, Fakulteten för teknik (FTK), Institutionen för datavetenskap och medieteknik (DM).
    Huber, Florian
    SYNYO GmbH, Austria.
    Jäger, Bernhard
    SYNYO GmbH, Austria.
    Leitner, Peter
    SYNYO GmbH, Austria.
    Ocsovszky, Zsófia
    BioTalentum Ltd, Hungary.
    Dinnyés, András
    BioTalentum Ltd, Hungary.
    SciChallenge: A Social Media Aware Platform for Contest-Based STEM Education and Motivation of Young Students2018Ingår i: IEEE Transactions on Learning Technologies, ISSN 1939-1382, E-ISSN 1939-1382Artikel i tidskrift (Refereegranskat)
    Abstract [en]

    Scientific and technological innovations have become increasingly important as we face the benefits and challenges of both globalization and a knowledge-based economy. Still, enrolment rates in STEM degrees are low in many European countries and consequently there is a lack of adequately educated workforce in industries. We believe that this can be mainly attributed to pedagogical issues, such as the lack of engaging hands-on activities utilized for science and math education in middle and high schools. In this paper, we report our work in the SciChallenge European project, which aims at increasing the interest of pre-university students in STEM disciplines, through its distinguishing feature, the systematic use of social media for providing and evaluation of the student-generated content. A social media-aware contest and platform were thus developed and tested in a pan-European contest that attracted >700 participants. The statistical analysis and results revealed that the platform and contest positively influenced participants STEM learning and motivation, while only the gender factor for the younger study group appeared to affect the outcomes (confidence level – p<.05).

  • 341. 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, s. 369-380Konferensbidrag (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.

  • 342. 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, s. 38-55Artikel 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.

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

     

  • 344.
    Achuthan, Krishnashree
    et al.
    Amrita Vishwa Vidyapeetham, Amrita Ctr Cybersecur Syst & Networks, Kollam, Kerala, India..
    Ramesh, Maneesha V.
    Amrita Vishwa Vidyapeetham, Amrita Ctr Int Programs, Kollam, Kerala, India..
    Punnekkat, Sasikumar
    Mälardalens högskola, Akademin för innovation, design och teknik, Inbyggda system.
    Raman, Raghu
    Amrita Vishwa Vidyapeetham, Ctr Res Adv Technol Educ, Kollam, Kerala, India..
    Internationalizing Engineering Education With Phased Study Programs: India-European Experience2014Ingår i: 2014 IEEE FRONTIERS IN EDUCATION CONFERENCE (FIE), IEEE , 2014, s. 295-301Konferensbidrag (Refereegranskat)
    Abstract [en]

    Most of the critical challenges seen in the past decades have impacted citizens in a global way. Given shrinking resources, educationists find preparing students for the global market place a formidable challenge. Hence exposing students to multi-lateral educational initiatives are critical to their growth, understanding and future contributions. This paper focuses on European Union's Erasmus Mundus programs, involving academic cooperation amongst international universities in engineering programs. A phased undergraduate engineering program with multiple specializations is analyzed within this context. Based on their performance at the end of first phase, selected students were provided opportunities using scholarship to pursue completion of their degree requirements at various European universities. This paper will elaborate the impact of differing pedagogical interventions, language and cultural differences amongst these countries on students in diverse engineering disciplines. The data presented is based on on the feedback analysis from Eramus Mundus students (N = 121) that underwent the mobility programs. The findings have given important insights into the structure of the initiative and implications for academia and education policy makers for internationalizing engineering education. These included considering digital interventions such as MOOCs (Massive Open Online Courses) and Virtual Laboratory (VL) initiatives for systemic reorganization of engineering education.

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

  • 346.
    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)
  • 347.
    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.

  • 348. 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, s. 386-Kapitel i bok, del av antologi (Övrigt vetenskapligt)
  • 349.
    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, s. 1-13Artikel i tidskrift (Refereegranskat)
  • 350. 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, s. 223-235Kapitel 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.

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