hh.sePublikasjoner
Endre søk
Begrens søket
1234567 151 - 200 of 1972
RefereraExporteraLink til resultatlisten
Permanent link
Referera
Referensformat
  • apa
  • harvard1
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Annet format
Fler format
Språk
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Annet språk
Fler språk
Utmatningsformat
  • html
  • text
  • asciidoc
  • rtf
Treff pr side
  • 5
  • 10
  • 20
  • 50
  • 100
  • 250
Sortering
  • Standard (Relevans)
  • Forfatter A-Ø
  • Forfatter Ø-A
  • Tittel A-Ø
  • Tittel Ø-A
  • Type publikasjon A-Ø
  • Type publikasjon Ø-A
  • Eldste først
  • Nyeste først
  • Skapad (Eldste først)
  • Skapad (Nyeste først)
  • Senast uppdaterad (Eldste først)
  • Senast uppdaterad (Nyeste først)
  • Disputationsdatum (tidligste først)
  • Disputationsdatum (siste først)
  • Standard (Relevans)
  • Forfatter A-Ø
  • Forfatter Ø-A
  • Tittel A-Ø
  • Tittel Ø-A
  • Type publikasjon A-Ø
  • Type publikasjon Ø-A
  • Eldste først
  • Nyeste først
  • Skapad (Eldste først)
  • Skapad (Nyeste først)
  • Senast uppdaterad (Eldste først)
  • Senast uppdaterad (Nyeste først)
  • Disputationsdatum (tidligste først)
  • Disputationsdatum (siste først)
