OpenRaiser/Intern-Atlas huggingface dataset:
Neural Network architectures to classify emotions in Indian Classical Music
Venue: arXiv cs.SD 2021
Year: 2021

Music is often considered as the language of emotions. It has long been known to elicit emotions in human being and thus categorizing music based on the type of emotions they induce in human being is a very intriguing topic of research. When the task comes to classify emotions elicited by Indian Classical Music (ICM), it becomes much more challenging because of the inherent ambiguity associated with ICM. The fact that a single musical performance can evoke a variety of emotional response in the audience is implicit to the nature of ICM renditions. With the rapid advancements in the field of Deep Learning, this Music Emotion Recognition (MER) task is becoming more and more relevant and robust, hence can be applied to one of the most challenging test case i.e. classifying emotions elicited from ICM. In this paper we present a new dataset called JUMusEmoDB which presently has 400 audio clips (30 seconds each) where 200 clips correspond to happy emotions and the remaining 200 clips correspond to sad emotion. For supervised classification purposes, we have used 4 existing deep Convolutional Neural Network (CNN) based architectures (resnet18, mobilenet v2.0, squeezenet v1.0 and vgg16) on corresponding music spectrograms of the 2000 sub-clips (where every clip was segmented into 5 sub-clips of about 5 seconds each) which contain both time as well as frequency domain information. The initial results are quite inspiring, and we look forward to setting the baseline values for the dataset using this architecture. This type of CNN based classification algorithm using a rich corpus of Indian Classical Music is unique even in the global perspective and can be replicated in other modalities of music also. This dataset is still under development and we plan to include more data containing other emotional features as well. We plan to make the dataset publicly available soon.
The Controllability of Planning, Responsibility, and Security in Automatic Driving Technology
Venue: arXiv cs.AI 2021
Year: 2021

People hope automated driving technology is always in a stable and controllable state; specifically, it can be divided into controllable planning, controllable responsibility, and controllable information. When this controllability is undermined, it brings about the problems, e.g., trolley dilemma, responsibility attribution, information leakage, and security. This article discusses these three types of issues separately and clarifies the misunderstandings.
An End-to-End Food Image Analysis System
Venue: arXiv cs.CV 2021
Year: 2021

Modern deep learning techniques have enabled advances in image-based dietary assessment such as food recognition and food portion size estimation. Valuable information on the types of foods and the amount consumed are crucial for prevention of many chronic diseases. However, existing methods for automated image-based food analysis are neither end-to-end nor are capable of processing multiple tasks (e.g., recognition and portion estimation) together, making it difficult to apply to real life applications. In this paper, we propose an image-based food analysis framework that integrates food localization, classification and portion size estimation. Our proposed framework is end-to-end, i.e., the input can be an arbitrary food image containing multiple food items and our system can localize each single food item with its corresponding predicted food type and portion size. We also improve the single food portion estimation by consolidating localization results with a food energy distribution map obtained by conditional GAN to generate a four-channel RGB-Distribution image. Our end-to-end framework is evaluated on a real life food image dataset collected from a nutrition feeding study.
Intelligent Network Layer for Cyber-Physical Systems Security
Venue: arXiv cs.CR 2021
Year: 2021

Cyber-Physical System (CPS) has made a tremendous progress in recent years and also disrupted many technical fields such as smart industries, smart health, smart transportation etc. to flourish the nations economy. However, CPS Security is still one of the concerns for wide adoption owing to high number of devices connecting to the internet and the traditional security solutions may not be suitable to protect the advanced, application specific attacks. This paper presents a programmable device network layer architecture to combat attacks and efficient network monitoring in heterogeneous environment CPS applications. We leverage Industrial control systems (ICS) to discuss the existing issues, highlighting the importance of advanced network layer for CPS. The programmable data plane language (P4) is introduced to detect well known HELLO Flood attack with minimal efforts in the network level and also used to featuring the potential solutions for security.
Commonsense Knowledge Mining from Term Definitions
Venue: arXiv cs.CL 2021
Year: 2021

Commonsense knowledge has proven to be beneficial to a variety of application areas, including question answering and natural language understanding. Previous work explored collecting commonsense knowledge triples automatically from text to increase the coverage of current commonsense knowledge graphs. We investigate a few machine learning approaches to mining commonsense knowledge triples using dictionary term definitions as inputs and provide some initial evaluation of the results. We start from extracting candidate triples using part-of-speech tag patterns from text, and then compare the performance of three existing models for triple scoring. Our experiments show that term definitions contain some valid and novel commonsense knowledge triples for some semantic relations, and also indicate some challenges with using existing triple scoring models.
Hierarchical Ranking for Answer Selection
Venue: arXiv cs.CL 2021
Year: 2021

