Miracle-dz/UniFAR-FTUs huggingface dataset:
Lifelong Dynamic Optimization for Self-Adaptive Systems: Fact or Fiction?

When faced with changing environment, highly-configurable software systems need to dynamically search for promising adaptation plan that keeps the best possible performance, e.g., higher throughput or smaller latency — a typical planning problem for self-adaptive systems (SASs). However, given the rugged and complex search landscape with multiple local optima, such a SAS planning is challenging especially in dynamic environments. In this paper, we propose LiDOS, a lifelong dynamic optimization framework for SAS planning. What makes LiDOS unique is that to handle the “dynamic”, we formulate the SAS planning as a multi-modal optimization problem, aiming to preserve the useful information for better dealing with the local optima issue under dynamic environment changes. This differs from existing planners in that the “dynamic” is not explicitly handled during the search process in planning. As such, the search and planning in LiDOS run continuously over the lifetime of SAS, terminating only when it is taken offline or the search space has been covered under an environment. Experimental results on three real-world SASs show that the concept of explicitly handling dynamic as part of the search in the SAS planning is effective, as LiDOS outperforms its stationary counterpart overall with up to 10× improvement. It also achieves better results in general over state-of-the-art planners and with 1.4× to 10× speedup on generating promising adaptation plans.
Joint denoising and HDR for RAW video sequences

We propose a patch-based method for the simultaneous denoising and fusion of a sequence of RAW multi-exposed images. A spatio-temporal criterion is used to select similar patches along the sequence, and a weighted principal component analysis permits to both denoise and fuse the multi exposed data. The overall strategy permits to denoise and fuse the set of images without the need of recovering each denoised image in the multi-exposure set, leading to a very efficient procedure. Several experiments show that the proposed method permits to obtain state-of-the-art fusion results with real RAW data.
Human and Automatic Speech Recognition Performance on German Oral History Interviews

Automatic speech recognition systems have accomplished remarkable improvements in transcription accuracy in recent years. On some domains, models now achieve near-human performance. However, transcription performance on oral history has not yet reached human accuracy. In the present work, we investigate how large this gap between human and machine transcription still is. For this purpose, we analyze and compare transcriptions of three humans on a new oral history data set. We estimate a human word error rate of 8.7% for recent German oral history interviews with clean acoustic conditions. For comparison with recent machine transcription accuracy, we present experiments on the adaptation of an acoustic model achieving near-human performance on broadcast speech. We investigate the influence of different adaptation data on robustness and generalization for clean and noisy oral history interviews. We optimize our acoustic models by 5 to 8% relative for this task and achieve 23.9% WER on noisy and 15.6% word error rate on clean oral history interviews.
Studying Popular Open Source Machine Learning Libraries and Their Cross-Ecosystem Bindings

Open source machine learning (ML) libraries allow developers to integrate advanced ML functionality into their own applications. However, popular ML libraries, such as TensorFlow, are not available natively in all programming languages and software package ecosystems. Hence, developers who wish to use an ML library which is not available in their programming language or ecosystem of choice, may need to resort to using a so-called binding library. Binding libraries provide support across programming languages and package ecosystems for a source library. For example, the Keras . NET binding provides support for the Keras library in the NuGet (.NET) ecosystem even though the Keras library was written in Python. In this paper, we conduct an in-depth study of 155 cross-ecosystem bindings and their development for 36 popular open source ML libraries. Our study shows that for most popular ML libraries, only one package ecosystem is officially supported (usually PyPI). Cross-ecosystem support, which is available for 25% of the studied ML libraries, is usually provided through community-maintained bindings, e.g., 73% of the bindings in the npm ecosystem are community-maintained. Our study shows that the vast majority of the studied bindings cover only a small portion of the source library releases, and the delay for receiving support for a source library release is large.
Secure IoT Routing: Selective Forwarding Attacks and Trust-based Defenses in RPL Network

IPv6 Routing Protocol for Low Power and Lossy Networks (RPL) is an essential routing protocol to enable communications for IoT networks with low power devices. RPL uses an objective function and routing constraints to find an optimized routing path for each node in the network. However, recent research has shown that topological attacks, such as selective forwarding attacks, pose great challenges to the secure routing of IoT networks. Many conventional secure routing solutions, on the other hand, are computationally heavy to be directly applied in resource-constrained IoT networks. There is an urgent need to develop lightweight secure routing solutions for IoT networks. In this paper, we first design and implement a series of advanced selective forwarding attacks from the attack perspective, which can flexibly select the type and percentage of forwarding packets in an energy efficient way, and even bad-mouth other innocent nodes in the network. Experiment results show that the proposed attacks can maximize the attack consequences (i.e. number of dropped packets) while maintaining undetected. Moreover, we propose a lightweight trust-based defense solution to detect and eliminate malicious selective forwarding nodes from the network. The results show that the proposed defense solution can achieve high detection accuracy with very limited extra energy usage (i.e. 3.4%).
Dual Space Graph Contrastive Learning

