Reviewerly/exHarmony huggingface dataset:
Vulnerability assessment and detection of Deepfake videos

It is becoming increasingly easy to automatically replace a face of one person in a video with the face of another person by using a pre-trained generative adversarial network (GAN). Recent public scandals, e.g., the faces of celebrities being swapped onto pornographic videos, call for automated ways to detect these Deepfake videos. To help developing such methods, in this paper, we present the first publicly available set of Deepfake videos generated from videos of VidTIMIT database. We used open source software based on GANs to create the Deepfakes, and we emphasize that training and blending parameters can significantly impact the quality of the resulted videos. To demonstrate this impact, we generated videos with low and high visual quality (320 videos each) using differently tuned parameter sets. We showed that the state of the art face recognition systems based on VGG and Facenet neural networks are vulnerable to Deepfake videos, with 85.62% and 95.00% false acceptance rates (on high quality versions) respectively, which means methods for detecting Deepfake videos are necessary. By considering several baseline approaches, we found the best performing method based on visual quality metrics, which is often used in presentation attack detection domain, to lead to 8.97% equal error rate on high quality Deep-fakes. Our experiments demonstrate that GAN-generated Deepfake videos are challenging for both face recognition systems and existing detection methods, and the further development of face swapping technology will make it even more so.
Impact of robot hotel service on consumers’ purchase intention: a control experiment

As an innovative technology, robot services are now used in the tourism industry to enhance consumer experience. Despite its importance, the impact of robot applications on the purchase intention of consumers has received limited, if any, attention. Considering that purchase intention can largely lead to actual purchase behaviour, this study investigated the impact of robot hotel service on the purchase intention of consumers through an experiment. Findings revealed that the purchase intention of the group who watched a video about robot hotel service was significantly higher than those who watched traditional hotel service video. Implications are further discussed.
Multiple Discrimination and Pairwise CNN for view-based 3D object retrieval

With the rapid development and wide application of computer, camera device, network and hardware technology, 3D object (or model) retrieval has attracted widespread attention and it has become a hot research topic in the computer vision domain. Deep learning features already available in 3D object retrieval have been proven to be better than the retrieval performance of hand-crafted features. However, most existing networks do not take into account the impact of multi-view image selection on network training, and the use of contrastive loss alone only forcing the same-class samples to be as close as possible. In this work, a novel solution named Multi-view Discrimination and Pairwise CNN (MDPCNN) for 3D object retrieval is proposed to tackle these issues. It can simultaneously input multiple batches and multiple views by adding the Slice layer and the Concat layer. Furthermore, a highly discriminative network is obtained by training samples that are not easy to be classified by clustering. Lastly, we deploy the contrastive-center loss and contrastive loss as the optimization objective that has better intra-class compactness and inter-class separability. Large-scale experiments show that the proposed MDPCNN can achieve a significant performance over the state-of-the-art algorithms in 3D object retrieval.
Fast Utility Mining on Sequence Data

High-utility sequential pattern (HUSP) mining is an emerging topic in the field of knowledge discovery in databases. It consists of discovering subsequences that have a high utility (importance) in sequences, which can be referred to as HUSPs. HUSPs can be applied to many real-life applications, such as market basket analysis, e-commerce recommendations, click-stream analysis, and route planning. Several algorithms have been proposed to efficiently mine utility-based useful sequential patterns. However, due to the combinatorial explosion of the search space for low utility threshold and large-scale data, the performances of these algorithms are unsatisfactory in terms of runtime and memory usage. Hence, this article proposes an efficient algorithm for the task of HUSP mining, called HUSP mining with UL-list (HUSP-ULL). It utilizes a lexicographic q-sequence (LQS)-tree and a utility-linked (UL)-list structure to quickly discover HUSPs. Furthermore, two pruning strategies are introduced in HUSP-ULL to obtain tight upper bounds on the utility of the candidate sequences and reduce the search space by pruning unpromising candidates early. Substantial experiments on both real-life and synthetic datasets showed that HUSP-ULL can effectively and efficiently discover the complete set of HUSPs and that it outperforms the state-of-the-art algorithms.
Blockchain-Enabled Accountability Mechanism Against Information Leakage in Vertical Industry Services