Answer selection is a task to choose the positive answers from a pool of candidate answers for a given question. In this paper, we propose a novel strategy for answer selection, called hierarchical ranking. We introduce three levels of ranking: point-level ranking, pair-level ranking, and list-level ranking. They formulate their optimization objectives by employing supervisory information from different perspectives to achieve the same goal of ranking candidate answers. Therefore, the three levels of ranking are related and they can promote each other. We take the well-performed compare-aggregate model as the backbone and explore three schemes to implement the idea of applying the hierarchical rankings jointly: the scheme under the Multi-Task Learning (MTL) strategy, the Ranking Integration (RI) scheme, and the Progressive Ranking Integration (PRI) scheme. Experimental results on two public datasets, WikiQA and TREC-QA, demonstrate that the proposed hierarchical ranking is effective. Our method achieves state-of-the-art (non-BERT) performance on both TREC-QA and WikiQA.
FEEL: Fast, Energy-Efficient Localization for Autonomous Indoor Vehicles
Venue: arXiv cs.RO 2021
Year: 2021

Autonomous vehicles have created a sensation in both outdoor and indoor applications. The famous indoor use-case is process automation inside a warehouse using Autonomous Indoor Vehicles (AIV). These vehicles need to locate themselves not only with an accuracy of a few centimetres but also within a few milliseconds in an energy-efficient manner. Due to these challenges, localization is a holy grail. In this paper, we propose FEEL - an indoor localization system that uses a fusion of three low-energy sensors: IMU, UWB, and radar. We provide detailed software and hardware architecture of FEEL. Further, we propose Adaptive Sensing Algorithm (ASA) for opportunistically minimizing energy consumption of FEEL by adjusting the sensing frequency to the dynamics of the physical environment. Our extensive performance evaluation over diverse test settings reveal that FEEL provides a localization accuracy of <7cm with ultra-low latency of around 3ms. Further, ASA yields up to 20% energy saving with only a marginal trade-off in accuracy.
Learning to Combat Noisy Labels via Classification Margins
Venue: arXiv cs.LG 2021
Year: 2021

A deep neural network trained on noisy labels is known to quickly lose its power to discriminate clean instances from noisy ones. After the early learning phase has ended, the network memorizes the noisy instances, which leads to a significant degradation in its generalization performance. To resolve this issue, we propose MARVEL (MARgins Via Early Learning), a new robust learning method where the memorization of the noisy instances is curbed. We propose a new test statistic that tracks the goodness of "fit" of every instance based on the epoch-history of its classification margins. If its classification margin is small in a sequence of consecutive learning epochs, that instance is declared noisy and the network abandons learning on it. Consequently, the network first flags a possibly noisy instance, and then waits to see if learning on that instance can be improved and if not, the network learns with confidence that this instance can be safely abandoned. We also propose MARVEL+, where arduous instances can be upweighted, enabling the network to focus and improve its learning on them and consequently its generalization. Experimental results on benchmark datasets with synthetic label noise and real-world datasets show that MARVEL outperforms other baselines consistently across different noise levels, with a significantly larger margin under asymmetric noise.
About Face: A Survey of Facial Recognition Evaluation
Venue: arXiv cs.CV 2021
Year: 2021

We survey over 100 face datasets constructed between 1976 to 2019 of 145 million images of over 17 million subjects from a range of sources, demographics and conditions. Our historical survey reveals that these datasets are contextually informed, shaped by changes in political motivations, technological capability and current norms. We discuss how such influences mask specific practices (some of which may actually be harmful or otherwise problematic) and make a case for the explicit communication of such details in order to establish a more grounded understanding of the technology's function in the real world.
Machine learning pipeline for battery state of health estimation
Venue: arXiv cs.LG 2021
Year: 2021

Lithium-ion batteries are ubiquitous in modern day applications ranging from portable electronics to electric vehicles. Irrespective of the application, reliable real-time estimation of battery state of health (SOH) by on-board computers is crucial to the safe operation of the battery, ultimately safeguarding asset integrity. In this paper, we design and evaluate a machine learning pipeline for estimation of battery capacity fade - a metric of battery health - on 179 cells cycled under various conditions. The pipeline estimates battery SOH with an associated confidence interval by using two parametric and two non-parametric algorithms. Using segments of charge voltage and current curves, the pipeline engineers 30 features, performs automatic feature selection and calibrates the algorithms. When deployed on cells operated under the fast-charging protocol, the best model achieves a root mean squared percent error of 0.45\%. This work provides insights into the design of scalable data-driven models for battery SOH estimation, emphasising the value of confidence bounds around the prediction. The pipeline methodology combines experimental data with machine learning modelling and can be generalized to other critical components that require real-time estimation of SOH.
Sampling and Complexity of Partition Function
Venue: arXiv cs.CC 2021
Year: 2021

