OpenRaiser/Intern-Atlas huggingface dataset:
Prompt-Guided Retrieval Augmentation for Non-Knowledge-Intensive Tasks
Venue: arXiv cs.CL 2023
Year: 2023

Retrieval-augmented methods have received increasing attention to support downstream tasks by leveraging useful information from external resources. Recent studies mainly focus on exploring retrieval to solve knowledge-intensive (KI) tasks. However, the potential of retrieval for most non-knowledge-intensive (NKI) tasks remains under-explored. There are two main challenges to leveraging retrieval-augmented methods for NKI tasks: 1) the demand for diverse relevance score functions and 2) the dilemma between training cost and task performance. To address these challenges, we propose a two-stage framework for NKI tasks, named PGRA. In the first stage, we adopt a task-agnostic retriever to build a shared static index and select candidate evidence efficiently. In the second stage, we design a prompt-guided reranker to rerank the nearest evidence according to task-specific relevance for the reader. Experimental results show that PGRA outperforms other state-of-the-art retrieval-augmented methods. Our analyses further investigate the influence factors to model performance and demonstrate the generality of PGRA. Codes are available at https://github.com/THUNLP-MT/PGRA.
MixDehazeNet : Mix Structure Block For Image Dehazing Network
Venue: arXiv cs.CV 2023
Year: 2023

Image dehazing is a typical task in the low-level vision field. Previous studies verified the effectiveness of the large convolutional kernel and attention mechanism in dehazing. However, there are two drawbacks: the multi-scale properties of an image are readily ignored when a large convolutional kernel is introduced, and the standard series connection of an attention module does not sufficiently consider an uneven hazy distribution. In this paper, we propose a novel framework named Mix Structure Image Dehazing Network (MixDehazeNet), which solves two issues mentioned above. Specifically, it mainly consists of two parts: the multi-scale parallel large convolution kernel module and the enhanced parallel attention module. Compared with a single large kernel, parallel large kernels with multi-scale are more capable of taking partial texture into account during the dehazing phase. In addition, an enhanced parallel attention module is developed, in which parallel connections of attention perform better at dehazing uneven hazy distribution. Extensive experiments on three benchmarks demonstrate the effectiveness of our proposed methods. For example, compared with the previous state-of-the-art methods, MixDehazeNet achieves a significant improvement (42.62dB PSNR) on the SOTS indoor dataset. The code is released in https://github.com/AmeryXiong/MixDehazeNet.
A Hierarchical and Location-aware Consensus Protocol for IoT-Blockchain Applications
Venue: arXiv cs.CR 2023
Year: 2023

Blockchain-based IoT systems can manage IoT devices and achieve a high level of data integrity, security, and provenance. However, incorporating existing consensus protocols in many IoT systems limits scalability and leads to high computational cost and consensus latency. In addition, location-centric characteristics of many IoT applications paired with limited storage and computing power of IoT devices bring about more limitations, primarily due to the location-agnostic designs in blockchains. We propose a hierarchical and location-aware consensus protocol (LH-Raft) for IoT-blockchain applications inspired by the original Raft protocol to address these limitations. The proposed LH-Raft protocol forms local consensus candidate groups based on nodes' reputation and distance to elect the leaders in each sub-layer blockchain. It utilizes a threshold signature scheme to reach global consensus and the local and global log replication to maintain consistency for blockchain transactions. To evaluate the performance of LH-Raft, we first conduct an extensive numerical analysis based on the proposed reputation mechanism and the candidate group formation model. We then compare the performance of LH-Raft against the classical Raft protocol from both theoretical and experimental perspectives. We evaluate the proposed threshold signature scheme using Hyperledger Ursa cryptography library to measure various consensus nodes' signing and verification time. Experimental results show that the proposed LH-Raft protocol is scalable for large IoT applications and significantly reduces the communication cost, consensus latency, and agreement time for consensus processing.
Parallel Data Helps Neural Entity Coreference Resolution
Venue: arXiv cs.CL 2023
Year: 2023

Coreference resolution is the task of finding expressions that refer to the same entity in a text. Coreference models are generally trained on monolingual annotated data but annotating coreference is expensive and challenging. Hardmeier et al.(2013) have shown that parallel data contains latent anaphoric knowledge, but it has not been explored in end-to-end neural models yet. In this paper, we propose a simple yet effective model to exploit coreference knowledge from parallel data. In addition to the conventional modules learning coreference from annotations, we introduce an unsupervised module to capture cross-lingual coreference knowledge. Our proposed cross-lingual model achieves consistent improvements, up to 1.74 percentage points, on the OntoNotes 5.0 English dataset using 9 different synthetic parallel datasets. These experimental results confirm that parallel data can provide additional coreference knowledge which is beneficial to coreference resolution tasks.
SAP HANA Data Volume Management
Venue: arXiv cs.DB 2023
Year: 2023

