| 1. |
- Rexhepi, Hanife, 1984-, et al.
(författare)
-
Cancer patients’ information seeking behavior related to online electronic healthcare records
- 2021
-
Ingår i: Health Informatics Journal. - : Sage Publications. - 1460-4582 .- 1741-2811. ; 27:3, s. 1-12
-
Tidskriftsartikel (refereegranskat)abstract
- Patients’ online access to their EHR together with the rapid proliferation of medical information on the Internet has changed how patients use information to learn about their health. Patients’ tendency to turn to the Internet to find information about their health and care is well-documented. However, little is known about patients’ information seeking behavior when using online EHRs. By using information horizons as an analytical tool this paper aims to investigate the information behavior of cancer patients who have chosen to view their EHRs (readers) and to those who have not made that option (non-readers). Thirty interviews were conducted with patients. Based on information horizons, it seems that non-reading is associated with living in a narrower information world in comparison to readers. The findings do not suggest that the smallness would be a result of active avoidance of information, or that it would be counterproductive for the patients. The findings suggest, however, that EHRs would benefit from comprehensive linking to authoritative health information sources to help users to understand their contents. In parallel, healthcare professionals should be more aware of their personal role as a key source of health information to those who choose not to read their EHRs.
|
|
| 2. |
- Memedi, Mevludin, 1983-, et al.
(författare)
-
Automatic Spiral Analysis for Objective Assessment of Motor Symptoms in Parkinson's Disease
- 2015
-
Ingår i: Sensors. - : MDPI AG. - 1424-8220. ; 15:9, s. 23727-23744
-
Tidskriftsartikel (refereegranskat)abstract
- A challenge for the clinical management of advanced Parkinson's disease (PD) patients is the emergence of fluctuations in motor performance, which represents a significant source of disability during activities of daily living of the patients. There is a lack of objective measurement of treatment effects for in-clinic and at-home use that can provide an overview of the treatment response. The objective of this paper was to develop a method for objective quantification of advanced PD motor symptoms related to off episodes and peak dose dyskinesia, using spiral data gathered by a touch screen telemetry device. More specifically, the aim was to objectively characterize motor symptoms (bradykinesia and dyskinesia), to help in automating the process of visual interpretation of movement anomalies in spirals as rated by movement disorder specialists. Digitized upper limb movement data of 65 advanced PD patients and 10 healthy (HE) subjects were recorded as they performed spiral drawing tasks on a touch screen device in their home environment settings. Several spatiotemporal features were extracted from the time series and used as inputs to machine learning methods. The methods were validated against ratings on animated spirals scored by four movement disorder specialists who visually assessed a set of kinematic features and the motor symptom. The ability of the method to discriminate between PD patients and HE subjects and the test-retest reliability of the computed scores were also evaluated. Computed scores correlated well with mean visual ratings of individual kinematic features. The best performing classifier (Multilayer Perceptron) classified the motor symptom (bradykinesia or dyskinesia) with an accuracy of 84% and area under the receiver operating characteristics curve of 0.86 in relation to visual classifications of the raters. In addition, the method provided high discriminating power when distinguishing between PD patients and HE subjects as well as had good test-retest reliability. This study demonstrated the potential of using digital spiral analysis for objective quantification of PD-specific and/or treatment-induced motor symptoms.
|
|
| 3. |
|
|
| 4. |
- Lv, Zhihan, Dr. 1984-, et al.
(författare)
-
5G for mobile augmented reality
- 2022
-
Ingår i: International Journal of Communication Systems. - : John Wiley & Sons. - 1074-5351 .- 1099-1131. ; 35:5
-
Tidskriftsartikel (övrigt vetenskapligt/konstnärligt)
|
|
| 5. |
- Lv, Zhihan, Dr. 1984-, et al.
(författare)
-
Editorial : 5G for Augmented Reality
- 2022
-
Ingår i: Mobile Networks and Applications. - : Springer. - 1383-469X .- 1572-8153.
-
Tidskriftsartikel (refereegranskat)
|
|
| 6. |
- Frezza, S., et al.
(författare)
-
Modelling competencies for computing education beyond 2020 : A research based approach to defining competencies in the computing disciplines
- 2018
-
Ingår i: Annual Conference on Innovation and Technology in Computer Science Education, ITiCSE. - New York, NY, USA : Association for Computing Machinery. - 9781450362238 ; , s. 148-174, s. 148-174
-
Konferensbidrag (refereegranskat)abstract
- How might the content and outcomes of tertiary education programmes be described and analysed in order to understand how they are structured and function? To address this question we develop a framework for modelling graduate competencies linked to tertiary degree programmes in the computing disciplines. While the focus of our work is computing the framework is applicable to education more broadly. The work presented here draws upon the pioneering curricular document for information technology (IT2017), curricular competency frameworks, other related documents such as the software engineering competency model (SWECOM), the Skills Framework for the Information Age (SFIA), current research in competency models, and elicitation workshop results from recent computing conferences. The aim is to inform the ongoing Computing Curricula (CC2020) project, an endeavour supported by the Association for Computing Machinery (ACM) and the IEEE Computer Society. We develop the Competency Learning Framework (CoLeaF), providing an internationally relevant tool for describing competencies. We argue that this competency based approach is well suited for constructing learning environments and assists degree programme architects in dealing with the challenge of developing, describing and including competencies relevant to computer and IT professionals. In this paper we demonstrate how the CoLeaF competency framework can be applied in practice, and though a series of case studies demonstrate its effectiveness and analytical power as a tool for describing and comparing degree programmes in the international higher education landscape.
|
|
| 7. |
- Paçacı, Görkem, et al.
(författare)
-
Towards a visual compositional relational programming methodology
- 2012
-
Ingår i: Diagrams 2012. ; , s. 17-19
-
Konferensbidrag (refereegranskat)abstract
- We present a new visual programming method, based on Combilog, a compositional relational programming language. In this paper we focus on the compositional aspect of Combilog, the make operator, visually implementing it via a modification of Higraph diagrams, in an attempt to overcome the obscurity and complexity in the textual representation of this operator.
|
|
| 8. |
- Liu, Yuqi, et al.
(författare)
-
Integration of Multi-scale Spatial Digital Twins in Metaverse Based on Multi-dimensional Hash Geocoding
- 2024
-
Ingår i: IMX '24. - : Association for Computing Machinery (ACM). - 9798400705038 ; , s. 56-63
-
Konferensbidrag (refereegranskat)abstract
- With the popularization of the metaverse, virtual reality mapping technology based on digital twins has generated a large amount of spatial data. These data are multidimensional, multi-scale, mobile, and distributed. In order to fully utilize these data, we propose a non mutation multidimensional hash geocoding that can organize and store data with geographic features, and achieve data mapping at different scales from macro to micro. The mapping between them can achieve joint utilization of data of various scales. On this basis, we propose a block network secure storage mapping model for spatial digital twins, which can securely and reliably organize and map spatial data. This article also looks forward to the possible emergence of digital twins of different dimensions and scales in the future metaverse, and proposes an adaptive 3D reconstruction method based on this to adapt to digital twins models of different scales in the metaverse. On the basis of our work, we will further promote the development of the spatial digital twin metaverse.
|
|
| 9. |
- Winblad, Kjell, 1985-
(författare)
-
Dynamic Adaptations of Synchronization Granularity in Concurrent Data Structures
- 2018
-
Doktorsavhandling (övrigt vetenskapligt/konstnärligt)abstract
- The multicore revolution means that programmers have many cores at their disposal in everything from phones to large server systems. Concurrent data structures are needed to make good use of all the cores. Designing a concurrent data structure that performs well across many different scenarios is a difficult task. The reason for this is that the best synchronization granularity and data organization vary between scenarios. Furthermore, the number of parallel threads and the types of operations that are accessing a data structure may even change over time.This dissertation tackles the problem mentioned above by proposing concurrent data structures that dynamically adapt their synchronization granularity and organization based on usage statistics collected at run-time. Two of these data structures (one lock-free and one lock-based) implement concurrent sets with support for range queries and other multi-item operations. These data structures adapt their synchronization granularity based on detected contention and the number of items that are involved in multi-item operations such as range queries. This dissertation also proposes a concurrent priority queue that dynamically changes its precision based on detected contention.Experimental evaluations of the proposed data structures indicate that they outperform non-adaptive data structures over a wide range of scenarios because they adapt their synchronization based on usage statistics. Possible practical consequences of the work described in this dissertation are faster parallel programs and a reduced need to manually tune the synchronization granularities of concurrent data structures.
|
|
| 10. |
- Fersman, Elena, et al.
(författare)
-
Task Automata : Schedulability, Decidability and Undecidability
- 2007
-
Ingår i: Information and Computation. - : Elsevier. - 0890-5401 .- 1090-2651. ; 205:8, s. 1149-1172
-
Tidskriftsartikel (refereegranskat)abstract
- We present a model, task automata, for real time systems with non-uniformly recurring computation tasks. It is an extended version of timed automata with asynchronous processes that are computation tasks generated (or triggered) by timed events. Compared with classical task models for real time systems, task automata may be used to describe tasks (1) that are generated non-deterministically according to timing constraints in timed automata, (2) that may have interval execution times representing the best case and the worst case execution times, and (3) whose completion times may influence the releases of task instances. We generalize the classical notion of schedulability to task automata. A task automaton is schedulable if there exists a scheduling strategy such that all possible sequences of events generated by the automaton are schedulable in the sense that all associated tasks can be computed within their deadlines. Our first technical result is that the schedulability for a given scheduling strategy can be checked algorithmically for the class of task automata when the best case and the worst case execution times of tasks are equal. The proof is based on a decidable class of suspension automata: timed automata with bounded subtraction in which clocks may be updated by subtractions within a bounded zone. We shall also study the borderline between decidable and undecidable cases. Our second technical result shows that the schedulability checking problem will be undecidable if the following three conditions hold: (1) the execution times of tasks are intervals, (2) the precise finishing time of a task instance may influence new task releases, and (3) a task is allowed to preempt another running task.
|
|
