24 research outputs found

    Approximate Approximation on a Quantum Annealer

    Full text link
    Many problems of industrial interest are NP-complete, and quickly exhaust resources of computational devices with increasing input sizes. Quantum annealers (QA) are physical devices that aim at this class of problems by exploiting quantum mechanical properties of nature. However, they compete with efficient heuristics and probabilistic or randomised algorithms on classical machines that allow for finding approximate solutions to large NP-complete problems. While first implementations of QA have become commercially available, their practical benefits are far from fully explored. To the best of our knowledge, approximation techniques have not yet received substantial attention. In this paper, we explore how problems' approximate versions of varying degree can be systematically constructed for quantum annealer programs, and how this influences result quality or the handling of larger problem instances on given set of qubits. We illustrate various approximation techniques on both, simulations and real QA hardware, on different seminal problems, and interpret the results to contribute towards a better understanding of the real-world power and limitations of current-state and future quantum computing.Comment: Proceedings of the 17th ACM International Conference on Computing Frontiers (CF 2020

    Using tracked mobile sensors to make maps of environmental effects

    Get PDF
    We present a study the results of a study of environmental carbon monoxide pollution that has uses a set of tracked, mobile pollution sensors. The motivating concept is that we will be able to map pollution and other properties of the real world a fine scale if we can deploy a large set of sensors with members of the general public who would carry them as they go about their normal everyday activities. To prove the viability of this concept we have to demonstrate that data gathered in an ad-hoc manner is reliable enough in order to allow us to build interesting geo-temporal maps. We present a trial using a small number of global positioning system-tracked CO sensors. From analysis of raw GPS logs we find some well-known spatial and temporal properties of CO. Further, by processing the GPS logs we can find fine-grained variations in pollution readings such as when crossing roads. We then discuss the space of possibilities that may be enabled by tracking sensors around the urban environment – both in getting at personal experience of properties of the environment and in making summative maps to predict future conditions. Although we present a study of CO, the techniques will be applicable to other environmental properties such as radio signal strength, noise, weather and so on

    Indoor Position System Based on a Zigbee Network

    Get PDF
    TAIS group has developed an indoor position system prototype based on a fingerprint positioning algorithm. The prototype uses IEEE 802.15.4 mote and BitCloud Stack, a full-featured ZigBee Compliant, second generation embedded software stack from Atmel. The design requirements of the prototype were only to determine the actual position in a room of a user in a building, so the prototype accuracy is room accuracy. TAIS group decided to compete in the second edition of EvAAL Competition. This paper presents all the step made to adapt the prototype to the EvAAL environment, the found drawbacks and the obtained results. One of the most important drawback was that the Smart House Living Lab of the Polytechnic University of Madrid has only two rooms, the required accuracy was meters (error less than or equal to 0,5 meters the higher score, higher than 4 meters no score) and the room accuracy was substituted by areas of interest so the behavior of our prototype was going to work was an incognita.Junta de AndalucĂ­a p08-TIC-363

    Crowdfunding: The Current State Of Research

    Get PDF
    Crowdfunding represents an alternative way of funding compared to traditional borrowing. As a principle, crowdfunding is open to everyone - private persons as well as economic actors. A group of people, the crowd, financially contributes small amounts to projects, products or ideas. These projects, products or ideas are owned by fundraisers (e.g. entrepreneurs or private persons), seeking for money in order to get their project realized. Fundraisers search for investors directly or via a specific digital platform, referred to as intermediaries. Crowdfunding represents a recent web 2.0 based phenomenon gaining more and more scientific attention. Therefore, this article seeks to give an overview on the current state of scientific knowledge on the topic, summarizing core definitions as well as characteristics

    Information Entropy Theory Based Recognition of the Validity of Contextual Information of Restaurants: An Empirical Study

    Get PDF
    Contextual information plays a key role in personalized recommendations. However, not all contextual information plays a positive role in personalized recommendations. Therefore, it is critical to identify the effective contextual information to realize personalized recommendations. This study aims to develop a set of feasible context importance calculation methods that can identify effective contextual information in different application scenarios. The information entropy of each contextual dimension is calculated, and the validity of the context compared according to the magnitude of its entropy is determined based on the informational entropy theory. Subsequently, this approach is applied to hotel and catering service data to determine the valid context in the dining domain. The experimental results indicate that location, work-rest condition, weather, mood and companionship considerably influence consumers’ behaviour and decisions in a catering environment, and the user preference in such contexts should be carefully considered

    Optimizing embedding-related quantum annealing parameters for reducing hardware bias

    Full text link
    Quantum annealers have been designed to propose near-optimal solutions to NP-hard optimization problems. However, the accuracy of current annealers such as the ones of D-Wave Systems, Inc., is limited by environmental noise and hardware biases. One way to deal with these imperfections and to improve the quality of the annealing results is to apply a variety of pre-processing techniques such as spin reversal (SR), anneal offsets (AO), or chain weights (CW). Maximizing the effectiveness of these techniques involves performing optimizations over a large number of parameters, which would be too costly if needed to be done for each new problem instance. In this work, we show that the aforementioned parameter optimization can be done for an entire class of problems, given each instance uses a previously chosen fixed embedding. Specifically, in the training phase, we fix an embedding E of a complete graph onto the hardware of the annealer, and then run an optimization algorithm to tune the following set of parameter values: the set of bits to be flipped for SR, the specific qubit offsets for AO, and the distribution of chain weights, optimized over a set of training graphs randomly chosen from that class, where the graphs are embedded onto the hardware using E. In the testing phase, we estimate how well the parameters computed during the training phase work on a random selection of other graphs from that class. We investigate graph instances of varying densities for the Maximum Clique, Maximum Cut, and Graph Partitioning problems. Our results indicate that, compared to their default behavior, substantial improvements of the annealing results can be achieved by using the optimized parameters for SR, AO, and CW

    The Smart Mobile Application Framework (SMAF) - Exploratory Evaluation in the Smart City Contex

    Get PDF
    What makes mobile apps "smart"? This paper challenges this question by seeking to identify the inherent characteristics of smartness. Starting with the etymological foundations of the term, elements of smart behavior in software applications are extracted from the literature, elaborated and contrasted. Based on these findings we propose a Smart Mobile Application Framework incorporating a set of activities and qualities associated with smart mobile software. The framework is applied to analyze a specific mobile application in the context of Smart Cities and proves its applicability for uncovering the implementation of smart concepts in real-world settings. Hence, this work contributes to research by conceptualizing a new type of application and provides useful insights to practitioners who want to design, implement or evaluate smart mobile applications
    corecore