OpenRaiser/Intern-Atlas huggingface dataset:
Explainable Signature-based Machine Learning Approach for Identification of Faults in Grid-Connected Photovoltaic Systems
Venue: arXiv cs.LG 2021
Year: 2021

The transformation of conventional power networks into smart grids with the heavy penetration level of renewable energy resources, particularly grid-connected Photovoltaic (PV) systems, has increased the need for efficient fault identification systems. Malfunctioning any single component in grid-connected PV systems may lead to grid instability and other serious consequences, showing that a reliable fault identification system is the utmost requirement for ensuring operational integrity. Therefore, this paper presents a novel fault identification approach based on statistical signatures of PV operational states. These signatures are unique because each fault has a different nature and distinctive impact on the electrical system. Thus, the Random Forest Classifier trained on these extracted signatures showed 100% accuracy in identifying all types of faults. Furthermore, the performance comparison of the proposed framework with other Machine Learning classifiers depicts its credibility. Moreover, to elevate user trust in the predicted outcomes, SHAP (Shapley Additive Explanation) was utilized during the training phase to extract a complete model response (global explanation). This extracted global explanation can help in the assessment of predicted outcomes credibility by decoding each prediction in terms of features contribution. Hence, the proposed explainable signature-based fault identification technique is highly credible and fulfills all the requirements of smart grids.
XLPN: Efficient and Scalable Cross-Ledger Protocols for the Topological Consortium of Permissioned Blockchains
Venue: arXiv cs.DB 2021
Year: 2021

While increasingly more application-specific blockchains, or ledgers, are being implemented and deployed, exchanging information between these ledgers remains an open problem. Existing cross-ledger protocols (XLPs) exhibit a variety of limitations such as scalability, liveness, efficiency, among others. This paper proposes a new XLP, namely XLPN-22, which introduces a global topology for the consortium of ledgers to achieve better efficiency and scalability of cross-ledger data exchanges. In this work, we prove the safety and liveness of XLPN-22 and analyze its theoretical complexity. We also implement XLPN-22 on SciChain ledgers and evaluate it on up to 128 nodes, 8 ledgers, and 16,000 transactions. Experimental results show that XLPN-22 outperforms two baseline protocols, namely VLDB-20 and PODC-18, by 18--50\% and 64--84\%, respectively.
QEMind: Alibaba's Submission to the WMT21 Quality Estimation Shared Task
Venue: arXiv cs.CL 2021
Year: 2021

Quality Estimation, as a crucial step of quality control for machine translation, has been explored for years. The goal is to investigate automatic methods for estimating the quality of machine translation results without reference translations. In this year's WMT QE shared task, we utilize the large-scale XLM-Roberta pre-trained model and additionally propose several useful features to evaluate the uncertainty of the translations to build our QE system, named \textit{QEMind}. The system has been applied to the sentence-level scoring task of Direct Assessment and the binary score prediction task of Critical Error Detection. In this paper, we present our submissions to the WMT 2021 QE shared task and an extensive set of experimental results have shown us that our multilingual systems outperform the best system in the Direct Assessment QE task of WMT 2020.
Feature extraction with mel scale separation method on noise audio recordings
Venue: arXiv cs.SD 2021
Year: 2021

This paper focuses on improving the accuracy of noise audio recordings. High-quality audio recording, extraction using the mel frequency cepstral coefficients (MFCC) method produces high accuracy. While the low-quality is because of noise, the accuracy is low. Improved accuracy by investigating the effect of bandwidth on the mel scale. The proposed improvement uses the mel scale separation methods into two frequency channels (MFCC dual channel). For the comparison method using the mel scale bandwidth without separation (MFCC single-channel). Feature analysis using k-mean clustering. The data uses a noise variance of up to -16 dB. Testing on the MFCC single channel method for -16 dB noise has an accuracy of 47.5%, while the MFCC dual-channel method has an accuracy better of 76.25%. The next test used adaptive noise-canceling (ANC) to reduce noise before extraction. The result is that the MFCC single-channel method has an accuracy of 82.5% and the MFCC dual-channel method has an accuracy better of 83.75%. High-quality audio recording testing for the MFCC single-channel method has an accuracy of 92.5% and the MFCC dual-channel method has an accuracy better of 97.5%. The test results show the effect of mel scale bandwidth to increase accuracy. The MFCC dual-channel method has higher accuracy.
A Survey of fault mitigation techniques for multi-core architectures
Venue: arXiv cs.AR 2021
Year: 2021