Unsupervised graph representation learning has emerged as a powerful tool to address real-world problems and achieves huge success in the graph learning domain. Graph contrastive learning is one of the unsupervised graph representation learning methods, which recently attracts attention from researchers and has achieved state-of-the-art performances on various tasks. The key to the success of graph contrastive learning is to construct proper contrasting pairs to acquire the underlying structural semantics of the graph. However, this key part is not fully explored currently, most of the ways generating contrasting pairs focus on augmenting or perturbating graph structures to obtain different views of the input graph. But such strategies could degrade the performances via adding noise into the graph, which may narrow down the field of the applications of graph contrastive learning. In this paper, we propose a novel graph contrastive learning method, namely Dual Space Graph Contrastive (DSGC) Learning, to conduct graph contrastive learning among views generated in different spaces including the hyperbolic space and the Euclidean space. Since both spaces have their own advantages to represent graph data in the embedding spaces, we hope to utilize graph contrastive learning to bridge the spaces and leverage advantages from both sides. The comparison experiment results show that DSGC achieves competitive or better performances among all the datasets. In addition, we conduct extensive experiments to analyze the impact of different graph encoders on DSGC, giving insights about how to better leverage the advantages of contrastive learning between different spaces.
Online Learning for Failure-Aware Edge Backup of Service Function Chains With the Minimum Latency

Virtual network functions (VNFs) have been widely deployed in mobile edge computing (MEC) to flexibly and efficiently serve end users running resource-intensive applications, which can be further serialized to form service function chains (SFCs), providing customized networking services. To ensure the availability of SFCs, it turns out to be effective to place redundant SFC backups at the edge for quickly recovering from any failures. The existing research largely overlooks the influences of SFC popularity, backup completeness, and failure rate on the optimal deployment of SFC backups on edge servers. In this paper, we comprehensively consider from the perspectives of both the end users and edge system to backup SFCs for providing popular services with the lowest latency. To overcome the challenges resulted from unknown SFC popularity and failure rate, as well as the known system parameter constraints, we take advantage of the online bandit learning technique to cope with the uncertainty issue. Combining the Prim -inspired method with the greedy strategy, we propose a Real-Time Selection and Deployment (RTSD) algorithm. Extensive simulation experiments are conducted to demonstrate the superiority of our proposed algorithms.
Visualization and Analysis of Wearable Health Data From COVID-19 Patients

Effective visualizations were evaluated to reveal relevant health patterns from multi-sensor real-time wearable devices that recorded vital signs from patients admitted to hospital with COVID-19. Furthermore, specific challenges associated with wearable health data visualizations, such as fluctuating data quality resulting from compliance problems, time needed to charge the device and technical problems are described. As a primary use case, we examined the detection and communication of relevant health patterns visible in the vital signs acquired by the technology. Customized heat maps and bar charts were used to specifically highlight medically relevant patterns in vital signs. A survey of two medical doctors, one clinical project manager and seven health data science researchers was conducted to evaluate the visualization methods. From a dataset of 84 hospitalized COVID-19 patients, we extracted one typical COVID-19 patient history and based on the visualizations showcased the health history of two noteworthy patients. The visualizations were shown to be effective, simple and intuitive in deducing the health status of patients. For clinical staff who are time-constrained and responsible for numerous patients, such visualization methods can be an effective tool to enable continuous acquisition and monitoring of patients' health statuses even remotely.
Finding Shortest Path on a Terrain Surface by Using Finite Element Method

