OpenRaiser/Intern-Atlas huggingface dataset:
Recurrent Problems in the LOCAL model
Venue: arXiv cs.DC 2022
Year: 2022

The paper considers the SUPPORTED model of distributed computing introduced by Schmid and Suomela [HotSDN'13], generalizing the LOCAL and CONGEST models. In this framework, multiple instances of the same problem, differing from each other by the subnetwork to which they apply, recur over time, and need to be solved efficiently online. To do that, one may rely on an initial preprocessing phase for computing some useful information. This preprocessing phase makes it possible, in some cases, to overcome locality-based time lower bounds. A first contribution of the current paper is expanding the spectrum of problem types to which the SUPPORTED model applies. In addition to subnetwork-defined recurrent problems, we introduce also recurrent problems of two additional types: (i) instances defined by partial client sets, and (ii) instances defined by partially fixed outputs. Our second contribution is illustrating the versatility of the SUPPORTED framework by examining recurrent variants of three classical graph problems. The first problem is Minimum Client Dominating Set (CDS), a recurrent version of the classical dominating set problem with each recurrent instance requiring us to dominate a partial client set. We provide a constant time approximation scheme for CDS on trees and planar graphs. The second problem is Color Completion (CC), a recurrent version of the coloring problem in which each recurrent instance comes with a partially fixed coloring (of some of the vertices) that must be completed. We study the minimum number of new colors and the minimum total number of colors necessary for completing this task. The third problem we study is a recurrent version of Locally Checkable Labellings (LCL) on paths of length $n$. We show that such problems have complexities that are either $Θ(1)$ or $Θ(n)$, extending the results of Foerster et al. [INFOCOM'19].
A Fine-Grained Vehicle Detection (FGVD) Dataset for Unconstrained Roads
Venue: arXiv cs.CV 2022
Year: 2022

The previous fine-grained datasets mainly focus on classification and are often captured in a controlled setup, with the camera focusing on the objects. We introduce the first Fine-Grained Vehicle Detection (FGVD) dataset in the wild, captured from a moving camera mounted on a car. It contains 5502 scene images with 210 unique fine-grained labels of multiple vehicle types organized in a three-level hierarchy. While previous classification datasets also include makes for different kinds of cars, the FGVD dataset introduces new class labels for categorizing two-wheelers, autorickshaws, and trucks. The FGVD dataset is challenging as it has vehicles in complex traffic scenarios with intra-class and inter-class variations in types, scale, pose, occlusion, and lighting conditions. The current object detectors like yolov5 and faster RCNN perform poorly on our dataset due to a lack of hierarchical modeling. Along with providing baseline results for existing object detectors on FGVD Dataset, we also present the results of a combination of an existing detector and the recent Hierarchical Residual Network (HRN) classifier for the FGVD task. Finally, we show that FGVD vehicle images are the most challenging to classify among the fine-grained datasets.
X-MAS: Extremely Large-Scale Multi-Modal Sensor Dataset for Outdoor Surveillance in Real Environments
Venue: arXiv cs.RO 2022
Year: 2022

In robotics and computer vision communities, extensive studies have been widely conducted regarding surveillance tasks, including human detection, tracking, and motion recognition with a camera. Additionally, deep learning algorithms are widely utilized in the aforementioned tasks as in other computer vision tasks. Existing public datasets are insufficient to develop learning-based methods that handle various surveillance for outdoor and extreme situations such as harsh weather and low illuminance conditions. Therefore, we introduce a new large-scale outdoor surveillance dataset named eXtremely large-scale Multi-modAl Sensor dataset (X-MAS) containing more than 500,000 image pairs and the first-person view data annotated by well-trained annotators. Moreover, a single pair contains multi-modal data (e.g. an IR image, an RGB image, a thermal image, a depth image, and a LiDAR scan). This is the first large-scale first-person view outdoor multi-modal dataset focusing on surveillance tasks to the best of our knowledge. We present an overview of the proposed dataset with statistics and present methods of exploiting our dataset with deep learning-based algorithms. The latest information on the dataset and our study are available at https://github.com/lge-robot-navi, and the dataset will be available for download through a server.
RL and Fingerprinting to Select Moving Target Defense Mechanisms for Zero-day Attacks in IoT
Venue: arXiv cs.CR 2022
Year: 2022