Fault tolerance in multi-core architecture has attracted attention of research community for the past 20 years. Rapid improvements in the CMOS technology resulted in exponential growth of transistor density. It resulted in increased challenges for designing resilient multi-core architecture at the same pace. The article presents a survey of fault tolerant methods like fault detection, recovery, re-configurability and repair techniques for multi-core architectures. Salvaging at micro-architectural and architectural level are also discussed. Gamut of fault tolerant approaches discussed in this article have tangible improvements on the reliability of the multi-core architectures. Every concept in the seminal articles is examined with respect to relevant metrics like performance cost, area overhead, fault coverage, level of protection, detection latency and Mean Time To Failure. The existing literature is critically examined. New research directions in the form of new fault tolerant design alternatives for both homogeneous and heterogeneous multi-core architectures are presented. Brief on an analytical approach for fault tolerating model is suggested for Intel and AMD based modern homogeneous multi-core architecture are presented to enhance the understanding of the readers about the architecture with respect to performance degradation, memory access time and execution time.
Set membership with two classical and quantum bit probes
Venue: arXiv cs.DS 2021
Year: 2021

We consider the following problem: Given a set S of at most n elements from a universe of size m, represent it in memory as a bit string so that membership queries of the form "Is x in S?" can be answered by making at most t probes into the bit string. Let s(m,n,t) be the minimum number of bits needed by any such scheme. We obtain new upper bounds for s(m,n,t=2), which match or improve all the previously known bounds. We also consider the quantum version of this problem and obtain improved upper bounds.
A Benchmark Dataset for Micro-video Thumbnail Selection
Venue: arXiv cs.IR 2021
Year: 2021

The thumbnail, as the first sight of a micro-video, plays a pivotal role in attracting users to click and watch. Although several pioneer efforts have been dedicated to jointly considering the quality and representativeness for selecting the thumbnail, they are limited in exploring the influence of users` interests. While in the real scenario, the more the thumbnails satisfy the users, the more likely the micro-videos will be clicked. In this paper, we aim to select the thumbnail of a given micro-video that meets most users` interests. Towards this end, we construct a large-scale dataset for the micro-video thumbnails. Ultimately, we conduct several baselines on the dataset and demonstrate the effectiveness of our dataset.
Deriving Distributive Laws for Graded Linear Types
Venue: arXiv cs.PL 2021
Year: 2021

The recent notion of graded modal types provides a framework for extending type theories with fine-grained data-flow reasoning. The Granule language explores this idea in the context of linear types. In this practical setting, we observe that the presence of graded modal types can introduce an additional impediment when programming: when composing programs, it is often necessary to 'distribute' data types over graded modalities, and vice versa. In this paper, we show how to automatically derive these distributive laws as combinators for programming. We discuss the implementation and use of this automated deriving procedure in Granule, providing easy access to these distributive combinators. This work is also applicable to Linear Haskell (which retrofits Haskell with linear types via grading) and we apply our technique there to provide the same automatically derived combinators. Along the way, we discuss interesting considerations for pattern matching analysis via graded linear types. Lastly, we show how other useful structural combinators can also be automatically derived.
Aim in Climate Change and City Pollution
Venue: arXiv cs.LG 2021
Year: 2021

The sustainability of urban environments is an increasingly relevant problem. Air pollution plays a key role in the degradation of the environment as well as the health of the citizens exposed to it. In this chapter we provide a review of the methods available to model air pollution, focusing on the application of machine-learning methods. In fact, machine-learning methods have proved to importantly increase the accuracy of traditional air-pollution approaches while limiting the development cost of the models. Machine-learning tools have opened new approaches to study air pollution, such as flow-dynamics modelling or remote-sensing methodologies.
Utilizing Wordnets for Cognate Detection among Indian Languages
Venue: arXiv cs.CL 2021
Year: 2021

Automatic Cognate Detection (ACD) is a challenging task which has been utilized to help NLP applications like Machine Translation, Information Retrieval and Computational Phylogenetics. Unidentified cognate pairs can pose a challenge to these applications and result in a degradation of performance. In this paper, we detect cognate word pairs among ten Indian languages with Hindi and use deep learning methodologies to predict whether a word pair is cognate or not. We identify IndoWordnet as a potential resource to detect cognate word pairs based on orthographic similarity-based methods and train neural network models using the data obtained from it. We identify parallel corpora as another potential resource and perform the same experiments for them. We also validate the contribution of Wordnets through further experimentation and report improved performance of up to 26%. We discuss the nuances of cognate detection among closely related Indian languages and release the lists of detected cognates as a dataset. We also observe the behaviour of, to an extent, unrelated Indian language pairs and release the lists of detected cognates among them as well.
Resource-Efficient Deep Learning: A Survey on Model-, Arithmetic-, and Implementation-Level Techniques
Venue: arXiv cs.LG 2021
Year: 2021