The solution of the shortest path problem on a surface is not only a theoretical problem to be solved in the field of mathematics, but also problems that need to be solved in very different fields such as medicine, defense and construction technologies. When it comes to the land specific, solution algorithms for these problems are also of great importance in terms of determination of the shortest path in an open area where the road will pass in the field of civil engineering, or route determination of manned or unmanned vehicles for various logistic needs, especially in raw terrains. In addition, path finding problems in the raw terrains are also important for manned and unmanned ground vehicles (UGV) used in the defense industry. Within the scope of this study, a method that can be used for instant route determinations within sight range or for route determinations covering wider areas is proposed. Although the examples presented within the scope of the study are land-based, the method can be applied to almost all problem types of similar nature. The approach used in the study can be briefly described as the mechanical analysis of a surface transformed into a structural load bearing system based on mechanical analogies. In this approach, the determination of the shortest path connecting two points can be realized by following the stress-strain values that will occur by moving the points away from each other or by following a linear line that will be formed between two points during the mechanical analysis. If the proposed approach is to be carried out with multiple rigid body dynamics approaches instead of flexible bodies mechanics, it can be carried out easily and very quickly by determining the shortest path between two points or by tracking the forces. However, the proposed approach in this study is presented by simulating examples of flexible bodies using FEM.
Bamboo Trimming Revisited: Simple Algorithms Can Do Well Too

The bamboo trimming problem considers n bamboo with growth rates h1, 2, . , satisfying Σihi = 1. During a given unit of time, each bamboo grows by hi , and then the bamboo-trimming algorithm gets to trim one of the bamboo back down to height zero. The goal is to minimize the height of the tallest bamboo, also known as the backlog. The bamboo trimming problem is closely related to many scheduling problems, and can be viewed as a variation of the widely-studied fixed-rate cup game, but with constant-factor resource augmentation. Past work has given sophisticated pinwheel algorithms that achieve the optimal backlog of 2 in the bamboo trimming problem. It remained an open question, however, whether there exists a simple algorithm with the same guarantee-recent work has devoted considerable theoretical and experimental effort to answering this question. Two algorithms, in particular, have appeared as natural candidates: the Reduce-Max algorithm (which always cuts the tallest bamboo) and the Reduce-Fastest(x) algorithm (which cuts the fastest-growing bamboo out of those that have at least some height x). It is conjectured that Reduce-Max and Reduce- Fastest(1) both achieve backlog 2. This paper improves the bounds for both Reduce-Fastest and Reduce-Max. Among other results, we show that the exact optimal backlog for Reduce-Fastest(x) is x + 1 for all x ≥ 2 (this proves a conjecture of D'Emidio, Di Stefano, and Navarra in the case of x = 2), and we show that Reduce-Fastest(1) does not achieve backlog 2 (this disproves a conjecture of D'Emidio, Di Stefano, and Navarra). Finally, we show that there is a different algorithm, which we call the Deadline-Driven Strategy, that is both very simple and achieves the optimal backlog of 2. This resolves the question as to whether there exists a simple worst-case optimal algorithm for the bamboo trimming problem.
Note: ReGNL: Rapid Prediction of GDP during Disruptive Events using Nightlights

Policymakers often make decisions based on GDP, unemployment rate, industrial output, etc. The primary methods to obtain or estimate such information are resource-intensive. In order to make timely and well-informed decisions, it is imperative to come up with proxies for these parameters, which can be sampled quickly and efficiently, especially during disruptive events like the COVID-19 pandemic. We explore the use of remotely sensed data for this task. The data has become cheaper to collect than surveys and can be available in real-time. In this work, we present Regional GDP-NightLight (ReGNL), a neural network trained to predict GDP given the nightlights data and geographical coordinates. Taking the case of 50 US states, we find that ReGNL is disruption-agnostic and can predict the GDP for both normal years (2019) and years with a disruptive event (2020). ReGNL outperforms time-series ARIMA methods for prediction, even during the pandemic.
Cosmic ray production in superbubbles

We compute the production of cosmic rays in the dynamical superbubble produced by a cluster of massive stars. Stellar winds, supernova remnants and turbulence are found to accelerate particles so efficiently that the nonlinear feedback of the particles must be taken into account in order to ensure that the energy balance is not violated. High energy particles do not scatter efficiently on the turbulence and escape quickly after each supernova explosion, which makes both their intensity inside the bubble and injection in the interstellar medium intermittent. On the other hand, the stochastic acceleration of low energy particles hardens the spectra at GeV energies. Because cosmic rays damp the turbulence cascade, this hardening is less pronounced when nonlinearities are taken into account. Nevertheless, spectra with hard components extending up to 1 to 10 GeV and normalised to an energy density of 1 to 100 eV cm−3 are found to be typical signatures of cosmic rays produced in superbubbles. Efficient shock reacceleration within compact clusters is further shown to produce hard, slightly concave spectra, while the presence of a magnetised shell is shown to enhance the confinement of cosmic rays in the bubble and therefore the collective plasma effects acting on them. We eventually estimate the overall contribution of superbubbles to the galactic cosmic ray content and show typical gamma-ray spectra expected from hadronic interactions in superbuble shells. In both cases, a qualitative agreement with observations is obtained.
A Survey on Code-Based Cryptography

