OpenRaiser/Intern-Atlas huggingface dataset:
Prompt-Learning for Short Text Classification
Venue: arXiv cs.CL 2022
Year: 2022

In the short text, the extremely short length, feature sparsity, and high ambiguity pose huge challenges to classification tasks. Recently, as an effective method for tuning Pre-trained Language Models for specific downstream tasks, prompt-learning has attracted a vast amount of attention and research. The main intuition behind the prompt-learning is to insert the template into the input and convert the text classification tasks into equivalent cloze-style tasks. However, most prompt-learning methods expand label words manually or only consider the class name for knowledge incorporating in cloze-style prediction, which will inevitably incur omissions and bias in short text classification tasks. In this paper, we propose a simple short text classification approach that makes use of prompt-learning based on knowledgeable expansion. Taking the special characteristics of short text into consideration, the method can consider both the short text itself and class name during expanding label words space. Specifically, the top $N$ concepts related to the entity in the short text are retrieved from the open Knowledge Graph like Probase, and we further refine the expanded label words by the distance calculation between selected concepts and class labels. Experimental results show that our approach obtains obvious improvement compared with other fine-tuning, prompt-learning, and knowledgeable prompt-tuning methods, outperforming the state-of-the-art by up to 6 Accuracy points on three well-known datasets.
Localizing Small Apples in Complex Apple Orchard Environments
Venue: arXiv cs.CV 2022
Year: 2022

The localization of fruits is an essential first step in automated agricultural pipelines for yield estimation or fruit picking. One example of this is the localization of apples in images of entire apple trees. Since the apples are very small objects in such scenarios, we tackle this problem by adapting the object proposal generation system AttentionMask that focuses on small objects. We adapt AttentionMask by either adding a new module for very small apples or integrating it into a tiling framework. Both approaches clearly outperform standard object proposal generation systems on the MinneApple dataset covering complex apple orchard environments. Our evaluation further analyses the improvement w.r.t. the apple sizes and shows the different characteristics of our two approaches.
Skeleton Sequence and RGB Frame Based Multi-Modality Feature Fusion Network for Action Recognition
Venue: arXiv cs.CV 2022
Year: 2022

Action recognition has been a heated topic in computer vision for its wide application in vision systems. Previous approaches achieve improvement by fusing the modalities of the skeleton sequence and RGB video. However, such methods have a dilemma between the accuracy and efficiency for the high complexity of the RGB video network. To solve the problem, we propose a multi-modality feature fusion network to combine the modalities of the skeleton sequence and RGB frame instead of the RGB video, as the key information contained by the combination of skeleton sequence and RGB frame is close to that of the skeleton sequence and RGB video. In this way, the complementary information is retained while the complexity is reduced by a large margin. To better explore the correspondence of the two modalities, a two-stage fusion framework is introduced in the network. In the early fusion stage, we introduce a skeleton attention module that projects the skeleton sequence on the single RGB frame to help the RGB frame focus on the limb movement regions. In the late fusion stage, we propose a cross-attention module to fuse the skeleton feature and the RGB feature by exploiting the correlation. Experiments on two benchmarks NTU RGB+D and SYSU show that the proposed model achieves competitive performance compared with the state-of-the-art methods while reduces the complexity of the network.
A Differential Attention Fusion Model Based on Transformer for Time Series Forecasting
Venue: arXiv cs.LG 2022
Year: 2022

Time series forecasting is widely used in the fields of equipment life cycle forecasting, weather forecasting, traffic flow forecasting, and other fields. Recently, some scholars have tried to apply Transformer to time series forecasting because of its powerful parallel training ability. However, the existing Transformer methods do not pay enough attention to the small time segments that play a decisive role in prediction, making it insensitive to small changes that affect the trend of time series, and it is difficult to effectively learn continuous time-dependent features. To solve this problem, we propose a differential attention fusion model based on Transformer, which designs the differential layer, neighbor attention, sliding fusion mechanism, and residual layer on the basis of classical Transformer architecture. Specifically, the differences of adjacent time points are extracted and focused by difference and neighbor attention. The sliding fusion mechanism fuses various features of each time point so that the data can participate in encoding and decoding without losing important information. The residual layer including convolution and LSTM further learns the dependence between time points and enables our model to carry out deeper training. A large number of experiments on three datasets show that the prediction results produced by our method are favorably comparable to the state-of-the-art.
ScrawlD: A Dataset of Real World Ethereum Smart Contracts Labelled with Vulnerabilities
Venue: arXiv cs.CR 2022
Year: 2022

