Ändra sökning
Avgränsa sökresultatet
1234567 51 - 100 av 3907
RefereraExporteraLänk till träfflistan
Permanent länk
Referera
Referensformat
  • apa
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Annat format
Fler format
Språk
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Annat språk
Fler språk
Utmatningsformat
  • html
  • text
  • asciidoc
  • rtf
Träffar per sida
  • 5
  • 10
  • 20
  • 50
  • 100
  • 250
Sortering
  • Standard (Relevans)
  • Författare A-Ö
  • Författare Ö-A
  • Titel A-Ö
  • Titel Ö-A
  • Publikationstyp A-Ö
  • Publikationstyp Ö-A
  • Äldst först
  • Nyast först
  • Skapad (Äldst först)
  • Skapad (Nyast först)
  • Senast uppdaterad (Äldst först)
  • Senast uppdaterad (Nyast först)
  • Disputationsdatum (tidigaste först)
  • Disputationsdatum (senaste först)
  • Standard (Relevans)
  • Författare A-Ö
  • Författare Ö-A
  • Titel A-Ö
  • Titel Ö-A
  • Publikationstyp A-Ö
  • Publikationstyp Ö-A
  • Äldst först
  • Nyast först
  • Skapad (Äldst först)
  • Skapad (Nyast först)
  • Senast uppdaterad (Äldst först)
  • Senast uppdaterad (Nyast först)
  • Disputationsdatum (tidigaste först)
  • Disputationsdatum (senaste först)