The emergence of 5 G technology contributes to create more open and efficient eco-systems for various vertical industries. Especially, it significantly improves the capabilities of the vertical industries focusing on content-sharing services like mobile telemedicine, etc. However, cyber threats such as information leakage or piracy are more likely to occur in an open 5 G networks. So tracking information leakage in 5 G environments has become a daunting task. The existing tracing and accountability schemes have nonnegligible limitations in practice due to the dependence on a Trusted Third Party (TTP) or being encumbered with the significant overhead. Fortunately, the blockchain helps to mitigate these problems. In this paper, we propose a blockchain-enabled accountability mechanism against information leakage in the content-sharing services of the vertical industry services. For any information converted to vector form, we use the blockchain technology to ensure that service providers and clients can securely and fairly generate and share watermarked content. Besides, the homomorphic encryption is introduced to avoid the disclosure of the watermarking content, which guarantees the subsequent TTP-free arbitration. Finally, we theoretically analyze the security of the scheme and verify its performance.
DSNet: Joint Semantic Learning for Object Detection in Inclement Weather Conditions

In the past half of the decade, object detection approaches based on the convolutional neural network have been widely studied and successfully applied in many computer vision applications. However, detecting objects in inclement weather conditions remains a major challenge because of poor visibility. In this article, we address the object detection problem in the presence of fog by introducing a novel dual-subnet network (DSNet) that can be trained end-to-end and jointly learn three tasks: visibility enhancement, object classification, and object localization. DSNet attains complete performance improvement by including two subnetworks: detection subnet and restoration subnet. We employ RetinaNet as a backbone network (also called detection subnet), which is responsible for learning to classify and locate objects. The restoration subnet is designed by sharing feature extraction layers with the detection subnet and adopting a feature recovery (FR) module for visibility enhancement. Experimental results show that our DSNet achieved 50.84 percent mean average precision (mAP) on a synthetic foggy dataset that we composed and 41.91 percent mAP on a public natural foggy dataset (Foggy Driving dataset), outperforming many state-of-the-art object detectors and combination models between dehazing and detection methods while maintaining a high speed.
Towards A Rigorous Evaluation Of XAI Methods On Time Series

Explainable Artificial Intelligence (XAI) methods are typically deployed to explain and debug black-box machine learning models. However, most proposed XAI methods are black-boxes themselves and designed for images. Thus, they rely on visual interpretability to evaluate and prove explanations. In this work, we apply XAI methods previously used in the image and text-domain on time series. We present a methodology to test and evaluate various XAI methods on time series by introducing new verification techniques to incorporate the temporal dimension. We further conduct preliminary experiments to assess the quality of selected XAI method explanations with various verification methods on a range of datasets and inspecting quality metrics on it. We demonstrate that in our initial experiments, SHAP works robust for all models, but others like DeepLIFT, LRP, and Saliency Maps work better with specific architectures.
Backdoor Embedding in Convolutional Neural Network Models via Invisible Perturbation

Deep learning models have consistently outperformed traditional machine learning models in various classification tasks, including image classification. As such, they have become increasingly prevalent in many real world applications including those where security is of great concern. Such popularity, however, may attract attackers to exploit the vulnerabilities of the deployed deep learning models and launch attacks against security-sensitive applications. In this paper, we focus on a specific type of data poisoning attack, which we refer to as a \em backdoor injection attack. The main goal of the adversary performing such attack is to generate and inject a backdoor into a deep learning model that can be triggered to recognize certain embedded patterns with a target label of the attacker's choice. Additionally, a backdoor injection attack should occur in a stealthy manner, without undermining the efficacy of the victim model. Specifically, we propose two approaches for generating a backdoor that is hardly perceptible yet effective in poisoning the model. We consider two attack settings, with backdoor injection carried out either before model training or during model updating. We carry out extensive experimental evaluations under various assumptions on the adversary model, and demonstrate that such attacks can be effective and achieve a high attack success rate (above 90%) at a small cost of model accuracy loss with a small injection rate, even under the weakest assumption wherein the adversary has no knowledge either of the original training data or the classifier model.
Capuchin

In recent years, deep learning has gained unprecedented success in various domains, the key of the success is the larger and deeper deep neural networks (DNNs) that achieved very high accuracy. On the other side, since GPU global memory is a scarce resource, large models also pose a significant challenge due to memory requirement in the training process. This restriction limits the DNN architecture exploration flexibility.
Human activity recognition using magnetic induction-based motion signals and deep recurrent neural networks