Cybercriminals are moving towards zero-day attacks affecting resource-constrained devices such as single-board computers (SBC). Assuming that perfect security is unrealistic, Moving Target Defense (MTD) is a promising approach to mitigate attacks by dynamically altering target attack surfaces. Still, selecting suitable MTD techniques for zero-day attacks is an open challenge. Reinforcement Learning (RL) could be an effective approach to optimize the MTD selection through trial and error, but the literature fails when i) evaluating the performance of RL and MTD solutions in real-world scenarios, ii) studying whether behavioral fingerprinting is suitable for representing SBC's states, and iii) calculating the consumption of resources in SBC. To improve these limitations, the work at hand proposes an online RL-based framework to learn the correct MTD mechanisms mitigating heterogeneous zero-day attacks in SBC. The framework considers behavioral fingerprinting to represent SBCs' states and RL to learn MTD techniques that mitigate each malicious state. It has been deployed on a real IoT crowdsensing scenario with a Raspberry Pi acting as a spectrum sensor. More in detail, the Raspberry Pi has been infected with different samples of command and control malware, rootkits, and ransomware to later select between four existing MTD techniques. A set of experiments demonstrated the suitability of the framework to learn proper MTD techniques mitigating all attacks (except a harmfulness rootkit) while consuming <1 MB of storage and utilizing <55% CPU and <80% RAM.
Distant Reading of the German Coalition Deal: Recognizing Policy Positions with BERT-based Text Classification
Venue: arXiv cs.CL 2022
Year: 2022

Automated text analysis has become a widely used tool in political science. In this research, we use a BERT model trained on German party manifestos to identify the individual parties' contribution to the coalition agreement of 2021.
Domain-specific transfer learning in the automated scoring of tumor-stroma ratio from histopathological images of colorectal cancer
Venue: arXiv cs.CV 2022
Year: 2022

Tumor-stroma ratio (TSR) is a prognostic factor for many types of solid tumors. In this study, we propose a method for automated estimation of TSR from histopathological images of colorectal cancer. The method is based on convolutional neural networks which were trained to classify colorectal cancer tissue in hematoxylin-eosin stained samples into three classes: stroma, tumor and other. The models were trained using a data set that consists of 1343 whole slide images. Three different training setups were applied with a transfer learning approach using domain-specific data i.e. an external colorectal cancer histopathological data set. The three most accurate models were chosen as a classifier, TSR values were predicted and the results were compared to a visual TSR estimation made by a pathologist. The results suggest that classification accuracy does not improve when domain-specific data are used in the pre-training of the convolutional neural network models in the task at hand. Classification accuracy for stroma, tumor and other reached 96.1$\%$ on an independent test set. Among the three classes the best model gained the highest accuracy (99.3$\%$) for class tumor. When TSR was predicted with the best model, the correlation between the predicted values and values estimated by an experienced pathologist was 0.57. Further research is needed to study associations between computationally predicted TSR values and other clinicopathological factors of colorectal cancer and the overall survival of the patients.
Dynamic Switching of GOP configurations in High Efficiency Video Coding (HEVC) using Relational Databases for Multi-objective Optimization
Venue: arXiv cs.NI 2022
Year: 2022