Merk
Maxantalet träffar du kan exportera från sökgränssnittet är 250. Vid större uttag använd dig av utsökningar.
  • 151.
    Bacauskiene, Marija
    et al.
    Kaunas University of Technology.
    Gelzinis, Adas
    Kaunas University of Technology.
    Kaseta, Marius
    Kaunas University of Medicine.
    Kovalenko, Marina
    Kaunas University of Technology.
    Pribuisiene, Ruta
    Kaunas University of Medicine.
    Uloza, Virgilijus
    Kaunas University of Medicine.
    Verikas, Antanas
    Högskolan i Halmstad, Sektionen för Informationsvetenskap, Data– och Elektroteknik (IDE), Halmstad Embedded and Intelligent Systems Research (EIS), Intelligenta system (IS-lab).
    Multiple feature sets and genetic search based discrimination of pathological voices2007Inngår i: Proceedings of the International ConferenceModels and Analysis of Vocal Emissions for Biomedical Applications”, MAVEBA, 2007, s. 195-198Konferansepaper (Fagfellevurdert)
  • 152.
    Bacauskiene, Marija
    et al.
    Department of Applied Electronics, Kaunas University of Technology LT-3031, Kaunas, Lithuania.
    Verikas, Antanas
    Högskolan i Halmstad, Sektionen för Informationsvetenskap, Data– och Elektroteknik (IDE), Halmstad Embedded and Intelligent Systems Research (EIS).
    Selecting salient features for classification based on neural network committees2004Inngår i: Pattern Recognition Letters, ISSN 0167-8655, E-ISSN 1872-7344, Vol. 25, nr 16, s. 1879-1891Artikkel i tidsskrift (Fagfellevurdert)
    Abstract [en]

    Aggregating outputs of multiple classifiers into a committee decision is one of the most important techniques for improving classification accuracy. The issue of selecting an optimal subset of relevant features plays also an important role in successful design of a pattern recognition system. In this paper, we present a neural network based approach for identifying salient features for classification in neural network committees. Feature selection is based on two criteria, namely the reaction of the cross-validation data set classification error due to the removal of the individual features and the diversity of neural networks comprising the committee. The algorithm developed removed a large number of features from the original data sets without reducing the classification accuracy of the committees. The accuracy of the committees utilizing the reduced feature sets was higher than those exploiting all the original features.

  • 153.
    Bacauskiene, Marija
    et al.
    Department of Applied Electronics, Kaunas University of Technology, LT-3031, Kaunas, Lithuania.
    Verikas, Antanas
    Högskolan i Halmstad, Sektionen för Informationsvetenskap, Data– och Elektroteknik (IDE), Halmstad Embedded and Intelligent Systems Research (EIS).
    The Evidence Theory Based Post-Processing of Colour Images2004Inngår i: Informatica (Vilnius), ISSN 0868-4952, E-ISSN 1822-8844, Vol. 15, nr 3, s. 315-328Artikkel i tidsskrift (Fagfellevurdert)
    Abstract [en]

    The problem of post-processing of a classified image is addressed from the point of view of the Dempster-Shafer theory of evidence. Each neighbour of a pixel being analyzed is considered as an item of evidence supporting particular hypotheses regarding the class label of that pixel. The strength of support is defined as a function of the degree of uncertainty in class label of the neighbour, and the distance between the neighbour and the pixel being considered. A post-processing window defines the neighbours. Basic belief masses are obtained for each of the neighbours and aggregated according to the rule of orthogonal sum. The final label of the pixel is chosen according to the maximum of the belief function.

  • 154.
    Bacauskiene, Marija
    et al.
    Department of Applied Electronics, Kaunas University of Technology, Lithuania .
    Verikas, Antanas
    Högskolan i Halmstad, Sektionen för Informationsvetenskap, Data– och Elektroteknik (IDE), Halmstad Embedded and Intelligent Systems Research (EIS).
    Gelzinis, Adas
    Department of Applied Electronics, Kaunas University of Technology, Lithuania .
    Valincius, Donatas
    Department of Applied Electronics, Kaunas University of Technology, Lithuania .
    A feature selection technique for generation of classification committees and its application to categorization of laryngeal images2009Inngår i: Pattern Recognition, ISSN 0031-3203, E-ISSN 1873-5142, Vol. 42, nr 5, s. 645-654Artikkel i tidsskrift (Fagfellevurdert)
    Abstract [en]

    This paper is concerned with a two phase procedure to select salient features (variables) for classification committees. Both filter and wrapper approaches to feature selection are combined in this work. In the first phase, definitely redundant features are eliminated based on the paired t-test. The test compares the saliency of the candidate and the noise features. In the second phase, the genetic search is employed. The search integrates the steps of training, aggregation of committee members, selection of hyper-parameters, and selection of salient features into the same learning process. A small number of genetic iterations needed to find a solution is the characteristic feature of the genetic search procedure developed. The experimental tests performed on five real-world problems have shown that significant improvements in Classification accuracy can be obtained in a small number of iterations if compared to the case of using all the features available.

  • 155.
    Bacauskiene, Marija
    et al.
    Department of Electrical and Control Equipment, Kaunas University of Technology, Kaunas, Lithuania.
    Verikas, Antanas
    Högskolan i Halmstad, Akademin för informationsteknologi, Halmstad Embedded and Intelligent Systems Research (EIS), Intelligenta system (IS-lab).
    Gelzinis, Adas
    Department of Electrical and Control Equipment, Kaunas University of Technology, Kaunas, Lithuania.
    Vegiene, Aurelija
    Department of Otolaryngology, Kaunas University of Medicine, Kaunas, Lithuania.
    Random forests based monitoring of human larynx using questionnaire data2012Inngår i: Expert systems with applications, ISSN 0957-4174, E-ISSN 1873-6793, Vol. 39, nr 5, s. 5506-5512Artikkel i tidsskrift (Fagfellevurdert)
    Abstract [en]

    This paper is concerned with soft computing techniques-based noninvasive monitoring of human larynx using subject’s questionnaire data. By applying random forests (RF), questionnaire data are categorized into a healthy class and several classes of disorders including: cancerous, noncancerous, diffuse, nodular, paralysis, and an overall pathological class. The most important questionnaire statements are determined using RF variable importance evaluations. To explore data represented by variables used by RF, the t-distributed stochastic neighbor embedding (t-SNE) and the multidimensional scaling (MDS) are applied to the RF data proximity matrix. When testing the developed tools on a set of data collected from 109 subjects, the 100% classification accuracy was obtained on unseen data in binary classification into the healthy and pathological classes. The accuracy of 80.7% was achieved when classifying the data into the healthy, cancerous, noncancerous classes. The t-SNE and MDS mapping techniques applied allow obtaining two-dimensional maps of data and facilitate data exploration aimed at identifying subjects belonging to a “risk group”. It is expected that the developed tools will be of great help in preventive health care in laryngology.

  • 156.
    Bade, Hans
    et al.
    Högskolan i Halmstad, Akademin för informationsteknologi.
    Hedlund, Oscar
    Högskolan i Halmstad, Akademin för informationsteknologi.
    Anti-Forensik: Anti-forensiska metoder på mobila enheter2018Independent thesis Basic level (degree of Bachelor), 10 poäng / 15 hpOppgave
    Abstract [sv]

    Mobiltelefoner har blivit grundläggande för extrahering av digitala artefakter i fo-rensiska utredningar. Androids Linuxbaserade operativsystem medför större möj-ligheter för anti-forensiska metoder, detta gör att kunskap om anti-forensik äressentiell för dagens IT-forensiska utredare. I denna studie belyses effekten avanti-forensik i Androidbaserade mobila enheter samt så upplyses det om dagensanti-forensiska attack metoder mot forensiska verktyg. Genom experiment så vi-sas det hur man kan förhindra ett forensisk verktyg från att extrahera data medanvändning av ett simpelt script.

  • 157.
    Baerveldt, Albert-Jan
    Högskolan i Halmstad, Sektionen för Informationsvetenskap, Data– och Elektroteknik (IDE), Halmstad Embedded and Intelligent Systems Research (EIS), Intelligenta system (IS-lab).
    A vision system for object verification and localization based on local features2001Inngår i: Robotics and Autonomous Systems, ISSN 0921-8890, E-ISSN 1872-793X, Vol. 34, nr 2-3, s. 83-92Artikkel i tidsskrift (Fagfellevurdert)
    Abstract [en]

    An object verification and localization system should answer the question whether an expected object is present in an image or not, i.e. verification, and if present where it is located. Such a system would be very useful for mobile robots, e.g. for landmark recognition or for the fulfilment of certain tasks. In this paper, we present an object verification and localization system specially adapted to the needs of mobile robots. The object model is based on a collection of local features derived from a small neighbourhood around automatically detected interest points. The learned representation of the object is then matched with the image under consideration. The tests, based on 81 images, showed a very satisfying tolerance to scale changes of up to 50%, to viewpoint variations of 20, to occlusion of up to 80% and to major background changes as well as to local and global illumination changes. The tests also showed that the verification capabilities are very good and that similar objects did not trigger any false verification.

  • 158.
    Baerveldt, Albert-Jan
    et al.
    Högskolan i Halmstad, Sektionen för Informationsvetenskap, Data– och Elektroteknik (IDE), Halmstad Embedded and Intelligent Systems Research (EIS), Intelligenta system (IS-lab).
    Arras, Kai Oliver
    EPFL, Lausanne, Switzerland.
    Balkenius, Christian
    Lund University, Lund, Sweden.
    Editorial2003Inngår i: Robotics and Autonomous Systems, ISSN 0921-8890, E-ISSN 1872-793X, Vol. 44, nr 1, s. 100s. 1-Artikkel i tidsskrift (Annet (populærvitenskap, debatt, mm))
  • 159.
    Baerveldt, Albert-Jan
    et al.
    Högskolan i Halmstad, Sektionen för Informationsvetenskap, Data– och Elektroteknik (IDE), Halmstad Embedded and Intelligent Systems Research (EIS).
    Salomonsson, Tommy
    Högskolan i Halmstad, Sektionen för Informationsvetenskap, Data– och Elektroteknik (IDE), Halmstad Embedded and Intelligent Systems Research (EIS).
    Åstrand, Björn
    Högskolan i Halmstad, Sektionen för Informationsvetenskap, Data– och Elektroteknik (IDE), Halmstad Embedded and Intelligent Systems Research (EIS).
    Vision-guided mobile robots for design competitions2003Inngår i: IEEE robotics & automation magazine, ISSN 1070-9932, E-ISSN 1558-223X, Vol. 10, nr 2, s. 38-44Artikkel i tidsskrift (Fagfellevurdert)
    Abstract [en]

    The use of popular and effective robot-design competitions in teaching system integration in engineering curricula was discussed. Such robot competitions give students open-ended problem spaces, teaches them to work in groups and stimulates creativity. The technical and pedagogical aspects of robot competitions along with their experiences and shortcomings were also discussed.

  • 160.
    Balador, Ali
    et al.
    SICS Swedish ICT Västerås AB, Västerås, Sweden. & Polytechnic University of Valencia, Valencia, Spain.
    Böhm, Annette
    Högskolan i Halmstad, Akademin för informationsteknologi, Halmstad Embedded and Intelligent Systems Research (EIS).
    Calafate, Carlos T.
    Polytechnic University of Valencia, Valencia, Spain.
    Cano, Juan-Carlos
    Polytechnic University of Valencia, Valencia, Spain.
    A Reliable Token-Based MAC Protocol for V2V Communication in Urban VANET2016Inngår i: 2016 IEEE 27TH ANNUAL INTERNATIONAL SYMPOSIUM ON PERSONAL, INDOOR, AND MOBILE RADIO COMMUNICATIONS (PIMRC), Piscataway: IEEE , 2016, s. 1586-1591Konferansepaper (Fagfellevurdert)
    Abstract [en]

    Safety applications developed for vehicular environments require every vehicle to periodically broadcast its status information (beacon) to all other vehicles, thereby avoiding the risk of car accidents in the road. Due to the high requirements on timing and reliability posed by traffic safety applications, the current IEEE 802.11p standard, which uses a random access Medium Access Control (MAC) protocol, faces difficulties to support timely and reliable data dissemination in vehicular environments where no acknowledgement or RTS/CTS (Request-to-Send/Clear-to-Send) mechanisms are adopted. In this paper, we propose the Dynamic Token-Based MAC (DTB-MAC) protocol. It implements a token passing approach on top of a random access MAC protocol to prevent channel contention as much as possible, thereby improving the reliability of safety message transmissions. Our proposed protocol selects one of the neighbouring nodes as the next transmitter; this selection accounts for the need to avoid beacon lifetime expiration. Therefore, it automatically offers retransmission opportunities to allow vehicles to successfully transmit their beacons before the next beacon is generated whenever time and bandwidth are available. Based on simulation experiments, we show that the DTB-MAC protocol can achieve better performance than IEEE 802.11p in terms of channel utilization and beacon delivery ratio for urban scenarios.

  • 161.
    Balador, Ali
    et al.
    Högskolan i Halmstad, Akademin för informationsteknologi. Universitat Politecnica de València, València, Spain.
    Böhm, Annette
    Högskolan i Halmstad, Akademin för informationsteknologi, Halmstad Embedded and Intelligent Systems Research (EIS), Centrum för forskning om inbyggda system (CERES).
    Uhlemann, Elisabeth
    Högskolan i Halmstad, Akademin för informationsteknologi, Halmstad Embedded and Intelligent Systems Research (EIS), Centrum för forskning om inbyggda system (CERES). Mälardalen University, Västerås, Sweden.
    Calafate, Carlos T.
    Universitat Politecnica de València, València, Spain.
    Cano, Juan-Carlos
    Universitat Politecnica de València, València, Spain.
    A Reliable Token-Based MAC Protocol for Delay Sensitive Platooning Applications2015Inngår i: 2015 IEEE 82nd Vehicular Technology Conference (VTC2015-Fall), [S.l.]: IEEE, 2015, artikkel-id 7390813Konferansepaper (Fagfellevurdert)
    Abstract [en]

    Platooning is both a challenging and rewarding application. Challenging since strict timing and reliability requirements are imposed by the distributed control system required to operate the platoon. Rewarding since considerable fuel reductions are possible. As platooning takes place in a vehicular ad hoc network, the use of IEEE 802.11p is close to mandatory. However, the 802.11p medium access method suffers from packet collisions and random delays. Most ongoing research suggests using TDMA on top of 802.11p as a potential remedy. However, TDMA requires synchronization and is not very flexible if the beacon frequency needs to be updated, the number of platoon members changes, or if retransmissions for increased reliability are required. We therefore suggest a token-passing medium access method where the next token holder is selected based on beacon data age. This has the advantage of allowing beacons to be re-broadcasted in each beacon interval whenever time and bandwidth are available. We show that our token-based method is able to reduce the data age and considerably increase reliability compared to pure 802.11p. © 2015 IEEE.

  • 162.
    Balador, Ali
    et al.
    Polytechnic University of Valencia, Valencia, Spain.
    Böhm, Annette
    Högskolan i Halmstad, Akademin för informationsteknologi, Halmstad Embedded and Intelligent Systems Research (EIS), Centrum för forskning om inbyggda system (CERES).
    Uhlemann, Elisabeth
    Mälardalen University, Västerås, Sweden.
    Calafate, Carlos T.
    Polytechnic University of Valencia, Valencia, Spain.
    Ji, Yusheng
    National Institute of Informatics, Tokyo, Japan.
    Cano, Juan-Carlos
    Polytechnic University of Valencia, Valencia, Spain.
    Manzoni, Pietro
    Polytechnic University of Valencia, Valencia, Spain.
    An Efficient MAC Protocol for vehicle platooning in automated highway systems2015Konferansepaper (Fagfellevurdert)
    Abstract [en]

    Lately, all the top truck manufacturers are investing considerable resources in the research and development of platooning systems which would allow vehicles to save fuel and improve safety by travelling in a close-following manner. The platooning system requires frequent and reliable vehicle-to-vehicle communications. As platooning takes place in a vehicular ad hoc network, the use of IEEE 802.11p is close to mandatory. However, the 802.11p medium access method suffers from packet collisions and random delays. Most ongoing research suggests using TDMA on top of 802.11p as a potential remedy. However, TDMA requires synchronization and is not very flexible if the beacon frequency needs to be updated, the number of platoon members changes, or if re-transmissions for increased reliability are required. We therefore suggest a token-passing medium access method where the next token holder is selected based on beacon data age. This has the advantage of allowing beacons to be re-broadcasted in each beacon interval whenever time and bandwidth are available. We show that our token-based method is able to reduce the data age and considerably increase reliability considerably compared to pure 802.11p.

  • 163.
    Balaji Kamalakkannan, Balaji
    Högskolan i Halmstad, Akademin för informationsteknologi, Halmstad Embedded and Intelligent Systems Research (EIS).
    Modelling and Simulation of Vehicle Kinematics and Dynamics2017Independent thesis Advanced level (degree of Master (Two Years)), 20 poäng / 30 hpOppgave
    Abstract [en]

    With the rapid growth in the automotive industry, vehicles have become more complex and sophisticated. Vehicle development today, involves integration of both electrical and mechanical systems. Their design and production are typically time and cost critical. To complement and support the process of vehicle development and design, majority of the automotive industry use modelling and simulationfor testing automotive applications, vehicle subsystems or the vehicle behaviour in its entirety.

    For the purpose of traffic simulations, where a large number of vehicles and other elements of the road network are simulated, implementing a highly complex vehicle model would greatly affect the performance of the simulation. The complexity of the vehicle model would entail a higher computation time of the system, making it unsuitable for any real time application. There in lies the trade-off indesigning a model that is both fast and accurate. The majority of the vehicle models that have been designed are either domain specific, highly complex or generalized. Thus, in this thesis, two class specific vehicles’ kinematic models with good accuracy and low computation time are presented.

    Two different modelling paradigms have been adopted to design and test these models. The results, challenges and limitations that pertain to these paradigms are also presented and discussed. The results show the feasibility of the proposed kinematic models.

  • 164.
    Balasubramaniam, Sasitharan
    et al.
    Tampere University of Technology, Tampere, Finland .
    Lyamin, Nikita
    Högskolan i Halmstad, Akademin för informationsteknologi, Halmstad Embedded and Intelligent Systems Research (EIS), Centrum för forskning om inbyggda system (CERES).
    Kleyko, Denis
    Luleå University of Technology, Luleå, Sweden.
    Skurnik, Mikael
    University of Helsinki, Helsinki, Finland .
    Vinel, Alexey
    Högskolan i Halmstad, Akademin för informationsteknologi, Halmstad Embedded and Intelligent Systems Research (EIS), Centrum för forskning om inbyggda system (CERES).
    Koucheryavy, Yevgeni
    Tampere University of Technology, Tampere, Finland .
    Exploiting bacterial properties for multi-hop nanonetworks2014Inngår i: IEEE Communications Magazine, ISSN 0163-6804, E-ISSN 1558-1896, Vol. 52, nr 7, s. 184-191Artikkel i tidsskrift (Fagfellevurdert)
    Abstract [en]

    Molecular communication is a relatively new communication paradigm for nanomachines where the communication is realized by utilizing existing biological components found in nature. In recent years researchers have proposed using bacteria to realize molecular communication because the bacteria have the ability to swim and migrate between locations, carry DNA contents (i.e. plasmids) that could be utilized for information storage, and interact and transfer plasmids to other bacteria (one of these processes is known as bacterial conjugation). However, current proposals for bacterial nanonetworks have not considered the internal structures of the nanomachines that can facilitate the use of bacteria as an information carrier. This article presents the types and functionalities of nanomachines that can be utilized in bacterial nanonetworks. A particular focus is placed on the bacterial conjugation and its support for multihop communication between nanomachines. Simulations of the communication process have also been evaluated, to analyze the quantity of bits received as well as the delay performances. Wet lab experiments have also been conducted to validate the bacterial conjugation process. The article also discusses potential applications of bacterial nanonetworks for cancer monitoring and therapy. © 2014 IEEE.

  • 165.
    Bangalore Girijeswara, Karthik
    Högskolan i Halmstad, Akademin för informationsteknologi, Halmstad Embedded and Intelligent Systems Research (EIS), CAISR Centrum för tillämpade intelligenta system (IS-lab). Mr..
    Peer group recognition based on Vehicle operation and behavior: Supervised and unsupervised approach towards peer group recognition and feature space exploration2017Independent thesis Advanced level (degree of Master (Two Years)), 20 poäng / 30 hpOppgave
    Abstract [en]

    Behavior recognition provides an interesting perspective for understandingthe different modes of a system and the influence of eachmode under varying conditions. In most of the systems, prior knowledgeof different expected behavior is available. Whereas, in an automotivedomain, a fleet of vehicle with many external factors influencingeach vehicle and an asynchronous performance of each vehicleon road, creates the complexity on analyzing and predicting the exacttime segments of vehicles in a fleet exhibiting similar behavior. Thisthesis focuses on recognizing time segments of vehicles that exhibitsimilar behavior based on supervised and unsupervised approaches.In supervised approach, classifiers are trained to predict two distinctiveoperations(highway and in-city). In unsupervised approach, featurespace is explored for identification of consistent features and existenceof other operations. An unsupervised approach to recognizepeer cluster groups is combined with supervised classification resultsto achieve lower computational complexity.

  • 166.
    Barisas, Dominykas
    et al.
    Kaunas University of Technology, Kaunas, Lithuania.
    Duracz, Adam
    Högskolan i Halmstad, Akademin för informationsteknologi, Halmstad Embedded and Intelligent Systems Research (EIS), Centrum för forskning om inbyggda system (CERES).
    Taha, Walid
    Högskolan i Halmstad, Akademin för informationsteknologi, Halmstad Embedded and Intelligent Systems Research (EIS), Centrum för forskning om inbyggda system (CERES). Rice University, Houston, TX, USA.
    DSLs Should be Online Applications2014Inngår i: Joint International Conference on Engineering Education & International Conference on Information Technology: ICEE/ICIT-2014: June 2 - 6, 2014: Riga, Latvia: Conference proceedings, 2014, s. 314-319Konferansepaper (Fagfellevurdert)
    Abstract [en]

    Domain-Specific Languages (DSLs) play an important role in both practice and education. But developing them is challenging, because a DSL must ultimately satisfy a large and complex set of user/customer requirements to fulfil its intended role, and neither requirements nor users are fully available at all times during the development process. Requirements can be elicited using agile methods but such methods assume the availability of the users. The situation is further complicated when the user base is primarily students and when enhanced learning is a key requirement. In this paper we propose developing DSLs, especially educational ones, as online applications. We analyze how this can help requirement elicitation and learning. Being online brings language development closer to the user, yielding new opportunities to improve and accelerate the language design process. It is also well-matched to agile methods, since web- based analytics provide an abundant source of data that integrates naturally into the development process. As an example, we consider applying the method to Acumen, a DSL designed to support teaching Cyber-Physical Systems.

  • 167.
    Bayat, Maryam
    et al.
    Högskolan i Halmstad, Akademin för informationsteknologi. Halmstad university.
    Ahmadi, Reshad
    Högskolan i Halmstad, Akademin för informationsteknologi. Halmstad university.
    Raviolimaskin2016Independent thesis Basic level (university diploma), 10 poäng / 15 hpOppgave
    Abstract [sv]

    Att laga ravioli hemma manuellt är jobbigt och tidskrävande. Det finns olika typer av raviolimaskiner på marknaden vilka hjälper med ravioli fyllningsprocessen, men de har vissa nackdelar. Detta medför att det finns behovet av en raviolimaskin med ett pris och en storlek som man kan skaffa hemma. Målet med detta projekt är att utveckla en raviolimaskin vilken gör applicering av ingredienser på en raviolideg och tillslutning av degen automatiskt. Fyllningsprocessen med användning av maskinen ska bli snabbare jämfört med manuell fyllning. För detta projekt utvecklas en kugghjulspump för applicering av ingrediensen på raviolidegen och en degform vilken tillsluter raviolidegen med användning av två DC-motorer. Som resultat lyckades vi utveckla en raviolimaskin bestående av en kugghjulspump, en degform vilken kan tillsluta en raviolideg och ett användargränssnitt vilken hjälper användaren att använda maskinen på ett enklare sätt.

  • 168.
    Bellalta, Boris
    et al.
    Universitat Pompeu Fabra, Barcelona, Spain.
    Belyaev, Evgeny
    Tampere University of Technology, Finland.
    Jonsson, Magnus
    Högskolan i Halmstad, Akademin för informationsteknologi, Halmstad Embedded and Intelligent Systems Research (EIS), Centrum för forskning om inbyggda system (CERES).
    Vinel, Alexey
    Högskolan i Halmstad, Akademin för informationsteknologi, Halmstad Embedded and Intelligent Systems Research (EIS), Centrum för forskning om inbyggda system (CERES).
    Performance evaluation of IEEE 802.11p-enabled vehicular video surveillance system2014Inngår i: IEEE Communications Letters, ISSN 1089-7798, E-ISSN 1558-2558, Vol. 18, nr 4, s. 708-711Artikkel i tidsskrift (Fagfellevurdert)
    Abstract [en]

    Prospective IEEE 802.11p-based vehicular surveillance system, where video from the vehicle on-board camera is transmitted to the management center, is considered. Multi-hop transmission from the vehicle to the nearest roadside unit and then-via other roadside units-to the gateway is addressed. In this letter we assess the feasibility of such system by analyzing the video end-to-end distortion for a target vehicle, located several hops away from the gateway, when it is alone or there are also other vehicles transmitting video. We demonstrate the importance of dynamic adaptation of the video bit rate of each vehicle depending on the number and positions of the participating vehicles. © 2014 IEEE.

  • 169.
    Bellalta, Boris
    et al.
    Universitat Pompeu Fabra, Barcelona, Spain.
    Vinel, AlexeyDepartment of Communications Engineering, Tampere University of Technology, Finland.Jonsson, MagnusHögskolan i Halmstad, Sektionen för Informationsvetenskap, Data– och Elektroteknik (IDE), Halmstad Embedded and Intelligent Systems Research (EIS), Centrum för forskning om inbyggda system (CERES).Barcelo, JaumeUniversitat Pompeu Fabra, Barcelona, Spain.Maslennikov, RomanUniversity of Nizhny Novgorod, Russia.Chatzimisios, PeriklisAlexander Technological Educational Institute of Thessaloniki Sindos, Greece.Malone, DavidNational University of Ireland, Maynooth, Ireland.
    Multiple Access Communications: 5th International Workshop, MACOM 2012, Maynooth, Ireland, November 19-20, 2012. Proceedings2012Konferanseproceedings (Fagfellevurdert)
    Abstract [en]

    The proceedings contain 18 papers. The topics discussed include: network coding as a WiMAX link reliability mechanism; initialization procedure of wireless network coding with hierarchical decode and forward strategy in random connectivity networks; a coded DHA FH OFDMA system with a noncoherent ML detector under multitone jamming; analysis of inter-RSU beaconing interference in VANETs; survey of energy efficient tracking and localization techniques in buildings using optical and wireless communication media; network coding as a WiMAX link reliability mechanism: an experimental demonstration; spectrum sensing with USRP-E110; power control for wireless networks with a limited number of channels; a measurement study for predicting throughput from LQI and RSSI; reality considerations when designing a TDMA-FDMA based link-layer for real-time WSN; and wireless groupcast routing with palette of transmission methods.

  • 170.
    Bellalta, Boris
    et al.
    Universitat Pompeu Fabra, Barcelona, Spain.
    Zocca, Alessandro
    Eindhoven University of Technology, Eindhoven, The Netherlands.
    Cano, Cristina
    Hamilton Institute, Maynooth, Ireland.
    Checco, Alessandro
    Hamilton Institute, Maynooth, Ireland.
    Barcelo, Jaume
    Universitat Pompeu Fabra, Barcelona, Spain.
    Vinel, Alexey
    Högskolan i Halmstad, Akademin för informationsteknologi, Halmstad Embedded and Intelligent Systems Research (EIS), Centrum för forskning om inbyggda system (CERES).
    Throughput Analysis in CSMA/CA Networks Using Continuous Time Markov Networks: A Tutorial2014Inngår i: Wireless Networking for Moving Objects / [ed] Ivan Ganchev, Marília Curado, Andreas Kassler, Cham: Springer, 2014, s. 115-133Kapittel i bok, del av antologi (Fagfellevurdert)
    Abstract [en]

    This book chapter introduces the use of Continuous Time Markov Networks (CTMN) to analytically capture the operation of Carrier Sense Multiple Access with Collision Avoidance (CSMA/CA) networks. It is of tutorial nature, and it aims to be an introduction on this topic, providing a clear and easy-to-follow description. To illustrate how CTMN can be used, we introduce a set of representative and cutting-edge scenarios, such as Vehicular Ad-hoc Networks (VANETs), Power Line Communication networks and multiple overlapping Wireless Local Area Networks (WLANs). For each scenario, we describe the specific CTMN, obtain its stationary distribution and compute the throughput achieved by each node in the network. Taking the per-node throughput as reference, we discuss how the complex interactions between nodes using CSMA/CA have an impact on system performance.

  • 171.
    Bellone, Mauro
    et al.
    Chalmers University of Technology, Göteborg, Sweden.
    Qutteineh, Jafar
    Högskolan i Halmstad, Akademin för informationsteknologi.
    Extension of Trajectory Planning in Parameterized Spaces to Articulated Vehicles2017Inngår i: Proceedings of the 2017 22nd IEEE International Conference on Emerging Technologies and Factory Automation, Piscataway: Institute of Electrical and Electronics Engineers (IEEE), 2017Konferansepaper (Fagfellevurdert)
    Abstract [en]

    The main objective of this research is to study a novel method for safe maneuvering of articulated vehicles in warehouses. The presented method extends the concept of probabilistic planning on manifolds to articulated vehicles, which will be capable of driving, maneuvering and performing obstacle avoidance in any scenario. The proposed technique involves the extension of a parameterized space, developed for the reactive navigation of differential driven vehicles, to include an additional degree of freedom and use a probabilistic planner to calculate kinematically feasible trajectories. As a result, the algorithm is able to successfully generate maneuvers for an articulated truck and to navigate towards specific target points. The approach was validated using three problems representing different driving scenarios, demonstrating the possible utilization of the method in real-case scenarios. The solutions have been further benchmarked on multiple runs to evaluate success rate and to demonstrate the validity of the algorithm.

  • 172.
    Belova, Anna
    et al.
    Högskolan i Halmstad, Sektionen för Informationsvetenskap, Data– och Elektroteknik (IDE).
    Shmidt, Tamara
    Högskolan i Halmstad, Sektionen för Informationsvetenskap, Data– och Elektroteknik (IDE), Halmstad Embedded and Intelligent Systems Research (EIS), Tillämpad matematik och fysik (MPE-lab).
    Meshfree methods in option pricing2011Independent thesis Advanced level (degree of Master (One Year)), 10 poäng / 15 hpOppgave
    Abstract [en]

    A meshfree approximation scheme based on the radial basis function methods is presented for the numerical solution of the options pricing model. This thesis deals with the valuation of the European, Barrier, Asian, American options of a single asset and American options of multi assets. The option prices are modeled by the Black-Scholes equation. The θ-method is used to discretize the equation with respect to time. By the next step, the option price is approximated in space with radial basis functions (RBF) with unknown parameters, in particular, we con- sider multiquadric radial basis functions (MQ-RBF). In case of Ameri- can options a penalty method is used, i.e. removing the free boundary is achieved by adding a small and continuous penalty term to the Black- Scholes equation. Finally, a comparison of analytical and finite difference solutions and numerical results from the literature is included.

  • 173.
    Belova, Anna
    et al.
    Högskolan i Halmstad, Akademin för informationsteknologi.
    Shmidt, Tamara
    Högskolan i Halmstad, Akademin för informationsteknologi, Halmstad Embedded and Intelligent Systems Research (EIS).
    Ehrhardt, Matthias
    AMNA, Bergische Universität Wuppertal, Wuppertal, Germany.
    Meshfree methods in option pricing2012Konferansepaper (Fagfellevurdert)
    Abstract [en]

    A meshfree approximation scheme based on the radial basis function (RBF) methods is presented for the numerical solution of the options pricing model. This work deals with the valuation of the European, Asian and American options. The option prices are modeled by the Black-Scholes equation. The θ-method is used to discretize the equation with respect to time. Next, the option price is approximated in space with RBF. In case of American options a penalty method is used, i.e. the free boundary is removed by adding a small and continuous penalty term to the Black-Scholes equation. Finally, we present a comparison of analytical and finite difference solutions and numerical results. © 2012 MANT.

  • 174.
    Belvisi, Nicole Mariah Sharon
    Högskolan i Halmstad, Akademin för informationsteknologi.
    Document Forensics Through Textual Analysis2019Independent thesis Advanced level (degree of Master (One Year)), 10 poäng / 15 hpOppgave
    Abstract [en]

    This project aims at giving a brief overview of the area of research called Authorship Analysis with main focus on Authorship Attribution and the existing methods. The second objective of this project is to test whether one of the main approaches in the field can be still be applied successfully to today's new ways of communicating. The study uses multiple stylometric features to establish the authorship of a text as well as a model based on the TF-IDF model.

  • 175.
    Belwal, Chaitanya
    et al.
    Dept. of Computer Science, University of Houston, Houston, USA.
    Cheng, Albert M.K.
    Dept. of Computer Science, University of Houston, Houston, USA.
    Taha, Walid
    Högskolan i Halmstad, Akademin för informationsteknologi, Halmstad Embedded and Intelligent Systems Research (EIS), Centrum för forskning om inbyggda system (CERES).
    Release Offset Bounds for Response Time Analysis of P-FRP using Exhaustive Enumeration2011Inngår i: 2011 IEEE 10th International Conference on Trust, Security and Privacy in Computing and Communications (TrustCom), Piscataway, N.J.: IEEE Press, 2011, s. 950-957Konferansepaper (Fagfellevurdert)
    Abstract [en]

    Functional*Reactive Programming (FRP) is a declarative approach to modeling and building reactive systems. Priority-based FRP (P-FRP) is a formalism of FRP that guarantees real-time response. Unlike the classical preemptive model1 of real-time systems, preempted tasks in PFRP are aborted and have to restart when higher priority tasks have completed. Due to this abort-restart of nature of preemption, there is no single critical instant of release that leads to Worst-Case Response Time (WCRT) of lower priority P-FRP tasks. At this time, the only method for determining the WCRT is through an exhaustive enumeration of all release offsets of higher priority tasks between the release and deadline of the lower priority task. This makes the computational cost of WCRT dependent on the deadline of a task, and when such deadlines are large the computational costs of this technique make it infeasible even for small task sets. In this paper, we show that the release offsets of higher priority tasks have a lower and upper bound and present techniques to derive these bounds. By enumerating only those release offsets while lie within our derived bounds the number of release scenarios that have to be enumerated is significantly reduced. This leads to lower computational costs and makes determination of the WCRT in P-FRP a practically feasible proposition. © 2011 IEEE.

  • 176.
    Belyaev, Evgeny
    et al.
    Department of Signal Processing, Tampere University of Technology, Tampere, Finland.
    Molchanov, Pavlo
    Department of Signal Processing, Tampere University of Technology, Tampere, Finland.
    Vinel, Alexey
    Högskolan i Halmstad, Akademin för informationsteknologi, Halmstad Embedded and Intelligent Systems Research (EIS), Centrum för forskning om inbyggda system (CERES). Department of Electronics and Communication Engineering, Tampere University of Technology, Tampere, Finland.
    Koucheryavy, Yevgeni
    Department of Electronics and Communication Engineering, Tampere University of Technology, Tampere, Finland.
    The Use of Automotive Radars in Video-Based Overtaking Assistance Applications2013Inngår i: IEEE transactions on intelligent transportation systems (Print), ISSN 1524-9050, E-ISSN 1558-0016, Vol. 14, nr 3, s. 1035-1042, artikkel-id 649464Artikkel i tidsskrift (Fagfellevurdert)
    Abstract [en]

    Overtaking on rural roads may cause severe accidents when oncoming traffic is detected by a driver too late, or its speed is underestimated. Recently proposed cooperative overtaking assistance systems are based on real-time video transmission, where a video stream captured with a camera installed at the windshield of a vehicle is compressed, broadcast through the wireless channel, and displayed to the drivers of vehicles driving behind. In such a system, it is of ultimate importance to deliver video information about the opposite lane with low end-to-end latency and good visual quality. In this paper, we propose reallocating the wireless channel resources in favor of the part of the captured video frame containing the image of the oncoming vehicle. To achieve this goal, we apply automotive radar for oncoming vehicle detection, and we use the image of this vehicle as a region-of-interest (ROI) for the video rate control. We present the theoretical framework, which describes the basics of such an approach and can serve as a useful guideline for the future practical implementation of the overtaking assistance systems. The benefits of our proposal are demonstrated in relation to the practical scenario of H.264/Advance Video Coding (AVC), IEEE 802.11p/Wireless Access for Vehicular Environments (WAVE) intervehicle communication standards, and currently used automotive radars.

  • 177.
    Belyaev, Evgeny
    et al.
    Technical University of Denmark, Lyngby, Denmark.
    Moreschini, Sergio
    Tampere University of Technology, Tampere, Finland.
    Vinel, Alexey
    Högskolan i Halmstad, Akademin för informationsteknologi, Halmstad Embedded and Intelligent Systems Research (EIS), Centrum för forskning om inbyggda system (CERES).
    Uncoordinated multi-user video streaming in VANETs using Skype2017Inngår i: 2017 IEEE 22nd International Workshop on Computer Aided Modeling and Design of Communication Links and Networks (CAMAD), 2017Konferansepaper (Fagfellevurdert)
    Abstract [en]

    Real-time video delivery in Vehicle-to-Infrastructure (V2I) scenario enables a variety of multimedia vehicular services. We conduct experiments with Dedicated Short Range Communications (DSRC) transceivers located in the mutual proximity and exchanging Skype video calls traffic. We demonstrate that the lack of coordination between the users both at the application as well as Medium Access Control (MAC) layers results in problems with quality of service provisioning even for the setup without vehicular mobility. © Copyright 2017 IEEE

  • 178.
    Belyaev, Evgeny
    et al.
    Tampere University of Technology, Tampere, Finland.
    Vinel, Alexey
    Högskolan i Halmstad, Akademin för informationsteknologi, Halmstad Embedded and Intelligent Systems Research (EIS), Centrum för forskning om inbyggda system (CERES).
    Poster: Target Packet Loss Selection for Inter-Packet Loss Protection for Video Streaming Over VANETs2014Inngår i: 2014 IEEE Vehicular Networking Conference (VNC) / [ed] Falko Dressler, Onur Altintas, Suman Banerjee, Björn Scheuermann & David Eckhoff, Piscataway, N.J.: IEEE Press, 2014, s. 197-198Konferansepaper (Fagfellevurdert)
    Abstract [en]

    This work is dedicated to a live video streaming in vehicular networks where the application-based inter-packet forward error correction is used for the packet loss protection. A practical way to apply such a protection at the video encoder side for the unknown channel loss rate is proposed. Experimental results which demonstrate the performance for the proposed approach for a scalable extension of the H.264/AVC standard (H.264/SVC) and for the non-standardized video codec based on three-dimensional discrete wavelet transform (3-D DWT) are provided.

  • 179.
    Belyaev, Evgeny
    et al.
    Tampere University of Technology, Tampere, Finland .
    Vinel, Alexey
    Högskolan i Halmstad, Akademin för informationsteknologi, Halmstad Embedded and Intelligent Systems Research (EIS), Centrum för forskning om inbyggda system (CERES). Tampere University of Technology, Tampere, Finland.
    Egiazarian, Karen
    Tampere University of Technology, Tampere, Finland.
    Koucheryavy, Yevgeni
    Tampere University of Technology, Tampere, Finland.
    Power Control in See-Through Overtaking Assistance System2013Inngår i: IEEE Communications Letters, ISSN 1089-7798, E-ISSN 1558-2558, Vol. 17, nr 3, s. 612-615, artikkel-id 6423758Artikkel i tidsskrift (Fagfellevurdert)
    Abstract [en]

    In recently proposed cooperative overtaking assistance systems a video stream captured by a windshield-mounted camera in a vehicle is compressed and broadcast to the vehicle driving behind it, where it is displayed to the driver. It has been shown that this system can provide robust operation if video codec channel adaptation is undertaken by exploiting information from the cooperative awareness messages about any forthcoming increases in the multiple access channel load. In this letter we demonstrate the gains achievable in system performance when the video transmitter power control is also used. © 1997-2012 IEEE.

  • 180.
    Belyaev, Evgeny
    et al.
    Tampere University of Technology, Tempere, Finland.
    Vinel, Alexey
    Högskolan i Halmstad, Akademin för informationsteknologi, Halmstad Embedded and Intelligent Systems Research (EIS), Centrum för forskning om inbyggda system (CERES).
    Jonsson, Magnus
    Högskolan i Halmstad, Akademin för informationsteknologi, Halmstad Embedded and Intelligent Systems Research (EIS), Centrum för forskning om inbyggda system (CERES).
    Sjöberg, Katrin
    Volvo GTT, Göteborg, Sweden.
    Live video streaming in IEEE 802.11p vehicular networks: Demonstration of an automotive surveillance application2014Inngår i: Computer Communications Workshops (INFOCOM WKSHPS), 2014 IEEE Conference on, Piscataway, United States: IEEE Press, 2014, s. 131-132Konferansepaper (Fagfellevurdert)
    Abstract [en]

    Prospective IEEE 802.11p-enabled automotive video applications are identified. Preliminary experimental results of inter-vehicular live video streaming for surveillance applications are presented. A test-bed for the demonstration of the achievable visual quality under different channel conditions is described.

  • 181.
    Belyaev, Evgeny
    et al.
    Tampere University of Technology, Tampere, Finland.
    Vinel, Alexey
    Högskolan i Halmstad, Akademin för informationsteknologi, Halmstad Embedded and Intelligent Systems Research (EIS), Centrum för forskning om inbyggda system (CERES).
    Surak, Adam
    Tampere University of Technology, Tampere, Finland.
    Gabbouj, Moncef
    Tampere University of Technology, Tampere, Finland.
    Jonsson, Magnus
    Högskolan i Halmstad, Akademin för informationsteknologi, Halmstad Embedded and Intelligent Systems Research (EIS), Centrum för forskning om inbyggda system (CERES).
    Egiazarian, Karen
    Tampere University of Technology, Tampere, Finland.
    Robust vehicle-to-infrastructure video transmission for road surveillance applications2015Inngår i: IEEE Transactions on Vehicular Technology, ISSN 0018-9545, E-ISSN 1939-9359, Vol. 64, nr 7, s. 2991-3003Artikkel i tidsskrift (Fagfellevurdert)
    Abstract [en]

    IEEE 802.11p vehicle-to-vehicle and vehicle-to-infrastructure communication technology is currently an emerging research topic in both industry and academia. Respective spectrum allocation of 10 MHz channels in the 5.9 GHz band for USA and Europe allows considering inter-vehicle transmission of a live video information as a basis, which enables a new class of safety and infotainment automotive applications such as road video surveillance. This paper is first of its kind where such a video transmission system is developed and experimentally validated. We propose a low-complexity unequal packet loss protection and rate control algorithms for a scalable video coding based on the three-dimensional discrete wavelet transform. We show that in comparison with a scalable extension of the H.264/AVC standard the new codec is less sensitive to packet losses, has less computational complexity and provides comparable performance in case of unequal packet loss protection. It is specially designed to cope with severe channel fading typical for dynamic vehicular environments and has a low complexity, making it a feasible solution for real-time automotive surveillance applications. Extensive measurements obtained in realistic city traffic scenarios demonstrate that good visual quality and continuous playback is possible when the moving vehicle is in the radius of 600 meters from the roadside unit. ©2014 IEEE

  • 182.
    Bengtsson, Henrik
    et al.
    Högskolan i Halmstad, Sektionen för Informationsvetenskap, Data– och Elektroteknik (IDE).
    Uhlemann, Elisabeth
    Högskolan i Halmstad, Akademin för informationsteknologi, Halmstad Embedded and Intelligent Systems Research (EIS), Inbyggda system (CERES).
    Wiberg, Per-Arne
    Högskolan i Halmstad, Akademin för informationsteknologi, Halmstad Embedded and Intelligent Systems Research (EIS), Inbyggda system (CERES).
    Protocol for wireless real-time systems1999Inngår i: Proceedings of the 11th Euromicro Conference on Real-Time Systems, 1999, Los Alamitos, CA: IEEE Computer Society , 1999, s. 168-174, artikkel-id 777463Konferansepaper (Fagfellevurdert)
    Abstract [en]

    A protocol and a communication mechanism intended for time and safety critical applications using a radio channel for information transport are considered jointly. The protocol is based on a scheme of retransmissions done on demand within a given time window. Each retransmission is coded with a varying number of redundant symbols. The set of blocks used for retransmission is controlled by two quality-of-service parameters: deadline for the transmission and the probability that the correct decoded message will reach the recipient before this deadline. Analysis of a protocol model indicates that it is possible to transmit time critical information in a mobile wireless system with very low error probabilities in an industrial environment.

  • 183.
    Bengtsson, Hoai
    et al.
    Viktoria Swedish ICT, Gothenburg, Sweden.
    Chen, Lei
    Viktoria Swedish ICT, Gothenburg, Sweden.
    Voronov, Alexey
    Viktoria Swedish ICT, Gothenburg, Sweden.
    Englund, Cristofer
    Högskolan i Halmstad, Akademin för informationsteknologi, Halmstad Embedded and Intelligent Systems Research (EIS), CAISR Centrum för tillämpade intelligenta system (IS-lab). Viktoria Swedish ICT, Gothenburg, Sweden.
    Interaction Protocol for Highway Platoon Merge2015Inngår i: 2015 IEEE 18th International Conference on Intelligent Transportation Systems / [ed] Lisa O’Conner, Los Alamitos: IEEE, 2015, s. 1971-1976, artikkel-id 7313411Konferansepaper (Fagfellevurdert)
    Abstract [en]

    An interaction protocol for cooperative platoon merge on highways is proposed. The interaction protocol facilitates a challenge scenario for the Grand Cooperative Driving Challenge (GCDC) 2016, where two platoons running on separate lanes merge into one platoon due to a roadwork in one of the lanes. Detailed interaction procedures, described with state machines of each vehicle are presented. A communication message set is designed to support platoon controllers to perform safe and efficient manoeuvres. © 2015 IEEE.

  • 184.
    Bengtsson, Jerker
    Högskolan i Halmstad, Sektionen för Informationsvetenskap, Data– och Elektroteknik (IDE), Halmstad Embedded and Intelligent Systems Research (EIS).
    Baseband Processing in 3G UMTS Radio Base Stations2006Rapport (Annet vitenskapelig)
    Abstract [en]

    This report presents a study of functionality, service dataflows, computation characteristics and processing parameters for baseband processing in radio base stations. The study has been performed with the objective to develop a programming model that is natural and efficient to use for baseband programming and which can be efficiently compiled to parallel computing structures. In order to achieve this objective it is necessary to analyse and understand the logical architecture of the application in order to be able to define processing characteristics and thereby requirements on languages as well as on physical system architectures. Moreover, to be able to test and verify programming and mapping of functions it is necessary to have realistic but still manageable test cases. The study is focused on the third generation partnership project (3GPP) standard specifications for 3G radio base stations. The specifications cover the complete 3G network-architecture and are quite extensive and complex. To make experiments manageable, it is necessary to abstract system functionality that is not directly relevant for the RBS baseband processing. Moreover, the standard specifications only describe the required processing functionality on an abstract logical level. In this report, the functionality of the baseband functions is explained and also described using illustrations of dataflows and abstract mapping of two 3G service cases. The results of the study constitute a comprehensive description of the processing flow and the mapping of user data channels in 3G radio base stations – spanning data and control input from layer 2 to physical channel output from layer 1. Data dependencies between functions are illustrated with figures and it is concluded that these dependencies are of producer/consumer type. It is discussed how different functions can be mapped in MIMD and SIMD fashion with regard to the data dependencies, the data stream lengths and the control operations required to handle bit stream processing on word-length processor architectures.

  • 185.
    Bengtsson, Jerker
    Högskolan i Halmstad, Sektionen för Informationsvetenskap, Data– och Elektroteknik (IDE), Halmstad Embedded and Intelligent Systems Research (EIS).
    Efficient implementation of stream applications on processor arrays2006Licentiatavhandling, med artikler (Annet vitenskapelig)
    Abstract [en]

    This thesis concludes work conducted on exploring the usage of parallel and reconfigurable processor architectures in industrial high-performance embedded systems. This kind of systems has by tradition been built using a mix of digital signal processors and custom made hardware. Digital signal processors provide full functional felxibility, but at the cost of lower performance. Custom made hardware can be optimized for specific functions for high performance, but at the cost of inflexibility and high development costs. A desire is to combine flexibility and performance using commercial hardware, without trading too much of performance for flexibility.

    Parallel and reconfigurable architectures provide a flexible computing space constituting processing elements that are coupled through configurable communication structures. Architectures designed with less complex processing elements render a high degree of utilizable parallelism at the cost of having to use a portion of the pocessing elements for control functions. In the thesis it is shown that it is possible to utilize this kind of architecture to achieve high performance efficiency, despite the fact that a large fraction of PEs are required to implement control-oriented portions in a fairly complex algorithm.

    A major problem is that architectures of this kind expose a very complex programming abstraction for compilers and programmers. The approach taken in this work is a domain-specific stream processing model which provides means to express application-specific dataflows and computations in terms of streams. An extensive application study comprising the baseband processing in radio base stations has been used to define sufficient data types, operators and language construct. Furthermore, to support industrial requirements on portability to different architectures, it must be possible to express parallelism and characteristic computations without exposing of hardware details in the source code.

    To be able to prototype and set up experiments with stream processing languages an experimental programming framework has been developed. A first prototype language with specific primitive types, operators and stream constructs has been implemented in order to elaborate with baseband programming. It is demonstrated how these types and operators can be used to express machine-independent bit field and other fine-grained data parallel computations. Furthermore, the language has been designed with constructs for efficient and flexible programming of reconfiguration of distributed function parameters.

  • 186.
    Bengtsson, Jerker
    Högskolan i Halmstad, Sektionen för Informationsvetenskap, Data– och Elektroteknik (IDE), Halmstad Embedded and Intelligent Systems Research (EIS), Centrum för forskning om inbyggda system (CERES).
    Intermediate representations for simulation and implementation2010Inngår i: Handbook of Signal processing systems / [ed] S.S Bhattacharyya, E.F. Deprettere, R. Leupers and J. Takala, New York: Springer-Verlag New York, 2010, 1, s. 739-767Kapittel i bok, del av antologi (Annet vitenskapelig)
  • 187.
    Bengtsson, Jerker
    Högskolan i Halmstad, Sektionen för Informationsvetenskap, Data– och Elektroteknik (IDE), Halmstad Embedded and Intelligent Systems Research (EIS), Centrum för forskning om inbyggda system (CERES).
    Models and Methods for Development of DSP Applications on Manycore Processors2009Doktoravhandling, med artikler (Annet vitenskapelig)
    Abstract [en]

    Advanced digital signal processing systems require specialized high-performance embedded computer architectures. The term high-performance translates to large amounts of data and computations per time unit. The term embedded further implies requirements on physical size and power efficiency. Thus the requirements are of both functional and non-functional nature. This thesis addresses the development of high-performance digital signal processing systems relying on manycore technology. We propose building two-level hierarchical computer architectures for this domain of applications. Further, we outline a tool flow based on methods and analysis techniques for automated, multi-objective mapping of such applications on distributed memory manycore processors. In particular, the focus is put on how to provide a means for tunable strategies for mapping of task graphs on array structured distributed memory manycores, with respect to given application constraints. We argue for code mapping strategies based on predicted execution performance, which can be used in an auto-tuning feedback loop or to guide manual tuning directed by the programmer. Automated parallelization, optimisation and mapping to a manycore processor benefits from the use of a concurrent programming model as the starting point. Such a model allows the programmer to express different types and granularities of parallelism as well as computation characteristics of importance in the addressed class of applications. The programming model should also abstract away machine dependent hardware details. The analytical study of WCDMA baseband processing in radio base stations, presented in this thesis, suggests dataflow models as a good match to the characteristics of the application and as execution model abstracting computations on a manycore. Construction of portable tools further requires a manycore machine model and an intermediate representation. The models are needed in order to decouple algorithms, used to transform and map application software, from hardware. We propose a manycore machine model that captures common hardware resources, as well as resource dependent performance metrics for parallel computation and communication. Further, we have developed a multifunctional intermediate representation, which can be used as source for code generation and for dynamic execution analysis. Finally, we demonstrate how we can dynamically analyse execution using abstract interpretation on the intermediate representation. It is shown that the performance predictions can be used to accurately rank different mappings by best throughput or shortest end-to-end computation latency.

  • 188.
    Bengtsson, Jerker
    et al.
    Högskolan i Halmstad, Sektionen för Informationsvetenskap, Data– och Elektroteknik (IDE), Halmstad Embedded and Intelligent Systems Research (EIS).
    Gaspes, Veronica
    Högskolan i Halmstad, Sektionen för Informationsvetenskap, Data– och Elektroteknik (IDE), Halmstad Embedded and Intelligent Systems Research (EIS).
    Svensson, Bertil
    Högskolan i Halmstad, Sektionen för Informationsvetenskap, Data– och Elektroteknik (IDE), Halmstad Embedded and Intelligent Systems Research (EIS), Centrum för forskning om inbyggda system (CERES).
    Machine Assisted Code Generation for Manycore Processors2007Inngår i: Proceedings of the 9th biennial SNART Conference on Real-Time Systems (Real-Time in Sweden - RTiS'07), 2007, s. 9-Konferansepaper (Fagfellevurdert)
  • 189.
    Bengtsson, Jerker
    et al.
    Högskolan i Halmstad, Sektionen för Informationsvetenskap, Data– och Elektroteknik (IDE), Halmstad Embedded and Intelligent Systems Research (EIS), Centrum för forskning om inbyggda system (CERES).
    Hoang Bengtsson, Hoai
    Högskolan i Halmstad, Sektionen för Informationsvetenskap, Data– och Elektroteknik (IDE), Halmstad Embedded and Intelligent Systems Research (EIS), Centrum för forskning om inbyggda system (CERES).
    Dynamic Real-time DSP on Manycores2010Konferansepaper (Fagfellevurdert)
  • 190.
    Bengtsson, Jerker
    et al.
    Högskolan i Halmstad, Sektionen för Informationsvetenskap, Data– och Elektroteknik (IDE), Halmstad Embedded and Intelligent Systems Research (EIS).
    Svensson, Bertil
    Högskolan i Halmstad, Sektionen för Informationsvetenskap, Data– och Elektroteknik (IDE), Halmstad Embedded and Intelligent Systems Research (EIS), Centrum för forskning om inbyggda system (CERES).
    A configurable framework for stream programming exploration in baseband applications2006Inngår i: 2006 IEEE International Parallel & Distributed Processing Symposium: Rhodes Island, Greece : 25-29 April, 2006, Piscataway, N.J.: IEEE Press, 2006, s. 8-Konferansepaper (Fagfellevurdert)
    Abstract [en]

    This paper presents a configurable framework to be used for rapid prototyping of stream based languages. The framework is based on a set of design patterns defining the elementary structure of a domain specific language for high-performance signal processing. A stream language prototype for baseband processing has been implemented using the framework. We introduce language constructs to efficiently handle dynamic reconfiguration of distributed processing parameters. It is also demonstrated how new language specific primitive data types and operators can be used to efficiently and machine independently express computations on bitfields and data-parallel vectors. These types and operators yield code that is readable, compact and amenable to a stricter type checking than is common practice. They make it possible for a programmer to explicitly express parallelism to be exploited by a compiler. In short, they provide a programming style that is less error prone and has the potential to lead to more efficient implementations.

  • 191.
    Bengtsson, Jerker
    et al.
    Högskolan i Halmstad, Sektionen för Informationsvetenskap, Data– och Elektroteknik (IDE), Halmstad Embedded and Intelligent Systems Research (EIS), Centrum för forskning om inbyggda system (CERES).
    Svensson, Bertil
    Högskolan i Halmstad, Sektionen för Informationsvetenskap, Data– och Elektroteknik (IDE), Halmstad Embedded and Intelligent Systems Research (EIS), Centrum för forskning om inbyggda system (CERES).
    A domain-specic approach for software development on manycore platforms2008Konferansepaper (Fagfellevurdert)
    Abstract [en]

    The programming complexity of increasingly parallel processors calls for new tools that assist programmers in utilising the parallel hardware resources. In this paper we present a set of models that we have developed as part of a tool for mapping dataflow graphs onto manycores. One of the models captures the essentials of manycores identified as suitable for signal processing, and which we use as tar- get for our algorithms. As an intermediate representation we introduce timed configuration graphs, which describe the mapping of a model of an application onto a machine model. Moreover, we show how a timed configuration graph by very simple means can be evaluated using an abstract interpretation to obtain performance feedback. This infor- mation can be used by our tool and by the programmer in order to discover improved mappings.

  • 192.
    Bengtsson, Jerker
    et al.
    Högskolan i Halmstad, Sektionen för Informationsvetenskap, Data– och Elektroteknik (IDE), Halmstad Embedded and Intelligent Systems Research (EIS), Centrum för forskning om inbyggda system (CERES).
    Svensson, Bertil
    Högskolan i Halmstad, Sektionen för Informationsvetenskap, Data– och Elektroteknik (IDE), Halmstad Embedded and Intelligent Systems Research (EIS), Centrum för forskning om inbyggda system (CERES).
    A Domain-specific Approach for Software Development on Manycore Platforms2008Inngår i: SIGARCH Computer Architecture News, ISSN 0163-5964, E-ISSN 1943-5851, Vol. 36, nr 5, s. 2-10Artikkel i tidsskrift (Fagfellevurdert)
    Abstract [en]

    The programming complexity of increasingly parallel processors calls for new tools that assist programmers in utilising the parallel hardware resources. In this paper we present a set of models that we have developed as part of a tool for mapping dataflow graphs onto manycores. One of the models captures the essentials of manycores identified as suitable for signal processing, and which we use as target for our algorithms. As an intermediate representation we introduce timed configuration graphs, which describe the mapping of a model of an application onto a machine model. Moreover, we show how a timed configuration graph by very simple means can be evaluated using an abstract interpretation to obtain performance feedback. This information can be used by our tool and by the programmer in order to discover improved mappings.

  • 193.
    Bengtsson, Jerker
    et al.
    Högskolan i Halmstad, Sektionen för Informationsvetenskap, Data– och Elektroteknik (IDE), Halmstad Embedded and Intelligent Systems Research (EIS), Centrum för forskning om inbyggda system (CERES).
    Svensson, Bertil
    Högskolan i Halmstad, Sektionen för Informationsvetenskap, Data– och Elektroteknik (IDE), Halmstad Embedded and Intelligent Systems Research (EIS), Centrum för forskning om inbyggda system (CERES).
    Manycore performance analysis using timed configuration graphs2009Inngår i: International Symposium on Systems, Architectures, Modeling, and Simulation, 2009. SAMOS '09 / [ed] Michael Joseph Schulte and Walid Najjar, Piscataway, N.J.: IEEE Press, 2009, s. 108-117Konferansepaper (Fagfellevurdert)
    Abstract [en]

    The programming complexity of increasingly parallel processors calls for new tools to assist programmers in utilising the parallel hardware resources. In this paper we present a set of models that we have developed to form part of a tool which is intended for iteratively tuning the mapping of dataflow graphs onto manycores. One of the models is used for capturing the essentials of manycores that are identified as suitable for signal processing and which we use as target architectures. Another model is the intermediate representation in the form of a timed configuration graph, describing the mapping of a dataflow graph onto a machine model. Moreover, this IR can be used for performance evaluation using abstract interpretation. We demonstrate how the models can be configured and applied in order to map applications on the Raw processor. Furthermore, we report promising results on the accuracy of performance predictions produced by our tool. It is also demonstrated that the tool can be used to rank different mappings with respect to optimisation on throughput and end-to-end latency.

  • 194.
    Bengtsson, Jerker
    et al.
    Högskolan i Halmstad, Sektionen för Informationsvetenskap, Data– och Elektroteknik (IDE), Halmstad Embedded and Intelligent Systems Research (EIS), Centrum för forskning om inbyggda system (CERES).
    Svensson, Bertil
    Högskolan i Halmstad, Sektionen för Informationsvetenskap, Data– och Elektroteknik (IDE), Halmstad Embedded and Intelligent Systems Research (EIS), Centrum för forskning om inbyggda system (CERES).
    Methodologies and tools for development of signal processing software on multicore platforms2008Inngår i: 2008 proceedings of the 41st Annual IEEE/ACM International Symposium on Microarchitecture: MICRO-41, November 8-12, 2008, Lake Como, Italy, Piscataway, N.J.: IEEE Computer Society, 2008, s. 2-Konferansepaper (Fagfellevurdert)
  • 195.
    Bengtsson, Jonas
    et al.
    Högskolan i Halmstad, Akademin för informationsteknologi.
    Homovic, Enesa
    Högskolan i Halmstad, Akademin för informationsteknologi.
    Co-Creating value: Motivation till att delta i Co-Creation via ett innovation community2015Independent thesis Basic level (degree of Bachelor), 10 poäng / 15 hpOppgave
    Abstract [sv]

    På senare år har organisationer börjat samarbeta med konsumenter för att tillsammans ta fram idéer och skapa nya produkter. Organisationen samskapar då ett värde tillsammans med konsumenterna, även kallat Co-Creation. Detta tillvägagångsätt har blivit allt vanligare tack vare utvecklingen av webbteknologin. Organisationer kan nu skapa innovation tillsammans med konsumenter online genom bland annat innovation communities. Syftet med studien var att undersöka vad som motiverar användare i organisationsdrivna communities att delta i CoCreation. Detta för att ge en ökad insikt kring hur ett innovation community kan skapas för att motivera konsumenter att bidra till Co-Creation. För att svara på detta genomförde vi en netnografisk studie bestående av observationer och intervjuer. Studien visade att användare motiveras av både inre och yttre motivationsfaktorer och att dessa är samverkande. Som bekräftat av tidigare studier ser vi också vikten av interaktion från organisationen sida. I uppsatsen tas problem upp som kan påverka användares motivation till att bidra. Vi tar även upp vilken betydelse de yttre motivationsfaktorer har och hur dessa påverkar användarens inre motivation.

  • 196.
    Bengtsson, Lars
    et al.
    Högskolan i Halmstad, Akademin för informationsteknologi, Halmstad Embedded and Intelligent Systems Research (EIS). Chalmers University of Technology, Gothenburg, Sweden.
    Linde, Arne
    Chalmers University of Technology, Gothenburg, Sweden.
    Nordström, Tomas
    Högskolan i Halmstad, Akademin för informationsteknologi, Halmstad Embedded and Intelligent Systems Research (EIS). Telecommunications Research Center Vienna (FTW), Vienna, Austria.
    Svensson, Bertil
    Högskolan i Halmstad, Akademin för informationsteknologi, Halmstad Embedded and Intelligent Systems Research (EIS), Centrum för forskning om inbyggda system (CERES).
    Taveniku, Mikael
    XCube Communication, Inc., Westford, MA, United States.
    The REMAP Reconfigurable Architecture: a Retrospective2006Inngår i: FPGA Implementations of Neural Networks, New York: Springer-Verlag New York, 2006, s. 325-360Kapittel i bok, del av antologi (Fagfellevurdert)
    Abstract [en]

    The goal of the REMAP project was to gain new knowledge about the design and use of massively parallel computer architectures in embedded real-time systems. In order to support adaptive and learning behavior in such systems, the efficient execution of Artificial Neural Network (ANN) algorithms on regular processor arrays was in focus. The REMAP-β parallel computer built in the project was designed with ANN computations as the main target application area. This chapter gives an overview of the computational requirements found in ANN algorithms in general and motivates the use of regular processor arrays for the efficient execution of such algorithms. REMAP-β was implemented using the FPGA circuits that were available around 1990. The architecture, following the SIMD principle (Single Instruction stream, Multiple Data streams), is described, as well as the mapping of some important and representative ANN algorithms. Implemented in FPGA, the system served as an architecture laboratory. Variations of the architecture are discussed, as well as scalability of fully synchronous SIMD architectures. The design principles of a VLSI-implemented successor of REMAP-β are described, and the paper is concluded with a discussion of how the more powerful FPGA circuits of today could be used in a similar architecture. © 2006 Springer.

  • 197.
    Bengtsson, Lars
    et al.
    Högskolan i Halmstad, Sektionen för Informationsvetenskap, Data– och Elektroteknik (IDE), Halmstad Embedded and Intelligent Systems Research (EIS).
    Nilsson, Kenneth
    Högskolan i Halmstad, Sektionen för Informationsvetenskap, Data– och Elektroteknik (IDE), Halmstad Embedded and Intelligent Systems Research (EIS).
    Svensson, Bertil
    Högskolan i Halmstad, Sektionen för Informationsvetenskap, Data– och Elektroteknik (IDE), Halmstad Embedded and Intelligent Systems Research (EIS). Department of Computer Engineering, Chalmers University of Technology, Göteborg, Sweden.
    A processor array module for distributed, massively parallel, embedded computing1993Inngår i: Microprocessing and Microprogramming, ISSN 0165-6074, Vol. 38, nr 1-5, s. 529-537Artikkel i tidsskrift (Fagfellevurdert)
    Abstract [en]

    With the increased degree of miniaturization resulting from the use of modem VLSI technology and the high communication bandwidth available through optical connections, it is now possible to build massively parallel computers based on distributed modules which can be embedded in advanced industrial products. Examples of such future possibilities are ''action-oriented systems'', in which a network of highly parallel modules perform a multitude of tasks related to perception, cognition, and action. The paper discusses questions of architecture on the level of modules and inter-module communication and gives concrete architectural solutions which meet the demands of typical, advanced industrial real-time applications. The interface between the processors arrays and the all-optical communication network is described in some detail. Implementation issues specifically related to the demand for miniaturization are discussed.

  • 198.
    Bengtsson, Matilda
    Högskolan i Halmstad, Akademin för informationsteknologi, Halmstad Embedded and Intelligent Systems Research (EIS).
    Color adjustment of digital images of clothes for truthful rendering2016Independent thesis Advanced level (degree of Master (Two Years)), 20 poäng / 30 hpOppgave
    Abstract [en]

    E-commerce is a growing market for selling gods and digital images are often used to display the product. However, there is a problem when the color of the object does not match the reality. This can lead to a dissatisfaction of the customer and a return of the product. Returned goods causes a significant loss in revenue for the suppliers. One reason for untruthful rendering of colors in images is due to different temperatures, or colors, of the illumination sources lighting the scene and the object. This effect can be reduced by a method called white balance. In this thesis, an algorithm based on the technique in Hsu et al. was implemented for a more truthful rendering of images of clothes and toys used in e-commerce. The algorithm removes unwanted color casts induced in the image from two different illumination sources. The thesis also marks important details missing in aforementioned paper as well as some drawbacks of the proposed technique, such as high processing time.

  • 199.
    Bengtsson, Ola
    et al.
    Högskolan i Halmstad, Akademin för informationsteknologi, Halmstad Embedded and Intelligent Systems Research (EIS).
    Baerveldt, Albert-Jan
    Högskolan i Halmstad, Akademin för informationsteknologi, Halmstad Embedded and Intelligent Systems Research (EIS).
    Localization in changing environments - Estimation of a covariance matrix for the IDC algorithm2001Inngår i: Proceedings 2001 IEEE/RSJ International Conference on Intelligent Robots and Systems. Expanding the Societal Role of Robotics in the the Next Millennium (Cat. No.01CH37180): Volume 4 of 4, Piscataway, N.J.: IEEE, 2001, s. 1931-1937Konferansepaper (Fagfellevurdert)
    Abstract [en]

    Previously we have presented a new scan-matching algorithm, based on the IDC - Iterative Dual Correspondence- algorithm, which showed a good localization performance even in the case of severe changes in the environment. The Problem of the IDC-algorithm is that there is no good way to estimate the covariance matrix of the position estimate, which prohibits an effective fusion with other position estimates from other sensors, e.g by means of the Kalman filter. In this paper we present a new way to estimate the covariance matrix, by estimating the Hessian matrix of the error function that is minimized by the IDC scan-matching algorithm. Simulation results show that the estimated covariance matrix correspond well to the real one.

  • 200.
    Bengtsson, Ola
    et al.
    Högskolan i Halmstad, Sektionen för Informationsvetenskap, Data– och Elektroteknik (IDE), Halmstad Embedded and Intelligent Systems Research (EIS).
    Baerveldt, Albert-Jan
    Högskolan i Halmstad, Sektionen för Informationsvetenskap, Data– och Elektroteknik (IDE), Halmstad Embedded and Intelligent Systems Research (EIS).
    Robot localization based on scan-matching - estimating the covariance matrix for the IDC algorithm2003Inngår i: Robotics and Autonomous Systems, ISSN 0921-8890, E-ISSN 1872-793X, Vol. 44, nr 1, s. 29-40Artikkel i tidsskrift (Fagfellevurdert)
    Abstract [en]

    We have previously presented a new scan-matching algorithm based on the IDC (iterative dual correspondence) algorithm, which showed a good localization performance even in environments with severe changes. The problem of the IDC algorithm is that there is no good way to estimate a covariance matrix of the position estimate, which prohibits an effective fusion with other position estimates of other sensors. This paper presents two new ways to estimate the covariance matrix. The first estimates the covariance matrix from the Hessian matrix of the error function minimized by the scan-matching algorithm. The second one, which is an off-line method, estimates the covariance matrix of a specific scan, from a specific position by simulating and matching scans around the position. Simulation results show that the covariance matrix provided by the off-line method fully corresponds with the real one. Some preliminary tests on real data indicate that the off-line method gives a good quality value of a specific scan position, which is of great value in map building.

1234567 151 - 200 of 1972
RefereraExporteraLink til resultatlisten
Permanent link
Referera
Referensformat
  • apa
  • harvard1
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Annet format
Fler format
Språk
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Annet språk
Fler språk
Utmatningsformat
  • html
  • text
  • asciidoc
  • rtf