Smart contracts on Ethereum handle millions of U.S. Dollars and other financial assets. In the past, attackers have exploited smart contracts to steal these assets. The Ethereum community has developed plenty of tools to detect vulnerable smart contracts. However, there is no standardized data set to evaluate these existing tools, or any new tools developed. There is a need for an unbiased standard benchmark of real-world Ethereum smart contracts. We have created ScrawlD: an annotated data set of real-world smart contracts taken from the Ethereum network. The data set is labelled using 5 tools that detect various vulnerabilities in smart contracts, using majority voting.
Privacy issues on biometric systems
Venue: arXiv cs.CR 2022
Year: 2022

In the XXIth century there is a strong interest on privacy issues. Technology permits obtaining personal information without individuals consent, computers make it feasible to share and process this information, and this can bring about damaging implications. In some sense, biometric information is personal information, so it is important to be conscious about what is true and what is false when some people claim that biometrics is an attempt to individuals privacy. In this paper, key points related to this matter are dealt with.
DL-SLOT: Dynamic Lidar SLAM and Object Tracking Based On Graph Optimization
Venue: arXiv cs.RO 2022
Year: 2022

Ego-pose estimation and dynamic object tracking are two key issues in an autonomous driving system. Two assumptions are often made for them, i.e. the static world assumption of simultaneous localization and mapping (SLAM) and the exact ego-pose assumption of object tracking, respectively. However, these assumptions are difficult to hold in highly dynamic road scenarios where SLAM and object tracking become correlated and mutually beneficial. In this paper, DL-SLOT, a dynamic Lidar SLAM and object tracking method is proposed. This method integrates the state estimations of both the ego vehicle and the static and dynamic objects in the environment into a unified optimization framework, to realize SLAM and object tracking (SLOT) simultaneously. Firstly, we implement object detection to remove all the points that belong to potential dynamic objects. Then, LiDAR odometry is conducted using the filtered point cloud. At the same time, detected objects are associated with the history object trajectories based on the time-series information in a sliding window. The states of the static and dynamic objects and ego vehicle in the sliding window are integrated into a unified local optimization framework. We perform SLAM and object tracking simultaneously in this framework, which significantly improves the robustness and accuracy of SLAM in highly dynamic road scenarios and the accuracy of objects' states estimation. Experiments on public datasets have shown that our method achieves better accuracy than A-LOAM.
Biometric security technology
Venue: arXiv cs.CR 2022
Year: 2022

This paper presents an overview of the main topics related to biometric security technology, with the main purpose to provide a primer on this subject. Biometrics can offer greater security and convenience than traditional methods for people recognition. Even if we do not want to replace a classic method (password or handheld token) by a biometric one, for sure, we are potential users of these systems, which will even be mandatory for new passport models. For this reason, to be familiarized with the possibilities of biometric security technology is useful.
The Tiny-Tasks Granularity Trade-Off: Balancing overhead vs. performance in parallel systems
Venue: arXiv cs.DC 2022
Year: 2022

Models of parallel processing systems typically assume that one has $l$ workers and jobs are split into an equal number of $k=l$ tasks. Splitting jobs into $k > l$ smaller tasks, i.e. using ``tiny tasks'', can yield performance and stability improvements because it reduces the variance in the amount of work assigned to each worker, but as $k$ increases, the overhead involved in scheduling and managing the tasks begins to overtake the performance benefit. We perform extensive experiments on the effects of task granularity on an Apache Spark cluster, and based on these, developed a four-parameter model for task and job overhead that, in simulation, produces sojourn time distributions that match those of the real system. We also present analytical results which illustrate how using tiny tasks improves the stability region of split-merge systems, and analytical bounds on the sojourn and waiting time distributions of both split-merge and single-queue fork-join systems with tiny tasks. Finally we combine the overhead model with the analytical models to produce an analytical approximation to the sojourn and waiting time distributions of systems with tiny tasks which include overhead. Though no longer strict analytical bounds, these approximations matched the Spark experimental results very well in both the split-merge and fork-join cases.
AI-enabled mm-Waveform Configuration for Autonomous Vehicles with Integrated Communication and Sensing
Venue: arXiv cs.NI 2022
Year: 2022

Integrated Communications and Sensing (ICS) has recently emerged as an enabling technology for ubiquitous sensing and IoT applications. For ICS application to Autonomous Vehicles (AVs), optimizing the waveform structure is one of the most challenging tasks due to strong influences between sensing and data communication functions. Specifically, the preamble of a data communication frame is typically leveraged for the sensing function. As such, the higher number of preambles in a Coherent Processing Interval (CPI) is, the greater sensing task's performance is. In contrast, communication efficiency is inversely proportional to the number of preambles. Moreover, surrounding radio environments are usually dynamic with high uncertainties due to their high mobility, making the ICS's waveform optimization problem even more challenging. To that end, this paper develops a novel ICS framework established on the Markov decision process and recent advanced techniques in deep reinforcement learning. By doing so, without requiring complete knowledge of the surrounding environment in advance, the ICS-AV can adaptively optimize its waveform structure (i.e., number of frames in the CPI) to maximize sensing and data communication performance under the surrounding environment's dynamic and uncertainty. Extensive simulations show that our proposed approach can improve the joint communication and sensing performance up to 46.26% compared with other baseline methods.
A new LDA formulation with covariates
Venue: arXiv cs.IR 2022
Year: 2022

