Abstract

Multiple business scenarios require an automated generation of descriptive human-readable text from structured input data. Hence, fact-to-text generation systems have been developed for various downstream tasks like generating soccer reports, weather and financial reports, medical reports, person biographies, etc. Unfortunately, previous work on fact-to-text (F2T) generation has focused primarily on English mainly due to the high availability of relevant datasets. Only recently, the problem of cross-lingual fact-to-text (XF2T) was proposed for generation across multiple languages alongwith a dataset, XALIGN for eight languages. However, there has been no rigorous work on the actual XF2T generation problem. We extend XALIGN dataset with annotated data for four more languages: Punjabi, Malayalam, Assamese and Oriya. We conduct an extensive study using popular Transformer-based text generation models on our extended multi-lingual dataset, which we call XALIGNV2. Further, we investigate the performance of different text generation strategies: multiple variations of pretraining, fact-aware embeddings and structure-aware input encoding. Our extensive experiments show that a multi-lingual mT5 model which uses fact-aware embeddings with structure-aware input encoding leads to best results on average across the twelve languages. We make our code, dataset and model publicly available, and hope that this will help advance further research in this critical area.

Abstract

Reinforcement Learning (RL) enables agents to learn how to perform various tasks from scratch. In domains like autonomous driving, recommendation systems, and more, optimal RL policies learned could cause a privacy breach if the policies memorize any part of the private reward. We study the set of existing differentially-private RL policies derived from various RL algorithms such as Value Iteration, Deep-Q Networks, and Vanilla Proximal Policy Optimization. We propose a new Privacy-Aware Inverse RL analysis framework (PRIL) that involves performing reward reconstruction as an adversarial attack on private policies that the agents may deploy. For this, we introduce the reward reconstruction attack, wherein we seek to reconstruct the original reward from a privacy-preserving policy using the Inverse RL algorithm. An adversary must do poorly at reconstructing the original reward function if the agent uses a tightly private policy. Using this framework, we empirically test the effectiveness of the privacy guarantee offered by the private algorithms on instances of the FrozenLake domain of varying complexities. Based on the analysis performed, we infer a gap between the current standard of privacy offered and the standard of privacy needed to protect reward functions in RL. We do so by quantifying the extent to which each private policy protects the reward function by measuring distances between the original and reconstructed rewards.

Abstract

A method for viding maximum traffic flow throughput and controlling vehicular pollution concentration is pro vided . The method includes ( i ) processing a source location and a destination location obtained from a user device associated with a user to determine at least one possible route to reach the destination location from the source location , ( ii ) determining at least one maximum flow route that includes at least one edge with an edge capacity from the at least one possible route , ( iii ) determining maximum traffic flow capacity for the at least one maximum flow route , ( iv ) determining active traffic flow routes by comparing continuously if shared or common edges of a plurality of route solutions is less than or equal to a pre - defined limit and ( v ) partitioning the maximum traffic flow capacity for the active traffic flow routes and permuting each partition of the maximum traffic flow capacity for the active traffic flow routes .

Abstract

Moving target defense (MTD) has emerged as a key technique that can be used in various security applications to reduce the threat of attackers by taking away their ability to perform reconnaissance and exploit vulnerabilities. However, most of the existing research in the field assumes unrealistic access to information about the attacker’s motivations and/or actions when developing MTD strategies. Many of the existing approaches also assume complete knowledge regarding the vulnerabilities of a particular application and how each of these vulnerabilities can be exploited by an attacker. In this work, we propose an algorithm that generates effective MTD strategies for web applications that does not rely on prior knowledge about the attackers. Our approach assumes that the only information the defender receives about its own reward function, is via interaction with the attacker in a repeated game setting. We evaluate our algorithm using data which is mined from the National Vulnerability Database to show that it matches the performance of the state of the art techniques, despite using much less information.

Abstract

Finding or tracking the location of an object accurately is a crucial problem in defense applications, robotics and computer vision. Radars fall into the spectrum of high-end defense sensors or systems upon which the security and surveillance of the entire world depends. There has been a lot of focus on the topic of Multi Sensor Tracking in recent years, with radars as the sensors. The Indian Air Force uses a Multi Sensor Tracking (MST) system to detect flights pan India, developed and supported by BEL (Bharat Electronics Limited), a defense agency we are working with. In this paper, we describe our Machine Learning approach, which is built on top of the existing system, the Air force uses. For purposes of this work, we trained our models on about 13 million anonymized real Multi Sensor tracking data points provided by radars performing tracking activity across the Indian air space. The approach has shown an increase in the accuracy of tracking by 5 percent from 91 to 96. The model and the corresponding code were transitioned to BEL, which has been tested in their simulation environment with a plan to take forward for ground testing. Our approach comprises of 3 steps:(a) We train a Neural Network model and a CatBoost model and ensemble them using a Logistic Regression model to predict one type of error, namely Splitting error, which can help to improve the accuracy of tracking.(b) We again train a Neural Network model and a CatBoost model and ensemble them using a different Logistic Regression model to predict the second type of error, namely Merging error, which can further improve the accuracy of tracking.(c) We use cosine …

