hh.sePublikationer
Ändra sökning
Avgränsa sökresultatet
12345 151 - 200 av 208
RefereraExporteraLänk till träfflistan
Permanent länk
Referera
Referensformat
  • apa
  • harvard1
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Annat format
Fler format
Språk
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Annat språk
Fler språk
Utmatningsformat
  • html
  • text
  • asciidoc
  • rtf
Träffar per sida
  • 5
  • 10
  • 20
  • 50
  • 100
  • 250
Sortering
  • Standard (Relevans)
  • Författare A-Ö
  • Författare Ö-A
  • Titel A-Ö
  • Titel Ö-A
  • Publikationstyp A-Ö
  • Publikationstyp Ö-A
  • Äldst först
  • Nyast först
  • Skapad (Äldst först)
  • Skapad (Nyast först)
  • Senast uppdaterad (Äldst först)
  • Senast uppdaterad (Nyast först)
  • Disputationsdatum (tidigaste först)
  • Disputationsdatum (senaste först)
  • Standard (Relevans)
  • Författare A-Ö
  • Författare Ö-A
  • Titel A-Ö
  • Titel Ö-A
  • Publikationstyp A-Ö
  • Publikationstyp Ö-A
  • Äldst först
  • Nyast först
  • Skapad (Äldst först)
  • Skapad (Nyast först)
  • Senast uppdaterad (Äldst först)
  • Senast uppdaterad (Nyast först)
  • Disputationsdatum (tidigaste först)
  • Disputationsdatum (senaste först)