Our current technological era is flooded with smart devices that provide significant computational resources that require optimal video communications solutions. Optimal and dynamic management of video bitrate, quality and energy demands needs to take into account their inter-dependencies. With emerging network generations providing higher bandwidth rates, there is also a growing need to communicate video with the best quality subject to the availability of resources such as computational power and available bandwidth. Similarly, for accommodating multiple users, there is a need to minimize bitrate requirements while sustaining video quality for reasonable encoding times. This thesis focuses on providing an efficient mechanism for deriving optimal solutions for HEVC codec based on switching GOP configurations. The approach provides a basic system for multi-objective optimization with constraints on power, video quality, bitrate. This is accomplished by utilizing a recently introduced framework known as Dynamically Reconfigurable Architectures for Time-varying Image Constraints (DRASTIC) in HEVC/H.265 codec with six different GOP configurations to support optimization modes for minimum bitrate, maximum quality and minimum computational time (minimum energy in constant power configuration) mode of operation. Pareto-Optimal GOP configs are used in implementing these DRASTIC modes.
A Learned Simulation Environment to Model Student Engagement and Retention in Automated Online Courses
Venue: arXiv cs.CY 2022
Year: 2022

We developed a simulator to quantify the effect of exercise ordering on both student engagement and retention. Our approach combines the construction of neural network representations for users and exercises using a dynamic matrix factorization method. We further created a machine learning models of success and dropout prediction. As a result, our system is able to predict student engagement and retention based on a given sequence of exercises selected. This opens the door to the development of versatile reinforcement learning agents which can substitute the role of private tutoring in exam preparation.
Managing Expert Disagreement for the Policy Process and Beyond
Venue: arXiv cs.CY 2022
Year: 2022

In this paper, we outline a new proposal for communicating scientific debate to policymakers and other stakeholders in circumstances where there is substantial disagreement within the scientific literature. In those circumstances, it seems important to provide policy makers both with a useful, balanced summary that is representative of opinion in the field large, and to transparently communicate the actual evidence-base. To this end, we propose the compilation of argument maps through a collective intelligence process; these maps are then given to a wide sample of the relevant research community for evaluation and summary opinion in an IGM style IGM style poll (see igmchicago.org), which provides a representative view of opinion on the issue at stake within the wider scientific community. Policymakers then receive these two artefacts (map and poll) as their expert advice. Such a process would help overcome the resource limitations of the traditional expert advice process, while also providing greater balance by drawing on the expertise of researchers beyond the leading proponents of particular theories within a field. And, the actual evidence base would be transparent. In this paper, we present a pilot project stepping through the map building component of such a policy advice scheme. We detail process, products, and issues encountered by implementing in the OVA (Online Visualisation of Argument tool, ova.arg-tech.org) an argument map with sample evidence from the behavioural literature on communicating probabilities, as a central issue within pandemic.
CIMS: Correction-Interpolation Method for Smoke Simulation
Venue: arXiv cs.GR 2022
Year: 2022

In this paper, we propose CIMS: a novel correction-interpolation method for smoke simulation. The basis of our method is to first generate a low frame rate smoke simulation, then increase the frame rate using temporal interpolation. However, low frame rate smoke simulations are inaccurate as they require increasing the time-step. A simulation with a larger time-step produces results different from that of the original simulation with a small time-step. Therefore, the proposed method corrects the large time-step simulation results closer to the corresponding small time-step simulation results using a U-Net-based DNN model. To obtain more precise results, we applied modeling concepts used in the image domain, such as optical flow and perceptual loss. By correcting the large time-step simulation results and interpolating between them, the proposed method can efficiently and accurately generate high frame rate smoke simulations. We conduct qualitative and quantitative analyses to confirm the effectiveness of the proposed model. Our analyses show that our method reduces the mean squared error of large time-step simulation results by more than 80% on average. Our method also produces results closer to the ground truth than the previous DNN-based methods; it is on average 2.04 times more accurate than previous works. In addition, the computation time of the proposed correction method barely affects the overall computation time.
Design and Optimisation of High-Speed Receivers for 6G Optical Wireless Networks
Venue: arXiv cs.IT 2022
Year: 2022