Abstract

Recent focus on transcriptomic studies in food crops like rice, wheat and maize provide new opportunities to address issues related to agriculture and climate change. Re-analysis of such data available in public domain supplemented with annotations across molecular hierarchy can be of immense help to the plant research community, particularly co-expression networks representing transcriptionally coordinated genes that are often part of the same biological process. With this objective, we have developed NetREx, a Network-based Rice Expression Analysis Server, that hosts ranked co-expression networks of Oryza sativa using publicly available messenger RNA sequencing data across uniform experimental conditions. It provides a range of interactable data viewers and modules for analysing user-queried genes across different stress conditions (drought, flood, cold and osmosis) and hormonal treatments (abscisic and jasmonic acid) and tissues (root and shoot). Subnetworks of user-defined genes can be queried in pre-constructed tissue-specific networks, allowing users to view the fold change, module memberships, gene annotations and analysis of their neighbourhood genes and associated pathways. The web server also allows querying of orthologous genes from Arabidopsis, wheat, maize, barley and sorghum. Here, we demonstrate that NetREx can be used to identify novel candidate genes and tissue-specific interactions under stress conditions and can aid in the analysis and understanding of complex phenotypes linked to stress response in rice.

Abstract

Crowdfunding is an efficient method for raising funds for projects. When used for non-excludable public projects, the process is termed Civic Crowdfunding (CC) and is an active research area. Researchers have analyzed CC in game-theoretic settings assuming that agents are interested in (and contribute to) a single public project. Gen- eralizing the existing single project theory to determine agents’ equilibrium contributions for multiple projects is non-trivial – espe- cially with budget-constrained agents. This work hypothesizes that the agents can learn their equilibrium contributions with repeated participation in multi-project CC. We model CC as a game to vali- date the hypothesis and build an RL-based simulator: EqC-Learner. We first show that EqC-Learner learns a policy that mimics equi- librium contributions in a single project case for the existing CC mechanisms. To validate EqC-Learner for the multi-project case, we present certain theoretical results for the general multi-project case. Via extensive simulation-based experiments, we show that the learned contributions in EqC-Learner follow all the available theo- retical analysis. Thus, we believe that such an RL-based simulator can learn equilibrium contributions for the general multi-project CC mechanism

Abstract

Smart cities play a vital role in limiting the ill-effects of rapid urbanization on the environment without compromising on benefits such as improving infrastructure, standard of living, and productivity. However, the collection, storage, and sharing of data from the plethora of sensor networks in a typical smart city deployment warrants a well-defined data platform architecture. In this paper, we propose a multi layer architecture compliant with the oneM2M standards and the Indian Urban Data Exchange (IUDX) framework. The proposed architecture consists of Data Monitoring (DML), Data Storage (DSL), and Data Exchange (DEL) layers. The DML employs oneM2M as the middleware platform to achieve interoperability. The DSL uses a multi-tenant architecture with multiple logical databases, enabling efficient and reliable data management. The DEL utilizes standard data schemas and open APIs of IUDX to avoid data silos, and enables secure data sharing. Further, we present a proof-of-concept implementation of our architecture deployed in a university campus using OM2M, PostgreSQL, and Django. Finally, simulations mimicking real-time data insertion and retrieval showed that the DML can handle 600 concurrent users with an average latency under 100 milli seconds. The DSL improved the latency compared to a single database architecture and the DEL could handle 100 concurrent users with zero failed requests.

Abstract

Transformers, which were introduced for solving the task of machine translation, have expanded their utility in multiple domains. A recent application of transformers is in solving elementary mathematics problems. In this paper, we use a hybrid tokenization technique for encoding the mathematics and science problems and answers, which is used to train the transformer. We compare the performance of our tokenization with that of the char-to-char tokenzation in solving various types of mathematics and science problems. We discuss the accuracy, memory usage, and time to train the model with proposed tokenization. The proposed tokenization shows higher accuracy for some problems, and requires lesser memory compared to char-to-char tokenization. We propose an extended dataset of science and mathematics problems that consists of billions of samples in questionanswer format in raw text. Code and Dataset: https: //github.com/misterpawan/scimat2

Abstract

Locomotion in a virtual environment within a limited physical space is a complex activity. There exist established techniques to support limitless natural walking in virtual environments. These include Redirected walking, Dynamic path generation, and Walk-Inplace technique, etc. PragPal is one such limitless path generation technique that supports natural walking in virtual environments. It is a novel software-based non-haptic locomotion technique. In this paper, we detail the enhancements to the existing PragPal path generation technique that addresses underlying issues in the technique like (1) path collision at angular turns, (2) effective usage of the physical play area, and (3) the ability to set path-width during path turns.