uu.seUppsala universitets publikasjoner
Endre søk
Begrens søket
3456789 251 - 300 of 5630
RefereraExporteraLink til resultatlisten
Permanent link
Referera
Referensformat
  • apa
  • ieee
  • modern-language-association
  • vancouver
  • Annet format
Fler format
Språk
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Annet språk
Fler språk
Utmatningsformat
  • html
  • text
  • asciidoc
  • rtf
Treff pr side
  • 5
  • 10
  • 20
  • 50
  • 100
  • 250
Sortering
  • Standard (Relevans)
  • Forfatter A-Ø
  • Forfatter Ø-A
  • Tittel A-Ø
  • Tittel Ø-A
  • Type publikasjon A-Ø
  • Type publikasjon Ø-A
  • Eldste først
  • Nyeste først
  • Skapad (Eldste først)
  • Skapad (Nyeste først)
  • Senast uppdaterad (Eldste først)
  • Senast uppdaterad (Nyeste først)
  • Disputationsdatum (tidligste først)
  • Disputationsdatum (siste først)
  • Standard (Relevans)
  • Forfatter A-Ø
  • Forfatter Ø-A
  • Tittel A-Ø
  • Tittel Ø-A
  • Type publikasjon A-Ø
  • Type publikasjon Ø-A
  • Eldste først
  • Nyeste først
  • Skapad (Eldste først)
  • Skapad (Nyeste først)
  • Senast uppdaterad (Eldste først)
  • Senast uppdaterad (Nyeste først)
  • Disputationsdatum (tidligste først)
  • Disputationsdatum (siste først)