Markera
Maxantalet träffar du kan exportera från sökgränssnittet är 250. Vid större uttag använd dig av utsökningar.
  • 51.
    Afshar, Sara
    et al.
    Mälardalens högskola, Akademin för innovation, design och teknik, Inbyggda system.
    Moghaddami Khalilzad, Nima
    Mälardalens högskola, Akademin för innovation, design och teknik, Inbyggda system.
    Nemati, Farhang
    Mälardalens högskola, Akademin för innovation, design och teknik, Inbyggda system.
    Nolte, Thomas
    Mälardalens högskola, Akademin för innovation, design och teknik, Inbyggda system.
    Resource Sharing among Prioritized Real-Time Applications on Multiprocessors2015Ingår i: ACM SIGBED Review - Special Issue on the 6th International Workshop on Compositional Theory and Technology for Real-Time Embedded Systems Homepage archiveVolume 12 Issue 1, 2015, s. 46-55Konferensbidrag (Refereegranskat)
    Abstract [en]

    In this paper, we propose a new protocol for handling resource sharing among prioritized real-time applications composed on a multiprocessor platform. We propose an optimal priority assignment algorithm which assigns unique priorities to the applications based on information in their interfaces. We have performed experimental evaluations to compare the proposed protocol (called MSOS-Priority) to the current state of the art locking protocols under multiprocessor partitioned scheduling, i.e., MPCP, MSRP, FMLP, MSOS, and OMLP. The valuations show that MSOS-Priority mostly performs significantly better than alternative approaches.

  • 52.
    Afshar, Sara
    et al.
    Mälardalens högskola, Inbyggda system.
    Moghaddami Khalilzad, Nima
    Mälardalens högskola, Inbyggda system.
    Nemati, Farhang
    Mälardalens högskola, Inbyggda system.
    Nolte, Thomas
    Mälardalens högskola, Inbyggda system.
    Resource Sharing among Prioritized Real-Time Applications on Multiprocessors2015Ingår i: ACM SIGBED Review - Special Issue on the 6th International Workshop on Compositional Theory and Technology for Real-Time Embedded Systems Homepage archiveVolume 12 Issue 1, 2015, s. 46-55Konferensbidrag (Refereegranskat)
    Abstract [en]

    In this paper, we propose a new protocol for handling resource sharing among prioritized real-time applications composed on a multiprocessor platform. We propose an optimal priority assignment algorithm which assigns unique priorities to the applications based on information in their interfaces. We have performed experimental evaluations to compare the proposed protocol (called MSOS-Priority) to the current state of the art locking protocols under multiprocessor partitioned scheduling, i.e., MPCP, MSRP, FMLP, MSOS, and OMLP. The valuations show that MSOS-Priority mostly performs significantly better than alternative approaches.

  • 53.
    Afshar, Sara Zargari
    et al.
    Mälardalens högskola, Akademin för innovation, design och teknik, Inbyggda system.
    Behnam, Moris
    Mälardalens högskola, Akademin för innovation, design och teknik, Inbyggda system.
    J. Bril, Reinder
    Mälardalens högskola, Akademin för innovation, design och teknik, Inbyggda system. Technische Universiteit Eindhoven, Eindhoven, Netherlands.
    Nolte, Thomas
    Mälardalens högskola, Akademin för innovation, design och teknik, Inbyggda system.
    An optimal spin-lock priority assignment algorithm for real-time multi-core systems2017Ingår i: The 23th IEEE International Conference on Embedded and Real-Time Computing Systems and Applications RTCSA'17, 2017, artikel-id 8046310Konferensbidrag (Refereegranskat)
    Abstract [en]

    Support for exclusive access to shared (global) resources is instrumental in the context of embedded real-time multi-core systems, and mechanisms for achieving such access must be deterministic and efficient. There exist two traditional approaches for multiprocessors when a task requests a global resource that is locked by a task on a remote core: a spin-based approach, i.e. non-preemptive busy waiting for the resource to become available, and a suspension-based approach, i.e. the task relinquishes the processor. A suspension-based approach can be viewed as a spin-based approach where the lowest priority on a core is used during spinning, similar to a non-preemptive spin-based approach where the highest priority on a core is used. By taking such a view, we previously provided a general model for spinning, where any arbitrary priority can be used for spinning, i.e. from the lowest to the highest priority on a core. Targeting partitioned fixed-priority preemptive scheduled multiprocessors and spin-based approaches that use a fixed priority for spinning per core for all tasks, we aim at increasing the schedulability of multiprocessor systems by using the spin-lock priority per core as parameter. In this paper, we present (i) a generalization of the traditional worst-case response-time analysis for non-preemptive spin-based approaches addressing an arbitrary but fixed spin-lock priority per core, (ii) an optimal spin-lock priority assignment (OSPA) algorithm per core, i.e. an algorithm that will find a fixed spin-lock priority per core that will make the system schedulable, whenever such an assignment exists and, (iii) comparative evaluations of the OSPA algorithm with the spin-based and suspension-based approaches where OSPA showed up to 38% improvement compared to both approaches.

  • 54.
    Afshar, Sara Zargari
    et al.
    Mälardalens högskola, Akademin för innovation, design och teknik, Inbyggda system.
    Koroorian, Fereidon
    ABB, Västerås, Sweden.
    Ashjaei, Seyed Mohammad Hossein
    Mälardalens högskola, Akademin för innovation, design och teknik, Inbyggda system.
    Granlund, Anna
    Mälardalens högskola, Akademin för innovation, design och teknik, Innovation och produktrealisering.
    Investigating Alternatives for System Architectures to Enhance Discrete Manufacturing2019Ingår i: International Journal of Distributed Sensor Networks, ISSN 1550-1329, E-ISSN 1550-1477, Vol. 15, nr 8, artikel-id 1550147719868668Artikel i tidskrift (Refereegranskat)
    Abstract [en]

    This article investigates the possibility of advancing discrete manufacturing using system architectures that are developed for Collaborative Process Automation Systems. Collaborative Process Automation System is a technology that has the potential to achieve production excellence for process industry. However, not much attention has been paid on using the architectures based on Collaborative Process Automation Systems for discrete manufacturing domains. In this article, we propose a base architecture consisting of three layers, and we discuss various alternatives to make the communications among the layers. We consider legacy components in the proposal, in contrast to most of the related works. In order to show the practicality of the proposed alternatives, we present an example that has been implemented in an ongoing project at ABB Robotics in Sweden.

  • 55.
    Afsharmazayejani, R.
    et al.
    Shahid Bahonar University of Kerman, Kerman, Iran.
    Yazdanpanah, F.
    Vali-e-Asr University, Rafsanjan, Iran.
    Rezaei, A.
    Northwestern University, Evanston, United States.
    Alaei, M.
    Vali-e-Asr University, Rafsanjan, Iran.
    Daneshtalab, Masoud
    Mälardalens högskola, Akademin för innovation, design och teknik, Inbyggda system.
    HoneyWiN: Novel honeycomb-based wireless NoC architecture in many-core era2018Ingår i: Lecture Notes in Computer Science, ISSN 0302-9743, E-ISSN 1611-3349, Vol. 10824 LNCS, s. 304-316Artikel i tidskrift (Refereegranskat)
    Abstract [en]

    Although NoC-based systems with many cores are commercially available, their multi-hop nature has become a bottleneck on scaling performance and energy consumption parameters. Alternatively, hybrid wireless NoC provides a postern by exploiting single-hop express links for long-distance communications. Also, there is a common wisdom that grid-like mesh is the most stable topology in conventional designs. That is why almost all of the emerging architectures had been relying on this topology as well. In this paper, first we challenge the efficiency of the grid-like mesh in emerging systems. Then, we propose HoneyWiN, a hybrid reconfigurable wireless NoC architecture that relies on the honeycomb topology. The simulation results show that on average HoneyWiN saves 17% of energy consumption while increases the network throughput by 10% compared to its wireless mesh counterpart. 

  • 56.
    Afzal, Wasif
    et al.
    Mälardalens högskola, Akademin för innovation, design och teknik, Inbyggda system. Bahria University, Islamabad, Pakistan.
    Alone, Snehal
    Chalmers University of Technology, Sweden.
    Glocksien, Kerstin
    Chalmers University of Technology, Sweden.
    Torkar, Richard
    Chalmers University of Technology, Sweden.
    Software Test Process Improvement Approaches: A Systematic Literature Review and an Industrial Case Study2016Ingår i: Journal of Systems and Software JSS, ISSN 0164-1212, Vol. 111, s. 1-33Artikel i tidskrift (Refereegranskat)
    Abstract [en]

    Software test process improvement (STPI) approaches are frameworks that guide software development organizations to improve their software testing process. We have identified existing STPI approaches and their characteristics (such as completeness of development, availability of information and assessment instruments, and domain limitations of the approaches) using a systematic literature review (SLR). Furthermore, two selected approaches (TPI NEXT and TMMi) are evaluated with respect to their content and assessment results in industry. As a result of this study, we have identified 18 STPI approaches and their characteristics. A detailed comparison of the content of TPI NEXT and TMMi is done. We found that many of the STPI approaches do not provide sufficient information or the approaches do not include assessment instruments. This makes it difficult to apply many approaches in industry. Greater similarities were found between TPI NEXT and TMMi and fewer differences. We conclude that numerous STPI approaches are available but not all are generally applicable for industry. One major difference between available approaches is their model representation. Even though the applied approaches generally show strong similarities, differences in the assessment results arise due to their different model representations.

  • 57.
    Afzal, Wasif
    et al.
    Mälardalens högskola, Akademin för innovation, design och teknik, Inbyggda system.
    Bruneliere, Hugo
    AtlanMod Team, Inria, France.
    Di Ruscio, Davide
    Univ. of L'Aquila, L'Aquila, Italy.
    Sadovykh, Andrey
    Softeam, France.
    Mazzini, Silvia
    Intecs, Italy.
    Cariou, Eric
    Univ. de Pau et des Pays de l'Adour, Pau, France.
    Truscan, Dragos
    Åbo Akademi Univ., Turku, Finland.
    Cabot, Jordi
    Jordi Cabot ICREA, Barcelona, Spain.
    Field, Daniel
    ATOS, Madrid, Spain.
    Pomante, Luigi
    Univ. of L'Aquila, L'Aquila, Italy.
    Smrz, Pavel
    Brno Univ. of Technol., Brno, Czech Republic.
    The MegaM@Rt2 ECSEL Project: MegaModelling at Runtime — Scalable Model-Based Framework for Continuous Development and Runtime Validation of Complex Systems2017Ingår i: The 2017 Euromicro Conference on Digital System Design DSD'17, 2017Konferensbidrag (Refereegranskat)
    Abstract [en]

    A major challenge for the European electronic industry is to enhance productivity while reducing costs and ensuring quality in development, integration and maintenance. Model-Driven Engineering (MDE) principles and techniques have already shown promising capabilities but still need to scale to support real-world scenarios implied by the full deployment and use of complex electronic components and systems. Moreover, maintaining efficient traceability, integration and communication between two fundamental system life-time phases (design time and runtime) is another challenge facing scalability of MDE. This paper presents an overview of the ECSEL project entitled "MegaModelling at runtime -- Scalable model-based framework for continuous development and runtime validation of complex systems" (MegaM@Rt2), whose aim is to address the above mentioned challenges facing MDE. Driven by both large and small industrial enterprises, with the support of research partners and technology providers, MegaM@Rt2 aims to deliver a framework of tools and methods for: 1) system engineering/design & continuous development, 2) related runtime analysis and 3) global model & traceability management, respectively. The diverse industrial use cases (covering domains such as aeronautics, railway, construction and telecommunications) will integrate and apply such a framework that shall demonstrate the validation of the MegaM@Rt2 solution.

  • 58.
    Afzal, Wasif
    et al.
    Mälardalens högskola, Akademin för innovation, design och teknik, Inbyggda system. Bahria University, Islamabad, Pakistan .
    Torkar, Richard
    Blekinge Institute of Technology, Karlskrona, Sweden; Chalmers University of Technology, Sweden.
    Towards benchmarking feature subset selection methods for software fault prediction2016Ingår i: Computational Intelligence and Quantitative Software Engineering / [ed] Witold Pedrycz, Giancarlo Succi and Alberto Sillitti, Springer-Verlag , 2016, s. 33-58Kapitel i bok, del av antologi (Övrigt vetenskapligt)
    Abstract [en]

    Despite the general acceptance that software engineering datasets often contain noisy, irrele- vant or redundant variables, very few benchmark studies of feature subset selection (FSS) methods on real-life data from software projects have been conducted. This paper provides an empirical comparison of state-of-the-art FSS methods: information gain attribute ranking (IG); Relief (RLF); principal com- ponent analysis (PCA); correlation-based feature selection (CFS); consistency-based subset evaluation (CNS); wrapper subset evaluation (WRP); and an evolutionary computation method, genetic program- ming (GP), on five fault prediction datasets from the PROMISE data repository. For all the datasets, the area under the receiver operating characteristic curve—the AUC value averaged over 10-fold cross- validation runs—was calculated for each FSS method-dataset combination before and after FSS. Two diverse learning algorithms, C4.5 and na ??ve Bayes (NB) are used to test the attribute sets given by each FSS method. The results show that although there are no statistically significant differences between the AUC values for the different FSS methods for both C4.5 and NB, a smaller set of FSS methods (IG, RLF, GP) consistently select fewer attributes without degrading classification accuracy. We conclude that in general, FSS is beneficial as it helps improve classification accuracy of NB and C4.5. There is no single best FSS method for all datasets but IG, RLF and GP consistently select fewer attributes without degrading classification accuracy within statistically significant boundaries.

  • 59.
    Agelfors, Eva
    et al.
    KTH, Tidigare Institutioner, Talöverföring och musikakustik.
    Beskow, Jonas
    Dahlquist, M
    Granström, Björn
    Lundeberg, M
    Salvi, Giampiero
    Spens, K-E
    Öhman, Tobias
    Two methods for Visual Parameter Extraction in the Teleface Project1999Ingår i: Proceedings of Fonetik, Gothenburg, Sweden, 1999Konferensbidrag (Övrigt vetenskapligt)
  • 60.
    Aghanavesi, Somayeh
    Högskolan Dalarna, Akademin Industri och samhälle, Mikrodataanalys.
    Smartphone-based Parkinson’s disease symptom assessment2017Licentiatavhandling, sammanläggning (Övrigt vetenskapligt)
    Abstract [en]

    This thesis consists of four research papers presenting a microdata analysis approach to assess and evaluate the Parkinson’s disease (PD) motor symptoms using smartphone-based systems. PD is a progressive neurological disorder that is characterized by motor symptoms. It is a complex disease that requires continuous monitoring and multidimensional symptom analysis. Both patients’ perception regarding common symptom and their motor function need to be related to the repeated and time-stamped assessment; with this, the full extent of patient’s condition could be revealed. The smartphone enables and facilitates the remote, long-term and repeated assessment of PD symptoms. Two types of collected data from smartphone were used, one during a three year, and another during one-day clinical study. The data were collected from series of tests consisting of tapping and spiral motor tests. During the second time scale data collection, along smartphone-based measurements patients were video recorded while performing standardized motor tasks according to Unified Parkinson’s disease rating scales (UPDRS).

    At first, the objective of this thesis was to elaborate the state of the art, sensor systems, and measures that were used to detect, assess and quantify the four cardinal and dyskinetic motor symptoms. This was done through a review study. The review showed that smartphones as the new generation of sensing devices are preferred since they are considered as part of patients’ daily accessories, they are available and they include high-resolution activity data. Smartphones can capture important measures such as forces, acceleration and radial displacements that are useful for assessing PD motor symptoms.

    Through the obtained insights from the review study, the second objective of this thesis was to investigate whether a combination of tapping and spiral drawing tests could be useful to quantify dexterity in PD. More specifically, the aim was to develop data-driven methods to quantify and characterize dexterity in PD. The results from this study showed that tapping and spiral drawing tests that were collected by smartphone can detect movements reasonably well related to under- and over-medication.

    The thesis continued by developing an Approximate Entropy (ApEn)-based method, which aimed to measure the amount of temporal irregularity during spiral drawing tests. One of the disabilities associated with PD is the impaired ability to accurately time movements. The increase in timing variability among patients when compared to healthy subjects, suggests that the Basal Ganglia (BG) has a role in interval timing. ApEn method was used to measure temporal irregularity score (TIS) which could significantly differentiate the healthy subjects and patients at different stages of the disease. This method was compared to two other methods which were used to measure the overall drawing impairment and shakiness. TIS had better reliability and responsiveness compared to the other methods. However, in contrast to other methods, the mean scores of the ApEn-based method improved significantly during a 3-year clinical study, indicating a possible impact of pathological BG oscillations in temporal control during spiral drawing tasks. In addition, due to the data collection scheme, the study was limited to have no gold standard for validating the TIS. However, the study continued to further investigate the findings using another screen resolution, new dataset, new patient groups, and for shorter term measurements. The new dataset included the clinical assessments of patients while they performed tests according to UPDRS. The results of this study confirmed the findings in the previous study. Further investigation when assessing the correlation of TIS to clinical ratings showed the amount of temporal irregularity present in the spiral drawing cannot be detected during clinical assessment since TIS is an upper limb high frequency-based measure. 

  • 61.
    Aghanavesi, Somayeh
    et al.
    Högskolan Dalarna, Akademin Industri och samhälle, Datateknik.
    Westin, Jerker
    Högskolan Dalarna, Akademin Industri och samhälle, Datateknik.
    A review of Parkinson’s disease cardinal and dyskinetic motor symptoms assessment methods using sensor systems2016Konferensbidrag (Refereegranskat)
    Abstract [en]

    This paper is reviewing objective assessments of Parkinson’s disease(PD) motor symptoms, cardinal, and dyskinesia, using sensor systems. It surveys the manifestation of PD symptoms, sensors that were used for their detection, types of signals (measures) as well as their signal processing (data analysis) methods. A summary of this review’s finding is represented in a table including devices (sensors), measures and methods that were used in each reviewed motor symptom assessment study. In the gathered studies among sensors, accelerometers and touch screen devices are the most widely used to detect PD symptoms and among symptoms, bradykinesia and tremor were found to be mostly evaluated. In general, machine learning methods are potentially promising for this. PD is a complex disease that requires continuous monitoring and multidimensional symptom analysis. Combining existing technologies to develop new sensor platforms may assist in assessing the overall symptom profile more accurately to develop useful tools towards supporting better treatment process.

  • 62.
    Aghighi, Meysam
    Linköpings universitet, Institutionen för datavetenskap, Programvara och system. Linköpings universitet, Tekniska fakulteten.
    Computational Complexity of some Optimization Problems in Planning2017Doktorsavhandling, sammanläggning (Övrigt vetenskapligt)
    Abstract [en]

    Automated planning is known to be computationally hard in the general case. Propositional planning is PSPACE-complete and first-order planning is undecidable. One method for analyzing the computational complexity of planning is to study restricted subsets of planning instances, with the aim of differentiating instances with varying complexity. We use this methodology for studying the computational complexity of planning. Finding new tractable (i.e. polynomial-time solvable) problems has been a particularly important goal for researchers in the area. The reason behind this is not only to differentiate between easy and hard planning instances, but also to use polynomial-time solvable instances in order to construct better heuristic functions and improve planners. We identify a new class of tractable cost-optimal planning instances by restricting the causal graph. We study the computational complexity of oversubscription planning (such as the net-benefit problem) under various restrictions and reveal strong connections with classical planning. Inspired by this, we present a method for compiling oversubscription planning problems into the ordinary plan existence problem. We further study the parameterized complexity of cost-optimal and net-benefit planning under the same restrictions and show that the choice of numeric domain for the action costs has a great impact on the parameterized complexity. We finally consider the parameterized complexity of certain problems related to partial-order planning. In some applications, less restricted plans than total-order plans are needed. Therefore, a partial-order plan is being used instead. When dealing with partial-order plans, one important question is how to achieve optimal partial order plans, i.e. having the highest degree of freedom according to some notion of flexibility. We study several optimization problems for partial-order plans, such as finding a minimum deordering or reordering, and finding the minimum parallel execution length.

  • 63.
    Aghighi, Meysam
    et al.
    Linköpings universitet, Institutionen för datavetenskap, Programvara och system. Linköpings universitet, Tekniska fakulteten.
    Bäckström, Christer
    Linköpings universitet, Institutionen för datavetenskap, Programvara och system. Linköpings universitet, Tekniska fakulteten.
    A Multi-parameter Complexity Analysis of Cost-optimal and Net-benefit Planning2016Ingår i: Twenty-Sixth International Conference on Automated Planning and Scheduling King's College, London June 12, 2016 – June 17, 2016 / [ed] Amanda Coles, Andrew Coles, Stefan Edelkamp, Daniele Magazzeni, Scott Sanner, AAAI Press, 2016, s. 2-10Konferensbidrag (Refereegranskat)
    Abstract [en]

    Aghighi and Bäckström have previously studied cost-optimal planning (COP) and net-benefit planning (NBP) for three action cost domains: the positive integers (Z_+), the non-negative integers (Z_0) and the positive rationals (Q_+). These were indistinguishable under standard complexity analysis for both problems, but separated for COP using parameterised complexity analysis. With the plan cost, k, as parameter, COP was W[2]-complete for Z_+, but para-NP-hard for both Z_0 and Q_+, i.e. presumably much harder. NBP was para-NP-hard for all three domains, thus remaining unseparable. We continue by considering combinations with several additional parameters and also the non-negative rationals (Q_0). Examples of new parameters are the plan length, l, and the largest denominator of the action costs, d. Our findings include: (1) COP remains W[2]-hard for all domains, even if combining all parameters; (2) COP for Z_0 is in W[2] for the combined parameter {k,l}; (3) COP for Q_+ is in W[2] for {k,d} and (4) COP for Q_0 is in W[2] for {k,d,l}. For NBP we consider further additional parameters, where the most crucial one for reducing complexity is the sum of variable utilities. Our results help to understand the previous results, eg. the separation between Z_+ and Q_+ for COP, and to refine the previous connections with empirical findings.

  • 64.
    Aghighi, Meysam
    et al.
    Linköpings universitet, Institutionen för datavetenskap, Programvara och system. Linköpings universitet, Tekniska fakulteten.
    Bäckström, Christer
    Linköpings universitet, Institutionen för datavetenskap, Programvara och system. Linköpings universitet, Tekniska fakulteten.
    Plan Reordering and Parallel Execution -- A Parameterized Complexity View2017Konferensbidrag (Refereegranskat)
    Abstract [en]

    Bäckström has previously studied a number of optimization problems for partial-order plans, like finding a minimum deordering (MCD) or reordering (MCR), and finding the minimum parallel execution length (PPL), which are all NP-complete. We revisit these problems, but applying parameterized complexity analysis rather than standard complexity analysis. We consider various parameters, including both the original and desired size of the plan order, as well as its width and height. Our findings include that MCD and MCR are W[2]-hard and in W[P] when parameterized with the desired order size, and MCD is fixed-parameter tractable (fpt) when parameterized with the original order size. Problem PPL is fpt if parameterized with the size of the non-concurrency relation, but para-NP-hard in most other cases. We also consider this problem when the number (k) of agents, or processors, is restricted, finding that this number is a crucial parameter; this problem is fixed-parameter tractable with the order size, the parallel execution length and k as parameter, but para-NP-hard without k as parameter.

  • 65.
    Aghighi, Meysam
    et al.
    Linköpings universitet, Institutionen för datavetenskap, Programvara och system. Linköpings universitet, Tekniska högskolan.
    Jonsson, Peter
    Linköpings universitet, Institutionen för datavetenskap, Programvara och system. Linköpings universitet, Tekniska högskolan.
    Ståhlberg, Simon
    Linköpings universitet, Institutionen för datavetenskap, Programvara och system. Linköpings universitet, Tekniska högskolan.
    Tractable Cost-Optimal Planning over Restricted Polytree Causal Graphs2015Ingår i: Proceedings of the Twenty-Ninth AAAI Conference on Artificial Intelligence, AAAI Press, 2015Konferensbidrag (Refereegranskat)
    Abstract [en]

    Causal graphs are widely used to analyze the complexity of planning problems. Many tractable classes have been identified with their aid and state-of-the-art heuristics have been derived by exploiting such classes. In particular, Katz and Keyder have studied causal graphs that are hourglasses (which is a generalization of forks and inverted-forks) and shown that the corresponding cost-optimal planning problem is tractable under certain restrictions. We continue this work by studying polytrees (which is a generalization of hourglasses) under similar restrictions. We prove tractability of cost-optimal planning by providing an algorithm based on a novel notion of variable isomorphism. Our algorithm also sheds light on the k-consistency procedure for identifying unsolvable planning instances. We speculate that this may, at least partially, explain why merge-and-shrink heuristics have been successful for recognizing unsolvable instances.

  • 66.
    Aglianò, Simone
    et al.
    University of Catania, Catania, Italy.
    Ashjaei, Seyed Mohammad Hossein
    Mälardalens högskola, Akademin för innovation, design och teknik, Inbyggda system.
    Behnam, Moris
    Mälardalens högskola, Akademin för innovation, design och teknik, Inbyggda system.
    Lo Bello, Lucia
    University of Catania, Catania, Italy.
    Resource Management and Control in Virtualized SDN Networks2018Ingår i: CSI International Symposium on Real-Time and Embedded Systems and Technologies REST'18, 2018, s. 47-53Konferensbidrag (Refereegranskat)
    Abstract [en]

    Software defined networking and network virtual-ization are widely considered promising techniques for reducing the complexity of network management in many contexts that require high Quality of Service (QoS) and the support for heterogeneous architectures. In this paper we address a network architecture, here called a virtualized SDN network, that combines the benefits of SDN and virtualization. To cope with the demand for efficiently sharing a platform among several services, here a resource management mechanism to reserve and control network resources among various services in the virtualized SDN networks is proposed. The mechanism is implemented on an SDN controller and a set of experiments show the effectiveness of the proposed approach.

  • 67.
    Aguilar, Xavier
    KTH, Skolan för datavetenskap och kommunikation (CSC), High Performance Computing and Visualization (HPCViz).
    Towards Scalable Performance Analysis of MPI Parallel Applications2015Licentiatavhandling, sammanläggning (Övrigt vetenskapligt)
    Abstract [en]

      A considerably fraction of science discovery is nowadays relying on computer simulations. High Performance Computing  (HPC) provides scientists with the means to simulate processes ranging from climate modeling to protein folding. However, achieving good application performance and making an optimal use of HPC resources is a heroic task due to the complexity of parallel software. Therefore, performance tools  and runtime systems that help users to execute  applications in the most optimal way are of utmost importance in the landscape of HPC.  In this thesis, we explore different techniques to tackle the challenges of collecting, storing, and using  fine-grained performance data. First, we investigate the automatic use of real-time performance data in order to run applications in an optimal way. To that end, we present a prototype of an adaptive task-based runtime system that uses real-time performance data for task scheduling. This runtime system has a performance monitoring component that provides real-time access to the performance behavior of anapplication while it runs. The implementation of this monitoring component is presented and evaluated within this thesis. Secondly, we explore lossless compression approaches  for MPI monitoring. One of the main problems that  performance tools face is the huge amount of fine-grained data that can be generated from an instrumented application. Collecting fine-grained data from a program is the best method to uncover the root causes of performance bottlenecks, however, it is unfeasible with extremely parallel applications  or applications with long execution times. On the other hand, collecting coarse-grained data is scalable but  sometimes not enough to discern the root cause of a performance problem. Thus, we propose a new method for performance monitoring of MPI programs using event flow graphs. Event flow graphs  provide very low overhead in terms of execution time and  storage size, and can be used to reconstruct fine-grained trace files of application events ordered in time.

  • 68.
    Aguilar, Xavier
    et al.
    KTH, Skolan för datavetenskap och kommunikation (CSC), High Performance Computing and Visualization (HPCViz).
    Fürlinger, Karl
    Ludwig-Maximilians-Universitat (LMU).
    Laure, Erwin
    KTH, Skolan för datavetenskap och kommunikation (CSC), High Performance Computing and Visualization (HPCViz).
    MPI Trace Compression Using Event Flow Graphs2014Konferensbidrag (Refereegranskat)
    Abstract [en]

    Understanding how parallel applications behave is crucial for using high-performance computing (HPC) resources efficiently. However, the task of performance analysis is becoming increasingly difficult due to the growing complexity of scientific codes and the size of machines. Even though many tools have been developed over the past years to help in this task, current approaches either only offer an overview of the application discarding temporal information, or they generate huge trace files that are often difficult to handle.

    In this paper we propose the use of event flow graphs for monitoring MPI applications, a new and different approach that balances the low overhead of profiling tools with the abundance of information available from tracers. Event flow graphs are captured with very low overhead, require orders of magnitude less storage than standard trace files, and can still recover the full sequence of events in the application. We test this new approach with the NERSC-8/Trinity Benchmark suite and achieve compression ratios up to 119x.

  • 69.
    Aguilar, Xavier
    et al.
    KTH, Skolan för datavetenskap och kommunikation (CSC), High Performance Computing and Visualization (HPCViz).
    Fürlinger, Karl
    Laure, Erwin
    KTH, Skolan för datavetenskap och kommunikation (CSC), High Performance Computing and Visualization (HPCViz).
    Visual MPI Performance Analysis using Event Flow Graphs2015Ingår i: Procedia Computer Science, ISSN 1877-0509, E-ISSN 1877-0509, Vol. 51, s. 1353-1362Artikel i tidskrift (Refereegranskat)
    Abstract [en]

    Event flow graphs used in the context of performance monitoring combine the scalability and low overhead of profiling methods with lossless information recording of tracing tools. In other words, they capture statistics on the performance behavior of parallel applications while pre- serving the temporal ordering of events. Event flow graphs require significantly less storage than regular event traces and can still be used to recover the full ordered sequence of events performed by the application.  In this paper we explore the usage of event flow graphs in the context of visual performance analysis. We show that graphs can be used to quickly spot performance problems, helping to better understand the behavior of an application. We demonstrate our performance analysis approach with MiniFE, a mini-application that mimics the key performance aspects of finite- element applications in High Performance Computing (HPC).

  • 70.
    Aguilar, Xavier
    et al.
    KTH, Skolan för datavetenskap och kommunikation (CSC), High Performance Computing and Visualization (HPCViz).
    Laure, Erwin
    KTH, Skolan för datavetenskap och kommunikation (CSC), High Performance Computing and Visualization (HPCViz).
    Fürlinger, Karl
    Ludwig-Maximilians-Universität München.
    Online Performance Data Introspection with IPM2014Ingår i: Proceedings of the 15th IEEE International Conference on High Performance Computing and Communications (HPCC 2013), IEEE Computer Society, 2014, s. 728-734Konferensbidrag (Refereegranskat)
    Abstract [en]

    Exascale systems will be heterogeneous architectures with multiple levels of concurrency and energy constraints. In such a complex scenario, performance monitoring and runtime systems play a major role to obtain good application performance and scalability. Furthermore, online access to performance data becomes a necessity to decide how to schedule resources and orchestrate computational elements: processes, threads, tasks, etc. We present the Performance Introspection API, an extension of the IPM tool that provides online runtime access to performance data from an application while it runs. We describe its design and implementation and show its overhead on several test benchmarks. We also present a real test case using the Performance Introspection API in conjunction with processor frequency scaling to reduce power consumption.

  • 71.
    Aguilar, Xavier
    et al.
    KTH, Skolan för datavetenskap och kommunikation (CSC), High Performance Computing and Visualization (HPCViz). KTH, Centra, SeRC - Swedish e-Science Research Centre.
    Schliephake, Michael
    KTH, Skolan för datavetenskap och kommunikation (CSC), High Performance Computing and Visualization (HPCViz). KTH, Skolan för datavetenskap och kommunikation (CSC), Centra, Parallelldatorcentrum, PDC. KTH, Centra, SeRC - Swedish e-Science Research Centre.
    Vahtras, Olav
    KTH, Skolan för bioteknologi (BIO), Teoretisk kemi och biologi. KTH, Skolan för datavetenskap och kommunikation (CSC), Centra, Parallelldatorcentrum, PDC. KTH, Centra, SeRC - Swedish e-Science Research Centre.
    Gimenez, Judit
    Laure, Erwin
    KTH, Skolan för datavetenskap och kommunikation (CSC), High Performance Computing and Visualization (HPCViz). KTH, Skolan för datavetenskap och kommunikation (CSC), Centra, Parallelldatorcentrum, PDC. KTH, Centra, SeRC - Swedish e-Science Research Centre.
    Scalability analysis of Dalton, a molecular structure program2013Ingår i: Future generations computer systems, ISSN 0167-739X, E-ISSN 1872-7115, Vol. 29, nr 8, s. 2197-2204Artikel i tidskrift (Refereegranskat)
    Abstract [en]

    Dalton is a molecular electronic structure program featuring common methods of computational chemistry that are based on pure quantum mechanics (QM) as well as hybrid quantum mechanics/molecular mechanics (QM/MM). It is specialized and has a leading position in calculation of molecular properties with a large world-wide user community (over 2000 licenses issued). In this paper, we present a performance characterization and optimization of Dalton. We also propose a solution to avoid the master/worker design of Dalton to become a performance bottleneck for larger process numbers. With these improvements we obtain speedups of 4x, increasing the parallel efficiency of the code and being able to run in it in a much bigger number of cores.

  • 72.
    Ahlgren, Simon
    et al.
    Linköpings universitet, Institutionen för datavetenskap, Programvara och system.
    Aini, Daniel
    Linköpings universitet, Institutionen för datavetenskap, Programvara och system.
    Conversion and Analysis of Telemetric Data from the CCSDS Standard2017Självständigt arbete på grundnivå (högskoleexamen), 10,5 poäng / 16 hpStudentuppsats (Examensarbete)
    Abstract [en]

    When communicating with spacecrafts, the international standard is to use the protocols defined by CCSDS. In this study, the Space Packet Protocol from CCSDS is converted to the Digital Recording Standard used in aviation. The goal of the study is to find out in what way such a conversion can be made, as well as analyzing the efficiency of different packing methods for the Digital Recording Standard. An application is developed in order to perform the conversion, and the performance of said application is profiled using different packet sizes. In the end the results are evaluated and an optimal packet size is found in terms of runtime and memory usage. In the end we conclude that a packet size of 216 bytes is best when prioritizing speed, and a packet size of 219 bytes is best when prioritizing memory.

  • 73.
    Ahlén, Richard
    et al.
    Mälardalens högskola, Akademin för innovation, design och teknik.
    Grönholm, Robin
    Mälardalens högskola, Akademin för innovation, design och teknik.
    En analys av ljudlatens i Windows 10 på tillgängliga enheter2016Självständigt arbete på grundnivå (kandidatexamen), 10 poäng / 15 hpStudentuppsats (Examensarbete)
    Abstract [sv]

    Den här rapporten beskriver ett projekt utfört av två studenter på Mälardalens högskola i kursen DVA331. Syftet med projektet var att undersöka om det gick att få ned ljudlatensen på enheter med Windows 10 till den nivå som är möjlig på iOS. Anledningen till denna undersökning var för att Windows 10 har kommit med en API som stödjer låglatens-ljud. Undersökningen utfördes på en iPhone 4S, iPhone 6, Nokia Lumia 720 och Nokia Lumia 920 med hjälp av en kontaktmikrofon som sattes på telefonen. 50 mätningar gjordes per version av en testapplikation implementerad för de båda operativsystemen. Med mikrofonen och ljudhanteringsprogrammet Audacity kunde tiden mätas mellan det att pekytan berörs och det att ljudet spelas upp. Mätningarna visade att iOS fortfarande var betydligt snabbare än Windows 10 och att Windows 10 är långt över den gräns som är acceptabel vid användande av responsiv ljudhantering. Efterforskning visade att mätningarnas resultat berodde på att Lumia-enheterna hade en lång inmatningslatens. Användartester gjordes på 10 försökspersoner där återkopplingen visade att latensen på Windows 10-enheterna var mycket längre än iOS. Slutsatsen var att Lumia-enheterna i fråga inte är lämpliga för responsiva ljudapplikationer men att Windows 10-enheter med lägre inmatningslatens som är bättre lämpade och att nya mätningar bör göras för att bedöma om detta är fallet.

  • 74. Ahmad, Riaz
    et al.
    Afzal, Muhammad Zeshan
    Rashid, Sheikh Faisal
    Liwicki, Marcus
    Breuel, Thomas
    Scale and Rotation Invariant OCR for Pashto Cursive Script using MDLSTM Network2015Ingår i: 13th International Conference on Document Analysis and Recognition, IEEE , 2015, s. 1101-1105Konferensbidrag (Refereegranskat)
    Abstract [en]

    Optical Character Recognition (OCR) of cursive scripts like Pashto and Urdu is difficult due the presence of complex ligatures and connected writing styles. In this paper, we evaluate and compare different approaches for the recognition of such complex ligatures. The approaches include Hidden Markov Model (HMM), Long Short Term Memory (LSTM) network and Scale Invariant Feature Transform (SIFT). Current state of the art in cursive script assumes constant scale without any rotation, while real world data contain rotation and scale variations. This research aims to evaluate the performance of sequence classifiers like HMM and LSTM and compare their performance with descriptor based classifier like SIFT. In addition, we also assess the performance of these methods against the scale and rotation variations in cursive script ligatures. Moreover, we introduce a database of 480,000 images containing 1000 unique ligatures or sub-words of Pashto. In this database, each ligature has 40 scale and 12 rotation variations. The evaluation results show a significantly improved performance of LSTM over HMM and traditional feature extraction technique such as SIFT. Keywords.

  • 75. Ahmad, Riaz
    et al.
    Afzal, Muhammad Zeshan
    Rashid, Sheikh Faisal
    Liwicki, Marcus
    Dengel, Andreas
    Breuel, Thomas
    Recognizable Units in Pashto Language for OCR2015Ingår i: 13th International Conference on Document Analysis and Recognition, IEEE , 2015, s. 1246-1250Konferensbidrag (Refereegranskat)
    Abstract [en]

    Atomic segmentation of cursive scripts into con- stituent characters is one of the most challenging problems in pattern recognition. To avoid segmentation in cursive script, concrete shapes are considered as recognizable units. Therefore, the objective of this work is to find out the alternate recognizable units in Pashto cursive script. These alternatives are ligatures and primary ligatures. However, we need sound statistical analysis to find the appropriate numbers of ligatures and primary ligatures in Pashto script. In this work, a corpus of 2, 313, 736 Pashto words are extracted from a large scale diversified web sources, and total of 19, 268 unique ligatures have been identified in Pashto cursive script. Analysis shows that only 7000 ligatures represent 91% portion of overall corpus of the Pashto unique words. Similarly, about 7, 681 primary ligatures are also identified which represent the basic shapes of all the ligatures.

  • 76.
    Ahmadi, Lina
    Högskolan i Halmstad, Akademin för informationsteknologi.
    Green Driving Application: Eco Driving2016Självständigt arbete på grundnivå (högskoleexamen), 10 poäng / 15 hpStudentuppsats (Examensarbete)
    Abstract [en]

    Eco-driving has acquired great importance in recent years because it is a way to reduce energy consumption that can be applied to any type of vehicle. However, for these rules to be applied requires a process of continuous learning and motivation. For this reason many eco-driving assistants have emerged.

    This paper presents Green Driving, a driver safety app for Android that detects inattentive driving behaviors and gives corresponding feedback to drivers, scoring their driving and alerting them in case their behaviors are unsafe.  It’s about changing a person’s driving behavior by providing some kind of advice to the driver.  I have worked on an algorithm that is meant to reduce the fuel consumption of users. The algorithm is deployed in an android application.

    This application “Green Driving” is aimed at users with cars. It is basically like an assistant, suggesting the user when he should make the right gear changes, when to increase/decrease speed and avoids hard braking and rapid acceleration and etc. It is in order to drive economically, ecologic and in turn save money and safety. This is a smart way of letting a user drive economically and ecologic since almost everyone has an Android smartphone now. 

  • 77.
    Ahmed, Bestoun
    et al.
    Istituto Dalle Molle di Studi sullIntelligenza Artificiale (IDSIA), Switzerland.
    Gambardella, Luca
    Istituto Dalle Molle di Studi sullIntelligenza Artificiale (IDSIA), Switzerland.
    Afzal, Wasif
    Mälardalens högskola, Akademin för innovation, design och teknik, Inbyggda system.
    Zamli, Kamal
    University Malaysia Pahang, Gambang, Malaysia.
    Handling Constraints in Combinatorial Interaction Testing in the Presence of Multi Objective Particle Swarm and Multithreading2017Ingår i: Information and Software Technology, ISSN 0950-5849, E-ISSN 1873-6025, Vol. 86, nr 01, s. 20-36Artikel i tidskrift (Refereegranskat)
    Abstract [en]

    Combinatorial strategies have received a lot of attention lately as a result of their diverse applications in areas of research, particularly in software engineering. In its simple form, a combinatorial strategy can reduce several input parameters (configurations) of a system into a small set of these parameters based on their interaction (combination). However, in practice, the input configurations of software systems are subjected to constraints, especially highly configurable systems. To implement this feature within a strategy, many difficulties arise for construction. While there are many combinatorial interaction testing strategies nowadays, few of them support constraints. This paper presents a new strategy, called Octopus to construct a combinatorial interaction test suites with the presence of constraints. The design and algorithms are provided in the paper in detail. The strategy is inspired by the behaviour of octopus to search for the optimal solution using multi-threading mechanism. To overcome the multi judgement criteria for an optimal solution, the multi-objective particle swarm optimisation is used. The strategy and its algorithms are evaluated extensively using different benchmarks and comparisons. The evaluation results showed the efficiency of each algorithm in the strategy. The benchmarking results also showed that Octopus can generate test suites efficiently as compared to state-of-the-art strategies.

  • 78.
    Ahmed, Bestoun
    et al.
    Czech Technical University, Czech Republic.
    Zamli, Kamal
    University Malaysia Pahang, Gambang, Malaysia..
    Afzal, Wasif
    Mälardalens högskola, Akademin för innovation, design och teknik, Inbyggda system.
    Bures, Miroslav
    Czech Technical University, Czech Republic.
    Constrained Interaction Testing: A Systematic Literature Study2017Ingår i: IEEE Access, E-ISSN 2169-3536, IEEE Access, ISSN 2169-3536, Vol. PP, nr 99Artikel, recension (Övrigt vetenskapligt)
    Abstract [en]

    Interaction testing can be used to effectively detect faults that are otherwise difficult to find by other testing techniques. However, in practice, the input configurations of software systems are subjected to constraints, especially in the case of highly configurable systems. Handling constraints effectively and efficiently in combinatorial interaction testing is a challenging problem. Nevertheless, researchers have attacked this challenge through different techniques, and much progress has been achieved in the past decade. Thus, it is useful to reflect on the current achievements and shortcomings and to identify potential areas of improvements. This paper presents the first comprehensive and systematic literature study to structure and categorize the research contributions for constrained interaction testing. Following the guidelines of conducting a literature study, the relevant data is extracted from a set of 103 research papers belonging to constrained interaction testing. The topics addressed in constrained interaction testing research are classified into four categories of constraint test generation, application, generation & application and model validation studies. The papers within each of these categories are extensively reviewed. Apart from answering several other research questions, this study also discusses the applications of constrained interaction testing in several domains such as software product lines, fault detection & characterization, test selection, security and GUI testing. The study ends with a discussion of limitations, challenges and future work in the area.

  • 79. Ahmed, J.
    et al.
    Johnsson, A.
    Yanggratoke, Rerngvit
    KTH, Skolan för elektro- och systemteknik (EES), Centra, ACCESS Linnaeus Centre. KTH, Skolan för elektro- och systemteknik (EES), Kommunikationsnät.
    Ardelius, J.
    Flinta, C.
    Stadler, Rolf
    KTH, Skolan för elektro- och systemteknik (EES), Kommunikationsnät. KTH, Skolan för elektro- och systemteknik (EES), Centra, ACCESS Linnaeus Centre.
    Predicting SLA conformance for cluster-based services using distributed analytics2016Ingår i: Proceedings of the NOMS 2016 - 2016 IEEE/IFIP Network Operations and Management Symposium, IEEE conference proceedings, 2016, s. 848-852Konferensbidrag (Refereegranskat)
    Abstract [en]

    Service assurance for the telecom cloud is a challenging task and is continuously being addressed by academics and industry. One promising approach is to utilize machine learning to predict service quality in order to take early mitigation actions. In previous work we have shown how to predict service-level metrics, such as frame rate for a video application on the client side, from operational data gathered at the server side. This gives the service provider early indications on whether the platform can support the current load demand. This paper extends previous work by addressing scalability issues for cluster-based services. Operational data being generated in large volumes, from several sources, and at high velocity puts strain on computational and communication resources. We propose and evaluate a distributed machine learning system based on the Winnow algorithm to tackle scalability issues, and then compare the new distributed solution with the previously proposed centralized solution. We show that network overhead and computational execution time is substantially reduced while maintaining high prediction accuracy making it possible to achieve real-time service quality predictions in large systems.

  • 80.
    Ahmed, Mobyen Uddin
    Mälardalens högskola, Akademin för innovation, design och teknik, Inbyggda system.
    An Intelligent Healthcare Service to Monitor Vital Signs in Daily Life – A Case Study on Health-IoT2017Ingår i: International Journal of Engineering Research and Applications, ISSN 2248-9622, E-ISSN 2248-9622, Vol. 7, nr 3, s. 43-55Artikel i tidskrift (Refereegranskat)
    Abstract [en]

    Vital signs monitoring for elderly in daily life environment is a promising concept that efficiently can provide medical services to people at home. However, make the system self-served and functioning as personalized provision makes the challenge even larger. This paper presents a case study on a Health-IoT system where an intelligent healthcare service is developed to monitor vital signs in daily life. Here, a generic Health-IoT framework with a Clinical Decision Support System (CDSS) is presented. The generic framework is mainly focused on the supporting sensors, communication media, secure and safe data communication, cloud-based storage, and remote accesses of the data. The CDSS is used to provide a personalized report on persons’ health condition based on daily basis observation on vital signs. Six participants, from Spain (n=3) and Slovenia (n=3) have been using the proposed healthcare system for eight weeks (e.g. 300+ health measurements) in their home environments to monitor their health. The sensitivity, specificity and overall accuracy of the DSS’s classification are achieved as 90%, 97% and 96% respectively while k=2 i.e., top 2 most similar retrieved cases are considered. The initial user evaluation result demonstrates the feasibility and performance of the implemented system through the proposed framework.

  • 81.
    Ahmed, Mobyen Uddin
    et al.
    Örebro universitet, Institutionen för naturvetenskap och teknik.
    Banaee, Hadi
    Örebro universitet, Institutionen för naturvetenskap och teknik.
    Loutfi, Amy
    Örebro universitet, Institutionen för naturvetenskap och teknik.
    Health monitoring for elderly: an application using case-based reasoning and cluster analysis2013Ingår i: ISRN Artificial Intelligence, ISSN 2090-7435, E-ISSN 2090-7443, Vol. 2013, nr 2013, s. 1-11Artikel i tidskrift (Refereegranskat)
    Abstract [en]

    This paper presents a framework to process and analyze data from a pulse oximeter which measures pulse rate and blood oxygen saturation from a set of individuals remotely. Using case-based reasoning (CBR) as the backbone to the framework, records are analyzed and categorized according to how well they are similar. Record collection has been performed using a personalized health profiling approach where participants wore a pulse oximeter sensor for a fixed period of time and performed specific activities for pre-determined intervals. Using a variety of feature extraction in time, frequency and time-frequency domains, and data processing techniques, the data is fed into a CBR system which retrieves most similar cases and generates alarm and flag according to the case outcomes. The system has been compared with an expert's classification and 90% match is achieved between the expert's and CBR classification. Again, considering the clustered measurements the CBR approach classifies 93% correctly both for the pulse rate and oxygen saturation. Along with the proposed methodology, this paper provides a basis for which the system can be used in analysis of continuous health monitoring and be used as a suitable method as in home/remote monitoring systems.

  • 82.
    Ahmed, Mobyen Uddin
    et al.
    Mälardalens högskola, Akademin för innovation, design och teknik, Inbyggda system.
    Begum, Shahina
    Mälardalens högskola, Akademin för innovation, design och teknik, Inbyggda system.
    Catalina, Carlos Alberto
    ITCL Polígono Industrial Villalonquéjar c/López Bravo, 70. 09001 BURGOS, Spain.
    Limonad, Lior
    Smart Wearable and IoT Solutions, IBM Research, Haifa, Israil.
    Hök, Bertil
    Hök Instrument AB, Sweden.
    Flumeri, Gianluca Di
    Cognitive States in Operative Environment, BrainSigns, Italy.
    Cloud-based Data Analytics on Human Factor Measurement to Improve Safer Transport2018Ingår i: Lecture Notes of the Institute for Computer Sciences, Social-Informatics and Telecommunications Engineering, LNICST, Volume 225, 2018, s. 101-106Konferensbidrag (Refereegranskat)
    Abstract [en]

    Improving safer transport includes individual and collective behavioural aspects and their interaction. A system that can monitor and evaluate the human cognitive and physical capacities based on human factor measurement is often beneficial to improve safety in driving condition. However, analysis and evaluation of human factor measurement i.e. Demographics, Behavioural and Physiological in real-time is challenging. This paper presents a methodology for cloud-based data analysis, categorization and metrics correlation in real-time through a H2020 project called SimuSafe. Initial implementation of this methodology shows a step-by-step approach which can handle huge amount of data with variation and verity in the cloud.

  • 83.
    Ahmed, Mobyen Uddin
    et al.
    Mälardalens högskola, Akademin för innovation, design och teknik.
    Begum, Shahina
    Mälardalens högskola, Akademin för innovation, design och teknik.
    Funk, Peter
    Mälardalens högskola, Akademin för innovation, design och teknik.
    Xiong, Ning
    Mälardalens högskola, Akademin för innovation, design och teknik.
    von Schéele, Bo
    Mälardalens högskola, Akademin för innovation, design och teknik.
    A Three Phase Computer Assisted Biofeedback Training System Using Case-Based Reasoning2008Ingår i: Proc. 9th European Conference on Case-based Reasoning, 2008, s. 57-68Konferensbidrag (Refereegranskat)
    Abstract [en]

    Biofeedback is a method gaining increased interest and showing good results for a number of physical and psychological problems. Biofeedback training is mostly guided by an experienced clinician and the results largely rely on the clinician's competence. In this paper we propose a three phase computer assisted sensor-based biofeedback decision support system assisting less experienced clinicians, acting as second opinion for experienced clinicians. The three phase CBR framework is deployed to classify a patient, estimate initial parameters and to make recommendations for biofeedback training by retrieving and comparing with previous similar cases in terms of features extracted. The three phases work independently from each other. Moreover, fuzzy techniques are incorporated into our CBR system to better accommodate uncertainty in clinicians reasoning as well as decision analysis. All parts in the proposed framework have been implemented and primarily validated in a prototypical system. The initial result shows how the three phases functioned with CBR technique to assist biofeedback training. Eventually the system enables the clinicians to allow a patient to train himself/herself unsupervised.

  • 84.
    Ahmed, Mobyen Uddin
    et al.
    Mälardalens högskola, Akademin för innovation, design och teknik.
    Begum, Shahina
    Mälardalens högskola, Akademin för innovation, design och teknik.
    Funk, Peter
    Mälardalens högskola, Akademin för innovation, design och teknik.
    Xiong, Ning
    Mälardalens högskola, Akademin för innovation, design och teknik.
    von Schéele, Bo
    Mälardalens högskola, Akademin för innovation, design och teknik.
    Case-based Reasoning for Diagnosis of Stress using Enhanced Cosine and Fuzzy Similarity2008Ingår i: Case-based Reasoning for Diagnosis of Stress using Enhanced Cosine and Fuzzy Similarity, ISSN 1867-366X, Vol. 1, s. 3-19Artikel i tidskrift (Refereegranskat)
    Abstract [en]

    Intelligent analysis of heterogeneous data and information sources for efficient decision support presents an interesting yet challenging task in clinical envi-ronments. This is particularly the case in stress medicine where digital patient re-cords are becoming popular which contain not only lengthy time series measurements but also unstructured textual documents expressed in form of natural languages. This paper develops a hybrid case-based reasoning system for stress di-agnosis which is capable of coping with both numerical signals and textual data at the same time. The total case index consists of two sub-parts corresponding to signal and textual data respectively. For matching of cases on the signal aspect we present a fuzzy similarity matching metric to accommodate and tackle the imprecision and uncertainty in sensor measurements. Preliminary evaluations have revealed that this fuzzy matching algorithm leads to more accurate similarity estimates for improved case ranking and retrieval compared with traditional distance-based matching crite-ria. For evaluation of similarity on the textual dimension we propose an enhanced cosine matching function augmented with related domain knowledge. This is im-plemented by incorporating Wordnet and domain specific ontology into the textual case-based reasoning process for refining weights of terms according to available knowledge encoded therein. Such knowledge-based reasoning for matching of tex-tual cases has empirically shown its merit in improving both precision and recall of retrieved cases with our initial medical databases. Experts in the domain are very positive to our system and they deem that it will be a valuable tool to foster wide-spread experience reuse and transfer in the area of stress diagnosis and treatment.

  • 85.
    Ahmed, Mobyen Uddin
    et al.
    Mälardalens högskola, Akademin för innovation, design och teknik, Inbyggda system.
    Björkman, Mats
    Mälardalens högskola, Akademin för innovation, design och teknik, Inbyggda system.
    Lindén, Maria
    Mälardalens högskola, Akademin för innovation, design och teknik, Inbyggda system.
    A Generic System-level Framework for Self-Serve Health Monitoring System through Internet of Things(IoT)2015Ingår i: Studies in Health Technology and Informatics, Volume 211: Proceedings of the 12th International Conference on Wearable Micro and Nano Technologies for Personalized Health, 2–4 June 2015, Västerås, Sweden, 2015, Vol. 211, s. 305-307Konferensbidrag (Refereegranskat)
    Abstract [en]

    Sensor data are traveling from sensors to a remote server, data is analysed remotely in a distributed manner, and health status of a user is presented in real-time. This paper presents a generic system-level framework for a self-served health monitoring system through the Internet of Things (IoT) to facilities an efficient sensor data management.

  • 86.
    Ahmed, Mobyen Uddin
    et al.
    Mälardalens högskola, Akademin för innovation, design och teknik, Inbyggda system.
    Boubezoul, Abderrahmane
    UPE-IFSTTAR/TS2/SIMU&MOTO, F-77447 Marne la Vallée Cedex, France.
    Forsström, Nils Göran Gustav
    Sherif, Nabaz
    Stenekap, Daniel
    Espie, Stephane
    Sundström, Anton
    Södergren, Rasmus
    Data Analysis on Powered Two Wheelers Riders’ Behaviour using Machine Learning2019Ingår i: First International Conference on Advances in Signal Processing and Artificial Intelligence ASPAI' 2019, Barcelona, Spain, 2019Konferensbidrag (Refereegranskat)
    Abstract [en]

    Analyzing powered two-wheeler rider behavior, i.e. classification of riding patterns based on 3-D accelerometer/gyroscope sensors mounted on motorcycles is challenging. This paper presents machine learning approach to classify four different riding events performed by powered two wheeler riders’ as a step towards increasing traffic safety. Three machine learning algorithms, Random Forest (RF), Support Vector Machine (SVM) and Artificial Neural Network (ANN) have been used to classify riding patterns. The classification is conducted based on features extracted in time and frequency domains from accelerometer/gyroscope sensors signals. A comparison result between different filter frequencies, window sizes, features sets, as well as machine learning algorithms is presented. According to the results, the Random Forest method performs most consistently through the different data sets and scores best.

  • 87.
    Ahmed, Mobyen Uddin
    et al.
    Mälardalens högskola, Akademin för innovation, design och teknik, Inbyggda system.
    Brickman, Staffan
    Dengg, Alexander
    Fasth, Niklas
    Mihajlovic, Marko
    Norman, Jacob
    A Machine Learning Approach to Classify Pedestrians’ Event based on IMU and GPS2019Ingår i: International Conference on Modern Intelligent Systems Concepts MISC'18, 2019Konferensbidrag (Refereegranskat)
    Abstract [en]

    This paper investigates and implements six Machine Learning (ML) algorithms, i.e. Artificial Neural Network (ANN), Support Vector Machine (SVM), Decision Tree (DT), Random Forest (RF), Extra Tree (ET), and Gradient Boosted Trees (GBT) to classify different Pedestrians’ events based on Inertial Measurement Unit (IMU) and Global Positioning System (GPS) signals. Pedestrians’ events are pedestrian movements as the first step of H2020 project called SimuSafe1 with a goal to reduce traffic fatalities by doing risk assessments of the pedestrians. The movements the MLs’ models are attempting to classify are standing, walking, and running. Data, i.e. IMU, GPS sensor signals and other contextual information are collected by a smartphone through a controlled procedure. The smartphone is placed in five different positions onto the body of participants, i.e. arm, chest, ear, hand and pocket. The recordings are filtered, trimmed, and labeled. Next, samples are generated from small overlapping sections from which time and frequency domain features are extracted. Three different experiments are conducted to evaluate the performances in term of accuracy of the MLs’ models in different circumstances. The best performing MLs’ models determined by the average accuracy across all experiments is Extra Tree (ET) with a classification accuracy of 91%. 

  • 88.
    Ahmed, Mobyen Uddin
    et al.
    Örebro universitet, Institutionen för naturvetenskap och teknik.
    Islam, Asif Moinul
    Örebro University, Örebro, Sweden.
    Loutfi, Amy
    Örebro universitet, Institutionen för naturvetenskap och teknik.
    A case-based patient identification system using pulseoximeter and a personalized health profile2012Konferensbidrag (Refereegranskat)
    Abstract [en]

    This paper proposes a case-based system framework in order to identify patient using their health parameters taken with physiological sensors. It combines a personalized health profiling protocol with a Case-Based Reasoning (CBR) approach. The personalized health profiling helps to determine a number of individual parameters which are important inputs for a clinician to make the final diagnosis and treatment plan. The proposed system uses a pulse oximeter that measures pulse rate and blood oxygen saturation. The measurements are taken through an android application in a smart phone which is connected with the pulseoximeter and bluetooth communication. The CBR approach helps clinicians to make a diagnosis, classification and treatment plan by retrieving the most similar previous case. The case may also be used to follow the treatment progress. Here, the cases are formulated with person’s contextual information and extracted features from sensor signal measurements. The features are extracted considering three domain analysis:1) time domain features using statistical measurement, 2) frequency domain features applying Fast Fourier Transform (FFT), and 3) time-frequency domain features applying Discrete Wavelet Transform (DWT). The initial result is acceptable that shows the advancement of the system while combining the personalized health profiling together with CBR.

  • 89.
    Ahmed, Mobyen Uddin
    et al.
    Mälardalens högskola, Institutionen för datavetenskap och elektronik.
    Olsson, Erik
    Mälardalens högskola, Institutionen för datavetenskap och elektronik.
    Funk, Peter
    Mälardalens högskola, Institutionen för datavetenskap och elektronik.
    Xiong, Ning
    Mälardalens högskola, Institutionen för datavetenskap och elektronik.
    A Case-Based Reasoning System for Knowledge and Experience Reuse2007Ingår i: Proceedings of the 24th annual workshop of the Swedish Artificial Intelligence Society, 2007, s. 70-80Konferensbidrag (Refereegranskat)
    Abstract [en]

    Experience is one of the most valuable assets technicians and engineer have and may have been collected during many years and both from successful solutions as well as from very costly mistakes. Unfortunately industry rarely uses a systematic approach for experience reuse. This may be caused by the lack of efficient tools facilitating experience distribution and reuse. We propose a case-based approach and tool to facilitate experience reuse more systematically in industry. It is important that such a tool allows the technicians to give the problem case in a flexible way to increase acceptance and use. The proposed tool enables more structured handling of experience and is flexible and can be adapted to different situations and problems. The user is able to input text in a structured way and possibly in combination with other numeric or symbolic features. The system is able to identify and retrieve relevant similar experiences for reuse.

  • 90.
    Ahmed, Mobyen Uddin
    et al.
    Mälardalens högskola, Institutionen för datavetenskap och elektronik.
    Olsson, Erik
    Mälardalens högskola, Institutionen för datavetenskap och elektronik.
    Funk, Peter
    Mälardalens högskola, Institutionen för datavetenskap och elektronik.
    Xiong, Ning
    Mälardalens högskola, Institutionen för datavetenskap och elektronik.
    Efficient Condition Monitoring and Diagnosis Using a Case-Based Experience Sharing System2007Ingår i: The 20th International Congress and Exhibition on Condition Monitoring and Diagnostics Engineering Management, COMADEM 2007, Faro, Portugal, 2007, s. 305-314Konferensbidrag (Refereegranskat)
    Abstract [en]

    Industry has to adjust quickly to changes in their surroundings, for example reducing staff during recession and increasing staff when the market demands it. These factors may cause rapid loss of experience, collected during many years, or require experienced staff to spend considerable resources in training new staff, instead of focusing on production. This is recognised as very costly for companies and organisations today and also reduces competitiveness and productivity. Condition Monitoring, diagnostics and selection of efficient preventive or corrective actions is a task that often requires a high degree of expertise. This expertise is often gained through sometimes very expensive mistakes and can take many years to acquire leading to a few skilled experts. When they are not available due to changes in staff or retirements the company often faces serious problems that may be very expensive, e.g. leading to a reduced productivity.

    If some deviation occurs in a machine, a fault report is often written; an engineer makes a diagnosis and may order spare parts to repair the machine. Fault report, spare parts, required time and statistics on performance after repair are often stored in different databases but so far not systematically reused. In this paper we present a Case-Based experience sharing system that enables reuse of experience in a more efficient way compared with what is mostly practiced in industry today. The system uses Case-Based-Reasoning (CBR) and limited Natural Language Processing. An important aspect of the experience management tool is that it is user-friendly and web-based to promote efficient experience sharing. The system should be able to handle both experiences that are only in house as well as sharing experience with other industries when there is no conflicting interest. Such a CBR based tool enables efficient experience gathering, management and reuse in production industries. The tool will facilitate the users with an interactive environment to communicate with each other for sharing their experiences. Depend on the user; the security level of the system will be varied to share knowledge among the collaborating companies.

    The system identifies the most relevant experiences to assess and resolve the current situation. The experience is stored and retrieved as a case in the collaborative space where experience from various companies may have been stored under many years. Reusing experience and avoiding expensive mistakes will increase the participating companies' competitiveness and also transfer valuable experience to their employees. One of the benefits is also the opportunity and facility to identify people with similar tasks and problems at different companies and enable them to share their experience, e.g. if a technician has solved a similar problem recently and is in the near, the most efficient solution may be to call the expert and ask for assistance. In future, one may access this tool through his/her mobile device via wireless or mobile communications using Global Positioning System, GPS, enables the system to suggest experts nearby, willing and able to share the knowledge and quickly assist in resolve the problem.

  • 91.
    Ahmed, Mobyen Uddin
    et al.
    Mälardalens högskola, Akademin för innovation, design och teknik, Inbyggda system.
    Rahman, Hamidur
    Mälardalens högskola, Akademin för innovation, design och teknik, Inbyggda system.
    Begum, Shahina
    Mälardalens högskola, Akademin för innovation, design och teknik, Inbyggda system.
    Quality Index Analysis on Camera-based R-peak Identification Considering Movements and Light Illumination2018Ingår i: 15th International Conference on Wearable, Micro & Nano technologies for Personalized Health pHealth2018, 2018Konferensbidrag (Refereegranskat)
    Abstract [en]

    This paper presents a quality index (QI) analysis on R-peak extracted by a camera system considering movements and light illumination. Here, the proposed camera system is compared with a reference system named Shimmer PPG sensor. The study considers five test subjects with a 15 minutes measurement protocol, where the protocol consists of several conditions. The conditions are: normal sittings, head movements i.e., up/down/left/right/forward/backword, with light on/off and with moving flash on/off. A percentage of corrected R-peaks are calculated based on time difference in milliseconds (MS) between the R-peaks extracted both from camera-based and sensor-based systems. A comparison results between normal, movements, and lighting condition is presented as individual and group wise. Furthermore, the comparison is extended considering gender and origin of the subjects. According to the results, more than 90% R-peaks are correctly identified by the camera system with ?200 MS time differences, however, it decreases with while there is no light than when it is on. At the same time, the camera system shows more 95% accuracy for European than Asian men.

  • 92.
    Ahmed, Mobyen Uddin
    et al.
    Mälardalens högskola, Institutionen för datavetenskap och elektronik.
    Westin, Jerker
    Nyholm, Dag
    Dougherty, Mark
    Groth, Torgny
    A fuzzy rule-based decision support system for Duodopa treatment in Parkinson2006Konferensbidrag (Refereegranskat)
    Abstract [en]

    A decision support system (DSS) was implemented based on a fuzzy logic inference system (FIS) to provide assistance in dose alteration of Duodopa infusion in patients with advanced Parkinson's disease, using data from motor state assessments and dosage. Three-tier architecture with an object oriented approach was used. The DSS has a web enabled graphical user interface that presents alerts indicating non optimal dosage and states, new recommendations, namely typical advice with typical dose and statistical measurements. One data set was used for design and tuning of the FIS and another data set was used for evaluating performance compared with actual given dose. Overall goodness-of-fit for the new patients (design data) was 0.65 and for the ongoing patients (evaluation data) 0.98. User evaluation is now ongoing. The system could work as an assistant to clinical staff for Duodopa treatment in advanced Parkinson's disease.

  • 93.
    Ahmed, Tanvir Saif
    et al.
    KTH, Skolan för teknik och hälsa (STH), Medicinsk teknik, Data- och elektroteknik.
    Markovic, Bratislav
    KTH, Skolan för teknik och hälsa (STH), Medicinsk teknik, Data- och elektroteknik.
    Distribuerade datalagringssystem för tjänsteleverantörer: Undersökning av olika användningsfall för distribuerade datalagringssystem2016Självständigt arbete på grundnivå (högskoleexamen), 10 poäng / 15 hpStudentuppsats (Examensarbete)
    Abstract [sv]

    Detta examensarbete handlar om undersökning av tre olika användningsfall inom datalagring; Cold Storage, High Performance Storage och Virtual Machine Storage. Rapporten har som syfte att ge en översikt över kommersiella distribuerade filsystem samt en djupare undersökning av distribuerade filsystem som bygger på öppen källkod och därmed hitta en optimal lösning för dessa användnings-fall. I undersökningen ingick att analysera och jämföra tidigare arbeten där jämförelser mellan pre-standamätningar, dataskydd och kostnader utfördes samt lyfta upp diverse funktionaliteter (snapshotting, multi-tenancy, datadeduplicering, datareplikering) som moderna distribuerade filsy-stem kännetecknas av. Både kommersiella och öppna distribuerade filsystem undersöktes. Även en kostnadsuppskattning för kommersiella och öppna distribuerade filsystem gjordes för att ta reda på lönsamheten för dessa två typer av distribuerat filsystem.Efter att jämförelse och analys av olika tidigare arbeten utfördes, visade sig att det öppna distribue-rade filsystemet Ceph lämpade sig bra som en lösning utifrån kraven som sattes som mål för High Performance Storage och Virtual Machine Storage. Kostnadsuppskattningen visade att det var mer lönsamt att implementera ett öppet distribuerat filsystem. Denna undersökning kan användas som en vägledning vid val mellan olika distribuerade filsystem.

  • 94.
    Ahrén, Christina
    et al.
    Mälardalens högskola, Akademin för innovation, design och teknik.
    Nyblad, Ida
    Mälardalens högskola, Akademin för innovation, design och teknik.
    Investigating DRAM bank partitioning2018Självständigt arbete på grundnivå (kandidatexamen), 10 poäng / 15 hpStudentuppsats (Examensarbete)
    Abstract [en]

    We have investigated the page coloring technique bank partitioning and if it can be applied on commercial hardware platforms to reduce execution time jitter for specific tasks. We have also investigated how to alter execution times using bank partitioning. Unpredictable latency created by execution time jitter is a problem in real-time computing on commercial hardware platforms. We have run experiments that try to prove that the bank partitioning method we use alters the execution time and that thrashing occurs in the main memory if we run multiple instances of a workload. We receive significant changes in execution times when using bank partitioning and we can determine that thrashing occurs. However, due to the lack of the ability to measure the hardware performance counter for row buffer misses, we cannot determine if thrashing occurs in the main memory level. Since we cannot determine when, or if thrashing occurs in the main memory we find that we cannot reduce execution time jitter on the two systems that we have tested using bank partitioning on. We also find that execution times of specific tasks can be altered by reducing the number of bank bins associated with the specific task. The execution time of the task is increased if we reduce the number of bins associated with it.

  • 95. Aid Kalle Dunkel, Laura Viktorya Chrsitina Matthias Wißotzki
    et al.
    Sandkuhl, Kurt
    Högskolan i Jönköping, Tekniska Högskolan, JTH. Forskningsområde Informationsteknik.
    State of research in reuse of enterprise models: Systematic literature analysis of CAISE, EMMSAD, ICIS and INCOM2012Ingår i: Proceedings of the IADIS International Conference on Information Systems, 2012, s. 82-90Konferensbidrag (Refereegranskat)
    Abstract [en]

    The importance of managing organizational knowledge of enterprises has been recognized for decades. The systematic development and reuse of organizational knowledge is expected to improve the competitiveness of the enterprise. While the practice of “reuse” is common in general computer science there is still a lack of surveys in regard to reuse in enterprise modeling. This document reviews four different papers presented at information systems conferences over the last seven years: CAISE, EMMSAD, ICIS, and INCOM. Our analysis indicates that the majority of research is realized by case studies, theoretical frameworks and mostly on business process modeling aspects of enterprise models.

  • 96.
    Aisa, J.
    et al.
    Universidad de Zaragoza, Zaragoza, Spain .
    Fotouhi, Hossein
    Mälardalens högskola, Akademin för innovation, design och teknik, Inbyggda system.
    Villarroel, J. L.
    Universidad de Zaragoza, Zaragoza, Spain .
    Almeida, L.
    University of Porto, Porto, Portugal.
    Soft real-time traffic communication in loaded Wireless Mesh Networks2016Ingår i: IEEE International Workshop on Factory Communication Systems - Proceedings, WFCS, 2016, artikel-id Article number 7496503Konferensbidrag (Refereegranskat)
    Abstract [en]

    Industrial applications have been shifting towards wireless multi-hop networks in recent years due to their lower cost of deployment and reconfiguration compared with their wired counterparts. These wireless networks usually must support real-time communication to meet the application requirements. For this reason, Wireless Mesh Networks (WMNs) are potential candidates for industrial applications as they support a fixed infrastructure of static nodes for relaying packets. To meet the application demands, we modify the wireless chain network protocol (WICKPro) to support soft real-time traffic in WMNs with chain topologies over IEEE 802.11. We employ tele-operation of mobile robots as our case study, and perform extensive simulation and laboratory experiments. We show that the data delivery ratio is increased up to 42% in a scenario with 7 nodes, when the maximum end-to-end delay tolerated by the application is doubled. This is particularly suited to soft real-time applications that can trade longer delays by higher reliability. Moreover, when compared with a distributed priority-based token-passing protocol (RT-WMP), the lower overhead of WICKPro allows, in an error-free scenario, obtaining a throughput improvement of 33.42% on average.

  • 97.
    Aisa, Jesus
    et al.
    Universidad de Zaragoza, Zaragoza, Spain.
    Fotouhi, Hossein
    Mälardalens högskola, Akademin för innovation, design och teknik, Inbyggda system.
    Almeida, Luis
    University of Porto, Portugal.
    Villarroel, José Luis
    Universidad de Zaragoza, Zaragoza, Spain.
    DoTHa - A Double-threshold Hand-off Algorithm for Managing Mobility in Wireless Mesh Networks2016Ingår i: 21st IEEE Conference on Emerging Technologies and Factory Automation ETFA'16, 2016, artikel-id 7733511Konferensbidrag (Refereegranskat)
    Abstract [en]

    Wireless communication will play an increasingly important role in future factory automation and process control, where the presence of mobile autonomous devices is expected to grow. However, wireless links are prone to errors due to shadowing and multi-path fading, which is even more severe in dynamic environments. These problems can be attenuated by using a mesh backbone to which mobile node connect to, using a hand-off algorithm. This solution is particularly important under real-time requirements typically found in factory automation. In this paper, we devise the Double-Threshold Hand-off (DoTHa) algorithm, a novel hand-off mechanism that triggers a hand-off in various environmental conditions. As a case study, we carry out the tele-operation of a mobile robot through a wireless mesh network in an indoor setting, using a wireless chain network protocol (WICKPro-SRT) that supports soft real-time traffic. We empirically compared DoTHa with two existing hand-off algorithms based on single and double hysteresis margin. The results revealed that DoTHa achieves Data Delivery Ratio (DDR) close to 100% whereas the single hysteresis-based hand-off suffers from frequent disconnections, dropping DDR to 88%. The double hysteresis-based hand-off shows higher ping-pong effect than DoTHa, doubling the number of hand-offs in some scenarios.

  • 98.
    Akalin, Neziha
    et al.
    Örebro universitet, Institutionen för naturvetenskap och teknik.
    Kiselev, Andrey
    Örebro universitet, Institutionen för naturvetenskap och teknik.
    Kristoffersson, Annica
    Örebro universitet, Institutionen för naturvetenskap och teknik.
    Loutfi, Amy
    Örebro universitet, Institutionen för naturvetenskap och teknik.
    An Evaluation Tool of the Effect of Robots in Eldercare on the Sense of Safety and Security2017Ingår i: Social Robotics: 9th International Conference, ICSR 2017, Tsukuba, Japan, November 22-24, 2017, Proceedings / [ed] Kheddar, A.; Yoshida, E.; Ge, S.S.; Suzuki, K.; Cabibihan, J-J:, Eyssel, F:, He, H., Springer International Publishing , 2017, s. 628-637Konferensbidrag (Refereegranskat)
    Abstract [en]

    The aim of the study presented in this paper is to develop a quantitative evaluation tool of the sense of safety and security for robots in eldercare. By investigating the literature on measurement of safety and security in human-robot interaction, we propose new evaluation tools. These tools are semantic differential scale questionnaires. In experimental validation, we used the Pepper robot, programmed in the way to exhibit social behaviors, and constructed four experimental conditions varying the degree of the robot’s non-verbal behaviors from no gestures at all to full head and hand movements. The experimental results suggest that both questionnaires (for the sense of safety and the sense of security) have good internal consistency.

  • 99.
    Akalin, Neziha
    et al.
    Örebro universitet, Institutionen för naturvetenskap och teknik.
    Kiselev, Andrey
    Örebro universitet, Institutionen för naturvetenskap och teknik.
    Kristoffersson, Annica
    Örebro universitet, Institutionen för naturvetenskap och teknik.
    Loutfi, Amy
    Örebro universitet, Institutionen för naturvetenskap och teknik.
    An Evaluation Tool of the Effect of Robots in Eldercare on the Sense of Safety and Security2017Ingår i: Social Robotics: 9th International Conference, ICSR 2017, Tsukuba, Japan, November 22-24, 2017, Proceedings / [ed] Kheddar, A.; Yoshida, E.; Ge, S.S.; Suzuki, K.; Cabibihan, J-J:, Eyssel, F:, He, H., Springer International Publishing , 2017, s. 628-637Konferensbidrag (Refereegranskat)
    Abstract [en]

    The aim of the study presented in this paper is to develop a quantitative evaluation tool of the sense of safety and security for robots in eldercare. By investigating the literature on measurement of safety and security in human-robot interaction, we propose new evaluation tools. These tools are semantic differential scale questionnaires. In experimental validation, we used the Pepper robot, programmed in the way to exhibit social behaviors, and constructed four experimental conditions varying the degree of the robot’s non-verbal behaviors from no gestures at all to full head and hand movements. The experimental results suggest that both questionnaires (for the sense of safety and the sense of security) have good internal consistency.

  • 100.
    Akalin, Neziha
    et al.
    Örebro universitet, Institutionen för naturvetenskap och teknik.
    Kiselev, Andrey
    Örebro universitet, Institutionen för naturvetenskap och teknik.
    Kristoffersson, Annica
    Örebro universitet, Institutionen för naturvetenskap och teknik.
    Loutfi, Amy
    Örebro universitet, Institutionen för naturvetenskap och teknik.
    The Relevance of Social Cues in Assistive Training with a Social Robot2018Ingår i: 10th International Conference on Social Robotics, ICSR 2018, Proceedings / [ed] Ge, S.S., Cabibihan, J.-J., Salichs, M.A., Broadbent, E., He, H., Wagner, A., Castro-González, Á., Springer, 2018, s. 462-471Konferensbidrag (Refereegranskat)
    Abstract [en]

    This paper examines whether social cues, such as facial expressions, can be used to adapt and tailor a robot-assisted training in order to maximize performance and comfort. Specifically, this paper serves as a basis in determining whether key facial signals, including emotions and facial actions, are common among participants during a physical and cognitive training scenario. In the experiment, participants performed basic arm exercises with a social robot as a guide. We extracted facial features from video recordings of participants and applied a recursive feature elimination algorithm to select a subset of discriminating facial features. These features are correlated with the performance of the user and the level of difficulty of the exercises. The long-term aim of this work, building upon the work presented here, is to develop an algorithm that can eventually be used in robot-assisted training to allow a robot to tailor a training program based on the physical capabilities as well as the social cues of the users.

1234567 51 - 100 av 3907
RefereraExporteraLänk till träfflistan
Permanent länk
Referera
Referensformat
  • apa
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Annat format
Fler format
Språk
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Annat språk
Fler språk
Utmatningsformat
  • html
  • text
  • asciidoc
  • rtf