Today information technology is a data-driven environment. The role of data is to empower business leaders to make decisions based on facts, trends, and statistical numbers. SAP is no exception. In modern days many companies use business suites like SAP on HANA S/4 or ERP or SAP Business Warehouse and other non-SAP applications and run those on HANA databases for faster processing. While HANA is an extremely powerful in-memory database, growing business data has an impact on the overall performance and budget of the organization. This paper presents best practices to reduce the overall data footprint of HANA databases for three use cases like SAP Business Suite on HANA, SAP Business Warehouse, and Native HANA database.
Investigating HMIs to Foster Communications between Conventional Vehicles and Autonomous Vehicles in Intersections
Venue: arXiv cs.HC 2023
Year: 2023

In mixed traffic environments that involve conventional vehicles (CVs) and autonomous vehicles (AVs), it is crucial for CV drivers to maintain an appropriate level of situation awareness to ensure safe and efficient interactions with AVs. This study investigates how AV communication through human-machine interfaces (HMIs) affects CV drivers' situation awareness (SA) in mixed traffic environments, especially at intersections. Initially, we designed eight HMI concepts through a human-centered design process. The two highest-rated concepts were selected for implementation as external and internal HMIs (eHMIs and iHMIs). Subsequently, we designed a within-subjects experiment with three conditions, a control condition without any communication HMI, and two treatment conditions utilizing eHMIs and iHMIs as communication means. We investigated the effects of these conditions on 50 participants acting as CV drivers in a virtual environment (VR) driving simulator. Self-reported assessments and eye-tracking measures were employed to evaluate participants' situation awareness, trust, acceptance, and mental workload. Results indicated that the iHMI condition resulted in superior SA among participants and improved trust in AV compared to the control and eHMI conditions. Additionally, iHMI led to a comparatively lower increase in mental workload compared to the other two conditions. Our study contributes to the development of effective AV-CV communications and has the potential to inform the design of future AV systems.
Transfer Learning for Power Outage Detection Task with Limited Training Data
Venue: arXiv cs.CL 2023
Year: 2023

Early detection of power outages is crucial for maintaining a reliable power distribution system. This research investigates the use of transfer learning and language models in detecting outages with limited labeled data. By leveraging pretraining and transfer learning, models can generalize to unseen classes. Using a curated balanced dataset of social media tweets related to power outages, we conducted experiments using zero-shot and few-shot learning. Our hypothesis is that Language Models pretrained with limited data could achieve high performance in outage detection tasks over baseline models. Results show that while classical models outperform zero-shot Language Models, few-shot fine-tuning significantly improves their performance. For example, with 10% fine-tuning, BERT achieves 81.3% accuracy (+15.3%), and GPT achieves 74.5% accuracy (+8.5%). This has practical implications for analyzing and localizing outages in scenarios with limited data availability. Our evaluation provides insights into the potential of few-shot fine-tuning with Language Models for power outage detection, highlighting their strengths and limitations. This research contributes to the knowledge base of leveraging advanced natural language processing techniques for managing critical infrastructure.
A Unified Model for Real-Time Systems: Symbolic Techniques and Implementation
Venue: arXiv cs.FL 2023
Year: 2023

In this paper, we consider a model of generalized timed automata (GTA) with two kinds of clocks, history and future, that can express many timed features succinctly, including timed automata, event-clock automata with and without diagonal constraints, and automata with timers. Our main contribution is a new simulation-based zone algorithm for checking reachability in this unified model. While such algorithms are known to exist for timed automata, and have recently been shown for event-clock automata without diagonal constraints, this is the first result that can handle event-clock automata with diagonal constraints and automata with timers. We also provide a prototype implementation for our model and show experimental results on several benchmarks. To the best of our knowledge, this is the first effective implementation not just for our unified model, but even just for automata with timers or for event-clock automata (with predicting clocks) without going through a costly translation via timed automata. Last but not least, beyond being interesting in their own right, generalized timed automata can be used for model-checking event-clock specifications over timed automata models.
Generating Visual Information for Motion Sickness Reduction Using a Computational Model Based on SVC Theory
Venue: arXiv cs.HC 2023
Year: 2023

With the advancements in automated driving, there is concern that motion sickness will increase as non-driving-related tasks increase. Therefore, techniques to reduce motion sickness have drawn much attention. Research studies have attempted to estimate motion sickness using computational models for controlling it. Among them, a computational model for estimating motion sickness incidence (MSI) with visual information as input based on subjective vertical conflict theories was developed. In addition, some studies attempt to mitigate motion sickness by controlling visual information. In particular, it has been confirmed that motion sickness is suppressed by matching head movement and visual information. However, there has been no research on optimal visual information control that suppresses motion sickness in vehicles by utilizing mathematical models. We, therefore, propose a method for generating optimal visual information to suppress motion sickness caused from vehicle motion by utilizing a motion sickness model with vestibular and visual inputs. To confirm the effectiveness of the proposed method, we investigated changes in the motion sickness experienced by the participants according to the visual information displayed on the head-mounted display. The experimental results suggested that the proposed method mitigates the motion sickness of the participants.
SPAC-Net: Synthetic Pose-aware Animal ControlNet for Enhanced Pose Estimation
Venue: arXiv cs.CV 2023
Year: 2023

Animal pose estimation has become a crucial area of research, but the scarcity of annotated data is a significant challenge in developing accurate models. Synthetic data has emerged as a promising alternative, but it frequently exhibits domain discrepancies with real data. Style transfer algorithms have been proposed to address this issue, but they suffer from insufficient spatial correspondence, leading to the loss of label information. In this work, we present a new approach called Synthetic Pose-aware Animal ControlNet (SPAC-Net), which incorporates ControlNet into the previously proposed Prior-Aware Synthetic animal data generation (PASyn) pipeline. We leverage the plausible pose data generated by the Variational Auto-Encoder (VAE)-based data generation pipeline as input for the ControlNet Holistically-nested Edge Detection (HED) boundary task model to generate synthetic data with pose labels that are closer to real data, making it possible to train a high-precision pose estimation network without the need for real data. In addition, we propose the Bi-ControlNet structure to separately detect the HED boundary of animals and backgrounds, improving the precision and stability of the generated data. Using the SPAC-Net pipeline, we generate synthetic zebra and rhino images and test them on the AP10K real dataset, demonstrating superior performance compared to using only real images or synthetic data generated by other methods. Our work demonstrates the potential for synthetic data to overcome the challenge of limited annotated data in animal pose estimation.
Vec2Gloss: definition modeling leveraging contextualized vectors with Wordnet gloss
Venue: arXiv cs.CL 2023
Year: 2023

Contextualized embeddings are proven to be powerful tools in multiple NLP tasks. Nonetheless, challenges regarding their interpretability and capability to represent lexical semantics still remain. In this paper, we propose that the task of definition modeling, which aims to generate the human-readable definition of the word, provides a route to evaluate or understand the high dimensional semantic vectors. We propose a `Vec2Gloss' model, which produces the gloss from the target word's contextualized embeddings. The generated glosses of this study are made possible by the systematic gloss patterns provided by Chinese Wordnet. We devise two dependency indices to measure the semantic and contextual dependency, which are used to analyze the generated texts in gloss and token levels. Our results indicate that the proposed `Vec2Gloss' model opens a new perspective to the lexical-semantic applications of contextualized embeddings.
LLM-QAT: Data-Free Quantization Aware Training for Large Language Models
Venue: arXiv cs.CL 2023
Year: 2023

Several post-training quantization methods have been applied to large language models (LLMs), and have been shown to perform well down to 8-bits. We find that these methods break down at lower bit precision, and investigate quantization aware training for LLMs (LLM-QAT) to push quantization levels even further. We propose a data-free distillation method that leverages generations produced by the pre-trained model, which better preserves the original output distribution and allows quantizing any generative model independent of its training data, similar to post-training quantization methods. In addition to quantizing weights and activations, we also quantize the KV cache, which is critical for increasing throughput and support long sequence dependencies at current model sizes. We experiment with LLaMA models of sizes 7B, 13B, and 30B, at quantization levels down to 4-bits. We observe large improvements over training-free methods, especially in the low-bit settings.
Computation Offloading for Edge Computing in RIS-Assisted Symbiotic Radio Systems
Venue: arXiv cs.IT 2023
Year: 2023

In the paper, we investigate the coordination process of sensing and computation offloading in a reconfigurable intelligent surface (RIS)-aided base station (BS)-centric symbiotic radio (SR) systems. Specifically, the Internet-of-Things (IoT) devices first sense data from environment and then tackle the data locally or offload the data to BS for remote computing, while RISs are leveraged to enhance the quality of blocked channels and also act as IoT devices to transmit its sensed data. To explore the mechanism of cooperative sensing and computation offloading in this system, we aim at maximizing the total completed sensed bits of all users and RISs by jointly optimizing the time allocation parameter, the passive beamforming at each RIS, the transmit beamforming at BS, and the energy partition parameters for all users subject to the size of sensed data, energy supply and given time cycle. The formulated nonconvex problem is tightly coupled by the time allocation parameter and involves the mathematical expectations, which cannot be solved straightly. We use Monte Carlo and fractional programming methods to transform the nonconvex objective function and then propose an alternating optimization-based algorithm to find an approximate solution with guaranteed convergence. Numerical results show that the RIS-aided SR system outperforms other benchmarks in sensing. Furthermore, with the aid of RIS, the channel and system performance can be significantly improved.
Fourier Analysis on Robustness of Graph Convolutional Neural Networks for Skeleton-based Action Recognition
Venue: arXiv cs.CV 2023
Year: 2023