Deep learning is pervasive in our daily life, including self-driving cars, virtual assistants, social network services, healthcare services, face recognition, etc. However, deep neural networks demand substantial compute resources during training and inference. The machine learning community has mainly focused on model-level optimizations such as architectural compression of deep learning models, while the system community has focused on implementation-level optimization. In between, various arithmetic-level optimization techniques have been proposed in the arithmetic community. This article provides a survey on resource-efficient deep learning techniques in terms of model-, arithmetic-, and implementation-level techniques and identifies the research gaps for resource-efficient deep learning techniques across the three different level techniques. Our survey clarifies the influence from higher to lower-level techniques based on our resource-efficiency metric definition and discusses the future trend for resource-efficient deep learning research.
Benign Overfitting in Adversarially Robust Linear Classification
Venue: arXiv cs.LG 2021
Year: 2021

"Benign overfitting", where classifiers memorize noisy training data yet still achieve a good generalization performance, has drawn great attention in the machine learning community. To explain this surprising phenomenon, a series of works have provided theoretical justification in over-parameterized linear regression, classification, and kernel methods. However, it is not clear if benign overfitting still occurs in the presence of adversarial examples, i.e., examples with tiny and intentional perturbations to fool the classifiers. In this paper, we show that benign overfitting indeed occurs in adversarial training, a principled approach to defend against adversarial examples. In detail, we prove the risk bounds of the adversarially trained linear classifier on the mixture of sub-Gaussian data under $\ell_p$ adversarial perturbations. Our result suggests that under moderate perturbations, adversarially trained linear classifiers can achieve the near-optimal standard and adversarial risks, despite overfitting the noisy training data. Numerical experiments validate our theoretical findings.
Energy-Aware Multi-Robot Task Allocation in Persistent Tasks
Venue: arXiv cs.RO 2021
Year: 2021

The applicability of the swarm robots to perform foraging tasks is inspired by their compact size and cost. A considerable amount of energy is required to perform such tasks, especially if the tasks are continuous and/or repetitive. Real-world situations in which robots perform tasks continuously while staying alive (survivability) and maximizing production (performance) require energy awareness. This paper proposes an energy-conscious distributed task allocation algorithm to solve continuous tasks (e.g., unlimited foraging) for cooperative robots to achieve highly effective missions. We consider efficiency as a function of the energy consumed by the robot during exploration and collection when food is returned to the collection bin. Finally, the proposed energy-efficient algorithm minimizes the total transit time to the charging station and time consumed while recharging and maximizes the robot's lifetime to perform maximum tasks to enhance the overall efficiency of collaborative robots. We evaluated the proposed solution against a typical greedy benchmarking strategy (assigning the closest collection bin to the available robot and recharging the robot at maximum) for efficiency and performance in various scenarios. The proposed approach significantly improved performance and efficiency over the baseline approach.
Temporal aware Multi-Interest Graph Neural Network For Session-based Recommendation
Venue: arXiv cs.IR 2021
Year: 2021

Session-based recommendation (SBR) is a challenging task, which aims at recommending next items based on anonymous interaction sequences. Despite the superior performance of existing methods for SBR, there are still several limitations: (i) Almost all existing works concentrate on single interest extraction and fail to disentangle multiple interests of user, which easily results in suboptimal representations for SBR. (ii) Furthermore, previous methods also ignore the multi-form temporal information, which is significant signal to obtain current intention for SBR. To address the limitations mentioned above, we propose a novel method, called \emph{Temporal aware Multi-Interest Graph Neural Network} (TMI-GNN) to disentangle multi-interest and yield refined intention representations with the injection of two level temporal information. Specifically, by appending multiple interest nodes, we construct a multi-interest graph for current session, and adopt the GNNs to model the item-item relation to capture adjacent item transitions, item-interest relation to disentangle the multi-interests, and interest-item relation to refine the item representation. Meanwhile, we incorporate item-level time interval signals to guide the item information propagation, and interest-level time distribution information to assist the scattering of interest information. Experiments on three benchmark datasets demonstrate that TMI-GNN outperforms other state-of-the-art methods consistently.
Towards a Domain Ontology for the Analysis of Ancient Fabrics The SILKNOW Project and the Case of European Silk Heritage
Venue: arXiv cs.CY 2021
Year: 2021

