Abstract

In this paper, we study an interesting combination of sleeping and combinatorial stochastic bandits. In the mixed model studied here, at each discrete time instant, an arbitrary availability set is generated from a fixed set of base arms. An algorithm can select a subset of arms from the availability set (sleeping bandits) and receive the corresponding reward along with semi-bandit feedback (combinatorial bandits). We adapt the well-known CUCB algorithm in the sleeping combinatorial bandits setting and refer to it as CS-UCB. We prove — under mild smoothness conditions — that the CS-UCB algorithm achieves an O(log(T)) instance-dependent regret guarantee. We further prove that (i) when the range of the rewards is bounded, the regret guarantee of CS-UCB algorithm is O( p T log(T)) and (ii) the instance-independent regret is O( 3 q T 2 log(T)) in a general setting. Our results are quite general and hold under general environments — such as non-additive reward functions, volatile arm availability, a variable number of base-arms to be pulled — arising in practical applications. We validate the proven theoretical guarantees through experiments.

Abstract

Electing democratic representatives via voting has been a common mechanism since the 17th century. However, these mechanisms raise concerns about fairness, privacy, vote concealment, fair calculations of tally, and proxies voting on their behalf for the voters. Ballot voting, and in recent times, electronic voting via electronic voting machines (EVMs) improves fairness by relying on centralized trust. Homomorphic encryption-based voting protocols also assure fairness but cannot scale to large scale elections such as presidential elections. In this paper, we leverage the blockchain technology of distributing trust to propose a smart contract-based protocol, namely, FASTEN. There are many existing protocols for voting using smart contracts. We observe that these either are not scalable or leak the vote tally during the voting stage, i.e., do not provide vote concealment. In contrast, we show that FASTEN preserves voter’s privacy ensures vote concealment, immutability, and avoids double voting. We prove that the probability of privacy breaches is negligibly small. Further, our cost analysis of executing FASTEN over Ethereum is comparable to most of the existing cost of elections.

Abstract

We explore the class of problems where a central planner needs to select a subset of agents, each with different quality and cost. The planner wants to maximize its utility while ensuring that the average quality of the selected agents is above a certain threshold. When the agents’ quality is known, we formulate our problem as an integer linear program (ILP) and propose a deterministic algorithm, namely DPSS that provides an exact solution to our ILP. We then consider the setting when the qualities of the agents are unknown. We model this as a Multi-Arm Bandit (MAB) problem and propose DPSS-UCB to learn the qualities over multiple rounds. We show that after a certain number of rounds, τ , DPSS-UCB outputs a subset of agents that satisfy the average quality constraint with a high probability. Next, we provide bounds on τ and prove that after τ rounds, the algorithm incurs a regret of O(ln T), where T is the total number of rounds. We further illustrate the efficacy of DPSS-UCB through simulations. To overcome the computational limitations of DPSS, we propose a polynomial-time greedy algorithm, namely GSS, that provides an approximate solution to our ILP. We also compare the performance of DPSS and GSS through experiments.

Abstract

Blockchain-based Distributed Ledgers (DLs) promise to transform the existing financial system by making it truly democratic. In the past decade, blockchain technology has seen many novel applications ranging from the banking industry to real estate. However, in order to be adopted universally, blockchain systems must be scalable to support a high volume of transactions. As we increase the throughput of the DL system, the underlying peer-to-peer network might face multiple levels of challenges to keep up with the requirements. Due to varying network capacities, the slower nodes would be at a relative disadvantage compared to the faster ones, which could negatively impact their revenue. In order to quantify their relative advantage or disadvantage, we introduce two measures of network fairness, 푝푓 , the probability of frontrunning and 훼푓 , the publishing fairness. We show that as we scale the blockchain, both these measures deteriorate, implying that the slower nodes face a disadvantage at higher throughputs. It results in the faster nodes getting more than their fair share of the reward while the slower nodes (slow in terms of network quality) get less. Thus, fairness and scalability in blockchain systems do not go hand in hand. In a setting with rational miners, lack of fairness causes miners to deviate from the “longest chain rule” or undercut, which would reduce the blockchain’s resilience against byzantine adversaries. Hence, fairness is not only a desirable property for a blockchain system but also essential for the security of the blockchain and any scalable blockchain protocol proposed must ensure fairness.

Abstract

—Music has the power to evoke intense emotional experiences and regulate the mood of an individual. With the advent of online streaming services, research in music recommendation services has seen tremendous progress. Modern methods leveraging the listening histories of users for session-based song recommendations have overlooked the significance of features extracted from lyrics and acoustic content. We address the task of song prediction through multiple modalities, including tags, lyrics, and acoustic content. In this paper, we propose a novel deep learning approach by refining Attentive Neural Networks using representations derived via a Transformer model for lyrics and Variational Autoencoder for acoustic features. Our model achieves significant improvement in performance over existing state-of-the-art models using lyrical and acoustic features alone. Furthermore, we conduct a study to investigate the impact of users’ psychological health on our model’s performance. Index Terms—Music Recommend

