oru.sePublikationer
Change search
Refine search result
13141516 751 - 795 of 795
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)
  • 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)
Select
The maximal number of hits you can export is 250. When you want to export more records please use the 'Create feeds' function.
  • 751.
    Ullberg, Jonas
    et al.
    Örebro University, School of Science and Technology.
    Loutfi, Amy
    Örebro University, School of Science and Technology.
    Pecora, Federico
    Örebro University, School of Science and Technology.
    Towards continuous activity monitoring with temporal constraints2009Conference paper (Refereed)
    Abstract [en]

    This paper focuses on a temporal reasoning approach for human activity recognition. Specifically, we show how search and temporal propagation are used to enable long term and continuous activity recognition. Two specific issues are addressed, namely maintaining performance over long monitoring horizons and ensuring future temporal consistency of recognized activities. We propose a complete search algorithm for activity recognition which addresses these issues, in which an admissible pruning technique allows improved performance. We show a sufficient condition for guaranteeing future admissibility, and experimental results which test the limits and practical applicability of the system are presented.

  • 752.
    Ullberg, Jonas
    et al.
    Örebro University, School of Science and Technology.
    Pecora, Federico
    Örebro University, School of Science and Technology.
    Propagating temporal constraints on sets of intervals2012In: ICAPS Workshop on Planning and Scheduling with Timelines, 2012, 25-32 p.Conference paper (Refereed)
    Abstract [en]

    In this paper we propose a method of propagating quantitative Allen interval constraints on sets of intervals defined by polygons in a two dimensional space. The method is used to solve the problem of inferring timelines of human activities from timelines representing traces of sensor data. The main advantage of this method over others is that it allows a more general description of the events that the intervals are taken to reflect during inference. This paper deals with the algorithmic issues underlying the timeline recognition process. In this context, we compare the performance of our method to that of a state of the art approach based on classical temporal constraint reasoning techniques (Dousson and Maigat, 2007).

  • 753.
    Vadi-Dris, David
    et al.
    Örebro University, School of Science and Technology.
    Pasma, Miika
    Örebro University, School of Science and Technology.
    Game Entry to Swedish Game Awards: "Winds of Kahlara"2010Independent thesis Basic level (degree of Bachelor), 10 credits / 15 HE creditsStudent thesis
    Abstract [en]

    This is a report that describes the implementation of a computer technical examination project at Örebro University. More specifically it is about how two students have developed a computer game as an entry for Swedish Game Awards, a competition for games developed without interaction from commercial companies. The game, titled “Winds of Kahlara”, is written for PC and lets the participants compete against each other over a network in a 3D environment. The graphical theme is fantasy and the players utilize among other things magical attacks to kill their opponents. The development itself has taken more than a year since the complexity of the game has required extensive technical research and graphical designing.

  • 754.
    Vajdi, Amir
    et al.
    Department of Computer Science, University of Massachusetts Boston, Boston, MA, United States.
    Haspel, Nurit
    Department of Computer Science, University of Massachusetts Boston, Boston, MA, United States.
    Banaee, Hadi
    Örebro University, School of Science and Technology.
    A New DP Algorithm for Comparing Gene Expression Data Using Geometric Similarity2015In: Proceedings 2015 IEEE International Conference on Bioinformatics and Biomedicine, New York: IEEE conference proceedings , 2015, 1157-1161 p.Conference paper (Refereed)
    Abstract [en]

    Microarray gene expression data comes as a time series, where the expression level of a gene is recorded at specific time points. Comparing the time series produced by two genes can give us information about the regulatory or inhibitory relationship between the genes. We present a Dynamic Programming (DP) method to compare gene expression data using geometric similarity. We aim to detect similarities and relationships between genes, based on their expression time series. By representing the time series as polygons and compare them, we can find relationships that are not available when the two time series are compared point-by-point. We applied our algorithm on a dataset of 343 regulatory pairs from the alpha dataset and compared them to randomly generated pairs. Using an SVM classifier, we find the optimal similarity score that separates the regulatory dataset from the random pairs. Our results show that we can detect similar pairs better than simple Pearson correlation and we outperform many of the existing methods. This method is an ongoing approach, that can be applied to finding the similarity of any data that can convert to 2D polygon. In the future, we plan to introduce this method as a new classifier.

  • 755.
    Valencia, Rafael
    et al.
    Örebro University, School of Science and Technology.
    Saarinen, Jari
    Örebro University, School of Science and Technology.
    Andreasson, Henrik
    Örebro University, School of Science and Technology.
    Vallvé, Joan
    CSIC-UPC, Barcelona,Spain.
    Andrade-Cetto, Juan
    CSIC-UPC, Barcelona, Spain.
    Lilienthal, Achim J.
    Örebro University, School of Science and Technology.
    Localization in highly dynamic environments using dual-timescale NDT-MCL2014In: 2014 IEEE International Conference on Robotics and Automation (ICRA), IEEE Robotics and Automation Society, 2014, 3956-3962 p.Conference paper (Refereed)
    Abstract [en]

    Industrial environments are rarely static and oftentheir configuration is continuously changing due to the materialtransfer flow. This is a major challenge for infrastructure freelocalization systems. In this paper we address this challengeby introducing a localization approach that uses a dualtimescaleapproach. The proposed approach - Dual-TimescaleNormal Distributions Transform Monte Carlo Localization (DTNDT-MCL) - is a particle filter based localization method,which simultaneously keeps track of the pose using an aprioriknown static map and a short-term map. The short-termmap is continuously updated and uses Normal DistributionsTransform Occupancy maps to maintain the current state ofthe environment. A key novelty of this approach is that it doesnot have to select an entire timescale map but rather use thebest timescale locally. The approach has real-time performanceand is evaluated using three datasets with increasing levels ofdynamics. We compare our approach against previously proposedNDT-MCL and commonly used SLAM algorithms andshow that DT-NDT-MCL outperforms competing algorithmswith regards to accuracy in all three test cases.

  • 756.
    Valgren, Christoffer
    et al.
    Department of Computer Science, Örebro University, Örebro, Sweden.
    Lilienthal, Achim J.
    Örebro University, School of Science and Technology.
    SIFT, SURF & seasons: Appearance-based long-term localization in outdoor environments2010In: Robotics and Autonomous Systems, ISSN 0921-8890, E-ISSN 1872-793X, Vol. 58, no 2, 149-156 p.Article in journal (Refereed)
    Abstract [en]

    In this paper, we address the problem of outdoor, appearance-based topological localization, particularly over long periods of time where seasonal changes alter the appearance of the environment. We investigate a straight-forward method that relies on local image features to compare single image pairs. We rst look into which of the dominating image feature algorithms, SIFT or the more recent SURF, that is most suitable for this task. We then ne-tune our localization algorithm in terms of accuracy, and also introduce the epipolar constraint to further improve the result. The nal localization algorithm is applied on multiple data sets, each consisting of a large number of panoramic images, which have been acquired over a period of nine months with large seasonal changes. The nal localization rate in the single-image matching, cross-seasonal case is between 80 to 95%.

  • 757.
    van den Besselaar, Peter
    et al.
    Vrije University Amsterdam, Department of Social Informatics, Amsterdam, Netherlands; Vrije University, Network Institution, Amsterdam, Netherlands.
    Sandström, Ulf
    Örebro University. INDEK, KTH Royal Institute of Technology, Stockholm, Sweden.
    Does Quantity Make a Difference?2015In: Proceedings of ISSI 2015 Istanbul: 15th International Society of Scientometrics and Informetrics Conference, International Society of Scientometrics and Informetrics , 2015, 577-583 p.Conference paper (Refereed)
    Abstract [en]

    Do highly productive researchers have significantly higher probability to produce top cited papers? Or does the increased productivity in science only result in a sea of irrelevant papers as a perverse effect of competition and the increased use of indicators for research evaluation and accountability focus? We use a Swedish author disambiguated dataset consisting of 48,000 researchers and their WoS-listed publications during the period of 2008-2011 with citations until 2014 to investigate the relation between productivity and production of highly cited papers. As the analysis shows, quantity does make a difference.

  • 758.
    van den Besselaar, Peter
    et al.
    Department of Organization Sciences & Network Institute, Vrije Universiteit Amsterdam, Amsterdam, The Netherlands.
    Sandström, Ulf
    Örebro University. INDEK, KTH Royal Institute of Technology, Stockholm, Sweden.
    Gender differences in research performance and its impact on careers: a longitudinal case study2016In: Scientometrics, ISSN 0138-9130, E-ISSN 1588-2861, Vol. 106, no 1, 143-162 p.Article in journal (Refereed)
    Abstract [en]

    We take up the issue of performance differences between male and female researchers, and investigate the change of performance differences during the early career. In a previous paper it was shown that among starting researchers gendered performance differences seem small to non-existent (Van Arensbergen et al. 2012). If the differences do not occur in the early career anymore, they may emerge in a later period, or may remain absent. In this paper we use the same sample of male and female researchers, but now compare performance levels about 10 years later. We use various performance indicators: full/fractional counted productivity, citation impact, and relative citation impact in terms of the share of papers in the top 10 % highly cited papers. After the 10 years period, productivity of male researchers has grown faster than of female researcher, but the field normalized (relative) citation impact indicators of male and female researchers remain about equal. Furthermore, performance data do explain to a certain extent why male careers in our sample develop much faster than female researchers' careers; but controlling for performance differences, we find that gender is an important determinant too. Consequently, the process of hiring academic staff still remains biased.

  • 759.
    Vasirani, Matteo
    et al.
    Distributed Information Systems Laboratory, École Polytechnique Fédérale, Lausanne, Switzerland.
    Klügl, Franziska
    Örebro University, School of Science and Technology.
    Camponogara, Eduardo
    Department of Automation and Systems Engineering, Federal University of Santa Catarina, Florianopolis, Brazil.
    Hattori, Hiromitsu
    Graduate School of Informatics, Kyoto University, Kyoto, Japan.
    Special issue on intelligent agents in traffic and transportation2015In: Journal of Intelligent Transportation Systems / Taylor & Francis, ISSN 1547-2450, E-ISSN 1547-2442, Vol. 19, no 1, 1-2 p.Article in journal (Other academic)
  • 760.
    Vaskevicius, N.
    et al.
    Jacobs University, Bremen, Germany.
    Mueller, C. A.
    Jacobs University, Bremen, Germany.
    Bonilla, M.
    University of Pisa, Italy.
    Tincani, V.
    University of Pisa, Italy.
    Stoyanov, Todor
    Örebro University, School of Science and Technology.
    Fantoni, G.
    University of Pisa, Italy.
    Pathak, K.
    Jacobs University, Bremen, Germany.
    Lilienthal, Achim J.
    Örebro University, School of Science and Technology.
    Bicchi, A.
    University of Pisa, Italy.
    Birk, A.
    Jacobs University, Bremen, Germany.
    Object recognition and localization for robust grasping with a dexterous gripper in the context of container unloading2014Conference paper (Refereed)
    Abstract [en]

    The work presented here is embedded in research on an industrial application scenario, namely autonomous shipping-container unloading, which has several challenging constraints: the scene is very cluttered, objects can be much larger than in common table-top scenarios; the perception must be highly robust, while being as fast as possible. These contradicting goals force a compromise between speed and accuracy. In this work, we investigate a state of the art perception system integrated with a dexterous gripper. In particular, we are interested in pose estimation errors from the recognition module and whether these errors can be handled by the abilities of the gripper.

  • 761.
    Vergara, Alexander
    et al.
    University of California, San Diego.
    Fonollosa, Jordi
    University of California, San Diego.
    Mahiques, Jonas
    University of California, San Diego.
    Trincavelli, Marco
    Örebro University, School of Science and Technology.
    Rulkov, Nikolai
    University of California, San Diego.
    Huerta, Ramon
    University of California, San Diego.
    On the performance of gas sensor arrays in open sampling systems using inhibitory support vector machines2013In: Sensors and actuators. B, Chemical, ISSN 0925-4005, Vol. 185, no August 2013, 462-477 p.Article in journal (Refereed)
    Abstract [en]

    Chemo-resistive transduction presents practical advantages for capturing the spatio-temporal and structural organization of chemical compounds dispersed in different human habitats. In an open sampling system, however, where the chemo-sensory elements are directly exposed to the environment being monitored, the identification and monitoring of chemical substances present a more difficult challenge due to the dispersion mechanisms of gaseous chemical analytes, namely diffusion, turbulence, and advection. The success of such actively changeable practice is influenced by the adequate implementation of algorithmically driven formalisms combined with the appropriate design of experimental protocols. On the basis of this functional joint-formulation, in this study we examine an innovative methodology based on the inhibitory processing mechanisms encountered in the structural assembly of the insect's brain, namely Inhibitory Support Vector Machine (ISVM) applied to training a sensor array platform and evaluate its capabilities relevant to odor detection and identification under complex environmental conditions. We generated - and made publicly available - an extensive and unique dataset with a chemical detection platform consisting of 72 conductometric metal-oxide based chemical sensors in a custom-designed wind tunnel test-bed facility to test our methodology. Our findings suggest that the aforementioned methodology can be a valuable tool to guide the decision of choosing the training conditions for a cost-efficient system calibration as well as an important step toward the understanding of the degradation level of the sensory system when the environmental conditions change.

  • 762.
    Vidal, Thierry
    et al.
    Ecole Nationale d'Ingénieurs de Tarbes, Tarbes, France.
    Bidot, Julien
    Ecole Nationale d'Ingénieurs de Tarbes, Tarbes, France.
    Dynamic sequencing of tasks insSimple temporal networks with uncertainty2001Conference paper (Refereed)
    Abstract [en]

    Planning or scheduling systems that handle tasks with uncertain durations mightuse an extension of the Simple Temporal Network (STN) with a distinction between controllable and contingent variables and constraints. Temporal consistency is then redefined in terms of Dynamic Controllability, which means the ability to decide the precise timing of tasks only at execution time, depending on observations made, and still satisfying all no constraints. This property has been recently proven to be checkable in polynomial time through a simple path consistency-like algorithm. In this paper, we are interested in using such a model in scheduling applications, in which tasks may compete for the same resource, and should thus be sequenced. Such constraints make the problem NP-hard, and cannot be directly expressed in an STN. In the presence of uncertainty, one might also wish to postpone task sequencing until execution time. This paper provides the characterization of such a Dynamic Sequencing ability. Then, we propose an incomplete checking method still relying on the STNU for the sake of temporal reasoning efficiency, adding further filtering techniques to account for sequencing constraints.

  • 763.
    Vuka, Mikel
    et al.
    Dipartitmento di Elettronica, Informazione e Bioingegneria, Politecnico di Milano, Milano, Italy.
    Schaffernicht, Erik
    Örebro University, School of Science and Technology.
    Schmuker, Michael
    University of Hertfordshire, School of Computer Science, College Lane, Hatfield, Herts, United Kingdom.
    Hernandez Bennetts, Victor
    Örebro University, School of Science and Technology.
    Amigoni, Francesco
    Dipartitmento di Elettronica, Informazione e Bioingegneria, Politecnico di Milano, Milano, Italy.
    Lilienthal, Achim J
    Örebro University, School of Science and Technology.
    Exploration and Localization of a Gas Source with MOX Gas Sensorson a Mobile Robot: A Gaussian Regression Bout Amplitude Approach2017In: 2017 ISOCS/IEEE International Symposium on Olfaction and Electronic Nose (ISOEN 2017): Proceedings, IEEE, 2017, 164-166 p.Conference paper (Refereed)
    Abstract [en]

    Mobile robot olfaction systems combine gas sensorswith mobility provided by robots. They relief humansof dull, dirty and dangerous tasks in applications such assearch & rescue or environmental monitoring. We address gassource localization and especially the problem of minimizingexploration time of the robot, which is a key issue due toenergy constraints. We propose an active search approach forrobots equipped with MOX gas sensors and an anemometer,given an occupancy map. Events of rapid change in the MOXsensor signal (“bouts”) are used to estimate the distance to agas source. The wind direction guides a Gaussian regression,which interpolates distance estimates. The contributions of thispaper are two-fold. First, we extend previous work on gassource distance estimation with MOX sensors and propose amodification to cope better with turbulent conditions. Second,we introduce a novel active search gas source localizationalgorithm and validate it in a real-world environment.

  • 764.
    Wada, Yuta
    et al.
    Department of Mechanical Systems Engineering, Tokyo University of Agriculture and Technology, Japan..
    Trincavelli, Marco
    Örebro University, School of Science and Technology.
    Fukazawa, Yuichiro
    Department of Mechanical Systems Engineering, Tokyo University of Agriculture and Technology, Japan..
    Ishida, Hiroshi
    Department of Mechanical Systems Engineering, Tokyo University of Agriculture and Technology, Japan..
    Collecting a database for studying gas distribution mapping and gas source localization with mobile robots2010Conference paper (Refereed)
    Abstract [en]

    In this paper, we present our initial experiments to collect a database for studying mobile robot olfaction. Mobile robots with olfactory sensing capabilities are expected to be used in various applications including gas distribution mapping and gas source localization. Owing to the turbulent nature of the airflow field and the gas distribution, these robots must be equipped with algorithms that can cope with chaotic environments. Since it is important to check the applicability of such algorithms in a diversity of environments, we propose to build a database with which the users can test the performances of their own algorithms in various environments. The database collected so far consists of two parts: a basic data set collected in a well-characterized controlled indoor environment and applied data sets collected in uncontrolled indoor and outdoor environments. A result of applying the database for testing a gas-source localization algorithm are shown as an example. We believe that such database will accelerate the research advancements on mobile robot olfaction.

  • 765.
    Wahlman, Johan
    Örebro University, School of Science and Technology.
    Administratörsverktyg för IOT-enheter2015Independent thesis Advanced level (professional degree), 10 credits / 15 HE creditsStudent thesis
    Abstract [en]

    IoT (Internet of Things) are devices which are usually equipped with different kinds of sensors, these sensor values are then sent to a server where these values are somehow processed. It’s predicted that the usage of IoT devices will increase significantly during the upcoming years.

     

    Microsoft has a service named Azure IoT Hub, which is designed for easy administration of IoT devices, but Azure IoT Hub provides no user interface to administer these IoT devices. The task of this project is to create a user interface for Azure IoT Hub.

  • 766.
    Wakabi, Wairagala
    et al.
    Örebro University, Örebro University School of Business.
    Grönlund, Åke
    Örebro University, Örebro University School of Business.
    Citizen-to-Citizen vs. Citizen-to-Government eParticipation in Uganda: Implications for Research and Practice2015In: Electronic Participation, ePart 2015, Springer, 2015, 95-107 p.Conference paper (Refereed)
    Abstract [en]

    The use of Information and Communication Technologies (ICT) is growing globally, as is interest in the use of digital technologies to improve citizens' participation in governance. In African countries, where ICT use remains low and where there is a democratic deficit, the nature and extent of citizens' participation via ICT is unknown. Based on a print questionnaire with 322 internet users in Uganda, this paper compares citizen-to-citizen (C2C) participation and citizen-to-government (C2G) participation, examines the factors that hinder greater C2C and C2G online participation, and explores the implications for greater eParticipation in future. For effective eParticipation, the majority of Ugandan internet users need to become more active as creators of online content, as well as conversationalists and critics. Results show that regardless of whether it is engagements among citizens or between citizens and leaders, most citizens are spectators.

  • 767.
    Wandel, Michael
    et al.
    University of Tubingen.
    Lilienthal, Achim J.
    Örebro University, Department of Technology.
    Duckett, Tom
    Örebro University, Department of Technology.
    Weimar, Udo
    University of Tubingen.
    Zell, Andreas
    University of Tubingen.
    Gas distribution in unventilated indoor environments inspected by a mobile robot2003In: Proceedings of the IEEE international conference on advanced robotics: ICAR 2003, 2003, 507-512 p.Conference paper (Refereed)
    Abstract [en]

    Gas source localisation with robots is usually performed in environments with a strong, unidirectional airflow created by artificial ventilation. This tends to create a strong, well defined analyte plume and enables upwind searching. By contrast, this paper presents experiments conducted in unventilated rooms. Here, the measured concentrations also indicate an analyte plume with, however, different properties concerning its shape, width, concentration profile and stability over time. In the results presented in this paper, two very different mobile robotic systems for odour sensing were investigated in different environments, and the similarities as well as differences in the analyte gas distributions measured are discussed.

  • 768.
    Wandel, Michael
    et al.
    University of Tubingen.
    Lilienthal, Achim J.
    Örebro University, Department of Technology.
    Zell, Andreas
    University of Tubingen.
    Weimar, Udo
    University of Tubingen.
    Mobile robot using different senses2002In: Proceedings of the international symposium on olfaction and electronic nose: ISOEN 2002, 2002, 128-129 p.Conference paper (Refereed)
  • 769.
    Wandel, Michael R.
    et al.
    University of Tubingen.
    Weimar, Udo
    University of Tubingen.
    Lilienthal, Achim J.
    Örebro University, Department of Technology.
    Zell, Andreas
    University of Tubingen.
    Leakage localisation with a mobile robot carrying chemical sensors2001In: The 8th IEEE international conference on electronics, circuits and systems: ICECS 2001, 2001, 1247-1250 p.Conference paper (Refereed)
    Abstract [en]

    On the way to developing an electronic watchman one more sense, i.e. gas sensing facilities, are added to an autonomous mobile robot. For the gas detection, up to eight metal oxide sensors are operated using a commercial sensor system. The robot is able to move and navigate autonomously. The geometric information is extracted from laser range finder data. This input is used to build up an internal map while driving. Using the new sensor the localisation of a gas source in unventilated in-house environments is performed. First experiments in a one-dimensional case show a very good correlation between the peak and the gas source. The one-dimensional concentration profile is repeatedly recorded and stable for at least two hours. The two-dimensional experiments exhibit a circulation of the air within the room due to temperature and hence density effects. The latter is limiting the available recording time for the two-dimensional mapping

  • 770.
    Wang, Yan
    Örebro University, School of Science and Technology.
    A domain-specific language for protocol stack implementation in embedded systems2011Doctoral thesis, comprehensive summary (Other academic)
    Abstract [en]

    Embedded network software has become increasingly interesting for both research and business as more and more networked embedded systems emerge. Well-known infrastructure protocol stacks are reimplemented on new embedded hardware and software architectures. New requirements of modern applications and devices require to implement newly designed or revised protocols. However, implementing protocol stacks for embedded systems remains a time-consuming and error-prone task due to the complexity and performancecritical nature of network software. It is even more so when targeting resource constrained embedded systems: implementations have to minimize energy consumption, memory usage etc., while programming efficiency is needed to improve on time-to-market, scalability, maintainability and product evolution. Therefore, it is worth researching on how to make protocol stack implementations for embedded systems both easier and more likely to be correct within the resource limits.

    In the work presented in this thesis, we take a language-based approach and aim to facilitate the implementation of protocol stacks while realizing performance demands and being aware of energy consumption and memory usage within the constraints imposed by embedded systems. We give background on DSL implementation techniques, investigate common practices in network protocol development to determine the potential of domain-specifi languages (DSLs) for embedded network software, and propose a domain-specifi embedded language (DSEL), Protege (Protocol Implementation Generator), for declaratively describing overlaid protocol stacks. In Protege, a high-level packet specification is dually compiled into an internal data representation for protocol logic implementation, and packet processing methods which are then integrated into the dataflow framework of a protocol overlay specification. Constructs for finite state machines allow to specify protocol logic in a concise manner, close to the protocol specification style. Protege specifications are compiled to highly portable C code for various architectures.

    Four attached scientific papers report our main results in more detail: an embedded implementation of the data description calculus in Haskell, a compilation framework for generating packet processing code with overlays, the domain-specific language Protege in overview (including embedding techniques and runtime system features), and a real-world case study implementing an industrial application protocol.

    List of papers
    1. A library for processing ad hoc data in Haskell: embedding a data description language
    Open this publication in new window or tab >>A library for processing ad hoc data in Haskell: embedding a data description language
    2008 (English)In: Implementation and application of functional languages   / [ed] Sven-Bodo Scholz, Olaf Chitil, 2008, 174-191 p.Conference paper, Published paper (Refereed)
    Abstract [en]

    Ad hoc data formats, i.e. semistructured non-standard dataformats, are pervasive in many domains that need software tools—bioinformatics,demographic surveys, geophysics and network software are justa few. Building tools becomes easier if parsing and other standard inputoutputprocessing can be automated. Modern approaches for dealingwith ad hoc data formats consist of domain specific languages based ontype systems. Compilers for these languages generate data structures andparsing functions in a target programming language in which tools andapplications are then written. We present a monadic library in Haskellthat implements a data description language. Using our library, Haskellprogrammers have access to data description primitives that can be usedfor parsing and that can be integrated with other libraries and applicationprograms without the need of yet another compiler.

    Series
    Lecture notes in computer science, 5836
    Keyword
    Ad hoc Data, Haskell
    National Category
    Engineering and Technology Computer Science
    Research subject
    Computer and Systems Science
    Identifiers
    urn:nbn:se:oru:diva-15277 (URN)10.1007/978-3-642-24452-0_10 (DOI)978-3-642-24451-3 (ISBN)
    Conference
    20th International Symposium, IFL 2008, Hatfield, UK, September 10-12, 2008
    Projects
    IPS
    Available from: 2009-10-05 Created: 2011-04-15 Last updated: 2017-10-17Bibliographically approved
    2. A Domain Specific Approach to Network Software Architecture: Assuring Conformance Between Architecture and Code
    Open this publication in new window or tab >>A Domain Specific Approach to Network Software Architecture: Assuring Conformance Between Architecture and Code
    2009 (English)In: Fourth International Conference on Digital Telecommunications, 2009. ICDT '09, Piscataway, N.J.: IEEE, 2009, 127-132 p.Conference paper, Published paper (Refereed)
    Abstract [en]

    Network software is typically organized according toa layered architecture that is well understood. However, writingcorrect and efficient code that conforms with the architecture stillremains a problem. To overcome this problem we propose to usea domain specific language based approach. The architecturalconstraints are captured in a domain specific notation that can beused as a source for automatic program generation. Conformancewith the architecture is thus assured by construction. Knowledgefrom the domain allows us to generate efficient code. In addition,this approach enforces reuse of both code and designs, one ofthe major concerns in software architecture. In this paper, weillustrate our approach with PADDLE, a tool that generates packetprocessing code from packet descriptions. To describe packets weuse a domain specific language of dependent types that includespacket overlays. From the description we generate C librariesfor packet processing that are easy to integrate with other partsof the code. We include an evaluation of our tool.

    Place, publisher, year, edition, pages
    Piscataway, N.J.: IEEE, 2009
    Keyword
    Network Software Architecture
    National Category
    Telecommunications Engineering and Technology Computer Science
    Research subject
    Computer and Systems Science
    Identifiers
    urn:nbn:se:oru:diva-15278 (URN)10.1109/ICDT.2009.4 (DOI)000274805500026 ()2-s2.0-70449602416 (Scopus ID)978-0-7695-3695-8 (ISBN)
    Conference
    Fourth International Conference on Digital Telecommunications, 2009. ICDT '09
    Note

    ©2009 IEEE. Personal use of this material is permitted. However, permission to reprint/republish this material for advertising or promotional purposes or for creating new collective works for resale or redistribution to servers or lists, or to reuse any copyrighted component of this work in other works must be obtained from the IEEE.

    Available from: 2011-04-15 Created: 2011-04-15 Last updated: 2017-10-18Bibliographically approved
    3. An embedded language for programming protocol stacks in embedded systems
    Open this publication in new window or tab >>An embedded language for programming protocol stacks in embedded systems
    2011 (English)In: Proceedings of the 20th ACM SIGPLAN workshop on Partial evaluation and program manipulation: PEPM'11, New York, NY, USA: ACM Digital Library, 2011, 63-72 p.Conference paper, Published paper (Refereed)
    Abstract [en]

    Protocol stack specifications are well-structured documents that follow a number of conventions and notations that have proven very useful for the design and dissemination of communication protocols. Protocol stack implementations on the other hand, are done in low-level languages, using error-prone programming techniques resulting in programs that are difficult to relate to the specifications, difficult to maintain, modify, extend and reuse. To overcome these problems we propose a domain-specific language that provides abstractions close to the notations used in protocol specifications. From descriptions in our language we generate C programs that can be integrated with other systems software. The language provides constructs to describe packet formats, including physical layout, constraints and dependencies. It also provides constructs for state machines and for layering protocols into stacks. Experiments show that the C programs we generate are comparable in performance and binary size to hand-crafted C programs.

    Place, publisher, year, edition, pages
    New York, NY, USA: ACM Digital Library, 2011
    Keyword
    domain-specific language, embedded compilation, embedded network software
    National Category
    Engineering and Technology Computer Science
    Research subject
    Computer and Systems Science
    Identifiers
    urn:nbn:se:oru:diva-15279 (URN)10.1145/1929501.1929511 (DOI)978-1-4503-0485-6 (ISBN)
    Conference
    PEPM'11
    Available from: 2011-03-17 Created: 2011-04-15 Last updated: 2017-10-18Bibliographically approved
    4. A compositional implementation of Modbus in Protege
    Open this publication in new window or tab >>A compositional implementation of Modbus in Protege
    2011 (English)In: 6th IEEE International Symposium on Industrial Embedded Systems (SIES), 2011, IEEE conference proceedings, 2011, 123-131 p.Conference paper, Published paper (Refereed)
    Abstract [en]

    This is a case study for Protege. The language is used to produce a radically modular implementation of the Modbus [Mod06a] protocol for industrial process controllers. We show that Protege is an excellent tool to produce customized subset implementations, a commonly used technique to reduce software size and complexity in small industrial controller units.

    Modbus is one of the most widely used network protocols in industrial automation applications, and a typical example of an industrial protocol with rich functionality, relatively simple data structures, and several communication layer variants in practical use. The original ModbusSerial uses legacy serial communication protocol standards (RS232 or RS485) for communication between Fieldbus-enabled equipments, e.g. micro-controllers and PLCs within an industrial controller network. ModbusTCP is a more recent Modbus variant that oers Modbus messaging services over TCP/IP networks, to connect modern devices like intelligent sensors or advanced PLCs to a Modbus network.

    As already described in Sections 4.1 and 4.3, Modbus divides into several specification and implementation documents [Mod06a, Mod06c, Mod06b]. The core functionality of Modbus is given as the Modbus application protocol [Mod06a], which is independent of the underlying communication layer variants and specifes a large number of relatively simple functions to read and manipulate device state. Separate specications for the communication layer [Mod06b, Mod06c] describe how the Modbus application messaging service should inter-operate with the seria

    l line or the TCP/IP stack, respectively resulting in either ModbusSerial or ModbusTCP.

    Good maintainability, modularity and code reuse are key features for quick time-to-market, and especially attractive properties in the area of industrial protocols, characterised by long-lived standards and ongoing integration work. In our paper, we show the advantages of our compilation-based DSL approach Protege. We exemplify how to systematically decompose industrial protocols like Modbus, and propose a modular Modbus implementation concept which not only separates the communiation layer as in the specification, but also decomposes Modbus application protocol functionality into separate modules. A Modbus protocol implementation can be decomposed into the two underlying communication layer variants and a number of application layer functions. These application layer functionalities can be seen as independent modules of an entire application layer, acting as small sub-protocols of their own and sharing only the common communication infrastructure below. Furthermore, every protocol in the picture splits into a client and a server part, which operate on the same packet layouts as sender and receiver.

    The compilation-based Protege approach provides the necessary setting to reflect this multi-level modularity faithfully in the code. By defining each function code as a separate (sub-)protocol of its own, they can be freely combined to custom implementations tailored towards small controller devices with limited functionality. In addition, the compilation-based high-level approach of Protege enables code reuse for the packet processing code. Parsing (receiver) and marshaling code (sender) are generated from the same Protege source code, imported into the client and server modules. And from the separation of runtime system features for Protege, our implementation gains a large degree of platform-independence; Modbus can thus be integrated in various platforms with specialized embedded operating systems.

    In total, our case study implementing Modbus demonstrates that Protege increases flexibility in several aspects and thereby considerably reduces implementation cost. New customized Modbus implementations can be produced very quickly using our approach, which makes integration and maintenance much easier and results in drastically reduced time-to-market, a key feature. for success especially in the industrial setting.

    Place, publisher, year, edition, pages
    IEEE conference proceedings, 2011
    National Category
    Engineering and Technology Computer Science
    Research subject
    Computer and Systems Science
    Identifiers
    urn:nbn:se:oru:diva-15280 (URN)10.1109/SIES.2011.5953654 (DOI)978-1-61284-818-1 (ISBN)
    Conference
    6th IEEE International Symposium on Industrial Embedded Systems (SIES 2011), June 15th - 17th, 2011, Västerås, Sweden
    Available from: 2011-04-15 Created: 2011-04-15 Last updated: 2017-10-18Bibliographically approved
  • 771.
    Wang, Yan
    et al.
    Örebro University, School of Science and Technology.
    Gaspes, Veronica
    A compositional implementation of Modbus in Protege2011In: 6th IEEE International Symposium on Industrial Embedded Systems (SIES), 2011, IEEE conference proceedings, 2011, 123-131 p.Conference paper (Refereed)
    Abstract [en]

    This is a case study for Protege. The language is used to produce a radically modular implementation of the Modbus [Mod06a] protocol for industrial process controllers. We show that Protege is an excellent tool to produce customized subset implementations, a commonly used technique to reduce software size and complexity in small industrial controller units.

    Modbus is one of the most widely used network protocols in industrial automation applications, and a typical example of an industrial protocol with rich functionality, relatively simple data structures, and several communication layer variants in practical use. The original ModbusSerial uses legacy serial communication protocol standards (RS232 or RS485) for communication between Fieldbus-enabled equipments, e.g. micro-controllers and PLCs within an industrial controller network. ModbusTCP is a more recent Modbus variant that oers Modbus messaging services over TCP/IP networks, to connect modern devices like intelligent sensors or advanced PLCs to a Modbus network.

    As already described in Sections 4.1 and 4.3, Modbus divides into several specification and implementation documents [Mod06a, Mod06c, Mod06b]. The core functionality of Modbus is given as the Modbus application protocol [Mod06a], which is independent of the underlying communication layer variants and specifes a large number of relatively simple functions to read and manipulate device state. Separate specications for the communication layer [Mod06b, Mod06c] describe how the Modbus application messaging service should inter-operate with the seria

    l line or the TCP/IP stack, respectively resulting in either ModbusSerial or ModbusTCP.

    Good maintainability, modularity and code reuse are key features for quick time-to-market, and especially attractive properties in the area of industrial protocols, characterised by long-lived standards and ongoing integration work. In our paper, we show the advantages of our compilation-based DSL approach Protege. We exemplify how to systematically decompose industrial protocols like Modbus, and propose a modular Modbus implementation concept which not only separates the communiation layer as in the specification, but also decomposes Modbus application protocol functionality into separate modules. A Modbus protocol implementation can be decomposed into the two underlying communication layer variants and a number of application layer functions. These application layer functionalities can be seen as independent modules of an entire application layer, acting as small sub-protocols of their own and sharing only the common communication infrastructure below. Furthermore, every protocol in the picture splits into a client and a server part, which operate on the same packet layouts as sender and receiver.

    The compilation-based Protege approach provides the necessary setting to reflect this multi-level modularity faithfully in the code. By defining each function code as a separate (sub-)protocol of its own, they can be freely combined to custom implementations tailored towards small controller devices with limited functionality. In addition, the compilation-based high-level approach of Protege enables code reuse for the packet processing code. Parsing (receiver) and marshaling code (sender) are generated from the same Protege source code, imported into the client and server modules. And from the separation of runtime system features for Protege, our implementation gains a large degree of platform-independence; Modbus can thus be integrated in various platforms with specialized embedded operating systems.

    In total, our case study implementing Modbus demonstrates that Protege increases flexibility in several aspects and thereby considerably reduces implementation cost. New customized Modbus implementations can be produced very quickly using our approach, which makes integration and maintenance much easier and results in drastically reduced time-to-market, a key feature. for success especially in the industrial setting.

  • 772.
    Wang, Yan
    et al.
    Örebro University, School of Science and Technology.
    Gaspes, Veronica
    Halmstad University, School of Information Technology, Halmstad Embedded and Intelligent Systems Research (EIS), Embedded Systems (CERES).
    A Domain Specific Approach to Network Software Architecture: Assuring Conformance Between Architecture and Code2009In: Fourth International Conference on Digital Telecommunications, 2009. ICDT '09, Piscataway, N.J.: IEEE, 2009, 127-132 p.Conference paper (Refereed)
    Abstract [en]

    Network software is typically organized according toa layered architecture that is well understood. However, writingcorrect and efficient code that conforms with the architecture stillremains a problem. To overcome this problem we propose to usea domain specific language based approach. The architecturalconstraints are captured in a domain specific notation that can beused as a source for automatic program generation. Conformancewith the architecture is thus assured by construction. Knowledgefrom the domain allows us to generate efficient code. In addition,this approach enforces reuse of both code and designs, one ofthe major concerns in software architecture. In this paper, weillustrate our approach with PADDLE, a tool that generates packetprocessing code from packet descriptions. To describe packets weuse a domain specific language of dependent types that includespacket overlays. From the description we generate C librariesfor packet processing that are easy to integrate with other partsof the code. We include an evaluation of our tool.

  • 773.
    Wang, Yan
    et al.
    Örebro University, School of Science and Technology.
    Gaspes, Veronica
    Halmstad University, School of Information Technology, Halmstad Embedded and Intelligent Systems Research (EIS), Embedded Systems (CERES).
    A library for processing ad hoc data in Haskell: embedding a data description language2008In: Implementation and application of functional languages   / [ed] Sven-Bodo Scholz, Olaf Chitil, 2008, 174-191 p.Conference paper (Refereed)
    Abstract [en]

    Ad hoc data formats, i.e. semistructured non-standard dataformats, are pervasive in many domains that need software tools—bioinformatics,demographic surveys, geophysics and network software are justa few. Building tools becomes easier if parsing and other standard inputoutputprocessing can be automated. Modern approaches for dealingwith ad hoc data formats consist of domain specific languages based ontype systems. Compilers for these languages generate data structures andparsing functions in a target programming language in which tools andapplications are then written. We present a monadic library in Haskellthat implements a data description language. Using our library, Haskellprogrammers have access to data description primitives that can be usedfor parsing and that can be integrated with other libraries and applicationprograms without the need of yet another compiler.

  • 774.
    Wang, Yan
    et al.
    Örebro University, School of Science and Technology.
    Gaspes, Veronica
    Halmstad University, School of Information Science, Computer and Electrical Engineering (IDE).
    An embedded language for programming protocol stacks in embedded systems2011In: Proceedings of the 20th ACM SIGPLAN workshop on Partial evaluation and program manipulation: PEPM'11, New York, NY, USA: ACM Digital Library, 2011, 63-72 p.Conference paper (Refereed)
    Abstract [en]

    Protocol stack specifications are well-structured documents that follow a number of conventions and notations that have proven very useful for the design and dissemination of communication protocols. Protocol stack implementations on the other hand, are done in low-level languages, using error-prone programming techniques resulting in programs that are difficult to relate to the specifications, difficult to maintain, modify, extend and reuse. To overcome these problems we propose a domain-specific language that provides abstractions close to the notations used in protocol specifications. From descriptions in our language we generate C programs that can be integrated with other systems software. The language provides constructs to describe packet formats, including physical layout, constraints and dependencies. It also provides constructs for state machines and for layering protocols into stacks. Experiments show that the C programs we generate are comparable in performance and binary size to hand-crafted C programs.

  • 775.
    Wasik, Zbigniew
    Örebro University, Department of Technology.
    A behavior-based control system for mobile manipulation2005Doctoral thesis, monograph (Other academic)
    Abstract [en]

    The field of industrial robotics can be defined as the study, design and use of robot manipulators for manufacturing. Although the problem of designing a controller for industrial robots has been subject of intensive study, a number of assumptions are usually made which may seriously limit the applicability of these robots. First, the robotic manipulator is usually considered to be positioned at one place, which means that it can only work in its limited working envelope fixed to this position. Second, it is usually assumed that the environment of the manipulator (workcell) is carefully engineered to suit the task and the configuration of the arm. Finally, the control program of the manipulator is often designed assuming that the task will not change. These restriction make current industrial robots unsuitable for the new demands of flexible automation in small and medium enterprises. In this thesis, we develop techniques that extend the applicability of current robotic manipulators, by addressing the

    above limitations. We propose an approach to sensor-based manipulation that: 1) has flexible and modular control system, in order to easily to new tasks and environments, 2) the execution is sensor-based for robustness in less controlled environment, and 3) our approach applies to the more general problem of combined mobility and manipulation, in order to extend the work space of the manipulator.

  • 776.
    Wasik, Zbigniew
    et al.
    Örebro University.
    Saffiotti, Alessandro
    Örebro University, Department of Technology.
    A behavior-based control system for mobile manipulation2005Manuscript (preprint) (Other academic)
  • 777.
    Wasik, Zbigniew
    et al.
    Örebro University, Department of Technology.
    Saffiotti, Alessandro
    Örebro University, Department of Technology.
    A fuzzy behavior-based control system for manipulation2002In: IEEE/RSJ International Conference on Intelligent Robots and Systems, 2002, 2002, 1596-1601 p.Conference paper (Refereed)
    Abstract [en]

    Behavior-based approaches to robot control are extremely popular in mobile robotics, but still rarely used for manipulation. We propose a behavior-based system that performs manipulation tasks using visual feedback. The distinctive points of our proposal are: (i) visual behaviors are implemented using a new camera-based approach; (ii) reactive fuzzy rules are used to arbitrate behaviors; and (iii) the outputs of concurrent behaviors are fused using fuzzy logic. We show experiments on a real arm performing a pick-and-place task that illustrate our approach and demonstrate its advantages over current approaches.

  • 778.
    Wasik, Zbigniew
    et al.
    Örebro University, Department of Technology.
    Saffiotti, Alessandro
    Örebro University, Department of Technology.
    A hierarchical behavior-based approach to manipulation tasks2003In: IEEE International Conference on Robotics and Automation: Proceedings : ICRA '03., 2003, 2780-2785 p.Conference paper (Refereed)
    Abstract [en]

    Typical mobile robots can be customized to perform a variety of different tasks by combining in different ways a set of basic control modules, or behaviors. By contrast, most current systems for manipulation are still designed for just one specific task. In this paper, we propose a hierarchical behavior-based system that can perform several vision-based manipulation tasks by using different combinations of the same set of basic behaviors. Behaviors can run concurrently, and they are arbitrated through "if-then" rules. We show experiments involving object tracking, grasping and placing, both with static and moving objects.

  • 779.
    Wasik, Zbigniew
    et al.
    Örebro University, Department of Technology.
    Saffiotti, Alessandro
    Örebro University, Department of Technology.
    Robust color segmentation for the RoboCup domain2002In: Proceedings 16th International Conference on Pattern Recognition, 2002, 2002, 651-654 p.Conference paper (Refereed)
    Abstract [en]

    Color segmentation is crucial in robotic applications, such as RoboCup, where the relevant objects can be distinguished by their color. In these applications, real-time performance and robustness are primary concerns. We present a hybrid method for color segmentation based on seeded region growing (SRG) in which the initial seeds are provided by a conservative threshold color segmentation. The key to the robustness of our approach is to use multiple seeds to perform local blob growing, and then merge blobs that belong to the same region. We have implemented our technique on a team of Sony AIBO 4-legged robots, and have successfully tested it in the RoboCup 2001 competition

  • 780.
    Wasik, Zbigniew
    et al.
    Örebro University, Department of Technology.
    Saffiotti, Alessandro
    Örebro University, Department of Technology.
    Using hierarchical fuzzy behaviors for manipulation2003Conference paper (Refereed)
    Abstract [en]

    Behavior-based systems have become extremely popular in autonomous robotics. These systems are typically used to control robots with few degrees of fredom (DOF), like mobile platforms. We propose a behavior-based system able to control a complex plant with several DOF. The key to deal with complexity is the use of fuzzy logic techniques to compose simple behaviors into more complex ones. In this paper, we illustrate our approach on a 5 DOF real manipulator, on which several tasks are performed using the same set of basic behaviors.

  • 781.
    Wasik, Zbigniew
    et al.
    Örebro University, Department of Technology.
    Saffiotti, Alessandro
    Örebro University, Department of Technology.
    Using hierarchical fuzzy behaviors for manipulation2003In: Proc. of the World Congress of the Int. Fuzzy Systems Association, 2003Conference paper (Refereed)
    Abstract [en]

    Behavior-based systems have become extremely popular in autonomous robotics. These systems are typically used to control robots with few degrees of fredom (DOF), like mobile platforms. We propose a behaviorbased system able to control a complex plant with several DOF. The key to deal with complexity is the use of fuzzy logic techniques to compose simple behaviors into more complex ones. In this paper, we illustrate our approach on a 5DOF real manipulator, on which several tasks are performed using the same set of basic behaviors.

  • 782. Wearing, Thomas
    et al.
    Dragoni, Nicola
    Örebro University, School of Science and Technology.
    Security and Privacy Issues in Health Monitoring Systems: eCare@Home Case Study2016In: Proceedings of the 1st Workshop on Emerging eHealth through Internet of Things (EHIoT 2016), 2016Conference paper (Refereed)
    Abstract [en]

    Automated systems for monitoring elderly people in their home are becoming more and more common. Indeed, an increasing number of home sensor networks for healthcare can be found in the recent literature, indicating a clear research direction in smart homes for health-care. Although the huge amount of sensitive data these systems deal with and expose to the external world, security and privacy issues are surpris-ingly not taken into consideration. The aim of this paper is to raise some key security and privacy issues that home health monitor systems should face with. The analysis is based on a real world monitoring sensor network for healthcare built in the context of the eCare@Home project.

  • 783.
    Westholm, Erik
    Örebro University, School of Science and Technology.
    A Simulator Tool for Human Activity Recognition2010Independent thesis Advanced level (degree of Master (One Year)), 20 credits / 30 HE creditsStudent thesis
    Abstract [en]

    The goal of this project was to create a simulator that was to produce data for research in the field of activity recognition. The simulator was to simulate a human entity moving around in, and interacting with, a PEIS environment. This simulator ended up being based on The Sims 3, and how this was done is described. The reader is expected to have some experience with programming.

  • 784.
    Wide, Peter
    et al.
    Linköping University, Linköping, Sweden.
    Driankov, Dimiter
    Linköping University, Linköping, Sweden.
    A fuzzy approach to multi-sensor data fusion for quality profile classification1996In: M'96: IEEE/SICE/RSJ International Conference on Multisensor Fusion and Integration for Intelligent Systems, New York, USA: IEEE conference proceedings, 1996, 215-221 p.Conference paper (Refereed)
    Abstract [en]

    In the present paper a multi-sensor system is considered wlicre the sensors comprising it utilize the principles of huinan olfactory sensing and the processing of the sensor iiicasurcnients is done by a fuzzy sensor fusion technique. 'l'hc enipliasis of the paper is on the fuzzy fusion technique used for the classification of the numerical measurements of a quality characteristic in different fuzzy quality profiles.

  • 785.
    Wide, Peter
    et al.
    Örebro University, Department of Technology.
    Saffiotti, Alessandro
    Örebro University, Department of Technology.
    Bothe, Hans-Heinrich
    Environmental exploration: an autonomous sensory systems approach1999In: IEEE Instrumentation & Measurement Magazine, ISSN 1094-6969, E-ISSN 1941-0123, Vol. 2, no 3, 28-32 p.Article in journal (Refereed)
    Abstract [en]

    The purpose of this article is to demonstrate new paradigms in the analysis and design of virtual instrumentation in autonomous sensor systems. By autonomous sensor systems we mean mobile as well as immobile systems that employ a vast array of sensors to analyze or influence dynamic and uncertain external changes. These systems must perform operations in real time, in both expected and unexpected situations, using only limited human intervention. An autonomous sensor system can be used to collect data about a complex and dynamic environment, to perform interpretation and fusion of this data, and to present the resulting information to a human operator in a synthetic form that highlights features of interest of the environment. The system can then be regarded as a virtual instrument. A useful form to organize and present this information is a virtual spatial map-a representation of the environment in which colored geometric figures are placed to indicate that a given feature (or event) has been detected at that location. We illustrate our approach of building virtual instruments by presenting a case study of semi-autonomous remote environmental exploration. A mobile platform gathers information about a remote environment using multi-modal sensor data collection, information processing, and data fusion at different levels of abstraction and resolution. The result of the exploration is a fused virtual map that contains the important features of the environment

  • 786.
    Wiedemann, Thomas
    et al.
    Institute of Communications and Navigation German Aerospace Center (DLR), Wessling, Germany.
    Shutin, Dmitri
    Institute of Communications and Navigation German Aerospace Center (DLR), Wessling, Germany.
    Hernandez Bennetts, Victor
    Örebro University, School of Science and Technology.
    Schaffernicht, Erik
    Örebro University, School of Science and Technology.
    Lilienthal, Achim
    Örebro University, School of Science and Technology.
    Bayesian Gas Source Localization and Explorationwith a Multi-Robot System Using PartialDifferential Equation Based Modeling2017In: 2017 ISOCS/IEEE International Symposium on Olfaction and Electronic Nose (ISOEN 2017): Proceedings, 2017, 122-124 p.Conference paper (Refereed)
    Abstract [en]

    Here we report on active water sampling devices forunderwater chemical sensing robots. Crayfish generate jetlikewater currents during food search by waving theflagella of their maxillipeds. The jets generated toward theirsides induce an inflow from the surroundings to the jets.Odor sample collection from the surroundings to theirolfactory organs is promoted by the generated inflow.Devices that model the jet discharge of crayfish have beendeveloped to investigate the effectiveness of the activechemical sampling. Experimental results are presented toconfirm that water samples are drawn to the chemicalsensors from the surroundings more rapidly by using theaxisymmetric flow field generated by the jet discharge thanby centrosymmetric flow field generated by simple watersuction. Results are also presented to show that there is atradeoff between the angular range of chemical samplecollection and the sample collection time.

  • 787.
    Wilcox, Andreas
    Örebro University, School of Science and Technology.
    Simulation av Xbox Live Indie Games gränssnittet2011Independent thesis Basic level (degree of Bachelor), 10 credits / 15 HE creditsStudent thesis
    Abstract [en]

    This thesis was developed as an assignment from Ludosity Interactive where the goal was to develop a copy of the Xbox Live Indie Games-marketplace from the Xbox 360. Ludosity Interactive had a necessity to easily test a game's attractiveness to potential customers using testing people from outside the company in a simulated Xbox Live Indie Games test environment; excluding this developed system there is no other way to do such an analysis without actually releasing the game on the Xbox Live Indie Games marketplace and then analyze the resulting sales from the product.

    The finished system had to be similar to the original system to the degree that a user could see past the interface itself and use the system just as he/she would have used the real marketplace. It also had to be easy to change and add games to the system so that Ludosity Interactive easily could show the games and the data that they deemed interesting for their tests. The final product was developed using C#, XNA and XML together with an Agileinspired development method in combination with Pivotal Tracker. This report describes how this product was developed.

  • 788.
    Zain-ul-Abdin,
    Örebro University, School of Science and Technology.
    Programming of coarse-grained reconfigurable architectures2011Doctoral thesis, comprehensive summary (Other academic)
    Abstract [en]

    Coarse-grained reconfigurable architectures, which offer massive parallelism coupled with the capability of undergoing run-time reconfiguration, are gaining attention in order to meet not only the increased computational demands of high-performance embedded systems, but also to fulfill the need of adaptability to functional requirements of the application. This thesis focuses on the programming aspects of such coarse-grained reconfigurable computing devices, including the relevant computation models that are capable of exposing different kinds of parallelism inherent in the application and the ability of these models to capture the adaptability requirements of the application. The thesis suggests the occam-pi language for programming of a broad class of coarse-grained reconfigurable architectures as an intermediate language; we call it intermediate, since we believe that the applicationprogramming is best done in a high-level domain-specific language. The salient properties of the occam-pi language are explicit concurrency with built-in mechanisms for interprocessorcommunication, provision for expressing dynamic parallelism, support for the expression of dynamic reconfigurations, and placement attributes. To evaluate the programming approach, a compiler framework was extended to support the language extensions in the occam-pi language, and backends were developed to target two different coarse-grained reconfigurable architectures. XPP and Ambric. The results on XPP reveal that the occam-pi based implementations produce comparable throughput to those of NML programs, while programming at a much higher level of abstraction than that of NML. Similarly the two occam-pi implementations of autofocus criterion calculation targeted to the Ambric platform outperform the CPU implementation by factors of 11-23. Thus, the results of the implemented case-studies suggest that the occam-pi language based approach simplifies the development of applications employing run-time reconfigurable devices without compromising the performance benefits.

    List of papers
    1. A Study of Design Efficiency with a High-Level Language for FPGAs
    Open this publication in new window or tab >>A Study of Design Efficiency with a High-Level Language for FPGAs
    2007 (English)In: Proceedings of the 14th International Reconfigurable Architectures Workshop (RAW'07), Piscataway, N.J.: IEEE , 2007, 1-7 p.Conference paper, Published paper (Refereed)
    Abstract [en]

    Over the years reconfigurable computing devices such as FPGAs have evolved from gate-level glue logic to complex reprogrammable processing architectures. However, the tools used for mapping computations to such architectures still require the knowledge about architectural details of the target device to extract efficiency. A study of the Mobius language and tools is presented in this paper, with a focus on generated hardware performance. A number of streaming and memory-intensive applications have been developed and the results have been compared with the corresponding implementations in VHDL and a behavioral hardware description language. Based upon experimental evidences, it is concluded that Mobius, a minimal parallel processing language targeted for reconfigurable architectures, enhances productivity in terms of design time and code maintainability without considerably compromising performance and resources.

    Place, publisher, year, edition, pages
    Piscataway, N.J.: IEEE, 2007
    Keyword
    FPGA, Mobius language, VHDL, behavioral hardware description language, high-level language, minimal parallel processing language, reconfigurable computing device, eprogrammable processing architecture
    National Category
    Engineering and Technology Computer Science
    Research subject
    Computer and Systems Science
    Identifiers
    urn:nbn:se:oru:diva-15259 (URN)10.1109/IPDPS.2007.370394 (DOI)2-s2.0-34548787179 (Scopus ID)2082/2363 (Local ID)1-4244-0910-1 (ISBN)2082/2363 (Archive number)2082/2363 (OAI)
    Conference
    IEEE International Parallel and Distributed Processing Symposium, 2007. IPDPS 2007
    Note
    ©2007 IEEE. Personal use of this material is permitted. However, permission to reprint/republish this material for advertising or promotional purposes or for creating new collective works for resale or redistribution to servers or lists, or to reuse any copyrighted component of this work in other works must be obtained from the IEEE.Available from: 2011-04-14 Created: 2011-04-14 Last updated: 2017-10-17Bibliographically approved
    2. Evolution in architectures and programming methodologies of coarse-grained reconfigurable computing
    Open this publication in new window or tab >>Evolution in architectures and programming methodologies of coarse-grained reconfigurable computing
    2009 (English)In: Microprocessors and microsystems, ISSN 0141-9331, E-ISSN 1872-9436, Vol. 33, no 3, 161-178 p.Article in journal (Refereed) Published
    Abstract [en]

    In order to meet the increased computational demands of, e.g., multimedia applications, such as video processing in HDTV, and communication applications, such as baseband processing in telecommunication systems, the architectures of reconfigurable devices have evolved to coarse-grained compositions of functional units or program controlled processors, which are operated in a coordinated manner to improve performance and energy efficiency.

    In this survey we explore the field of coarse-grained reconfigurable computing on the basis of the hardware aspects of granularity, reconfigurability, and interconnection networks, and discuss the effects of these on energy related properties and scalability. We also consider the computation models that are being adopted for programming of such machines, models that expose the parallelism inherent in the application in order to achieve better performance. We classify the coarse-grained reconfigurable architectures into four categories and present some of the existing examples of these categories. Finally, we identify the emerging trends of introduction of asynchronous techniques at the architectural level and the use of nano-electronics from technological perspective in the reconfigurable computing discipline.

    Place, publisher, year, edition, pages
    Amsterdam: Elsvier, 2009
    Keyword
    Reconfigurable architectures, Coarse-grained arrays, Computation models, Globally-asynchronous locally-synchronous
    National Category
    Engineering and Technology Computer Science
    Research subject
    Computer and Systems Science
    Identifiers
    urn:nbn:se:oru:diva-15260 (URN)10.1016/j.micpro.2008.10.003 (DOI)
    Projects
    Embedded Parallel Computing
    Available from: 2009-09-18 Created: 2011-04-14 Last updated: 2017-10-17Bibliographically approved
    3. Using a CSP based programming model for reconfigurable processor arrays
    Open this publication in new window or tab >>Using a CSP based programming model for reconfigurable processor arrays
    2008 (English)In: Prodeedings of International Conference on Reconfigurable Computing and FPGAs, 2008. ReConFig '08, Los Alamitos, California: IEEE Computer Society , 2008, 343-348 p.Conference paper, Published paper (Refereed)
    Abstract [en]

    The growing trend towards adoption of flexible and heterogeneous, parallel computing architectures has increased the challenges faced by the programming community. We propose a method to program an emerging class of reconfigurable processor arrays by using the CSP based programming model of occam-pi. The paper describes the extension of an existing compiler platform to target such architectures. To evaluate the performance of the generated code, we present three implementations of the DCT algorithm. It is concluded that CSP appears to be a suitable computation model for programming a wide variety of reconfigurable architectures.

    Place, publisher, year, edition, pages
    Los Alamitos, California: IEEE Computer Society, 2008
    Keyword
    CSP, Programming Models, Coarse-grained Reconfigurable Architectures
    National Category
    Computer Engineering Engineering and Technology
    Research subject
    Computer Technology
    Identifiers
    urn:nbn:se:oru:diva-15261 (URN)10.1109/ReConFig.2008.41 (DOI)2-s2.0-62349104086 (Scopus ID)978-0-7695-3474-9 (ISBN)
    Conference
    2008 International Conference on Reconfigurable Computing and FPGAs, ReConFig 2008, 3-5 December 2008, Cancun, Mexico
    Note
    ©2008 IEEE. Personal use of this material is permitted. However, permission to reprint/republish this material for advertising or promotional purposes or for creating new collective works for resale or redistribution to servers or lists, or to reuse any copyrighted component of this work in other works must be obtained from the IEEE.Available from: 2011-04-14 Created: 2011-04-14 Last updated: 2017-10-17Bibliographically approved
    4. Specifying Run-time Reconfiguration in Processor Arrays using High-level language
    Open this publication in new window or tab >>Specifying Run-time Reconfiguration in Processor Arrays using High-level language
    2010 (English)In: WRC 2010: 4th HiPEAC Workshop on Reconfigurable Computing, Pisa, 2010, 1-10 p.Conference paper, Published paper (Refereed)
    Abstract [en]

    The adoption of run-time reconfigurable parallel architectures for high-performance embedded systems is constrained by the lackof a unified programming model which can express both parallelism and reconfigurability. We propose to program an emerging class of reconfigurable processor arrays by using the programming model of occam-pi and describe how the extensions of channel direction specifiers, mobile data, dynamic process invocation, and process placement attributes can be used to express run-time reconfiguration in occam-pi. We present implementations of DCT algorithm to demonstrate the applicability of occam-pi to express reconfigurability. We concluded that occam-pi appears to be a suitable programming model for programming run-time reconfigurable processor arrays.

    Place, publisher, year, edition, pages
    Pisa: , 2010
    National Category
    Computer Science Engineering and Technology
    Research subject
    Computer and Systems Science
    Identifiers
    urn:nbn:se:oru:diva-15262 (URN)
    Conference
    HiPEAC Workshop on Reconfigurable Computing
    Available from: 2011-04-14 Created: 2011-04-14 Last updated: 2017-10-17Bibliographically approved
    5. Programming real-time autofocus on a massively parallel reconfigurable architecture using Occam-pi
    Open this publication in new window or tab >>Programming real-time autofocus on a massively parallel reconfigurable architecture using Occam-pi
    2011 (English)In: Proceedings of the 19th Annual IEEE International Symposium on Field-Programmable Custom Computing Machines (FCCM 2011), IEEE conference proceedings, 2011, 194-201 p.Conference paper, Published paper (Other academic)
    Abstract [en]

    Recently we proposed occam-pi as a high-level language for programming massively parallel reconfigurable architectures. The design of occam-pi incorporates ideas from CSP and pi-calculus to facilitate expressing parallelism and reconfigurability. The feasability of this approach was illustratedby building three occam-pi implementations of DCT executing on an Ambric. However, because DCT is a simple and well studied algorithm it remained uncertain whether occam-pi would also be effective for programming novel, more complex algorithms.

    In this paper, we demonstrate the applicability of occam-pi for expressing various degrees of parallelism by implementinga significantly large case-study of focus criterion calculation inan autofocus algorithm on the Ambric architecture. Autofocus is a key component of synthetic aperture radar systems. Two implementations of focus criterion calculation were developedand evaluated on the basis of performance. The comparison of the performance results with a single threaded software implementation of the same algorithm show that the throughput of the two implementations are 11x and 23x higher than the sequential implementation despite a much lower (9x) clock frequency. The two designs are, respectively, 29x and 40x moreenergy efficient.

    Place, publisher, year, edition, pages
    IEEE conference proceedings, 2011
    National Category
    Engineering and Technology Computer Science
    Research subject
    Computer and Systems Science
    Identifiers
    urn:nbn:se:oru:diva-15263 (URN)10.1109/FCCM.2011.20 (DOI)
    Conference
    19th Annual IEEE International Symposium on Field-Programmable Custom Computing Machines (FCCM 2011), Salt Lake City. Utah, May 1-3
    Projects
    SMECY
    Available from: 2011-03-22 Created: 2011-04-14 Last updated: 2017-10-18Bibliographically approved
    6. Occam-pi as a high-level language for coarse-grained reconfigurable architectures
    Open this publication in new window or tab >>Occam-pi as a high-level language for coarse-grained reconfigurable architectures
    2011 (English)In: 2011 IEEE International Symposium on Parallel and Distributed Processing Workshops and Phd Forum (IPDPSW), IEEE conference proceedings, 2011, 236-243 p.Conference paper, Published paper (Refereed)
    Abstract [en]

    Recently we proposed occam-pi as a high-levellanguage for programming coarse grained reconfigurable architectures. The constructs of occam-pi combine ideas from CSPand pi-calculus to facilitate expressing parallelism, communication, and reconfigurability. The feasability of this approachwas illustrated by developing a compiler framework to compile occam-pi implementations to the Ambric architecture.

    In this paper, we demonstrate the applicability of occam-pif or programing an array of functional units, eXtreme ProcessingPlatform (XPP). This is made possible by extending the compilerframework to target the XPP architecture, including automatic floating to fixed-point conversion. Different implementations of a FIR filter and a DCT algorithm were developed and evaluated on the basis of performance and resource consumption. The reported results reveal that the approach of using occam-pito program the category of coarse grained reconfigurable architectures appears to be promising. The resulting implementations are generally much superior to those programmed in C and comparable to those hand-coded in the low-level native language NML.

    Place, publisher, year, edition, pages
    IEEE conference proceedings, 2011
    National Category
    Computer Engineering Engineering and Technology
    Research subject
    Computer Technology
    Identifiers
    urn:nbn:se:oru:diva-15264 (URN)10.1109/IPDPS.2011.147 (DOI)978-1-61284-425-1 (ISBN)
    Conference
    Reconfigurable Architectures Workshop (RAW'2011) in conjunction with International Parallel and Distributed Processing Symposium (IPDPS'2011), Shanghai, 16-20 May 2011
    Available from: 2011-03-22 Created: 2011-04-14 Last updated: 2017-10-18Bibliographically approved
  • 789.
    Zain-ul-Abdin,
    et al.
    Örebro University, School of Science and Technology.
    Ahlander, Anders
    Svensson, Bertil
    Högskolan i Halmstad.
    Programming real-time autofocus on a massively parallel reconfigurable architecture using Occam-pi2011In: Proceedings of the 19th Annual IEEE International Symposium on Field-Programmable Custom Computing Machines (FCCM 2011), IEEE conference proceedings, 2011, 194-201 p.Conference paper (Other academic)
    Abstract [en]

    Recently we proposed occam-pi as a high-level language for programming massively parallel reconfigurable architectures. The design of occam-pi incorporates ideas from CSP and pi-calculus to facilitate expressing parallelism and reconfigurability. The feasability of this approach was illustratedby building three occam-pi implementations of DCT executing on an Ambric. However, because DCT is a simple and well studied algorithm it remained uncertain whether occam-pi would also be effective for programming novel, more complex algorithms.

    In this paper, we demonstrate the applicability of occam-pi for expressing various degrees of parallelism by implementinga significantly large case-study of focus criterion calculation inan autofocus algorithm on the Ambric architecture. Autofocus is a key component of synthetic aperture radar systems. Two implementations of focus criterion calculation were developedand evaluated on the basis of performance. The comparison of the performance results with a single threaded software implementation of the same algorithm show that the throughput of the two implementations are 11x and 23x higher than the sequential implementation despite a much lower (9x) clock frequency. The two designs are, respectively, 29x and 40x moreenergy efficient.

  • 790.
    Zain-ul-Abdin,
    et al.
    Örebro University, School of Science and Technology.
    Svensson, Bertil
    Halmstad University, School of Information Science, Computer and Electrical Engineering (IDE).
    A Study of Design Efficiency with a High-Level Language for FPGAs2007In: Proceedings of the 14th International Reconfigurable Architectures Workshop (RAW'07), Piscataway, N.J.: IEEE , 2007, 1-7 p.Conference paper (Refereed)
    Abstract [en]

    Over the years reconfigurable computing devices such as FPGAs have evolved from gate-level glue logic to complex reprogrammable processing architectures. However, the tools used for mapping computations to such architectures still require the knowledge about architectural details of the target device to extract efficiency. A study of the Mobius language and tools is presented in this paper, with a focus on generated hardware performance. A number of streaming and memory-intensive applications have been developed and the results have been compared with the corresponding implementations in VHDL and a behavioral hardware description language. Based upon experimental evidences, it is concluded that Mobius, a minimal parallel processing language targeted for reconfigurable architectures, enhances productivity in terms of design time and code maintainability without considerably compromising performance and resources.

  • 791.
    Zain-ul-Abdin,
    et al.
    Örebro University, School of Science and Technology.
    Svensson, Bertil
    Halmstad University, School of Information Technology, Halmstad Embedded and Intelligent Systems Research (EIS), Embedded Systems (CERES).
    Evolution in architectures and programming methodologies of coarse-grained reconfigurable computing2009In: Microprocessors and microsystems, ISSN 0141-9331, E-ISSN 1872-9436, Vol. 33, no 3, 161-178 p.Article in journal (Refereed)
    Abstract [en]

    In order to meet the increased computational demands of, e.g., multimedia applications, such as video processing in HDTV, and communication applications, such as baseband processing in telecommunication systems, the architectures of reconfigurable devices have evolved to coarse-grained compositions of functional units or program controlled processors, which are operated in a coordinated manner to improve performance and energy efficiency.

    In this survey we explore the field of coarse-grained reconfigurable computing on the basis of the hardware aspects of granularity, reconfigurability, and interconnection networks, and discuss the effects of these on energy related properties and scalability. We also consider the computation models that are being adopted for programming of such machines, models that expose the parallelism inherent in the application in order to achieve better performance. We classify the coarse-grained reconfigurable architectures into four categories and present some of the existing examples of these categories. Finally, we identify the emerging trends of introduction of asynchronous techniques at the architectural level and the use of nano-electronics from technological perspective in the reconfigurable computing discipline.

  • 792.
    Zain-ul-Abdin,
    et al.
    Örebro University, School of Science and Technology.
    Svensson, Bertil
    Halmstad University, School of Information Technology, Halmstad Embedded and Intelligent Systems Research (EIS), Embedded Systems (CERES).
    Specifying Run-time Reconfiguration in Processor Arrays using High-level language2010In: WRC 2010: 4th HiPEAC Workshop on Reconfigurable Computing, Pisa, 2010, 1-10 p.Conference paper (Refereed)
    Abstract [en]

    The adoption of run-time reconfigurable parallel architectures for high-performance embedded systems is constrained by the lackof a unified programming model which can express both parallelism and reconfigurability. We propose to program an emerging class of reconfigurable processor arrays by using the programming model of occam-pi and describe how the extensions of channel direction specifiers, mobile data, dynamic process invocation, and process placement attributes can be used to express run-time reconfiguration in occam-pi. We present implementations of DCT algorithm to demonstrate the applicability of occam-pi to express reconfigurability. We concluded that occam-pi appears to be a suitable programming model for programming run-time reconfigurable processor arrays.

  • 793.
    Zhang, Liwei
    et al.
    University of Hamburg, Germany.
    Saffiotti, Alessandro
    Örebro University, School of Science and Technology.
    Pecora, Federico
    Örebro University, School of Science and Technology.
    Zhang, Jianwei
    University of Hamburg, Germany.
    Evaluation metrics for an experience-based mobile artificial cognitive system2014In: 11th World Congress on Intelligent Control and Automation (WCICA2014), Springer Berlin/Heidelberg, 2014, 2225-2232 p.Conference paper (Refereed)
    Abstract [en]

    In this paper, an FIM (Fitness to Ideal Model)and a DLen (Description Length) based evaluation approachhas been developed to measure the benefit of learning from experienceto improve the robustness of the robot’s behavior. Theexperience based mobile artificial cognitive system architectureis briefly described and adopted by a PR2 service robot withinthe EU-FP7 funded project RACE. The robot conducts typicaltasks of a waiter. Temporal and lasting obstacles and standardtable items, as shown in the demonstrations of “Deal-withobstacles”and “Clear-table-intelligently”, are being adoptedin this work to test the proposed evaluation metrics, validateit on a real PR2 robot system and present the evaluationresults. The relationship between the FIM and DLen has beenvalidated. This work proposes an effective approach to evaluatea cognitive service robot system which enhances its performanceby learning.

  • 794.
    Zhang, Yue
    et al.
    MoE Engineering Research Center for Software/Hardware Co-Design Technology and Application, East China Normal University, Shanghai, China; National Trusted Embedded Software Engineering Technology Research Center (No. 2012FU125X15), Shanghai, China.
    Dragoni, Nicola
    Örebro University, School of Science and Technology. DTU Compute, Technical University of Denmark, Richard Petersens Plads, Kongens Lyngby, Denmark.
    Wang, Jiangtao
    MoE Engineering Research Center for Software/Hardware Co-Design Technology and Application, East China Normal University, Shanghai, China; National Trusted Embedded Software Engineering Technology Research Center (No. 2012FU125X15), Shanghai, China.
    A Framework and Classification for Fault Detection Approaches in Wireless Sensor Networks with an Energy Efficiency Perspective2015In: International Journal of Distributed Sensor Networks, ISSN 1550-1329, E-ISSN 1550-1477, 678029Article, review/survey (Refereed)
    Abstract [en]

    Wireless Sensor Networks (WSNs) are more and more considered a key enabling technology for the realisation of the Internet of Things (IoT) vision. With the long term goal of designing fault-tolerant IoT systems, this paper proposes a fault detection framework for WSNs with the perspective of energy efficiency to facilitate the design of fault detection methods and the evaluation of their energy efficiency. Following the same design principle of the fault detection framework, the paper proposes a classification for fault detection approaches. The classification is applied to a number of fault detection approaches for the comparison of several characteristics, namely, energy efficiency, correlation model, evaluation method, and detection accuracy. The design guidelines given in this paper aim at providing an insight into better design of energy-efficient detection approaches in resource-constraint WSNs.

  • 795.
    Öjebo, Erik
    Örebro University, School of Science and Technology.
    Objekt-relationsmappning i datacentrerad applikation2009Independent thesis Basic level (professional degree), 10 credits / 15 HE creditsStudent thesis
    Abstract [en]

    This report presents a study of six different object-relational mapping frameworks, namely Entity Framework, LINQ to SQL, NHibernate, Castle ActiveRecord, MyGeneration Doodads and Subsonic. The study describes the strengths and weaknesses of the various frameworks and discusses when each framework is appropriate to use.

    The frameworks that were judged to be the most interesting were NHibernate and Entity Framework, since they provide flexible mapping between the domain model and the underlying database schema as well as good availability of documentation and literature.

    The study was used as a basis for deciding which of the frameworks that should be used in a rewrite of an existing application for the IT consulting company Sogeti. The framework that was considered the most appropriate for the application was NHibernate.

13141516 751 - 795 of 795
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