Reviewerly/exHarmony huggingface dataset:
Design and Implementation of Traffic Generation Model and Spectrum Requirement Calculator for Private 5G Network

This paper proposes a neural 5G traffic generation model and a methodology for calculating the spectrum requirements of private 5G networks to provide various industrial communication services. To accurately calculate the spectral requirements, it is necessary to analyze the actual data volume and traffic type of industrial cases. However, because there is currently no suitable traffic model to test loads in private 5G networks, we have developed a generative adversarial network (GAN)-based traffic generator that can generate realistic traffic by learning actual traffic traces collected by mobile network operators. In addition, in the case of industrial applications, probability-based traffic models were used in parallel as there were not enough real data to be learned. The proposed 5G traffic generation model is combined with the proposed 5G spectrum calculation methodology, enabling more accurate spectrum requirements calculation through traffic simulation similar to a real-life environment. In this paper, the spectrum requirements are calculated differently according to two types of duplexing, namely frequency division duplexing (FDD) and time division duplexing (TDD). As a guide for companies aiming to provide advanced wireless connectivity for a wide variety of vertical industries using 5G networks, eight use cases defined in the 5G Alliance for Connected Industries and Automation (ACIA) white paper were simulated. The spectrum requirements were calculated under various simulation conditions considering varying traffic loads, deployment scenarios, and duplexing types. Various simulation results confirmed that a bandwidth of at least 22.0 MHz to a maximum of 397.8 MHz is required depending on the deployment scenario.
ThreatSurf: A method for automated Threat Surface assessment in automotive cybersecurity engineering

Connected smart cars enable new attacks that may have serious consequences. Thus, the development of new cars must follow a cybersecurity engineering process including a Threat Analysis and Risk Assessment (TARA). The attack surface assessment is a central aspect of a TARA. In this paper, we introduce a concrete approach for attack surface assessment following the steps asset identification, threat scenario identification, attack path analysis, and attack feasibility rating of a TARA compliant to ISO/SAE DIS 21434 and an approach to automatize them. We define a generic reference architecture and assets constituting the attack surface, attack building blocks with associated feasibility rating, and a method for automated generation and rating of attack paths using the attack building blocks and attack feasibility. Our exemplary application of the automated attack surface assessment on several threats from the UN regulation no. 155 shows the feasibility of our approach.
Parallel training of knowledge graph embedding models

Knowledge graph embedding (KGE) models represent the entities and relations of a knowledge graph (KG) using dense continuous representations called embeddings. KGE methods have recently gained traction for tasks such as knowledge graph completion and reasoning as well as to provide suitable entity representations for downstream learning tasks. While a large part of the available literature focuses on small KGs, a number of frameworks that are able to train KGE models for large-scale KGs by parallelization across multiple GPUs or machines have recently been proposed. So far, the benefits and drawbacks of the various parallelization techniques have not been studied comprehensively. In this paper, we report on an experimental study in which we presented, re-implemented in a common computational framework, investigated, and improved the available techniques. We found that the evaluation methodologies used in prior work are often not comparable and can be misleading, and that most of currently implemented training methods tend to have a negative impact on embedding quality. We propose a simple but effective variation of the stratification technique used by PyTorch BigGraph for mitigation. Moreover, basic random partitioning can be an effective or even the best-performing choice when combined with suitable sampling techniques. Ultimately, we found that efficient and effective parallel training of large-scale KGE models is indeed achievable but requires a careful choice of techniques.
Dynamic multi-swarm differential learning harris hawks optimizer and its application to optimal dispatch problem of cascade hydropower stations