Abstract

The use of in situ hyperspectral reflectance and bio-physical measurements has been increasing in forestry. Due to limited physical accessibility in a forest environment, most of the reflectance measurements of trees are acquired at a leaf or bunch of leaves level. A few radiative transfer models are available for upscaling leaf spectra to canopy level. While these models are sophisticated, they retrieve canopy spectra based on certain assumptions. We propose ‘semi-empirical model for upscaling leaf spectra (SEMULS)’ which upscales in situ leaf spectra to canopy level based on the relationship between leaf spectra and its bio-physical parameters. The performance of the model has been quantitatively validated by comparing the upscaled canopy spectra with spectra from – CHRIS hyperspectral imagery acquired concurrently and from the PROSAIL model. Results indicate that the SEMULS retrievals are …

Abstract

Generation of spatial profiles of airborne volcanic ash that is spread at synoptic scales is a problem that directly impacts lives and properties. Robust algorithms are needed to model the distribution using sparse data sampled in the neighborhood of an erupting volcano. Existing Numerical Weather Prediction (NWP) algorithms model the dispersion at coarser spatial resolutions. In this study, we evaluate a geospatial interpolation technique called Kriging [1] to generate prediction and error surfaces. Location and temperature values of ash from 2010 Icelandic eruption were spatially autocorrelated using a stochastic kriging method, known as Empirical Bayesian Kriging (EBK) [7]. The EBK estimates were rigorously validated against NWP for regions with varying sample densities. Subsequently, a method to generate an accurate overlay map using EBK estimates to augment NWP outputs is proposed to aid in …

Abstract

This paper presents the application of computer vision and machine learning to autonomous approach and landing and taxiing for an air vehicle. Recently, there has been growing interest in developing unmanned aircraft systems (UAS). We present a system and method that uses pattern recognition which aids the landing of a UAS and enhances the human-crewed air vehicle landing. Auto-landing systems based on the Instrument Landing System (ILS) have already proven their importance through decades. The auto-land systems work in conjunction with a radio altimeter, ILS, MLS, or GNSS. Closer to the runway, both under VFR and IFR, pilots are expected to rely on visual references for landing. Modern systems like HUD or CVS allow a trained pilot to manually fly the aircraft using guidance cues from the flight guidance system. Notwithstanding the type of landing and instruments used, typically, Pilots are expected to have the runway threshold markings, aiming point, displacement arrows, and touch down markings/lights insight before Minimum Decision Altitude (MDA). Imaging sensors are the essential standard equipment in crewed and crewless aerial vehicles that are widely used during the landing maneuver. In this method, a dataset of visual objects from satellite images is subjected to pattern recognition training. This trained system learns and

Abstract

We, the people’ is the most popular phrase from the constitutions. In spite of the fact that the number of countries including preamble as part of their constitution has been on the rise, preambles have received scant attention in academia. The importance of preambles has been established in multiple studies yet preambles have been looked at in isolation from socio-economic-environmental contexts. Our article attempts to present a unique insight by correlating preambles with the socio-economicenvironmental and infrastructural context within which they exist. It explores whether these correlations exist and if they do with which features and to what extent and the possibility of a causal link. We pursue a statistical study between various indicators that reflect the growth of a country and the presence or absence of various elements in preambles across the world. Our study finds that correlations exist between the economic-social-environmental and infrastructural context of a nation-state and different elements in their preambles. Our study rigorously engages with patterns in development indicators across years to provide correlational insights into the role of preambles not just as a dormant reference but as active fragments of the socio-political-economic reality of a nation-state. We hope our article establishes grounds for a further study of the manner in which preambles and the nonpolitical aspects of a nation-state can engage with each other.

Abstract

Individual device loads and energy consumption feedback is one of the important approaches for pursuing users to save energy in residences. This can help in identifying faulty devices and wasted energy by devices when left On unused. The main challenge is to identity and estimate the energy consumption of individual devices without intrusive sensors on each device. Non-intrusive load monitoring (NILM) or energy disaggregation, is a blind source separation problem which requires a system to estimate the electricity usage of individual appliances from the aggregated household energy consumption. In this paper, we propose a novel deep neural network-based approach for performing load disaggregation on low frequency power data obtained from residential households. We combine a series of one-dimensional Convolutional Neural Networks and Long Short Term Memory (1D CNN-LSTM) to extract features that can identify active appliances and retrieve their power consumption given the aggregated household power value. We used CNNs to extract features from main readings in a given time frame and then used those features to classify if a given appliance is active at that time period or not. Following that, the extracted features are used to model a generation problem using LSTM. We train the LSTM to generate the disaggregated energy consumption of a particular appliance. Our neural network is capable of generating detailed feedback of demandside, providing vital insights to the end-user about their electricity consumption. The algorithm was designed for low power offline devices such as ESP32. Empirical calculations show that our model outperforms the state-of-the-art on the Reference Energy Disaggregation Dataset (REDD)