The number partition problem is a well-known problem, which is one of 21 Karp's NP-complete problems \cite{karp}. The partition function is a boolean function that is equivalent to the number partition problem with number range restricted. To fully understand the computational complexity of the number partition problem and the partition function is quite important and hard. People speculate that we need new tools and methods \cite{aaronson} for such problem. In our recent research on the universal learning machine \cite{paper5, paper8}, we developed some tools, namely, fitting extremum, proper sampling set, boolean function with parameters (used in trial-and-error fashion). We found that these tools could be applied to the partition function. In this article, we discuss the set up of the partition function, properties of the partition function, and the tools to be used. This approach leads us to prove that the lower bound of the computational complexity of partition function, as well as the lower bound of the computational complexity of the number partition problem, is exponential to the size of problem. This implies: P $\ne$ NP \cite{cook}.
Evolutionary computational platform for the automatic discovery of nanocarriers for cancer treatment
Venue: arXiv cs.NE 2021
Year: 2021

We present the EVONANO platform for the evolution of nanomedicines with application to anti-cancer treatments. EVONANO includes a simulator to grow tumours, extract representative scenarios, and then simulate nanoparticle transport through these scenarios to predict nanoparticle distribution. The nanoparticle designs are optimised using machine learning to efficiently find the most effective anti-cancer treatments. We demonstrate our platform with two examples optimising the properties of nanoparticles and treatment to selectively kill cancer cells over a range of tumour environments.
Stochastic High Fidelity Simulation and Scenarios for Testing of Fixed Wing Autonomous GNSS-Denied Navigation Algorithms
Venue: arXiv cs.RO 2021
Year: 2021

Autonomous unmanned aerial vehicle (UAV) inertial navigation exhibits an extreme dependency on the availability of global navigation satellite systems (GNSS) signals, without which it incurs in a slow but unavoidable position drift that may ultimately lead to the loss of the platform if the GNSS signals are not restored or the aircraft does not reach a location from which it can be recovered by remote control. This article describes an stochastic high fidelity simulation of the flight of a fixed wing low SWaP (size, weight, and power) autonomous UAV in turbulent and varying weather intended to test and validate the GNSS-Denied performance of different navigation algorithms. Its open-source \nm{\CC} implementation has been released and is publicly available. Onboard sensors include accelerometers, gyroscopes, magnetometers, a Pitot tube, an air data system, a GNSS receiver, and a digital camera, so the simulation is valid for inertial, visual, and visual inertial navigation systems. Two scenarios involving the loss of GNSS signals are considered: the first represents the challenges involved in aborting the mission and heading towards a remote recovery location while experiencing varying weather, and the second models the continuation of the mission based on a series of closely spaced bearing changes. All simulation modules have been modeled with as few simplifications as possible to increase the realism of the results. While the implementation of the aircraft performances and its control system is deterministic, that of all other modules, including the mission, sensors, weather, wind, turbulence, and initial estimations, is fully stochastic. This enables a robust evaluation of each proposed navigation system by means of Monte-Carlo simulations that rely on a high number of executions of both scenarios.
Risk Aware and Multi-Objective Decision Making with Distributional Monte Carlo Tree Search
Venue: arXiv cs.LG 2021
Year: 2021

In many risk-aware and multi-objective reinforcement learning settings, the utility of the user is derived from the single execution of a policy. In these settings, making decisions based on the average future returns is not suitable. For example, in a medical setting a patient may only have one opportunity to treat their illness. When making a decision, just the expected return -- known in reinforcement learning as the value -- cannot account for the potential range of adverse or positive outcomes a decision may have. Our key insight is that we should use the distribution over expected future returns differently to represent the critical information that the agent requires at decision time. In this paper, we propose Distributional Monte Carlo Tree Search, an algorithm that learns a posterior distribution over the utility of the different possible returns attainable from individual policy executions, resulting in good policies for both risk-aware and multi-objective settings. Moreover, our algorithm outperforms the state-of-the-art in multi-objective reinforcement learning for the expected utility of the returns.
Consistent Recurrent Neural Networks for 3D Neuron Segmentation
Venue: arXiv cs.CV 2021
Year: 2021

We present a recurrent network for the 3D reconstruction of neurons that sequentially generates binary masks for every object in an image with spatio-temporal consistency. Our network models consistency in two parts: (i) local, which allows exploring non-occluding and temporally-adjacent object relationships with bi-directional recurrence. (ii) non-local, which allows exploring long-range object relationships in the temporal domain with skip connections. Our proposed network is end-to-end trainable from an input image to a sequence of object masks, and, compared to methods relying on object boundaries, its output does not require post-processing. We evaluate our method on three benchmarks for neuron segmentation and achieved state-of-the-art performance on the SNEMI3D challenge.
Simple Trust Metric in a Low-Power Sensor Network
Venue: arXiv cs.DC 2021
Year: 2021