To achieve multi-Gb/s data rates in 6G optical wireless access networks based on narrow infrared (IR) laser beams, a high-speed receiver with two key specifications is needed: a sufficiently large aperture to collect the required optical power and a wide field of view (FOV) to avoid strict alignment issues. This paper puts forward the systematic design and optimisation of multi-tier non-imaging angle diversity receivers (ADRs) composed of compound parabolic concentrators (CPCs) coupled with photodiode (PD) arrays for laser-based optical wireless communication (OWC) links. Design tradeoffs include the gain-FOV tradeoff for each receiver element and the area-bandwidth tradeoff for each PD array. The rate maximisation is formulated as a non-convex optimisation problem under the constraints on the minimum required FOV and the overall ADR dimensions to find optimum configuration of the receiver bandwidth and FOV, and a low-complexity optimal solution is proposed. The ADR performance is studied using computer simulations and insightful design guidelines are provided through various numerical examples. An efficient technique is also proposed to reduce the ADR dimensions based on CPC length truncation. It is shown that a compact ADR with a height of $\leq0.5$ cm and an effective area of $\leq0.5$ cm$^2$ reaches a data rate of $12$ Gb/s with a half-angle FOV of $30^\circ$ over a $3$ m link distance.
NFTrig
Venue: arXiv cs.HC 2022
Year: 2022

NFTrig is a web-based application created for use as an educational tool to teach trigonometry and block chain technology. Creation of the application includes front and back end development as well as integration with other outside sources including MetaMask and OpenSea. The primary development languages include HTML, CSS (Bootstrap 5), and JavaScript as well as Solidity for smart contract creation. The application itself is hosted on Moralis utilizing their Web3 API. This technical report describes how the application was created, what the application requires, and smart contract design with security considerations in mind. The NFTrig application has underwent significant testing and validation prior to and after deployment. Future suggestions and recommendations for further development, maintenance, and use in other fields for education are also described.
Matrix Multiplication: Verifying Strong Uniquely Solvable Puzzles
Venue: arXiv cs.CC 2022
Year: 2022

Cohn and Umans proposed a framework for developing fast matrix multiplication algorithms based on the embedding computation in certain groups algebras. In subsequent work with Kleinberg and Szegedy, they connected this to the search for combinatorial objects called strong uniquely solvable puzzles (strong USPs). We begin a systematic computer-aided search for these objects. We develop and implement constraint-based algorithms build on reductions to $\mathrm{SAT}$ and $\mathrm{IP}$ to verify that puzzles are strong USPs, and to search for large strong USPs. We produce tight bounds on the maximum size of a strong USP for width $k \le 5$, construct puzzles of small width that are larger than previous work, and improve the upper bounds on strong USP size for $k \le 12$. Although our work only deals with puzzles of small-constant width, the strong USPs we find imply matrix multiplication algorithms that run in $O(n^ω)$ time with exponent $ω\le 2.66$. While our algorithms do not beat the fastest algorithms, our work provides evidence and, perhaps, a path to finding families of strong USPs that imply matrix multiplication algorithms that are more efficient than those currently known.
Guided Hybrid Quantization for Object detection in Multimodal Remote Sensing Imagery via One-to-one Self-teaching
Venue: arXiv cs.CV 2022
Year: 2022

Considering the computation complexity, we propose a Guided Hybrid Quantization with One-to-one Self-Teaching (GHOST}) framework. More concretely, we first design a structure called guided quantization self-distillation (GQSD), which is an innovative idea for realizing lightweight through the synergy of quantization and distillation. The training process of the quantization model is guided by its full-precision model, which is time-saving and cost-saving without preparing a huge pre-trained model in advance. Second, we put forward a hybrid quantization (HQ) module to obtain the optimal bit width automatically under a constrained condition where a threshold for distribution distance between the center and samples is applied in the weight value search space. Third, in order to improve information transformation, we propose a one-to-one self-teaching (OST) module to give the student network a ability of self-judgment. A switch control machine (SCM) builds a bridge between the student network and teacher network in the same location to help the teacher to reduce wrong guidance and impart vital knowledge to the student. This distillation method allows a model to learn from itself and gain substantial improvement without any additional supervision. Extensive experiments on a multimodal dataset (VEDAI) and single-modality datasets (DOTA, NWPU, and DIOR) show that object detection based on GHOST outperforms the existing detectors. The tiny parameters (<9.7 MB) and Bit-Operations (BOPs) (<2158 G) compared with any remote sensing-based, lightweight or distillation-based algorithms demonstrate the superiority in the lightweight design domain. Our code and model will be released at https://github.com/icey-zhang/GHOST.
Sample-Efficient Unsupervised Domain Adaptation of Speech Recognition Systems A case study for Modern Greek
Venue: arXiv cs.CL 2022
Year: 2022