Markera
Maxantalet träffar du kan exportera från sökgränssnittet är 250. Vid större uttag använd dig av utsökningar.
  • 151.
    Siek, Jeremy
    et al.
    University of Colorado, Boulder, CO, USA.
    Taha, Walid
    Rice University, Houston, TX, USA.
    Gradual Typing for Functional Languages2007Konferensbidrag (Refereegranskat)
    Abstract [en]

    Static and dynamic type systems have well-known strengths and weaknesses. In previous work we developed a gradual type system for a functional calculus named $\lambda^?_\to$. Gradual typing provides the benefits of both static and dynamic checking in a single language by allowing the programmer to control whether a portion of the program is type checked at compile-time or run-time by adding or removing type annotations on variables. Several object-oriented scripting languages are preparing to add static checking. To support that work this paper develops $\mathbf{Ob}^{?}_{<:}$, a gradual type system for object-based languages, extending the Ob < : calculus of Abadi and Cardelli. Our primary contribution is to show that gradual typing and subtyping are orthogonal and can be combined in a principled fashion. We also develop a small-step semantics, provide a machine-checked proof of type safety, and improve the space efficiency of higher-order casts.

  • 152.
    Siek, Jeremy
    et al.
    University of Colorado, Boulder, CO 80309, United States.
    Taha, Walid
    Rice University, Houston, TX 77005, United States.
    Gradual typing for objects2007Ingår i: ECOOP 2007 – Object-Oriented Programming: 21st European Conference, Berlin, Germany, July 30 - August 3, 2007. Proceedings / [ed] Erik Ernst, Berlin: Springer Berlin/Heidelberg, 2007, s. 2-27Konferensbidrag (Refereegranskat)
    Abstract [en]

    Static and dynamic type systems have well-known strengthsand weaknesses. In previous work we developed a gradual type system fora functional calculus named λ?→. Gradual typing provides the benefits ofboth static and dynamic checking in a single language by allowing theprogrammer to control whether a portion of the program is type checkedat compile-time or run-time by adding or removing type annotations onvariables. Several object-oriented scripting languages are preparing toadd static checking. To support that work this paper develops Ob?<:,a gradual type system for object-based languages, extending the Ob<:calculus of Abadi and Cardelli. Our primary contribution is to show thatgradual typing and subtyping are orthogonal and can be combined in aprincipled fashion. We also develop a small-step semantics, provide amachine-checked proof of type safety, and improve the space efficiencyof higher-order casts.

  • 153.
    Sjöholm, Peter
    Högskolan i Halmstad, Sektionen för Informationsvetenskap, Data– och Elektroteknik (IDE).
    The Extendable Guideline for Analysing Malicious PDF Documents2013Självständigt arbete på grundnivå (kandidatexamen), 10 poäng / 15 hpStudentuppsats (Examensarbete)
    Abstract [en]

    Today, the average computer user has undoubtedly encountered the PDF format while handling electronic documents. Due to its wide-spread popularity and feature richness, PDF documents are commonly utilized by attackers in order to infect systems with malware.

    This thesis will present The Extendable Guideline for Analysing Malicious PDF Documents. This work will establish the foundation of the guideline and populate it with a part of the analysis process. The guideline relies on earlier published material in the topic. It is a practical guideline that is followed by the use of a flowchart and can be utilized by an analyst in order to determine if a PDF document is malicious or not. It provides technical background information, suitable analysis techniques, and tools. The guideline structure was developed by using sequential thinking in combination with the divide and conquer paradigm.

    The thesis will also elucidate commonly applied techniques that are used by malicious PDF authors in order to infect systems, evade detection, and distribute their malicious documents. A commonly utilized function in PDF documents are the JavaScript feature. There are a wide range of other features that are targeted by malicious PDF authors, but they are more rarely encountered. PDF documents are often distributed by attackers by sending them as an attachment in an email, or storing the document on a web server.

  • 154.
    Smeraldi, Fabrizio
    et al.
    Högskolan i Halmstad. Swiss Federal Institute of Technology (EPFL-DI), Lausanne, Switzerland.
    Bigun, Josef
    Högskolan i Halmstad, Akademin för informationsteknologi, Halmstad Embedded and Intelligent Systems Research (EIS).
    Gerstner, Wulfram
    Swiss Federal Institute of Technology (EPFL-DI), Lausanne, Switzerland.
    Support vector features and the role of dimensionality in face authentication2002Ingår i: Pattern recognition with support vector machines / [ed] Seong-Whan Lee, Alessandro Verri, Heidelberg: Springer Berlin/Heidelberg, 2002, Vol. LNCS-2388, s. 249-259Konferensbidrag (Övrigt vetenskapligt)
    Abstract [en]

    A study of the dimensionality of the Face Authentication problem using Principal Component Analysis (PCA) and a novel dimensionality reduction algorithm that we call Support Vector Features (SVFs) is presented. Starting from a Gabor feature space, we show that PCA and SVFs identify distinct subspaces with comparable authentication and generalisation performance. Experiments using KNN classifiers and Support Vector Machines (SVMs) on these reduced feature spaces show that the dimensionality at which saturation of the authentication performance is achieved heavily depends on the choice of the classifier. In particular, SVMs involve directions in feature space that carry little variance and therefore appear to be vulnerable to excessive PCA-based compression. © Springer-Verlag Berlin Heidelberg 2002.

  • 155.
    Sohls, Eric
    et al.
    Högskolan i Halmstad, Akademin för informationsteknologi.
    Roos, Andreas
    Högskolan i Halmstad, Akademin för informationsteknologi.
    Psuedoslumptalsgeneratorer: Periodlängden den korta förbrytaren.2019Självständigt arbete på grundnivå (kandidatexamen), 10 poäng / 15 hpStudentuppsats (Examensarbete)
    Abstract [sv]

    I rapporten undersöks och testas psuedoslumptalsgeneratorer för att undersöka deras egenskaper, en av dem var periodlängd. För att göra detta valde vi ut fyra kända psuedoslumptalsgeneratorer och fyra olika testsviter som av olika anledning var av intresse, samt att vi själva utvecklade en pseudoslumptalsgenerator som vi utsatte för samma test. Genom att göra detta har vi kunnat dra slutsatsen att pseudoslumptalsgeneratorns viktigaste egenskap är en lång slumptalssekvens som inte periodiseras.  

  • 156.
    Stenberg, Jan-Ola
    et al.
    Högskolan i Halmstad, Sektionen för Informationsvetenskap, Data– och Elektroteknik (IDE).
    Mujanovic, Erko
    Högskolan i Halmstad, Sektionen för Informationsvetenskap, Data– och Elektroteknik (IDE).
    Stehn, Frank
    Högskolan i Halmstad, Sektionen för Informationsvetenskap, Data– och Elektroteknik (IDE).
    Samhällskonsekvenser av bristande IT-säkerhet2012Självständigt arbete på grundnivå (kandidatexamen), 10 poäng / 15 hpStudentuppsats (Examensarbete)
    Abstract [sv]

    Antalet företag, organisationer och instanser vars IT-system utsätts för attacker ökar. Något som märks trots att det försöker mörkläggas inom många organisationer. Myndigheter som Polis och Myndigheten för samhällsskydd och beredskap samt IT-personal inom de flesta företag är alla överens om att detta är ett växande problem som måste ses över. Konsekvenser av läckage av känsliga uppgifter kan vara förödande för ett företag, myndighet eller ett helt samhälle. En hel nations demokrati kan hotas av bristande IT-säkerhet och misstro till staten. Görs det tillräckligt för att upprätthålla en säker hantering av känsliga uppgifter och säker kommunikation från alla parter i dagens IT-samhälle? Tar alla sitt ansvar för att bibehålla demokratin vi lever i? Avsätter företagsledningarna på våra svenska företag de resurser som krävs för att IT-säkerheten ska kunna hålla jämn takt med den snabba utveckling i branschen? Tar våra mindre företag sitt ansvar genom att arbeta med IT och informationssäkerhet, trots oförmågan att se sig själva som mål för en attack, eller tillhandahåller de bakdörrar som kan användas av kriminella för att komma åt större företag?

  • 157.
    Svane, Torben
    et al.
    Högskolan i Halmstad, Akademin för informationsteknologi, Halmstad Embedded and Intelligent Systems Research (EIS).
    Karlsson, Lars
    Högskolan i Halmstad, Akademin för informationsteknologi.
    Suggesting a Common Framework for the Classification of Military Training and Computer Game Simulators2003Ingår i: Simulation Series, ISSN 0735-9276, E-ISSN 1562-384X, Vol. 35, nr 3, s. 271-276Artikel i tidskrift (Refereegranskat)
    Abstract [en]

    Many similarities can be found between military training and computer game simulators. A review of definitions and classifications of military training simulators suggests that an adoption of DoD terminology also would suit game industry requirements. Similarities between applications are exemplified. Adhering to a common standard could possibly impose a challenge to both sectors because of (a) the rapid development of new concepts in the games sector, (b) the crossover between genres, and (c) the increasingly unclear distinction between "live" applications and simulations. The conclusion proposes further investigation into possible category dimensions that may emanate from research. © Emerald Publishing Limited 2017

  • 158.
    Svensson, Joakim
    et al.
    Högskolan i Halmstad, Akademin för informationsteknologi.
    Yalda, Milad
    Högskolan i Halmstad, Akademin för informationsteknologi.
    Trådlös Övervakning av Inomhusklimat och PIR-baserad Passageräkning: En Demonstrationsanläggning åt Sweco Position AB2017Självständigt arbete på grundnivå (högskoleexamen), 10 poäng / 15 hpStudentuppsats (Examensarbete)
    Abstract [sv]

    Denna rapport är ett tekniskt komplement till Johanna Hernnäs och Linnea Martinssons rapport AerQ - Ett produktutvecklingsprojekt för att läsa av inomhusklimatet. I denna rapport beskrivs designen av en demonstrationsanläggning för inomhusklimat och passageräkning bestående av två trådlösa och batteridrivna enheter för inomhusklimat respektive passageräkning och en mobilapplikation till vilket datan presenteras. Klimatenheten mäter temperatur, relativ luftfuktighet och koldioxid samt kommunicerar via Wi-Fi och BLE och visuellt via RGB-LED:s. passageräknaren detekterar passager m h a en PIR-sensor och kommunicerar via BLE. I rapporten presenteras utförandet av demoanläggninen och en undersökning av PIR-sensorer. Resultatet visar att det är möjligt att detektera riktning med en PIR-sensor samt en lösning för långvarig batteridrift av en sensornod utrustad med ljusdiodslinga, Wi-Fi och VOC-sensor(MEMS metalloxidsensor). Systemets roll kan vara att återkoppla till behovsstyrd ventilation och/eller uppmärksamma användare om sitt inomhusklimat.

  • 159.
    Svensson, Martin
    et al.
    Högskolan i Halmstad, Sektionen för Informationsvetenskap, Data– och Elektroteknik (IDE).
    Johannesson, Joacim
    Högskolan i Halmstad, Sektionen för Informationsvetenskap, Data– och Elektroteknik (IDE).
    The Human Gyroscope: A prototype2013Självständigt arbete på grundnivå (högskoleexamen), 10 poäng / 15 hpStudentuppsats (Examensarbete)
  • 160.
    Swadi, Kedar
    et al.
    Rice University, Houston, TX, USA.
    Taha, Walid
    Rice University, Houston, TX, USA.
    Kiselyov, Oleg
    The Fleet Numerical Meteorology and Oceanography Center (FNMOC), Monterey, CA, USA.
    Pasalic, Emir
    Rice University, Houston, TX, USA.
    A Monadic Approach for Avoiding Code Duplication when Staging Memoized Functions2006Ingår i: PEPM '06 Proceedings of the 2006 ACM SIGPLAN symposium on Partial evaluation and semantics-based program manipulation, New York, NY: ACM Press, 2006, s. 160-169Konferensbidrag (Refereegranskat)
    Abstract [en]

    Building program generators that do not duplicate generated code can be challenging. At the same time, code duplication can easily increase both generation time and runtime of generated programs by an exponential factor. We identify an instance of this problem that can arise when memoized functions are staged. Without addressing this problem, it would be impossible to effectively stage dynamic programming algorithms. Intuitively, direct staging undoesthe effect of memoization. To solve this problem once and for all, and for any function that uses memoization, we propose a staged monadic combinator library. Experimental results confirm that the library works as expected. Preliminary results also indicate that the library is useful even when memoization is not used.

  • 161.
    Sweidan, Dirar
    Högskolan i Halmstad, Akademin för informationsteknologi.
    A General Framework for Discovering Multiple Data Groupings2018Självständigt arbete på avancerad nivå (masterexamen), 20 poäng / 30 hpStudentuppsats (Examensarbete)
    Abstract [en]

    Clustering helps users gain insights from their data by discovering hidden structures in an unsupervised way. Unlike classification tasks that are evaluated using well-defined target labels, clustering is an intrinsically subjective task as it depends on the interpretation, need and interest of users. In many real-world applications, multiple meaningful clusterings can be hidden in the data, and different users are interested in exploring different perspectives and use cases of this same data. Despite this, most existing clustering techniques only attempt to produce a single clustering of the data, which can be too strict. In this thesis, a general method is proposed to discover multiple alternative clusterings of the data, and let users select the clustering(s) they are most interested in. In order to cover a large set of possible clustering solutions, a diverse set of clusterings is first generated based on various projections of the data. Then, similar clusterings are found, filtered, and aggregated into one representative clustering, allowing the user to only explore a small set of non-redundant representative clusterings. We compare the proposed method against others and analyze its advantages and disadvantages, based on artificial and real-world datasets, as well as on images enabling a visual assessment of the meaningfulness of the discovered clustering solutions. On the other hand, extensive studies and analysis concerning a variety of techniques used in the method are made. Results show that the proposed method is able to discover multiple interesting and meaningful clustering solutions.

  • 162.
    Synnott, Jonathan
    et al.
    University of Ulster, Jordanstown, North Ireland.
    Nugent, Chris
    Univ Ulster, Sch Comp & Math, Jordanstown, North Ireland..
    Zhang, Shuai
    Univ Ulster, Sch Comp & Math, Jordanstown, North Ireland..
    Calzada, Alberto
    Univ Ulster, Sch Comp & Math, Jordanstown, North Ireland..
    Cleland, Ian
    Univ Ulster, Sch Comp & Math, Jordanstown, North Ireland..
    Espinilla, Macarena
    Univ Jaen, Dept Comp Sci, Jaen, Spain..
    Medina Quero, Javier
    Univ Jaen, Dept Comp Sci, Jaen, Spain..
    Lundström, Jens
    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).
    Environment Simulation for the Promotion of the Open Data Initiative2016Ingår i: 2016 IEEE INTERNATIONAL CONFERENCE ON SMART COMPUTING (SMARTCOMP), Piscataway, N.J.: IEEE, 2016, s. 246-251Konferensbidrag (Refereegranskat)
    Abstract [en]

    The development, testing and evaluation of novel approaches to Intelligent Environment data processing require access to datasets which are of high quality, validated and annotated. Access to such datasets is limited due to issues including cost, flexibility, practicality, and a lack of a globally standardized data format. These limitations are detrimental to the progress of research. This paper provides an overview of the Open Data Initiative and the use of simulation software (IE Sim) to provide a platform for the objective assessment and comparison of activity recognition solutions. To demonstrate the approach, a dataset was generated and distributed to 3 international research organizations. Results from this study demonstrate that the approach is capable of providing a platform for benchmarking and comparison of novel approaches.

  • 163.
    Sámano-Robles, Ramiro
    et al.
    Research Centre in Real-time and Embedded Computing Systems, Porto, Portugal.
    Nordström, Tomas
    Högskolan i Halmstad, Akademin för informationsteknologi, Halmstad Embedded and Intelligent Systems Research (EIS), Centrum för forskning om inbyggda system (CERES).
    Santonja, Salvador
    Instituto Tecnologico de Informatica (ITI), Valencia, Spain.
    Rom, Werner
    VIRTUAL VEHICLE Research Centre, Graz, Austria.
    Tovar, Eduardo
    Research Centre in Real-time and Embedded Computing Systems, Porto, Portugal.
    The DEWI High-Level Architecture: Guidelines for Structuring Wireless Sensor Networks in Industrial Applications2016Ingår i: 2016 Eleventh International Conference on Digital Information Management (ICDIM), New York: IEEE, 2016, s. 274-280Konferensbidrag (Refereegranskat)
    Abstract [en]

    This paper presents the high-level architecture (HLA) of the research project DEWI (dependable embedded wireless infrastructure). The objective of this HLA is to serve as a reference for the development of industrial wireless sensor and actuator networks (WSANs) based on the concept of the DEWI Bubble. The DEWI Bubble is defined here as a high-level abstraction of an industrial WSAN with enhanced interoperability (via standardized interfaces), technology reusability, and cross-domain development. This paper details the design criteria used to define the HLA and the organization of the infrastructure internal and external to the DEWI Bubble. The description includes the different perspectives, models or views of the architecture: the entity model, the layered model, and the functional view model (including an overview of interfaces). The HLA constitutes an extension of the ISO/IEC SNRA (sensor network reference architecture) towards the support of industrial applications. To improve interoperability with existing approaches the DEWI HLA also reuses some features from other standardized technologies and architectures. The HLA will allow networks with different industrial sensor technologies to exchange information between them or with external clients via standard interfaces, thus providing a consolidated access to sensor information of different domains. This is an important aspect for smart city applications, Big Data and internet-of-things (IoT). © Copyright 2016 IEEE

  • 164.
    Taha, Walid
    Department of Computing Science, Chalmers University of Technology and the University of Göteborg, Göteborg, Sweden.
    A Sound Reduction Semantics for Untyped CBN Multi-Stage Computation: Or, the Theory of MetaML is Non-trivial (Extended Abstract)2000Ingår i: PEPM '00: Proceedings of the 2000 ACM SIGPLAN workshop on Partial evaluation and semantics-based program manipulation, New York, NY: ACM Press, 2000, Vol. 34, s. 34-43Konferensbidrag (Refereegranskat)
    Abstract [en]

    A multi-stage computation is one involving more than one stage of execution. MetaML is a language for programming multi-stage computations. Previous studies presented big-step semantics, categorical semantics, and sound type systems for MetaML. In this paper, we report on a confluent and sound reduction semantics for untyped call-by name (CBN) MetaML. The reduction semantics can be used to formally justify some optimization performed by a CBN MetaML implementation. The reduction semantics demonstrates that non-trivial equalities hold for object-code, even in the untyped setting. The paper also emphasizes that adding intensional analysis (that is, taking-apart object programs) to MetaML remains an interesting open problem. © 2000 ACM, Inc.

  • 165.
    Taha, Walid
    Department of Computer Science, Rice University, Houston, TX, USA.
    Domain-Specific Languages2008Ingår i: The 2008 International Conference on Computer Engineering & Systems (ICCES '08) / [ed] Hossam M. A. Fahmy, Ayman M. Wahba, M. Watheq El-Kharashi, Ayman M. Bahaa El-Din, Mohamed A. Sobh & Mohamed Taher, Piscataway, NJ: IEEE Press, 2008, s. XXV-XXVIIIKonferensbidrag (Övrigt vetenskapligt)
    Abstract [en]

    Recently, there has been a growing interest in what have come to be known as domain-specific languages (DSLs). This paper introduces a definition for DSLs, explains how DSLs can have a far-reaching impact on our lives, and discusses why DSLs are here to stay. © 2008 IEEE.

  • 166.
    Taha, Walid
    et al.
    Oregon Graduate Institute, Hillsboro, Oregon, United States.
    Benaissa, Zine El-Abidine
    Oregon Graduate Institute, Hillsboro, Oregon, United States.
    Tim, Sheard
    Oregon Graduate Institute, Hillsboro, Oregon, United States.
    Multi-Stage Programming: Axiomatization and Type-Safety1998Ingår i: Automata, Languages and Programming: 25th International Colloquium, ICALP'98 Aalborg, Denmark, July 13–17, 1998 Proceedings / [ed] Kim G. Larsen, Sven Skyum & Glynn Winksel, Berlin: Springer Berlin/Heidelberg, 1998, s. 918-929Konferensbidrag (Refereegranskat)
    Abstract [en]

    Multi-stage programming provides a new paradigm for constructing efficient solutions to complex problems. Techniques such as program generation, multi-level partial evaluation, and run-time code generation respond to the need for general purpose solutions which do not pay run-time interpretive overheads. This paper provides a foundation for the formal analysis of one such system.

    We introduce a multi-stage language and present its axiomatic and reduction semantics. Our axiomatic semantics is an extension of the call-by-value λ-calculus with staging constructs. We show that staged-languages can “go Wrong” in new ways, and devise a type system that screens out such programs. Finally, we present a proof of the soundness of this type system with respect to the reduction semantics. © Springer 1998

  • 167.
    Taha, Walid
    et al.
    Högskolan i Halmstad, Akademin för informationsteknologi, Halmstad Embedded and Intelligent Systems Research (EIS), Centrum för forskning om inbyggda system (CERES).
    Brauner, Paul
    Rice University Houston, TX, USA.
    Cartwright, Robert
    Rice University Houston, TX, USA.
    Gaspes, Veronica
    Högskolan i Halmstad, Akademin för informationsteknologi, Halmstad Embedded and Intelligent Systems Research (EIS), Centrum för forskning om inbyggda system (CERES).
    Ames, Aaron
    University of Texas A&M College Station, TX, USA.
    Chapoutot, Alexandre
    ENSTA ParisTech Paris, France.
    A Core Language for Executable Models of Cyber Physical Systems: work in progress report2011Konferensbidrag (Refereegranskat)
    Abstract [en]

    Recently we showed that an expressive class of mathemat-ical equations can be automatically translated into simula-tion codes. Focusing on the expressivity of equations oncontinuous functions, this work considered only minimal in-teraction with discrete behaviors and only a static numberof statically connected components. However, the interac-tion between continuous and hybrid components in manycyber physical domains is highly coupled, and such systemsare often highly dynamic in both respects. This paper givesan overview of a proposed core language for capturing ex-ecutable hybrid models of highly dynamic cyber physicalsystems.

  • 168.
    Taha, Walid
    et al.
    Högskolan i Halmstad, Akademin för informationsteknologi, Halmstad Embedded and Intelligent Systems Research (EIS), Centrum för forskning om inbyggda system (CERES).
    Brauner, Paul
    Rice University, Houston, TX, USA.
    Zeng, Yingfu
    Rice University, Houston, TX, USA.
    Cartwright, Robert
    Rice University, Houston, TX, USA.
    Gaspes, Veronica
    Högskolan i Halmstad, Akademin för informationsteknologi, Halmstad Embedded and Intelligent Systems Research (EIS), Centrum för forskning om inbyggda system (CERES).
    Ames, Aaron
    University of Texas A&M, College Station, TX, USA.
    Chapoutot, Alexandre
    ENSTA ParisTech, Paris, France.
    A Core Language for Executable Models of Cyber-Physical Systems (Preliminary Report)2012Konferensbidrag (Refereegranskat)
    Abstract [en]

    Recently we showed that an expressive class of mathematical equations can be automatically translated into simulation codes. By focusing on the expressivity of equations formed from continuous functions, this work did not accommodate a wide range of discrete behaviors or a dynamic collection of components. However, the interaction between continuous and hybrid components in many cyber-physical domains is highly coupled, and such systems are often highly dynamic in both respects. This paper gives an overview of a proposed core language for capturing executable hybrid models of highly dynamic cyber-physical systems. © 2012 IEEE.

  • 169.
    Taha, Walid
    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). Computer Science, Rice University, Houston, USA.
    Cartwright, Robert
    Högskolan i Halmstad, Sektionen för Informationsvetenskap, Data– och Elektroteknik (IDE), Halmstad Embedded and Intelligent Systems Research (EIS). Computer Science, Rice University, Houston, USA.
    Some Challenges for Model-Based Simulation2013Ingår i: Proceedings of the 4th Analytic Virtual Integration of Cyber-Physical Systems Workshop: December 3, Vancouver, Canada / [ed] David Broman & Gabor Karsai, Linköping: Linköping University Electronic Press, 2013, s. 1-4Konferensbidrag (Refereegranskat)
    Abstract [en]

    Comprehensive analytical modeling and simulation of cyber-physical systems is an integral part of the process that brings novel designs and products to life. But the effort needed to go from analytical models to running simulation code can impede or derail this process. Our thesisis that this process is amenable to automation, and that automating it will accelerate the pace of innovation. This paper reviews some basic concepts that we found interesting or thought-provoking, and articulates some questions that may help prove or disprove this thesis. While based on ideas drawn from different disciplines, we observe that all these questions pertain in a profound way to how we can reason and compute with real numbers.

  • 170.
    Taha, Walid
    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).
    Cartwright, Robert
    Rice University, Houston, Texas, USA.
    The Trouble with Real Numbers2011Ingår i: INFORMATIK 2011: Informatik schafft Communities: Proceedings der 41. GI-Jahrestagun: 4.-7. Oktober 2011: Berlin / [ed] Hans-Ulrich Heiß, Peter Pepper, Holger Schlingloff, Jörg Schneider, Bonn: Bonner Köllen Verlag , 2011, s. 325-Konferensbidrag (Övrigt vetenskapligt)
  • 171.
    Taha, Walid
    et al.
    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, USA.
    Cartwright, Robert
    Högskolan i Halmstad, Akademin för informationsteknologi, Halmstad Embedded and Intelligent Systems Research (EIS). Rice University, Houston, USA.
    Philippsen, Roland
    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).
    Zeng, Yingfu
    Rice University, Houston, USA.
    A First Course on Cyber Physical Systems2013Konferensbidrag (Refereegranskat)
    Abstract [en]

    Effective and creative CPS development requires expertise in disparate fields that have traditionally been taught in distinct disciplines. At the same time, students seeking a CPS education generally come from diverse educational backgrounds. In this paper we report on our recent experience developing and teaching a course on CPS. The course can be seen as a detailed proposal focused on three three key questions: What are the core elements of CPS? How can these core concepts be integrated in the CPS design process? What types of modeling tools can assist in the design of cyber-physical systems? Experience from the first two offerings of the course is promising, and we discuss the lessons learned. All materials including lecture notes and software used for the course are openly available online.

  • 172.
    Taha, Walid
    et al.
    Department of Computer Science, Rice University, Houston, TX, USA.
    Crosby, Scott
    Department of Computer Science, Rice University, Houston, TX, USA.
    Swadi, Kedar
    Department of Computer Science, Rice University, Houston, TX, USA.
    A New Approach to Data Mining for Software Design2004Ingår i: Proceedings of the International Conference on Computer Science, Software Engineering, Information Technology, e-Business, and Applications (CSITeA-04) / [ed] Debnath, N. C. & El-Gendy, H., 2004Konferensbidrag (Refereegranskat)
    Abstract [en]

    We propose Exact Software Design Mining (ESDM) as a new approach to managing large software systems. ESDM is concerned with automatically extracting a program generator capable of exactly reconstructing the full code base. To illustrate the potential effectiveness of this approach, we propose, implement, and test a basic algorithm extracting such generators. Experimental results on various benchmarks (including the Linux kernel) are encouraging.

  • 173.
    Taha, Walid
    et al.
    Rice University, Houston, TX, USA.
    Ellner, Stephan
    Rice University, Houston, TX, USA.
    Xi, Hongwei
    Boston University, Boston, MA, USA.
    Generating Heap-bounded Programs in a Functional Setting2003Ingår i: Embedded Software: Third International Conference, EMSOFT 2003, Philadelphia, PA, USA, October 13-15, 2003. Proceedings / [ed] Rajeev Alur & Insup Lee, Berlin: Springer Berlin/Heidelberg, 2003, s. 340-355Konferensbidrag (Refereegranskat)
    Abstract [en]

    High-level programming languages offer significant expressivity but provide little or no guarantees about resource utilization. Resource-bounded languages provide strong guarantees about the runtime behavior of programs but often lack mechanisms that allow programmers to write more structured, modular, and reusable programs. To overcome this basic tension in language design, this paper advocates taking into account the natural distinction between the development platform and the deployment platform for resource-sensitive software.

    To illustrate this approach, we develop the meta-theory for GeHB, a two-level language in which first stage computations can involve arbitrary resource consumption, but the second stage can only involve functional programs that do not require new heap allocations. As an example of a such a second-stage language we use the recently proposed first-order functional language LFPL. LFPL can be compiled directly to malloc-free, imperative C code. We show that all generated programs in GeHB can be transformed into well-typed LFPL programs, thus ensuring that the results established for LFPL are directly applicable to GeHB. © Springer-Verlag Berlin Heidelberg 2003.

  • 174.
    Taha, Walid
    et al.
    Högskolan i Halmstad, Akademin för informationsteknologi, Halmstad Embedded and Intelligent Systems Research (EIS), Centrum för forskning om inbyggda system (CERES).
    Gaspes, Veronica
    Högskolan i Halmstad, Akademin för informationsteknologi, Halmstad Embedded and Intelligent Systems Research (EIS), Centrum för forskning om inbyggda system (CERES).
    Page, Rex
    University of Oklahoma, Norman, OK, USA.
    Accurate Programming: Thinking about programs in terms of properties2011Ingår i: Proceedings IFIP Working Conference on Domain-Specific Languages / [ed] Olivier Danvy & Chung-chieh Shan, Open Publishing Association , 2011, Vol. 66, s. 236-260Konferensbidrag (Refereegranskat)
    Abstract [en]

    Accurate programming is a practical approach to producing high quality programs. It combines ideas from test-automation, test-driven development, agile programming, and other state of the art software development methods. In addition to building on approaches that have proven effective in practice, it emphasizes concepts that help programmers sharpen their understanding of both the problems they are solving and the solutions they come up with. This is achieved by encouraging programmers to think about programs in terms of properties.

  • 175.
    Taha, Walid
    et al.
    Department of Computer Science, Rice University, Houston, TX, USA.
    Johann, Patricia
    Department of Computer Science, Rutgers University, Camden, New Jersey, USA.
    Staged Notational Definitions2003Ingår i: Generative Programming and Component Engineering: Second International Conference, GPCE 2003, Erfurt, Germany, September 22-25, 2003. Proceedings / [ed] Frank Pfenning & Yannis Smaragdakisd, Berlin: Springer Berlin/Heidelberg, 2003, s. 97-116Konferensbidrag (Refereegranskat)
    Abstract [en]

    Recent work proposed defining type-safe macros via interpretation into a multi-stage language. The utility of this approach wasillustrated with a language called MacroML, in which all type checking is carried out before macro expansion. Building on this work, thegoal of this paper is to develop a macro language that makes it easy forprogrammers to reason about terms locally. We show that defining thesemantics of macros in this manner helps in developing and verifyingnot only type systems for macro languages but also equational reasoning principles. Because the MacroML calculus is sensetive to renamingof (what appear locally to be) bound variables, we present a calculus ofstaged notational definitions (SND) that eliminates the renaming problem but retains MacroML’s phase distinction. Additionally, SND incorporates the generality of Griffin’s account of notational definitions. Weexhibit a formal equational theory for SND and prove its soundness.

  • 176.
    Taha, Walid
    et al.
    Department of Computer Science, Yale University, New Haven, CT, USA.
    Makholm, Henning
    DIKU, University of Copenhagen, Copenhagen, Denmark.
    Hughes, John
    Department of Computing Sciences, Chalmers, Göteborg, Sweden.
    Tag Elimination and Jones-Optimality (Preliminary Report)2001Ingår i: Programs as Data Objects: Second Symposium, PADO2001 Aarhus, Denmark, May 21–23, 2001 Proceedings / [ed] Olivier Danvy & Andrzej Filinski, Berlin: Springer Berlin/Heidelberg, 2001, s. 257-275Konferensbidrag (Refereegranskat)
    Abstract [en]

    Tag elimination is a program transformation for removing unnecessary tagging and untagging operations from automatically generated programs. Tag elimination was recently proposed as having immediate applications in implementations of domain specific languages (where it can give a two-fold speedup), and may provide a solution to the long standing problem of Jones-optimal specialization in the typed setting. This paper explains in more detail the role of tag elimination in the implementation of domain-specific languages, presents a number of significant simplifications and a high-level, higher-order, typed self-applicable interpreter. We show how tag elimination achieves Jones-optimality. © Springer-Verlag Berlin Heidelberg 2001.

  • 177.
    Taha, Walid
    et al.
    Department of Computer Science, Rice University, Houston, TX, USA.
    Nielsen, Michael Florentin
    Department of Computer Science, IT University of Copenhagen, Copenhagen, Denmark.
    Environment Classifiers2003Ingår i: POPL '03: Proceedings of the 30th ACM SIGPLAN-SIGACT symposium on Principles of programming languages, New York, NY: ACM Press, 2003, Vol. 38, s. 26-37Konferensbidrag (Refereegranskat)
    Abstract [en]

    This paper proposes and develops the basic theory for a new approach to typing multi-stage languages based a notion of environment classifiers. This approach involves explicit but lightweight tracking - at type-checking time - of the origination environment for future-stage computations. Classification is less restrictive than the previously proposed notions of closedness, and allows for both a more expressive typing of the "run" construct and for a unifying account of typed multi-stage programming. The proposed approach to typing requires making cross-stage persistence (CSP) explicit in the language. At the same time, it offers concrete new insights into the notion of levels and in turn into CSP itself. Type safety is established in the simply-typed setting. As a first step toward introducing classifiers to the Hindley-Milner setting, we propose an approach to integrating the two, and prove type preservation in this setting.

  • 178.
    Taha, Walid
    et al.
    Oregon Graduate Institute of Science & Technology, Hillsboro, OR, United States.
    Sheard, Tim
    Oregon Graduate Institute of Science & Technology, Hillsboro, OR, United States.
    Multi-Stage Programming with Explicit Annotations1997Ingår i: PEPM '97: Proceedings of the 1997 ACM SIGPLAN Symposium on Partial Evaluation and Semantics-based Program Manipulation, New York, NY: ACM Press, 1997, Vol. 32, s. 203-217Konferensbidrag (Refereegranskat)
    Abstract [en]

    We introduce MetaML, a statically-typed multi-stage programming language extending Nielson and Nielson's two stage notation to an arbitrary number of stages. MetaML extends previous work by introducing four distinct staging annotations which generalize those published previously [25, 12, 7, 6]. We give a static semantics in which type checking is done once and for all before the first stage, and a dynamic semantics which introduces a new concept of cross-stage persistence, which requires that variables available in any stage are also available in all future stages. We illustrate that staging is a manual form of binding time analysis. We explain why, even in the presence of automatic binding time analysis, explicit annotations are useful, especially for programs with more than two stages. A thesis of this paper is that multi-stage languages are useful as programming languages in their own right, and should support features that make it possible for programmers to write staged computations without significantly changing their normal programming style. To illustrate this we provide a simple three stage example, and an extended two-stage example elaborating a number of practical issues.

  • 179. Taheri, Tayebeh
    A Convolution-based Method for RemoteRespiratory Monitoring Using UWB Radar2015Självständigt arbete på avancerad nivå (magisterexamen), 10 poäng / 15 hpStudentuppsats (Examensarbete)
    Abstract [en]

    In this thesis we present a novel method for remote breathing detection using ultra-wideband(UWB) radar. This is a method that does not require any wearable sensors, makingit more comfortable and convenient for users. Furthermore, because of the penetratingcharacteristic of the transmitted signal through materials like walls, our system is usefulin emergency situations such as earthquakes, which require monitoring people who maybe trapped under rubble. In this thesis we present two new convolution-based methodsto extract breathing rate information from the received radar signal. We use two differenttemplate signals to detect a part of the received signal which contains breathing information.Using this information we are able to estimate the frequency of chest displacement.This method was tested on several people who were monitored while lying down on a bed.The subject’s position was determined and breathing rate was estimated. Experimental resultsincluding 20 different subjects are provided, showing that this is a viable method formonitoring breathing rate using a low-power UWB radar.i

  • 180.
    Taromirad, Masoumeh
    University of York, York, United Kingdom.
    A Modelling Approach to Multi-Domain Traceability2014Doktorsavhandling, monografi (Övrigt vetenskapligt)
    Abstract [en]

    Traceability is an important concern in projects that span dierent engineering domains. Traceability can also be mandated, exploited and managed across the engineering lifecycle, and may involve defining connections between heterogeneous models. As a result, traceability can be considered to be multi-domain.

    This thesis introduces the concept and challenges of multi-domain traceability and explains how it can be used to support typical traceability scenarios. It proposes a model-based approach to develop a traceability solution which eectively operates across multiple engineering domains. The approach introduced a collection of tasks and structures which address the identified challenges for a traceability solution in multi-domain projects. The proposed approach demonstrates that modelling principles and MDE techniques cab help to address current challenges and consequently improve the eectiveness of a multi-domain traceability solution.

    A prototype of the required tooling to support the approach is implemented with EMF and atop Epsilon; it consists of an implementation of the proposed structures (models) and model management operations to support traceability. Moreover, the approach is illustrated in the context of two safety-critical projects where multi-domain traceability is required to underpin certification arguments.

  • 181.
    Teng, Yunlong
    et al.
    Högskolan i Halmstad, Sektionen för Informationsvetenskap, Data– och Elektroteknik (IDE).
    Zhao, Yingrui
    Högskolan i Halmstad, Sektionen för Informationsvetenskap, Data– och Elektroteknik (IDE).
    Statistics in Ella Mathematics2012Självständigt arbete på grundnivå (kandidatexamen), 10 poäng / 15 hpStudentuppsats (Examensarbete)
    Abstract [en]

    "Ella Mathematics" is a web-based e-learning system which aims to improve elementary school students’ mathematics learning in Sweden. Such an e-learning tool has been partially completed in May 2012, except descriptive statistics module summarizing students’ performance in the learning process. This project report presents and describes the design and implementation of such descriptive statistics module, which intends to allow students to check their own grades and learning progress; teachers to check and compare students’ grades and progress, as well as parents to compare their children’s grades and learning progress with the average grade and progress of other students. To better understand and design such functionalities, different mathematical e-learning systems were investigated. Another contribution of this project relates to the evaluation and redesign of the existing database model of the “Ella Mathematics” system. The redesign improved performance and reduced data redundancy.

  • 182.
    Teveldal, Adam
    et al.
    Högskolan i Halmstad, Sektionen för Informationsvetenskap, Data– och Elektroteknik (IDE).
    Larsson, Kennie
    Högskolan i Halmstad, Sektionen för Informationsvetenskap, Data– och Elektroteknik (IDE).
    Lago, Mikael
    Högskolan i Halmstad, Sektionen för Informationsvetenskap, Data– och Elektroteknik (IDE).
    Effektiviteten av en handbok för EnScript2014Självständigt arbete på grundnivå (kandidatexamen), 10 poäng / 15 hpStudentuppsats (Examensarbete)
    Abstract [en]

    With the increase in IT related crimes the IT forensics has more work ahead of them and it is constantly rising. The analysis software called EnCase is widely used by IT forensics all around the globe and with it comes an internal programming language called EnScript.

    This paper is designed to examine whether a manual for the programming language EnScript can make a difference in how efficiently the work is.A study between two groups has been made and an evaluation of the results between the two groups.

    The manual provided aims to introduce the reader to EnScript as a programming language and also to provide a solid foundation to build on in further work with EnScript

  • 183.
    Ul-Abdin, Zain
    et al.
    Högskolan i Halmstad, Akademin för informationsteknologi, Halmstad Embedded and Intelligent Systems Research (EIS), Centrum för forskning om inbyggda system (CERES). TeleSehat Private Limited, Islamabad, Pakistan.
    Shafique, Muhammad
    Karlsruhe Institute of Technology, Karlsruhe, Germany.
    Qadir, Muhammad Abdul
    Mohammad Ali Jinnah University, Islamabad, Pakistan.
    Evaluating Video Codecs for Telemedicine Under Very-Low Bitrates2015Ingår i: 2015 8th International Congress on Image and Signal Processing (CISP) / [ed] Wang L.,Lin S.,Tao Z.,Zeng B.,Hui X.,Shao L.,Liang J., Piscataway, NJ: IEEE, 2015, s. 98-103, artikel-id 7407857Konferensbidrag (Refereegranskat)
    Abstract [en]

    Telemedicine is drawing greater attention to improve the health care delivery. Video coding being an integral part of any real-time telemedicine system is used to deliver diagnostic video stream to remote physician. Realizing a video coding system customized for telemedicine, using the available technologies poses several challenges. In this paper, we have analyzed state-of-the-art video codecs for adoption in telemedicine customized video conferencing system under low-bandwidth and low-computational scenarios. The experimental results for the selected video codec implementations for medical videos reveal that the HEVC encoder achieves equivalent objective video quality when using approx. 60% bit rate on average. However, the gain in coding efficiency is at the expense of increased computational complexity, which could be dealt with by incorporating adaptive interpolation and selective quality enhancement techniques to achieve real-time performance. © 2015 IEEE.

  • 184.
    Ullah, Haseeb
    et al.
    Högskolan i Halmstad, Sektionen för Informationsvetenskap, Data– och Elektroteknik (IDE).
    Mofakhar, Amir
    Högskolan i Halmstad, Sektionen för Informationsvetenskap, Data– och Elektroteknik (IDE).
    An LLVM Compiler for CAL2011Självständigt arbete på avancerad nivå (masterexamen), 30 poäng / 45 hpStudentuppsats (Examensarbete)
    Abstract [en]

    Massively parallel architectures are gaining momentum thanks to the opportunities for both high performance and low-power consumption. After being a matter for experiments in academia, manycores are now in production and industries with products that rely on high performance, for example, in the field of telecom and radar, are in the process of adopting them. In order to encourage adoption, there is a need for compiler technologies that can make appropriate use of the opportunities of these architectures.

    Programming languages with constructs that the compiler can easily identify as parallel are a reasonable starting point for these technologies. For example, in CAL (Caltrop Actor Language) [1], a program is organized as a network of actors and these actors can be executed in parallel. As a first approach, if there were enough processors for all actors in the network, each actor could be mapped on to one processor.

    Writing a compiler is a comprehensive software engineering project and there are a number of tools, data structures and algorithms that have to be chosen and that facilitate the task. Some tools are lexer and parser generators, some data structures are abstract syntax trees and intermediate representations for code generation, some of the algorithms are for analyzing properties of the program and for translating between different data structures. LLVM (Low Level Virtual Machine) [7] is a compiler infrastructure that offers a well defined language and target independent intermediate representation for programs. LLVM also provides compile-time, link-time and run-time optimization.

    This report discusses the front end of a compiler for CAL, including generation of code to LLVM. The work described in this report translates CAL programs into LLVM's intermediate representation and includes a runtime system that handles intercommunication links between actors and actor scheduling. This is an intermediate step in generating LLVM code for parallel architectures. With this compiler, application developers that need to evaluate different parallel platforms will be able to have their applications written in CAL and only the back-end, form LLVM to the platform, will need to be re-programmed.

  • 185.
    Vaidya, Varun
    et al.
    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).
    Bheemesh, Kushal
    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).
    Adaptive Warning Field System2017Självständigt arbete på avancerad nivå (masterexamen), 20 poäng / 30 hpStudentuppsats (Examensarbete)
    Abstract [en]

    This thesis is based on the work carried out in the field of safety systems for Autonomous Guided Vehicles(AGV). With autonomous vehicles being more prominent today, safe traversing of these is a major concern. The same is true for AGVs working in industry environment like forklift trucks etc. Our work applies to industrial robots. The method described here is developed by closely following an algorithm developed for safe traversing of a robot using a warning field. The report describes the literature review with work related to the safe traversing, path planning and collision avoidance in robots. The next part is dedicated to describing the methodology of implementation of the Adaptive Warning Field Method and the Dynamic Window Approach. The evaluation of the Adaptive Warning Method with the previous developed Warning Field Methods is done and test cases are designed to test the working of the designed method. Vrep simulation environment and Industrial data is used to run a simulation of the robot using the method developed in this work. We find that the method performs better compared to the previous methods in the designed scenarios. Lastly we conclude the report with the future work that can be carried out to improve and extend the algorithm.

  • 186.
    Varshosaz, Mahsa
    Högskolan i Halmstad, Akademin för informationsteknologi, Halmstad Embedded and Intelligent Systems Research (EIS), Centrum för forskning om inbyggda system (CERES).
    Modeling and Model-Based Testing of Software Product Lines2019Doktorsavhandling, sammanläggning (Övrigt vetenskapligt)
    Abstract [en]

    Software product line (SPL) engineering has become common practice for mass production and customization of variability intensive systems. A software product line comprises a family of software systems which share a managed core set of artifacts and also have a set of well-defined variabilities. The main idea in SPL engineering is to enable systematic reuse in different phases of software development to reduce cost and time to release.

    Model-Based Testing (MBT) is a technique that is widely used for quality assurance of software systems. In MBT, an abstract model, which captures the desired behavior of the system, is used to generate test cases. The test cases are executed against a real implementation of the system and the conformance between the implementation and the specification is checked by comparing the observed outputs with the ones prescribed by the model.

    Software product lines have been applied in a number of domains with mission critical systems. MBT is one of the techniques that has been used for analysis of such systems. As the number of products can be potentially large in an SPL, using conventional approaches for MBT of the products of an SPL individually can be very costly and time consuming. To tackle this problem, several approaches have been proposed in order to enable systematic reuse in different phases of the MBT process.

    An efficient modeling technique is the first step towards an efficient MBT technique for SPLs. So far, several formalisms have been proposed for modeling SPLs. In this thesis, we conduct a study on such modeling techniques, focusing on four fundamental formalisms, namely featured transition systems, modal transition systems, product line calculus of communicating systems, and 1- selecting modal transition systems. We compare the expressive power and the succinctness of these formalisms.

    Furthermore, we investigate adapting existing MBT methods for efficient testing of SPLs. As a part of this line of our research, we adapt the test case generation algorithm of one of the well-known black-box testing approaches, namely, Harmonized State Identification (HSI) method by exploiting the idea of delta-oriented programming. We apply the adapted test case generation algorithm to a case study taken from industry and the results show up to 50 percent reduction of time in test case generation by using the delta-oriented HSI method.

    In line with our research on investigating existing MBT techniques, we compare the relative efficiency and effectiveness of the test case generation algorithms of the well-known Input-Output Conformance (ioco) testing approach and the complete ioco which is another testing technique used for input output transition systems that guarantees fault coverage. The comparison is done using three case studies taken from the automotive and railway domains. The obtained results show that complete ioco is more efficient in detecting deep faults (i.e., the faults reached through longer traces) in large state spaces while ioco is more efficient in detecting shallow faults (i.e., the faults reached through shorter traces) in small state spaces.

    Moreover, we conduct a survey on sampling techniques, which have been proposed as a solution for handling the large number of products in analysis. In general, in product sampling a subset of products that collectively cover the behavior of the product line are selected. Performing tests on well selected sample set can reveal most of the faults in all products. We provide a classification for a catalog of studies on product sampling for software product lines. Additionally, we present a number of insights on the studied work as well as gaps for the future research.

  • 187.
    Varshosaz, Mahsa
    et al.
    Högskolan i Halmstad, Akademin för informationsteknologi, Halmstad Embedded and Intelligent Systems Research (EIS), Centrum för forskning om inbyggda system (CERES).
    Luthmann, Lars
    Technische Universität Darmstadt, Darmstadt, Germany.
    Mohr, Paul
    Technische Universität Darmstadt, Darmstadt, Germany.
    Lochau, Malte
    Technische Universität Darmstadt, Darmstadt, Germany.
    Mousavi, Mohammad Reza
    University of Leicester, Leicester, United Kingdom.
    Modal Transition System Encoding of Featured Transition Systems2019Ingår i: The Journal of logical and algebraic methods in programming, ISSN 2352-2208, E-ISSN 2352-2216, Vol. 106, s. 1-28Artikel i tidskrift (Refereegranskat)
    Abstract [en]

    Featured transition systems (FTSs) and modal transition systems (MTSs) are two of the most prominent and well-studied formalisms for modeling and analyzing behavioral variability as apparent in software product line engineering. On one hand, it is well-known that for finite behavior FTSs are strictly more expressive than MTSs, essentially due to the inability of MTSs to express logically constrained behavioral variability such as persistently exclusive behaviors. On the other hand, MTSs enjoy many desirable formal properties such as compositionality of semantic refinement and parallel composition. In order to finally consolidate the two formalisms for variability modeling, we establish a rigorous connection between FTSs and MTSs by means of an encoding of one FTS into an equivalent set of multiple MTSs. To this end, we split the structure of an FTS into several MTSs whenever it is necessary to denote exclusive choices that are not expressible in a single MTS. Moreover, extra care is taken when dealing with infinite behaviour: loops may have to be unrolled to accumulate FTS path constraints when encoding them into MTSs. We prove our encoding to be semanticpreserving (i.e., the resulting set of MTSs induces, up to bisimulation, the same set of derivable variants as their FTS counterpart) and to commute with modal refinement. We further give an algorithm to calculate a concise representation of a given FTS as a minimal set of MTSs. Finally, we present experimental results gained from applying a tool implementation of our approach to a collection of case studies.

  • 188.
    Varshosaz, Mahsa
    et al.
    Högskolan i Halmstad, Akademin för informationsteknologi, Halmstad Embedded and Intelligent Systems Research (EIS), Centrum för forskning om inbyggda system (CERES).
    Mousavi, Mohammad Reza
    Department of Informatics, University of Leicester, Leicester, United Kingdom.
    Comparative Expressiveness of Product Line Calculus of Communicating Systems and 1-Selecting Modal Transition Systems2019Ingår i: SOFSEM 2019: Theory and Practice of Computer Science / [ed] Barbara Catania, Rastislav Královič, Jerzy Nawrocki & Giovanni Pighizzini, Cham: Springer, 2019, s. 490-503Konferensbidrag (Refereegranskat)
    Abstract [en]

    Product line calculus of communicating systems (PL-CCSs) is a process calculus proposed to model the behavior of software product lines. Modal transition systems (MTSs) are also used to model variability in behavioral models. MTSs are known to be strictly less expressive than PL-CCS. In this paper, we show that the extension of MTSs with hyper transitions by Fecher and Schmidt, called 1-selecting modal transition systems (1MTSs), closes this expressiveness gap. To this end, we propose a novel notion of refinement for 1MTSs that makes them more suitable for specifying variability for software product lines and prove its various essential properties. © Springer Nature Switzerland AG 2019

  • 189.
    Varytimidis, Dimitrios
    Högskolan i Halmstad, Akademin för informationsteknologi.
    Detection and intention prediction of pedestrians in zebra crossings2018Självständigt arbete på avancerad nivå (masterexamen), 20 poäng / 30 hpStudentuppsats (Examensarbete)
    Abstract [en]

    Behavior of pedestrians who are moving or standing still close to the street could be one of the most significant indicators about pedestrian’s instant future actions. Being able to recognize the activity of a pedestrian, can reveal significant information about pedestrian’s crossing intentions. Thus, the scope of this thesisis to investigate ways and methods to improve understanding ofpedestrian´s activity and in particular detecting their motion and head orientation in relation to the surrounding traffic. Furthermore, different features and methods are examined, used and assessed according to their contribution on distinguishing between different actions. Feature extraction methods considered are Histogram of Oriented Gradients (HOG), Local Binary Patterns (LBP) and Convolutional Neural Networks (CNNs). The features are extracted by processing still images of pedestrians from the Joint Attention for Autonomous Driving (JAAD) dataset. The images are extracted from video frames depicting pedestrians walking next to the road or crossing the road are used. Based on the features, a number of Machine Learning (ML) techniques(CNN, Artificial Neural Networks, Support Vector Machines, K-Nearest Neighbor and Decision Trees) are used to predict the head orientation, motion as well as the intention of the pedestrian. The work is divided into three parts, the first is to combine feature extraction and ML to predict pedestrian’s action regarding if they are walking or not. The second is to identify the pedestrian's head orientation in terms of if he/she is looking at the vehicle or not, this is also done by combining feature extraction and ML. The final task is to combine these two measures in a ML-basedclassifier that is trained to predict the pedestrian´s crossing intention and action. In addition to the pedestrian’s behavior for estimating the crossing intention, additional features about the local environment were added as input signals for the classifier, for instance, information about the presence of zebra markings in the street, the location of the scene, and weather conditions.  

  • 190.
    Vedder, Benjamin
    et al.
    RISE Research Institutes of Sweden, Gothenburg, Sweden.
    Vinter, Jonny
    RISE Research Institutes of Sweden, Gothenburg, Sweden.
    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).
    Accurate positioning of bicycles for improved safety2018Ingår i: 2018 IEEE International Conference on Consumer Electronics (ICCE) / [ed] Saraju P. Mohanty, Peter Corcoran & Hai (Helen) Li, Piscataway, NJ: IEEE, 2018Konferensbidrag (Refereegranskat)
    Abstract [en]

    Cyclists are not well protected in accidents with other road users, and there are few active safety systems available for bicycles. In this study we have evaluated the use of inexpensive Real-Time Kinematic Satellite Navigation (RTK-SN) receivers with multiple satellite constellations together with dead reckoning for accurate positioning of bicycles to enable active safety functions such as collision warnings. This is a continuation of previous work were we concluded that RTK-SN alone is not sufficient in moderately dense urban areas as buildings and other obstructions degrade the performance of RTK-SN significantly. In this work we have added odometry to the positioning system as well as extending RTK-SN with multiple satellite constellations to deal with situations where the view of the sky is poor and thus fewer satellites are in view. To verify the performance of the positioning system we have used Ultra-Wideband radios as an independent positioning system to compare against while testing during poor conditions for RTK-SN. We were able to verify that adding dead reckoning and multiple satellite constellations improves the performance significantly under poor conditions and makes the positioning system more useful for active safety systems. © 2018 IEEE

  • 191.
    Victoria, Åkestrand
    et al.
    Högskolan i Halmstad.
    My, Wisen
    Högskolan i Halmstad.
    Big Data-analyser och beslutsfattande i svenska myndigheter2017Studentarbete övrigt, 10 poäng / 15 hpStudentuppsats (Examensarbete)
    Abstract [sv]

    Det finns mycket data att samla in om människor och mängden av data som går att samla in ökar. Allt fler verksamheter tar steget in i Big Data-­‐användningen och svenska myndigheter är en av dem. Att analysera Big Data kan generera bättre beslutsunderlag, men det finns en problematik i hur inhämtad data ska analyseras och användas vid beslutsprocessen.

    Studiens resultat visar på att svenska myndigheter inte kan använda befintliga beslutsmodeller vid beslut som grundas i en Big Data-­‐analys.

    Resultatet av studien visar även på att svenska myndigheter inte använder sig av givna steg i beslutsprocessen, utan det handlar mest om att identifiera Big Data-­‐ analysens innehåll för att fatta ett beslut. Då beslutet grundas i vad Big Data-­‐ analysen pekar på så blir det kringliggande aktiviteterna som insamling av data, kvalitetssäkring av data, analysering av data och visualisering av data allt mer essentiella. 

  • 192.
    Wallin, Andreas
    et al.
    Högskolan i Halmstad, Sektionen för Informationsvetenskap, Data– och Elektroteknik (IDE).
    Rubensson, Jonas
    Högskolan i Halmstad, Sektionen för Informationsvetenskap, Data– och Elektroteknik (IDE).
    Iggstrand, Alexander
    Högskolan i Halmstad, Sektionen för Informationsvetenskap, Data– och Elektroteknik (IDE).
    Allmänhetens säkerhetsmedvetenhet med avseende på trådlös kommunikation2014Självständigt arbete på grundnivå (kandidatexamen), 10 poäng / 15 hpStudentuppsats (Examensarbete)
    Abstract [sv]

    Offentliga trådlösa nätverk finns idag mer tillgängliga än någonsin. Samtidigt haralla dessa nätverk något gemensamt – de går alla att avlyssna och risken finns attanvändarens information kan komma i fel händer. Uppsatsen behandlarallmänhetens säkerhetsmedvetenhet med avseende på denna typ av nätverk genomtvå undersökningar. Den första undersökningen sker via ett tekniskt experiment därdet på flera geografiska platser har erbjudits ett trådlöst nätverk till allmänheten. Pådetta nätverk har det i realtid getts möjligheten att bedöma användarnassäkerhetsmedvetenhet genom att analysera deras nätverkstrafik. Den andraundersökningen sker via en enkät för att få ett resultat från ett teoretiskt perspektiv,hur användarna tror sig agera vid användning av ett sådant nätverk. Således ger denen inblick i den kunskap och säkerhetsmedvetenhet människor i allmänhet tror sigbesitta.Resultaten från undersökningarna tyder på att människors säkerhetsmedvetenhetkan och bör förbättras. Ett första steg är ytterligare utbildning angående de riskersom existerar och hur man undviker dem, något som tas upp i denna uppsats.

  • 193.
    Wan, Zhanyong
    et al.
    Department of Computer Science, Yale University, New Haven, CT, USA.
    Taha, Walid
    Department of Computer Science, Yale University, New Haven, CT, USA.
    Hudak, Paul
    Department of Computer Science, Yale University, New Haven, CT, USA.
    Event-Driven FRP2002Ingår i: Practical Aspects of Declarative Languages: 4th International Symposium, PADL 2002 Portland, OR, USA, January 19–20, 2002 Proceedings / [ed] Shriram Krishnamurthi & C. R. Ramakrishnan, Berlin: Springer Berlin/Heidelberg, 2002, s. 155-172Konferensbidrag (Refereegranskat)
    Abstract [en]

    Functional Reactive Programming (FRP) is a high-level declarative language for programming reactive systems. Previous work on FRP has demonstrated its utility in a wide range of application domains, including animation, graphical user interfaces, and robotics. FRP has an elegant continuous-time denotational semantics. However, it guarantees no bounds on execution time or space, thus making it unsuitable for many embedded real-time applications. To alleviate this problem, we recently developed Real-Time FRP (RT-FRP), whose operational semantics permits us to formally guarantee bounds on both execution time and space.

    In this paper we present a formally verifiable compilation strategy from a new language based on RT-FRP into imperative code. The new language, called Event-Driven FRP (E-FRP), is more tuned to the paradigm of having multiple external events. While it is smaller than RT-FRP, it features a key construct that allows us to compile the language into efficient code. We have used this language and its compiler to generate code for a small robot controller that runs on a PIC16C66 micro-controller. Because the formal specification of compilation was crafted more for clarity and for technical convenience, we describe an implementation that produces more efficient code.

  • 194.
    Wan, Zhanyong
    et al.
    Yale University, New Haven, CT, USA.
    Taha, Walid
    Yale University, New Haven, CT, USA.
    Hudak, Paul
    Yale University, New Haven, CT, USA.
    Real-Time FRP2001Ingår i: ICFP '01: Proceedings of the sixth ACM SIGPLAN international conference on Functional programming, New York, NY: ACM Special Interest Group on Computer Science Education, 2001, Vol. 36, s. 146-156Konferensbidrag (Refereegranskat)
    Abstract [en]

    Functional reactive programming (FRP) is a declarative programming paradigm where the basic notions are continuous, time-varying behaviors and discrete, event-based reactivity. FRP has been used successfully in many reactive programming domains such as animation, robotics, and graphical user interfaces. The success of FRP in these domains encourages us to consider its use in real-time applications, where it is crucial that the cost of running a program be bounded and known before run-time. But previous work on the semantics and implementation of FRP was not explicitly concerned about the issues of cost. In fact, the resource consumption of FRP programs in the current implementation is often hard to predict. As a first step towards addressing these concerns, this paper presents Real-Time FRP (RT-FRP), a statically-typed language where the time and space cost of each execution step for a given program is statically bounded. To take advantage of existing work on languages with bounded resources, we split RT-FRP into two parts: a reactive part that captures the essential ingredients of FRP programs, and a base language part that can be instantiated to any generic programming language that has been shown to be terminating and resource-bounded. This allows us to focus on the issues specific to RT-FRP, namely, two forms of recursion. After presenting the operational explanation of what can go wrong due to the presence of recursion, we show how the typed version of the language is terminating and resource-bounded. Most of our FRP programs are expressible directly in RT-FRP. The rest are expressible via a simple mechanism that integrates RT-FRP with the base language. Copyright 2001 ACM.

  • 195.
    Warling, Peter
    et al.
    Högskolan i Halmstad, Akademin för informationsteknologi.
    Mehmeti, Armend
    Högskolan i Halmstad, Akademin för informationsteknologi.
    Utvärdering av sårbarheter hos moderna fordon2018Självständigt arbete på grundnivå (kandidatexamen), 10 poäng / 15 hpStudentuppsats (Examensarbete)
    Abstract [sv]

    Fordon utvecklas till att innehålla mer avancerade komponenter och funktioner vilka bidrar till att dess framfart görs allt mer säker och effektiv. Baksidan av denna utveckling är att nya attackytor uppstår. Under tidigare arbeten har svagheter konstaterats i många av de olika trådlösa system som ett fordon använder. Då bilindustrin kontinuerligt utvecklas fokuserar detta arbete på att undersöka vilka trådlösa enheter som finns i moderna fordon, vilket av dessa system som utgör störst risk för att sedan föreslå teoretiska åtgärder för hur riskerna kan motverkas. Slutligen utförs ett praktiskt experiment för att utvärdera om en välkänd attack fortfarande är ett hot hos dagens fordon. Under arbetet konstateras det att i samtliga av de populäraste bilmodellerna som såldes i landet under förra året påträffas trådlösa system vilka alla under tidigare experiment visats innehålla tekniska svagheter. Arbetet fastställer genom en riskanalys att fjärrstyrda låssystem utgör den största risken men också att riskerna teoretiskt kan motverkas genom enkla metoder. Avslutningsvis konstateras det att även fordon av 2017 års modell är mottagliga för enklare attacker resulterande i att de ej kan låsas.

  • 196.
    Wecksten, Magnus
    et al.
    Högskolan i Halmstad, Sektionen för Informationsvetenskap, Data– och Elektroteknik (IDE).
    Michael, Haugland
    Högskolan i Halmstad, Sektionen för Informationsvetenskap, Data– och Elektroteknik (IDE).
    Linux hoist review: En undersökning av automatiserade auditverktyg2014Självständigt arbete på grundnivå (kandidatexamen), 10 poäng / 15 hpStudentuppsats (Examensarbete)
    Abstract [sv]

    Manuell säkerhetsgranskning av Linuxsystems konfigurationer är en tidskrävandeoch mödosam uppgift. Det existerar flera automatiserade verktyg som säger sigkunna underlätta arbetet, upptäcka uppenbara säkerhetsrisker och genereraunderlag för manuella granskningar.

    I detta arbetet ställer vi oss frågorna; “Hur väl klarar befintliga verktyg, på ettautomatiserat vis, att identifiera kritiska konfigurationsbrister i ett linuxsystem?”och “Går det att ta fram metoder som bättre identifierar dessa brister?”. Arbetetundersöker detta genom att samla verktyg för automatisk auditing och testar dessa iavsiktligt sårbart konfigurerade testmiljöer baserade på vedertagna riktlinjer försystemhärdning. Parallellt med detta tog vi också ta fram förbättradeidentifieringsmetoder genom att utveckla ett eget verktyg som inkluderas iundersökningen.

  • 197.
    Wehrmeister, Marco A.
    et al.
    Federal University of Rio Grande do Sul, Porto Alegre, RS, Brazil.
    Pignaton de Freitas, Edison
    Högskolan i Halmstad, Akademin för informationsteknologi, Halmstad Embedded and Intelligent Systems Research (EIS), Centrum för forskning om inbyggda system (CERES).
    Pereira, Carlos E.
    Federal University of Rio Grande do Sul, Porto Alegre, RS, Brazil.
    An Infrastructure for UML-Based Code Generation Tools2009Ingår i: Analysis, architectures and modelling of embedded systems: Third IFIP TC 10 International Embedded Systems Symposium, IESS 2009, Langenargen, Germany, September 14-16, 2009, proceedings / [ed] Rettberg, A Zanella, MC Rammig, FJ, New York: Springer-Verlag New York, 2009, s. 32-43Konferensbidrag (Refereegranskat)
    Abstract [en]

    The use of Model-Driven Engineering (MDE) techniques in the domain of distributed embedded real-time systems are gain importance in order to cope with the increasing design complexity of such systems. This paper discusses an infrastructure created to build GenERTiCA, a flexible tool that supports a MDE approach, which uses aspect-oriented concepts to handle nonfunctional requirements from embedded and real-time systems domain. GenERTiCA generates source code from UML models, and also performs weaving of aspects, which have been specified within the UML model. Additionally, this paper discusses the Distributed Embedded Real-Time Compact Specification (DERCS), a PIM created to support UML-based code generation tools. Some heuristics to transform UML models into DERCS, which have been implemented in GenERTiCA, are also discussed.

  • 198.
    Wendt, Michael
    et al.
    Högskolan i Halmstad, Akademin för informationsteknologi.
    Kadar Rosengren, Robin
    Högskolan i Halmstad, Akademin för informationsteknologi.
    Carving och innehållssökning av komplexa dokument: En jämförelse av verktyg2016Självständigt arbete på grundnivå (kandidatexamen), 10 poäng / 15 hpStudentuppsats (Examensarbete)
    Abstract [sv]

    File carving är konsten att återskapa raderade filer utan hjälp av filsystemsinformation. Speciellt viktigt skulle detta kunna vara vid utredning av ekonomisk brottslighet som utgör en vital del inom bekämpning av prioriterade områden som organiserad brottslighet och terrorism. I detta arbete presenteras ett nytt verktyg för att utföra file carving som även jämförs mot andra verktyg på marknaden med tyngdpunkt på processtid och minnesanvändning. Dessutom riktas fokus på egenskapen att snabbt kunna söka efter nyckelord i de framtagna filerna. Detta är något som kan vara mycket användbart när det finns behov av att snabbt hitta relevant information i en brottsutredning. Då filformaten .docx samt .pdf hör till de vanligaste typerna av textfiler har testerna valts att göras på dessa. I arbetet har det även undersökts hur polisen arbetar med file carving och sökning i textdokument idag. EnCase är det absolut mest använda programmet hos polisen, men testerna visade att det är både långsamt och resurskrävande. Verktyget Autopsy visade sig vara ett snabbare alternativ, men det nykomna verktyget Alice var mindre, snabbare och resurssnålare än båda alternativ. EnCase kunde inte heller visa resultaten av en textsökning på ett lika överskådligt sätt som Autopsy och Alice.

  • 199.
    Wernersson, Henrik Wernersson
    et al.
    Högskolan i Halmstad, Akademin för informationsteknologi.
    Atwa, Yassin
    Högskolan i Halmstad, Akademin för informationsteknologi.
    Resource constrained Industrial IoT device2016Självständigt arbete på grundnivå (yrkesexamen), 10 poäng / 15 hpStudentuppsats (Examensarbete)
    Abstract [sv]

    I dagens läge är industriella nätverk inte anpassade för att koppla upp resursbegränsade enheter pga av att industriella nätverks-protokollen som används är mer anpassade för real time applikationer. Det skulle vara ett stort steg för de industriella nätverken att kunna koppla upp resursbegränsade enheter för enkel övervakning samt analysering av data.

    Efter en undersökningsperiod av ett flertal olika IoT-protokoll, gjordes valet att implementera CoAP på en Anybus CompactCom-modul för testning. Under projektets gång användes det en del white-box testning i början vid implementationen av libCoAP. Efter att en fungerande implementation var gjord, påbörjades testning av input och output överensstämmelser med hjälp av black-box testning istället.

    Resultatet jämfördes i slutändan med den existerande lösningen att skicka parameterdata med hjälp av TCP. Resultatet hade en responstidsskillnad som var 92,3 % snabbare. Samtidigt tog det sammanlagt 24,2 % mindre plats i minnet (FLASH och RAM) för implementationen på Anybus CompactCom-modulen.

  • 200.
    Wilhelmsson, Joakim
    Högskolan i Halmstad, Akademin för ekonomi, teknik och naturvetenskap.
    esTracer App: En digital lösning för att genomföra tentamen med koppling mot ett webbaserat e-learningsystem2017Självständigt arbete på grundnivå (högskoleexamen), 10 poäng / 15 hpStudentuppsats (Examensarbete)
    Abstract [sv]

    Idag används fortfarande papper och penna oftast för att genomföra tentamen. Digitaliseringen i vårtsamhälle har öppnat upp för många nya möjligheter, och akademin kan bli bättre på att utnyttja dessa. Digital tentamen är något som kan förenkla både genomförande och administration. Det finns både tekniska möjligheter och svårigheter kring digital tentamen.

    esTracer är ett webbaserat e-learningsystem som är utvecklat av Entergate AB. Entergate önskar nukunna erbjuda högskolor och universitet en möjlighet för digital salstentamen. För att göra detta skallen applikation för Android och iOS utvecklas som kan användas på surfplattor för att genomföra salstentamen. Applikationen skall integreras med esTracer genom ett Web API. Skapande och administration av tentor, frågor och deltagare skall ske med befintlig funktionalitet i esTracer. Genomförandet av tentamen skall kunna göras i applikationen för Android och iOS på ett säkert sätt, och användarna skall kunna använda sina egna enheter. Resultat skall sedan kunna ses i esTracer av administratör.

    Rapporten handlar om utvecklingen av applikationen, samt vidareutveckling av esTracer Web API och integreringen mellan applikationen och esTracer. I rapporten redogörs för relevant bakgrund och teorier, de metoder som valdes för att lösa uppgiften, samt resultatet och analysen av detta. Resultatet är en applikation som kan användas på surfplattor för både Android och iOS. Applikationen kan användas för att genomföra tentor på ett säkert sätt och den har integrerats med esTracer genom vidareutveckling av ett Web API. Projektet visar således en teknisk lösning för digital salstentamen.

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