Distributed systems become more and more important to our life. Especially in areas like Smart Home and the Internet of Things (IoT) reliable low-power sensor networks become increasingly important. For ensuring this there are a lot of trust metrics. In this paper we compare a model of a distributed low-power sensor network including one root node and the corresponding Simple Trust Metric to the requirements from "Representation of Trust and Reputation in Self-Managed Computing Systems" [1], the Weighted Trust Metric and the Weighted Simple Exponential Smoothing
Jiffy: A Lock-free Skip List with Batch Updates and Snapshots
Venue: arXiv cs.DS 2021
Year: 2021

In this paper we introduce Jiffy, the first lock-free, linearizable ordered key-value index that offers both (1) batch updates, which are put and remove operations that are executed atomically, and (2) consistent snapshots used by, e.g., range scan operations. Jiffy is built as a multiversioned lock-free skip list and relies on CPU's Time Stamp Counter register to generate version numbers at minimal cost. For faster skip list traversals and better utilization of the CPU caches, key-value entries are grouped into immutable objects called revisions. Moreover, by changing the size of revisions and thus modifying the synchronization granularity, our index can adapt to varying contentions levels (smaller revisions are more suited for write-heavy workloads whereas large revisions benefit read-dominated workloads, especially when they feature many range scan operations). Structure modifications to the index, which result in changing the size of revisions, happen through (lock-free) skip list node split and merge operations that are carefully coordinated with the update operations. Despite rich semantics, Jiffy offers highly scalable performance, which is comparable or exceeds the performance of the state-of-the-art lock-free ordered indices that feature linearizable range scan operations. Compared to its (lock-based) rivals that also support batch updates, Jiffy can execute large batch updates up to 7.4x more efficiently.
Zen-NAS: A Zero-Shot NAS for High-Performance Deep Image Recognition
Venue: arXiv cs.CV 2021
Year: 2021

Accuracy predictor is a key component in Neural Architecture Search (NAS) for ranking architectures. Building a high-quality accuracy predictor usually costs enormous computation. To address this issue, instead of using an accuracy predictor, we propose a novel zero-shot index dubbed Zen-Score to rank the architectures. The Zen-Score represents the network expressivity and positively correlates with the model accuracy. The calculation of Zen-Score only takes a few forward inferences through a randomly initialized network, without training network parameters. Built upon the Zen-Score, we further propose a new NAS algorithm, termed as Zen-NAS, by maximizing the Zen-Score of the target network under given inference budgets. Within less than half GPU day, Zen-NAS is able to directly search high performance architectures in a data-free style. Comparing with previous NAS methods, the proposed Zen-NAS is magnitude times faster on multiple server-side and mobile-side GPU platforms with state-of-the-art accuracy on ImageNet. Our source code and pre-trained models are released on https://github.com/idstcv/ZenNAS.
Wireless Sensor Network MAC Energy -- efficiency Protocols: A Survey
Venue: arXiv cs.NI 2021
Year: 2021

Energy Efficiency in wireless sensor networks is an important topic in which the nodes rely on battery power, and efficient energy usage is a key issue for sensitive applications that require long working times. This stimulates many scientists at all levels of communication protocols Medium Access Control (MAC) who control the use of the wireless transmitter and receiver unit to create new protocols. Many protocols were suggested that primarily take energy efficiency as the primary objective of sustaining the function of the network for as long as possible into account with different objectives for wireless sensor networks. This paper will look at some of these energy efficiency protocols.
Improving Distantly-Supervised Relation Extraction through BERT-based Label & Instance Embeddings
Venue: arXiv cs.CL 2021
Year: 2021

Distantly-supervised relation extraction (RE) is an effective method to scale RE to large corpora but suffers from noisy labels. Existing approaches try to alleviate noise through multi-instance learning and by providing additional information, but manage to recognize mainly the top frequent relations, neglecting those in the long-tail. We propose REDSandT (Relation Extraction with Distant Supervision and Transformers), a novel distantly-supervised transformer-based RE method, that manages to capture a wider set of relations through highly informative instance and label embeddings for RE, by exploiting BERT's pre-trained model, and the relationship between labels and entities, respectively. We guide REDSandT to focus solely on relational tokens by fine-tuning BERT on a structured input, including the sub-tree connecting an entity pair and the entities' types. Using the extracted informative vectors, we shape label embeddings, which we also use as attention mechanism over instances to further reduce noise. Finally, we represent sentences by concatenating relation and instance embeddings. Experiments in the NYT-10 dataset show that REDSandT captures a broader set of relations with higher confidence, achieving state-of-the-art AUC (0.424).