Harris hawks optimization (HHO) algorithm inspired by the cooperative behavior and chasing style of harris' hawks in nature called surprise pounce is a relatively novel swarm intelligent optimization algorithm. Due to its simplicity and efficiency, the canonical HHO has displayed promising performance on a large number of continuous optimization problems and real-world optimization problems. However, how to balance contradictions between the exploration and exploitation capabilities and alleviate the premature convergence are two critical concerns that need to be dealt with in the HHO study. To address these two drawbacks, improve the optimization performance, and broaden its application domain, a dynamic multi-swarm differential learning Harris hawks optimizer (DMSDL-HHO) is proposed in this paper. To efficiently maintain the population diversity, the whole population is divided into many small sub-swarms, which are regrouped periodically, and information is exchanged among the swarms. In each generation, the differential evolution operator (including mutation, crossover, and selection operators) based on the personal historical best position is merged into each sub-swarm to augment the exploration capability, while the Quasi-Newton method as a local searcher is used to enhance the exploitation capability. Besides, aiming to prevent the algorithm from falling into local optima to some extent, the differential mutation operator candidate pool strategy is introduced into the late stage of the search process. Thus, different individuals in the same population can conduct distinct search behaviors in each generation, and the same individual can perform various search behaviors in different generations. The proposed algorithm is tested on 23 classic test functions and 30 CEC2014 benchmark functions and is compared with quite a few state-of-the-art algorithms in terms of often-used performance metrics with the help of statistical analysis, diversity measurement, exploration–exploitation investigations, ranking statistics, and Wilcoxon Signed Rank Test (WSRT). The experimental results verify the superior performance of the embedded strategies on balancing the exploration capability and the exploitation capability. In addition, the DMSDL-HHO is applied to the optimal dispatch problem of cascade hydropower stations (ODPCHS) based on a novel constraints handling method designed in this paper to demonstrate its good practicability and performance. The experimental results of a case study on the optimal dispatch problem of China's Wujiang cascade hydropower stations show that DMSDL-HHO can obtain better and more reliable optimal results than the canonical HHO and other compared algorithms. Moreover, the convergence speed of DMSDL-HHO is also competitive in contrast to other algorithms. Therefore, it can be concluded that DMSDL-HHO is a promising alternative tool for solving complex continuous optimization problems and real-world optimization problems with complex constraints.
Accelerating Federated Learning With Cluster Construction and Hierarchical Aggregation

Federated learning (FL) has emerged in edge computing to address the limited bandwidth and privacy concerns of traditional cloud-based training. However, the existing FL mechanisms may lead to a long training time and consume massive communication resources. In this paper, we propose an efficient FL mechanism, namely FedCH, to accelerate FL in heterogeneous edge computing. Different from existing works which adopt the pre-defined system architecture and train models in a synchronous or asynchronous manner, FedCH will construct a special cluster topology and perform hierarchical aggregation for training. Specifically, FedCH arranges all clients into multiple clusters based on their heterogeneous training capacities. The clients in one cluster synchronously forward their local updates to the cluster header for aggregation, while all cluster headers take the asynchronous method for global aggregation. Our analysis shows that the convergence bound depends on the number of clusters and the training epochs. We propose efficient algorithms to determine the optimal number of clusters with resource budgets and then construct the cluster topology to address the client heterogeneity. Extensive experiments on both physical platform and simulated environment show that FedCH reduces the completion time by 49.5-79.5% and the network traffic by 57.4-80.8%, compared with the existing FL mechanisms.
Learning to Learn a Cold-start Sequential Recommender

The cold-start recommendation is an urgent problem in contemporary online applications. It aims to provide users whose behaviors are literally sparse with as accurate recommendations as possible. Many data-driven algorithms, such as the widely used matrix factorization, underperform because of data sparseness. This work adopts the idea of meta-learning to solve the user’s cold-start recommendation problem. We propose a meta-learning-based cold-start sequential recommendation framework called metaCSR, including three main components: Diffusion Representer for learning better user/item embedding through information diffusion on the interaction graph; Sequential Recommender for capturing temporal dependencies of behavior sequences; and Meta Learner for extracting and propagating transferable knowledge of prior users and learning a good initialization for new users. metaCSR holds the ability to learn the common patterns from regular users’ behaviors and optimize the initialization so that the model can quickly adapt to new users after one or a few gradient updates to achieve optimal performance. The extensive quantitative experiments on three widely used datasets show the remarkable performance of metaCSR in dealing with the user cold-start problem. Meanwhile, a series of qualitative analysis demonstrates that the proposed metaCSR has good generalization.
Sample complexity of learning parametric quantum circuits

Abstract Quantum computers hold unprecedented potentials for machine learning applications. Here, we prove that physical quantum circuits are probably approximately correct learnable on a quantum computer via empirical risk minimization: to learn a parametric quantum circuit with at most n c gates and each gate acting on a constant number of qubits, the sample complexity is bounded by <?CDATA $\tilde{O}({n}^{c+1})$?> <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" overflow="scroll"> <mml:mrow> <mml:mover accent="true"> <mml:mrow> <mml:mi>O</mml:mi> </mml:mrow> <mml:mo>~</mml:mo> </mml:mover> </mml:mrow> <mml:mrow> <mml:mo stretchy="false">(</mml:mo> <mml:mrow> <mml:msup> <mml:mrow> <mml:mi>n</mml:mi> </mml:mrow> <mml:mrow> <mml:mi>c</mml:mi> <mml:mo>+</mml:mo> <mml:mn>1</mml:mn> </mml:mrow> </mml:msup> </mml:mrow> <mml:mo stretchy="false">)</mml:mo> </mml:mrow> </mml:math> . In particular, we explicitly construct a family of variational quantum circuits with O ( n c +1 ) elementary gates arranged in a fixed pattern, which can represent all physical quantum circuits consisting of at most n c elementary gates. Our results provide a valuable guide for quantum machine learning in both theory and practice.
An empirical study on self-admitted technical debt in modern code review