The improvements on quantum technology are threatening our daily cybersecurity, as a capable quantum computer can break all currently employed asymmetric cryptosystems. In preparation for the quantum-era the National Institute of Standards and Technology (NIST) has initiated in 2016 a standardization process for public-key encryption (PKE) schemes, key-encapsulation mechanisms (KEM) and digital signature schemes. In 2023, NIST made an additional call for post-quantum signatures. With this chapter we aim at providing a survey on code-based cryptography, focusing on PKEs and signature schemes. We cover the main frameworks introduced in code-based cryptography and analyze their security assumptions. We provide the mathematical background in a lecture notes style, with the intention of reaching a wider audience.
11809 Body

Monte Piliawsky Wayne State University The purpose of this study was to examine factors related to the academic success of urban, African American youth. Participants were 118 African American male and female ninth graders from a large urban high school in the Midwest. A majority of students at the school receive free or reduced lunch. Factors studied were social support from five sources (parent, peer, teacher, classmate, close friend) and six educational attitudes and behaviors (educational intentions, educational behavior, personal control, persistence, and understanding of the personal and financial value of educational attainment). The major purpose of this study was to examine the role of these various sources of social support in the educational attitudes and behaviors and academic achievement of this sample of African American youth. Results indicated that social support was mildly correlated with better grades, with parent and peer support relatively the more important forms of support. Moderate and strong correlations were found between the five support variables and most of the educational attitudes and behaviors variables, with support from parents, teachers, and peers most strongly related. The combination of all predictors explained a large proportion of variance in achievement, with educational intentions and personal persistence the strongest contributors. Detailed results and implications of the results are discussed.
Comprehensive Efficiency Analysis of Machine Learning Algorithms for Developing Hardware-Based Cybersecurity Countermeasures

Comprehensive Efficiency Analysis of Machine Learning Algorithms for Developing Hardware-Based Cybersecurity Countermeasures By Darren Cobian Fall 2021 Modern computing systems have led cyber adversaries to create more sophisticated malware than was previously available in the early days of technology. Dated detection techniques such as Anti-Virus Software (AVS) based on signature-based methods could no longer keep up with the demand that computer systems required of them. The complexity of modern malware has led to the development of contemporary detection techniques that use the machine learning field and hardware to boost the detection rates of malicious software. These new techniques use Hardware Performance Counters (HPCs) that form a digital signature of sorts. After the models are fed training data, they can reference these HPCs to classify zero-day malware samples. A problem emerges when malware with no comparable HPC values comes into contact with these new techniques. We provide an analysis of several machine learning and deep learning models that run zero-day samples and evaluate the results from the conversion of C++ algorithms to a hardware description language (HDL) used to begin a hardware implementation. Our results present a lack of accuracy from the models when running zero-day malware data as our highest detector, decision tree, was only able to reach 91.2% accuracy and had an F1-Score of 91.5% in the form of a decision tree. Next, through the Receiver Operating Curve (ROC) and area-under-the-curve (AUC), we can also determine that the algorithms did not present significant robustness as the largest AUC was only 0.819. In addition, we viewed relatively high overhead for our ensemble learning algorithm while also only having an 86.3% accuracy and 86% F1-Score. Finally, as an additional task, we adapted the one rule algorithm to fit many rules to make malware classification understandable to everyday users by allowing them to view the regulations while maintaining relatively high accuracy.
Instance-Aware Prompt Learning for Language Understanding and Generation

Prompt learning has emerged as a new paradigm for leveraging pre-trained language models (PLMs) and has shown promising results in downstream tasks with only a slight increase in parameters. However, the current usage of fixed prompts, whether discrete or continuous, assumes that all samples within a task share the same prompt. This assumption may not hold for tasks with diverse samples that require different prompt information. To address this issue, we propose an instance-aware prompt learning method that learns a different prompt for each instance. Specifically, we suppose that each learnable prompt token has a different contribution to different instances, and we learn the contribution by calculating the relevance score between an instance and each prompt token. The contribution-weighted prompt would be instance aware. We apply our method to both unidirectional and bidirectional PLMs on both language understanding and generation tasks. Extensive experiments demonstrate that our method achieves comparable results using as few as 1.5% of the parameters of PLMs tuned and obtains considerable improvements compared with strong baselines. In particular, our method achieves state-of-the-art results using ALBERT-xxlarge-v2 on the SuperGLUE few-shot learning benchmark.1