Quantum artificial vision for defect detection in manufacturing

In this paper we consider several algorithms for quantum computer vision using Noisy Intermediate-Scale Quantum (NISQ) devices, and benchmark them for a real problem against their classical counterparts. Specifically, we consider two approaches: a quantum Support Vector Machine (QSVM) on a universal gate-based quantum computer, and QBoost on a quantum annealer. The quantum vision systems are benchmarked for an unbalanced dataset of images where the aim is to detect defects in manufactured car pieces. We see that the quantum algorithms outperform their classical counterparts in several ways, with QBoost allowing for larger problems to be analyzed with present-day quantum annealers. Data preprocessing, including dimensionality reduction and contrast enhancement, is also discussed, as well as hyperparameter tuning in QBoost. To the best of our knowledge, this is the first implementation of quantum computer vision systems for a problem of industrial relevance in a manufacturing production line.Comment: 11 pages, 7 figures, 16 tables, revised versio

Hybrid genetic algorithms in agent-based artificial market model for simulating fan tokens trading

In recent years cryptographic tokens have gained popularity as they can be used as a form of emerging alter- native financing and as a means of building platforms. The token markets innovate quickly through technology and decentralization, and they are constantly changing, and they have a high risk. Negotiation strategies must therefore be suited to these new circumstances. The genetic algorithm offers a very appropriate approach to resolving these complex issues. However, very little is known about genetic algorithm methods in cryptographic tokens. Accordingly, this paper presents a case study of the simulation of Fan Tokens trading by implementing selected best trading rule sets by a genetic algorithm that simulates a negotiation system through the Monte Carlo method. We have applied Adaptive Boosting and Genetic Algorithms, Deep Learning Neural Network-Genetic Algorithms, Adaptive Genetic Algorithms with Fuzzy Logic, and Quantum Genetic Algorithm techniques. The period selected is from December 1, 2021 to August 25, 2022, and we have used data from the Fan Tokens of Paris Saint-Germain, Manchester City, and Barcelona, leaders in the market. Our results conclude that the Hybrid and Quantum Genetic algorithm display a good execution during the training and testing period. Our study has a major impact on the current decentralized markets and future business opportunitiesThis research was funded by the Universitat de Barcelona, under the grant UB-AE-AS017634

Coronal loop detection from solar images and extraction of salient contour groups from cluttered images.

This dissertation addresses two different problems: 1) coronal loop detection from solar images: and 2) salient contour group extraction from cluttered images. In the first part, we propose two different solutions to the coronal loop detection problem. The first solution is a block-based coronal loop mining method that detects coronal loops from solar images by dividing the solar image into fixed sized blocks, labeling the blocks as Loop or Non-Loop , extracting features from the labeled blocks, and finally training classifiers to generate learning models that can classify new image blocks. The block-based approach achieves 64% accuracy in IO-fold cross validation experiments. To improve the accuracy and scalability, we propose a contour-based coronal loop detection method that extracts contours from cluttered regions, then labels the contours as Loop and Non-Loop , and extracts geometric features from the labeled contours. The contour-based approach achieves 85% accuracy in IO-fold cross validation experiments, which is a 20% increase compared to the block-based approach. In the second part, we propose a method to extract semi-elliptical open curves from cluttered regions. Our method consists of the following steps: obtaining individual smooth contours along with their saliency measures; then starting from the most salient contour, searching for possible grouping options for each contour; and continuing the grouping until an optimum solution is reached. Our work involved the design and development of a complete system for coronal loop mining in solar images, which required the formulation of new Gestalt perceptual rules and a systematic methodology to select and combine them in a fully automated judicious manner using machine learning techniques that eliminate the need to manually set various weight and threshold values to define an effective cost function. After finding salient contour groups, we close the gaps within the contours in each group and perform B-spline fitting to obtain smooth curves. Our methods were successfully applied on cluttered solar images from TRACE and STEREO/SECCHI to discern coronal loops. Aerial road images were also used to demonstrate the applicability of our grouping techniques to other contour-types in other real applications

It Takes Two to Negotiate: Modeling Social Exchange in Online Multiplayer Games

Online games are dynamic environments where players interact with each other, which offers a rich setting for understanding how players negotiate their way through the game to an ultimate victory. This work studies online player interactions during the turn-based strategy game, Diplomacy. We annotated a dataset of over 10,000 chat messages for different negotiation strategies and empirically examined their importance in predicting long- and short-term game outcomes. Although negotiation strategies can be predicted reasonably accurately through the linguistic modeling of the chat messages, more is needed for predicting short-term outcomes such as trustworthiness. On the other hand, they are essential in graph-aware reinforcement learning approaches to predict long-term outcomes, such as a player's success, based on their prior negotiation history. We close with a discussion of the implications and impact of our work. The dataset is available at https://github.com/kj2013/claff-diplomacy.Comment: 28 pages, 11 figures. Accepted to CSCW '24 and forthcoming the Proceedings of ACM HCI '2

