lnu.sePublications
Change search
Refine search result
48495051 2501 - 2522 of 2522
CiteExportLink to result list
Permanent link
Cite
Citation style
  • apa
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf
Rows per page
  • 5
  • 10
  • 20
  • 50
  • 100
  • 250
Sort
  • Standard (Relevance)
  • Author A-Ö
  • Author Ö-A
  • Title A-Ö
  • Title Ö-A
  • Publication type A-Ö
  • Publication type Ö-A
  • Issued (Oldest first)
  • Issued (Newest first)
  • Created (Oldest first)
  • Created (Newest first)
  • Last updated (Oldest first)
  • Last updated (Newest first)
  • Disputation date (earliest first)
  • Disputation date (latest first)
  • Standard (Relevance)
  • Author A-Ö
  • Author Ö-A
  • Title A-Ö
  • Title Ö-A
  • Publication type A-Ö
  • Publication type Ö-A
  • Issued (Oldest first)
  • Issued (Newest first)
  • Created (Oldest first)
  • Created (Newest first)
  • Last updated (Oldest first)
  • Last updated (Newest first)
  • Disputation date (earliest first)
  • Disputation date (latest first)
Select
The maximal number of hits you can export is 250. When you want to export more records please use the Create feeds function.
  • 2501.
    Zou, Hanzheng
    Växjö University, Faculty of Mathematics/Science/Technology, School of Mathematics and Systems Engineering.
    Build an Inventory Tracking System2007Independent thesis Advanced level (degree of Master (One Year)), 10 credits / 15 HE creditsStudent thesis
    Abstract [en]

    This thesis paper introduces you about the process of how to build an inventory tracking system in a local Swedish company. The related project is to support the thesis paper, and is also for the company’ using. The software product of this project is an application that works for managing various types’ instruments in the company of SWECO-Vaxjo. It will play an important role in the further management work of the company.

    In this thesis paper, the candidate techniques and theories for implementing this system are discussed. And in the end a good solution for this problem will be presented in the paper.

  • 2502.
    Zubair, Ghaith
    et al.
    Växjö University, Faculty of Mathematics/Science/Technology, School of Technology and Design.
    El-Thalji, Idriss
    Växjö University, Faculty of Mathematics/Science/Technology, School of Technology and Design.
    A model for analysis and design of an integrated operations management system using systems engineering approach: A case study2007Report (Other academic)
    Abstract [en]

    Background: Generally, operation management includes a set of complicated systems interfacing each other. Most important systems which impact and impacted by the operations management system are production management system and maintenance management system. But to treat the interfacing losses has been difficult as interact and partially overlap each other. In this study, case-operational system was treated with developed model that analysis and design integrated operational system in order to make it easier and cost effective to manage.

    Methods: A model was developed based on latest literature survey work using systems paradigm methodology and systems engineering approach.

    Results: Among five analysis techniques, four types of interfacing losses were identified, seven requirements were extracted, nine conceptual solutions were generated, one of them was selected and based on it the integrated operational management system were designed.

    Conclusions: The results suggest that the operational system in case-company shall be integrated by organization management, process management, and control management, in addition to data management.

  • 2503.
    Zukas, Paulius
    Linnaeus University, Faculty of Technology, Department of computer science and media technology (CM).
    Raising Awareness of Computer Vision: How can a single purpose focused CV solution be improved?2018Independent thesis Basic level (degree of Bachelor), 10 credits / 15 HE creditsStudent thesis
    Abstract [en]

    The concept of Computer Vision is not new or fresh. On contrary ideas have been shared and worked on for almost 60 years. Many use cases have been found throughout the years and various systems developed, but there is always a place for improvement. An observation was made, that methods used today are generally focused on a single purpose and implement expensive technology, which could be improved. In this report, we are going to go through an extensive research to find out if a professionally sold, expensive software, can be replaced by an off the shelf, low-cost solution entirely designed and developed in-house. To do that we are going to look at the history of Computer Vision, examples of applications, algorithms, and find general scenarios or computer vision problems which can be solved. We are then going take a step further and define solid use cases for each of the scenarios found. Finally, a prototype solution is going to be designed and presented. After analysing the results gathered we are going to reach out to the reader convincing him/her that such application can be developed and work efficiently in various areas saving investments to businesses.

  • 2504.
    Åkerblom, Pontus
    et al.
    Linnaeus University, Faculty of Technology, Department of Informatics.
    Nilsson, Joacim
    Linnaeus University, Faculty of Technology, Department of Informatics.
    Knowledge Management Systems Issues Within Organizations2017Independent thesis Advanced level (degree of Master (One Year)), 10 credits / 15 HE creditsStudent thesis
    Abstract [en]

    The aim of this study is to locate if there are some common problems connected to knowledge management systems (KMSs) within organizations. This thesis begins with an introduction to knowledge management (KM) and knowledge management systems, followed by a presentation of previous research in the field of KM problematics. To find these possible issues that may prevent an effective use of KMSs within organizations, we will study contemporary literature and perform some complementary interviews. The questions formulated are addressed to participants from the organization Tieto, at their office in Lund. The questions are kept to a restricted number to gather replies that collect the main answers of relevance. The results from the literature review are then compared to the interviews. The main conclusion of this study is that the organizational culture may affect the possible occurrence of KMSs that suffer from usability problems, which causes the knowledge sharing to be inadequate. Finally; a picture of the problem areas concerning KMSs within organizations arise and some resolutions along with recommendations are presented.

  • 2505.
    Åkerlund, Rasmus
    Linnaeus University, Faculty of Technology, Department of computer science and media technology (CM).
    Real-time localization of balls and hands in videos of juggling using a convolutional neural network2019Independent thesis Basic level (degree of Bachelor), 10 credits / 15 HE creditsStudent thesis
    Abstract [en]

    Juggling can be both a recreational activity that provides a wide variety of challenges to participants and an art form that can be performed on stage. Non-learning-based computer vision techniques, depth sensors, and accelerometers have been used in the past to augment these activities. These solutions either require specialized hardware or only work in a very limited set of environments. In this project, a 54 000 frame large video dataset of annotated juggling was created and a convolutional neural network was successfully trained that could locate the balls and hands with high accuracy in a variety of environments. The network was sufficiently light-weight to provide real-time inference on CPUs. In addition, the locations of the balls and hands were recorded for thirty-six common juggling pattern, and small neural networks were trained that could categorize them almost perfectly. By building on the publicly available code, models and datasets that this project has produced jugglers will be able to create interactive juggling games for beginners and novel audio-visual enhancements for live performances.

  • 2506.
    Åkesson, Peter
    University of Kalmar, School of Communication and Design.
    Bandesign för Multiplayerspel2009Independent thesis Basic level (degree of Bachelor), 10 credits / 15 HE creditsStudent thesis
    Abstract [en]

    Denna rapport är en undersökning om hur man gör en bana i ett FPS-spel så att banan blirintressant och rolig så att så många spelare som möjligt vill spela den. För att komma framtill det har jag skapat en bana i Hammer till spelet Team Fortress 2 för att göra vissa testerpå den för att därigenom komma fram till mitt resultat.

    Slutligen kom jag fram till att det viktigaste när man skapar en bana är variation och att hamed något som passar alla. Dessutom kan det ha en viss vikt hur banan ser ut annarskommer folk inte ens testa banan.

  • 2507.
    Åström, Tobias
    Linnaeus University, Faculty of Science and Engineering, School of Computer Science, Physics and Mathematics.
    Statelessness erases every trace of security: Tillämpningar för implementation av plattformsoberoende RESTful webbtjänster med fokus på användarautentisering och skalbarhet2011Independent thesis Basic level (degree of Bachelor), 10 credits / 15 HE creditsStudent thesis
    Abstract [en]

    The intention of this dissertation is to examine implementation best practices for cross-platform RESTful web services with a focus on user authentication and scalability. The result in terms of user authentication is meant to problematize the common principle of constraint that is that communication should be made between more than two parties and also mean that the users resource request never is secure until the communication breaks the of REST required terms of statelessness. The result in terms of user scalability is meant to question the common view of application resources and mean that the establishment of The Resource Kinship enables a simplified filtering of resource representation and a structured way of organization for resource data sets and addressing.

  • 2508.
    Çarçani, Klaudia
    et al.
    Høgskolan i Østfold, Norge.
    Mörtberg, Christina
    Linnaeus University, Faculty of Technology, Department of Informatics.
    Enhancing engagement and participation of seniors in society withthe use of Social Media: The case of a reflective participatory design method story2018In: IxD&A: Interaction Design and Architecture(s), ISSN 1826-9745, E-ISSN 2283-2998, Vol. 36, no SI, p. 58-74Article in journal (Refereed)
    Abstract [en]

    An ageing population is an emerging phenomenon in Europe and the rest of the world. Seniors face issues of social isolation and loneliness. Recently the research focus in ICT design has also turned to social media that can sustain seniors’ engagement and participation in social activities even when it is physically a challenge for them to leave home. Design and re-design of social media may support seniors’ engagement and participation in social activities, contributing to mitigate the feeling of loneliness and social isolation. In this paper, the focus is on understanding seniors’ social activities and their relationship to social media which may support their relationship. With Participatory Design – a reflective design approach, we have involved seniors in reflecting on possible future social media that can support and enrich social relationships. The participative methods used are cartographic mapping and future workshop, both appropriate for seniors to get involved in reflecting, thinking and making design alternatives together with other participants. We discuss how is to involve seniors in PD and what we need to know to design better future social media that can support seniors.

  • 2509.
    Öberg, Christian
    Linnaeus University, Faculty of Science and Engineering, School of Computer Science, Physics and Mathematics.
    Möblering med Procedurell Generering: Furnishing with Procedural Generation2010Independent thesis Basic level (degree of Bachelor), 10 credits / 15 HE creditsStudent thesis
    Abstract [en]

    In game development today there are two ways for developers to create digital content. Manually by people who create all the content by hand or automatically by letting a program, through use of equations that describes the content, generate it when needed. The method of letting a program generate the digital content is called Procedural Content Generation (PCG) and is used in graphic applications, computer games, simulators and online applications. This work, for the Linnaeus University, is about the development of a way to furnish a virtual room by the concept of PCG. The generation algorithm is rule based and with this solution one or more rooms can be furnished without the need to save the rooms content.

  • 2510.
    Öberg, Jonas
    University of Kalmar, School of Communication and Design.
    Comparative study of operating system security using SELinux and Systrace2009Independent thesis Basic level (degree of Bachelor), 10 credits / 15 HE creditsStudent thesis
    Abstract [en]

    This thesis makes a comparative study of the security systemsSystrace (used primarily with OpenBSD) and SELinux (usedexclusively with Linux), trying to answer the question as to whichtype of security is offered by each respective system, and wheneach should be used. The key difference between SELinux andSystrace seems to be their mode of operation, where SELinux,built around the LSM framework in the Linux kernel, works withtype enforcement on files, sockets and other objects, whereasSystrace works on a strict system call basis. The two systems areseen to serve two different purposes which sometimes overlap,but in just as many cases provide solutions for entirely differentquality priorities.

  • 2511.
    Öhlin, Anton
    et al.
    Linnaeus University, Faculty of Science and Engineering, School of Computer Science, Physics and Mathematics.
    Viking, Sebastian
    Linnaeus University, Faculty of Science and Engineering, School of Computer Science, Physics and Mathematics.
    MPLS kontra traditionell IP-routing: en jämförelse av resursåtgång2011Independent thesis Basic level (degree of Bachelor), 10 credits / 15 HE creditsStudent thesis
    Abstract [en]

    Multi Protocol Label Switching (MPLS) is a growing routing technology. It is getting more common in today’s modern networks. When implementing MPLS, it is essential that the hardware is capable of handling such technology. If not, this could lead to packet loss or even network outage. The purpose of this study was to examine differences between MPLS and traditional IP-routing in aspect of CPU utilization. Routing protocols BGP, OSPF and RIP were configured together with the technologies in order to see which of the mentioned routing protocols that was the most efficient in terms of CPU utilization.

    An environment was created for the experiment. Each routing protocol was configured together with MPLS and traditional IP-routing respectively, which lead to a total of six scenarios. Traffic was sent through the network with an application called Ostinato with the purpose of increasing the load of the devices.

    The results showed higher CPU utilization with MPLS compared to traditional IP-routing. This was the case with each routing protocol. BGP had the lowest CPU utilization of the routing protocols in conjunction with MPLS whilst OSPF had the highest. The result between OSPF and RIP was slightly different.

  • 2512.
    Öigaard, Sandra
    Linnaeus University, Faculty of Technology, Department of Computer Science.
    Programming language & Gender2015Independent thesis Basic level (degree of Bachelor), 10 credits / 15 HE creditsStudent thesis
    Abstract [en]

    Once women were the pioneers within the tech industry, but during the last decades the amount of women who choose a career within computer science has decreased rapidly. Programming languages have evolved during the last decades and because of the growing gender gap in the industry, they have done so involuntarily in the absence of women. The imbalance raises the question if the tech industry and the programming languages have been adapted for a more masculine way of developing software. A quantitative study and a literature review evaluates if there is a need for a computerlanguage developed towards women. The study comes to the conclusion that there is no need for a female inspired computer language, but the way computer languages are taught suits the male way of thinking better than the female way.

  • 2513.
    Österlund, Erik
    Linnaeus University, Faculty of Science and Engineering, School of Computer Science, Physics and Mathematics.
    Automatic memory management system for automatic parallelization2011Independent thesis Basic level (degree of Bachelor), 10 credits / 15 HE creditsStudent thesis
    Abstract [en]

    With Moore’s law coming to an end and the era of multiprocessor chips emerging, the need for ways of dealing with the essential problems with concurrency is becoming imminent. Automatic parallelization for imperative languages and pure functions in functional programming languages all try to prove independence statically. This thesis argues that independence is dynamic in nature. Static analysis for automatic parallelization has failed to do anything but trivial optimizations.

    This thesis shows a new approach where dynamic analysis about the system is provided for very low costs using a garbage collector that has to go through all live cells anyway. Immutable sub-graphs of objects that cannot change state are found. Their methods become pure functions that can be parallelized. The garbage collector implemented is a kind of replicating collector. It is about three times faster than Boehm’s collector in garbage collection, fully concurrent and provides the dynamic analysis almost for free.

  • 2514.
    Österlund, Erik
    Linnaeus University, Faculty of Science and Engineering, School of Computer Science, Physics and Mathematics.
    Garbage Collection supporting automatic JIT parallelization in JVM2012Independent thesis Advanced level (degree of Master (One Year)), 10 credits / 15 HE creditsStudent thesis
    Abstract [en]

    With increasing clock-rates in CPUs coming to an end, a need for parallelization has emerged. This thesis proposes a dynamic purity analysis of objects, detecting independent execution paths that may be run in parallel. The analysis relies in speculative guesses and may be rolled back when proven wrong. It piggybags on an efficient replicating garbage collector integrated to JVM.

    The efficiency of the algorithms are shown in benchmark, and are comparable to the speed of state of the art garbage collectors in hotspot’s JVM.

    With this dynamic purity analysis now accessible in Java programs, the potential for automatic JIT-parallelization of pure methods is possible.

  • 2515.
    Österlund, Erik
    et al.
    Linnaeus University, Faculty of Science and Engineering, School of Computer Science, Physics and Mathematics.
    Löwe, Welf
    Linnaeus University, Faculty of Science and Engineering, School of Computer Science, Physics and Mathematics.
    Analysis of pure methods using garbage collection2012In: Proceedings of the 2012 ACM SIGPLAN Workshop on Memory Systems Performance and Correctness, ACM Press, 2012, p. 48-57Conference paper (Refereed)
    Abstract [en]

    Parallelization and other optimizations often depend on static dependence analysis. This approach requires methods to be independent regardless of the input data, which is not always the case.

    Our contribution is a dynamic analysis "guessing" if methods are pure, i. e., if they do not change state. The analysis is piggybacking on a garbage collector, more specifically, a concurrent, replicating garbage collector. It guesses whether objects are immutable by looking at actual mutations observed by the garbage collector. The analysis is essentially for free. In fact, our concurrent garbage collector including analysis outperforms Boehm's stop-the-world collector (without any analysis), as we show in experiments. Moreover, false guesses can be rolled back efficiently.

    The results can be used for just-in-time parallelization allowing an automatic parallelization of methods that are pure over certain periods of time. Hence, compared to parallelization based on static dependence analysis, more programs potentially benefit from parallelization.

  • 2516.
    Österlund, Erik
    et al.
    Linnaeus University, Faculty of Technology, Department of Computer Science.
    Löwe, Welf
    Linnaeus University, Faculty of Technology, Department of Computer Science.
    Concurrent Compaction using a Field Pinning Protocol2015In: ISMM 2015 Proceedings of the 2015 ACM SIGPLAN International Symposium on Memory Management, ACM Press, 2015, Vol. 50(11), p. 56-69Conference paper (Refereed)
    Abstract [en]

    Compaction of memory in long running systems has always been important. The latency of compaction increases in today’s systems with high memory demands and large heaps. To deal with this problem, we present a lock-free protocol allowing for copying concurrent with the application running, which reduces the latencies of compaction radically. It pro- vides theoretical progress guarantees for copying and appli- cation threads without making it practically infeasible, with performance overheads of 20% on average. The algorithm paves way for a future lock-free Garbage Collector. 

  • 2517.
    Österlund, Erik
    et al.
    Linnaeus University, Faculty of Technology, Department of Computer Science.
    Löwe, Welf
    Linnaeus University, Faculty of Technology, Department of Computer Science.
    Concurrent transformation components using contention context sensors2014In: Proceedings of the 29th ACM/IEEE international conference on Automated software engineering, ACM Press, 2014, p. 223-234Conference paper (Refereed)
    Abstract [en]

    Sometimes components are conservatively implemented as thread-safe, while during the actual execution they are only accessed from one thread. In these scenarios, overly conservative assumptions lead to suboptimal performance.

    The contribution of this paper is a component architecture that combines the benefits of different synchronization mechanisms to implement thread-safe concurrent components. Based on the thread contention monitored at runtime, context-aware composition and optimization select the appropriate mechanism. On changing contention, it revises this decision automatically and transforms the components accordingly. We implemented this architecture for concurrent queues, sets, and ordered sets. In all three cases, experimental evaluation shows close to optimal performance regardless of the actual contention.

    As a consequence, programmers can focus on the semantics of their systems and, e.g., conservatively use thread-safe components to assure consistency of their data, while deferring implementation and optimization decisions to contention-context-aware composition at runtime.

  • 2518.
    Österlund, Erik
    et al.
    Linnaeus University, Faculty of Technology, Department of Computer Science.
    Löwe, Welf
    Linnaeus University, Faculty of Technology, Department of Computer Science.
    Dynamically transforming data structures2013In: 2013 IEEE/ACM 28th International Conference on Automated Software Engineering (ASE): Proceedings / [ed] Ewewn Denney, Tevfik Bultan, Andreas Zeller, IEEE, 2013, p. 410-420Conference paper (Refereed)
    Abstract [en]

    Fine-tuning which data structure implementation to use for a given problem is sometimes tedious work since the optimum solution depends on the context, i.e., on the operation sequences, actual parameters as well as on the hardware available at run time. Sometimes a data structure with higher asymptotic time complexity performs better in certain contexts because of lower constants. The optimal solution may not even be possible to determine at compile time.We introduce transformation data structures that dynamically change their internal representation variant based on a possibly changing context. The most suitable variant is selected at run time rather than at compile time.We demonstrate the effect on performance with a transformation ArrayList data structure using an array variant and a linked hash bag variant as alternative internal representations. Using our transformation ArrayList, the standard DaCapo benchmark suite shows a performance gain of 5.19% in average.

  • 2519.
    Österlund, Erik
    et al.
    Linnaeus University, Faculty of Technology, Department of Computer Science.
    Löwe, Welf
    Linnaeus University, Faculty of Technology, Department of Computer Science.
    Field Pinning GC2014Conference paper (Refereed)
    Abstract [en]

    The contribution of this study is a Field Pinning garbage collector (GC) without handshakes in the compaction phase. It is one step towards guaranteeing wait-free GC. It compacts memory concurrently and guarantees that fragmentation is bounded. Mutator heap accesses and computations are wait-free. The compaction algorithm does not need handshakes, but may use them for increased performance. The solution is evaluated experimentally in a prototype VM for Java. The GC progress is not wait-free, but impeded only by stack scanning and marking which was outside the scope of this study. The compaction algorithm does not impair global GC progress. 

  • 2520.
    Österlund, Erik
    et al.
    Oracle.
    Löwe, Welf
    Linnaeus University, Faculty of Technology, Department of computer science and media technology (CM), Department of Computer Science.
    Self-adaptive concurrent components2018In: Automated Software Engineering: An International Journal, ISSN 0928-8910, E-ISSN 1573-7535, Vol. 25, no 1, p. 47-99Article in journal (Refereed)
    Abstract [en]

    Selecting the optimum component implementation variant is sometimes difficult since it depends on the component's usage context at runtime, e.g., on the concurrency level of the application using the component, call sequences to the component, actual parameters, the hardware available etc. A conservative selection of implementation variants leads to suboptimal performance, e.g., if a component is conservatively implemented as thread-safe while during the actual execution it is only accessed from a single thread. In general, an optimal component implementation variant cannot be determined before runtime and a single optimal variant might not even exist since the usage contexts can change significantly over the runtime. We introduce self-adaptive concurrent components that automatically and dynamically change not only their internal representation and operation implementation variants but also their synchronization mechanism based on a possibly changing usage context. The most suitable variant is selected at runtime rather than at compile time. The decision is revised if the usage context changes, e.g., if a single-threaded context changes to a highly contended concurrent context. As a consequence, programmers can focus on the semantics of their systems and, e.g., conservatively use thread-safe components to ensure consistency of their data, while deferring implementation and optimization decisions to context-aware runtime optimizations. We demonstrate the effect on performance with self-adaptive concurrent queues, sets, and ordered sets. In all three cases, experimental evaluation shows close to optimal performance regardless of actual contention.

  • 2521.
    Österlund, Rikard
    Linnaeus University, Faculty of Technology, Department of Computer Science.
    Radering av känslig information i C: En studie av gcc på Linuxsystem2017Independent thesis Basic level (degree of Bachelor), 10 credits / 15 HE creditsStudent thesis
    Abstract [sv]

    Många datorprogram måste hantera potentiellt känslig information som exempelvis lösenord eller kryptonycklar. För sådana program kan det finnas ett behov av att radera denna information så att den blir otillgänglig så fort den inte längre behövs av programmet. Den här studien undersökte vilka möjligheter en mjukvaruutvecklare som använder programspråket C på Linuxsystem har för att kunna säkerställa att känslig information skrivs över av programmet. För att åstadkomma detta användes ett antal testprogram för att utvärdera eventuella negativa effekter av kompilatoroptimering. I de fall en överskrivning optimerats bort av kompilatorn utvärderades även åtgärder för att förhindra den aktuella optimeringsåtgärden vid omkompilering av programmet. En fallstudie av hur ett etablerat krypteringsbibliotek hanterar ovan nämnda problem genomfördes också. Slutsatsen av studien är att det i princip inte är möjligt att garantera att känslig information raderas om utvecklaren inte samtidigt har full kontroll över både operativsystem och övriga processer.

  • 2522.
    Östlund, Martin
    et al.
    Linnaeus University, Faculty of Science and Engineering, School of Computer Science, Physics and Mathematics.
    Axelsson, Clara
    Linnaeus University, Faculty of Health, Social Work and Behavioural Sciences, School of Health and Caring Sciences.
    Johansson, Pauline
    Linnaeus University, Faculty of Health, Social Work and Behavioural Sciences, School of Health and Caring Sciences.
    Johnsson, Stefan
    Lagerlund, Magnus
    Widell, Ingela
    Wilde Björling, Camilla
    Using computer tablets to empower breast cancer patients undergoing radiation therapy treatment2012Conference paper (Refereed)
    Abstract [en]

    BackgroundEfficient information dispersal and effective communication are key issues in increasing quality of care for patients undergoing radiation therapy. Radiation therapy consists of daily treatment sessions every weekday for 4-6 weeks. Although this means that patients are in daily contact with nursing staff, there is little time at these quick in-and-out sessions to address any substantive issues beyond the mechanics of the actual treatment procedure. Our aim is to explore the potential usefulness of computer tablets as an enabling device for making patient-staff information interchange more accessible and efficient. We are especially interested in investigating the empowerment effects that we believe will follow when making it easier for patients to influence the course of their treatment.

    MethodsFrom april to june 2012 all breast cancer patients scheduled for adjuvant radiation therapy treatment at the county hospital in Kalmar (Sweden) will be offered the opportunity to borrow a tablet computer during the course of their treatment. The tablet offers secure access to a web site containing illness-, treatment- and clinic-specific information, including a number of videos demonstrating the treatment procedure; a secure discussion forum in which patients can ask questions to staff; and a set of automatically processed surveys that provide staff with instant feedback from patients. Post-treatment interviews will be conducted with participating patients as well as with the staff on their respective experience of using the tablets. Patients will also fill out a survey and user logs from the web site will be analyzed to determine usage patterns.

    ResultsAt the time of writing we have started off the first couple of patients. Initial reactions are positive from both patients and staff. At the the time of the conference we will have evaluated the first set of patients and be able to present the results of this. We expect to see patients that are more confident and less anxious by being better prepared for their treatment both factually and emotionally. For the medical staff, we expect to see that the instant feedback provided by patients, via the questions they ask and the survey answers they submit, will allow staff to react more swiftly and more accurately to meet the patients’ needs and wants, and in so doing provide both better medical care and better emotional support.

    ConclusionsComputer tablets offer an efficient and accessible way for patients to inform themselves and to communicate with staff. The instant feedback from patients provides staff with the input they need to provide the best possible care, both medically and in providing emotional support. The sense of control, and actual control, over the course of their treatment that this will bring to patients, we believe will lead to a sense of empowerment that will help them better deal with the emotionally taxing experience it is to undergo treatment for a life-threatening condition.

48495051 2501 - 2522 of 2522
CiteExportLink to result list
Permanent link
Cite
Citation style
  • apa
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf