Abstract

In this paper, we present a novel approach for domain adaptation in Neural Machine Translation which aims to improve the translation quality over a new domain. Adapting new domains is a highly challeng- ing task for Neural Machine Translation on limited data, it becomes even more diffi- cult for technical domains such as Chem- istry and Artificial Intelligence due to spe- cific terminology, etc. We propose Domain Specific Back Translation method which uses available monolingual data and gen- erates synthetic data in a different way. This approach uses Out Of Domain words. The approach is very generic and can be applied to any language pair for any do- main. We conduct our experiments on Chemistry and Artificial Intelligence do- mains for Hindi and Telugu in both direc- tions. It has been observed that the usage of synthetic data created by the proposed algorithm improves the BLEU scores sig- nificantly

Abstract

In recent times, quadrotors have become immensely applicable in scenarios such as relief operations, infrastructure maintenance, search-and-rescue missions etc. A key control design challenge arises in these applications when the quadrotor has to manoeuvre through constrained spaces such as narrow windows, pipelines in the presence of external disturbances and parametric uncertainties: such conditions necessitate the controller to guarantee predefined tracking accuracy so as to not violate the constraints and simultaneously tackle uncertainties. However, state-of-the-art controllers dealing with constrained system motion are not applicable either for an underactuated system like quadrotor or for an uncertain system dynamics. This work proposes a robust controller that enables the quadrotor to follow a trajectory with predefined tracking accuracy in constrained space as well as to tackle uncertainties stemming from imprecise system modelling and external disturbances. The closed-loop system stability is analysed via the Barrier Lyapunov approach and the effectiveness of the proposed controller is validated via simulation with state of the art.

Abstract

The ramp generator is a crucial circuit component in the design of switching power supply, analog to digital converters, CMOS image sensors, and many other essential circuits. Conventionally, the ramp generator has been implemented with a CMOS comparator that works on the hysteresis principle, which leads to an inherent systemic delay. This paper aims at improving the overall circuit speed by proposing the design of a ramp generator using CMOS proteretic comparator in 180nm TSMC process. It is established from the post-layout simulation that a speedup of 25% is achieved by replacing a hysteretic comparator with a proteretic comparator, and this is done with a trade-off in power consumption and circuit area.

Abstract

The question of how the human brain represents information, and if insights from this knowledge help us in formulating better deep learning algorithms, is still open. This paper attempts to address these questions by investigating the brain responses when participants viewed images of objects belonging to a variety of categories. We adopt the representational similarity analysis (RSA) framework wherein the brain responses are projected into a representational dissimilarity (RD) space so that responses from multiple subjects can be assessed on a common basis. We performed RSA of the brain responses of 15 participants on a set of 92 images (from the Algonauts challenge data set) Cichy et al. (The Algonauts project: a platform for communication between the sciences of biological and artificial intelligence 2019 [4]). The results reveal that human brain responses exhibit appropriate qualitative similarities observed in the image space. We then evaluated various deep networks such as VGGnet, AlexNet, and Inception in Siamese configuration with RD-loss function and identified hidden layers that had maximal similarity to human RD matrices (RDM). The best layers then were subjected to further analysis by looking at the image pairs corresponding to high and

Abstract

There has been increasing interest in building deep hierarchy-aware classifiers that aim to quantify and reduce the severity of mistakes, and not just reduce the number of errors. The idea is to exploit the label hierarchy (e.g., the WordNet ontology) and consider graph distances as a proxy for mistake severity. Surprisingly, on examining mistake-severity distributions of the top-1 prediction, we find that current state-of-the-art hierarchy-aware deep classifiers do not always show practical improvement over the standard cross-entropy baseline in making better mistakes. The reason for the reduction in average mistake-severity can be attributed to the increase in low-severity mistakes, which may also explain the noticeable drop in their accuracy. To this end, we use the classical Conditional Risk Minimization (CRM) framework for hierarchy-aware classification. Given a cost matrix and a reliable estimate of likelihoods (obtained from a trained network), CRM simply amends mistakes at inference time; it needs no extra hyperparameters and requires adding just a few lines of code to the standard cross-entropy baseline. It significantly outperforms the state-of-the-art and consistently obtains large reductions in the average hierarchical distance of top- predictions across datasets, with very little loss in accuracy. CRM, because of its simplicity, can be used with any off-the-shelf trained model that provides reliable likelihood estimates.