Merk
Maxantalet träffar du kan exportera från sökgränssnittet är 250. Vid större uttag använd dig av utsökningar.
  • 251.
    Andersson, JLR
    et al.
    Uppsala universitet, Teknisk-naturvetenskapliga vetenskapsområdet, Matematisk-datavetenskapliga sektionen, Centrum för bildanalys.
    Thurfjell, Lennart
    Uppsala universitet, Teknisk-naturvetenskapliga vetenskapsområdet, Matematisk-datavetenskapliga sektionen, Institutionen för informationsteknologi, Datoriserad bildanalys.
    A multivariate approach to registration of dissimilar tomographic images1999Inngår i: European Journal of Nuclear Medicine, ISSN 0340-6997, E-ISSN 1432-105X, Vol. 26, nr 7, s. 718-733Artikkel i tidsskrift (Fagfellevurdert)
    Abstract [en]

    We devised a method to allow for retrospective registration of tomographic images with very different information content, the main emphasis being on sets of positron emission tomography images obtained with different tracers. A multivariate cost-function

  • 252.
    Andersson, Joakim
    et al.
    Uppsala universitet, Humanistisk-samhällsvetenskapliga vetenskapsområdet, Samhällsvetenskapliga fakulteten, Institutionen för informatik och media.
    Jeppsson, Viggo
    Uppsala universitet, Humanistisk-samhällsvetenskapliga vetenskapsområdet, Samhällsvetenskapliga fakulteten, Institutionen för informatik och media.
    Världsbäst i digitalisering?: En explorativ fallstudie om den pågående digitaliseringsprocessen av den svenska skolan2018Independent thesis Basic level (degree of Bachelor), 10 poäng / 15 hpOppgave
    Abstract [en]

    Swedish society is constantly evolving and growing into higher levels of digitalisation. The school system plays an important part in creating a nationwide competence regarding the proper use of digital tools, by growing alongside the society as a whole. In the spring of 2017 the Swedish government issued a public document called the national strategy of digitalization, which defines certain goals for the school system to achieve. The Swedish Association of Local Authorities and Regions (SKL) is in the process of developing a plan of action, which is to be a document used for guiding people working within the school system towards reaching the goals within the national strategy of digitalization. A few initial changes have now been made to the general curriculum and it has raised several questions, regarding the good, bad or even unmanageable consequences that such changes will lead to. This study aims to look into the ongoing discussion and define specific areas of future research. A number of key actors with different roles within and in relation to the school system have been interviewed. Among the results is a model depicting several major actors within the digitalization process and how they relate to each other. The theoretical framework TPACK is used to analyze and discuss the complexity of a general level of competence that is required of teachers working within a digitalized school system. Two areas of future research have been defined: (1) Continuous study and evaluation of the action plan; (2) Proper use and integration of digital study material.

    Fulltekst (pdf)
    Världsbäst i digitalisering?
  • 253.
    Andersson, Jonas
    Uppsala universitet, Humanistisk-samhällsvetenskapliga vetenskapsområdet, Samhällsvetenskapliga fakulteten, Institutionen för informationsvetenskap.
    Essays on financial time series models: Stochastic volatility and long memory1999Doktoravhandling, med artikler (Annet vitenskapelig)
    Abstract [en]

    This work consists of five articles about the statistical aspects of financial time series models. The first three papers investigate and develop the inverse normal Gaussian stochastic volatility (NIGSV) model, initially suggested by Barndorff- Nielsen (1997). In the first paper, Barndorff-Nilsen's model is generalized in order to be able to produce a more flexible lag structure. The moments of the squared process, important properties of volatility models, are derived. The topic of the second paper is the performance of the maximum likelihood estimator of the NIGSV model. In the third paper a comparison of the NIGSV model with two other commonly used volatility models is made.

    The long memory property is the topic of the last two papers. In the fourth paper two improvements of the commonly used GPH-estimator of Geweke and Porter-Hudak (1983) are proposed and studied by means of a Monte Carlo study. In the fifth paper the problem of distinguishing between short term and long term memory in volatilityis investigated.

  • 254.
    Andersson, Jonathan
    Uppsala universitet, Medicinska och farmaceutiska vetenskapsområdet, Medicinska fakulteten, Institutionen för radiologi, onkologi och strålningsvetenskap, Enheten för radiologi.
    Methods for automatic analysis of glucose uptake in adipose tissue using quantitative PET/MRI data2014Independent thesis Advanced level (professional degree), 20 poäng / 30 hpOppgave
    Abstract [en]

    Brown adipose tissue (BAT) is the main tissue involved in non-shivering heat production. A greater understanding of BAT could possibly lead to new ways of prevention and treatment of obesity and type 2 diabetes. The increasing prevalence of these conditions and the problems they cause society and individuals make the study of the subject important.

    An ongoing study performed at the Turku University Hospital uses images acquired using PET/MRI with 18F-FDG as the tracer. Scans are performed on sedentary and athlete subjects during normal room temperature and during cold stimulation. Sedentary subjects then undergo scanning during cold stimulation again after a six weeks long exercise training intervention. This degree project used images from this study.

    The objective of this degree project was to examine methods to automatically and objectively quantify parameters relevant for activation of BAT in combined PET/MRI data. A secondary goal was to create images showing glucose uptake changes in subjects from images taken at different times.

    Parameters were quantified in adipose tissue directly without registration (image matching), and for neck scans also after registration. Results for the first three subjects who have completed the study are presented. Larger registration errors were encountered near moving organs and in regions with less information.

    The creation of images showing changes in glucose uptake seem to be working well for the neck scans, and somewhat well for other sub-volumes. These images can be useful for identification of BAT. Examples of these images are shown in the report.

    Fulltekst (pdf)
    Andersson Methods for automatic analysis of glucose uptake in adipose tissue using quantitative PET MRI data
  • 255.
    Andersson, Kent
    Uppsala universitet, Humanistisk-samhällsvetenskapliga vetenskapsområdet, Samhällsvetenskapliga fakulteten, Institutionen för informationsvetenskap.
    Knowledge Technology Applications for Knowledge Management2000Doktoravhandling, med artikler (Annet vitenskapelig)
    Abstract [en]

    We investigate how the knowledge in knowledge technology applications for knowledge management can be represented to let the user directly manage the knowledge content of the applications.

    In paper I we design a representation of diagnosis knowledge that allows the user to add new components and inspect the function of the device. The representation allows an integration of model based knowledge with compiled and heuristic knowledge so that the device and its function can be represented a suitable level of abstraction and let other parts be represented as non-model based knowledge.

    In paper II we use simplified rules for describing the time, resources, activities and amounts required in a tunnelling project and a simulation engine for estimating time and amounts consumed in the tunnelling process. The rules are designed to allow a user to change the facts and computations of the system.

    In paper III we present the constraint modelling language CML and show how to model a nurse scheduling problem and a train scheduling problem without programming. The idea is to preserve the problem structure of the domain, allowing constraint formulations that reflect natural language expressions familiar to the users. CML problem specifications are transformed automatically to standard constraint programs

    In paper IV we investigate the use of decision tables for representing requirements on staff scheduling explicitly, providing structure, decision support and overview to the user. The requirements are compiled automatically to a program that use hand-written procedures for efficient scheduling.

    It seems possible to let the user modify central parts of the knowledge content in the applications with these representations, by using various illustration techniques. The techniques used are object-based graphics for manipulating device components and connections in diagnosis, simplified rules for simulation of tunnelling activities, text-based query language specification of scheduling problems and finally, decision tables for constraint problems and decision support.

    Fulltekst (pdf)
    FULLTEXT01
  • 256.
    Andersson, Mattias
    et al.
    Uppsala universitet, Humanistisk-samhällsvetenskapliga vetenskapsområdet, Samhällsvetenskapliga fakulteten, Institutionen för informatik och media.
    Ludvigsson, Christopher
    Uppsala universitet, Humanistisk-samhällsvetenskapliga vetenskapsområdet, Samhällsvetenskapliga fakulteten, Institutionen för informatik och media.
    Cloud Computing: Lärplattform i molnet2011Independent thesis Basic level (degree of Bachelor), 10 poäng / 15 hpOppgave
    Abstract [sv]

    Cloud computings framväxt har möjliggjort tillhandhållande av datorresurser online och erbjuder två väsentliga egenskaper, dels upplevda oändliga resurser och dels betalning per resursförbrukning. Lärplattformar används idag i stor utsträckning av de svenska universiteten och högskolorna som studieverktyg. Detta medför bättre möjligheter för distanskurser och e-inlärning. Att kombinera cloud computing med en lärplattform är idag möjligt och bör därför ge skolorna fördelar. Om lärplattformen driftas som molntjänst av extern leverantör bör också kraven se annorlunda ut.

    Syftet med uppsatsen är att utreda om det finns några incitament för att hyra en lärplattform som molntjänst och även att utreda om kraven ser annorlunda ut på en hyrd molntjänst. En fallstudie genomfördes på Uppsala universitet och Högskolan Dalarna, detta för att jämföra en lärplattform installerad på egen server med en lärplattform som hyrd molntjänst.

    Resultatet av studien bevisar att det finns fördelar med att hyra en lärplattform som molntjänst. Vad gäller kraven är det inte mycket som skiljer, ett viktigt krav när driften ligger hos en leverantör är att det finns en bra dialog och att organisationen litar på leverantören. 

    Fulltekst (pdf)
    Cloud Computing - Lärplattform i Molnet
  • 257.
    Andersson, Robin
    et al.
    Computer Science and Engineering, Chalmers University of Technology, Gothenburg, Sweden.
    Berglund, Jonas
    Computer Science and Engineering, Chalmers University of Technology, Gothenburg, Sweden.
    Coşkun, Aykut
    KUAR, Media and Visual Arts Department, Koç University, Istanbul, Turkey.
    Fjeld, Morten
    Computer Science and Engineering, Chalmers University of Technology, Gothenburg, Sweden.
    Obaid, Mohammad
    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.
    Defining gestural interactions for large vertical touch displays2017Inngår i: Human-Computer Interaction – INTERACT 2017, Springer, 2017, s. 36-55Konferansepaper (Fagfellevurdert)
    Abstract [en]

    As new technologies emerge, so do new ways of interacting with the digital domain. In this paper, the touch interaction paradigm is challenged for use on large touch displays of 65 in. in size. We present a gesture elicitation study with 26 participants carried out on twelve actions commonly used on touch displays. The results and analysis of 312 touch gestures revealed agreement rates for each action. We report several findings including the results of a set of ten unique (and a few secondary) gestures, a taxonomy classifying the defined gestures, a pilot study on the defined gestures, and explicit design implications. We discuss the results and include several important factors for future considerations. We aim at helping future designers and engineers to design interactions for large touch displays

  • 258.
    Andersson, Stefan
    et al.
    Uppsala universitet, Universitetsbiblioteket.
    Klosa, Uwe
    Uppsala universitet, Universitetsbiblioteket.
    Sundin, Mimmi
    Uppsala universitet, Universitetsbiblioteket.
    Svensson, Aina
    Uppsala universitet, Universitetsbiblioteket.
    DiVA: A Well Rooted and Growing Platform2013Konferansepaper (Annet vitenskapelig)
    Fulltekst (pdf)
    fulltext
  • 259.
    Andreasson, Rebecca
    et al.
    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. School of Informatics, University of Skövde, Skövde, Sweden.
    Alenljung, Beatrice
    School of Informatics, University of Skövde, Skövde, Sweden.
    Billing, Erik
    School of Informatics, University of Skövde, Skövde, Sweden.
    Lowe, Robert
    Department of Applied ITUniversity of Gothenburg, Gothenburg, Sweden.
    Affective touch in human–robot interaction: Conveying emotion to the Nao robot2018Inngår i: International Journal of Social Robotics, ISSN 1875-4791, E-ISSN 1875-4805, Vol. 10, s. 473-491Artikkel i tidsskrift (Fagfellevurdert)
    Abstract [en]

    Affective touch has a fundamental role in human development, social bonding, and for providing emotional support in interpersonal relationships. We present, what is to our knowledge, the first HRI study of tactile conveyance of both positive and negative emotions (affective touch) on the Nao robot, and based on an experimental set-up from a study of human–human tactile communication. In the present work, participants conveyed eight emotions to a small humanoid robot via touch. We found that female participants conveyed emotions for a longer time, using more varied interaction and touching more regions on the robot’s body, compared to male participants. Several differences between emotions were found such that emotions could be classified by the valence of the emotion conveyed, by combining touch amount and duration. Overall, these results show high agreement with those reported for human–human affective tactile communication and could also have impact on the design and placement of tactile sensors on humanoid robots.

    Fulltekst (pdf)
    fulltext
  • 260.
    Andreasson, Rebecca
    et al.
    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.
    Arweström Jansson, 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.
    Towards a distributed cognition perspective of the Swedish train traffic system2017Inngår i: Proceedings of the 13th SweCog Conference, Högskolan i Skövde , 2017, s. 37-39Konferansepaper (Fagfellevurdert)
    Fulltekst (pdf)
    fulltext
  • 261.
    Andreasson, Rebecca
    et al.
    University of Skövde, School of Informatics.
    Riveiro, Maria
    University of Skövde, School of Informatics.
    Effects of Visualizing Missing Data: An Empirical Evaluation2014Inngår i: 18th International Conference on Information Visualisation (IV) / [ed] Ebad Banissi, Mark W. McK. Bannatyne, Francis T. Marchese, Muhammad Sarfraz, Anna Ursyn, Gilles Venturini, Theodor G. Wyeld, Urska Cvek, Marjan Trutschl, Georges Grinstein, Vladimir Geroimenko, Sarah Kenderdine & Fatma Bouali, 2014, s. 132-138Konferansepaper (Fagfellevurdert)
    Abstract [en]

    This paper presents an empirical study that evaluates the effects of visualizing missing data on decision-making tasks. A comparison between three visualization techniques: (1) emptiness, (2) fuzziness, and (3) emptiness plus explanation, revealed that the latter technique induced significantly higher degree of decision-confidence than the visualization technique fuzziness. Moreover, emptiness plus explanation yield the highest number of risky choices of the three. This result suggests that uncertainty visualization techniques affect the decision-maker and the decision-confidence. Additionally, the results indicate a possible relation between the degree of decision-confidence and the decision-maker's displayed risk behavior.

  • 262. Andreen, Thomas
    et al.
    Bengtsson, Karin
    Lundman, Katarina
    Taube, Adam
    Uppsala universitet, Humanistisk-samhällsvetenskapliga vetenskapsområdet, Samhällsvetenskapliga fakulteten, Institutionen för informationsvetenskap.
    Pain relief in dogs with hip dysplasia2008Inngår i: The Veterinary Record, ISSN 0042-4900, E-ISSN 2042-7670, Vol. 162, nr 24, s. 796-796Artikkel i tidsskrift (Fagfellevurdert)
  • 263.
    Andrejev, Andrej
    Uppsala universitet, Teknisk-naturvetenskapliga vetenskapsområdet, Matematisk-datavetenskapliga sektionen, Institutionen för informationsteknologi, Datalogi. Uppsala universitet, Teknisk-naturvetenskapliga vetenskapsområdet, Matematisk-datavetenskapliga sektionen, Institutionen för informationsteknologi, Avdelningen för datalogi.
    Semantic Web Queries over Scientific Data2016Doktoravhandling, monografi (Annet vitenskapelig)
    Abstract [en]

    Semantic Web and Linked Open Data provide a potential platform for interoperability of scientific data, offering a flexible model for providing machine-readable and queryable metadata. However, RDF and SPARQL gained limited adoption within the scientific community, mainly due to the lack of support for managing massive numeric data, along with certain other important features – such as extensibility with user-defined functions, query modularity, and integration with existing environments and workflows.

    We present the design, implementation and evaluation of Scientific SPARQL – a language for querying data and metadata combined, represented using the RDF graph model extended with numeric multidimensional arrays as node values – RDF with Arrays. The techniques used to store RDF with Arrays in a scalable way and process Scientific SPARQL queries and updates are implemented in our prototype software – Scientific SPARQL Database Manager, SSDM, and its integrations with data storage systems and computational frameworks. This includes scalable storage solutions for numeric multidimensional arrays and an efficient implementation of array operations. The arrays can be physically stored in a variety of external storage systems, including files, relational databases, and specialized array data stores, using our Array Storage Extensibility Interface. Whenever possible SSDM accumulates array operations and accesses array contents in a lazy fashion.

    In scientific applications numeric computations are often used for filtering or post-processing the retrieved data, which can be expressed in a functional way. Scientific SPARQL allows expressing common query sub-tasks with functions defined as parameterized queries. This becomes especially useful along with functional language abstractions such as lexical closures and second-order functions, e.g. array mappers.

    Existing computational libraries can be interfaced and invoked from Scientific SPARQL queries as foreign functions. Cost estimates and alternative evaluation directions may be specified, aiding the construction of better execution plans. Costly array processing, e.g. filtering and aggregation, is thus preformed on the server, saving the amount of communication. Furthermore, common supported operations are delegated to the array storage back-ends, according to their capabilities. Both expressivity and performance of Scientific SPARQL are evaluated on a real-world example, and further performance tests are run using our mini-benchmark for array queries.

    Fulltekst (pdf)
    fulltext
    Download (jpg)
    presentationsbild
  • 264.
    Andrejev, Andrej
    et al.
    Uppsala universitet, Teknisk-naturvetenskapliga vetenskapsområdet, Matematisk-datavetenskapliga sektionen, Institutionen för informationsteknologi, Datalogi.
    He, Xueming
    Risch, Tore
    Uppsala universitet, Teknisk-naturvetenskapliga vetenskapsområdet, Matematisk-datavetenskapliga sektionen, Institutionen för informationsteknologi, Datalogi.
    Scientific data as RDF with arrays: Tight integration of SciSPARQL queries into MATLAB2014Inngår i: Proc. ISWC 2014 Posters & Demonstrations Track, RWTH Aachen University , 2014, s. 221-224Konferansepaper (Fagfellevurdert)
    Abstract [en]

    We present an integrated solution for storing and querying scientific data and metadata, using MATLAB envi ronment as client front-end and our prototype DBMS on the server. We use RDF for experiment metadata, and numeric arrays for the rest. Our extension of SPARQL supports array operations and extensibility with foreign functions.

  • 265.
    Andrejev, Andrej
    et al.
    Uppsala universitet, Teknisk-naturvetenskapliga vetenskapsområdet, Matematisk-datavetenskapliga sektionen, Institutionen för informationsteknologi, Datalogi.
    Misev, Dimitar
    Jacobs Univ, Dept Comp Sci & Elect Engn, Bremen, Germany..
    Baumann, Peter
    Jacobs Univ, Dept Comp Sci & Elect Engn, Bremen, Germany..
    Risch, Tore
    Uppsala universitet, Teknisk-naturvetenskapliga vetenskapsområdet, Matematisk-datavetenskapliga sektionen, Institutionen för informationsteknologi, Datalogi.
    Spatio-Temporal Gridded Data Processing on the Semantic Web2015Inngår i: 2015 IEEE International Conference On Data Science And Data Intensive Systems, 2015, s. 38-45Konferansepaper (Fagfellevurdert)
    Abstract [en]

    Multidimensional array data, such as remote-sensing imagery and timeseries, climate model simulations, telescope observations, and medical images, contribute massively to virtually all science and engineering domains, and hence play a key role in 'Big Data' challenges. Pure array storage management and analytics is relatively well understood today. However, arrays in practice never come alone, but are accompanied by metadata, including domain, range, provenance information, etc. The structure of this metadata is far less regular than arrays or tables, and may be incomplete or different from one array instance to another. Particularly in the field of the Semantic Web such integrated representations must convey a sufficiently complete and reasonable semantics for machine-machine communication. We show how the Resource Description Framework (RDF), the Semantic Web graph model for metadata, can be leveraged for such data/metadata integration specifically for representing spatio-temporal grid data. Based on the notion of a coverage as established by the Open Geospatial Consortium (OGC) we present a hybrid data store where efficiently represented arrays are incorporated as nodes into RDF graphs and connected to their metadata. We have extended the Semantic Web query language SPARQL to incorporate array query semantics and other functionality making it suitable for processing of large numeric arrays, including geo coverages.

  • 266.
    Andrejev, Andrej
    et al.
    Uppsala universitet, Teknisk-naturvetenskapliga vetenskapsområdet, Matematisk-datavetenskapliga sektionen, Institutionen för informationsteknologi, Datalogi.
    Risch, Tore
    Uppsala universitet, Teknisk-naturvetenskapliga vetenskapsområdet, Matematisk-datavetenskapliga sektionen, Institutionen för informationsteknologi, Datalogi.
    Scientific SPARQL: Semantic web queries over scientific data2012Inngår i: Proc. 28th International Conference on Data Engineering Workshops, IEEE Computer Society, 2012, s. 5-10Konferansepaper (Fagfellevurdert)
  • 267.
    Andrejev, Andrej
    et al.
    Uppsala universitet, Teknisk-naturvetenskapliga vetenskapsområdet, Matematisk-datavetenskapliga sektionen, Institutionen för informationsteknologi, Datalogi.
    Toor, Salman
    Uppsala universitet, Teknisk-naturvetenskapliga vetenskapsområdet, Matematisk-datavetenskapliga sektionen, Institutionen för informationsteknologi, Avdelningen för beräkningsvetenskap. Uppsala universitet, Teknisk-naturvetenskapliga vetenskapsområdet, Matematisk-datavetenskapliga sektionen, Institutionen för informationsteknologi, Tillämpad beräkningsvetenskap.
    Hellander, Andreas
    Holmgren, Sverker
    Uppsala universitet, Teknisk-naturvetenskapliga vetenskapsområdet, Matematisk-datavetenskapliga sektionen, Institutionen för informationsteknologi, Avdelningen för beräkningsvetenskap. Uppsala universitet, Teknisk-naturvetenskapliga vetenskapsområdet, Matematisk-datavetenskapliga sektionen, Institutionen för informationsteknologi, Tillämpad beräkningsvetenskap.
    Risch, Tore
    Uppsala universitet, Teknisk-naturvetenskapliga vetenskapsområdet, Matematisk-datavetenskapliga sektionen, Institutionen för informationsteknologi, Datalogi.
    Scientific analysis by queries in extended SPARQL over a scalable e-Science data store2013Inngår i: Proc. 9th International Conference on e-Science, Los Alamitos, CA: IEEE Computer Society, 2013, s. 98-106Konferansepaper (Fagfellevurdert)
  • 268.
    André, Andreas
    Uppsala universitet, Humanistisk-samhällsvetenskapliga vetenskapsområdet, Historisk-filosofiska fakulteten, Institutionen för speldesign.
    En färgglad studie om spelarbeteenden2014Independent thesis Basic level (degree of Bachelor), 10 poäng / 15 hpOppgave
    Abstract [en]

    This is the result of a 10 week long study about if player behaviors and choices are affectedby the surrounding colors in their environment. A number of players are asked to movethrough a virtual environment, while being clocked, where they have to make left and rightdecisions based on different colors (red, green, blue and gray). While most choices consist oftwo different colors, some use the same color. The result shows that the players most likelyprefer one color over another, and that they most likely prefer a non-neutral color over aneutral color. With these results and the interviews that are conducted the conclusion is madethat it is very likely the players choices are affected by the colors in the environment, but it isnot clear to say how they are affected.

    Fulltekst (pdf)
    fulltext
  • 269.
    Andréasson, Maia
    et al.
    Department of Swedish Language, University of Gothenburg.
    Borin, Lars
    Department of Swedish Language, University of Gothenburg.
    Forsberg, Markus
    Department of Swedish Language, University of Gothenburg.
    Beskow, Jonas
    School of Computer Science and Communication, KTH.
    Carlsson, Rolf
    School of Computer Science and Communication, KTH.
    Edlund, Jens
    School of Computer Science and Communication, KTH.
    Elenius, Kjell
    School of Computer Science and Communication, KTH.
    Hellmer, Kahl
    School of Computer Science and Communication, KTH.
    House, David
    School of Computer Science and Communication, KTH.
    Merkel, Magnus
    Department of Computer Science, Linköping University.
    Forsbom, Eva
    Uppsala universitet, Humanistisk-samhällsvetenskapliga vetenskapsområdet, Språkvetenskapliga fakulteten, Institutionen för lingvistik och filologi.
    Megyesi, Beáta
    Uppsala universitet, Humanistisk-samhällsvetenskapliga vetenskapsområdet, Språkvetenskapliga fakulteten, Institutionen för lingvistik och filologi.
    Eriksson, Anders
    Department of Philosophy, Linguistics and Theory of Science, University of Gothenburg.
    Strömqvist, Sven
    Centre for Languages and Literature, Lund University.
    Swedish CLARIN Activities2009Inngår i: Proceedings of the NODALIDA 2009 workshop Nordic Perspectives on the CLARIN Infrastructure of Language Resources / [ed] Rickard Domeij, Kimmo Koskenniemi, Steven Krauwer, Bente Maegaard, Eiríkur Rögnvaldsson and Koenraad de Smedt, Northern European Association for Language Technology (NEALT) , 2009, s. 1-5Konferansepaper (Fagfellevurdert)
    Abstract [en]

    Although Sweden has yet to allocate funds specifically intended for CLARIN activities, there are some ongoing activities which are directly relevant to CLARIN, and which are explicitly linked to CLARIN. These activities have been funded by the Committee for Research Infrastructures and its subcommittee DISC (Database Infrastructure Committee) of the Swedish Research Council.

  • 270. Andrée, Martin
    et al.
    Paasch, Jesper M.
    Paulsson, Jenny
    Seipel, Stefan
    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.
    BIM and 3D property visualisation2018Inngår i: Proc. FIG Congress 2018, 2018, artikkel-id 9367Konferansepaper (Fagfellevurdert)
  • 271.
    Anneli, Edman
    et al.
    Uppsala universitet, Humanistisk-samhällsvetenskapliga vetenskapsområdet, Samhällsvetenskapliga fakulteten, Institutionen för informationsvetenskap. Data- och systemvetenskap.
    Shohreh, Hörnqvist
    Uppsala universitet, Humanistisk-samhällsvetenskapliga vetenskapsområdet, Samhällsvetenskapliga fakulteten, Institutionen för informationsvetenskap. Data- och systemvetenskap.
    Mobil teknik och mobilt lärande: ett stöd för skola och vård för effektvisering av lärandet och arbete2006Rapport (Annet (populærvitenskap, debatt, mm))
    Abstract [en]

    Mobilitet hos människor har ökat inom många områden i och med utvecklingen och framväxten av den mobila teknologin. Ett av de områden som har blivit påverkat av denna tekniska utveckling är lärande och utbildning både inom arbetslivet och inom skolvärlden. Idag beräknas många yrkeskategorier tillbringa mer än halva sin arbetstid utanför arbetsplatsen. Antalet abonnenter som har tillgång till trådlöst Internet förväntas öka lavinartat under det närmaste decenniet. Digital information och inlärningsmaterial ryms redan nu i våra fickor och vi har möjlighet att koppla upp oss mot varandra och kommunicera oavsett plats och tidpunkt.

    Syftet med rapporten är att presentera de olika formerna av lärande, dvs. distanslärande, elektroniskt lärande och mobilt lärande. Betoningen i detta arbete är på den sistnämnda lärandeformen, mobilt lärande. En jämförelse mellan mobilt lärande och livslångt lärande genomförs och likheterna mellan dessa diskuteras. Syftet är också att diskutera användningen av mobilteknik och mobilt lärande inom utbildningsväsendet och vården i syfte att effektivisera lärandet, kommunikation, kunskapshantering och arbete. Detta för att kunna införa och uppnå en optimal form av livslångt mobilt lärande och mobilt arbete i våra skolor och inom arbetsplatser med hjälp av den nya tekniken.

  • 272.
    Anslan, Sten
    et al.
    Braunschweig Univ Technol, Zool Inst, Mendelssohnstr 4, D-38106 Braunschweig, Germany.
    Nilsson, R. Henrik
    Univ Gothenburg, Dept Biol & Environm Sci, Gothenburg Global Biodivers Ctr, Box 461, S-40530 Gothenburg, Sweden.
    Wurzbacher, Christian
    Tech Univ Munich, Coulombwall 3, D-85748 Garching, Germany.
    Baldrian, Petr
    Czech Acad Sci, Inst Microbiol, Videnska 1083, Prague 14220 4, Czech Republic.
    Tedersoo, Leho
    Tartu Univ, Nat Hist Museum, 14a Ravila, Tartu 50411, Estonia.
    Bahram, Mohammad
    Uppsala universitet, Teknisk-naturvetenskapliga vetenskapsområdet, Biologiska sektionen, Institutionen för organismbiologi, Systematisk biologi. Tartu Univ, Inst Ecol & Earth Sci, 14a Ravila, EE-50411 Tartu, Estonia;Swedish Univ Agr Sci, Dept Ecol, Ulls Vag 16, S-75651 Uppsala, Sweden.
    Great differences in performance and outcome of high-throughput sequencing data analysis platforms for fungal metabarcoding2018Inngår i: MycoKeys, ISSN 1314-4057, E-ISSN 1314-4049, nr 39, s. 29-40Artikkel i tidsskrift (Fagfellevurdert)
    Abstract [en]

    Along with recent developments in high-throughput sequencing (HTS) technologies and thus fast accumulation of HTS data, there has been a growing need and interest for developing tools for HTS data processing and communication. In particular, a number of bioinformatics tools have been designed for analysing metabarcoding data, each with specific features, assumptions and outputs. To evaluate the potential effect of the application of different bioinformatics workflow on the results, we compared the performance of different analysis platforms on two contrasting high-throughput sequencing data sets. Our analysis revealed that the computation time, quality of error filtering and hence output of specific bioinformatics process largely depends on the platform used. Our results show that none of the bioinformatics workflows appears to perfectly filter out the accumulated errors and generate Operational Taxonomic Units, although PipeCraft, LotuS and PIPITS perform better than QIIME2 and Galaxy for the tested fungal amplicon dataset. We conclude that the output of each platform requires manual validation of the OTUs by examining the taxonomy assignment values.

    Fulltekst (pdf)
    fulltext
  • 273.
    Ansved, Linn
    et al.
    Uppsala universitet, Teknisk-naturvetenskapliga vetenskapsområdet, Matematisk-datavetenskapliga sektionen, Institutionen för informationsteknologi, Avdelningen för visuell information och interaktion.
    Eklann, Karin
    Uppsala universitet, Teknisk-naturvetenskapliga vetenskapsområdet, Matematisk-datavetenskapliga sektionen, Institutionen för informationsteknologi, Avdelningen för visuell information och interaktion.
    Exploring ways to convey medical information during digital triage: A combined user research and machine learning approach2019Independent thesis Advanced level (professional degree), 20 poäng / 30 hpOppgave
    Abstract [en]

    The aim of this project was to investigate what information is critical to convey to nurses when performing digital triage. In addition, the project aimed to investigate how such information could be visualized. This was done through a combined user research and machine learning approach, which enabled for a more nuanced and thorough investigation compared to only making use of one of the two fields.

    There is sparse research investigating how digital triaging can be improved and made more efficient. Therefore, this study has contributed with new and relevant insights. Three machine learning algorithms were implemented to predict the right level of care for a patient. Out of these three, the random forest classifier proved to have the best performance with an accuracy of 69.46%, also having the shortest execution time. Evaluating the random forest classifier, the most important features were stated to be the duration and progress of the symptoms, allergies to medicine, chronic diseases and the patient's own estimation of his/her health. These factors could all be confirmed by the user research approach, indicating that the results from the approaches were aligned. The results from the user research approach also showed that the patients' own description of their symptoms was of great importance. These findings served as a basis for a number of visualization decisions, aiming to make the triage process as accurate and efficient as possible.

    Fulltekst (pdf)
    fulltext
  • 274.
    Anthonisen, Johanne
    et al.
    Uppsala universitet, Humanistisk-samhällsvetenskapliga vetenskapsområdet, Samhällsvetenskapliga fakulteten, Institutionen för informatik och media.
    Malmström, Rickard
    Uppsala universitet, Humanistisk-samhällsvetenskapliga vetenskapsområdet, Samhällsvetenskapliga fakulteten, Institutionen för informatik och media.
    Spelifiering inom rekryteringsprocesser: En kvalitativ fallstudie av det spelifierade rekryteringsverktyget Skyrise City2019Independent thesis Basic level (degree of Bachelor), 10 poäng / 15 hpOppgave
    Abstract [sv]

    Effektiv rekrytering är en viktig faktor för att ett företag ska bli framgångsrikt. För att hamna i framkant inom rekrytering har företag börjat använda alternativa tillvägagångssätt. En metod som blir allt mer vanligt förekommande inom rekrytering är spelifiering. Spelifiering definieras som användandet av spelbaserade element, estetik och speltänkande för att engagera människor, motivera handlingar, främja lärande och problemlösning, i en icke spelrelaterad kontext. Syftet med denna studie är att undersöka hur spelifiering används inom rekrytering samt vad för konsekvenser det medför. En kvalitativ fallstudie har genomförts och undersökt game-based assessmentverktyget Skyrise City, utvecklat av Arctic Shores. Fallstudien har realiserats på ITföretaget EVRYs rekryteringsprocess och deras användning av Skyrise City. Studien bygger på ett antal semistrukturerade intervjuer, där sakkunniga personer inom rekrytering och spelifiering vid företagen har intervjuats. Resultatet analyserades utifrån ett teoretiskt ramverk sammansatt av fem traditionella rekryteringsmoment. De slutsatser som kan dras av studien är att spelifiering i rekryteringsprocessen används inom games, gamified assessments och gamebased assessments. De konsekvenser som spelifiering medför till en rekryteringsprocess är bland annat: game-based assessments mäter vad du gör snarare än vad du säger, det kan stärka ett företags arbetsgivarvarumärke, det kan leda till ökade kandidatansökningar, det kan vara mer tidseffektivt, det är svårare att fuska till sig bra resultat, samt ger bättre möjligheter för kundanpassning. 

    Fulltekst (pdf)
    fulltext
  • 275.
    Antomonov, Filip
    et al.
    Uppsala universitet, Humanistisk-samhällsvetenskapliga vetenskapsområdet, Språkvetenskapliga fakulteten, Institutionen för lingvistik och filologi.
    Megyesi, Beata
    Uppsala universitet, Humanistisk-samhällsvetenskapliga vetenskapsområdet, Språkvetenskapliga fakulteten, Institutionen för lingvistik och filologi.
    Automatic Morphosyntactic Analaysis of Clinical Text2014Konferansepaper (Fagfellevurdert)
    Abstract [en]

    Electronical health records, also called clinical texts, have their own linguistic characteristics and have been shown to deviate from standard language. Therefore, computational linguistics tools trained on standard language presumably do not achieve the same accuracy when applied to clinical data. In this paper, we describe a pipeline of tools for the automatic processing of clinical texts in Swedish from tokenization through part-of-speech tagging and dependency parsing. The evaluation of the components of the pipeline shows that existing NLP tools can be used, but performance drops greatly when models trained on standard language are applied to clinical data. We also present a small, syntactically annotated data set of clinical text to serve as gold standard.

    Fulltekst (pdf)
    fulltext
  • 276.
    Antonsson, Elin
    et al.
    Uppsala universitet, Teknisk-naturvetenskapliga vetenskapsområdet, Biologiska sektionen, Institutionen för biologisk grundutbildning.
    Eulau, William
    Uppsala universitet, Teknisk-naturvetenskapliga vetenskapsområdet, Biologiska sektionen, Institutionen för biologisk grundutbildning.
    Fitkin, Louise
    Uppsala universitet, Teknisk-naturvetenskapliga vetenskapsområdet, Biologiska sektionen, Institutionen för biologisk grundutbildning.
    Johansson, Jennifer
    Uppsala universitet, Teknisk-naturvetenskapliga vetenskapsområdet, Biologiska sektionen, Institutionen för biologisk grundutbildning.
    Levin, Fredrik
    Uppsala universitet, Teknisk-naturvetenskapliga vetenskapsområdet, Biologiska sektionen, Institutionen för biologisk grundutbildning.
    Lundqvist, Sara
    Uppsala universitet, Teknisk-naturvetenskapliga vetenskapsområdet, Biologiska sektionen, Institutionen för biologisk grundutbildning.
    Palm, Elin
    Uppsala universitet, Teknisk-naturvetenskapliga vetenskapsområdet, Biologiska sektionen, Institutionen för biologisk grundutbildning.
    Framtidens biomarkörer: En prioritering av proteinerna i det humana plasmaproteomet2019Independent thesis Basic level (degree of Bachelor), 10 poäng / 15 hpOppgave
    Abstract [en]

    In this report, we rank possible protein biomarkers based on different criteria for use in Olink Proteomics’ protein panels. We started off with a list compiled through the Human Plasma Proteome Project (HPPP) and have in different ways used this to obtain the final results. To complete this task we compared the list with Olink’s and its competitors’ protein catalogs, identified diseases beyond Olink’s coverage and the proteins linked with these. We also created a scoring system used to fa- cilitate detection of good biomarkers. From this, we have concluded that Olink should focus on proteins that the competitors have in their catalogs and proteins that can be found in many pathways and are linked with many diseases. From each of the methods used, we have been able to identify a number of proteins that we recommend Olink to investigate further.

    Fulltekst (pdf)
    19-X4_Slutrapport
    Download (zip)
    Elektroniskt_appendix
  • 277. Anzt, Hartwig
    et al.
    Lukarski, Dimitar
    Uppsala universitet, Teknisk-naturvetenskapliga vetenskapsområdet, Matematisk-datavetenskapliga sektionen, Institutionen för informationsteknologi, Avdelningen för beräkningsvetenskap. Uppsala universitet, Teknisk-naturvetenskapliga vetenskapsområdet, Matematisk-datavetenskapliga sektionen, Institutionen för informationsteknologi, Tillämpad beräkningsvetenskap.
    Tomov, Stanimire
    Dongarra, Jack
    Self-adaptive multiprecision preconditioners on multicore and manycore architectures2015Inngår i: High Performance Computing for Computational Science – VECPAR 2014, Springer, 2015, s. 115-123Konferansepaper (Fagfellevurdert)
  • 278. Apelkrans, Mats
    et al.
    Håkansson, Anne
    Uppsala universitet, Humanistisk-samhällsvetenskapliga vetenskapsområdet, Samhällsvetenskapliga fakulteten, Institutionen för informationsvetenskap.
    Enterprise systems Configuration as an Information Logistics Process - A Case Study2007Inngår i: Proceedings of 9th International Conference on Enterprise Information Systems: ICEIS-2007, 2007, s. 10-Konferansepaper (Fagfellevurdert)
    Abstract [en]

    In this paper, we suggest using rule-based descriptions of customer’s requirements for Enterprise Systems implementing Information Logistics. The rules are developed from the users’ requirements and inserted as schedules to the Enterprise System. The output, from testing these rules, is a list of modules and parameter setting to configure the system. By using rules, we can, at least partly, automate the configuration process for traverse the several modules and thousands parameters there are in an Enterprise System. From the list, we can select the modules and the parameters that meet the customer’s requirements. Then these selected modules and parameters are visually presented through a kind of Unified Modeling Language diagrams, to support the user investigation and then to configure the system either manually or automatically. Every attempt to match a customer’s requirement to the contents of the knowledge base within the Enterprise system can be thought of as an Information Logistics Process. The output from such a process must be examined by the user, which can give rise to a new call to the Information Logistics process. In other words the configuration work is done through a dialogue between the customer and the knowledge base of the Enterprise system.

  • 279.
    Apelkrans, Mats
    et al.
    Jönköping International Business School.
    Håkansson, Anne
    Uppsala universitet, Humanistisk-samhällsvetenskapliga vetenskapsområdet, Samhällsvetenskapliga fakulteten, Institutionen för informationsvetenskap.
    Information coordination using Meta-Agents in Information Logistics Processes2008Inngår i: Proceedings of Knowledge-Based and Intelligent Information & Engineering Systems: KES2008, Berlin, Heidelberg: LNCS/LNAI, Springer-Verlag , 2008, s. 788-798Konferansepaper (Fagfellevurdert)
    Abstract [en]

    In order to coordinate and deliver information in the right time and to the right place, theories from multi-agent systems and information logistics are combined. We use agents to support supply chain by searching for company specific information. Hence, there are a vast number of agents working at the Internet, simultaneously, which requires supervising agents. In this paper, we suggest using meta-agents to control the behaviour of a number of intelligent agents, where the meta-agents are working with coordination of the communication that takes place in a supply chain system. As an example, we look at a manufacturing company receiving orders on items from customers, which need to be produced. The handling of this distributed information flow can be thought of as an Information Logistics Processes and the similarities of the functioning of processes and intelligent agents’ behaviour are illuminated.

  • 280. Appelö, Daniel
    et al.
    Kreiss, Gunilla
    Uppsala universitet, Teknisk-naturvetenskapliga vetenskapsområdet, Matematisk-datavetenskapliga sektionen, Institutionen för informationsteknologi, Avdelningen för teknisk databehandling. Uppsala universitet, Teknisk-naturvetenskapliga vetenskapsområdet, Matematisk-datavetenskapliga sektionen, Institutionen för informationsteknologi, Numerisk analys.
    Application of a perfectly matched layer to the nonlinear wave equation2007Inngår i: Wave motion, ISSN 0165-2125, E-ISSN 1878-433X, Vol. 44, s. 531-548Artikkel i tidsskrift (Fagfellevurdert)
  • 281. Appleton, Owen
    et al.
    Cameron, David
    Cernák, Jozef
    Dóbé, Péter
    Ellert, Mattias
    Uppsala universitet, Teknisk-naturvetenskapliga vetenskapsområdet, Fysiska sektionen, Institutionen för fysik och astronomi, Högenergifysik.
    Frågåt, Thomas
    Grønager, Michael
    Johansson, Daniel
    Jönemo, Johan
    Kleist, Josva
    Kocan, Marek
    Konstantinov, Aleksandr
    Kónya, Balázs
    Márton, Iván
    Mohn, Bjarte
    Uppsala universitet, Teknisk-naturvetenskapliga vetenskapsområdet, Fysiska sektionen, Institutionen för fysik och astronomi, Högenergifysik.
    Möller, Steffen
    Müller, Henning
    Nagy, Zsombor
    Nilsen, Jon K.
    Ould-Saada, Farid
    Pajchel, Katarina
    Qiang, Weizhong
    Read, Alexander
    Rosendahl, Peter
    Röczei, Gábor
    Savko, Martin
    Skou Andersen, Martin
    Smirnova, Oxana
    Stefán, Péter
    Szalai, Ferenc
    Taga, Adrian
    Toor, Salman Z.
    Uppsala universitet, Teknisk-naturvetenskapliga vetenskapsområdet, Matematisk-datavetenskapliga sektionen, Institutionen för informationsteknologi, Avdelningen för teknisk databehandling. Uppsala universitet, Teknisk-naturvetenskapliga vetenskapsområdet, Matematisk-datavetenskapliga sektionen, Institutionen för informationsteknologi, Tillämpad beräkningsvetenskap.
    Wäänänen, Anders
    Zhou, Xin
    The next-generation ARC middleware2010Inngår i: Annales des télécommunications, ISSN 0003-4347, E-ISSN 1958-9395, Vol. 65, s. 771-776Artikkel i tidsskrift (Fagfellevurdert)
  • 282. Aquilante, Francesco
    et al.
    Boman, Linus
    Boström, Jonas
    Koch, Henrik
    Lindh, Roland
    Uppsala universitet, Teknisk-naturvetenskapliga vetenskapsområdet, Kemiska sektionen, Institutionen för fysikalisk och analytisk kemi, Kvantkemi.
    Sánchez de Merás, Alfredo
    Pedersen, Thomas Bondo
    Cholesky decomposition techniques in electronic structure theory2011Inngår i: Linear-Scaling Techniques in Computational Chemistry and Physics: Methods and Applications / [ed] R. Zalesny, P. Mezey, M. G. Papadopoulos and J. Leszczynski, Springer, 2011, s. 301-304Kapittel i bok, del av antologi (Annet vitenskapelig)
    Abstract [en]

    We review recently developed methods to efficiently utilize the Cholesky decomposition technique in electronic structure calculations. The review starts with a brief introduction to the basics of the Cholesky decomposition technique. Subsequently, examples of applications of the technique to ab inito procedures are presented. The technique is demonstrated to be a special type of a resolution-of-identity or density-fitting scheme. This is followed by explicit examples of the Cholesky techniques used in orbital localization, computation of the exchange contributionto the Fock matrix, in MP2, gradient calculations, and so-called method specific Cholesky decomposition. Subsequently, examples of calibration of the method with respect to computed total energies, excitation energies, and auxiliary basis set pruning are presented. In particular, it is demonstrated that the Cholesky method is an unbiased method to derive auxiliary basis sets. Furthermore, details of the implementational considerations are put forward and examples from a parallel Cholesky decomposition scheme is presented. Finally, an outlook and perspectives are presented, followed by a summary and conclusions section. We are of the opinion that the Cholesky decomposition method is a technique that has been overlooked for too long. We have just recently started to understand how to efficiently incorporate the method in existing ab initio programs. The full potential of the Cholesky technique has not yet been fully explored.

    Fulltekst (pdf)
    FULLTEXT01
  • 283.
    Arabaci, Engin
    Uppsala universitet, Humanistisk-samhällsvetenskapliga vetenskapsområdet, Samhällsvetenskapliga fakulteten, Institutionen för informatik och media.
    Motstånd och problem vid implementeringen av ERP-system: En litteraturstudie av förändringshantering och motstånd vid implementeringen av ett ERP-system. Studien ger även förslag på förebyggande åtgärder baserat på dokumenterade fallstudier2011Independent thesis Basic level (degree of Bachelor), 15 poäng / 22,5 hpOppgave
    Abstract [sv]

    Syfte – Syftet med denna uppsats var att genom existerande fallstudier, enkätundersökningar och annan sekundärdata identifiera vilka faktorer som ger upphov till motstånd vid implementeringen av ERP-system och hur detta motstånd kan förebyggas.Metod – Metoden som användes i denna uppsats är dokument. Dokument i denna uppsats var sekundärdata i form av artiklar och böcker från världsledande journaler inom området ERP-implementering. Uppsatsens teori, analyser och modeller bygger kring dessa artiklar och böcker.Resultat och analys – Resultaten från denna studie tyder på att alla ERP-implementeringar möter motstånd vid ERP-projekt. Det är hanteringen och förebyggandet av dessa motståndsbeteenden som avgör projektets framgång. De viktigaste faktorerna som gav upphov till motstånd var: Lågt engagemang från ledning och styrelse, otillräcklig utbildning och träning vilket resulterar i kunskapsbarriärer, projektgrupp med individer som inte har tillräckligt med erfarenhet, inflytande och kunskap, bristfällig förändringshantering med en passiv ledarstil, systemets kvalitet och pålitlighet och ingen tydlig vision och affärsstrategi. Studien kom även fram till att implementeringen består av tre stora faser: innan, under och efter implementering. Misstag som görs vid fasen innan implementering visade sig vara mest avgörande för projektens framgång. Studien presenterar även olika förebyggande åtgärder som kan användas för att minska motståndsbeteendena som uppstår. De förebyggande faktorerna är: En tydlig affärsplan och vision för projektet som slutanvändarna lätt kan ta till sig, starkt stöd från ledning så att även lägre nivåer känner stöd för projektet, förutse förändringar i affärsprocesser genom att analysera konsekvenserna av implementeringen, support och kommunikation med berörda intressenter för att tidigt upptäcka problem, en projektgrupp med inflytande och erfarenhet som jobbar heltid med projektet och träning och utbildning för att övervinna kunskapsbarriärer som kan resultera i motstånd.Originalitet – Denna studie samlar den senaste forskningen kring ERP-implementation och motståndsbeteenden. En modell som visualiserar hur motstånd påverkar implementationen har även skapats som en generell vägledande modell för organisationer som implementerar ERP-system.Nyckelord – ERP, ERP-implementation, motståndsbeteenden, ERP-implementation faser.

    Fulltekst (pdf)
    FULLTEXT01
  • 284. Arafailova, Ekaterina
    et al.
    Beldiceanu, Nicolas
    Carlsson, Mats
    Flener, Pierre
    Uppsala universitet, Teknisk-naturvetenskapliga vetenskapsområdet, Matematisk-datavetenskapliga sektionen, Institutionen för informationsteknologi, Datalogi.
    Francisco Rodríguez, María Andreína
    Uppsala universitet, Teknisk-naturvetenskapliga vetenskapsområdet, Matematisk-datavetenskapliga sektionen, Institutionen för informationsteknologi, Datalogi.
    Pearson, Justin
    Uppsala universitet, Teknisk-naturvetenskapliga vetenskapsområdet, Matematisk-datavetenskapliga sektionen, Institutionen för informationsteknologi, Datalogi.
    Simonis, Helmut
    Systematic derivation of bounds and glue constraints for time-series constraints2016Inngår i: Principles and Practice of Constraint Programming: CP 2016, Springer, 2016, s. 13-29Konferansepaper (Fagfellevurdert)
  • 285. Arafailova, Ekaterina
    et al.
    Beldiceanu, Nicolas
    Douence, Rémi
    Carlsson, Mats
    Flener, Pierre
    Uppsala universitet, Teknisk-naturvetenskapliga vetenskapsområdet, Matematisk-datavetenskapliga sektionen, Institutionen för informationsteknologi, Datalogi.
    Francisco Rodríguez, María Andreína
    Uppsala universitet, Teknisk-naturvetenskapliga vetenskapsområdet, Matematisk-datavetenskapliga sektionen, Institutionen för informationsteknologi, Datalogi.
    Pearson, Justin
    Uppsala universitet, Teknisk-naturvetenskapliga vetenskapsområdet, Matematisk-datavetenskapliga sektionen, Institutionen för informationsteknologi, Datalogi.
    Simonis, Helmut
    Global Constraint Catalog: Volume II, time-series constraints2016Rapport (Annet vitenskapelig)
  • 286. Arafailova, Ekaterina
    et al.
    Beldiceanu, Nicolas
    Douence, Rémi
    Flener, Pierre
    Uppsala universitet, Teknisk-naturvetenskapliga vetenskapsområdet, Matematisk-datavetenskapliga sektionen, Institutionen för informationsteknologi, Datalogi.
    Francisco Rodríguez, María Andreína
    Uppsala universitet, Teknisk-naturvetenskapliga vetenskapsområdet, Matematisk-datavetenskapliga sektionen, Institutionen för informationsteknologi, Datalogi.
    Pearson, Justin
    Uppsala universitet, Teknisk-naturvetenskapliga vetenskapsområdet, Matematisk-datavetenskapliga sektionen, Institutionen för informationsteknologi, Datalogi.
    Simonis, Helmut
    Time-series constraints: Improvements and application in CP and MIP contexts2016Inngår i: Integration of AI and OR Techniques in Constraint Programming, Springer, 2016, s. 18-34Konferansepaper (Fagfellevurdert)
  • 287.
    Arampatzis, Avi
    et al.
    Democritus University of Thrace, Department of Electrical and Computer Engineering.
    Kalamatianos, Georgios
    Democritus University of Thrace, Department of Electrical and Computer Engineering.
    Suggesting Points-of-Interest via Content-Based, Collaborative, and Hybrid Fusion Methods in Mobile Devices2018Inngår i: ACM Transactions on Information Systems, ISSN 1046-8188, E-ISSN 1558-2868, Vol. 36, nr 3Artikkel i tidsskrift (Fagfellevurdert)
    Abstract [en]

    Recommending venues or points-of-interest (POIs) is a hot topic in recent years, especially for tourism applications and mobile users. We propose and evaluate several suggestion methods, taking an effectiveness, feasibility, efficiency and privacy perspective. The task is addressed by two content-based methods (a Weighted kNN classifier and a Rated Rocchio personalized query), Collaborative Filtering methods, as well as several (rank-based or rating-based) methods of merging results of different systems. Effectiveness is evaluated on two standard benchmark datasets, provided and used by TREC’s Contextual Suggestion Tracks in 2015 and 2016. First, we enrich these datasets with more information on venues, collected from web services like Foursquare and Yelp; we make this extra data available for future experimentation. Then, we find that the content-based methods provide state-of-the-art effectiveness, the collaborative filtering variants mostly suffer from data sparsity problems in the current datasets, and the merging methods further improve results by mainly promoting the first relevant suggestion. Concerning mobile feasibility, efficiency, and user privacy, the content-based methods, especially Rated Rocchio, are the best. Collaborative filtering has the worst efficiency and privacy leaks. Our findings can be very useful for developing effective and efficient operational systems, respecting user privacy. Last, our experiments indicate that better benchmark datasets would be welcome, and the use of additional evaluation measures-more sensitive in recall-is recommended.

  • 288.
    Araujo, Hugo
    et al.
    Univ Fed Pernambuco, Recife, PE, Brazil.
    Carvalho, Gustavo
    Univ Fed Pernambuco, Recife, PE, Brazil.
    Mohaqeqi, Morteza
    Uppsala universitet, Teknisk-naturvetenskapliga vetenskapsområdet, Matematisk-datavetenskapliga sektionen, Institutionen för informationsteknologi, Datorteknik.
    Mousavi, Mohammad Reza
    Halmstad Univ, Halmstad, Sweden;Univ Leicester, Leicester, Leics, England.
    Sampaio, Augusto
    Univ Fed Pernambuco, Recife, PE, Brazil.
    Sound conformance testing for cyber-physical systems: Theory and implementation2018Inngår i: Science of Computer Programming, ISSN 0167-6423, E-ISSN 1872-7964, Vol. 162, s. 35-54Artikkel i tidsskrift (Fagfellevurdert)
    Abstract [en]

    Conformance testing is a formal and structured approach to verifying system correctness. We propose a conformance testing algorithm for cyber-physical systems, based on the notion of hybrid conformance by Abbas and Fainekos. We show how the dynamics of system specification and the sampling rate play an essential role in making sound verdicts. We specify and prove error bounds that lead to sound test-suites for a given specification and a given sampling rate. We use reachability analysis to find such bounds and implement the proposed approach using the CORA toolbox in Matlab. We apply the implemented approach on a case study from the automotive domain.

    Fulltekst (pdf)
    fulltext
  • 289. Arcelli, Carlo
    et al.
    Sanniti di Baja, Gabriella
    Svensson, Stina
    Uppsala universitet, Fakultetsövergripande enheter, Centrum för bildanalys. Teknisk-naturvetenskapliga vetenskapsområdet, Matematisk-datavetenskapliga sektionen, Institutionen för informationsteknologi, Datoriserad bildanalys.
    Computing and analysing convex deficiencies to characterise 3D complex objects2005Inngår i: Image and Vision Computing: Discrete Geometry for Computer Imagery, Vol. 23, nr 2, s. 203-211Artikkel i tidsskrift (Fagfellevurdert)
    Abstract [en]

    Entities such as object components, cavities, tunnels and concavities in 3D digital images can be useful in the framework of object analysis. For each object component, we first identify its convex deficiencies, by subtracting the object component from a covering polyhedron approximating the convex hull. Watershed segmentation is then used to decompose complex convex deficiencies into simpler parts, corresponding to individual cavities, concavities and tunnels of the object component. These entities are finally described by means of a representation system accounting for the shape features characterising them.

  • 290.
    Ardon, Sebastien
    et al.
    UNSW, Sydney.
    Gunningberg, Per
    Uppsala universitet, Teknisk-naturvetenskapliga vetenskapsområdet, Matematisk-datavetenskapliga sektionen, Institutionen för informationsteknologi, Datorteknik.
    Landfeldt, Björn
    Ericsson Research AB.
    Ismailov, Yuri
    Ericsson Research AB.
    Portmann, Marius
    UNSW, Sydney.
    Seneviratne, Aruna
    UNSW, Sydney.
    Mobile Aware Server Architecture: A distributed proxy architecture for content adaptation2001Inngår i: INET 2001 Proceedings, 2001Konferansepaper (Annet (populærvitenskap, debatt, mm))
  • 291.
    Arentzen, Thomas
    Uppsala universitet, Humanistisk-samhällsvetenskapliga vetenskapsområdet, Språkvetenskapliga fakulteten, Institutionen för lingvistik och filologi.
    Mary Retold2019Inngår i: Ancient Jew ReviewArtikkel i tidsskrift (Annet vitenskapelig)
  • 292.
    Aris, Ahmet
    et al.
    Istanbul Technical University.
    Oktuğ, Sema
    Istanbul Technical University.
    Voigt, Thiemo
    Uppsala universitet, Teknisk-naturvetenskapliga vetenskapsområdet, Matematisk-datavetenskapliga sektionen, Institutionen för informationsteknologi, Datorarkitektur och datorkommunikation.
    Security of Internet of Things for a Reliable Internet of Services2018Inngår i: Autonomous Control for a Reliable Internet of Services: Methods, Models, Approaches, Techniques, Algorithms, and Tools / [ed] Ivan Ganchev, R. D. van der Mei, Hans van den Berg, Cham , 2018Kapittel i bok, del av antologi (Fagfellevurdert)
    Fulltekst (pdf)
    fulltext
  • 293.
    Arlt, Stephan
    et al.
    Universite du Luxembourg.
    Rubio-Gonzalez, Cindy
    University of California, Berkeley.
    Rümmer, Philipp
    Uppsala universitet, Teknisk-naturvetenskapliga vetenskapsområdet, Matematisk-datavetenskapliga sektionen, Institutionen för informationsteknologi, Datorteknik.
    Schäf, Martin
    SRI International.
    Shankar, Natarajan
    SRI International.
    The Gradual Verifier2014Inngår i: NASA Formal Methods: 6th International Symposium, NFM 2014, Houston, TX, USA, April 29 – May 1, 2014. Proceedings, Switzerland, 2014, s. 313-327Konferansepaper (Fagfellevurdert)
    Fulltekst (pdf)
    fulltext
  • 294. Arlt, Stephan
    et al.
    Rümmer, Philipp
    Uppsala universitet, Teknisk-naturvetenskapliga vetenskapsområdet, Matematisk-datavetenskapliga sektionen, Institutionen för informationsteknologi, Datorteknik.
    Schäf, Martin
    A theory for control-flow graph exploration2013Inngår i: Automated Technology for Verification and Analysis: ATVA 2013, Springer Berlin/Heidelberg, 2013, s. 506-515Konferansepaper (Fagfellevurdert)
  • 295. Armstrong, Alasdair
    et al.
    Struth, Georg
    Weber, Tjark
    Uppsala universitet, Teknisk-naturvetenskapliga vetenskapsområdet, Matematisk-datavetenskapliga sektionen, Institutionen för informationsteknologi, Datalogi.
    Kleene Algebra2013Inngår i: Archive of Formal Proofs, ISSN 2150-914xArtikkel i tidsskrift (Fagfellevurdert)
  • 296. Armstrong, Alasdair
    et al.
    Struth, Georg
    Weber, Tjark
    Uppsala universitet, Teknisk-naturvetenskapliga vetenskapsområdet, Matematisk-datavetenskapliga sektionen, Institutionen för informationsteknologi, Datalogi.
    Program Analysis and Verification Based on Kleene Algebra in Isabelle/HOL2013Inngår i: Interactive Theorem Proving: ITP 2013, Springer Berlin/Heidelberg, 2013, s. 197-212Konferansepaper (Fagfellevurdert)
    Abstract [en]

    Schematic Kleene algebra with tests (SKAT) supports the equational verification of flowchart scheme equivalence and captures simple while-programs with assignment statements. We formalise SKAT in Isabelle/HOL, using the quotient type package to reason equationally in this algebra. We apply this formalisation to a complex flowchart transformation proof from the literature. We extend SKAT with assertion statements and derive the inference rules of Hoare logic. We apply this extension in simple program verification examples and the derivation of additional Hoare-style rules. This shows that algebra can provide an abstract semantic layer from which different program analysis and verification tasks can be implemented in a simple lightweight way.

    Fulltekst (pdf)
    fulltext
  • 297.
    Aronis, Stavros
    Uppsala universitet, Teknisk-naturvetenskapliga vetenskapsområdet, Matematisk-datavetenskapliga sektionen, Institutionen för informationsteknologi, Avdelningen för datalogi. Uppsala universitet, Teknisk-naturvetenskapliga vetenskapsområdet, Matematisk-datavetenskapliga sektionen, Institutionen för informationsteknologi, Datalogi.
    Effective Techniques for Stateless Model Checking2018Doktoravhandling, med artikler (Annet vitenskapelig)
    Abstract [en]

    Stateless model checking is a technique for testing and verifying concurrent programs, based on exploring the different ways in which operations executed by the processes of a concurrent program can be scheduled. The goal of the technique is to expose all behaviours that can be a result of scheduling non-determinism. As the number of possible schedulings is huge, however, techniques that reduce the number of schedulings that must be explored to achieve verification have been developed. Dynamic partial order reduction (DPOR) is a prominent such technique.

    This dissertation presents a number of improvements to dynamic partial order reduction that significantly increase the effectiveness of stateless model checking. Central among these improvements are the Source and Optimal DPOR algorithms (and the theoretical framework behind them) and a technique that allows the observability of the interference of operations to be used in dynamic partial order reduction. Each of these techniques can exponentially decrease the number of schedulings that need to be explored to verify a concurrent program. The dissertation also presents a simple bounding technique that is compatible with DPOR algorithms and effective for finding bugs in concurrent programs, if the number of schedulings is too big to make full verification possible in a reasonable amount of time, even when the improved algorithms are used.

    All improvements have been implemented in Concuerror, a tool for applying stateless model checking to Erlang programs. In order to increase the effectiveness of the tool, the interference of the high-level operations of the Erlang/OTP implementation is examined, classified and precisely characterized. Aspects of the implementation of the tool are also described. Finally, a use case is presented, showing how Concuerror was used to find bugs and verify key correctness properties in repair techniques for the CORFU chain replication protocol.

    Delarbeid
    1. Source Sets: A Foundation for Optimal Dynamic Partial Order Reduction
    Åpne denne publikasjonen i ny fane eller vindu >>Source Sets: A Foundation for Optimal Dynamic Partial Order Reduction
    2017 (engelsk)Inngår i: Journal of the ACM, ISSN 0004-5411, E-ISSN 1557-735X, Vol. 64, nr 4, artikkel-id 25Artikkel i tidsskrift (Fagfellevurdert) Published
    Abstract [en]

    Stateless model checking is a powerful method for program verification that, however, suffers from an exponential growth in the number of explored executions. A successful technique for reducing this number, while still maintaining complete coverage, is Dynamic Partial Order Reduction (DPOR), an algorithm originally introduced by Flanagan and Godefroid in 2005 and since then not only used as a point of reference but also extended by various researchers. In this article, we present a new DPOR algorithm, which is the first to be provably optimal in that it always explores the minimal number of executions. It is based on a novel class of sets, called source sets, that replace the role of persistent sets in previous algorithms. We begin by showing how to modify the original DPOR algorithm to work with source sets, resulting in an efficient and simple-to-implement algorithm, called source-DPOR. Subsequently, we enhance this algorithm with a novel mechanism, called wakeup trees, that allows the resulting algorithm, called optimal-DPOR, to achieve optimality. Both algorithms are then extended to computational models where processes may disable each other, for example, via locks. Finally, we discuss tradeoffs of the source-and optimal-DPOR algorithm and present programs that illustrate significant time and space performance differences between them. We have implemented both algorithms in a publicly available stateless model checking tool for Erlang programs, while the source-DPOR algorithm is at the core of a publicly available stateless model checking tool for C/pthread programs running on machines with relaxed memory models. Experiments show that source sets significantly increase the performance of stateless model checking compared to using the original DPOR algorithm and that wakeup trees incur only a small overhead in both time and space in practice.

    sted, utgiver, år, opplag, sider
    Association for Computing Machinery (ACM), 2017
    HSV kategori
    Identifikatorer
    urn:nbn:se:uu:diva-331842 (URN)10.1145/3073408 (DOI)000410615900002 ()
    Prosjekter
    UPMARCRELEASE
    Forskningsfinansiär
    EU, FP7, Seventh Framework Programme, 287510Swedish Research Council
    Tilgjengelig fra: 2017-10-18 Laget: 2017-10-18 Sist oppdatert: 2018-01-13bibliografisk kontrollert
    2. The shared-memory interferences of Erlang/OTP built-ins
    Åpne denne publikasjonen i ny fane eller vindu >>The shared-memory interferences of Erlang/OTP built-ins
    2017 (engelsk)Inngår i: Proceedings Of The 16Th Acm Sigplan International Workshop On Erlang (Erlang '17) / [ed] Chechina, N.; Fritchie, SL., New York: Association for Computing Machinery (ACM), 2017, s. 43-54Konferansepaper, Publicerat paper (Fagfellevurdert)
    Abstract [en]

    Erlang is a concurrent functional language based on the actor modelof concurrency. In the purest form of this model, actors are realizedby processes that do not share memory and communicate witheach other exclusively via message passing. Erlang comes quiteclose to this model, as message passing is the primary form of interprocesscommunication and each process has its own memoryarea that is managed by the process itself. For this reason, Erlangis often referred to as implementing “shared nothing” concurrency.Although this is a convenient abstraction, in reality Erlang’s mainimplementation, the Erlang/OTP system, comes with a large numberof built-in operations that access memory which is shared byprocesses. In this paper, we categorize these built-ins, and characterizethe interferences between them that can result in observabledifferences of program behaviour when these built-ins are usedin a concurrent setting. The paper is complemented by a publiclyavailable suite of more than one hundred small Erlang programsthat demonstrate the racing behaviour of these built-ins.

    sted, utgiver, år, opplag, sider
    New York: Association for Computing Machinery (ACM), 2017
    Emneord
    Actors, BEAM, Concuerror, Erlang, Scheduling nondeterminism
    HSV kategori
    Identifikatorer
    urn:nbn:se:uu:diva-331840 (URN)10.1145/3123569.3123573 (DOI)000426922100005 ()978-1-4503-5179-9 (ISBN)
    Konferanse
    16th ACM SIGPLAN International Workshop on Erlang (Erlang), Sep 08, 2017 , Oxford, England.
    Prosjekter
    UPMARC
    Forskningsfinansiär
    Swedish Research Council
    Tilgjengelig fra: 2017-10-18 Laget: 2017-10-18 Sist oppdatert: 2018-07-03bibliografisk kontrollert
    3. Testing And Verifying Chain Repair Methods For CORFU Using Stateless Model Checking
    Åpne denne publikasjonen i ny fane eller vindu >>Testing And Verifying Chain Repair Methods For CORFU Using Stateless Model Checking
    2017 (engelsk)Konferansepaper, Publicerat paper (Fagfellevurdert)
    Abstract [en]

    Corfu is a distributed shared log that is designed to be scalable and reliable in the presence of failures and asynchrony. Internally, Corfu is fully replicated for fault tolerance, without sharding data or sacrificing strong consistency. In this case study, we present the modeling approaches we followed to test and verify, using Concuerror, the correctness of repair methods for the Chain Replication protocol suitable for Corfu. In the first two methods we tried, Concuerror located bugs quite fast. In contrast, the tool did not manage to find bugs in the third method, but the time this took also motivated an improvement in the tool that reduces the number of traces explored. Besides more details about all the above, we present experiences and lessons learned from applying stateless model checking for verifying complex protocols suitable for distributed programming.

    sted, utgiver, år, opplag, sider
    Cham: Springer, 2017
    Serie
    Lecture Notes in Computer Science ; 10510
    HSV kategori
    Identifikatorer
    urn:nbn:se:uu:diva-331836 (URN)10.1007/978-3-319-66845-1_15 (DOI)978-3-319-66844-4 (ISBN)978-3-319-66845-1 (ISBN)
    Konferanse
    Integrated Formal Methods. IFM 2017
    Prosjekter
    UPMARC
    Tilgjengelig fra: 2017-10-18 Laget: 2017-10-18 Sist oppdatert: 2018-01-13bibliografisk kontrollert
    4. Optimal dynamic partial order reduction with observers
    Åpne denne publikasjonen i ny fane eller vindu >>Optimal dynamic partial order reduction with observers
    2018 (engelsk)Inngår i: Tools and Algorithms for the Construction and Analysis of Systems: Part II, Springer, 2018, Vol. 10806, s. 229-248Konferansepaper, Publicerat paper (Fagfellevurdert)
    Abstract [en]

    Dynamic partial order reduction (DPOR) algorithms are used in stateless model checking (SMC) to combat the combinatorial explosion in the number of schedulings that need to be explored to guarantee soundness. The most effective of them, the Optimal DPOR algorithm, is optimal in the sense that it explores only one scheduling per Mazurkiewicz trace. In this paper, we enhance DPOR with the notion of observability, which makes dependencies between operations conditional on the existence of future operations, called observers. Observers naturally lead to a lazy construction of dependencies. This requires significant changes in the core of POR algorithms (and Optimal DPOR in particular), but also makes the resulting algorithm, Optimal DPOR with Observers, super-optimal in the sense that it explores exponentially less schedulings than Mazurkiewicz traces in some cases. We argue that observers come naturally in many concurrency models, and demonstrate the performance benefits that Optimal DPOR with Observers achieves in both an SMC tool for shared memory concurrency and a tool for concurrency via message passing, using both synthetic and actual programs as benchmarks.

    sted, utgiver, år, opplag, sider
    Springer, 2018
    Serie
    Lecture Notes in Computer Science, ISSN 0302-9743, E-ISSN 1611-3349 ; 10806
    HSV kategori
    Identifikatorer
    urn:nbn:se:uu:diva-333508 (URN)10.1007/978-3-319-89963-3 _ 14 (DOI)000445822600014 ()978-3-319-89962-6 (ISBN)978-3-319-89963-3 (ISBN)
    Konferanse
    TACAS 2018, April 14–20, Thessaloniki, Greece.
    Prosjekter
    UPMARC
    Forskningsfinansiär
    Swedish Research Council
    Tilgjengelig fra: 2018-04-14 Laget: 2017-11-21 Sist oppdatert: 2019-01-07bibliografisk kontrollert
    Fulltekst (pdf)
    fulltext
    Download (jpg)
    presentationsbild
  • 298.
    Aronis, Stavros
    et al.
    Uppsala universitet, Teknisk-naturvetenskapliga vetenskapsområdet, Matematisk-datavetenskapliga sektionen, Institutionen för informationsteknologi, Datalogi.
    Jonsson, Bengt
    Uppsala universitet, Teknisk-naturvetenskapliga vetenskapsområdet, Matematisk-datavetenskapliga sektionen, Institutionen för informationsteknologi, Datorteknik.
    Lång, Magnus
    Uppsala universitet, Teknisk-naturvetenskapliga vetenskapsområdet, Matematisk-datavetenskapliga sektionen, Institutionen för informationsteknologi, Datorteknik.
    Sagonas, Konstantinos
    Uppsala universitet, Teknisk-naturvetenskapliga vetenskapsområdet, Matematisk-datavetenskapliga sektionen, Institutionen för informationsteknologi, Datalogi.
    Optimal dynamic partial order reduction with observers2018Inngår i: Tools and Algorithms for the Construction and Analysis of Systems: Part II, Springer, 2018, Vol. 10806, s. 229-248Konferansepaper (Fagfellevurdert)
    Abstract [en]

    Dynamic partial order reduction (DPOR) algorithms are used in stateless model checking (SMC) to combat the combinatorial explosion in the number of schedulings that need to be explored to guarantee soundness. The most effective of them, the Optimal DPOR algorithm, is optimal in the sense that it explores only one scheduling per Mazurkiewicz trace. In this paper, we enhance DPOR with the notion of observability, which makes dependencies between operations conditional on the existence of future operations, called observers. Observers naturally lead to a lazy construction of dependencies. This requires significant changes in the core of POR algorithms (and Optimal DPOR in particular), but also makes the resulting algorithm, Optimal DPOR with Observers, super-optimal in the sense that it explores exponentially less schedulings than Mazurkiewicz traces in some cases. We argue that observers come naturally in many concurrency models, and demonstrate the performance benefits that Optimal DPOR with Observers achieves in both an SMC tool for shared memory concurrency and a tool for concurrency via message passing, using both synthetic and actual programs as benchmarks.

    Fulltekst (pdf)
    fulltext
  • 299.
    Aronis, Stavros
    et al.
    Uppsala universitet, Teknisk-naturvetenskapliga vetenskapsområdet, Matematisk-datavetenskapliga sektionen, Institutionen för informationsteknologi, Datalogi.
    Papaspyrou, Nikolaos
    Roukounaki, Katerina
    Sagonas, Konstantinos
    Uppsala universitet, Teknisk-naturvetenskapliga vetenskapsområdet, Matematisk-datavetenskapliga sektionen, Institutionen för informationsteknologi, Datalogi.
    Tsiouris, Yiannis
    Venetis, Ioannis E.
    A scalability benchmark suite for Erlang/OTP2012Inngår i: Proc. 11th ACM SIGPLAN Workshop on Erlang, New York: ACM Press, 2012, s. 33-42Konferansepaper (Fagfellevurdert)
    Abstract [en]

    Programming language implementers rely heavily on benchmarking for measuring and understanding performance of algorithms, architectural designs, and trade-offs between alternative implementations of compilers, runtime systems, and virtual machine components. Given this fact, it seems a bit ironic that it is often more difficult to come up with a good benchmark suite than a good implementation of a programming language.

    This paper presents the main aspects of the design and the current status of bencherl, a publicly available scalability benchmark suite for applications written in Erlang. In contrast to other benchmark suites, which are usually designed to report a particular performance point, our benchmark suite aims to assess scalability, i.e., help developers to study a set of performance points that show how an application's performance changes when additional resources (e.g., CPU cores, schedulers, etc.) are added. We describe the scalability dimensions that the suite aims to examine and present its infrastructure and current set of benchmarks. We also report some limited set of performance results in order to show the capabilities of our suite.

  • 300.
    Aronis, Stavros
    et al.
    Uppsala universitet, Teknisk-naturvetenskapliga vetenskapsområdet, Matematisk-datavetenskapliga sektionen, Institutionen för informationsteknologi, Datalogi.
    Sagonas, Konstantinos
    Uppsala universitet, Teknisk-naturvetenskapliga vetenskapsområdet, Matematisk-datavetenskapliga sektionen, Institutionen för informationsteknologi, Datalogi.
    On using Erlang for parallelization: Experience from parallelizing Dialyzer2013Inngår i: Trends in Functional Programming, Springer Berlin/Heidelberg, 2013, s. 295-310Konferansepaper (Fagfellevurdert)
3456789 251 - 300 of 5630
RefereraExporteraLink til resultatlisten
Permanent link
Referera
Referensformat
  • apa
  • ieee
  • modern-language-association
  • vancouver
  • Annet format
Fler format
Språk
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Annet språk
Fler språk
Utmatningsformat
  • html
  • text
  • asciidoc
  • rtf