Technical debt is a sub-optimal state of development in projects. In particular, the type of technical debt incurred by developers themselves (e.g., comments that mean the implementation is imperfect and should be replaced with another implementation) is called self-admitted technical debt (SATD). In theory, technical debt should not be left for a long period because it accumulates more cost over time, making it more difficult to process. Accordingly, developers have traditionally conducted code reviews to find technical debt. In fact, we observe that many SATD comments are often introduced during modern code reviews (MCR) that are light-weight reviews with web applications. However, it is uncertain about the nature of SATD comments that are introduced in the review process: impact, frequency, characteristics, and triggers. Herein, this study empirically examines the relationship between SATD and MCR.
Human In-Hand Motion Recognition Based on Multi-Modal Perception Information Fusion

A human in-hand motion (HIM) recognition system based on multi-modal perception information fusion is proposed in this paper, which can observe the state information between the object and the hand by using customized ten kinds of HIM manipulation in order to recognize the complex HIMs. First, combined with the characteristics of HIM capture, ten kinds of HIM sets are designed, and finger trajectory, contact force and electromyographic signal data are acquired synchronously through the multi-modal data acquisition platform; second, motion segmentation is realized through the threshold segmentation method, the multi-modal signal preprocessing is realized by Empirical Mode Decomposition (EMD), and multi-modal signal feature extraction is realized by Maximum Lyapunov Exponent (MLE); then, a detailed non-linear data analysis is carried out. A detailed analysis and discussion are presented from the results of the Random Forest (RF) recognizing HIMs, the comparison results of motion recognition rates of different subjects, the comparison results of motion recognition rates of different perceptrons, and the comparison results of the motion recognition rates of different machine learning methods. The experimental results show that the multi-modal perception information based HIM recognition system proposed in this paper can effectively recognize ten different HIMs, with an accuracy rate of 93.72%.
Improving Hybrid CTC/Attention End-to-End Speech Recognition with Pretrained Acoustic and Language Models

Recently, self-supervised pretraining has achieved impressive results in end-to-end (E2E) automatic speech recognition (ASR). However, the dominant sequence-to-sequence (S2S) E2E model is still hard to fully utilize the self-supervised pretraining methods because its decoder is conditioned on acoustic representation thus cannot be pretrained separately. In this paper, we propose a pretrained Transformer (Preformer) S2S ASR architecture based on hybrid CTC/attention E2E models to fully utilize the pretrained acoustic models (AMs) and language models (LMs). In our framework, the encoder is initialized with a pretrained AM (wav2vec2.0). The Preformer leverages CTC as an auxiliary task during training and inference. Furthermore, we design a one-cross decoder (OCD), which relaxes the dependence on acoustic representations so that it can be initialized with pretrained LM (DistilGPT2). Experiments are conducted on the AISHELL-1 corpus and achieve a 4.6% character error rate (CER) on the test set. Compared with our vanilla hybrid CTC/attention Transformer baseline, our proposed CTC/attention-based Preformer yields 27% relative CER reduction. To the best of our knowledge, this is the first work to utilize both pretrained AM and LM in a S2S ASR system.
An Apprenticeship Learning Approach for Adaptive Video Streaming Based on Chunk Quality and User Preference

Video traffic has experienced an exponential increase in current years due to the growing ubiquity of mobile equipment and the constant network improvement. Most commercial players employ adaptive bitrate (ABR) algorithms to dynamically choose bitrate for each chunk based on perceived network capacity and buffer occupancy. Unluckily, even though improving the quality of chunks with dynamic scenes can achieve more QoE gain than static scenes, current ABR algorithms usually strive to maximize the average bitrate instead of perceptual quality, leading to the QoE degradation. To overcome this obstacle, we introduce a dynamic-chunk quality-aware adaptive bitrate algorithm through apprenticeship learning called DAVS ( <underline xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">D</u> ynamic-chunk quality <underline xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">A</u> ware <underline xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">V</u> ideo <underline xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">S</u> treaming), where higher quality is selected for the dynamic chunks without reducing the quality of static chunks extravagantly. Furthermore, we take the user’s viewing preference into account to make DAVS adapt to the QoE diversity. The experimental results demonstrate that DAVS ameliorates the quality of dynamic chunks and significantly enhances the QoE compared with several representative ABR algorithms.
A Survey of Blockchain Data Management Systems