Abstract

Online abuse and offensive language on social media have become widespread problems in today’s digital age. In this paper, we contribute a Reddit-based dataset, consisting of 68,159 insults and 51,102 compliments targeted at individuals instead of targeting a particular community or race. Secondly, we benchmark multiple existing state-of-the-art models for both classification and unsupervised style transfer on the dataset. Finally, we analyse the experimental results and conclude that the transfer task is challenging, requiring the models to understand the high degree of creativity exhibited in the data.

Abstract

Text simplification is the process of splitting and rephrasing a sentence to a sequence of sentences making it easier to read and un- derstand while preserving the content and ap- proximating the original meaning. Text sim- plification has been exploited in NLP appli- cations like machine translation, summariza- tion, semantic role labeling, and information extraction, opening a broad avenue for its ex- ploitation in comprehension-based question- answering downstream tasks. In this work, we investigate the effect of text simplification in the task of question-answering using a compre- hension context. We release Simple-SQuAD, a simplified version of the widely-used SQuAD dataset. Firstly, we outline each step in the dataset cre- ation pipeline, including style transfer, thresh- olding of sentences showing correct transfer, and offset finding for each answer. Secondly, we verify the quality of the transferred sen- tences through various methodologies involv- ing both automated and human evaluation. Thirdly, we benchmark the newly created cor- pus and perform an ablation study for ex- amining the effect of the simplification pro- cess in the SQuAD-based question answering task. Our experiments show that simplification

Abstract

Recently, there has been research on what factors influence a user’s password setting practices, which include various types of emotions such as anger, risk-taking tendencies, etc. How- ever, research has shown that factors such as memorability and perceived memorability have a greater influence on password choice. Some recent research has shown a negative correlation between the perceived memorability and the perceived secu- rity of passwords, particularly passphrases (that are technically more secure). However, it is unclear whether this effect can be extended to groups with good experiences with digital spaces (IT professionals, entrepreneurs, etc.). Furthermore, it has not been determined whether random, uncommonly-worded, or complex structure passphrases would also maintain the cor- relation, as opposed to relatively less secure, common/simple passphrases. This study examines this problem using a diverse demographic and different categories of passphrases. Keywords: Metacognition; Passwords; Perception; Memora- bility; Security

Abstract

Congestion in a network can cause several undesirable conditions such as packet loss, retransmission of packets, etc. There have been many variations of TCP for appropriate congestion control. These variations manage the sending rate of the users based upon the feedback they get from the network. In like manner, there are congestion control methods that take leverage of the Software Defined Networking and manage congestion from the controller. In this work we aim to manage congestion by coupling the activity of both the users and network controller in an SDN. We provide a utility based framework for a joint proactive and reactive mechanism for congestion control. We propose a system optimization function and show that our user and network congestion control methods optimize the system utility. Further, we simulate our model and show that our model significantly improves the system utility.

Abstract

This chapter provides a behind-the-scenes account of the birth of a naturalistic approach to the neuroscience of the musical aesthetic experience. The story starts from a lab talk giving the inspiration to translate the naturalistic paradigm initially applied to neuroimaging studies of the visual domain into music research. The circumstantial co-presence of neuroscientists and computational musicologists at the same center did the trick, permitting the identification of controlled variables for brain signal processing from the automatic extraction of the acoustic features of real music. This approach is now well accepted by the music neuroscience community while still waiting for full exploitation by aesthetic research.