uu.seUppsala universitets publikasjoner
Endre søk
Begrens søket
2345678 201 - 250 of 364
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.
  • 201.
    Lampka, Kai
    et al.
    Uppsala universitet, Teknisk-naturvetenskapliga vetenskapsområdet, Matematisk-datavetenskapliga sektionen, Institutionen för informationsteknologi, Datorteknik.
    Forsberg, Björn
    Uppsala universitet, Teknisk-naturvetenskapliga vetenskapsområdet, Matematisk-datavetenskapliga sektionen, Institutionen för informationsteknologi.
    Spiliopoulos, Vasileios
    Uppsala universitet, Teknisk-naturvetenskapliga vetenskapsområdet, Matematisk-datavetenskapliga sektionen, Institutionen för informationsteknologi, Datorarkitektur och datorkommunikation.
    Keep it cool and in time: With runtime monitoring to thermal-aware execution speeds for deadline constrained systems2016Inngår i: Journal of Parallel and Distributed Computing, ISSN 0743-7315, E-ISSN 1096-0848, Vol. 95, s. 79-91Artikkel i tidsskrift (Fagfellevurdert)
    Abstract [en]

    The Dynamic Power and Thermal Management (DPTM) system of Dynamic Voltage Frequency Scaling (DVFS) enabled processors compensates peak temperatures by slowing or even powering parts of the system down. While ensuring the integrity of computations, this comes with the drawback of losing performance. In the context of hard real-time systems, such unpredictable losses in performance are unacceptable, as they may lead to deadline misses which may yet compromise the integrity of the system. To safely execute hard real-time workloads on such systems, this article presents an online scheme for assigning speeds in such a way that (a) the system executes at low clock speed as often as possible, while (b) deadline violations are strictly ruled out. The proposed scheme is compared with an offline scheme which has complete knowledge about arrival times and execution demands of the workload. The benchmarking shows that for a workload which is always very close to the modelled maximum, our approach performs on-par with the offline scheme. In case of a workload which diverges from the modelled maximum more often, the speed assignments produced by our scheme become more pessimistic, as to ensure that all deadlines are met.

  • 202.
    Lampka, Kai
    et al.
    Uppsala universitet, Teknisk-naturvetenskapliga vetenskapsområdet, Matematisk-datavetenskapliga sektionen, Institutionen för informationsteknologi, Datorteknik.
    Lackorzynski, Adam
    Resolving contention for networks-on-chips: Combining time-triggered application scheduling with dynamic budgeting of memory bus use2016Inngår i: Measurement, Modelling and Evaluation of Dependable Computer and Communication Systems, Springer, 2016, s. 137-152Konferansepaper (Fagfellevurdert)
  • 203. Lei, Lei
    et al.
    You, Lei
    Uppsala universitet, Teknisk-naturvetenskapliga vetenskapsområdet, Matematisk-datavetenskapliga sektionen, Institutionen för informationsteknologi, Datalogi.
    Dai, Gaoyang
    Uppsala universitet, Teknisk-naturvetenskapliga vetenskapsområdet, Matematisk-datavetenskapliga sektionen, Institutionen för informationsteknologi, Datorteknik.
    Vu, Thang Xuan
    Yuan, Di
    Uppsala universitet, Teknisk-naturvetenskapliga vetenskapsområdet, Matematisk-datavetenskapliga sektionen, Institutionen för informationsteknologi, Datalogi.
    Chatzinotas, Symeon
    A deep learning approach for optimizing content delivering in cache-enabled HetNet2017Inngår i: Proc. 14th International Symposium on Wireless Communication Systems, IEEE, 2017, s. 449-453Konferansepaper (Fagfellevurdert)
  • 204.
    Lengál, Ondrej
    et al.
    FIT, Brno University of Technology, Czech Republic.
    Lin, Anthony W.
    Department of Computer Science, University of Oxford, UK.
    Majumdar, Rupak
    MPI-SWS Kaiserslautern, Germany.
    Rümmer, Philipp
    Uppsala universitet, Teknisk-naturvetenskapliga vetenskapsområdet, Matematisk-datavetenskapliga sektionen, Institutionen för informationsteknologi, Datorteknik.
    Fair termination for parameterized probabilistic concurrent systems2017Inngår i: Tools and Algorithms for the Construction and Analysis of Systems: Part I, Springer, 2017, s. 499-517Konferansepaper (Fagfellevurdert)
    Abstract [en]

    We consider the problem of automatically verifying that a parameterized family of probabilistic concurrent systems terminates with probability one for all instances against adversarial schedulers. A parameterized family defines an infinite-state system: for each number n, the family consists of an instance with n finite-state processes. In contrast to safety, the parameterized verification of liveness is currently still considered extremely challenging especially in the presence of probabilities in the model. One major challenge is to provide a sufficiently powerful symbolic framework. One well-known symbolic framework for the parameterized verification of non-probabilistic concurrent systems is regular model checking. Although the framework was recently extended to probabilistic systems, incorporating fairness in the framework-often crucial for verifying termination-has been especially difficult due to the presence of an infinite number of fairness constraints (one for each process). Our main contribution is a systematic, regularity-preserving, encoding of finitary fairness (a realistic notion of fairness proposed by Alur and Henzinger) in the framework of regular model checking for probabilistic parameterized systems. Our encoding reduces termination with finitary fairness to verifying parameterized termination without fairness over probabilistic systems in regular model checking (for which a verification framework already exists). We show that our algorithm could verify termination for many interesting examples from distributed algorithms (Herman's protocol) and evolutionary biology (Moran process, cell cycle switch), which do not hold under the standard notion of fairness. To the best of our knowledge, our algorithm is the first fully-automatic method that can prove termination for these examples.

  • 205.
    Leonardsson, Carl
    Uppsala universitet, Teknisk-naturvetenskapliga vetenskapsområdet, Matematisk-datavetenskapliga sektionen, Institutionen för informationsteknologi, Avdelningen för datorteknik. Uppsala universitet, Teknisk-naturvetenskapliga vetenskapsområdet, Matematisk-datavetenskapliga sektionen, Institutionen för informationsteknologi, Datorteknik.
    Verification of Software under Relaxed Memory2016Doktoravhandling, med artikler (Annet vitenskapelig)
    Abstract [en]

    The work covered in this thesis concerns automatic analysis of correctness of parallel programs running under relaxed memory models.

    When a parallel program is compiled and executed on a modern architecture, various optimizations may cause it to behave in unexpected ways. In particular, accesses to the shared memory may appear in the execution in the opposite order to how they appear in the control flow of the original program source code. The memory model determines which memory accesses can be reordered in a program on a given system. Any memory model that allows some observable memory access reordering is called a relaxed memory model. The reorderings may cause bugs and make the production of parallel programs more difficult.

    In this work, we consider three main approaches to analysis of correctness of programs running under relaxed memory models. An exact analysis for finite state programs running under the TSO memory model (Paper I). This technique is based on the well quasi ordering framework. An over-approximate analysis for integer programs running under TSO (Paper II), based on predicate abstraction combined with a buffer abstraction. Two under-approximate analysis techniques for programs running under the TSO, PSO or POWER memory models (Papers III and IV). The latter two techniques are based on stateless model checking and dynamic partial order reduction.

    In addition to determining whether a program is correct under a given memory model, the problem of automatic fence synthesis is also considered. A memory fence is an instruction that can be inserted into a program in order to locally disable some memory access reorderings. The fence synthesis problem is the problem of automatically inferring a minimal set of memory fences which restores sufficient order in a given program to ensure its correctness.

    Delarbeid
    1. Counter-Example Guided Fence Insertion under TSO
    Åpne denne publikasjonen i ny fane eller vindu >>Counter-Example Guided Fence Insertion under TSO
    Vise andre…
    2012 (engelsk)Inngår i: Tools and Algorithms for the Construction and Analysis of Systems, Berlin: Springer-Verlag , 2012, s. 204-219Konferansepaper, Publicerat paper (Fagfellevurdert)
    sted, utgiver, år, opplag, sider
    Berlin: Springer-Verlag, 2012
    Serie
    Lecture Notes in Computer Science ; 7214
    HSV kategori
    Identifikatorer
    urn:nbn:se:uu:diva-175078 (URN)10.1007/978-3-642-28756-5_15 (DOI)978-3-642-28755-8 (ISBN)
    Konferanse
    TACAS 2012
    Prosjekter
    UPMARCWeak Memory Models
    Tilgjengelig fra: 2012-03-22 Laget: 2012-05-31 Sist oppdatert: 2018-01-12bibliografisk kontrollert
    2. Automatic fence insertion in integer programs via predicate abstraction
    Åpne denne publikasjonen i ny fane eller vindu >>Automatic fence insertion in integer programs via predicate abstraction
    Vise andre…
    2012 (engelsk)Inngår i: Static Analysis, Berlin: Springer-Verlag , 2012, s. 164-180Konferansepaper, Publicerat paper (Fagfellevurdert)
    sted, utgiver, år, opplag, sider
    Berlin: Springer-Verlag, 2012
    Serie
    Lecture Notes in Computer Science ; 7460
    HSV kategori
    Identifikatorer
    urn:nbn:se:uu:diva-175079 (URN)10.1007/978-3-642-33125-1_13 (DOI)978-3-642-33124-4 (ISBN)
    Eksternt samarbeid:
    Konferanse
    SAS 2012
    Prosjekter
    UPMARCWeak Memory Models
    Tilgjengelig fra: 2012-09-11 Laget: 2012-05-31 Sist oppdatert: 2018-01-12bibliografisk kontrollert
    3. Stateless model checking for TSO and PSO
    Åpne denne publikasjonen i ny fane eller vindu >>Stateless model checking for TSO and PSO
    Vise andre…
    2015 (engelsk)Inngår i: Tools and Algorithms for the Construction and Analysis of Systems: TACAS 2015, Springer Berlin/Heidelberg, 2015, s. 353-367Konferansepaper, Publicerat paper (Fagfellevurdert)
    sted, utgiver, år, opplag, sider
    Springer Berlin/Heidelberg, 2015
    Serie
    Lecture Notes in Computer Science ; 9035
    HSV kategori
    Identifikatorer
    urn:nbn:se:uu:diva-251580 (URN)10.1007/978-3-662-46681-0_28 (DOI)978-3-662-46680-3 (ISBN)
    Konferanse
    TACAS 2015, April 11–18, London, UK
    Prosjekter
    UPMARC
    Tilgjengelig fra: 2015-04-21 Laget: 2015-04-21 Sist oppdatert: 2018-01-11bibliografisk kontrollert
    4. Stateless model checking for POWER
    Åpne denne publikasjonen i ny fane eller vindu >>Stateless model checking for POWER
    2016 (engelsk)Inngår i: Computer Aided Verification: Part II, Springer, 2016, s. 134-156Konferansepaper, Publicerat paper (Fagfellevurdert)
    Abstract [en]

    We present the first framework for efficient application of stateless model checking (SMC) to programs running under the relaxed memory model of POWER. The framework combines several contributions. The first contribution is that we develop a scheme for systematically deriving operational execution models from existing axiomatic ones. The scheme is such that the derived execution models are well suited for efficient SMC. We apply our scheme to the axiomatic model of POWER from [8]. Our main contribution is a technique for efficient SMC, called Relaxed Stateless Model Checking (RSMC), which systematically explores the possible inequivalent executions of a program. RSMC is suitable for execution models obtained using our scheme. We prove that RSMC is sound and optimal for the POWER memory model, in the sense that each complete program behavior is explored exactly once. We show the feasibility of our technique by providing an implementation for programs written in C/pthreads.

    sted, utgiver, år, opplag, sider
    Springer, 2016
    Serie
    Lecture Notes in Computer Science, ISSN 0302-9743 ; 9780
    HSV kategori
    Identifikatorer
    urn:nbn:se:uu:diva-295424 (URN)10.1007/978-3-319-41540-6_8 (DOI)000387731400008 ()9783319415390 (ISBN)9783319415406 (ISBN)
    Konferanse
    CAV 2016, July 17–23, Toronto, Canada
    Prosjekter
    UPMARC
    Tilgjengelig fra: 2016-07-13 Laget: 2016-06-07 Sist oppdatert: 2018-01-10bibliografisk kontrollert
  • 206. Leroux, Jérôme
    et al.
    Rümmer, Philipp
    Uppsala universitet, Teknisk-naturvetenskapliga vetenskapsområdet, Matematisk-datavetenskapliga sektionen, Institutionen för informationsteknologi, Datorteknik.
    Subotic, Pavle
    Uppsala universitet, Teknisk-naturvetenskapliga vetenskapsområdet, Matematisk-datavetenskapliga sektionen, Institutionen för informationsteknologi, Datorteknik.
    Guiding Craig interpolation with domain-specific abstractions2016Inngår i: Acta Informatica, ISSN 0001-5903, E-ISSN 1432-0525, Vol. 53, nr 4, s. 387-424Artikkel i tidsskrift (Fagfellevurdert)
    Abstract [en]

    Craig interpolation is a standard method to construct and refine abstractions in model checking. To obtain abstractions that are suitable for the verification of software programs or hardware designs, model checkers rely on theorem provers to find the right interpolants, or interpolants containing the right predicates, in a generally infinite lattice of interpolants for any given interpolation problem. We present a semantic and solver-independent framework for systematically exploring interpolant lattices, based on the notion of interpolation abstraction. We discuss how interpolation abstractions can be constructed for a variety of logics, and how they can be applied in the context of software model checking.

  • 207. Leung, Victor C. M.
    et al.
    Liu, Jiangchuan
    Ngai, Edith
    Uppsala universitet, Teknisk-naturvetenskapliga vetenskapsområdet, Matematisk-datavetenskapliga sektionen, Institutionen för informationsteknologi, Datorteknik.
    Pan, Jianping
    Stouraitis, Thanos
    Editorial for QShine 2014 Special Issue2016Inngår i: Journal on spesial topics in mobile networks and applications, ISSN 1383-469X, E-ISSN 1572-8153, Vol. 21, nr 3, s. 387-389Artikkel i tidsskrift (Annet vitenskapelig)
  • 208.
    Li, Wenxiang
    et al.
    Wuhan Univ Sci & Technol, Sch Informat Sci & Engn, Wuhan 430081, Peoples R China.;Wuhan Univ Sci & Technol, Minist Educ, Engn Res Ctr Met Automat & Detecting Technol, Wuhan, Peoples R China..
    Zhu, Chunsheng
    Univ British Columbia, Dept Elect & Comp Engn, Vancouver, BC V6T 1Z4, Canada..
    Ngai, Edith C. -H.
    Uppsala universitet, Teknisk-naturvetenskapliga vetenskapsområdet, Matematisk-datavetenskapliga sektionen, Institutionen för informationsteknologi, Datorteknik.
    Yang, Laurence T.
    St Francis Xavier Univ, Dept Comp Sci, Antigonish, NS B2G 2W5, Canada..
    Shu, Lei
    Guangdong Univ Petrochem Technol, Guangdong Prov Key Lab Petrochem Equipment Fault, Maoming 525000, Guangdong, Peoples R China..
    Sheng, Yuxia
    Wuhan Univ Sci & Technol, Sch Informat Sci & Engn, Wuhan 430081, Peoples R China.;Wuhan Univ Sci & Technol, Minist Educ, Engn Res Ctr Met Automat & Detecting Technol, Wuhan, Peoples R China..
    Facilities Collaboration in Cloud Manufacturing based on Generalized Collaboration Network2015Inngår i: Proceedings of the 11th EAI International Conference on Heterogeneous Networking for Quality, Reliability, Security and Robustness, 2015, s. 298-303Konferansepaper (Fagfellevurdert)
    Abstract [en]

    In cloud manufacturing for regional industrial cluster, there is increasing necessity of collaboration among enterprises or facilities. It is valuable to explore the characteristics of these collaboration behaviors for effectively scheduling dispersed manufacturing facilities and organizing their collaboration. The collaborative relation of manufacturing in regional industrial cluster can be described as a generalized social collaboration network. In this paper, we introduce the relevant entities and relations of facilities collaboration, and propose the method for building Facility Collaboration Network (FCN). We further design the dynamically growing process of FCN for different facility selection strategies, including random selection, balanced selection, random selection with preference and balanced selection with preference. Based on the metrics such as network scale, node degree distribution, act degree distribution, average shortest distance and number of cliques, we present the statistical characteristics of FCN, and analyze relevant characteristics and laws for efficient facilities selection in cloud manufacturing.

  • 209. Li, Wenxiang
    et al.
    Zhu, Chunsheng
    Yang, Laurence T.
    Shu, Lei
    Ngai, Edith C.-H.
    Uppsala universitet, Teknisk-naturvetenskapliga vetenskapsområdet, Matematisk-datavetenskapliga sektionen, Institutionen för informationsteknologi, Datorteknik.
    Ma, Yajie
    Subtask scheduling for distributed robots in cloud manufacturing2017Inngår i: IEEE Systems Journal, ISSN 1932-8184, E-ISSN 1937-9234, Vol. 11, nr 2, s. 941-950Artikkel i tidsskrift (Fagfellevurdert)
  • 210.
    Li, Yonghui
    et al.
    Eindhoven Univ Technol, NL-5600 MB Eindhoven, Netherlands.
    Åkesson, Benny
    CISTER INESC TEC, ISEP, Oporto, Portugal.
    Lampka, Kai
    Uppsala universitet, Teknisk-naturvetenskapliga vetenskapsområdet, Matematisk-datavetenskapliga sektionen, Institutionen för informationsteknologi, Datorteknik.
    Goossens, Kees
    Eindhoven Univ Technol, NL-5600 MB Eindhoven, Netherlands.
    Modeling and verification of dynamic command scheduling for real-time memory controllers2016Inngår i: 2016 IEEE Real-Time and Embedded Technology and Applications Symposium (RTAS), IEEE Computer Society, 2016Konferansepaper (Fagfellevurdert)
    Abstract [en]

    In modern multi-core systems with multiple real-time (RT) applications, memory traffic accessing the shared SDRAM is increasingly diverse, e.g., transactions have variable sizes. RT memory controllers with dynamic command scheduling can efficiently address the diversity by issuing appropriate commands subject to the SDRAM timing constraints. However, the scheduling dependencies between commands make it challenging to derive tight bounds for the worst-case response time (WCRT) and the worst-case bandwidth (WCBW) of a memory controller. Existing modeling and analysis techniques either do not provide tight WCRT and WCBW bounds for diverse memory traffic with variable transaction sizes or are difficult to adapt to different RT memory controllers. This paper models a memory controller using Timed Automata (TA), where model checking is applied for analysis. Our TA model is modular and accurately captures the behavior of a RT memory controller with dynamic command scheduling. We obtain WCRT and WCBW bounds, which are validated by simulating the worst-case transaction traces obtained by model checking with a cycle-accurate model of the memory controller. Our method outperforms three state-of-the-art analysis techniques. We reduce WCRT bound by up to 20%, while the average improvement is 7.7%, and increase the WCBW bound by up to 25% with an average improvement of 13.6%. In addition, our modeling is generic enough to extend to memory controllers with different mechanisms.

  • 211. Lin, Anthony W.
    et al.
    Nguyen, Truong Khanh
    Rümmer, Philipp
    Uppsala universitet, Teknisk-naturvetenskapliga vetenskapsområdet, Matematisk-datavetenskapliga sektionen, Institutionen för informationsteknologi, Datorteknik.
    Sun, Jun
    Regular Symmetry Patterns2016Inngår i: Verification, Model Checking, and Abstract Interpretation, Springer Berlin/Heidelberg, 2016, s. 455-475Konferansepaper (Fagfellevurdert)
    Abstract [en]

    Symmetry reduction is a well-known approach for alleviating the state explosion problem in model checking. Automatically identifying symmetries in concurrent systems, however, is computationally expensive. We propose a symbolic framework for capturing symmetry patterns in parameterised systems (i.e. an infinite family of finite-state systems): two regular word transducers to represent, respectively, parameterised systems and symmetry patterns. The framework subsumes various types of "symmetry relations" ranging from weaker notions (e.g. simulation preorders) to the strongest notion (i.e. isomorphisms). Our framework enjoys two algorithmic properties: (1) symmetry verification: given a transducer, we can automatically check whether it is a symmetry pattern of a given system, and (2) symmetry synthesis: we can automatically generate a symmetry pattern for a given system in the form of a transducer. Furthermore, our symbolic language allows additional constraints that the symmetry patterns need to satisfy to be easily incorporated in the verification/synthesis. We show how these properties can help identify symmetry patterns in examples like dining philosopher protocols, self-stabilising protocols, and prioritised resource-allocator protocol. In some cases (e.g. Gries's coffee can problem), our technique automatically synthesises a safety-preserving finite approximant, which can then be verified for safety solely using a finite-state model checker.

  • 212.
    Lin, Anthony W.
    et al.
    Yale NUS Coll, Singapore, Singapore.
    Rümmer, Philipp
    Uppsala universitet, Teknisk-naturvetenskapliga vetenskapsområdet, Matematisk-datavetenskapliga sektionen, Institutionen för informationsteknologi, Datorteknik.
    Liveness of randomised parameterised systems under arbitrary schedulers2016Inngår i: Computer Aided Verification: Part II, Springer, 2016, s. 112-133Konferansepaper (Fagfellevurdert)
  • 213. Lin, Chuang
    et al.
    Ramakrishnan, Kadangode K.
    Liu, Jiangchuan
    Ngai, Edith
    Uppsala universitet, Teknisk-naturvetenskapliga vetenskapsområdet, Matematisk-datavetenskapliga sektionen, Institutionen för informationsteknologi, Datorteknik.
    Special Issue on Cloud Computing for IoT2016Inngår i: IEEE Internet of Things Journal, ISSN 2327-4662, Vol. 3, nr 3, s. 254-256Artikkel i tidsskrift (Annet vitenskapelig)
  • 214. Lin, Hao
    et al.
    Xu, Wenyao
    Guan, Nan
    Ji, Dong
    Wei, Yangjie
    Yi, Wang
    Uppsala universitet, Teknisk-naturvetenskapliga vetenskapsområdet, Matematisk-datavetenskapliga sektionen, Institutionen för informationsteknologi, Datorteknik.
    Noninvasive and continuous blood pressure monitoring using wearable body sensor networks2015Inngår i: IEEE Intelligent Systems, ISSN 1541-1672, E-ISSN 1941-1294, Vol. 30, nr 6, s. 38-48Artikkel i tidsskrift (Fagfellevurdert)
  • 215.
    Lind, Thomas
    et al.
    Uppsala universitet, Teknisk-naturvetenskapliga vetenskapsområdet, Matematisk-datavetenskapliga sektionen, Institutionen för informationsteknologi, Bildanalys och människa-datorinteraktion.
    Cajander, Åsa
    Uppsala universitet, Teknisk-naturvetenskapliga vetenskapsområdet, Matematisk-datavetenskapliga sektionen, Institutionen för informationsteknologi, Bildanalys och människa-datorinteraktion.
    Sandblad, Bengt
    Uppsala universitet, Teknisk-naturvetenskapliga vetenskapsområdet, Matematisk-datavetenskapliga sektionen, Institutionen för informationsteknologi, Bildanalys och människa-datorinteraktion.
    Daniels, Mats
    Uppsala universitet, Teknisk-naturvetenskapliga vetenskapsområdet, Matematisk-datavetenskapliga sektionen, Institutionen för informationsteknologi, Datorteknik.
    Lárusdóttir, Marta
    McDermott, Roger
    Clear, Tony
    Students envisioning the future2016Inngår i: Proc. 46th ASEE/IEEE Frontiers in Education Conference, Piscataway, NJ: IEEE Press, 2016Konferansepaper (Fagfellevurdert)
    Abstract [en]

    How can students be included as critical stakeholders in the systems and services provided by a university? To address the whole student experience, we engaged students and employees at a large Swedish university in a vision seminar process to elicit how these groups envisioned an ideal future university, and the necessary changes to technology and organisational structures required to achieve this ideal version. The process entailed six four-hour workshops with four groups consisting of six participants each. A survey instrument was used to follow up on the participants' experiences of participating in the vision seminar process and their thoughts on the future of the university. The results show that the participating students were more positive compared to the university employees. The students envisioned harmonized interdepartmental systems, seamlessly integrating a variety of services into one university provided solution. The employees envisioned their future work as flexible, enabled by technology providing excellent support without hindering pedagogical and organisational development. Using technological frames, these visions of the future are identified, analysed and discussed in relation to the quality of university education and a holistic view on students' university experience. Finally we discuss the broader implications of the visions on the future of university education.

  • 216.
    Lindén, Jonatan
    Uppsala universitet, Teknisk-naturvetenskapliga vetenskapsområdet, Matematisk-datavetenskapliga sektionen, Institutionen för informationsteknologi, Avdelningen för datorteknik. Uppsala universitet, Teknisk-naturvetenskapliga vetenskapsområdet, Matematisk-datavetenskapliga sektionen, Institutionen för informationsteknologi, Datorteknik.
    Synchronization Techniques in Parallel Discrete Event Simulation2018Doktoravhandling, med artikler (Annet vitenskapelig)
    Abstract [en]

    Discrete event simulation is an important tool for evaluating system models in many fields of science and engineering. To improve the performance of large-scale discrete event simulations, several techniques to parallelize discrete event simulation have been developed.

    In parallel discrete event simulation, the work of a single discrete event simulation is distributed over multiple processing elements. A key challenge in parallel discrete event simulation is to ensure that causally dependent events are processed in the correct order, so that the same simulation trajectory is produced as in a sequential simulation. To preserve chronology between events processed in parallel, different synchronization protocols have been devised, each carrying a cost in performance.

    This thesis presents techniques for reducing synchronization costs in two approaches to parallel discrete event simulation, viz., optimistic space-parallel and share-everything parallel discrete event simulation.

    Firstly, we develop a concurrent priority queue, to be used as, e.g., a central event queue in the share-everything approach to parallel discrete event simulation. The priority queue is based on skiplists. It improves over previous queues by incurring fewer global synchronization operations, thereby inducing less contention and improving scalability.

    Secondly, we study how to improve the performance of optimistic parallel discrete event simulation by disseminating accurate estimates of timestamps of future events. We present techniques for obtaining the estimates in two different methods for simulation of spatial stochastic models. The estimates allow processing elements to determine when to pause simulation with high precision, thereby reducing the amount of performed useless work.

    Finally, we observe that in the applications that we have studied, the phenomena of interest are often non-homogeneous and migrate over time. Due to this, the work distribution tends to become unbalanced among the processing elements. A solution is to rebalance the work dynamically. We propose a fine-grained local dynamic load balancing algorithm for parallel discrete event simulation. The load balancing algorithm reduces the number of events arriving out-of-order, thereby reducing the amount of time spent on corrective actions.

    Delarbeid
    1. A Skiplist-Based Concurrent Priority Queue with Minimal Memory Contention
    Åpne denne publikasjonen i ny fane eller vindu >>A Skiplist-Based Concurrent Priority Queue with Minimal Memory Contention
    2018 (engelsk)Rapport (Annet vitenskapelig)
    Serie
    Technical report / Department of Information Technology, Uppsala University, ISSN 1404-3203 ; 2018-003
    Emneord
    Concurrent Data Structures, Priority Queue, Lock-free, Non-blocking, Skiplist
    HSV kategori
    Identifikatorer
    urn:nbn:se:uu:diva-342233 (URN)
    Prosjekter
    CoDeR-MPUPMARC
    Tilgjengelig fra: 2018-02-19 Laget: 2018-02-19 Sist oppdatert: 2018-04-06bibliografisk kontrollert
    2. Efficient inter-process synchronization for parallel discrete event simulation on multicores
    Åpne denne publikasjonen i ny fane eller vindu >>Efficient inter-process synchronization for parallel discrete event simulation on multicores
    2015 (engelsk)Inngår i: Proc. 3rd ACM SIGSIM Conference on Principles of Advanced Discrete Simulation, New York: ACM Press, 2015, s. 183-194Konferansepaper, Publicerat paper (Fagfellevurdert)
    sted, utgiver, år, opplag, sider
    New York: ACM Press, 2015
    HSV kategori
    Identifikatorer
    urn:nbn:se:uu:diva-260199 (URN)10.1145/2769458.2769476 (DOI)978-1-4503-3583-6 (ISBN)
    Konferanse
    SIGSIM-PADS 2015
    Prosjekter
    UPMARC
    Tilgjengelig fra: 2015-06-10 Laget: 2015-08-17 Sist oppdatert: 2018-11-12bibliografisk kontrollert
    3. Exposing inter-process information for efficient PDES of spatial stochastic systems on multicores
    Åpne denne publikasjonen i ny fane eller vindu >>Exposing inter-process information for efficient PDES of spatial stochastic systems on multicores
    2019 (engelsk)Inngår i: ACM Transactions on Modeling and Computer Simulation, ISSN 1049-3301, E-ISSN 1558-1195, Vol. 29, nr 2, s. 11:1-25, artikkel-id 11Artikkel i tidsskrift (Fagfellevurdert) Published
    HSV kategori
    Identifikatorer
    urn:nbn:se:uu:diva-342180 (URN)10.1145/3301500 (DOI)000468031300004 ()
    Prosjekter
    UPMARC
    Tilgjengelig fra: 2019-04-02 Laget: 2018-02-19 Sist oppdatert: 2019-06-18bibliografisk kontrollert
    4. Fine-grained local dynamic load balancing in PDES
    Åpne denne publikasjonen i ny fane eller vindu >>Fine-grained local dynamic load balancing in PDES
    2018 (engelsk)Inngår i: Proc. 6th ACM SIGSIM Conference on Principles of Advanced Discrete Simulation, New York: ACM Press, 2018, s. 201-212Konferansepaper, Publicerat paper (Fagfellevurdert)
    sted, utgiver, år, opplag, sider
    New York: ACM Press, 2018
    HSV kategori
    Identifikatorer
    urn:nbn:se:uu:diva-342174 (URN)10.1145/3200921.3200928 (DOI)000482913900025 ()978-1-4503-5092-1 (ISBN)
    Konferanse
    SIGSIM-PADS 2018
    Prosjekter
    UPMARC
    Tilgjengelig fra: 2018-05-14 Laget: 2018-02-19 Sist oppdatert: 2019-10-21bibliografisk kontrollert
  • 217.
    Lindén, Jonatan
    et al.
    Uppsala universitet, Teknisk-naturvetenskapliga vetenskapsområdet, Matematisk-datavetenskapliga sektionen, Institutionen för informationsteknologi, Datorteknik.
    Bauer, Pavol
    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.
    Engblom, Stefan
    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.
    Jonsson, Bengt
    Uppsala universitet, Teknisk-naturvetenskapliga vetenskapsområdet, Matematisk-datavetenskapliga sektionen, Institutionen för informationsteknologi, Datorteknik.
    Exposing inter-process information for efficient parallel discrete event simulation of spatial stochastic systems2017Inngår i: Proc. 5th ACM SIGSIM Conference on Principles of Advanced Discrete Simulation, New York: ACM Press, 2017, s. 53-64Konferansepaper (Fagfellevurdert)
  • 218.
    Lindén, Jonatan
    et al.
    Uppsala universitet, Teknisk-naturvetenskapliga vetenskapsområdet, Matematisk-datavetenskapliga sektionen, Institutionen för informationsteknologi, Datorteknik.
    Bauer, Pavol
    Engblom, Stefan
    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.
    Jonsson, Bengt
    Uppsala universitet, Teknisk-naturvetenskapliga vetenskapsområdet, Matematisk-datavetenskapliga sektionen, Institutionen för informationsteknologi, Datorteknik.
    Exposing inter-process information for efficient PDES of spatial stochastic systems on multicores2019Inngår i: ACM Transactions on Modeling and Computer Simulation, ISSN 1049-3301, E-ISSN 1558-1195, Vol. 29, nr 2, s. 11:1-25, artikkel-id 11Artikkel i tidsskrift (Fagfellevurdert)
  • 219.
    Lindén, Jonatan
    et al.
    Uppsala universitet, Teknisk-naturvetenskapliga vetenskapsområdet, Matematisk-datavetenskapliga sektionen, Institutionen för informationsteknologi, Datorteknik.
    Bauer, Pavol
    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.
    Engblom, Stefan
    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.
    Jonsson, Bengt
    Uppsala universitet, Teknisk-naturvetenskapliga vetenskapsområdet, Matematisk-datavetenskapliga sektionen, Institutionen för informationsteknologi, Datorteknik.
    Fine-grained local dynamic load balancing in PDES2018Inngår i: Proc. 6th ACM SIGSIM Conference on Principles of Advanced Discrete Simulation, New York: ACM Press, 2018, s. 201-212Konferansepaper (Fagfellevurdert)
  • 220.
    Lindén, Jonatan
    et al.
    Uppsala universitet, Teknisk-naturvetenskapliga vetenskapsområdet, Matematisk-datavetenskapliga sektionen, Institutionen för informationsteknologi, Datorteknik.
    Jonsson, Bengt
    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, Datorteknik.
    A Skiplist-Based Concurrent Priority Queue with Minimal Memory Contention2018Rapport (Annet vitenskapelig)
  • 221.
    Liu, Di
    et al.
    Leiden Univ, Leiden, Netherlands..
    Spasic, Jelena
    Leiden Univ, Leiden, Netherlands..
    Guan, Nan
    Hong Kong Polytech Univ, Hong Kong, Hong Kong, Peoples R China..
    Chen, Gang
    Northeastern Univ, Shenyang, Peoples R China..
    Liu, Songran
    Northeastern Univ, Shenyang, Peoples R China..
    Stefanov, Todor
    Leiden Univ, Leiden, Netherlands..
    Yi, Wang
    Uppsala universitet, Teknisk-naturvetenskapliga vetenskapsområdet, Matematisk-datavetenskapliga sektionen, Institutionen för informationsteknologi, Datorteknik. Northeastern Univ, Shenyang, Peoples R China..
    EDF-VD scheduling of mixed-criticality systems with degraded quality guarantees2016Inngår i: Proc. 37th Real-Time Systems Symposium, IEEE Computer Society, 2016, s. 35-46Konferansepaper (Fagfellevurdert)
    Abstract [en]

    This paper studies real-time scheduling of mixed-criticality systems where low-criticality tasks are still guaranteed some service in the high-criticality mode, with reduced execution budgets. First, we present a utilization-based schedulability test for such systems under EDF-VD scheduling. Second, we quantify the suboptimality of EDF-VD (with our test condition) in terms of speedup factors. In general, the speedup factor is a function with respect to the ratio between the amount of resource required by different types of tasks in different criticality modes, and reaches 4/3 in the worst case. Furthermore, we show that the proposed utilization-based schedulability test and speedup factor results apply to the elastic mixed-criticality model as well. Experiments show effectiveness of our proposed method and confirm the theoretical suboptimality results.

  • 222. Liu, Qiang
    et al.
    Hu, Xiping
    Ngai, Edith
    Uppsala universitet, Teknisk-naturvetenskapliga vetenskapsområdet, Matematisk-datavetenskapliga sektionen, Institutionen för informationsteknologi, Datorteknik.
    Liang, Min
    Leung, Victor C. M.
    Cai, Zhiping
    Yin, Jianping
    A security patch addressing bandwidth request vulnerabilities in the IEEE 802.16 standard2016Inngår i: IEEE Network, ISSN 0890-8044, E-ISSN 1558-156X, Vol. 30, nr 5, s. 26-34Artikkel i tidsskrift (Fagfellevurdert)
  • 223.
    Liu, Xiaoyang
    et al.
    Beijing Univ Posts & Telecommun, State Key Lab Networking & Switching Technol, Beijing 100876, Peoples R China.
    Song, Zheng
    Beijing Univ Posts & Telecommun, State Key Lab Networking & Switching Technol, Beijing 100876, Peoples R China.
    Ngai, Edith
    Uppsala universitet, Teknisk-naturvetenskapliga vetenskapsområdet, Matematisk-datavetenskapliga sektionen, Institutionen för informationsteknologi, Datorteknik.
    Ma, Jian
    Beijing Univ Posts & Telecommun, State Key Lab Networking & Switching Technol, Beijing 100876, Peoples R China.
    Wang, Wendong
    Beijing Univ Posts & Telecommun, State Key Lab Networking & Switching Technol, Beijing 100876, Peoples R China.
    PM2.5 Monitoring using Images from Smartphones in Participatory Sensing2015Konferansepaper (Fagfellevurdert)
    Abstract [en]

    Air pollution has become one of the most pressing environmental issues in many countries, including China. Fine-grained PM2.5 particulate data can prevent people from long time exposure and advance scientific research. However, existing monitoring systems with PM2.5 stationary sensors are expensive, which can only provide pollution data at sparse locations. In this paper we demonstrate for the first time that camera on smartphones can be used for low-cost and fine-grained PM2.5 monitoring in participatory sensing. We propose a LearningBased method to extract air quality related features from images taken by smartphones. These image features will be used to build the haze model that can estimate PM2.5 concentration depending on the reference sensors. We conducted extensive experiments over six months with two datasets to demonstrate the performance of the proposed solution using different models of smartphones. We believe that our findings will give profound impact in many research fields, including mobile sensing, activity scheduling, haze data collection and analysis.

  • 224.
    Liu, Xiuming
    et al.
    Uppsala universitet, Teknisk-naturvetenskapliga vetenskapsområdet, Matematisk-datavetenskapliga sektionen, Institutionen för informationsteknologi, Datorteknik.
    Khankan, Abdul Rahman
    Alsioufi, Mohamad
    He, Zhitao
    Ngai, Edith C.-H.
    Uppsala universitet, Teknisk-naturvetenskapliga vetenskapsområdet, Matematisk-datavetenskapliga sektionen, Institutionen för informationsteknologi, Datorteknik.
    Cloud-Based Data Fusion in Green IoT for Smart Cities2017Inngår i: Proc. 14th International Conference on Embedded Wireless Systems and Networks, ACM Digital Library, 2017, s. 216-217Konferansepaper (Fagfellevurdert)
  • 225.
    Liu, Xiuming
    et al.
    Uppsala universitet, Teknisk-naturvetenskapliga vetenskapsområdet, Matematisk-datavetenskapliga sektionen, Institutionen för informationsteknologi, Datorteknik.
    Xi, Teng
    Ngai, Edith
    Uppsala universitet, Teknisk-naturvetenskapliga vetenskapsområdet, Matematisk-datavetenskapliga sektionen, Institutionen för informationsteknologi, Datorteknik.
    Data modelling with Gaussian process in sensor networks for urban environmental monitoring2016Inngår i: Proc. 24th International Symposium on Modeling, Analysis and Simulation of Computer and Telecommunication Systems, IEEE Computer Society, 2016, s. 457-462Konferansepaper (Fagfellevurdert)
  • 226.
    Liu, Xiuming
    et al.
    Uppsala universitet, Teknisk-naturvetenskapliga vetenskapsområdet, Matematisk-datavetenskapliga sektionen, Institutionen för informationsteknologi, Datorteknik.
    Xi, Teng
    State Key Laboratory of Networking and Switching Technology, Beijing University of Posts and Telecommunications, Beijing, China.
    Ngai, Edith
    Uppsala universitet, Teknisk-naturvetenskapliga vetenskapsområdet, Matematisk-datavetenskapliga sektionen, Institutionen för informationsteknologi, Datorteknik.
    Wang, Wendong
    State Key Laboratory of Networking and Switching Technology, Beijing University of Posts and Telecommunications, Beijing, China.
    Path planning for aerial sensor networks with connectivity constraints2017Inngår i: 2017 IEEE International Conference on Communications (ICC), IEEE, 2017Konferansepaper (Fagfellevurdert)
    Abstract [en]

    Wireless sensor networks (WSN) based on unmanned aerial vehicles (UAV) are ideal platforms for monitoring dynamics over larger service area. On the other hand, aerial sensor networks (ASNs) are often required to be connected with a command center for sending data and receiving control messages in real time. In this paper, we study the problem of path planning for ASNs with connectivity constraints. The primary goal of path planning is driving UAVs to locations where the most informative measurements can be collected. Meanwhile, the worst link's capacity is assured to be greater than a pre-defined requirement. We proposed a solution for the path planning problem and it consists of two modules: network coordinator (NC) and motion controller (MC). The NC manages the topology of relay-assisted wireless communication networks. For the design of MC, we compare two motion strategies: maximum entropy and maximum mutual information. The simulation results show that our proposed solution achieves accurate signal reconstruction while maintaining the connectivity. We conclude that it's important to enable UAV-to-UAV communications for future ASN-based applications.

  • 227.
    Liu, Yongjun
    et al.
    Northeastern Univ, Coll Comp Sci & Engn, Shenyang 110819, Liaoning, Peoples R China;Changshu Inst Technol, Dept Comp Sci & Engn, Suzhou 215500, Peoples R China.
    Wei, Yangjie
    Northeastern Univ, Coll Comp Sci & Engn, Shenyang 110819, Liaoning, Peoples R China.
    Wang, Yi
    Uppsala universitet, Teknisk-naturvetenskapliga vetenskapsområdet, Matematisk-datavetenskapliga sektionen, Institutionen för informationsteknologi, Datorteknik. Northeastern Univ, Coll Comp Sci & Engn, Shenyang 110819, Liaoning, Peoples R China.
    Depth from defocus (DFD) based on VFISTA optimization algorithm in micro/nanometer vision2019Inngår i: Cluster Computing, ISSN 1386-7857, E-ISSN 1573-7543, Vol. 22, s. 1459-1467Artikkel i tidsskrift (Fagfellevurdert)
    Abstract [en]

    In the three-dimensional (3D) morphological reconstruction of micro/nano-scale vision, the global depth from defocus algorithm (DFD) transforms the depth information of the scene into a dynamic optimization problem to solve. In order to improve the problem of dynamic optimization in the recovery process of global DFD, a variable-step-size fast iterative shrinkage-thresholding algorithm (VFISTA) is proposed. The traditional iterative shrinkage-thresholding algorithm (ISTA) is often used to solve this dynamic optimization problem in the global DFD method. The ISTA algorithm is an extension of the gradient descent method, which is close to the minimal value point of the optimization process, and the convergence speed is slow. What is more, the ISTA algorithm uses fixed step length in the iterative process, The search direction tend to be "orthogonal", prone to "saw tooth" phenomenon, so close to the minimum point when the convergence rate is slower. First, the VFISTA algorithm joins the acceleration operator on the basis of the ISTA algorithm. Further, it combines linear search method to find the optimal iteration length, and changes the limit of the ISTA algorithm step fixed. Finally, it is applied to the depth measurement of defocus scene in micro/nanometer scale vision. The experimental results show that the proposed fast depth from defocus algorithm based on VFISTA has faster convergent speed. Moreover, the precision of the measurement is obviously improved in micro/nanometer scale vision.

  • 228.
    Luca, Mottola
    et al.
    RISE Swedish Institute of Computer Science, Kista SE164 29, Sweden;Politecnico di Milano, Milano 20133, Italy.
    Picco, Gian Pietro
    University of Trento, Trento 38122, Italy.
    Oppermann, Felix
    Graz University of Technology, Ultimo, NSW 2007, Australia.
    Eriksson, Joakim
    RISE Swedish Institute of Computer Science, Kista SE164 29, Sweden SICS.
    Finne, Niclas
    RISE Swedish Institute of Computer Science, Kista SE164 29, Sweden SICS.
    Fuchs, Harald
    SAP, Walldorf, 69190, Germany.
    Gaglione, Andrea
    University of Trento, Trento 38122, Italy.
    Karnouskos, Stamatis
    SAP, Walldorf, 69190, Germany.
    Montero, Patricio
    Acciona Infraestructuras S.A. Alcobendas, Madrid 28108, Spain.
    Oertel, Nina
    SAP, Walldorf, 69190, Germany.
    Römer, Kay
    Graz University of Technology, Ultimo, NSW 2007, Australia.
    Spiess, Patrik
    SAP, Walldorf, 69190, Germany.
    Tranquillini, Stefano
    University of Trento, Trento 38122, Italy.
    Voigt, Thiemo
    Uppsala universitet, Teknisk-naturvetenskapliga vetenskapsområdet, Matematisk-datavetenskapliga sektionen, Institutionen för informationsteknologi, Datorarkitektur och datorkommunikation. Uppsala universitet, Teknisk-naturvetenskapliga vetenskapsområdet, Matematisk-datavetenskapliga sektionen, Institutionen för informationsteknologi, Datorteknik. RISE Swedish Institute of Computer Science, Kista, SE-164 29, Sweden.
    makeSense: Simplifying the Integration of Wireless Sensor Networks into Business Processes2019Inngår i: IEEE Transactions on Software Engineering, ISSN 0098-5589, E-ISSN 1939-3520, Vol. 45, nr 6, s. 576-596Artikkel i tidsskrift (Fagfellevurdert)
    Abstract [en]

    A wide gap exists between the state of the art in developing Wireless Sensor Network (WSN) software and current practices concerning the design, execution, and maintenance of business processes. WSN software is most often developed based on low-level OS abstractions, whereas business process development leverages high-level languages and tools. This state of affairs places WSNs at the fringe of industry. The makeSense system addresses this problem by simplifying the integration of WSNs into business processes. Developers use BPMN models extended with WSN-specific constructs to specify the application behavior across both traditional business process execution environments and the WSN itself, which is to be equipped with application-specific software. We compile these models into a high-level intermediate language—also directly usable by WSN developers—and then into OS-specific deployment-ready binaries. Key to this process is the notion of meta-abstraction, which we define to capture fundamental patterns of interaction with and within the WSN. The concrete realization of meta-abstractions is application-specific; developers tailor the system configuration by selecting concrete abstractions out of the existing codebase or by providing their own. Our evaluation of makeSense shows that i) users perceive our approach as a significant advance over the state of the art, providing evidence of the increased developer productivity when using makeSense; ii) in large-scale simulations, our prototype exhibits an acceptable system overhead and good scaling properties, demonstrating the general applicability of makeSense; and, iii) our prototype—including the complete tool-chain and underlying system support—sustains a real-world deployment where estimates by domain specialists indicate the potential for drastic reductions in the total cost of ownership compared to wired and conventional WSN-based solutions.

  • 229. Lv, Mingsong
    et al.
    Guan, Nan
    Ma, Ye
    Ji, Dong
    Knippel, Erwin
    Liu, Xue
    Yi, Wang
    Uppsala universitet, Teknisk-naturvetenskapliga vetenskapsområdet, Matematisk-datavetenskapliga sektionen, Institutionen för informationsteknologi, Datorteknik.
    Speed planning for solar-powered electric vehicles2016Inngår i: Proc. 17th International Conference on Future Energy Systems, New York: ACM Press, 2016, artikkel-id 6Konferansepaper (Fagfellevurdert)
  • 230. Lv, Mingsong
    et al.
    Guan, Nan
    Reineke, Jan
    Wilhelm, Reinhard
    Yi, Wang
    Uppsala universitet, Teknisk-naturvetenskapliga vetenskapsområdet, Matematisk-datavetenskapliga sektionen, Institutionen för informationsteknologi, Datorteknik.
    A survey on static cache analysis for real-time systems2016Inngår i: Leibniz Transactions on Embedded Systems, ISSN 2199-2002, Vol. 3, nr 1, s. 05:1-48, artikkel-id 5Artikkel, forskningsoversikt (Fagfellevurdert)
  • 231. Lárusdóttir, Marta
    et al.
    Daniels, Mats
    Uppsala universitet, Teknisk-naturvetenskapliga vetenskapsområdet, Matematisk-datavetenskapliga sektionen, Institutionen för informationsteknologi, Datorteknik.
    McDermott, Roger
    Quality assurance using international curricula and employer feedback2015Inngår i: Conferences in Research and Practice in Information Technology, ISSN 1445-1336, Vol. 160, s. 19-27Artikkel i tidsskrift (Fagfellevurdert)
  • 232.
    Löscher, Andreas
    Uppsala universitet, Teknisk-naturvetenskapliga vetenskapsområdet, Matematisk-datavetenskapliga sektionen, Institutionen för informationsteknologi, Datorteknik. Uppsala universitet, Teknisk-naturvetenskapliga vetenskapsområdet, Matematisk-datavetenskapliga sektionen, Institutionen för informationsteknologi, Avdelningen för datalogi.
    Targeted Property-Based Testing with Applications in Sensor Networks2018Doktoravhandling, monografi (Annet vitenskapelig)
    Abstract [en]

    Testing is a fundamental part of modern software development, as it unveils bugs in the system under test and gives confidence in their correctness. Testing is often a laborious task as it typically requires to write by hand a plethora of test cases to test a system thoroughly. This task can be aided by high-level testing techniques such as random property-based testing (PBT) where the testing task is reduced to specifying properties that the system under test is expected to satisfy, and generators that produce well-distributed random inputs to these properties. However, as with all random testing techniques, the confidence in the system and the chances of finding a bug is proportional to the number of tests. If the set of possible inputs is large, even a high number of tests does not yield a satisfactory result. One example is testing sensor networks, where one not only needs to produce the inputs for the software system but also needs to consider the network topology and the systems environment.

    This dissertation presents targeted property-based testing, an enhanced form of PBT where the input generation is guided by a search strategy instead of being random, thereby combining the strengths of QuickCheck-like and search-based testing techniques. It furthermore presents an automation for the simulated annealing search strategy that reduces the manual task of using targeted PBT. We present concrete implementations for all presented techniques and a framework for PBT of sensor networks.

    Applying PBT to testing sensor networks has allowed us to test relatively complex software and uncover subtle and hard-to-find bugs. We evaluate targeted PBT by comparing it to its random counterpart on a series of case studies. We show that its testing performance is significantly higher than that of random PBT. Furthermore, we demonstrate that the extra effort required to use targeted PBT is limited to specifying a test goal. With these results, we argue that targeted PBT improves the state-of-the-art of software testing and ultimately leads to higher confidence in complex software systems.

  • 233.
    Malik, Adeel Mohammad
    et al.
    Ericsson, Stockholm, Sweden..
    Ahlgren, Bengt
    SICS Swedish ICT, Kista, Sweden..
    Ohlman, Börje
    Ericsson, Stockholm, Sweden..
    Lindgren, Anders
    SICS Swedish ICT, Kista, Sweden..
    Ngai, Edith
    Uppsala universitet, Teknisk-naturvetenskapliga vetenskapsområdet, Matematisk-datavetenskapliga sektionen, Institutionen för informationsteknologi, Datorteknik.
    Klingsbo, Lukas
    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.
    Experiences From A Field Test Using Icn For Live Video Streaming2015Inngår i: 2015 IEEE International Conference on Multimedia & Expo Workshops (ICMEW), 2015Konferansepaper (Fagfellevurdert)
    Abstract [en]

    Information Centric Networking (ICN) aims to evolve the Internet from a host-centric to a data-centric paradigm. In particular, it improves performance and resource efficiency in events with large crowds where many users in a local area want to generate and watch media content related to the event. In this paper, we present the design of a live video streaming system built on the NetInf ICN architecture and how the architecture was adapted to support live streaming of media content. To evaluate the feasibility and performance of the system, extensive field tests were carried out over several days during a major sports event. We show that our system streams videos successfully with low delay and communication overhead compared with existing Internet streaming services, by scalability tests using emulated clients we also show that it could support several thousands of simultaneous users.

  • 234.
    McCarthy, Tim
    et al.
    SRI Int, 333 Ravenswood Ave, Menlo Pk, CA 94025 USA.
    Rümmer, Philipp
    Uppsala universitet, Teknisk-naturvetenskapliga vetenskapsområdet, Matematisk-datavetenskapliga sektionen, Institutionen för informationsteknologi, Datorteknik.
    Schäf, Martin
    SRI Int, 333 Ravenswood Ave, Menlo Pk, CA 94025 USA.
    Bixie: Finding and understanding inconsistent code2015Inngår i: Proc. 37th IEEE/ACM International Conference on Software Engineering, Piscataway, NJ: IEEE , 2015, Vol. 2, s. 645-648Konferansepaper (Fagfellevurdert)
    Abstract [en]

    We present Bixie, a tool to detect inconsistencies in Java code. Bixie detects inconsistent code at a higher precision than previous tools and provides novel fault localization techniques to explain why code is inconsistent. We demonstrate the usefulness of Bixie on over one million lines of code, show that it can detect inconsistencies at a low false alarm rate, and fix a number of inconsistencies in popular open-source projects. Watch our Demo at http://youtu.be/QpsoUBJMxhk.

  • 235. McDermott, Roger
    et al.
    Daniels, Mats
    Uppsala universitet, Teknisk-naturvetenskapliga vetenskapsområdet, Matematisk-datavetenskapliga sektionen, Institutionen för informationsteknologi, Datorteknik.
    Cajander, Åsa
    Uppsala universitet, Teknisk-naturvetenskapliga vetenskapsområdet, Matematisk-datavetenskapliga sektionen, Institutionen för informationsteknologi, Bildanalys och människa-datorinteraktion.
    Perseverance measures and attainment in first year computing science students2015Inngår i: Proc. 20th Conference on Innovation and Technology in Computer Science Education, New York: ACM Press, 2015, s. 302-307Konferansepaper (Fagfellevurdert)
  • 236. McDermott, Roger
    et al.
    Daniels, Mats
    Uppsala universitet, Teknisk-naturvetenskapliga vetenskapsområdet, Matematisk-datavetenskapliga sektionen, Institutionen för informationsteknologi, Datorteknik.
    Cajander, Åsa
    Uppsala universitet, Teknisk-naturvetenskapliga vetenskapsområdet, Matematisk-datavetenskapliga sektionen, Institutionen för informationsteknologi, Bildanalys och människa-datorinteraktion.
    Bass, Julian
    Lalchandani, JayPrakash
    A comparative analysis of two globally distributed group projects: A perspective from CSCW/CSCL research2015Inngår i: Proc. 45th ASEE/IEEE Frontiers in Education Conference, Piscataway, NJ: IEEE Press, 2015, s. 1964-1972Konferansepaper (Fagfellevurdert)
  • 237.
    McDermott, Roger
    et al.
    Robert Gordon Univ, Sch Comp Sci & Digital Media, Aberdeen, Scotland.
    Zarb, Mark
    Robert Gordon Univ, Sch Comp Sci & Digital Media, Aberdeen, Scotland.
    Ballew, William
    Robert Gordon Univ, Sch Comp Sci & Digital Media, Aberdeen, Scotland.
    Daniels, Mats
    Uppsala universitet, Teknisk-naturvetenskapliga vetenskapsområdet, Matematisk-datavetenskapliga sektionen, Institutionen för informationsteknologi, Datorteknik.
    Isomöttönen, Ville
    Univ Jyvaskyla, Dept Math Informat Technol, FIN-40014 Jyvaskyla, Finland.
    Phronesis, Authentic Learning and the Solution of Open-Ended Problems in Computing and Engineering Education2018Inngår i: 2018 IEEE Frontiers in Education Conference (FIE), Piscataway, NJ: IEEE, 2018Konferansepaper (Fagfellevurdert)
    Abstract [en]

    One of the most significant changes in Higher Education pedagogy that has occurred over the past fifty years is the idea that university students should not just be taught theoretical subject knowledge but should engage with practical aspects of their course so developing the skills and professional competences that will allow them to gain successful employment after graduation. In this paper, we relate this development to the Aristotelian notion of intellectual virtue and specifically the concept of phronesis. We discuss the way in which this idea has developed from classical beginnings to the modern educational setting, and argue that the notion of phronesis, that is, practical wisdom or prudential judgement, is crucial to a range of activities which are fundamental to science, engineering and computing education. These include an understanding of what it means to engage in authentic learning and the solution of open-ended or ill-structured problems. We also discuss the role the concept plays in describing key features of work-based learning. Finally, we make some comments concerning the relative value the education system places on different types of knowledge, and why an appropriate understanding of phronesis allows for a proper appreciation of contingent knowledge within the curriculum.

  • 238. McDermott, Roger
    et al.
    Zarb, Mark
    Daniels, Mats
    Uppsala universitet, Teknisk-naturvetenskapliga vetenskapsområdet, Matematisk-datavetenskapliga sektionen, Institutionen för informationsteknologi, Datorteknik.
    Cajander, Åsa
    Uppsala universitet, Teknisk-naturvetenskapliga vetenskapsområdet, Matematisk-datavetenskapliga sektionen, Institutionen för informationsteknologi, Bildanalys och människa-datorinteraktion.
    Clear, Tony
    Motivation, optimal experience and flow in first year computing science2016Inngår i: Proc. 21st Conference on Innovation and Technology in Computer Science Education, New York: ACM Press, 2016, s. 206-211Konferansepaper (Fagfellevurdert)
  • 239. McDermott, Roger
    et al.
    Zarb, Mark
    Daniels, Mats
    Uppsala universitet, Teknisk-naturvetenskapliga vetenskapsområdet, Matematisk-datavetenskapliga sektionen, Institutionen för informationsteknologi, Datorteknik.
    Isomöttönen, Ville
    First year computing students' perceptions of authenticity in assessment2017Inngår i: Proc. 22nd Conference on Innovation and Technology in Computer Science Education, New York: ACM Press, 2017, s. 10-15Konferansepaper (Fagfellevurdert)
  • 240. McDermott, Roger
    et al.
    Zarb, Mark
    Daniels, Mats
    Uppsala universitet, Teknisk-naturvetenskapliga vetenskapsområdet, Matematisk-datavetenskapliga sektionen, Institutionen för informationsteknologi, Datorteknik.
    Nylén, Aletta
    Uppsala universitet, Teknisk-naturvetenskapliga vetenskapsområdet, Matematisk-datavetenskapliga sektionen, Institutionen för informationsteknologi, Datalogi.
    Pears, Arnold
    Uppsala universitet, Teknisk-naturvetenskapliga vetenskapsområdet, Matematisk-datavetenskapliga sektionen, Institutionen för informationsteknologi, Datorteknik.
    Isomöttönen, Ville
    Caspersen, Michael
    The authenticity of 'authentic' assessment: Some faculty perceptions2017Inngår i: Proc. 47th ASEE/IEEE Frontiers in Education Conference, Piscataway, NJ: IEEE Press, 2017Konferansepaper (Fagfellevurdert)
  • 241.
    McNamara, Liam
    et al.
    Swedish Inst Comp Sci, SE-16451 Stockholm, Sweden.
    Ngai, Edith
    Uppsala universitet, Teknisk-naturvetenskapliga vetenskapsområdet, Matematisk-datavetenskapliga sektionen, Institutionen för informationsteknologi, Datorteknik.
    SADHealth: A personal mobile sensing system for seasonal health monitoring2018Inngår i: IEEE Systems Journal, ISSN 1932-8184, E-ISSN 1937-9234, Vol. 12, nr 1, s. 30-40Artikkel i tidsskrift (Fagfellevurdert)
    Abstract [en]

    People's health, mood, and activities are closely related to their environment and the seasons. Countries at extreme latitudes (e.g., Sweden, U.K., and Norway) experience huge variations in their light levels, impacting the population's mental state, well-being and energy levels. Advanced sensing technologies on smartphones enable nonintrusive and longitudinal monitoring of user states. The collected data make it possible for healthcare professionals and individuals to diagnose and rectify problems caused by seasonality. In this paper, we present a personal mobile sensing system that exploits technologies on smartphones to efficiently and accurately detect the light exposure, mood, and activity levels of individuals. We conducted a 2-year experiment with many users to test the functionality and performance of our system. The results show that we can obtain accurate light exposure estimation by opportunistically measuring light data on smartphones, tracking both personal light exposure and the general seasonal trends. An optional questionnaire also provides insight into the correlation between a user's mood and energy level. Our system is able to inform users how little light they are experiencing in the winter time. It can also correlate light exposure data with reduced mood and energy, and provide quantitative measurements for lifestyle changes.

  • 242.
    Melin, Karin
    Uppsala universitet, Teknisk-naturvetenskapliga vetenskapsområdet, Matematisk-datavetenskapliga sektionen, Institutionen för informationsteknologi, Datorteknik.
    The GDPR Compliance of Blockchain: A qualitative study on regulating innovative technology2019Independent thesis Advanced level (professional degree), 20 poäng / 30 hpOppgave
    Abstract [en]

    This thesis aims to explore the compliance of blockchain technology and the GDPR. The GDPR was implemented for the EU member states in May 2018 with the purpose of harmonizing data protection regulation. However, the regulation is based on the notion that data is stored and processed in a centralized system. This causes an issue when it comes to distributed networks, and in particular with the distributed ledger technology (DLT), the underlying technology of blockchain.

    For this thesis, a literature review has been conducted to investigate the problems of GDPR compliance for blockchain projects, and what technical solutions exist to make a blockchain solution more GDPR compliant. In addition, interviews have been conducted to investigate the technical and legal perspectives on the current and future situations of regulation and technology.

    Compatibility problems mainly concern the immutability and transparency of a blockchain and examples of technical solutions that handle those problems can be found in the literature. Nevertheless, none of the discussed solutions are yet to guarantee full GDPR compliance. The technical and legal perspectives share ideas of the main compliance issues. However, differences such as interpretation of technical details can be identified, indicating problems to arise when regulating blockchains in the future. Further interdisciplinary work on guidelines for the GDPR is necessary for blockchain projects to be successful in complying with the regulation as well as to strengthen the technology neutrality of the GDPR.

  • 243.
    Melot, Nicolas
    et al.
    Linkoping Univ, Linkoping, Sweden..
    Janzén, Johan
    Uppsala universitet, Teknisk-naturvetenskapliga vetenskapsområdet, Matematisk-datavetenskapliga sektionen, Institutionen för informationsteknologi, Datorteknik.
    Kessler, Christoph
    Linkoping Univ, Linkoping, Sweden..
    Mimer and Schedeval: Tools for Comparing Static Schedulers for Streaming Applications on Manycore Architectures2015Inngår i: 2015 44Th International Conference On Parallel Processing Workshops, 2015, s. 146-155Konferansepaper (Fagfellevurdert)
    Abstract [en]

    Scheduling algorithms published in the scientific literature are often difficult to evaluate or compare due to differences between the experimental evaluations in any two papers on the topic. Very few researchers share the details about the scheduling problem instances they use in their evaluation section, the code that allows them to transform the numbers they collect into the results and graphs they show, nor the raw data produced in their experiments. Also, many scheduling algorithms published are not tested against a real processor architecture to evaluate their efficiency in a realistic setting. In this paper, we describe Mimer, a modular evaluation tool-chain for static schedulers that enables the sharing of evaluation and analysis tools employed to elaborate scheduling papers. We propose Schedeval that integrates into Mimer to evaluate static schedules of streaming applications under throughput constraints on actual target execution platforms. We evaluate the performance of Schedeval at running streaming applications on the Intel Single-Chip Cloud computer (SCC), and we demonstrate the usefulness of our tool-chain to compare existing scheduling algorithms. We conclude that Mimer and Schedeval are useful tools to study static scheduling and to observe the behavior of streaming applications when running on manycore architectures.

  • 244.
    Mobyen, Uddin Ahmed
    et al.
    MdH.
    Fotouhi, Hossein
    MdH.
    Köckemann, Uwe
    Örebro University.
    Linden, Maria
    MdH.
    Tomasic, Ivan
    MdH.
    Tsiftes, Nicolas
    RISE SICS.
    Voigt, Thiemo
    Uppsala universitet, Teknisk-naturvetenskapliga vetenskapsområdet, Matematisk-datavetenskapliga sektionen, Institutionen för informationsteknologi, Datorteknik.
    Run-Time Assurance for the E-care@ home System2018Konferansepaper (Fagfellevurdert)
  • 245.
    Mohaqeqi, Morteza
    et al.
    Uppsala universitet, Teknisk-naturvetenskapliga vetenskapsområdet, Matematisk-datavetenskapliga sektionen, Institutionen för informationsteknologi, Datorteknik.
    Abdullah, Jakaria
    Uppsala universitet, Teknisk-naturvetenskapliga vetenskapsområdet, Matematisk-datavetenskapliga sektionen, Institutionen för informationsteknologi, Datorteknik.
    Ekberg, Pontus
    Uppsala universitet, Teknisk-naturvetenskapliga vetenskapsområdet, Matematisk-datavetenskapliga sektionen, Institutionen för informationsteknologi, Datorteknik.
    Yi, Wang
    Uppsala universitet, Teknisk-naturvetenskapliga vetenskapsområdet, Matematisk-datavetenskapliga sektionen, Institutionen för informationsteknologi, Datorteknik.
    Refinement of workload models for engine controllers by state space partitioning2017Inngår i: 29th Euromicro Conference on Real-Time Systems: ECRTS 2017, Dagstuhl, Germany: Leibniz-Zentrum für Informatik , 2017, s. 11:1-22Konferansepaper (Fagfellevurdert)
  • 246.
    Mohaqeqi, Morteza
    et al.
    Uppsala universitet, Teknisk-naturvetenskapliga vetenskapsområdet, Matematisk-datavetenskapliga sektionen, Institutionen för informationsteknologi, Datorteknik.
    Abdullah, Jakaria
    Uppsala universitet, Teknisk-naturvetenskapliga vetenskapsområdet, Matematisk-datavetenskapliga sektionen, Institutionen för informationsteknologi, Datorteknik.
    Guan, Nan
    Yi, Wang
    Uppsala universitet, Teknisk-naturvetenskapliga vetenskapsområdet, Matematisk-datavetenskapliga sektionen, Institutionen för informationsteknologi, Datorteknik.
    Schedulability analysis of synchronous digraph real-time tasks2016Inngår i: Proc. 28th Euromicro Conference on Real-Time Systems, IEEE Computer Society, 2016, s. 176-186Konferansepaper (Fagfellevurdert)
  • 247.
    Mohaqeqi, Morteza
    et al.
    Uppsala universitet, Teknisk-naturvetenskapliga vetenskapsområdet, Matematisk-datavetenskapliga sektionen, Institutionen för informationsteknologi, Datorteknik.
    Abdullah, Jakaria
    Uppsala universitet, Teknisk-naturvetenskapliga vetenskapsområdet, Matematisk-datavetenskapliga sektionen, Institutionen för informationsteknologi, Datorteknik.
    Yi, Wang
    Uppsala universitet, Teknisk-naturvetenskapliga vetenskapsområdet, Matematisk-datavetenskapliga sektionen, Institutionen för informationsteknologi, Datorteknik.
    An executable semantics for synchronous task graphs: From SDRT to Ada2017Inngår i: Reliable Software Technologies — Ada-Europe 2017, Springer, 2017, Vol. 10300, s. 137-152Konferansepaper (Fagfellevurdert)
    Abstract [en]

    We study a graph-based real-time task model in which inter-task synchronization can be specified through a rendezvous mechanism. Previously, efficient methods have been proposed for timing analysis of the corresponding task sets. In this paper, we first formally specify an operational semantics for the model. Next, we describe a method for Ada code generation for a set of such task graphs. We also specify extensions of the approach to cover a notion of broadcasting, as well as global inter-release separation time of real-time jobs. We have implemented the proposed method in a graphical tool which facilitates a model-based design and implementation of real-time software.

  • 248.
    Mohaqeqi, Morteza
    et al.
    Uppsala universitet, Teknisk-naturvetenskapliga vetenskapsområdet, Matematisk-datavetenskapliga sektionen, Institutionen för informationsteknologi, Datorteknik.
    Abdullah, Jakaria
    Uppsala universitet, Teknisk-naturvetenskapliga vetenskapsområdet, Matematisk-datavetenskapliga sektionen, Institutionen för informationsteknologi, Datorteknik.
    Yi, Wang
    Uppsala universitet, Teknisk-naturvetenskapliga vetenskapsområdet, Matematisk-datavetenskapliga sektionen, Institutionen för informationsteknologi, Datorteknik.
    Modeling and analysis of data flow graphs using the digraph real-time task model2016Inngår i: Reliable Software Technologies — Ada-Europe 2016, Springer, 2016, s. 15-29Konferansepaper (Fagfellevurdert)
  • 249.
    Mohaqeqi, Morteza
    et al.
    Uppsala universitet, Teknisk-naturvetenskapliga vetenskapsområdet, Matematisk-datavetenskapliga sektionen, Institutionen för informationsteknologi, Datorteknik.
    Ekberg, Pontus
    Uppsala universitet, Teknisk-naturvetenskapliga vetenskapsområdet, Matematisk-datavetenskapliga sektionen, Institutionen för informationsteknologi, Datorteknik.
    Yi, Wang
    Uppsala universitet, Teknisk-naturvetenskapliga vetenskapsområdet, Matematisk-datavetenskapliga sektionen, Institutionen för informationsteknologi, Datorteknik.
    On fixed-priority schedulability analysis of sporadic tasks with self-suspension2016Inngår i: Proc. 24th International Conference on Real-Time Networks and Systems, New York: ACM Press, 2016, s. 109-118Konferansepaper (Fagfellevurdert)
  • 250.
    Mohaqeqi, Morteza
    et al.
    Uppsala universitet, Teknisk-naturvetenskapliga vetenskapsområdet, Matematisk-datavetenskapliga sektionen, Institutionen för informationsteknologi, Datorteknik.
    Mousavi, Mohammad Reza
    Sound test-suites for cyber-physical systems2016Inngår i: Proc. 10th International Symposium on Theoretical Aspects of Software Engineering, IEEE Computer Society, 2016, s. 42-48Konferansepaper (Fagfellevurdert)
2345678 201 - 250 of 364
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