Change search
Refine search result
12 1 - 50 of 85
CiteExportLink to result list
Permanent link
Cite
Citation style
  • apa
  • harvard1
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf
Rows per page
  • 5
  • 10
  • 20
  • 50
  • 100
  • 250
Sort
  • Standard (Relevance)
  • Author A-Ö
  • Author Ö-A
  • Title A-Ö
  • Title Ö-A
  • Publication type A-Ö
  • Publication type Ö-A
  • Issued (Oldest first)
  • Issued (Newest first)
  • Created (Oldest first)
  • Created (Newest first)
  • Last updated (Oldest first)
  • Last updated (Newest first)
  • Disputation date (earliest first)
  • Disputation date (latest first)
  • Standard (Relevance)
  • Author A-Ö
  • Author Ö-A
  • Title A-Ö
  • Title Ö-A
  • Publication type A-Ö
  • Publication type Ö-A
  • Issued (Oldest first)
  • Issued (Newest first)
  • Created (Oldest first)
  • Created (Newest first)
  • Last updated (Oldest first)
  • Last updated (Newest first)
  • Disputation date (earliest first)
  • Disputation date (latest first)
Select
The maximal number of hits you can export is 250. When you want to export more records please use the Create feeds function.
  • 1.
    Birk, Wolfgang
    et al.
    Luleå University of Technology, Department of Computer Science, Electrical and Space Engineering, Signals and Systems.
    Eliasson, Jens
    Luleå University of Technology, Department of Computer Science, Electrical and Space Engineering, Embedded Internet Systems Lab.
    Lindgren, Per
    Luleå University of Technology, Department of Computer Science, Electrical and Space Engineering, Embedded Internet Systems Lab.
    Osipov, Evgeny
    Luleå University of Technology, Department of Computer Science, Electrical and Space Engineering, Computer Science.
    Riliskis, Laurynas
    Luleå University of Technology, Department of Computer Science, Electrical and Space Engineering, Computer Science.
    Road surface networks technology enablers for enhanced ITS2010In: 2010 IEEE Vehicular Networking Conference, VNC 2010: Jersey City, NJ ; 13-15 Dec 2010, Piscataway, NJ: IEEE Communications Society, 2010, p. 152-159Conference paper (Refereed)
    Abstract [en]

    The increased need for mobility has led to transportation problems like congestion, accidents and pollution. In order to provide safe and efficient transport systems great efforts are currently being put into developing Intelligent Transport Systems (ITS) and cooperative systems. In this paper we extend proposed solutions with autonomous on-road sensors and actuators forming a wireless Road Surface Network (RSN). We present the RSN architecture and design methodology and demonstrate its applicability to queue-end detection. For the use case we discuss the requirements and technological solutions to sensor technology, data processing and communication. In particular the MAC protocol is detailed and its performance assessed through theoretical verification. The RSN architecture is shown to offer a scalable solution, where increased node density offers more precise sensing as well as increased redundancy for safety critical applications. The use-case demonstrates that RSN solutions may be deployed as standalone systems potentially integrated into current and future ITS. RSN may provide both easily deployable and cost effective alternatives to traditional ITS (with a direct impact independent of penetration rate of other ITS infrastructures - i.e., smart vehicles, safe spots etc.) as well as provide fine grain sensory information directly from the road surface to back-end and cooperative systems, thus enabling a wide range of ITS applications beyond current state of the art.

  • 2.
    Birk, Wolfgang
    et al.
    Luleå University of Technology, Department of Computer Science, Electrical and Space Engineering, Signals and Systems.
    Hostettler, Roland
    Luleå University of Technology, Department of Computer Science, Electrical and Space Engineering, Distance- Spanning Technology.
    Lundberg Nordenvaad, Magnus
    Luleå University of Technology, Department of Business Administration, Technology and Social Sciences, Business Administration and Industrial Engineering.
    Eliasson, Jens
    Luleå University of Technology, Department of Computer Science, Electrical and Space Engineering, Embedded Internet Systems Lab.
    Gylling, Arne
    Luleå University of Technology, Department of Computer Science, Electrical and Space Engineering, Distance- Spanning Technology.
    Delsing, Jerker
    Luleå University of Technology, Department of Computer Science, Electrical and Space Engineering, Embedded Internet Systems Lab.
    Osipov, Evgeny
    Luleå University of Technology, Department of Computer Science, Electrical and Space Engineering, Embedded Internet Systems Lab.
    Mäkitaavola, Henrik
    Project: iRoad2011Other (Other (popular science, discussion, etc.))
  • 3.
    Birk, Wolfgang
    et al.
    Luleå University of Technology, Department of Computer Science, Electrical and Space Engineering, Signals and Systems.
    Osipov, Evgeny
    Luleå University of Technology, Department of Computer Science, Electrical and Space Engineering, Computer Science.
    On the design of cooperative road infrastructure systems2008In: Reglermöte 2008: proceedings / [ed] Thomas Gustafsson; Wolfgang Birk; Andreas Johansson, Luleå: Luleå tekniska universitet, 2008Conference paper (Other academic)
    Abstract [en]

    This paper discusses the design of cooperative road infrastructure systems for infrastructure-based driving support functions. The background of such systems is mapped out and it is shown that there is a need for a cross disciplinary approach. Using an example of a support function, namely the overtaking support, it is shown that such a system is feasible. The different challenges and technological problems that are identified are given and the future work is indicated.

  • 4.
    Birk, Wolfgang
    et al.
    Luleå University of Technology, Department of Computer Science, Electrical and Space Engineering, Signals and Systems.
    Osipov, Evgeny
    Luleå University of Technology, Department of Computer Science, Electrical and Space Engineering, Computer Science.
    Eliasson, Jens
    Luleå University of Technology, Department of Computer Science, Electrical and Space Engineering, Embedded Internet Systems Lab.
    iRoad - cooperative road infrastructure systems for driver support2009In: 16th World Congress and Exhibition on Intelligent Transport Systems 2009: 16th ITS World Congress ; Stockholm, Sweden, 21 - 25 September 2009, Red Hook: Curran Associates, Inc., 2009Conference paper (Refereed)
    Abstract [en]

    This paper discusses the design and implementation of a cooperative road infrastructure systems, which uses an intelligent road surface. Using an overtaking assist feature as an example it is shown how such a feature can be designed and implemented on a road infrastructure and integrated with drivers and passengers using IMS. The feasibility of this feature is assessed from a functional and communication perspective. Moreover, first results from real-life tests on the Swedish highway E4 are presented which motivate the next research and development steps.

  • 5.
    Birk, Wolfgang
    et al.
    Luleå University of Technology, Department of Computer Science, Electrical and Space Engineering, Signals and Systems.
    Osipov, Evgeny
    Luleå University of Technology, Department of Computer Science, Electrical and Space Engineering, Computer Science.
    Riliskis, Laurynas
    Luleå University of Technology, Department of Computer Science, Electrical and Space Engineering, Computer Science.
    Hesler, Alban
    NEC.
    Modular design and performance ranking of communication protocols2009Report (Other academic)
    Abstract [en]

    In this deliverable we present a systematic approach towards designing modularized protocols and rank a contribution of their components to the overall system performance. In the nutshell, this approach is based onthree steps: 1.) identifying adjustable parameters in existing protocols, 2.) ranking their influence on the system-level performance metrics and 3.) defining protocol modules exposing the parameters of the highest rank. To this end we present the definition of the components for constructing MAC protocols based on ranking of the impact of adjustable parameters on the overall system performance. We also overview a ranking method for functional blocks of protocols on the routing layer.

  • 6.
    Buttyan, Levente
    et al.
    BME.
    Acs, Gergely
    BME.
    Schaffer, Peter
    BME.
    Farkas, Karoly
    BME.
    Bencsath, Boldizsar
    BME.
    Thong, Ta Vinh
    BME.
    Laszka, Aron
    BME.
    Grilo, Antonio
    INOV.
    Hessler, Alban
    NEC.
    Riliskis, Laurynas
    Luleå University of Technology, Department of Computer Science, Electrical and Space Engineering, Computer Science.
    Osipov, Evgeny
    Luleå University of Technology, Department of Computer Science, Electrical and Space Engineering, Computer Science.
    Perito, Daniele
    INRIA.
    Castelluccia, Claude
    INRIA.
    Dependability concepts, models, and analysis of networking mechanisms for WSANs2009Report (Other academic)
    Abstract [en]

    In this deliverable, we report on the results of Work Package 3 (Dependable Networking) obtained in the first year of the WSAN4CIP Project. These results are related to the identification of the design principles of dependable networking mechanisms for WSANs. In our work, and hence, in this deliverable, we follow the layered model of networking protocol stacks: We identify the most important dependability concepts and models at the physical, MAC (Medium Access Control), routing, and transport layers, and we analyze existing networking protocols from the different layers proposed in the literature with respect to the identified dependability properties.

  • 7.
    Chaltseva, Anna
    et al.
    Luleå University of Technology, Department of Computer Science, Electrical and Space Engineering, Computer Science.
    Osipov, Evgeny
    Luleå University of Technology, Department of Computer Science, Electrical and Space Engineering, Computer Science.
    Empirical cross-layer model of TCP throughput in multihop wireless chain2010Report (Other academic)
    Abstract [en]

    Analysis of TCP throughput in multihop wireless networks is a continuously important research topic. Yet a neat and practically useful formula for the TCP transfer rate similar to the macroscopic model of TCP in the Internet, however, capturing the cross-layer dependencies is unavailable for wireless networks. In this paper we statistically analyze the significance of parameters on physical, MAC and transport layers in a multihop wireless chains and derive a practically usable cross-layer throughput formula. The resulting model allows estimation of the throughput with less than 2% error.

  • 8.
    Chaltseva, Anna
    et al.
    Luleå University of Technology, Department of Computer Science, Electrical and Space Engineering, Computer Science.
    Osipov, Evgeny
    Luleå University of Technology, Department of Computer Science, Electrical and Space Engineering, Computer Science.
    Empirical predictor of TCP throughput on a multihop wireless path2010In: Smart spaces and next generation Wired/Wireless networking: third Conference on Smart Spaces, ruSMART 2010, and 10th international conference, NEW2AN 2010, St. Petersburg, Russia, August 23-25, 2010 ; proceedings / [ed] Sergey Balandin; Roman Dunaytsev; Yevgeni Koucheryavy, Encyclopedia of Global Archaeology/Springer Verlag, 2010, p. 323-334Conference paper (Refereed)
    Abstract [en]

    This paper addresses a question of predicting TCP throughput over a multihop wireless path. Since it is useful for a variety of applications it is desirable that TCP throughput prediction technique introduces low-overhead while avoiding active measurement techniques. Analytical derivation of the throughput predictor for multihop wireless networks is difficult if not impossible at all due to complex cross-layer dependencies. In this article we statistically analyze the significance of parameters on physical, MAC and transport layers in a multihop wireless chain and empirically derive a practically usable throughput predictor. The resulting model allows prediction of the throughput with less than 2% error.

  • 9.
    Chaltseva, Anna
    et al.
    Luleå University of Technology, Department of Computer Science, Electrical and Space Engineering, Computer Science.
    Osipov, Evgeny
    Luleå University of Technology, Department of Computer Science, Electrical and Space Engineering, Computer Science.
    On passive characterization of aggregated traffic in wireless networks2011Report (Other academic)
    Abstract [en]

    We present a practical measurement-based model of aggregated traffic intensity on microseconds time scale for wireless networks. The model allows estimating the traffic intensity for the period of time required to transmit data structures of different size (short control frames and a data packet of the maximum size). The presented model opens a possibility to mitigate the effect of interferences in the network by optimizing the communication parameters of the MAC layer (e.g. size of contention window, retransmission strategy, etc.) for the forthcoming transmission to minimize the packet collision probability and further increase network's capacity. We also discuss issues and challenges associated with PHY-layer characterization of the network state.

  • 10.
    Chaltseva, Anna
    et al.
    Luleå University of Technology, Department of Computer Science, Electrical and Space Engineering, Computer Science.
    Osipov, Evgeny
    Luleå University of Technology, Department of Computer Science, Electrical and Space Engineering, Computer Science.
    On passive characterization of aggregated traffic in wireless networks2012In: Wired/Wireless Internet Communication: 10th International Conference, WWIC 2012, Proceedings, New York: Encyclopedia of Global Archaeology/Springer Verlag, 2012, p. 282-289Conference paper (Refereed)
    Abstract [en]

    We present a practical measurement-based characterization of the aggregated traffic on microseconds time scale in wireless networks. The model allows estimating the channel utilization for the period of time required to transmit data structures of different sizes (short control frames and a data packet of the maximum size). The presented model opens a possibility to mitigate the effect of interferences in the network by optimizing the communication parameters of the MAC layer (e.g. the size of contention window, retransmission strategy, etc.) for the forthcoming transmission. The article discusses issues and challenges associated with the PHY-layer characterization of the network state.

  • 11.
    Dai, William
    et al.
    Luleå University of Technology, Department of Computer Science, Electrical and Space Engineering, Computer Science.
    Riliskis, Laurynas
    Vyatkin, Valeriy
    Luleå University of Technology, Department of Computer Science, Electrical and Space Engineering, Computer Science.
    Osipov, Evgeny
    Luleå University of Technology, Department of Computer Science, Electrical and Space Engineering, Computer Science.
    Delsing, Jerker
    Luleå University of Technology, Department of Computer Science, Electrical and Space Engineering, Embedded Internet Systems Lab.
    A Configurable Cloud-Based Testing Infrastructure for Interoperable Distributed Automation Systems2015In: IECON 2014: 40th Annual Conference of the IEEE Industrial Electronics Society, Dallas, TX, USA , Oct. 29 2014-Nov. 1 2014, Piscataway, NJ: IEEE Communications Society, 2015, p. 2492-2498Conference paper (Refereed)
    Abstract [en]

    The interoperability between various automation systems is considered as one of the major character of future automation systems. Service-oriented Architecture is a possible interoperability enabler between legacy and future automation systems. In order to prove the interoperability between those systems, a verification framework is essential. This paper proposes a configurable cloud-based validation environment for interoperability tests between various distributed automation systems. The testing framework is implemented in a multi-layer structure which provides automated closed-loop testing from the protocol level to the system level. The testing infrastructure is also capable for simulating automation systems as well as wireless sensor networks in the cloud. Test cases could be automatically generated and executed by the framework.

  • 12.
    de Silva, D.
    et al.
    Research Centre for Data Analytics and Cognition, La Trobe University, Bundoora, Australia.
    Pang, Z.
    ABB Corporate Research, Västeras, Sweden.
    Osipov, Evgeny
    Luleå University of Technology, Department of Computer Science, Electrical and Space Engineering, Computer Science.
    Vyatkin, Valeriy
    Luleå University of Technology, Department of Computer Science, Electrical and Space Engineering, Computer Science. Department of Electrical Engineering and Automation, Aalto University, Helsinki, Finland.
    Guest Editorial: Special Section on Developments in Artificial Intelligence for Industrial Informatics2019In: IEEE Transactions on Industrial Informatics, ISSN 1551-3203, E-ISSN 1941-0050, Vol. 15, no 6, p. 3690-3692Article in journal (Refereed)
    Abstract [en]

    The emergence of artificial intelligence (AI), empowered by robust computing infrastructure and abundance of data, maintains potential for radical transformation of human society, essentially a third phase in evolution. Numerous research endeavor, policy development, and thought-leadership are presently in progress aimed at discovering data-driven intelligent decision-making solutions for smart cities, smart grids, smart homes, and informed citizens as well as addressing potential risks posed by AI workplace automation. Joining this broad effort, this Special Section contributes six research articles that consolidate recent developments in AI for industrial informatics.

  • 13.
    De Silva, Daswin
    et al.
    Research Centre for Data Analytics and Cognition, La Trobe University, Victoria, Australia..
    Ranasinghe, Weranja
    Research Centre for Data Analytics and Cognition, La Trobe University, Victoria, Australia..
    Bandaragoda, Tharindu
    Research Centre for Data Analytics and Cognition, La Trobe University, Victoria, Australia..
    Adikari, Achini
    Research Centre for Data Analytics and Cognition, La Trobe University, Victoria, Australia..
    Mills, Nishan
    Research Centre for Data Analytics and Cognition, La Trobe University, Victoria, Australia..
    Iddamalgoda, Lahiru
    Research Centre for Data Analytics and Cognition, La Trobe University, Victoria, Australia..
    Alahakoon, Damminda
    Research Centre for Data Analytics and Cognition, La Trobe University, Victoria, Australia..
    Lawrentschuk, Nathan
    Austin Hospital, Heidelberg, Victoria, Australia..
    Persad, Raj
    North Bristol, NHS Trust, Bristol, United Kingdom..
    Osipov, Evgeny
    Luleå University of Technology, Department of Computer Science, Electrical and Space Engineering, Computer Science.
    Gray, Richard
    School of Nursing and Midwifery, La Trobe University, Victoria, Australia..
    Bolton, Damien
    Austin Hospital, Heidelberg, Victoria, Australia..
    Machine learning to support social media empowered patients in cancer care and cancer treatment decisions2018In: PLoS ONE, ISSN 1932-6203, E-ISSN 1932-6203, Vol. 13, no 10, article id e0205855Article in journal (Refereed)
    Abstract [en]

    BACKGROUND

    A primary variant of social media, online support groups (OSG) extend beyond the standard definition to incorporate a dimension of advice, support and guidance for patients. OSG are complementary, yet significant adjunct to patient journeys. Machine learning and natural language processing techniques can be applied to these large volumes of unstructured text discussions accumulated in OSG for intelligent extraction of patient-reported demographics, behaviours, decisions, treatment, side effects and expressions of emotions. New insights from the fusion and synthesis of such diverse patient-reported information, as expressed throughout the patient journey from diagnosis to treatment and recovery, can contribute towards informed decision-making on personalized healthcare delivery and the development of healthcare policy guidelines.

    METHODS AND FINDINGS

    We have designed and developed an artificial intelligence based analytics framework using machine learning and natural language processing techniques for intelligent analysis and automated aggregation of patient information and interaction trajectories in online support groups. Alongside the social interactions aspect, patient behaviours, decisions, demographics, clinical factors, emotions, as subsequently expressed over time, are extracted and analysed. More specifically, we utilised this platform to investigate the impact of online social influences on the intimate decision scenario of selecting a treatment type, recovery after treatment, side effects and emotions expressed over time, using prostate cancer as a model. Results manifest the three major decision-making behaviours among patients, Paternalistic group, Autonomous group and Shared group. Furthermore, each group demonstrated diverse behaviours in post-decision discussions on clinical outcomes, advice and expressions of emotion during the twelve months following treatment. Over time, the transition of patients from information and emotional support seeking behaviours to providers of information and emotional support to other patients was also observed.

    CONCLUSIONS

    Findings from this study are a rigorous indication of the expectations of social media empowered patients, their potential for individualised decision-making, clinical and emotional needs. The increasing popularity of OSG further confirms that it is timely for clinicians to consider patient voices as expressed in OSG. We have successfully demonstrated that the proposed platform can be utilised to investigate, analyse and derive actionable insights from patient-reported information on prostate cancer, in support of patient focused healthcare delivery. The platform can be extended and applied just as effectively to any other medical condition.

  • 14.
    Dudin, Alexander
    et al.
    BSU.
    Osipov, Evgeny
    Luleå University of Technology, Department of Computer Science, Electrical and Space Engineering, Computer Science.
    Dudin, Sergey
    BSU.
    Schelén, Olov
    Luleå University of Technology, Department of Computer Science, Electrical and Space Engineering, Computer Science.
    Socio-behavioral scheduling of time-frequency resources for modern mobile operators2013In: Modern Probabilistic Methods for Analysis of Telecommunication Networks: Belarusian Winter Workshops in Queueing Theory, BWWQT 2013, Minsk, Belarus, January 28-31, 2013. Proceedings, Berlin: Encyclopedia of Global Archaeology/Springer Verlag, 2013, p. 69-82Conference paper (Refereed)
    Abstract [en]

    This article presents a mathematical foundation for scheduling of batch data produced by mobile end users over the time-frequency resources provided by modern mobile operators. We model the mobile user behavior by Batch Markovian Arrival Process, where a state corresponds to a specific user data activity (i.e. sending a photo, writing a blog message, answering an e-mail etc). The state transition is marked by issuing a batch of data of the size typical to the activity. To model the changes of user behavior caused by the environment, we introduce a random environment which affects the intensities of transitions between states (i.e., the probabilities of the user data activities). The model can be used for calculating probability of packet loss and probability of exceeding the arbitrarily fixed value by the sojourn time of a packet in the system conditional that the packet arrives to the system at moments when the random environment has a given state. This allows to compute the realistic values of these probabilities and can help to properly fix their values that can be guaranteed, depending on the state of the random environment, by a service provider

  • 15.
    Elkotob, Muslim
    et al.
    Luleå University of Technology, Department of Computer Science, Electrical and Space Engineering.
    Osipov, Evgeny
    Luleå University of Technology, Department of Computer Science, Electrical and Space Engineering, Computer Science.
    Enabling communication service reconfigurability via guided cross layering2009Report (Other academic)
    Abstract [en]

    A system architecture which natively supports cross-layer design in a general sense is an essential prerequisite for enabling communication services in the future heterogeneous Internet. A multitude of cross-layer approaches ranging from clean slate designs to actual implementations of cross-layer links in the standard TCP/IP stack have been suggested during the last decade. Yet, there is no agreement on a systematic integration of cross-layering into the actual Internet architecture. In this article we present a Guided Cross-layering Framework and a roadmap for its deployment in the Internet. We elaborate its key issue of identifying functional invariants in the present communication model. The invariants are the clean protocol stubs of the current TCP/IP stack. We describe the concept of meta-protocols and a design-deployment methodology for the framework. Our main postulate that promises an acceptance of the proposed architecture is the evolutionary, market-driven transformation of the current Internet architecture. On the example of the new ICSP (Integrated Communication and Signaling Protocol) protocol, we demonstrate the integration of CARD (Candidate Access Router Discovery), MIP (Mobile IP), and SIP (Session Initiation Protocol) in our framework which jointly optimize the performance and economic utilities of a multi-cell wireless network operator and the end user.

  • 16. Elkotob, Muslim
    et al.
    Osipov, Evgeny
    Luleå University of Technology, Department of Computer Science, Electrical and Space Engineering, Computer Science.
    iRide: a cooperative sensor and IP multimedia subsystem based architecture and application for ITS road safety2009In: Communications Infrastructure, Systems and Applications: First International ICST Conference, EuropeComm 2009, London, UK, August 11-13, 2009, Revised Selected Papers / [ed] R. Mehmood, Berlin: Encyclopedia of Global Archaeology/Springer Verlag, 2009Conference paper (Refereed)
    Abstract [en]

    In this paper we present iRide (intelligent ride), an IP Multimedia Subsystem (IMS) application for warning drivers about hazardous situations on the road. iRide takes real-time information about road conditions and traffic situations from a wireless sensor network installed directly in the road surface. Upon logging to the iRide system, users start to receive periodic updates about the situation on the road along their route ahead. iRide is able to predict hazardous situations like slippery surface or dangerous distance to the nearest car and help drivers avoid accidents. We describe the service and the supporting network architecture of iRide. We discuss the major challenges associated with designing an IMS application for ITS, an intelligent transport system. Having a prototype implementation working on a small scale, we take it to the next step to perform system dimensioning and then verify the feasibility of having such a system using OPNET simulations.

  • 17. Granlund, Daniel
    et al.
    Gylling, Arne
    Luleå University of Technology, Department of Computer Science, Electrical and Space Engineering, Distance- Spanning Technology.
    Åhlund, Christer
    Luleå University of Technology, Department of Computer Science, Electrical and Space Engineering, Computer Science.
    Osipov, Evgeny
    Luleå University of Technology, Department of Computer Science, Electrical and Space Engineering, Computer Science.
    Brännström, Robert
    Luleå University of Technology, Department of Computer Science, Electrical and Space Engineering, Computer Science.
    Jacquier, Anna
    Elkotob, Muslim
    Luleå University of Technology, Department of Computer Science, Electrical and Space Engineering, Distance- Spanning Technology.
    Åhl, Anneli
    Project: BASICNET2008Other (Other (popular science, discussion, etc.))
    Abstract [en]

    Broadband Access Services In Converging NETworks

  • 18.
    Gritsenko, Vladimir I.
    et al.
    International Research and Training Center for Information Technologies and Systems of the NAS of Ukraine and of Ministry of Education and Science of Ukraine.
    Rachkovskij, Dmitri A.
    International Research and Training Center for Information Technologies and Systems of the NAS of Ukraine and of Ministry of Education and Science of Ukraine.
    Frolov, Alexander A.
    Technical University of Ostrava.
    Gayler, Ross
    Kleyko, Denis
    Luleå University of Technology, Department of Computer Science, Electrical and Space Engineering, Computer Science.
    Osipov, Evgeny
    Luleå University of Technology, Department of Computer Science, Electrical and Space Engineering, Computer Science.
    Neural Distributed Autoassociative Memories: A Survey2017In: Cybernetics and Computer Engineering Journal, ISSN 0454-9910, Vol. 188, no 2, p. 5-35Article in journal (Refereed)
    Abstract [en]

    Introduction. Neural network models of autoassociative, distributed memory allow storage and retrieval of many items (vectors) where the number of stored items can exceed the vector dimension (the number of neurons in the network). This opens the possibility of a sublinear time search (in the number of stored items) for approximate nearest neighbors among vectors of high dimension.

    The purpose of this paper is to review models of autoassociative, distributed memory that can be naturally implemented by neural networks (mainly with local learning rules and iterative dynamics based on information locally available to neurons).

    Scope. The survey is focused mainly on the networks of Hopfield, Willshaw and Potts, that have connections between pairs of neurons and operate on sparse binary vectors. We discuss not only autoassociative memory, but also the generalization properties of these networks. We also consider neural networks with higher-order connections and networks with a bipartite graph structure for non-binary data with linear constraints.

    Conclusions. In conclusion we discuss the relations to similarity search, advantages and drawbacks of these techniques, and topics for further research. An interesting and still not completely resolved question is whether neural autoassociative memories can search for approximate nearest neighbors faster than other index structures for similarity search, in particular for the case of very high dimensional vectors. 

  • 19.
    Jardak, Christine
    et al.
    RWTH Aachen University.
    Osipov, Evgeny
    Luleå University of Technology, Department of Computer Science, Electrical and Space Engineering, Computer Science.
    Mähönen, Petri
    RWTH Aachen University.
    Distributed information storage and collection for WSNs2007In: Proceedings, 4th IEEE International Conference on Mobile Ad-hoc and Sensor Systems, Piscataway, NJ: IEEE Communications Society, 2007Conference paper (Refereed)
    Abstract [en]

    Distributed data storage is an important component of wireless sensor networks, which protects the mission critical information from unexpected node failures or malicious destruction of parts of the network. In this paper we present DISC, a protocol for distributed information storage and collection. The two major mechanisms in DISC which make our solution distinct from the related approaches are probabilistic choice of storing nodes and a search engine based on the usage of Bloom filters. In comparison to the deterministic choice of the backup node, the random selection strategy makes it virtually impossible for an attacker to determine and destroy the exact node keeping a particular piece of information. The usage of Bloom filters in the information search engine makes the navigation to a specific data fast and efficient. We show that with DISC the amount of recovered information is more than two times higher than that in deterministic storage schemes.

  • 20. Johansson, Tomas
    et al.
    Osipov, Evgeny
    Luleå University of Technology, Department of Computer Science, Electrical and Space Engineering, Computer Science.
    Carr-Motyckova, Lenka
    Interference aware construction of multi- and convergecast trees in wireless sensor networks2008In: Next Generation Teletraffic and Wired/Wireless Advanced Networking: 8th International Conference, NEW2AN 2008 and ruSMART, St. Petersburg, Russia, September 3-5, 2008 ; proceedings / [ed] Sergey Balandin; Dimitri Moltchanov; Yevgeni Koucheryavy, Berlin: Encyclopedia of Global Archaeology/Springer Verlag, 2008, p. 72-87Conference paper (Refereed)
    Abstract [en]

    In this paper we consider a problem of building a forwarding tree for multicast and convergecast traffic in short-range wireless sensor networks. Interference awareness and energy efficiency are the major design objectives for WSN protocols in order to maximize the network lifetime. The existing multicast algorithms aim at constructinglow-energy cost trees. Adding interference-awareness, however, leads to increased throughput and further reduces the energy consumption by avoiding unnecessary retransmissions due to interference-induced packetlosses. We propose a Localized Area-Spanning Tree (LAST) protocol for wireless short-range sensor networks. Unlike previous similar protocols, the LAST protocol reaches all the nodes in a given geographical area,rather than only specific individual nodes. When creating the tree, the protocol jointly optimizes the energy cost and the interference imposed by the structure.

  • 21.
    Khattak, Rabiullah
    et al.
    Luleå tekniska universitet.
    Chaltseva, Anna
    Luleå University of Technology, Department of Computer Science, Electrical and Space Engineering, Computer Science.
    Riliskis, Laurynas
    Luleå University of Technology, Department of Computer Science, Electrical and Space Engineering, Computer Science.
    Bodin, Ulf
    Luleå University of Technology, Department of Computer Science, Electrical and Space Engineering, Computer Science.
    Osipov, Evgeny
    Luleå University of Technology, Department of Computer Science, Electrical and Space Engineering, Computer Science.
    Comparison of wireless network simulators with multihop wireless network testbed in corridor environment2011In: Wired/wireless internet communications: 9th IFIP TC 6 International Conference, WWIC 2011, Vilanova i la Geltrú, Spain, June 15-17, 2011 ; proceedings / [ed] Xavier Masip-Bruin, Berlin: Encyclopedia of Global Archaeology/Springer Verlag, 2011, p. 80-91Conference paper (Refereed)
    Abstract [en]

    This paper presents a comparative study between results of a single channel multihop wireless network testbed and the network simulators ns-2 and ns-3. We explore how well these simulators reflect reality with their standard empirical radio modeling capabilities. The environment studied is a corridor causing wave-guiding propagation phenomena of radio waves, which challenges the radio models used in the simulators. We find that simulations are roughly matching with testbed results for single flows, but clearly deviate from testbed results for concurrent flows. The mismatch between simulations and testbed results is due to imperfect wireless propagation channel modeling. This paper reveals the importance of validating simulation results when studying single channel multihop wireless network performance. It further emphasizes the need for validation when using empirical radio modeling for more complex environments such as corridors.

  • 22.
    Kleyko, Denis
    et al.
    Luleå University of Technology, Department of Computer Science, Electrical and Space Engineering, Computer Science.
    Hostettler, Roland
    Luleå University of Technology, Department of Computer Science, Electrical and Space Engineering, Signals and Systems. Luleå University of Technology, Department of Computer Science, Electrical and Space Engineering, Distance- Spanning Technology.
    Birk, Wolfgang
    Luleå University of Technology, Department of Computer Science, Electrical and Space Engineering, Signals and Systems.
    Osipov, Evgeny
    Luleå University of Technology, Department of Computer Science, Electrical and Space Engineering, Computer Science.
    Comparison of Machine Learning Techniques for Vehicle Classification using Road Side Sensors2015In: Proceedings of the 2015 IEEE 18th International Conference on Intelligent Transportation Systems: Las Palmas, 15-18 Sept. 2015, Piscataway, NJ: IEEE Communications Society, 2015, p. 572-577, article id 7313192Conference paper (Refereed)
    Abstract [en]

    The main contribution of this paper is a comparison of different machine learning algorithms for vehicle classification according to the "Nordic system for intelligent classification of vehicles" standard using measurements of road surface vibrations and magnetic field disturbances caused by vehicles. The algorithms considered are logistic regression, neural networks, and support vector machines. They are evaluated on a large dataset, consisting of 3074 samples and hence, a good estimate of the actual classification rate is obtained. The results show that for the considered classification problem logistic regression is the best choice with an overall classification rate of 93.4%.

  • 23.
    Kleyko, Denis
    et al.
    Luleå University of Technology, Department of Computer Science, Electrical and Space Engineering, Computer Science.
    Hostettler, Roland
    Department of Electrical Engineering and Automation, Aalto University.
    Lyamin, Nikita
    School of Information Technology, Halmstad University.
    Birk, Wolfgang
    Luleå University of Technology, Department of Computer Science, Electrical and Space Engineering, Signals and Systems.
    Wiklund, Urban
    Department of Biomedical Engineering and Informatics, Umeå University.
    Osipov, Evgeny
    Luleå University of Technology, Department of Computer Science, Electrical and Space Engineering, Computer Science.
    Vehicle Classification using Road Side Sensors and Feature-free Data Smashing Approach2016In: 2016 IEEE 19th International Conference on Intelligent Transportation Systems (ITSC 2016), Piscataway, NJ: Institute of Electrical and Electronics Engineers (IEEE), 2016, p. 1988-1993, article id 7795877Conference paper (Refereed)
    Abstract [en]

    The main contribution of this paper is a study of the applicability of data smashing – a recently proposed data mining method – for vehicle classification according to the “Nordic system for intelligent classification of vehicles” standard, using measurements of road surface vibrations and magnetic field disturbances caused by passing vehicles. The main advantage of the studied classification approach is that it, in contrast to the most of traditional machine learning algorithms, does not require the extraction of features from raw signals. The proposed classification approach was evaluated on a large dataset consisting of signals from 3074 vehicles. Hence, a good estimate of the actual classification rate was obtained. The performance was compared to the previously reported results on the same problem for logistic regression. Our results show the potential trade-off between classification accuracy and classification method’s development efforts could be achieved.

  • 24.
    Kleyko, Denis
    et al.
    Luleå University of Technology, Department of Computer Science, Electrical and Space Engineering, Computer Science.
    Khan, Sumeer
    Luleå University of Technology, Department of Computer Science, Electrical and Space Engineering, Computer Science.
    Osipov, Evgeny
    Luleå University of Technology, Department of Computer Science, Electrical and Space Engineering, Computer Science.
    Yong, Suet-Peng
    Department of Computer and Information Sciences, Universiti Teknologi PETRONAS.
    Modality Classification of Medical Images with Distributed Representations Based on Cellular Automata Reservoir Computing2017In: Proceedings - International Symposium on Biomedical Imaging, Piscataway, NJ: Institute of Electrical and Electronics Engineers (IEEE), 2017, p. 1053-1056Conference paper (Refereed)
    Abstract [en]

    Modality corresponding to medical images is a vital filter in medical image retrieval systems. This article presents the classification of modalities of medical images based on the usage of principles of hyper-dimensional computing and reservoir computing. It is demonstrated that the highest classification accuracy of the proposed method is on a par with the best classical method for the given dataset (83% vs. 84%). The major positive property of the proposed method is that it does not require any optimization routine during the training phase and naturally allows for incremental learning upon the availability of new training data.

  • 25.
    Kleyko, Denis
    et al.
    Luleå University of Technology, Department of Computer Science, Electrical and Space Engineering, Computer Science.
    Lyamin, Nikita
    Halmstad University.
    Osipov, Evgeny
    Luleå University of Technology, Department of Computer Science, Electrical and Space Engineering, Computer Science.
    Modified algorithm of dynamic frequency hopping (DFH) in the IEEE 802.22 standard2014In: Multiple Access Communications: 7th International Workshop, MACOM 2014, Halmstad, Sweden, August 27-28, 2014. Proceedings / [ed] Magnus Jonsson; Alexey Vinel; Boris Bellalta; Evgeny Belyaev, New York: Encyclopedia of Global Archaeology/Springer Verlag, 2014, p. 75-83Conference paper (Refereed)
    Abstract [en]

    IEEE 802.22 Cognitive Wireless Regional Area Networks is a first standard of wireless terrestrial system relying on cognitive radio concept and operating as an opportunistic system in the the vacant unoccupied frequency spaces of the licensed TV-frequency band. Concept of the proposed standard assumes special functionality to protect the operation of the primary licensed subscribers. Dynamic Frequency Hopping is the mechanism for providing connectionless operation of Wireless Regional Area Networks systems while ensuring protection of transmissions from the primary users. During its operation regular time gaps appear on the involved frequency channels. This paper introduces the concept of the efficient reuse of the vacant frequency resources appearing when using the Dynamic Frequency Hopping mode. The scheme for consecutive-parallel inclusion of the new Dynamic Frequency Hopping Communities-members in the Dynamic Frequency Hopping mode is presented. The proposed approach allows to significantly decrease transition time.

  • 26.
    Kleyko, Denis
    et al.
    Luleå University of Technology, Department of Computer Science, Electrical and Space Engineering, Computer Science.
    Lyamin, Nikita
    Siberian State University of Telecommunications and Information Sciences.
    Osipov, Evgeny
    Luleå University of Technology, Department of Computer Science, Electrical and Space Engineering, Computer Science.
    Riliskis, Laurynas
    Luleå University of Technology, Department of Computer Science, Electrical and Space Engineering, Computer Science.
    Dependable MAC layer architecture based on holographic data representation using hyper-dimensional binary spatter codes2012In: Multiple Access Communications: 5th International Workshop, MACOM 2012, Maynooth, Ireland, November 19-20, 2012. Proceedings / [ed] Boris Bellalta, Heidelberg: Encyclopedia of Global Archaeology/Springer Verlag, 2012, p. 134-145Conference paper (Refereed)
    Abstract [en]

    In this article we propose the usage of binary spatter codes and distributed data representation for communicating loss and delay sensitive data in event-driven sensor and actuator networks. Using the proposed data representation technique along with the medium access control protocol the mission critical control information can be transmitted with assured constant delay in deployments exposing below 0 dB signal-to-noise ratio figures.

  • 27.
    Kleyko, Denis
    et al.
    Luleå University of Technology, Department of Computer Science, Electrical and Space Engineering, Computer Science.
    Osipov, Evgeny
    Luleå University of Technology, Department of Computer Science, Electrical and Space Engineering, Computer Science.
    Brain-like classifier of temporal patterns2014In: International Conference on Computer and Information Sciences, ICCOINS 2014, Kuala Lumpur, Malaysia, June 03-05, 2014. Proceedings, Piscataway, NJ: IEEE Communications Society, 2014, p. 1-6Conference paper (Refereed)
    Abstract [en]

    In this article we present a pattern classification system which uses Vector Symbolic Architecture (VSA) for representation, learning and subsequent classification of patterns, as a showcase we have used classification of vibration sensors measurements to vehicles types. On the quantitative side the proposed classifier requires only 1 kB of memory to classify an incoming signal against of several hundred of training samples. The classification operation into N types requires only 2*N+1 arithmetic operations this makes the proposed classifier feasible for implementation on a low-end sensor nodes. The main contribution of this article is the proposed methodology for representing temporal patterns with distributed representation and VSA-based classifier.

  • 28.
    Kleyko, Denis
    et al.
    Luleå University of Technology, Department of Computer Science, Electrical and Space Engineering, Computer Science.
    Osipov, Evgeny
    Luleå University of Technology, Department of Computer Science, Electrical and Space Engineering, Computer Science.
    No Two Brains Are Alike: Cloning a Hyperdimensional Associative Memory Using Cellular Automata Computations2017In: Biologically Inspired Cognitive Architectures (BICA) for Young Scientists: First International Early Research Career Enhancement School on BICA and Cybersecurity (FIERCES 2017) / [ed] Alexei V. Samsonovich, Valentin V. Klimov, Cham: Springer, 2017, p. 91-100Conference paper (Refereed)
    Abstract [en]

    This paper looks beyond of the current focus of research on biologically inspired cognitive systems and considers the problem of replication of its learned functionality. The considered challenge is to replicate the learned knowledge such that uniqueness of the internal symbolic representations is guaranteed. This article takes a neurological argument “no two brains are alike” and suggests an architecture for mapping a content of the trained associative memory built using principles of hyperdimensional computing and Vector Symbolic Architectures into a new and orthogonal basis of atomic symbols. This is done with the help of computations on cellular automata. The results of this article open a way towards a secure usage of cognitive architectures in a variety of practical application domains.

  • 29.
    Kleyko, Denis
    et al.
    Luleå University of Technology, Department of Computer Science, Electrical and Space Engineering, Computer Science.
    Osipov, Evgeny
    Luleå University of Technology, Department of Computer Science, Electrical and Space Engineering, Computer Science.
    On bidirectional transitions between localist and distributed representations: The case of common substrings search using Vector Symbolic Architecture2014In: Procedia Computer Science, ISSN 1877-0509, E-ISSN 1877-0509, Vol. 41, p. 104-113Article in journal (Refereed)
    Abstract [en]

    The contribution of this article is twofold. First, it presents an encoding approach for seamless bidirectional transitions between localist and distributed representation domains. Second, the approach is demonstrated on the example of using Vector Symbolic Architecture for solving a problem of finding common substrings. The proposed algorithm uses elementary operations on long binary vectors. For the case of two patterns with respective lengths L1 and L2 it requires Θ(L1 + L2 – 1) operations on binary vectors, which is equal to the suffix trees approach – the fastest algorithm for this problem. The simulation results show that in order to be robustly detected by the proposed approach the length of a common substring should be more than 4% of the longest pattern.

  • 30.
    Kleyko, Denis
    et al.
    Luleå University of Technology, Department of Computer Science, Electrical and Space Engineering, Computer Science.
    Osipov, Evgeny
    Luleå University of Technology, Department of Computer Science, Electrical and Space Engineering, Computer Science.
    Björk, Magnus
    Luleå tekniska universitet.
    Toresson, Henrik
    Luleå tekniska universitet.
    Öberg, Anton
    Luleå tekniska universitet.
    Fly-The-Bee: A game imitating concept learning in bees2015In: Procedia Computer Science, ISSN 1877-0509, E-ISSN 1877-0509, Vol. 71, p. 25-30Article in journal (Refereed)
    Abstract [en]

    This article presents a web-based game functionally imitating a part of the cognitive behavior of a living organism. This game is a prototype implementation of an artificial online cognitive architecture based on the usage of distributed data representations and Vector Symbolic Architectures. The game emonstrates the feasibility of creating a lightweight cognitive architecture, which is capable of performing rather complex cognitive tasks. The cognitive functionality is implemented in about 100 lines of code and requires few tens of kilobytes of memory for its operation, which make the concept suitable for implementing in low-end devices such as minirobots and wireless sensors.

  • 31.
    Kleyko, Denis
    et al.
    Luleå University of Technology, Department of Computer Science, Electrical and Space Engineering, Computer Science.
    Osipov, Evgeny
    Luleå University of Technology, Department of Computer Science, Electrical and Space Engineering, Computer Science.
    Gayler, Ross W.
    La Trobe University.
    Recognizing permuted words with Vector Symbolic Architectures: A Cambridge test for machines2016In: Procedia Computer Science, ISSN 1877-0509, E-ISSN 1877-0509, Vol. 88, p. 169-175Article in journal (Refereed)
    Abstract [en]

    This paper proposes a simple encoding scheme for words using principles of Vector Symbolic Architectures. The proposed encoding allows finding a valid word in the dictionary for a given permuted word (represented using the proposed approach) using only a single operation - calculation of Hamming distance to the distributed representations of valid words in the dictionary. The proposed encoding scheme can be used as an additional processing mechanism for models of word embedding, which also form vectors to represent the meanings of words, in order to match the distorted words in the text to the valid words in the dictionary.

  • 32.
    Kleyko, Denis
    et al.
    Luleå University of Technology, Department of Computer Science, Electrical and Space Engineering, Computer Science.
    Osipov, Evgeny
    Luleå University of Technology, Department of Computer Science, Electrical and Space Engineering, Computer Science.
    Gayler, Ross W.
    La Trobe University.
    Khan, Asad I.
    Monash University, Melbourne, VIC, Clayton School of Information Technology, CSIT, Monash University.
    Dyer, Adrian G.
    Media and Communication School, Royal Melbourne Institute of Technology.
    Imitation of honey bees’ concept learning processes using Vector Symbolic Architectures2015In: Biologically Inspired Cognitive Architectures, ISSN 2212-683X, E-ISSN 2212-6848, Vol. 14, p. 57-72Article in journal (Refereed)
    Abstract [en]

    This article presents a proof-of-concept validation of the use of Vector Symbolic Architectures as central component of an online learning architectures. It is demonstrated that Vector Symbolic Architectures enable the structured combination of features/relations that have been detected by a perceptual circuitry and allow such relations to be applied to novel structures without requiring the massive training needed for classical neural networks that depend on trainable connections.The system is showcased through the functional imitation of concept learning in honey bees. Data from real-world experiments with honey bees (Avarguès-Weber et al., 2012) are used for benchmarking. It is demonstrated that the proposed pipeline features a similar learning curve and accuracy of generalization to that observed for the living bees. The main claim of this article is that there is a class of simple artificial systems that reproduce the learning behaviors of certain living organisms without requiring the implementation of computationally intensive cognitive architectures. Consequently, it is possible in some cases to implement rather advanced cognitive behavior using simple techniques.

  • 33.
    Kleyko, Denis
    et al.
    Luleå University of Technology, Department of Computer Science, Electrical and Space Engineering, Computer Science.
    Osipov, Evgeny
    Luleå University of Technology, Department of Computer Science, Electrical and Space Engineering, Computer Science.
    Papakonstantinou, Nikolaos
    VTT Technical Research Center of Finland.
    Vyatkin, Valeriy
    Luleå University of Technology, Department of Computer Science, Electrical and Space Engineering, Computer Science. Department of Electrical Engineering and Automation, Aalto University, Finland.
    Hyperdimensional computing in industrial systems: the use-case of distributed fault isolation in a power plant2018In: IEEE Access, E-ISSN 2169-3536, Vol. 6, p. 30766-30777Article in journal (Refereed)
    Abstract [en]

    This paper presents an approach for distributed fault isolation in a generic system of systems. The proposed approach is based on the principles of hyperdimensional computing. In particular, the recently proposed method called Holographic Graph Neuron is used. We present a distributed version of Holographic Graph Neuron and evaluate its performance on the problem of fault isolation in a complex power plant model. Compared to conventional machine learning methods applied in the context of the same scenario the proposed approach shows comparable performance while being distributed and requiring simple binary operations, which allow for a fast and efficient implementation in hardware.

  • 34.
    Kleyko, Denis
    et al.
    Luleå University of Technology, Department of Computer Science, Electrical and Space Engineering, Computer Science.
    Osipov, Evgeny
    Luleå University of Technology, Department of Computer Science, Electrical and Space Engineering, Computer Science.
    Papakonstantinou, Nikolaos
    VTT Technical Research Centre of Finland, Espoo.
    Vyatkin, Valeriy
    Luleå University of Technology, Department of Computer Science, Electrical and Space Engineering, Computer Science.
    Mousavi, Arash
    Luleå University of Technology, Department of Computer Science, Electrical and Space Engineering, Computer Science.
    Fault Detection in the Hyperspace: Towards Intelligent Automation Systems2015In: IEEE International Conference on Industrial Informatics: INDIN 2015, Cambridge, UK, July 22-24, 2015. Proceedings, Piscataway, NJ: IEEE Communications Society, 2015, p. 1219-1224, article id 7281909Conference paper (Refereed)
    Abstract [en]

    This article presents a methodology for intelligent, biologically inspired fault detection system for generic complex systems of systems. The proposed methodology utilizes the concepts of associative memory and vector symbolic architectures, commonly used for modeling cognitive abilities of human brain. Compared to classical methods of artificial intelligence used in the context of fault detection the proposed methodology shows an unprecedented performance, while featuring zero configuration and simple operations.

  • 35.
    Kleyko, Denis
    et al.
    Luleå University of Technology, Department of Computer Science, Electrical and Space Engineering, Computer Science.
    Osipov, Evgeny
    Luleå University of Technology, Department of Computer Science, Electrical and Space Engineering, Computer Science.
    Patil, Sandeep
    Luleå University of Technology, Department of Computer Science, Electrical and Space Engineering, Computer Science.
    Vyatkin, Valeriy
    Luleå University of Technology, Department of Computer Science, Electrical and Space Engineering, Computer Science.
    Pang, Zhibo
    ABB AB, Corporate research.
    On Methodology of Implementing Distributed Function Block Applications using TinyOS WSN nodes2014In: Proceedings of 2014 IEEE 19th International Conference on Emerging Technologies & Factory Automation (ETFA 2014): Barcelona, Spain, 16-19 Sept. 2014, Piscataway, NJ: IEEE Communications Society, 2014, article id 7005107Conference paper (Refereed)
    Abstract [en]

    This paper presents a feasibility study of implementing parts of a distributed function block application as TinyOS modules running on Wireless Sensors as a part of Wireless Sensor Network. The paper first briefly describes underlying technologies and gives motivation for implementation of function blocks in TinyOS. The paper then presents implementation details about TinyOS realization of the one of the function block, which is a part of bigger distributed control application with the help of distributed function block application.

  • 36.
    Kleyko, Denis
    et al.
    Luleå University of Technology, Department of Computer Science, Electrical and Space Engineering, Computer Science.
    Osipov, Evgeny
    Luleå University of Technology, Department of Computer Science, Electrical and Space Engineering, Computer Science.
    Rachkovskij, Dmitri A.
    International Research and Training Center for Information Technologies and Systems.
    Modification of Holographic Graph Neuron using Sparse Distributed Representations2016In: Procedia Computer Science, ISSN 1877-0509, E-ISSN 1877-0509, Vol. 88, p. 39-45Article in journal (Refereed)
    Abstract [en]

    This article presents a modification of the recently proposed Holographic Graph Neuron approach for memorizing patterns of generic sensor stimuli. The original approach represents patterns as dense binary vectors, where zeros and ones are equiprobable. The presented modification employs sparse binary distributed representations where the number of ones is less than zeros. Sparse representations are more biologically plausible because activities of real neuronsare sparse. Performance was studied comparing approaches for different sizes of dimensionality.

  • 37.
    Kleyko, Denis
    et al.
    Luleå University of Technology, Department of Computer Science, Electrical and Space Engineering, Computer Science.
    Osipov, Evgeny
    Luleå University of Technology, Department of Computer Science, Electrical and Space Engineering, Computer Science.
    Senior, Alexander
    Monash University, Melbourne, VIC.
    Khan, Asad
    Monash University, Melbourne, VIC.
    Sekercioglu, Ahmet
    Monash University, Melbourne, VIC.
    Holographic Graph Neuron: a Bio-Inspired Architecture for Pattern Processing2017In: IEEE Transactions on Neural Networks and Learning Systems, ISSN 2162-237X, E-ISSN 2162-2388, Vol. 28, no 6, p. 1250-1262Article in journal (Refereed)
    Abstract [en]

    This article proposes the use of Vector Symbolic Architectures for implementing Hierarchical Graph Neuron, an architecture for memorizing patterns of generic sensor stimuli. The adoption of a Vector Symbolic representation ensures a one-layered design for the approach, while maintaining the previously reported properties and performance characteristics of Hierarchical Graph Neuron, and also improving the noise resistance of the architecture. The proposed architecture enables a linear (with respect to the number of stored entries) time search for an arbitrary sub-pattern.

  • 38.
    Kleyko, Denis
    et al.
    Luleå University of Technology, Department of Computer Science, Electrical and Space Engineering, Computer Science.
    Osipov, Evgeny
    Luleå University of Technology, Department of Computer Science, Electrical and Space Engineering, Computer Science.
    Wiklund, Urban
    Department of Radiation Sciences, Biomedical Engineering, Umeå University, Umeå, Sweden.
    A Hyperdimensional Computing Framework for Analysis of Cardiorespiratory Synchronization during Paced Deep Breathing2019In: IEEE Access, E-ISSN 2169-3536, Vol. 7, p. 34403-34415Article in journal (Refereed)
    Abstract [en]

    Objective: Autonomic function during deep breathing (DB) is normally scored based on the assumption that the heart rate is synchronized with the breathing. We have observed individuals with subtle arrhythmias during DB where autonomic function cannot be evaluated. This study presents a novel method for analyzing cardiorespiratory synchronization: feature-based analysis of the similarity between heart rate and respiration using principles of hyperdimensional computing. Methods: Heart rate and respiration signals were modeled using Fourier series analysis. Three feature variables were derived and mapped to binary vectors in a high-dimensional space. Using both synthesized data and recordings from patients/healthy subjects, the similarity between the feature vectors was assessed using Hamming distance (high-dimensional space), Euclidean distance (original space), and with a coherence-based index. Methods were evaluated via classification of the similarity indices into three groups. Results: The distance-based methods achieved good separation of signals into classes with different degree of cardiorespiratory synchronization, also providing identification of patients with low cardiorespiratory synchronization but high values of conventional DB scores. Moreover, binary high-dimensional vectors allowed an additional analysis of the obtained Hamming distance. Conclusions: Feature-based similarity analysis using hyperdimensional computing is capable of identifying signals with low cardiorespiratory synchronization during DB due to arrhythmias. Vector-based similarity analysis could be applied to other types of feature variables than based on spectral analysis. Significance: The proposed methods for robustly assessing cardiorespiratory synchronization during DB facilitate the identification of individuals where the evaluation of autonomic function is problematic or even impossible, thus, increasing the correctness of the conventional DB scores.

  • 39.
    Kleyko, Denis
    et al.
    Luleå University of Technology, Department of Computer Science, Electrical and Space Engineering, Computer Science.
    Rahimi, Abbas
    ETH Zurich, Zurich, Switzerland.
    Gayler, Ross W.
    Melbourne, Australia.
    Osipov, Evgeny
    Luleå University of Technology, Department of Computer Science, Electrical and Space Engineering, Computer Science.
    Autoscaling Bloom filter: Controlling trade-off between true and false positives2019In: Neural computing & applications (Print), ISSN 0941-0643, E-ISSN 1433-3058Article in journal (Refereed)
    Abstract [en]

    A Bloom filter is a special case of an artificial neural network with two layers. Traditionally, it is seen as a simple data structure supporting membership queries on a set. The standard Bloom filter does not support the delete operation, and therefore, many applications use a counting Bloom filter to enable deletion. This paper proposes a generalization of the counting Bloom filter approach, called “autoscaling Bloom filters”, which allows adjustment of its capacity with probabilistic bounds on false positives and true positives. Thus, by relaxing the requirement on perfect true positive rate, the proposed autoscaling Bloom filter addresses the major difficulty of Bloom filters with respect to their scalability. In essence, the autoscaling Bloom filter is a binarized counting Bloom filter with an adjustable binarization threshold. We present the mathematical analysis of its performance and provide a procedure for minimizing its false positive rate.

  • 40.
    Kleyko, Denis
    et al.
    Luleå University of Technology, Department of Computer Science, Electrical and Space Engineering, Computer Science.
    Rahimi, Abbas
    University of California at Berkeley, Berkeley.
    Rachkovskij, Dmitri A.
    International Research and Training, Center for Information Technologies and Systems, Kiev, Ukraine.
    Osipov, Evgeny
    Luleå University of Technology, Department of Computer Science, Electrical and Space Engineering, Computer Science.
    Rabaey, Jan M.
    University of California at Berkeley, Berkeley.
    Classification and Recall With Binary Hyperdimensional Computing: Tradeoffs in Choice of Density and Mapping Characteristics2018In: IEEE Transactions on Neural Networks and Learning Systems, ISSN 2162-237X, E-ISSN 2162-2388, Vol. 29, no 12, p. 5880-5898Article in journal (Refereed)
    Abstract [en]

    Hyperdimensional (HD) computing is a promising paradigm for future intelligent electronic appliances operating at low power. This paper discusses tradeoffs of selecting parameters of binary HD representations when applied to pattern recognition tasks. Particular design choices include density of representations and strategies for mapping data from the original representation. It is demonstrated that for the considered pattern recognition tasks (using synthetic and real-world data) both sparse and dense representations behave nearly identically. This paper also discusses implementation peculiarities which may favor one type of representations over the other. Finally, the capacity of representations of various densities is discussed.

  • 41.
    Nunes, Renato
    et al.
    INOV.
    Pereira, Paulo
    INOV.
    Peter, Steffen
    IHP.
    Piotrowski, Krzysztof
    IHP.
    Winkler, Rita
    IHP.
    Riliskis, Laurynas
    Luleå University of Technology, Department of Computer Science, Electrical and Space Engineering, Computer Science.
    Osipov, Evgeny
    Luleå University of Technology, Department of Computer Science, Electrical and Space Engineering, Computer Science.
    Tools and methods for systematic WSAN engineering2009Report (Other academic)
    Abstract [en]

    The goal of this deliverable is to research an application-centric communication system engineering framework that supports system engineers in analysing and defining requirements as well as providing tool support during the selection of particular network mechanisms to be used within the WSAN under development. For this purpose we present a general design flow to help engineering WSAN applications. The semantic centreis a knowledge base it allows to describe requirements, environment, components and the whole system. The presented model-driven scheme as part of the component description is able to predict the properties of theoverall system based on static properties of components in context of the given environment. For more complex dynamic properties a novel simulation approach is presented that combines network simulations with actual properties of the operating system and the software stack. Operations of the development flow are supported by various tools. First examples indicate the effectiveness of the proposed design flow and promiseto improve engineering of WSAN system in future.

  • 42.
    Osipov, Evgeny
    Luleå University of Technology, Department of Computer Science, Electrical and Space Engineering, Computer Science.
    Aktivitet: International Conference on Wired/Wireless Internet Communications2010Other (Other (popular science, discussion, etc.))
  • 43. Osipov, Evgeny
    Extending the ad hoc horizon for TCP over IEEE 802.11 networks2005In: Proceedings. 5th Scandinavian Workshop on Wireless Ad-hoc Networks: ADHOC'05, Stockholm: Wireless at KTH, Royal institute of technology , 2005Conference paper (Refereed)
  • 44. Osipov, Evgeny
    On the practical feasibility of fair TCP communications in IEEE 802.11 based multihop ad hoc wireless networks2005Doctoral thesis, comprehensive summary (Other academic)
    Abstract [en]

    In the center of this dissertation is the question whether it is practically feasible to achieve deterministically good quality for traditional network services such as le transfer and Web browsing in multihop wireless mobile ad hoc networks (MANETs). Despite the straight forward benets of MANETs such as quick installation due to the absence of wireline infrastructure, and the virtue of dynamic re-conguration, these networks mainly exist in research labs so far. One of the stumbling blocks which prevents MANETs from wide deployment and popularization, is the poor and unstable performance of the TCP protocol which underlies le transfer and Web trafc. In particular, the problem considered in this thesis is the severe unfairness between multiple TCP sessions in a wireless context. Overall, the thesis explores the operational range of MANETs in which the quality of network services is acceptable for an end user. The rst part of our work reveals that this range is extremely narrow for the plain combination of TCP and wireless communication according to IEEE 802.11. The second part of this work studies the interactions of TCP and IEEE 802.11 assuming static routing in the network. It gives a systematic view on fairness in MANETs. The max-min fairness model from the wireline Internet is adapted to the specics of the wireless environment. The resulting solution presented in this thesis is an adaptive distributed capacity allocation scheme for multihop wireless networks. It leads to a dramatic improvement of TCP performance and a signicant extension of the operation range. The third part analyzes the effect of ad hoc routing on the quality of TCP sessions. The routing trafc itself is one of the reasons for unfair TCP communications. Finally, the thesis addresses implementation issues of the suggested fairness model. It describes a distributed protocol for the dynamic control of the network load, which is implemented both for a network simulator and a real-world operating system.

  • 45. Osipov, Evgeny
    The design and application of a simplified guaranteed service for the Internet2003Licentiate thesis, comprehensive summary (Other academic)
  • 46.
    Osipov, Evgeny
    Luleå University of Technology, Department of Computer Science, Electrical and Space Engineering, Computer Science.
    tinyLUNAR: one-byte multihop communications through hybrid routing in wireless sensor networks2007In: Next Generation Teletraffic and Wired/Wireless Advanced Networking: 7th international conference, NEW2AN 2007, St. Petersburg, Russia, September 10-14, 2007 ; proceedings / [ed] Yevgeni Koucheryavy; Jarmo Harju; A. Sayenko, Berlin: Encyclopedia of Global Archaeology/Springer Verlag, 2007, p. 379-392Conference paper (Refereed)
    Abstract [en]

    In this paper we consider a problem of implementing a hybrid routing protocol for wireless sensor networks, which natively supports data-centric, geographic-based and address-centric communication paradigms. We demonstrate the feasibility of such protocol by presenting tinyLUNAR, an adapted to the specifics of sensor networks reactive routing scheme originally developed for mobile wireless ad hoc networks. In addition to the support for several communications paradigms tinyLUNAR implements highly efficient multihop forwarding using only 1 B field that can be directly encoded in the standard IEEE 802.15.4 MAC header.

  • 47. Osipov, Evgeny
    Проблемы реализации надёжной передачи данных в самоорганизующихся и сенсорных сетях2006In: Elektrosvyaz', ISSN 0013-5771, no 6Article in journal (Other (popular science, discussion, etc.))
  • 48.
    Osipov, Evgeny
    et al.
    Luleå University of Technology, Department of Computer Science, Electrical and Space Engineering, Computer Science.
    Birk, Wolfgang
    Luleå University of Technology, Department of Computer Science, Electrical and Space Engineering, Signals and Systems.
    Riliskis, Laurynas
    Project: EU FP7 project WSAN4CIP: Wireless Sensor and Actuator Networks for Critical Infrastructure Protection2008Other (Other (popular science, discussion, etc.))
    Abstract [en]

    The WSAN4CIP project focuses on the ICT theme and covers the Objective ICT-SEC-2007.1.7 of the joint call between the ICT Theme and the Security Theme on Critical Infrastructure Protection. The goal of this project is to increase the dependability of Wireless Sensor and Actuator Networks (WSANs) significantly beyond the current state of the art. By that WSAN will become a "technology building blocks for creating, monitoring and managing secure, resilient and always available information infrastructure. Wireless Sensor and Actuator Networks (WSAN) provide an ideal means to achieve the envisioned improvement on CI reliability. The highly distributed nature of WSAN boosts their ability to survive malicious attacks as well as accidental failures and makes them dependable in critical situations when the information is needed to prevent further damage to critical infrastructures. As WSANs are inexpensive to lay out and self-organizing, an emergency extension of the WSAN as a first reaction is possible. Exploiting these features makes WSANs an ideal mechanism to improve situation awareness of managing tools for critical infrastructures. But current state of the art WSANs are not sufficiently dependable. In order to remedy this we will tackle the following challenges: 1.      Improving sensor node protection to improve their dependability 2.      Investigation of dependable networking approaches 3.      Investigation of dependable services running on top of WSAN that ensure graceful degradation in case of failures. In order to allow an easy use of WSAN and to make them really a technology building block we will investigate and develop Methodologies for designing WSAN according to specific requirements and we will define an open interface to ensure interoperability with existing CI management applications. We will demonstrate the appropriateness of our approach by applying it to two representative CI applications, in the area of power generation and distribution management system.

  • 49.
    Osipov, Evgeny
    et al.
    Luleå University of Technology, Department of Computer Science, Electrical and Space Engineering, Computer Science.
    Johansson, Tomas
    Project: EU FP6 project UbiSec&Sens: Ubiquitous Security and Sensing in the European Homeland2008Other (Other (popular science, discussion, etc.))
    Abstract [en]

    Wireless Sensor Networks (WSN)s are a exciting development with very large potential to have a significant beneficial impact on every aspect of our lives while generating huge opportunities for European industry. What is needed to kick off the development and exploitation of WSNs is an architecture for medium and large scale wireless sensor networks integrating comprehensive security capabilities right from the concept stage. This would support the rapid development of sensor networks and would open up the application domain for commercial activities. UbiSec&Sens intends to solve this by providing a comprehensive architecture for medium and large scale wireless sensor networks with the full level of security that will make them trusted and secure for all applications. In addition UbiSec&Sens will provide a complete tool box of security aware components which, together with the UbiSec&Sens radically new design cycle for secure sensor networks, will enable the rapid development of trusted sensor network applications. The UbiSec&Sens approach is to use three representative WSN scenarios to iteratively determine solutions for the key WSN issues of scalability, security, reliability, self-healing and robustness. This will also give a clearer understanding of the real-world WSN requirements and limitations as well as identifying how to achieve a successful rollout of WSNs. UbiSec&Sens will provide a comprehensive architecture for medium and large scale wireless sensor networks with the full level of security that will make them trusted and secure for all applications. The overall project goals are to: ♦   Focus the work on the intersection of security, routing and in-network processing to design and develop efficient and effective security solutions and to offer effective means for persistent and encrypted data storage for distributed (and tiny) data base approaches ♦   Provide a complete toolbox of security aware components for sensor network application development. We aim at extremely energy-efficient and condensed data transmission as well as highly robust and reliable solutions for concrete WSNs that, at the same time, still provide an appropriate level of security ♦   Prototype and validate the UbiSec&Sens solutions in the representative wireless sensor application scenarios of agriculture, road services and homeland security

  • 50. Osipov, Evgeny
    et al.
    Karlsson, Gunnar
    Kungliga tekniska högskolan, KTH.
    SOS: Sender oriented signaling for a simplified guaranteed service2002In: From QoS Provisioning to QoS Charging: Third COST 263 International Workshop on Quality of Future Internet Services, QofIS 2002 and Second International Workshop on Internet Charging and QoS Technologies, ICQT 2002 Zurich, Switzerland, October 16-18, 2002. Proceedings / [ed] Burkhard Stiller, Berlin: Encyclopedia of Global Archaeology/Springer Verlag, 2002, p. 100-114Conference paper (Refereed)
    Abstract [en]

    A resource reservation scheme is an important mechanism of providing guaranteed QoS to applications. Today the only protocol that is standardized by IETF is the resource reservation protocol RSVP. Development of the next generation of signaling protocols is still open for research and development. We now propose SOS - a simple signaling protocol for guaranteed service connections. It overcomes poor scalability of RSVP and is simpler than existing proposals: Our protocol does not require per-flow soft states in core routers; it is robust and can handle losses of all types of signaling messages. Simple operations in the routers allow processing of 700 thousand messages per second.

12 1 - 50 of 85
CiteExportLink to result list
Permanent link
Cite
Citation style
  • apa
  • harvard1
  • 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