In this article, we present the SILKNOW project (Silk heritage in the Knowledge Society: from punched card to Big Data, Deep Learning and visual/tangible simulations) (2018-2021). This project aimed to use Semantic Web technologies to give greater visibility to silk objects produced and consumed in Europe between the 15th and 19th centuries. Silk is a particularly important material in European history, and it has produced some exceptional objects of great historical interest. However, it is a threatened heritage that is little known to the general public. We show the interest of using Semantic Web technologies to give more visibility to such a heritage, by describing the results we have obtained. We present the methodology used to develop a knowledge graph, and in particular the different steps that were necessary to create the underlying data model, based on the CIDOC CRM or CIDOC Conceptual Reference Model. We also propose a CIDOC CRM-compatible extension to express the complex semantics of the creation and production process of ancient silk fabrics.
Efficient Multi-Beam Training For Terahertz Wireless communications
Venue: arXiv cs.IT 2021
Year: 2021

Although Terahertz communication systems can provide high data rates, it needs high directional beamforming at transmitters and receivers to achieve such rates over a long distance. Therefore, an efficient beam training method is vital to accelerate the link establishment. In this study, we propose a low-complexity beam training scheme of terahertz communication system which uses a low-cost small-scale hybrid architecture to assist a large-scale array for data transmission. The proposed scheme includes two key stages: (1) coarse AoAs/AoDs estimation for beam subset optimization in auxiliary array stage, and (2) accurate AoAs/AoDs estimation by exploiting channel sparsity in data transmission array stage. The analysis shows that the complexity of the scheme is linear with the number of main paths, and thus greatly reduces the complexity of beam training. Simulation results have verified the better performance in spectral efficiency of the proposed scheme than that of the related work.
OpenQA: Hybrid QA System Relying on Structured Knowledge Base as well as Non-structured Data
Venue: arXiv cs.CL 2021
Year: 2021

Search engines based on keyword retrieval can no longer adapt to the way of information acquisition in the era of intelligent Internet of Things due to the return of keyword related Internet pages. How to quickly, accurately and effectively obtain the information needed by users from massive Internet data has become one of the key issues urgently needed to be solved. We propose an intelligent question-answering system based on structured KB and unstructured data, called OpenQA, in which users can give query questions and the model can quickly give accurate answers back to users. We integrate KBQA structured question answering based on semantic parsing and deep representation learning, and two-stage unstructured question answering based on retrieval and neural machine reading comprehension into OpenQA, and return the final answer with the highest probability through the Transformer answer selection module in OpenQA. We carry out preliminary experiments on our constructed dataset, and the experimental results prove the effectiveness of the proposed intelligent question answering system. At the same time, the core technology of each module of OpenQA platform is still in the forefront of academic hot spots, and the theoretical essence and enrichment of OpenQA will be further explored based on these academic hot spots.
Scene-Adaptive Attention Network for Crowd Counting
Venue: arXiv cs.CV 2021
Year: 2021

In recent years, significant progress has been made on the research of crowd counting. However, as the challenging scale variations and complex scenes existed in crowds, neither traditional convolution networks nor recent Transformer architectures with fixed-size attention could handle the task well. To address this problem, this paper proposes a scene-adaptive attention network, termed SAANet. First of all, we design a deformable attention in-built Transformer backbone, which learns adaptive feature representations with deformable sampling locations and dynamic attention weights. Then we propose the multi-level feature fusion and count-attentive feature enhancement modules further, to strengthen feature representation under the global image context. The learned representations could attend to the foreground and are adaptive to different scales of crowds. We conduct extensive experiments on four challenging crowd counting benchmarks, demonstrating that our method achieves state-of-the-art performance. Especially, our method currently ranks No.1 on the public leaderboard of the NWPU-Crowd benchmark. We hope our method could be a strong baseline to support future research in crowd counting. The source code will be released to the community.
Non-Linear Age of Information: An Energy Efficient Receiver-Centric Approach
Venue: arXiv cs.IT 2021
Year: 2021

The age of information (AoI) performance metric for point-to-point wireless communication systems is analytically studied under Rician-faded channels and when the receiver is equipped with multiple antennas. The general scenario of a non-linear AoI function is considered, which includes the conventional linear AoI as a special case. The stop-and-wait transmission policy is adopted, where the source node samples and then transmits new data only upon the successful reception of previous data. This approach can serve as a performance benchmark for any queuing system used in practice. New analytical and closed-form expressions are derived with respect to the average AoI and average peak AoI for the considered system configuration. We particularly focus on the energy efficiency of the said mode of operation, whereas some useful engineering insights are provided.
In Lieu of Privacy: Anonymous Contact Tracing
Venue: arXiv cs.CR 2021
Year: 2021

We present Tracer Tokens, a hardware token of privacy-preserving contact tracing utilizing Exposure Notification \cite{GAEN} protocol. Through subnetworks, we show that any disease spread by proximity can be traced such as seasonal flu, cold, regional strains of COVID-19, or Tuberculosis. Further, we show this protocol to notify $n^n$ users in parallel, providing a speed of information unmatched by current contact tracing methods.