Recognizing human physical activities using wireless sensor networks has attracted significant research interest due to its broad range of applications, such as healthcare, rehabilitation, athletics, and senior monitoring. There are critical challenges inherent in designing a sensor-based activity recognition system operating in and around a lossy medium such as the human body to gain a trade-off among power consumption, cost, computational complexity, and accuracy. We introduce an innovative wireless system based on magnetic induction for human activity recognition to tackle these challenges and constraints. The magnetic induction system is integrated with machine learning techniques to detect a wide range of human motions. This approach is successfully evaluated using synthesized datasets, laboratory measurements, and deep recurrent neural networks.
Engineering the level structure of a giant artificial atom in waveguide quantum electrodynamics

Engineering light-matter interactions at the quantum level has been central to the pursuit of quantum optics for decades. Traditionally, this has been done by coupling emitters, typically natural atoms and ions, to quantized electromagnetic fields in optical and microwave cavities. In these systems, the emitter is approximated as an idealized dipole, as its physical size is orders of magnitude smaller than the wavelength of light. Recently, artificial atoms made from superconducting circuits have enabled new frontiers in light-matter coupling, including the study of "giant" atoms which cannot be approximated as simple dipoles. Here, we explore a new implementation of a giant artificial atom, formed from a transmon qubit coupled to propagating microwaves at multiple points along an open transmission line. The nature of this coupling allows the qubit radiation field to interfere with itself leading to some striking giant-atom effects. For instance, we observe strong frequency-dependent couplings of the qubit energy levels to the electromagnetic modes of the transmission line. Combined with the ability to in situ tune the qubit energy levels, we show that we can modify the relative coupling rates of multiple qubit transitions by more than an order of magnitude. By doing so, we engineer a metastable excited state, allowing us to operate the giant transmon as an effective lambda system where we clearly demonstrate electromagnetically induced transparency.
Unsupervised Person Re-identification via Cross-Camera Similarity Exploration

Most person re-identification (re-ID) approaches are based on supervised learning, which requires manually annotated data. However, it is not only resource-intensive to acquire identity annotation but also impractical for large-scale data. To relieve this problem, we propose a cross-camera unsupervised approach that makes use of unsupervised style-transferred images to jointly optimize a convolutional neural network (CNN) and the relationship among the individual samples for person re-ID. Our algorithm considers two fundamental facts in the re-ID task, i.e., variance across diverse cameras and similarity within the same identity. In this paper, we propose an iterative framework which overcomes the camera variance and achieves across-camera similarity exploration. Specifically, we apply an unsupervised style transfer model to generate style-transferred training images with different camera styles. Then we iteratively exploit the similarity within the same identity from both the original and the style-transferred data. We start with considering each training image as a different class to initialize the Convolutional Neural Network (CNN) model. Then we measure the similarity and gradually group similar samples into one class, which increases similarity within each identity. We also introduce a diversity regularization term in the clustering to balance the cluster distribution. The experimental results demonstrate that our algorithm is not only superior to state-of-the-art unsupervised re-ID approaches, but also performs favorably compared with other competing unsupervised domain adaptation methods (UDA) and semi-supervised learning methods.
DEACO: Adopting dynamic evaporation strategy to enhance ACO algorithm for the traveling salesman problem

Ant Colony Optimization (ACO) algorithm is one of the effective solutions to solve the problem of combination optimization like traveling salesman problem (TSP) which belongs to NP-hard problem. However, this algorithm is robust and has a strong ability for solution discovery, but the convergence speed of that is low and stuck into local optimum. Therefore, for overcoming the drawbacks of ACO, we proposed a self-adaptive ACO with unique strategies to improve uncertain convergence time and random decisions of this algorithm. The proposed technique (DEACO) adjusting the ACO parameters dynamically. In this mechanism, main idea is how to select the first city (start point) to achieve the shortest path based on clustering. In this approach, DEACO finds the minimum cost/shortest path for each cluster. The data that used for this experiment is from TSPLIB library under MATLAB simulation with 10 TSP instances. The experiment outcome illustrates better performance of the proposed method than the conventional ACO in term of faster convergence speed and higher search accuracy.
Transparency and accountability in AI decision support: Explaining and visualizing convolutional neural networks for text information