Blockchain has been widely deployed in various fields, such as finance, education, and public services. Blockchain has decentralized mechanisms with persistency and auditability and runs as an immutable distributed ledger, where transactions are jointly performed through cryptocurrency-based consensus algorithms by worldwide distributed nodes. There have been many survey papers reviewing the blockchain technologies from different perspectives, e.g., digital currencies, consensus algorithms, and smart contracts. However, none of them have focused on the blockchain data management systems. To fill in this gap, we have conducted a comprehensive survey on the data management systems, based on three typical types of blockchain, i.e., standard blockchain, hybrid blockchain, and DAG ( Directed Acyclic Graph )-based blockchain. We categorize their data management mechanisms into three layers: blockchain architecture, blockchain data structure, and blockchain storage engine, where block architecture indicates how to record transactions on a distributed ledger, blockchain data structure refers to the internal structure of each block, and blockchain storage engine specifies the storage form of data on the blockchain system. For each layer, the works advancing the state-of-the-art are discussed together with technical challenges. Furthermore, we lay out several possible future research directions for the blockchain data management systems.
Beyond Passwords—Challenges and Opportunities of Future Authentication

The usable security community seems ready for another attempt to move beyond passwords. We shed light on current scientific developments in implicit authentication—that is, authentication approaches in which physiological features and behavior authenticate users—and discuss opportunities and obstacles.
How Do Chinese People View Cyberbullying? A Text Analysis Based on Social Media

The rise of cyberbullying has been of great concern for the general public. This study aims to explore public attitudes towards cyberbullying on Chinese social media. Cognition and emotion are important components of attitude, and this study innovatively used text analysis to extract the cognition and emotion of the posts. We used a web crawler to collect 53,526 posts related to cyberbullying in Chinese on Sina Weibo in a month, where emotions were detected using the software "Text Mind", a Chinese linguistic psychological text analysis system, and the content analysis was performed using the Latent Dirichlet Allocation topic model. Sentiment analysis showed the frequency of negative emotion words was the highest in the posts; the frequency of anger, anxiety, and sadness words decreased in turn. The topic model analysis identified three common topics about cyberbullying: critiques on cyberbullying and support for its victims, rational expressions of anger and celebrity worship, and calls for further control. In summary, this study quantitatively reveals the negative attitudes of the Chinese public toward cyberbullying and conveys specific public concerns via three common topics. This will help us to better understand the demands of the Chinese public so that targeted support can be proposed to curb cyberbullying.
The impact of the physical and social embodiment of voice user interfaces on user distraction

The concept of calm technology envisions that interaction with technology should consume minimal resources and cause as few distractions as possible. The main goal of our study was to compare different forms of embodiment of Voice User Interfaces (VUI) in terms of how much they distract a user from a cognitive task. We used a voice-only system without physical embodiment (voice-only), a physical embodied system without anthropomorphic features (physical embodied), and a social embodied VUI with social cues such as eye movements (social embodied). In addition, we explored the relationship between design features of the VUI and perceived distraction, social presence, and perceived calm. Twenty-four participants carried out four different cognitive tasks with the three different VUI and one round of cognitive tasks without any VUI present. The cognitive tasks were chosen from a serious game (BrainTagger Suit) and included measurements of cognitive speed, working memory, visual memory, and process inhibition. Overall, results indicated the voice-only VUI caused the least distraction, especially for cognitive speed, while slightly showing impairment for visual memory. Social embodied VUI appeared to cause the most distraction across the four cognitive tasks with physical embodied VUI falling in between. Surprisingly, social presence was perceived as highest for the voice-only system which at the same time received the lowest scores for perceived calm. The advantages and disadvantages of each VUI are discussed.
A systematic study and framework of fringe projection profilometry with improved measurement performance for in-situ LPBF process monitoring

Fringe Projection Profilometry (FPP) is a cost-effective and non-invasive technology that has been shown to measure finer features. In this work, we developed an in-situ FPP method to measure the dynamic topography of powder bed and printed layer during Laser Powder Bed Fusion (LPBF) additive manufacturing (AM) process. A systematic study towards developing a comprehensive framework of LPBF-specific FPP is demonstrated to enhance and evaluate the performance of applying FPP for in-situ LPBF monitoring, including 1) a modified sensor model with localized correction; 2) improved phase unwrapping with FFT filtering 3) quantitative uncertainty analysis; and 4) experimental validation with ex-situ characterization. The developed LPBF-specific FPP system and methods are implemented on a commercial LPBF-AM machine, achieving better accuracy, more robustness, and increased field of view while maintaining sufficient measurement range and decent resolution, in contrast to literature methods. The established FPP framework will facilitate the development of closed-loop control strategies for advancing LPBF based AM.