Using Fourier analysis, we explore the robustness and vulnerability of graph convolutional neural networks (GCNs) for skeleton-based action recognition. We adopt a joint Fourier transform (JFT), a combination of the graph Fourier transform (GFT) and the discrete Fourier transform (DFT), to examine the robustness of adversarially-trained GCNs against adversarial attacks and common corruptions. Experimental results with the NTU RGB+D dataset reveal that adversarial training does not introduce a robustness trade-off between adversarial attacks and low-frequency perturbations, which typically occurs during image classification based on convolutional neural networks. This finding indicates that adversarial training is a practical approach to enhancing robustness against adversarial attacks and common corruptions in skeleton-based action recognition. Furthermore, we find that the Fourier approach cannot explain vulnerability against skeletal part occlusion corruption, which highlights its limitations. These findings extend our understanding of the robustness of GCNs, potentially guiding the development of more robust learning methods for skeleton-based action recognition.
Safety of autonomous vehicles: A survey on Model-based vs. AI-based approaches
Venue: arXiv cs.RO 2023
Year: 2023

The growing advancements in Autonomous Vehicles (AVs) have emphasized the critical need to prioritize the absolute safety of AV maneuvers, especially in dynamic and unpredictable environments or situations. This objective becomes even more challenging due to the uniqueness of every traffic situation/condition. To cope with all these very constrained and complex configurations, AVs must have appropriate control architectures with reliable and real-time Risk Assessment and Management Strategies (RAMS). These targeted RAMS must lead to reduce drastically the navigation risks. However, the lack of safety guarantees proves, which is one of the key challenges to be addressed, limit drastically the ambition to introduce more broadly AVs on our roads and restrict the use of AVs to very limited use cases. Therefore, the focus and the ambition of this paper is to survey research on autonomous vehicles while focusing on the important topic of safety guarantee of AVs. For this purpose, it is proposed to review research on relevant methods and concepts defining an overall control architecture for AVs, with an emphasis on the safety assessment and decision-making systems composing these architectures. Moreover, it is intended through this reviewing process to highlight researches that use either model-based methods or AI-based approaches. This is performed while emphasizing the strengths and weaknesses of each methodology and investigating the research that proposes a comprehensive multi-modal design that combines model-based and AI approaches. This paper ends with discussions on the methods used to guarantee the safety of AVs namely: safety verification techniques and the standardization/generalization of safety frameworks.
Phase-coded Radar Waveform Design with Quantum Annealing
Venue: arXiv cs.ET 2023
Year: 2023

The Integrated Side Lobe Ratio (ISLR) problem we consider here consists in finding optimal sequences of phase shifts in order to minimize the mean squared cross-correlation side lobes of a transmitted radar signal and a mismatched replica. Currently, ISLR does not seem to be easier than the general polynomial unconstrained binary problem, which is NP-hard. In our work, we aim to take advantage of the exponential scalability of quantum computing to find new optima, by solving the ISLR problem on a quantum annealer. This quantum device is designed to solve quadratic optimization problems with binary variables (QUBO). After proposing suitable formulation for different instances of the ISLR, we discuss the performances and the scalability of our approach on the D-Wave quantum computer. More broadly, our work enlightens the limits and potential of the adiabatic quantum computation for the solving of large instances of combinatorial optimization problems.
Feedback-Based Channel Frequency Optimization in Superchannels
Venue: arXiv cs.NI 2023
Year: 2023

Superchannels leverage the flexibility of elastic optical networks and pave the way to higher capacity channels in space division multiplexing (SDM) networks. A superchannel consists of subchannels to which continuous spectral grid slots are assigned. To guarantee superchannel operation, we need to account for soft failures, e.g., laser drifts causing interference between subchannels, wavelength-dependent performance variations, and filter misalignments affecting the edge subchannels. This is achieved by reserving spectral guardband between subchannels or by employing a lower modulation format. We propose a process that dynamically retunes the subchannel transmitter (TX) lasers to compensate for soft failures during operation and optimizes the total capacity or the minimum subchannel quality of transmission (QoT) performance. We use an iterative stochastic subgradient method that at each iteration probes the network and leverages monitoring information, particularly subchannels signal-to-noise ratio (SNR) values, to optimize the TX frequencies. Our results indicate that our proposed method always approaches the optima found with an exhaustive search technique, unsuitable for operating networks, irrespective of the subchannel number, modulation format, roll-off factor, filters bandwidth, and starting frequencies. Considering a four-subchannel superchannel, the proposed method achieves 2.47 dB and 3.73 dB improvements for a typical soft failure of +/- 2 GHz subchannel frequency drifts around the optimum, for the two examined objectives.