Proliferating applications of deep learning, along with the prevalence of large-scale text datasets, have revolutionized the natural language processing (NLP) field, thereby driving the recent explosive growth. Nevertheless, it is argued that state-of-the-art studies focus excessively on producing quantitative performances superior to existing models, by playing “the Kaggle game.” Hence, the field requires more effort in solving new problems and proposing novel approaches and architectures. We claim that one of the promising and constructive efforts would be to design transparent and accountable artificial intelligence (AI) systems for text analytics. By doing so, we can enhance the applicability and problem-solving capacity of the system for real-world decision support. It is widely accepted that deep learning models demonstrate remarkable performances compared to existing algorithms. However, they are often criticized for being less interpretable, i.e., the “black box.” In such cases, users tend to hesitate to utilize them for decision-making, especially in crucial tasks. Such complexity obstructs transparency and accountability of the overall system, potentially debilitating the deployment of decision support systems powered by AI. Furthermore, recent regulations are emphasizing fairness and transparency in algorithms to a greater extent, turning explanations more compulsory than voluntary. Thus, to enhance the transparency and accountability of the decision support system and preserve the capacity to model complex text data at the same time, we propose the Explaining and Visualizing Convolutional neural networks for Text information (EVCT) framework. By adopting and ameliorating cutting-edge methods in NLP and image processing, the EVCT framework provides a human-interpretable solution to the problem of text classification while minimizing information loss. Experimental results with large-scale, real-world datasets show that EVCT performs comparably to benchmark models, including widely used deep learning models. In addition, we provide instances of human-interpretable and relevant visualized explanations obtained from applying EVCT to the dataset and possible applications for real-world decision support.
Training the quantum approximate optimization algorithm without access to a quantum processing unit

In this paper, we eliminate the classical outer learning loop of the quantum approximate optimization algorithm (QAOA) and present a strategy to find good parameters for QAOA based on topological arguments of the problem graph and tensor network techniques. Starting from the observation of the concentration of control parameters of QAOA, we find a way to classically infer parameters which scales polynomially in the number of qubits and exponentially with the depth of the circuit. Using this strategy, the quantum processing unit (QPU) is only needed to sample from the final state of QAOA. This method paves the way for a variation-free version of QAOA and makes QAOA more practical for applications on NISQ devices. We investigate the performance of the proposed approach for the initial assumptions and its resilience with respect to situations where they are not fulfilled. Moreover, we investigate the applicability of our method beyond the scope of QAOA, in improving schedules for quantum annealing.
Deep Learning Approach for Suspicious Activity Detection from Surveillance Video

Video Surveillance plays a pivotal role in today's world. The technologies have been advanced too much when artificial intelligence, machine learning and deep learning pitched into the system. Using above combinations, different systems are in place which helps to differentiate various suspicious behaviors from the live tracking of footages. The most unpredictable one is human behaviour and it is very difficult to find whether it is suspicious or normal. Deep learning approach is used to detect suspicious or normal activity in an academic environment, and which sends an alert message to the corresponding authority, in case of predicting a suspicious activity. Monitoring is often performed through consecutive frames which are extracted from the video. The entire framework is divided into two parts. In the first part, the features are computed from video frames and in second part, based on the obtained features classifier predict the class as suspicious or normal.
Can far memory improve job throughput?

As memory requirements grow, and advances in memory technology slow, the availability of sufficient main memory is increasingly the bottleneck in large compute clusters. One solution to this is memory disaggregation, where jobs can remotely access memory on other servers, or far memory. This paper first presents faster swapping mechanisms and a far memory-aware cluster scheduler that make it possible to support far memory at rack scale. Then, it examines the conditions under which this use of far memory can increase job throughput. We find that while far memory is not a panacea, for memory-intensive workloads it can provide performance improvements on the order of 10% or more even without changing the total amount of memory available.
Deep Face Representations for Differential Morphing Attack Detection

The vulnerability of facial recognition systems to face morphing attacks is well known. Many different approaches for morphing attack detection (MAD) have been proposed in the scientific literature. However, the MAD algorithms proposed so far have mostly been trained and tested on datasets whose distributions of image characteristics are either very limited (e.g., only created with a single morphing tool) or rather unrealistic (e.g., no print-scan transformation). As a consequence, these methods easily overfit on certain image types and the results presented cannot be expected to apply to real-world scenarios. For example, the results of the latest NIST FRVT MORPH show that the majority of submitted MAD algorithms lacks robustness and performance when considering unseen and challenging datasets. In this work, subsets of the FERET and FRGCv2 face databases are used to create a realistic database for training and testing of MAD algorithms, containing a large number of ICAO-compliant bona fide facial images, corresponding unconstrained probe images, and morphed images created with four different face morphing tools. Furthermore, multiple post-processings are applied on the reference images, e.g., print-scan and JPEG2000 compression. On this database, previously proposed differential morphing algorithms are evaluated and compared. In addition, the application of deep face representations for differential MAD algorithms is investigated. It is shown that algorithms based on deep face representations can achieve very high detection performance (less than 3% D-EER) and robustness with respect to various post-processings. Finally, the limitations of the developed methods are analyzed.