Computational approaches to predict protein functional families and functional sites.

Understanding the mechanisms of protein function is indispensable for many biological applications, such as protein engineering and drug design. However, experimental annotations are sparse, and therefore, theoretical strategies are needed to fill the gap. Here, we present the latest developments in building functional subclassifications of protein superfamilies and using evolutionary conservation to detect functional determinants, for example, catalytic-, binding- and specificity-determining residues important for delineating the functional families. We also briefly review other features exploited for functional site detection and new machine learning strategies for combining multiple features

Optimisation de Base de Donnée pour la Détection de Piétons temps-réel

International audienceThis paper tackles data selection for training set generation in the context of nearreal-time pedestrian detection through the introduction of a training methodology: FairTrain.After highlighting the impact of poorly chosen data on detector performance, we will introduce anew data selection technique utilizing the expectation-maximization algorithm for data weighting.FairTrain also features a version of the cascade-of-rejectors enhanced with data selection principles.Experiments on the INRIA and PETS2009 datasets prove that, when ne trained, a simple HoG-based detector can perform on par with most of its near real-time competitors.Ce document traite de la sélection de données pour la génération de l’ensembled’entraînement dans le contexte de la détection des piétons en temps-réel grâce a l’introductiond’une méthodologie: FairTrain. Après avoir souligné l’impact des données mal choisies sur lesperformances des détecteurs, nous allons présenter une nouvelle technique de sélection de donnéespondéré par l’algorithme d’expectation-maximization. FairTrain propose également une versionde cascade-de-rejecteurs améliorée avec des principes de sélection de données. Les expériencessur les bases de données INRIA et Caltech prouvent que, lorsqu’ils sont bien formés, un simpledétecteur basé sur des HoGs fonctionne aussi bien que ses concurrents temps-réel

Identification of Software Bugs by Analyzing Natural Language-Based Requirements Using Optimized Deep Learning Features

© 2024 Tech Science Press. All rights reserved. This is an open access article distributed under the Creative Commons Attribution License, to view a copy of the license, see: https://creativecommons.org/licenses/by/4.0/Software project outcomes heavily depend on natural language requirements, often causing diverse interpretations and issues like ambiguities and incomplete or faulty requirements. Researchers are exploring machine learning to predict software bugs, but a more precise and general approach is needed. Accurate bug prediction is crucial for software evolution and user training, prompting an investigation into deep and ensemble learning methods. However, these studies are not generalized and efficient when extended to other datasets. Therefore, this paper proposed a hybrid approach combining multiple techniques to explore their effectiveness on bug identification problems. The methods involved feature selection, which is used to reduce the dimensionality and redundancy of features and select only the relevant ones; transfer learning is used to train and test the model on different datasets to analyze how much of the learning is passed to other datasets, and ensemble method is utilized to explore the increase in performance upon combining multiple classifiers in a model. Four National Aeronautics and Space Administration (NASA) and four Promise datasets are used in the study, showing an increase in the model’s performance by providing better Area Under the Receiver Operating Characteristic Curve (AUC-ROC) values when different classifiers were combined. It reveals that using an amalgam of techniques such as those used in this study, feature selection, transfer learning, and ensemble methods prove helpful in optimizing the software bug prediction models and providing high-performing, useful end mode.Peer reviewe

A Learning-based Approach to Exploiting Sensing Diversity in Performance Critical Sensor Networks

Wireless sensor networks for human health monitoring, military surveillance, and disaster warning all have stringent accuracy requirements for detecting and classifying events while maximizing system lifetime. to meet high accuracy requirements and maximize system lifetime, we must address sensing diversity: sensing capability differences among both heterogeneous and homogeneous sensors in a specific deployment. Existing approaches either ignore sensing diversity entirely and assume all sensors have similar capabilities or attempt to overcome sensing diversity through calibration. Instead, we use machine learning to take advantage of sensing differences among heterogeneous sensors to provide high accuracy and energy savings for performance critical applications.;In this dissertation, we provide five major contributions that exploit the nuances of specific sensor deployments to increase application performance. First, we demonstrate that by using machine learning for event detection, we can explore the sensing capability of a specific deployment and use only the most capable sensors to meet user accuracy requirements. Second, we expand our diversity exploiting approach to detect multiple events using a distributed manner. Third, we address sensing diversity in body sensor networks, providing a practical, user friendly solution for activity recognition. Fourth, we further increase accuracy and energy savings in body sensor networks by sharing sensing resources among neighboring body sensor networks. Lastly, we provide a learning-based approach for forwarding event detection decisions to data sinks in an environment with mobile sensor nodes