Ändra sökning
Avgränsa sökresultatet
52535455565758 2701 - 2750 av 2937
RefereraExporteraLänk till träfflistan
Permanent länk
Referera
Referensformat
  • apa
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Annat format
Fler format
Språk
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Annat språk
Fler språk
Utmatningsformat
  • html
  • text
  • asciidoc
  • rtf
Träffar per sida
  • 5
  • 10
  • 20
  • 50
  • 100
  • 250
Sortering
  • Standard (Relevans)
  • Författare A-Ö
  • Författare Ö-A
  • Titel A-Ö
  • Titel Ö-A
  • Publikationstyp A-Ö
  • Publikationstyp Ö-A
  • Äldst först
  • Nyast först
  • Skapad (Äldst först)
  • Skapad (Nyast först)
  • Senast uppdaterad (Äldst först)
  • Senast uppdaterad (Nyast först)
  • 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)
Markera
Maxantalet träffar du kan exportera från sökgränssnittet är 250. Vid större uttag använd dig av utsökningar.
  • 2701.
    Vernotte, Alexandre
    KTH, Skolan för elektro- och systemteknik (EES), Industriella informations- och styrsystem.
    Research Questions for Model-Based Vulnerability Testing of Web Applications2013Ingår i: 2013 IEEE SIXTH INTERNATIONAL CONFERENCE ON SOFTWARE TESTING, VERIFICATION AND VALIDATION (ICST 2013), IEEE Computer Society, 2013, 505-506 s.Konferensbidrag (Refereegranskat)
    Abstract [en]

    This paper presents my Ph.D. research that focuses on developing concepts and techniques for Model-Based Vulnerability Testing (MBVT) of Web Applications. This research bridges the gap between MBT techniques, which are usually addressed to functional testing, and vulnerability testing, which is mostly done manually or with the assistance of Web Vulnerability Scanners, both techniques having several flaws. In this document, we define the core of the research and its expected contributions to MBT and vulnerability testing. Then, we expose the major key challenges of the research, and finally provide early results.

  • 2702.
    Vernotte, Alexandre
    et al.
    KTH, Skolan för elektro- och systemteknik (EES), Elkraftteknik.
    Johnson, Pontus
    KTH, Tidigare Institutioner (före 2005), Elektrotekniska system.
    Ekstedt, Mathias
    KTH, Tidigare Institutioner (före 2005), Elektrotekniska system.
    Lagerström, Robert
    KTH, Skolan för elektroteknik och datavetenskap (EECS), Nätverk och systemteknik.
    In-Depth Modeling of the UNIX Operating System for Architectural Cyber Security Analysis2017Ingår i: PROCEEDINGS OF THE 2017 IEEE 21ST INTERNATIONAL ENTERPRISE DISTRIBUTED OBJECT COMPUTING CONFERENCE WORKSHOPS AND DEMONSTRATIONS (EDOCW 2017) / [ed] Halle, S Dijkman, R Lapalme, J, Institute of Electrical and Electronics Engineers (IEEE), 2017, 127-136 s.Konferensbidrag (Refereegranskat)
    Abstract [en]

    ICT systems have become an integral part of business and life. At the same time, these systems have become extremely complex. In such systems exist numerous vulnerabilities waiting to be exploited by potential threat actors. pwnPr3d is a novel modelling approach that performs automated architectural analysis with the objective of measuring the cyber security of the modeled architecture. Its integrated modelling language allows users to model software and hardware components with great level of details. To illustrate this capability, we present in this paper the metamodel of UNIX, operating systems being the core of every software and every IT system. After describing the main UNIX constituents and how they have been modelled, we illustrate how the modelled OS integrates within pwnPr3d's rationale by modelling the spreading of a self-replicating malware inspired by WannaCry.

  • 2703.
    Vestin, Jonathan
    et al.
    Karlstad University, Sweden.
    Kassler, Andreas
    Karlstad University, Sweden.
    Åkerberg, Johan
    ABB Corporate Research, Sweden.
    Resilient Software Defined Networking for Industrial Control Network2015Ingår i: Proceedings of the 10th International Conference on Information, Communications and Signal Processing (ICICS 2015), December 2-4, 2015 in Singapore., IEEE conference proceedings, 2015, 2015Konferensbidrag (Refereegranskat)
  • 2704.
    Vestman, Simon
    Blekinge Tekniska Högskola, Fakulteten för datavetenskaper, Institutionen för programvaruteknik.
    Cloud application platform - Virtualization vs Containerization: A comparison between application containers and virtual machines2017Självständigt arbete på grundnivå (kandidatexamen), 10 poäng / 15 hpStudentuppsats (Examensarbete)
    Abstract [en]

    Context. As the number of organizations using cloud application platforms to host their applications increases, the priority of distributing physical resources within those platforms is increasing simultaneously. The goal is to host a higher quantity of applications per physical server, while at the same time retain a satisfying rate of performance combined with certain scalability. The modern needs of customers occasionally also imply an assurance of certain privacy for their applications.

    Objectives. In this study two types of instances for hosting applications in cloud application platforms, virtual machines and application containers, are comparatively analyzed. This investigation has the goal to expose advantages and disadvantages between the instances in order to determine which is more appropriate for being used in cloud application platforms, in terms of performance, scalability and user isolation.

    Methods. The comparison is done on a server running Linux Ubuntu 16.04. The virtual machine is created using Devstack, a development environment of Openstack, while the application container is hosted by Docker. Each instance is running an apache web server for handling HTTP requests. The comparison is done by using different benchmark tools for different key usage scenarios and simultaneously observing the resource usage in respective instance.

    Results. The results are produced by investigating the user isolation and resource occupation of respective instance, by examining the file system, active process handling and resource allocation after creation. Benchmark tools are executed locally on respective instance, for a performance comparison of the usage of physical resources. The amount of CPU operations executed within a given time is measured in order determine the processor performance, while the speed of read and write operations to the main memory is measured in order to determine the RAM performance. A file is also transmitted between host server and application in order to compare the network performance between respective instance, by examining the transfer speed of the file. Lastly a set of benchmark tools are executed on the host server to measure the HTTP server request handling performance and scalability of each instance. The amount of requests handled per second is observed, but also the resource usage for the request handling at an increasing rate of served requests and clients.

    Conclusions. The virtual machine is a better choice for applications where privacy is a higher priority, due to the complete isolation and abstraction from the rest of the physical server. Virtual machines perform better in handling a higher quantity of requests per second, while application containers is faster in transferring files through network. The container requires a significantly lower amount of resources than the virtual machine in order to run and execute tasks, such as responding to HTTP requests. When it comes to scalability the prefered type of instance depends on the priority of key usage scenarios. Virtual machines have quicker response time for HTTP requests but application containers occupy less physical resources, which makes it logically possible to run a higher quantity of containers than virtual machines simultaneously on the same physical server.

  • 2705.
    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. 

  • 2706.
    Viebke, Andre
    et al.
    Linnéuniversitetet, Fakulteten för teknik (FTK), Institutionen för datavetenskap (DV).
    Memeti, Suejb
    Linnéuniversitetet, Fakulteten för teknik (FTK), Institutionen för datavetenskap (DV).
    Pllana, Sabri
    Linnéuniversitetet, Fakulteten för teknik (FTK), Institutionen för datavetenskap (DV).
    Abraham, Ajith
    Machine Intelligence Research Labs (MIR Labs).
    CHAOS: A Parallelization Scheme for Training Convolutional Neural Networks on Intel Xeon Phi2017Ingår i: Journal of Supercomputing, ISSN 0920-8542, E-ISSN 1573-0484Artikel i tidskrift (Refereegranskat)
    Abstract [en]

    Deep learning is an important component of big-data analytic tools and intelligent applications, such as, self-driving cars, computer vision, speech recognition, or precision medicine. However, the training process is computationally intensive, and often requires a large amount of time if performed sequentially. Modern parallel computing systems provide the capability to reduce the required training time of deep neural networks.In this paper, we present our parallelization scheme for training convolutional neural networks (CNN) named Controlled Hogwild with Arbitrary Order of Synchronization (CHAOS). Major features of CHAOS include the support for thread and vector parallelism, non-instant updates of weight parameters during back-propagation without a significant delay, and implicit synchronization in arbitrary order. CHAOS is tailored for parallel computing systems that are accelerated with the Intel Xeon Phi. We evaluate our parallelization approach empirically using measurement techniques and performance modeling for various numbers of threads and CNN architectures. Experimental results for the MNIST dataset of handwritten digits using the total number of threads on the Xeon Phi show speedups of up to 103x compared to the execution on one thread of the Xeon Phi, 14x compared to the sequential execution on Intel Xeon E5, and 58x compared to the sequential execution on Intel Core i5.

  • 2707.
    Viebke, Andre
    et al.
    Linnéuniversitetet, Fakulteten för teknik (FTK), Institutionen för datavetenskap (DV).
    Pllana, Sabri
    Linnéuniversitetet, Fakulteten för teknik (FTK), Institutionen för datavetenskap (DV).
    The Potential of the Intel (R) Xeon Phi (TM) for Supervised Deep Learning2015Ingår i: Proceedings: 2015 IEEE 17th International Conference on High Performance Computing and Communications, 2015 IEEE 7th International Symposium on Cyberspace Safety and Security & 2015 IEEE 12th International Conference on Embedded Software and Systems, IEEE Press, 2015, 758-765 s.Konferensbidrag (Refereegranskat)
    Abstract [en]

    Supervised learning of Convolutional Neural Networks (CNNs), also known as supervised Deep Learning, is a computationally demanding process. To find the most suitable parameters of a network for a given application, numerous training sessions are required. Therefore, reducing the training time per session is essential to fully utilize CNNs in practice. While numerous research groups have addressed the training of CNNs using GPUs, so far not much attention has been paid to the Intel Xeon Phi coprocessor. In this paper we investigate empirically and theoretically the potential of the Intel Xeon Phi for supervised learning of CNNs. We design and implement a parallelization scheme named CHAOS that exploits both the thread-and SIMD-parallelism of the coprocessor. Our approach is evaluated on the Intel Xeon Phi 7120P using the MNIST dataset of handwritten digits for various thread counts and CNN architectures. Results show a 103.5x speed up when training our large network for 15 epochs using 244 threads, compared to one thread on the coprocessor. Moreover, we develop a performance model and use it to assess our implementation and answer what-if questions.

  • 2708.
    Villabona, Antonio
    et al.
    KTH, Skolan för teknik och hälsa (STH), Medicinsk teknik, Data- och elektroteknik.
    Dietrichson, Fredrik
    KTH, Skolan för teknik och hälsa (STH), Medicinsk teknik, Data- och elektroteknik.
    Effektivisera generering av parameterfiler för betalterminaler2014Självständigt arbete på grundnivå (högskoleexamen), 180 hpStudentuppsats (Examensarbete)
    Abstract [sv]

    Denna rapport återger arbetsprocessen kring att utvärdera datalagringsstruktur och förbättra prestanda för generering av parameterfiler för kortterminaler. Arbetet utfördes på plats hos Esplanad AB, ett företag som bland annat arbetar med säkerhetslösningar och distribution av inställningar för betalstationer.

    Uppgiften bestod av att utvärdera möjligheter till att förbättra databasen som sparar alla inställningarna för betalsystemen, samt att förbättra kodstruktur och prestanda för programmet som genererar filerna.

    Rapporten beskriver testning av prestanda, både på Esplanads gamla program för att generera parameterfiler och det nya som konstruerades. En lösning presenteras som inkluderar förbättring av filgenereringens prestanda och en ny struktur på databasen för ökad skalbarhet.

    Tester visar att det nya systemet klarar av att skapa parameterfiler på TLV-format ungefär 16 gånger snabbare. Den föreslagna lösningen implementerar parallella processer och replikering av databasen.

  • 2709.
    Vishnubhotla, Sai Datta
    Blekinge Tekniska Högskola, Fakulteten för datavetenskaper, Institutionen för datalogi och datorsystemteknik.
    Supplementary Material of: "An insight into the capabilities of professionals and teams in agile software development - A systematic literature review"2017Övrigt (Övrig (populärvetenskap, debatt, mm))
    Abstract [en]

    This document contains the supplementary material regarding the systematic literature review titled: "An insight into the capabilities of professionals and teams in agile software development" 

  • 2710.
    Vlassov, Vladimir
    et al.
    KTH, Tidigare Institutioner, Teleinformatik.
    Ahmed, Hallo
    KTH, Tidigare Institutioner, Teleinformatik.
    Thorelli, Lars-Erik
    KTH, Tidigare Institutioner, Teleinformatik.
    mEDA-2: An extension of PVM1995Ingår i: Parallel Computing Technologies, Berlin: Springer Berlin/Heidelberg, 1995, 288-293 s.Konferensbidrag (Refereegranskat)
    Abstract [en]

    This  article  presents  mEDA-2,  an  extension  to  PVM  which provides  Virtual  Shared  Memory,  VSM,  for  inter-task  communication and synchronization, mEDAl2  consists of functions to access  VSM  and a daemon to manage parallel program termination. Access to VSM is based on  the  semantics  of the  EDA  model.  The  aim  of  developing  mEDA-2 was  to facilitate construction  of parallel programs  in  PVM  by providing a  unified  approach  to message  passing  and  shared  memory models.

  • 2711.
    Vlassov, Vladimir
    et al.
    KTH, Tidigare Institutioner, Teleinformatik.
    Ahmed, Hallo
    KTH, Tidigare Institutioner, Teleinformatik.
    Thorelli, Lars-Erik
    KTH, Tidigare Institutioner, Teleinformatik.
    Ayani, Rassul
    KTH, Tidigare Institutioner, Teleinformatik.
    A simulation platform for multi-threaded architectures1996Ingår i: Proceedings of the Fourth International Workshop on Modeling, Analysis, and Simulation of Computer and Telecommunication Systems, 1996. MASCOTS '96, 1996, 102-108 s.Konferensbidrag (Refereegranskat)
    Abstract [en]

    Simulation is a powerful tool for studying behavior of novel architectures and improving their performance. However the time, effort and resources invested in developing a reliable simulator with the required level of detail may become prohibitively large. We present a simulation platform specifically designed to simulate the class of multithreaded architectures. The most important features of this simulator are its flexibility and ease of use. The simulation model provides the user with a wide range of design criteria, architectural parameters and workload characteristics. The simulation platform includes several tools, such as: an experiment planner, an interface to Matlab for processing and displaying results, and an interface to PVM for the execution of independent experiments in parallel. The simulation model is validated by comparison of analytical and experimental results.

  • 2712.
    Vlassov, Vladimir
    et al.
    KTH, Tidigare Institutioner, Teleinformatik.
    Ayani, Rassul
    KTH, Tidigare Institutioner, Teleinformatik.
    Thorelli, Lars-Erik
    KTH, Tidigare Institutioner, Teleinformatik.
    Modeling and Simulation of Multithreaded Architectures1997Ingår i: Simulation (San Diego, Calif.), ISSN 0037-5497, E-ISSN 1741-3133, ISSN 0037-5497, Vol. 68, nr 4, 219-230 s.Artikel i tidskrift (Refereegranskat)
    Abstract [en]

    Multithreaded architectures are widely used for, among other things, hiding long memory latency. In such an architecture, a number of threads are allocated to each Processing Element (PE), and whenever a running thread becomes suspended, the PE switches to the next ready thread. We have developed a simulation platform, MTASim, that can be used to test and evaluate various policies and parameters of a multithreaded computer. The most important features of the MTASim are its flexibility and its ease of use. The MTASim model is based on finite state machines and can be easily modified and expanded. The simulation platform includes an experimental planner, an interface to PVM for the execution of independent experiments in parallel, and an interface to Matlab for processing and displaying results. The MTASim has been used to, among other things, determine the optimal number of threads and to evaluate various prefetching strategies and thread replacement algorithms.

  • 2713.
    Vlassov, Vladimir
    et al.
    KTH, Tidigare Institutioner, Teleinformatik.
    Thorelli, Lars-Erik
    KTH, Tidigare Institutioner, Teleinformatik.
    A synchronizing shared memory: Model and programming implementation1997Ingår i: RECENT ADVANCES IN PARALLEL VIRTUAL MACHINE AND MESSAGE PASSING INTERFACE / [ed] Bubak, M; Dongarra, J; Wasniewshi, J, Berlin: Springer Berlin/Heidelberg, 1997, 159-166 s.Konferensbidrag (Refereegranskat)
    Abstract [en]

    In  this  article  we  concentrate   on  implementation  issues  of  a  new shared-memory programming model, mEDA, on top of PVM. The main goal of this research is to provide a flexible, effective and relatively  simple model of in- ter-task communication  and synchronization  via synchronizing shared  memory.

  • 2714.
    Vogginger, Bernhard
    et al.
    Technical University Dresden.
    Schüffny, Rene
    Technical University Dresden.
    Lansner, Anders
    KTH, Skolan för datavetenskap och kommunikation (CSC), Beräkningsbiologi, CB. Stockholm University, Sweden.
    Cederström, Love
    Technical University Dresden.
    Parzsch, Johannes
    Technical University Dresden.
    Höppner, Sebastian
    Technical University Dresden.
    Reducing the computational footprint for real-time BCPNN learning2015Ingår i: Frontiers in Neuroengineering, ISSN 1662-6443, Vol. 9, nr 2, 2Artikel i tidskrift (Refereegranskat)
    Abstract [en]

    The implementation of synaptic plasticity in neural simulation or neuromorphic hardware is usually very resource-intensive, often requiring a compromise between efficiency and flexibility. A versatile, but computationally-expensive plasticity mechanism is provided by the Bayesian Confidence Propagation Neural Network (BCPNN) paradigm. Building upon Bayesian statistics, and having clear links to biological plasticity processes, the BCPNN learning rule has been applied in many fields, ranging from data classification, associative memory, reward-based learning, probabilistic inference to cortical attractor memory networks. In the spike-based version of this learning rule the pre-, postsynaptic and coincident activity is traced in three low-pass-filtering stages, requiring a total of eight state variables, whose dynamics are typically simulated with the fixed step size Euler method. We derive analytic solutions allowing an efficient event-driven implementation of this learning rule. Further speedup is achieved by first rewriting the model which reduces the number of basic arithmetic operations per update to one half, and second by using look-up tables for the frequently calculated exponential decay. Ultimately, in a typical use case, the simulation using our approach is more than one order of magnitude faster than with the fixed step size Euler method. Aiming for a small memory footprint per BCPNN synapse, we also evaluate the use of fixed-point numbers for the state variables, and assess the number of bits required to achieve same or better accuracy than with the conventional explicit Euler method. All of this will allow a real-time simulation of a reduced cortex model based on BCPNN in high performance computing. More important, with the analytic solution at hand and due to the reduced memory bandwidth, the learning rule can be efficiently implemented in dedicated or existing digital neuromorphic hardware.

  • 2715.
    Voigt, Thiemo
    et al.
    Uppsala universitet, Teknisk-naturvetenskapliga vetenskapsområdet, Matematisk-datavetenskapliga sektionen, Institutionen för informationsteknologi, Datorteknik.
    Hewage, Kasun
    Uppsala universitet, Teknisk-naturvetenskapliga vetenskapsområdet, Matematisk-datavetenskapliga sektionen, Institutionen för informationsteknologi, Datorteknik.
    Alm, Per
    Uppsala universitet, Medicinska och farmaceutiska vetenskapsområdet, Medicinska fakulteten, Institutionen för neurovetenskap, Logopedi.
    Smartphone Support for Persons Who Stutter2014Ingår i: Proc. 13th International Symposium on Information Processing in Sensor Networks, Piscataway, NJ: IEEE Press, 2014, 293-294 s.Konferensbidrag (Refereegranskat)
    Abstract [en]

    Stuttering is a very complex speech disorder that affects around 0.7% of adults while around 5% of the population have stuttered at some point. A large percentage of the affected people tend to speak more fluently when their own speech is played back to their ear with some type of alteration. While this has been done with special devices, smartphones can be used for this purpose. We report on our initial experiences on building such an application and demonstrate problems with delay caused by the lack of real-time support for audio playback in the Android operating system. We also discuss ideas for future work to improve app support for people who stutter.

  • 2716.
    von Hacht, Karl-Johan
    Linköpings universitet, Institutionen för systemteknik, Datorteknik. Linköpings universitet, Tekniska fakulteten.
    Garden Monitoring with Embedded Systems2015Självständigt arbete på grundnivå (högskoleexamen), 10 poäng / 15 hpStudentuppsats (Examensarbete)
    Abstract [en]

    In today’s modern society the process of handling crops in an accountable way withoutloss have become more and more important. By letting a gardener evaluate the progressof his plants from relevant data one can reduce these losses and increase effectiveness ofthe whole plantation. This work is about the construction of such a system composedfrom a developers perspective of three different platforms, from the start of data samplingwithin the context of gardening to and end user easily able to understand the data thentranslated. The first platform will be created from scratch with both hardware andsoftware, the next assembled from already finished hardware components and build withsimpler software. The last will essentially only be a software solution in an alreadyfinished hardware environment.

  • 2717.
    Vos, Angeliki
    et al.
    Linnéuniversitetet, Fakulteten för teknik (FTK), Institutionen för informatik (IK). Technological Educational Institute of Athens, Greece.
    Marinagi, Catherine
    Technological Educational Institute of Central Greece, Greece.
    Trivellas, Panagiotis
    Technological Educational Institute of Central Greece, Greece.
    Eberhagen, Niclas
    Linnéuniversitetet, Fakulteten för teknik (FTK), Institutionen för informatik (IK).
    Skourlas, Christos
    Technological Educational Institute of Athens, Greece.
    Giannakopoulos, Georgios
    Technological Educational Institute of Athens, Greece.
    Risk Reduction Strategies in Online Shopping: E-trust Perspective2014Ingår i: Procedia Social and Behavioral Sciences: 3RD INTERNATIONAL CONFERENCE ON INTEGRATED INFORMATION (IC-ININFO) / [ed] Giannakopoulos, G; Sakas, DP; Vlachos, DS; KyriakiManessi, D, Elsevier, 2014, Vol. 147, 418-423 s.Konferensbidrag (Refereegranskat)
    Abstract [en]

    Abstract Several studies have shown that consumers perceive higher risks buying online than in conventional way. Perceived risks affect all purchase decisions and consumers' behavior, by deterring them to buy. These risks come from the lack of trust of shoppers toward online vendors' credibility. The main field of research in this paper is to investigate how trust is affecting the consumers engagement to e-commerce, in order to conclude in which security measures should be taken in order to mitigate perceived risks. A framework for a field research is also given in order to identify the causal relationships between electronic service quality and e-loyalty, e-satisfaction and e-trust.

  • 2718.
    Vu, Phi-Long
    Luleå tekniska universitet, Institutionen för system- och rymdteknik.
    Implementing a web-based bookingsystem using Go2016Självständigt arbete på grundnivå (yrkesexamen), 180 hpStudentuppsats (Examensarbete)
    Abstract [sv]

    Projektet undersökte fördelarna och nackdelar med Go medan ett bokningssystemför Tieto utvecklades. Under utvecklingen av bokningssystemet såanvändes ramverken och APIerna AngularJS, REST, JSON och mongoDB.Resultatet blev ett fullt fungerande fristående bokningssystem med supportför inloggning. Back-end servern var skriven i Go medan front-end klientenvar skriven i JavaScript med AngularJS.

  • 2719.
    Vu, Xuan-Son
    et al.
    Umeå universitet, Teknisk-naturvetenskapliga fakulteten, Institutionen för datavetenskap.
    Jiang, Lili
    Umeå universitet, Teknisk-naturvetenskapliga fakulteten, Institutionen för datavetenskap.
    Brändström, Anders
    Elmroth, Erik
    Personality-based Knowledge Extraction for Privacy-preserving Data Analysis2017Ingår i: Proceedings of the Knowledge Capture Conference, Austin, TX, USA, 2017, 44:1-44:4 s.Konferensbidrag (Refereegranskat)
    Abstract [en]

    In this paper, we present a differential privacy preserving approach, which extracts personality-based knowledge to serve privacy guarantee data analysis on personal sensitive data. Based on the approach, we further implement an end-to-end privacy guarantee system, KaPPA, to provide researchers iterative data analysis on sensitive data. The key challenge for differential privacy is determining a reasonable amount of privacy budget to balance privacy preserving and data utility. Most of the previous work applies unified privacy budget to all individual data, which leads to insufficient privacy protection for some individuals while over-protecting others. In KaPPA, the proposed personality-based privacy preserving approach automatically calculates privacy budget for each individual. Our experimental evaluations show a significant trade-off of sufficient privacy protection and data utility.

  • 2720.
    Vuković, Ognjen
    et al.
    KTH, Skolan för elektro- och systemteknik (EES), Kommunikationsnät.
    Dán, György
    KTH, Skolan för elektro- och systemteknik (EES), Kommunikationsnät.
    On the Security of Distributed Power System State Estimation under Targeted Attacks2013Ingår i: Proceedings of the 28th Annual ACM Symposium on Applied Computing, 2013, 666-672 s.Konferensbidrag (Refereegranskat)
    Abstract [en]

    State estimation plays an essential role in the monitoring and control of power transmission systems. In modern, highly inter-connected power systems the state estimation should be performed in a distributed fashion and requires information exchange between the control centers of directly connected systems. Motivated by recent reportson trojans targeting industrial control systems, in this paper we investigate how a single compromised control center can affect the outcome of distributed state estimation. We describe five attack strategies, and evaluate their impact on the IEEE 118 benchmark power system. We show that that even if the state estimation converges despite the attack, the estimate can have up to 30% of error, and bad data detection cannot locate theattack. We also show that if powerful enough, the attack can impede the convergence of the state estimation, and thus it can blind the system operators. Our results show that it is important to provide confidentiality for the measurement data in order to prevent the most powerful attacks. Finally, we discuss a possible way to detect and to mitigate these attacks.

  • 2721.
    Vuković, Ognjen
    et al.
    KTH, Skolan för elektro- och systemteknik (EES), Kommunikationsnät.
    Dán, György
    KTH, Skolan för elektro- och systemteknik (EES), Kommunikationsnät.
    Karlsson, Gunnar
    KTH, Skolan för elektro- och systemteknik (EES), Kommunikationsnät.
    Mitigating Denial of Service Attacks using Anonymity Networks: Relationship Anonymity-Communication Overhead Trade-offManuskript (preprint) (Övrigt vetenskapligt)
    Abstract [en]

    Denial-of-service attacks are a significant threat to mission critical communication infrastructures, e.g., to industrial control systems. They are relatively easy to perpetrate, as an attacker that has access to communication links or equipment could observe the source and destination addresses for every message, and can identify and discard the messages exchanged between particular communication participants. Mix networks and anonymity networks could render these attacks more difficult by providing anonymous communication via relaying. Nevertheless, relaying introduces overhead and increases the end-to-end message delivery delay, which in practice must often be low. Hence, an important question is how to optimize anonymity for limited overhead and delay. In this paper we address this question by studying two anonymity networks: MCrowds, an extension of Crowds, which provides unbounded communication delay and Minstrels, which provides bounded communication delay. We derive exact and approximate analytical expressions for the relationship anonymity for these systems. Using MCrowds and Minstrels we show that, contrary to intuition, increased overhead does not always improve anonymity. We investigate the impact of the system's parameters on anonymity and on the optimal anonymity network parameters, and the sensitivity of anonymity to the misestimation of the number of attackers.

  • 2722.
    Vuković, Ognjen
    et al.
    KTH, Skolan för elektro- och systemteknik (EES), Kommunikationsnät.
    Dán, György
    KTH, Skolan för elektro- och systemteknik (EES), Kommunikationsnät.
    Karlsson, Gunnar
    KTH, Skolan för elektro- och systemteknik (EES), Kommunikationsnät.
    Traffic Analysis Attacks in Anonymity Networks: Relationship Anonymity-Overhead Trade-off2013Rapport (Övrigt vetenskapligt)
    Abstract [en]

    Mix networks and anonymity networks provide anonymous communication via relaying, which introduces overhead and increases the end-to-end message delivery delay. In practice overhead and delay must often be low, hence it is important to understand how to optimize anonymity for limited overhead and delay. In this work we address this question under passive traffic analysis attacks, whose goal is to learn the traffic matrix. For our study, we use two anonymity networks: MCrowds, an extension of Crowds, which provides unbounded communication delay and Minstrels, which provides bounded communication delay. We derive exact and approximate analytical expressions for the relationship anonymity for these systems. Using MCrowds and Minstrels we show that, contrary to intuition, increased overhead does not always improve anonymity. We investigate the impact of the system's parameters on anonymity, and the sensitivity anonymity to the misestimation of the number of attackers.

  • 2723.
    Vázquez, Carlos
    et al.
    Umeå universitet, Teknisk-naturvetenskapliga fakulteten, Institutionen för tillämpad fysik och elektronik. University of Castilla-La Mancha.
    Tomas, Luis
    Umeå universitet, Teknisk-naturvetenskapliga fakulteten, Institutionen för datavetenskap.
    Moreno, Ginés
    University of Castilla-La Mancha.
    Tordsson, Johan
    Umeå universitet, Teknisk-naturvetenskapliga fakulteten, Institutionen för datavetenskap.
    A fuzzy approach to cloud admission control for safe overbooking2013Ingår i: 10th International Workshop on Fuzzy Logic and Applications (WILF), 2013, 212-225 s.Konferensbidrag (Refereegranskat)
    Abstract [en]

    Cloud computing enables elasticity - rapid provisioning and deprovisioning of computational resources.Elasticity allows cloud users to quickly adapt resource allocation to meet changes in their workloads.For cloud providers, elasticity complicates capacity management as the amount ofresources that can be requested by users is unknown and can vary significantly over time. Overbooking techniques allowproviders to increase utilization of their data centers. For safe overbooking, cloud providersneed admission control mechanisms to handle the tradeoff between increasedutilization (and revenue), and risk of exhausting resources, potentially resulting in penalty fees and/or lost customers.We propose a flexible approach (implemented with fuzzy logic programming) to admission control and the associated risk estimation.Our measures exploit different fuzzy logic operators in order to model optimistic, realistic, and pessimistic behaviour under uncertainty.An experimental evaluation confirm that our fuzzy admission control approach can significantly increaseresource utilization while minimizing the risk of exceeding the total available capacity.

  • 2724.
    Välja, Margus
    et al.
    KTH, Skolan för elektro- och systemteknik (EES), Nätverk och systemteknik.
    Korman, Matus
    KTH, Skolan för elektro- och systemteknik (EES), Nätverk och systemteknik.
    Lagerström, Robert
    KTH, Skolan för elektro- och systemteknik (EES), Nätverk och systemteknik.
    A study on software vulnerabilities and weaknesses of embedded systems in power networks2017Ingår i: Proceedings - 2017 2nd Workshop on Cyber-Physical Security and Resilience in Smart Grids, CPSR-SG 2017 (part of CPS Week), Association for Computing Machinery, Inc , 2017, 47-52 s.Konferensbidrag (Refereegranskat)
    Abstract [en]

    In this paper we conduct an empirical study with the purpose of identifying common software weaknesses of embedded devices used as part of industrial control systems in power grids. The data is gathered about the devices and software of 6 companies, ABB, General Electric, Schneider Electric, Schweitzer Engineering Laboratories, Siemens and Wind River. The study uses data from the manufacturersfi online databases, NVD, CWE and ICS CERT. We identified that the most common problems that were reported are related to the improper input validation, cryptographic issues, and programming errors.

  • 2725.
    Välja, Margus
    et al.
    KTH, Skolan för elektro- och systemteknik (EES), Elkraftteknik.
    Korman, Matus
    KTH, Skolan för elektro- och systemteknik (EES), Elkraftteknik.
    Lagerström, Robert
    KTH, Skolan för elektro- och systemteknik (EES), Elkraftteknik.
    Franke, Ulrik
    Ekstedt, Mathias
    KTH, Skolan för elektro- och systemteknik (EES), Elkraftteknik.
    Automated Architecture Modeling for Enterprise Technology Management Using Principles from Data Fusion: A Security Analysis Case2016Ingår i: Proceedings of 2016 Portland International Conference on Management of Engineering and Technology (PICMET), 2016Konferensbidrag (Refereegranskat)
  • 2726.
    Välja, Margus
    et al.
    KTH, Skolan för elektroteknik och datavetenskap (EECS), Nätverk och systemteknik.
    Lagerström, Robert
    KTH, Skolan för elektroteknik och datavetenskap (EECS), Nätverk och systemteknik.
    Korman, Matus
    KTH, Skolan för elektro- och systemteknik (EES), Elkraftteknik.
    Franke, Ulrik
    Bridging the gap between business and technology in strategic decision-making for cyber security management2016Ingår i: Proceedings of 2016 Portland International Conference on Management of Engineering and Technology, 2016, 32-42 s.Konferensbidrag (Refereegranskat)
    Abstract [en]

    System architectures are getting more and more complex. Thus, making strategic decisions when it comes to managing systems is difficult and needs proper support. One arising issue that managers need to take into account when changing their technology is security. No business is spared from threats in today's connected society. The repercussions of not paying this enough attention could result in loss of money and in case of cyber physical systems, also human lives. Thus, system security has become a high-level management issue. There are various methods of assessing system security. A common method that allows partial automation is attack graph based security analysis. This particular method has many variations and wide tool support. However, a complex technical analysis like the attack graph based one needs experts to run it and interpret the results. In this paper we study what kind of strategic decisions that need the support of threat analysis and how to improve an attack graph based architecture threat assessment method to fit this task. The needs are gathered from experts working with security management and the approach is inspired by an enterprise architecture language called ArchiMate. The paper contains a working example. The proposed approach aims to bridge the gap between technical analysis and business analysis making system architectures easier to manage.

  • 2727.
    Våge, Lars
    Mittuniversitetet.
    Search engines of today and beyond2002Ingår i: Tidskrift för Dokumentation, ISSN 0040-6872, Vol. 57, nr 3, 79-85 s.Artikel i tidskrift (Övrigt vetenskapligt)
    Abstract [en]

    The major Internet search engines nowadays enable us to search for keywords in vast quantities of web pages. In this article the most important crawler-based search engines are reviewed along with newer ones which are starting to make an impact. Web directories, meta-search engines and the use of sponsored links are considered as well as the future of web searching. The need for faster reindexing of the databases of search engines in order to give users a more up-to-date view of the web is emphasized.

  • 2728.
    Våge, Lars
    et al.
    Mittuniversitetet.
    Dalianis, Hercules
    Iselid, Lars
    Informationssökning på Internet2008 (uppl. 2)Bok (Övrigt vetenskapligt)
  • 2729.
    Våleman, Adrian
    Linköpings universitet, Institutionen för datavetenskap, Databas och informationsteknik. Linköpings universitet, Tekniska högskolan.
    Automatgenerering av transaktionshanteringsprocedurer2013Självständigt arbete på grundnivå (kandidatexamen), 10,5 poäng / 16 hpStudentuppsats (Examensarbete)
    Abstract [en]

    In a database environment, when you create or alter tables you often want to have a basic interface for standard operations such as insert, delete and update. This thesis report covers an analysis of what programs there are on the market for generating such interfaces and compares them against the demands of a real company. The analysis showed that none of the programs were completely meeting the requirements and therefore an own implementation of an interface generating program was created. The result is a PL/SQL program capable of generating files, storing them in a version handling system and executing the files into the database.

  • 2730.
    Waddington, Simon
    et al.
    King's College London, UK.
    Hedges, Mark
    King's College London, UK.
    Riga, Marina
    CERTH, Thessaloniki, Greece.
    Mitzias, Panagiotis
    CERTH, Thessaloniki, Greece.
    Kontopoulos, Efstratios
    CERTH, Thessaloniki, Greece.
    Kompatsiaris, Ioannis
    CERTH, Thessaloniki, Greece.
    Vion-Dury, Jean-Yves
    XRCE, Grenoble, France.
    Lagos, Nikolaos
    XRCE, Grenoble, France.
    Darányi, Sándor
    Högskolan i Borås, Akademin för bibliotek, information, pedagogik och IT.
    Corubolo, Fabio
    University of Liverpool, UK.
    Muller, Christian
    BUSOC, Belgium.
    McNeill, John
    Tate Galleries, London, UK.
    PERICLES – Digital Preservation through Management of Change in Evolving Ecosystems.2016Ingår i: The Success of European Projects Using New Information and Communication Technologies / [ed] Hamriouni, S., Setubal, Portugal, 2016, 51-74 s.Konferensbidrag (Refereegranskat)
    Abstract [en]

    Management of change is essential to ensure the long-term reusabilityof digital assets. Change can be brought about in many ways, includingthrough technological, user community and policy factors. Motivated by casestudies in space science and time-based media, we consider the impact ofchange on complex digital objects comprising multiple interdependent entities,such as files, software and documentation. Our approach is based on modellingof digital ecosystems, in which abstract representations are used to assess risksto sustainability and support tasks such as appraisal. The paper is based onwork of the EU FP7 PERICLES project on digital preservation, and presentssome general concepts as well as a description of selected research areas underinvestigation by the project.

  • 2731.
    Waheed, Adnan
    Linköpings universitet, Institutionen för datavetenskap, PELAB - Laboratoriet för programmeringsomgivningar.
    Support for Modelica Action Code in ModelicaML Models2011Självständigt arbete på avancerad nivå (masterexamen), 30 poäng / 45 hpStudentuppsats (Examensarbete)
    Abstract [en]

    ModelicaML is a UML/Modelica profile to support model-driven development of combined software/hardware UML/Modelica models. In order to support the development and maintenance of large ModelicaML models this thesis work has developed advanced enhancements to the ModelicaML profile, to enable users to more conveniently edit textual parts, i.e., action code, of ModelicaML models. This approach covers many of the concepts present in advanced language editors, i.e., code completion, error markers, as well as indentation and code template user support for developing and maintaining complex models. In large and complex models it is hard to remember all the parameters and values given in textual parts of UML diagrams. It is also very difficult to remember the complete set of components of a ModelicaML model. The ModelicaML enhancements developed in this work now supports features to facilitate advanced usage by showing all the components in just one key press. Two levels of Error Marker support have been developed to help user to find errors anywhere in a model without knowing the details. Moreover, ModelicaML has been extended with features like Modelica syntax highlighting and code completion. Furthermore, this work included upgrading and porting ModelicaML to run on the new Papyrus [13] on the new Eclipse versions. For example, by using the new features introduced in ModelicaML in this work the users do not have to remember all the variables from used base classes and derived classes.

  • 2732.
    Wahlén, Conrad
    Linköpings universitet, Institutionen för systemteknik, Informationskodning.
    Global Illumination in Real-Time using Voxel Cone Tracing on Mobile Devices2016Självständigt arbete på avancerad nivå (masterexamen), 20 poäng / 30 hpStudentuppsats (Examensarbete)
    Abstract [en]

    This thesis explores Voxel Cone Tracing as a possible Global Illumination solutionon mobile devices.The rapid increase of performance on low-power graphics processors hasmade a big impact. More advanced computer graphics algorithms are now possi-ble on a new range of devices. One category of such algorithms is Global Illumi-nation, which calculates realistic lighting in rendered scenes. The combinationof advanced graphics and portability is of special interest to implement in newtechnologies like Virtual Reality.The result of this thesis shows that while possible to implement a state of theart Global Illumination algorithm, the performance of mobile Graphics Process-ing Units is still not enough to make it usable in real-time.

  • 2733.
    Wajima, Koji
    et al.
    Tokyo University of Science.
    Hayashi, Masaki
    Högskolan på Gotland, Institutionen för speldesign, teknik och lärande.
    Hurukawa, Toshihiro
    Tokyo University of Science.
    On reusable CG object for MMD in T2V2013Konferensbidrag (Övrigt vetenskapligt)
    Abstract [en]

    Production of Computer Graphics (CG) by individuals has become active. CG movie production free tool called MMD (MikuMikuDance) is famous for its volunteers to produce CG character animations. Videos that have been produced in MMD are very popular among the fans of the character. Many people want to create their own animations, however, the production tool requires highly technical skill, and therefore, there is a big barrier for such individual people to create animations with the MMD. On the other hand, T2V (Text-To-Vision) is proposed to provide the easy-to-use production tool of character animation for the people who do not have much skill of making animations. Considering reuse of CG object of MMD in T2V to allow users to make animation in the easy way, we can expect the further development of content sharing sites. In this paper, we compare the CG formats of each of the MMD and T2V then we have had a test rendering to validate our method. We then clarify the issue of CG object reuse of MMD and T2V for the future applications.

  • 2734.
    Wall, Anders
    et al.
    ABB AB, Corporate Research, Västerås, Sweden .
    Andersson, Johan
    Mälardalens högskola, Institutionen för datavetenskap och elektronik.
    Norström, Christer
    Mälardalens högskola, Institutionen för datavetenskap och elektronik.
    Decreasing Maintenance Costs by Introducing Formal Analysis of Real-Time Behavior in Industrial Settings2006Ingår i: Leveraging Applications of Formal Methods: First International Symposium, ISoLA 2004, Paphos, Cyprus, October 30 - November2, 2004, Revised Selected Papers, 2006, 130-145 s.Konferensbidrag (Övrigt vetenskapligt)
    Abstract [en]

    A common problem with long-lived large industrial software systems such as telecom and industrial automation systems is the increasing complexity and the lack of formal models enabling efficient analyses of critical properties. New features are added or changed during the system life cycle and it becomes harder and harder to predict the impact of maintenance operations such as adding new features or fixing bugs.

    We present a framework for introducing analyzability in a late phase of the system's life cycle. The framework is based on the general idea of introducing a probabilistic formal model that is analyzable with respect to the system properties in focus, timing and usage of logical resources. The analyses are based on simulations. Traditional analysis method falls short due to a too limited modelling language or problems to scale up to real industrial systems.

    This method can be used for predicting the impact caused by e.g. adding a new feature or other changes to the system. This enables the system developers to identify potential problems with their design at an early stage and thus decreasing the maintenance cost.

    The framework primarily targets large industrial real-time systems, but it is applicable on a wide range of software system where complexity is an issue. This paper presents the general ideas of the framework, how to construct, validate, and use this type of models, and how the industry can benefit from this. The paper also present a set of tools developed to support the framework and our experiences from deploying parts of the framework at a company.

  • 2735.
    Wall, Göran
    et al.
    Uppsala University, Sweden.
    Asplund, Lars
    Uppsala University, Sweden.
    Björnfot, Lars
    Uppsala University, Sweden.
    Lundqvist, Kristina
    Uppsala University, Sweden.
    Performance Expectations on Ada Programs1993Ingår i: Proc. Ada-Europe'93, LNCS 688, 1993, 227-239 s.Konferensbidrag (Övrigt vetenskapligt)
  • 2736.
    Wallenberg, Marcus
    et al.
    Linköpings universitet, Institutionen för systemteknik, Datorseende. Linköpings universitet, Tekniska fakulteten.
    Forssen, Per-Erik
    Linköpings universitet, Institutionen för systemteknik, Datorseende. Linköpings universitet, Tekniska fakulteten.
    Attentional Masking for Pre-trained Deep Networks2017Ingår i: Proceedings of IEEE/RSJ International Conference on Intelligent Robots and Systems (IROS17), Institute of Electrical and Electronics Engineers (IEEE), 2017Konferensbidrag (Refereegranskat)
    Abstract [en]

    The ability to direct visual attention is a fundamental skill for seeing robots. Attention comes in two flavours: the gaze direction (overt attention) and attention to a specific part of the current field of view (covert attention), of which the latter is the focus of the present study. Specifically, we study the effects of attentional masking within pre-trained deep neural networks for the purpose of handling ambiguous scenes containing multiple objects. We investigate several variants of attentional masking on partially pre-trained deep neural networks and evaluate the effects on classification performance and sensitivity to attention mask errors in multi-object scenes. We find that a combined scheme consisting of multi-level masking and blending provides the best trade-off between classification accuracy and insensitivity to masking errors. This proposed approach is denoted multilayer continuous-valued convolutional feature masking (MC-CFM). For reasonably accurate masks it can suppress the influence of distracting objects and reach comparable classification performance to unmasked recognition in cases without distractors.

  • 2737.
    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.

  • 2738.
    Wallin, Peter
    et al.
    Mälardalens högskola, Institutionen för datavetenskap och elektronik.
    Fröberg, Joakim
    Volvo Car Corporation, Eskilstuna, Sweden.
    Axelsson, Jakob
    Volvo Car Corporation, Gothenburg, Sweden.
    Making Decisions in Integration of Automotive Software and Electronics: A Method Based on ATAM and AHP2007Ingår i: Proceedings - ICSE 2007 Workshops: Fourth International Workshop on Software Engineering for Automotive Systems, SEAS'07, 2007, Article number 4228592-- s.Konferensbidrag (Övrigt vetenskapligt)
    Abstract [en]

    In this paper we present a new method for makingdecisions on integration strategy for in-vehicle automotive systems.We describe the problem of choosing integration strategy and wedescribe the method, which is a combination of the ArchitectureTradeoff Analysis Method, ATAM, and the Analytical HierarchyProcess, AHP. We exemplify the use of the proposed method byevaluating the integration decisions concerning the physicalconnection of a realistic example system; a computer controlledautomatic gearbox. We present analysis on the use of the method andconclude that the method has several benefits compared to ATAM orAHP used individually. The method firstly supports a structured wayof listing system goals, and secondly, it also supports the makingof design decisions.

  • 2739.
    Wallmyr, Markus
    Mälardalens högskola, Akademin för innovation, design och teknik, Inbyggda system.
    Understanding the user in self-managing systems2015Ingår i: 9th European Conference on Software Architecture Workshops ECSAW 2015, 2015Konferensbidrag (Refereegranskat)
    Abstract [en]

    For distributed systems to appear both intelligent and attractive to the user, they should be grounded in user needs and their ability to use the system. Not only do this increase the possibility of user adoption, but adequate user understanding also gives input for designing system functionality that transforms the ways these tasks are traditionally performed. As intelligent systems increasingly affect our daily life and as distributed systems grow in range and complexity, new usage scenarios appear that need to be understood. Simultaneously, tasks where the human is the only possible operator are now getting closer to being executed by intelligent systems. However, this process of replacing human intelligence by machine control might not remove the human from the system altogether, though it might change human’s role and the character of the tasks performed, making old knowledge less applicable. This paper reflects on the necessity of including the user/operator in the design of intelligent distributed systems. In a novel approach a farming scenario is presented, assessing both local machine distributed systems and the intelligence of cloud-connected infrastructure.

  • 2740.
    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, 155-172 s.Konferensbidrag (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.

  • 2741.
    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, 146-156 s.Konferensbidrag (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.

  • 2742. Wang, C.
    et al.
    Liu, F.
    Min, G.
    Fan, P.
    Xue, X.
    Hu, R.
    Xiao, Ming
    KTH, Skolan för elektro- och systemteknik (EES), Kommunikationsteori.
    Fang, X.
    Miao, W.
    Jiang, Y.
    Message from the HWNQoE 2015 workshop chairs2015Ingår i: Proceedings - 15th IEEE International Conference on Computer and Information Technology, CIT 2015, 14th IEEE International Conference on Ubiquitous Computing and Communications, IUCC 2015, 13th IEEE International Conference on Dependable, Autonomic and Secure Computing, DASC 2015 and 13th IEEE International Conference on Pervasive Intelligence and Computing, PICom 2015, Institute of Electrical and Electronics Engineers (IEEE), 2015, 7362998Konferensbidrag (Refereegranskat)
  • 2743. Wang, Jiazhen
    et al.
    Xu, Jun
    Zheng, Lirong
    KTH, Skolan för informations- och kommunikationsteknik (ICT), Elektroniksystem. Fudan University, Shanghai, China.
    Ren, Junyan
    Design of an analog front-end for ambulatory biopotential measurement systems2010Ingår i: Journal of Semiconductors, ISSN 1674-4926, Vol. 31, nr 10, 105004- s.Artikel i tidskrift (Refereegranskat)
    Abstract [en]

    A continuously tunable gain and bandwidth analog front-end for ambulatory biopotential measurement systems is presented. The front-end circuit is capable of amplifying and conditioning different biosignals. To optimize the power consumption and simplify the system architecture, the front-end only adopts two-stage amplifiers. In addition, careful design eliminates the need for chopping circuits. The input-referred noise of the system is only 1.19 μVrms (0.48-2000 Hz). The chip is fabricated via a SMIC 0.18 μm CMOS process. Although the power consumption is only 32.1 μW under a 3 V voltage supply, test results show that the chip can successfully extract biopotential signals.

  • 2744.
    Wang, Kun
    Mittuniversitetet, Fakulteten för naturvetenskap, teknik och medier, Avdelningen för data- och systemvetenskap.
    Stereoscopic 3D Video Quality of Experience: impact of coding, transmission and display technologies2013Licentiatavhandling, sammanläggning (Övrigt vetenskapligt)
    Abstract [en]

    Three-Dimensional (3D) videos are using their success from cinema to home entertainmentmarkets such as TV, DVD, Blu-ray, video games, etc. The video quality isa key factor which decides the success and acceptance of a new service. Visual qualitywill have more severe consequences for 3D than for 2D videos, e.g. eye-strain,headache and nausea.This thesis addresses the stereoscopic 3D video quality of experience that can beinfluenced during the 3D video distribution chain, especially in relation to coding,transmission and display stages. The first part of the thesis concentrates upon the3D video coding and transmission quality over IP based networks. 3D video codingand transmission quality has been studied from the end-users’ point of view byintroducing different 3D video coding techniques, transmission error scenarios anderror concealment strategies. The second part of the thesis addresses the displayquality characterization. Two types of major consumer grade 3D stereoscopic displayswere investigated: glasses with active shutter (SG) technology based display,and those with passive polarization technology (film patterned retarder,FPR) baseddisplay.Themain outcomes can be summarized in three points: firstly the thesis suggeststhat a spatial down-sampling processworking togetherwith high quality video compressingis a efficient means of encoding and transmitting stereoscopic 3D videoswith an acceptable quality of experience. Secondly, this thesis has found that switchingfrom 3D to 2D is currently the best error concealment method for concealingtransmission errors in the 3D videos. Thirdly, this thesis has compared three majorvisual ergonomic parameters of stereoscopic 3D display system: crosstalk, spatialresolution and flicker visibility. The outcomes of the thesis may be of benefit for 3Dvideo industries in order to improve their technologies in relation to delivering abetter 3D quality of experience to customers.

  • 2745.
    Wang, Lei
    Linköpings universitet, Institutionen för datavetenskap. Linköpings universitet, Tekniska fakulteten.
    GUI test automation for Qt application2015Självständigt arbete på avancerad nivå (masterexamen), 20 poäng / 30 hpStudentuppsats (Examensarbete)
    Abstract [en]

    GUI test automation is a popular and interesting subject in the testing industry. Many companies plan to start test automation projects in order to implement efficient, less expensive software testing. However, there are challenges for the testing team who lack experience performing GUI tests automation. Many GUI test automation projects have ended in failure due to mistakes made during the early stages of the project.

    The major work of this thesis is to find a solution to the challenges of establishing new test automation projects and determine an appropriate method to build GUI tests automation. Due to the particularity of GUI tests automation, keyword driven test approach is introduced in this thesis. The advantages and disadvantages are shown by undertaking comparison with the Record and replay testing method and the data driven testing method. The research also includes a feasibility study of GUI tests automation. The analysis report points out which kinds of test projects should be automated and which kinds should not be automated.

    Test automation tool selection is a critical step for an test automation project. This thesis shows the correct procedure for selecting a testing tool and explains the strategies of testing tool selection. It also summaries the mistakes made during the tool selection process. Several classical types of testing tools which support Qt software testing are compared and evaluated. Based on the in-depth analysis and comparison of testing tools, the thesis explains how the different tools fit with the different test projects.

    The implementation procedure of a test automation is demonstrated in this thesis. The procedure includes test case design and testing framework implementation. The test script is created based on the structure of a keyword driven test framework. The thesis also discusses several interesting topics related to GUI tests automation for future research.

  • 2746.
    Wang, Lihui
    et al.
    National Research Council of Canada.
    Shen, Weiming
    A Web-Based Approach to Real-Time Machine Condition Monitoring and Control2005Ingår i: Manufacturing Engineering and Materials Handling, 2005 Pts A and B, The American Society of Mechanical Engineers , 2005, Vol. 16, 641-646 s.Konferensbidrag (Refereegranskat)
    Abstract [en]

    The objective of this research is to develop a web-based approach to remote machine condition monitoring and control enabled by Java technologies and based on publish-subscribe design pattern. On top of a Wise-ShopFloor framework (W eb-based i ntegrated s ensor-driven e-ShopFloor ), this system can serve real-time data from bottom up and can function as a constituent component of e-manufacturing, particularly for web-based collaborative manufacturing. It is designed to use the popular client-server architecture, VCM (view-control-model) design pattern, and publish-subscribe design pattern for secure device control and efficient machine condition monitoring. This paper presents the basis of the developed technology for building a web-based monitoring and control system that can be easily integrated to the e-manufacturing paradigm. A case study of a tripod parallel kinematic machine is carried out to demonstrate the effectiveness and validate our approach to web-based real-time machine condition monitoring and remote control for collaborative manufacturing.

  • 2747.
    Wang, Xi Vincent
    et al.
    KTH, Centra, XPRES, Excellence in production research. KTH, Skolan för industriell teknik och management (ITM), Industriell produktion, Produktionssystem.
    Wang, Lihui
    KTH, Skolan för industriell teknik och management (ITM), Industriell produktion, Produktionssystem.
    A cloud-based production system for information and service integration: an internet of things case study on waste electronics2017Ingår i: Enterprise Information Systems, ISSN 1751-7575, E-ISSN 1751-7583, Vol. 11, nr 7, 952-968 s.Artikel i tidskrift (Refereegranskat)
    Abstract [en]

    Cloud computing is the new enabling technology that offers centralised computing, flexible data storage and scalable services. In the manufacturing context, it is possible to utilise the Cloud technology to integrate and provide industrial resources and capabilities in terms of Cloud services. In this paper, a function block-based integration mechanism is developed to connect various types of production resources. A Cloud-based architecture is also deployed to offer a service pool which maintains these resources as production services. The proposed system provides a flexible and integrated information environment for the Cloud-based production system. As a specific type of manufacturing, Waste Electrical and Electronic Equipment (WEEE) remanufacturing experiences difficulties in system integration, information exchange and resource management. In this research, WEEE is selected as the example of Internet of Things to demonstrate how the obstacles and bottlenecks are overcome with the help of Cloud-based informatics approach. In the case studies, the WEEE recycle/recovery capabilities are also integrated and deployed as flexible Cloud services. Supporting mechanisms and technologies are presented and evaluated towards the end of the paper.

  • 2748.
    Wang, Xi Vincent
    et al.
    KTH, Centra, XPRES, Excellence in production research. KTH, Skolan för industriell teknik och management (ITM), Industriell produktion, Produktionssystem.
    Wang, Lihui
    KTH, Skolan för industriell teknik och management (ITM), Industriell produktion, Produktionssystem.
    INTEROPERABILITY IN CLOUD MANUFACTURING AND PRACTICE ON PRIVATE CLOUD STRUCTURE FOR SMEs2017Ingår i: PROCEEDINGS OF THE ASME 12TH INTERNATIONAL MANUFACTURING SCIENCE AND ENGINEERING CONFERENCE - 2017, VOL 3, AMER SOC MECHANICAL ENGINEERS , 2017Konferensbidrag (Refereegranskat)
    Abstract [en]

    In recent years, Cloud manufacturing has become a new research trend in manufacturing systems leading to the next generation of production paradigm. However, the interoperability issue still requires more research due to the heterogeneous environment caused by multiple Cloud services and applications developed in different platforms and languages. Therefore, this research aims to combat the interoperability issue in Cloud Manufacturing System. During implementation, the industrial users, especially Small- and Medium-sized Enterprises (SMEs), are normally short of budget for hardware and software investment due to financial stresses, but they are facing multiple challenges required by customers at the same time including security requirements, safety regulations. Therefore in this research work, the proposed Cloud manufacturing system is specifically tailored for SMEs.

  • 2749.
    Wang, Xi
    et al.
    KTH, Skolan för industriell teknik och management (ITM), Industriell produktion.
    Xu, X.
    Virtualise manufacturing capabilities in the cloud: Requirements, architecture and implementation2014Ingår i: International Journal of Manufacturing Research, ISSN 1750-0591, Vol. 9, nr 4, 348-368 s.Artikel i tidskrift (Refereegranskat)
    Abstract [en]

    In recent years, cloud manufacturing concept has been proposed by taking advantage of cloud computing to enhance the performance of manufacturing industry. Cloud manufacturing can be perceived as two types, i.e., manufacturing version of computing cloud, and a distributed environment that is networked around manufacturing cloud. This paper discusses manufacturing resources, abilities and relevant essentials from the service-oriented perspective. The functional requirements of a cloud manufacturing environment are also discussed, along with an interoperable manufacturing system framework. Cloud resource integration methods have been developed based on the function block and software agent technologies. It is possible to achieve a collaborative, intelligent, and distributed environment via cloud manufacturing technologies.

  • 2750.
    Wang, Yuquan
    KTH, Skolan för datavetenskap och kommunikation (CSC), Datorseende och robotik, CVAP.
    Reactive control and coordination of redundant robotic systems2016Doktorsavhandling, sammanläggning (Övrigt vetenskapligt)
    Abstract [en]

    Redundant robotic systems, in terms of manipulators with one or twoarms, mobile manipulators, and multi-agent systems, have received an in-creasing amount of attention in recent years. In this thesis we describe severalways to improve robotic system performance by exploiting the redundancy.

    As the robot workspace becomes increasingly dynamic, it is common towork with imperfect geometric models of the robots or its workspace. Inorder to control the robot in a robust way in the presence of geometric uncer-tainties, we propose to assess the stability of our controller with respect to acertain task by deriving bounds on the geometric uncertainties. Preliminaryexperimental results support the fact that stability is ensured if the proposedbounds on the geometric uncertainties are fulfilled.

    As a non-contact measurement, computer vision could provide rich infor-mation for robot control. We introduce a two step method that transformsthe position-based visual servoing problem into a quadratic optimization prob-lem with linear constraints. This method is optimal in terms of minimizinggeodesic distance and allows us to integrate constraints, e.g. visibility con-straints, in a natural way.

    In the case of a single robot with redundant degrees of freedom, we canspecify a family of complex robotic tasks using constraint based programming(CBP). CBP allows us to represent robotic tasks with a set of equality andinequality constraints. Using these constraints we can formulate quadraticprogramming problems that exploit the redundancy of the robot and itera-tively resolve the trade-off between the different constraints. For example, wecould improve the velocity or force transmission ratios along a task-dependent direction using the priorities between different constraints in real time.

    Using the reactiveness of CBP, we formulated and implemented a dual-armpan cleaning task. If we mount a dual-arm robot on a mobile base, we proposeto use a virtual kinematic chain to specify the coordination between the mobilebase and two arms. Using the modularity of the CBP, we can integrate themobility and dual-arm manipulation by adding coordination constraints intoan optimization problem where dual-arm manipulation constraints are alreadyspecified. We also found that the reactiveness and modularity of the CBPapproach is important in the context of teleoperation. Inspired by the 3Ddesign community, we proposed a teleoperation interface control mode thatis identical to the ones being used to locally navigate the virtual viewpoint ofmost Computer Aided Design (CAD) softwares.

    In the case of multiple robots, we combine ideas from multi-agent coopera-tive coverage control, with problem formulations from the resource allocationfield, to create a distributed convergent approach to the resource positioningproblem.

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