Modern speech recognition systems exhibits rapid performance degradation under domain shift. This issue is especially prevalent in data-scarce settings, such as low-resource languages, where diversity of training data is limited. In this work we propose M2DS2, a simple and sample-efficient finetuning strategy for large pretrained speech models, based on mixed source and target domain self-supervision. We find that including source domain self-supervision stabilizes training and avoids mode collapse of the latent representations. For evaluation, we collect HParl, a $120$ hour speech corpus for Greek, consisting of plenary sessions in the Greek Parliament. We merge HParl with two popular Greek corpora to create GREC-MD, a test-bed for multi-domain evaluation of Greek ASR systems. In our experiments we find that, while other Unsupervised Domain Adaptation baselines fail in this resource-constrained environment, M2DS2 yields significant improvements for cross-domain adaptation, even when a only a few hours of in-domain audio are available. When we relax the problem in a weakly supervised setting, we find that independent adaptation for audio using M2DS2 and language using simple LM augmentation techniques is particularly effective, yielding word error rates comparable to the fully supervised baselines.
An end-to-end multi-scale network for action prediction in videos
Venue: arXiv cs.CV 2022
Year: 2022

In this paper, we develop an efficient multi-scale network to predict action classes in partial videos in an end-to-end manner. Unlike most existing methods with offline feature generation, our method directly takes frames as input and further models motion evolution on two different temporal scales.Therefore, we solve the complexity problems of the two stages of modeling and the problem of insufficient temporal and spatial information of a single scale. Our proposed End-to-End MultiScale Network (E2EMSNet) is composed of two scales which are named segment scale and observed global scale. The segment scale leverages temporal difference over consecutive frames for finer motion patterns by supplying 2D convolutions. For observed global scale, a Long Short-Term Memory (LSTM) is incorporated to capture motion features of observed frames. Our model provides a simple and efficient modeling framework with a small computational cost. Our E2EMSNet is evaluated on three challenging datasets: BIT, HMDB51, and UCF101. The extensive experiments demonstrate the effectiveness of our method for action prediction in videos.
Internet of Everything (IoE) -- From Molecules to the Universe
Venue: arXiv cs.NI 2022
Year: 2022

The universe is a vast heterogeneous network of interconnected entities that continuously generate and exchange information through various forms of interactions, some of which are yet to be discovered. Internet of Everything (IoE) framework, inspired by the ubiquitous and adaptive connectivity and the seamless interoperability within this universal network, puts forward a new road map beyond the conventional Internet of Things (IoT) towards maximizing the resolution of our interface with the universe to enable unprecedented applications. The first pillar of this road map is to reveal novel and tangible interconnections between seemingly noninteracting branches of IoT, which we call IoXs with X referring to their application domains, e.g., Internet of Energy (IoEn), Internet of Vehicles (IoV). The second pillar is to develop new IoXs that can complement the existing ones to complete the overall IoE picture and match its networking traits to that of the universe for a seamless and all-embracing cyber-physical interface. The objective of this paper is to evaluate the potential of this holistic IoE approach to expand the limited application landscape of the current IoT practice on a scale ranging $\textit{from molecules to the universe}$. To this end, we identify several potential interaction pathways among IoXs and introduce novel and emerging IoXs that are essential to the comprehensiveness of IoE. We also discuss the potential applications that can be enabled by such interconnections within the IoE framework and identify the associated challenges.