The Latent Dirichlet Allocation (LDA) model is a popular method for creating mixed-membership clusters. Despite having been originally developed for text analysis, LDA has been used for a wide range of other applications. We propose a new formulation for the LDA model which incorporates covariates. In this model, a negative binomial regression is embedded within LDA, enabling straight-forward interpretation of the regression coefficients and the analysis of the quantity of cluster-specific elements in each sampling units (instead of the analysis being focused on modeling the proportion of each cluster, as in Structural Topic Models). We use slice sampling within a Gibbs sampling algorithm to estimate model parameters. We rely on simulations to show how our algorithm is able to successfully retrieve the true parameter values and the ability to make predictions for the abundance matrix using the information given by the covariates. The model is illustrated using real data sets from three different areas: text-mining of Coronavirus articles, analysis of grocery shopping baskets, and ecology of tree species on Barro Colorado Island (Panama). This model allows the identification of mixed-membership clusters in discrete data and provides inference on the relationship between covariates and the abundance of these clusters.
GAMEOPT: Optimal Real-time Multi-Agent Planning and Control for Dynamic Intersections
Venue: arXiv cs.RO 2022
Year: 2022

We propose GameOpt: a novel hybrid approach to cooperative intersection control for dynamic, multi-lane, unsignalized intersections. Safely navigating these complex and accident prone intersections requires simultaneous trajectory planning and negotiation among drivers. GameOpt is a hybrid formulation that first uses an auction mechanism to generate a priority entrance sequence for every agent, followed by an optimization-based trajectory planner that computes velocity controls that satisfy the priority sequence. This coupling operates at real-time speeds of less than 10 milliseconds in high density traffic of more than 10,000 vehicles/hr, 100 times faster than other fully optimization-based methods, while providing guarantees in terms of fairness, safety, and efficiency. Tested on the SUMO simulator, our algorithm improves throughput by at least 25%, time taken to reach the goal by 75%, and fuel consumption by 33% compared to auction-based approaches and signaled approaches using traffic-lights and stop signs.
Exploring the effects of activity-preserving time dilation on the dynamic interplay of airborne contagion processes and temporal networks using an interaction-driven model
Venue: arXiv cs.SI 2022
Year: 2022

Contacts' temporal ordering and dynamics are crucial for understanding the transmission of infectious diseases. We introduce an interaction-driven model of an airborne disease over contact networks. We demonstrate our interaction-driven contagion model, instantiated for COVID-19, over history-maintaining random temporal networks and real-world contacts. We use it to evaluate temporal, spatiotemporal, and spatial social distancing policies. We find that a spatial distancing policy is mainly beneficial at the early stages of a disease. We then continue to evaluate temporal social distancing, that is, timeline dilation that maintains the activity potential. We expand our model to consider the exposure to viral load, which we correlate with meetings' duration. Using real-life contact data, we demonstrate the beneficial effect of timeline dilation on overall infection rates. Our results demonstrate that given the same transmission level, there is a decrease in the disease's infection rate and overall prevalence under timeline dilation conditions. We further show that slow-spreading pathogens (i.e., require more prolonged exposure to infect) spread roughly at the same rate as fast-spreading ones in highly active communities. This is surprising since slower pathogens follow paths that include longer meetings, while faster pathogens can potentially follow paths that include shorter meetings, which are more common. Our results demonstrate that the temporal dynamics of a community have a more significant effect on the spread of the disease than the characteristics of the spreading processes.
Awakening City: Traces of the Circadian Rhythm within the Mobile Phone Network Data
Venue: arXiv cs.SI 2022
Year: 2022

In this study, Call Detail Records (CDR), covering Budapest, Hungary has been processed to analyze the circadian rhythm of the subscribers. An indicator, called wake-up time, is introduced to describe a behavior of a group of subscribers. It is defined as the time, when the mobile phone activity of a group rises in the morning. Its counterpart is the time, when the activity falls in the evening. Inhabitant and area-based aggregation are also presented. The former is to consider the people who live in an area, the latter uses the transit activity in an area to describe the behavior of a part of the city. The opening hours of the malls and the nightlife of the party district was used to demonstrate this application, as real-life examples. The proposed approach was also used to estimate the working hours of the workplaces. The findings are in a good agreement with practice in Hungary, and also support the workplace detection method. Negative correlation was found between wake-up time and mobility indicators (Entropy, Radius of Gyration): On workdays, people wake up earlier and travel more, on holidays it is quite the contrary. The wake-up time was evaluated in different socioeconomic classes, using housing prices and mobile phones prices, as well. It was found that lower socioeconomic groups tend to wake up earlier.
An Analytical Model for SNR Prediction in Coherent Systems after generic Jones Matrices
Venue: arXiv cs.IT 2022
Year: 2022

In this letter, we propose the extension of a previously presented analytical model for the estimation of the signal-to-noise ratio (SNR) at the output of an adaptive equalizer in coherent optical transmission systems when transmission is modeled as a generic 2x2 matrix transfer functions, to be applied to polarization multiplexed communications based on advanced modulation formats (PM-QAM). We present the model and then we extensively test its accuracy on an possible application environment. Our findings show a remarkable agreement, with maximum SNR discrepancies of about 0.5 $dB$ between time-domain simulations and analytical results.
Signal reconstruction from noisy multichannel samples
Venue: arXiv cs.IT 2022
Year: 2022

We consider the signal reconstruction problem under the case of the signals sampled in the multichannel way and with the presence of noise. Observing that if the samples are inexact, the rigorous enforcement of multichannel interpolation is inappropriate. Thus the reasonable smoothing and regularized corrections are indispensable. In this paper, we propose several alternative methods for the signal reconstruction from the noisy multichannel samples under different smoothing and regularization principles. We compare these signal reconstruction methods theoretically and experimentally in the various situations. To demonstrate the effectiveness of the proposed methods, the probability interpretation and the error analysis for these methods are provided. Additionally, the numerical simulations as well as some guidelines to use the methods are also presented.
Exploiting Side Information for Improved Online Learning Algorithms in Wireless Networks
Venue: arXiv cs.IT 2022
Year: 2022

In wireless networks, the rate achieved depends on factors like level of interference, hardware impairments, and channel gain. Often, instantaneous values of some of these factors can be measured, and they provide useful information about the instantaneous rate achieved. For example, higher interference implies a lower rate. In this work, we treat any such measurable quality that has a non-zero correlation with the rate achieved as side-information and study how it can be exploited to quickly learn the channel that offers higher throughput (reward). When the mean value of the side-information is known, using control variate theory we develop algorithms that require fewer samples to learn the parameters and can improve the learning rate compared to cases where side-information is ignored. Specifically, we incorporate side-information in the classical Upper Confidence Bound (UCB) algorithm and quantify the gain achieved in the regret performance. We show that the gain is proportional to the amount of the correlation between the reward and associated side-information. We discuss in detail various side-information that can be exploited in cognitive radio and air-to-ground communication in $L-$band. We demonstrate that correlation between the reward and side-information is often strong in practice and exploiting it improves the throughput significantly.
From Unstructured Text to Causal Knowledge Graphs: A Transformer-Based Approach
Venue: arXiv cs.AI 2022
Year: 2022

Qualitative causal relationships compactly express the direction, dependency, temporal constraints, and monotonicity constraints of discrete or continuous interactions in the world. In everyday or academic language, we may express interactions between quantities (e.g., sleep decreases stress), between discrete events or entities (e.g., a protein inhibits another protein's transcription), or between intentional or functional factors (e.g., hospital patients pray to relieve their pain). Extracting and representing these diverse causal relations are critical for cognitive systems that operate in domains spanning from scientific discovery to social science. This paper presents a transformer-based NLP architecture that jointly extracts knowledge graphs including (1) variables or factors described in language, (2) qualitative causal relationships over these variables, (3) qualifiers and magnitudes that constrain these causal relationships, and (4) word senses to localize each extracted node within a large ontology. We do not claim that our transformer-based architecture is itself a cognitive system; however, we provide evidence of its accurate knowledge graph extraction in real-world domains and the practicality of its resulting knowledge graphs for cognitive systems that perform graph-based reasoning. We demonstrate this approach and include promising results in two use cases, processing textual inputs from academic publications, news articles, and social media.
Development and performance of a HemeLB GPU code for human-scale blood flow simulation
Venue: arXiv cs.DC 2022
Year: 2022

In recent years, it has become increasingly common for high performance computers (HPC) to possess some level of heterogeneous architecture - typically in the form of GPU accelerators. In some machines these are isolated within a dedicated partition, whilst in others they are integral to all compute nodes - often with multiple GPUs per node - and provide the majority of a machine's compute performance. In light of this trend, it is becoming essential that codes deployed on HPC are updated to execute on accelerator hardware. In this paper we introduce a GPU implementation of the 3D blood flow simulation code HemeLB that has been developed using CUDA C++. We demonstrate how taking advantage of NVIDIA GPU hardware can achieve significant performance improvements compared to the equivalent CPU only code on which it has been built whilst retaining the excellent strong scaling characteristics that have been repeatedly demonstrated by the CPU version. With HPC positioned on the brink of the exascale era, we use HemeLB as a motivation to provide a discussion on some of the challenges that many users will face when deploying their own applications on upcoming exascale machines.